| /external/llvm/lib/Analysis/ |
| H A D | SparsePropagation.cpp | 121 SmallVectorImpl<bool> &Succs,
123 Succs.resize(TI.getNumSuccessors());
128 Succs[0] = true;
141 Succs[0] = Succs[1] = true;
152 Succs[0] = Succs[1] = true;
157 Succs[C->isNullValue()] = true;
164 Succs[0] = Succs[
120 getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs, bool AggressiveUndef) argument
[all...] |
| /external/llvm/tools/llvm-objdump/ |
| H A D | MCFunction.h | 51 SetTy Succs; member in class:llvm::MCBasicBlock
56 succ_iterator succ_begin() const { return Succs.begin(); }
57 succ_iterator succ_end() const { return Succs.end(); }
59 bool contains(uint64_t Addr) const { return Succs.count(Addr); }
62 void addSucc(uint64_t Addr) { Succs.insert(Addr); }
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | ExplodedGraph.h | 120 /// Succs - The successors of this node.
121 NodeGroup Succs; member in class:clang::ento::ExplodedNode
127 : Location(loc), State(state), Succs(IsSink) {
177 unsigned succ_size() const { return Succs.size(); }
179 bool succ_empty() const { return Succs.empty(); }
182 bool isSink() const { return Succs.getFlag(); }
212 succ_iterator succ_begin() { return Succs.begin(); }
213 succ_iterator succ_end() { return Succs.end(); }
235 void replaceSuccessor(ExplodedNode *node) { Succs.replaceNode(node); }
|
| /external/llvm/lib/CodeGen/ |
| H A D | TailDuplication.cpp | 100 SmallSetVector<MachineBasicBlock*, 8> &Succs);
201 SmallSetVector<MachineBasicBlock*, 8> Succs(MBB->succ_begin(),
219 UpdateSuccessorsPHIs(MBB, isDead, TDBBs, Succs);
456 SmallSetVector<MachineBasicBlock*,8> &Succs) {
457 for (SmallSetVector<MachineBasicBlock*, 8>::iterator SI = Succs.begin(),
458 SE = Succs.end(); SI != SE; ++SI) {
643 SmallPtrSet<MachineBasicBlock*, 8> Succs(BB.succ_begin(), BB.succ_end());
668 SmallPtrSet<MachineBasicBlock*, 8> Succs(TailBB->succ_begin(),
680 if (bothUsedInPHI(*PredBB, Succs))
454 UpdateSuccessorsPHIs(MachineBasicBlock *FromBB, bool isDead, SmallVector<MachineBasicBlock*, 8> &TDBBs, SmallSetVector<MachineBasicBlock*,8> &Succs) argument
|
| H A D | MachineVerifier.cpp | 124 BlockSet Preds, Succs; member in struct:__anon8692::MachineVerifier::BBInfo
457 MInfo.Succs.insert(I->succ_begin(), I->succ_end());
458 if (MInfo.Succs.size() != I->succ_size())
511 if (!MBBInfoMap[*I].Succs.count(MBB)) {
|
| /external/llvm/include/llvm/CodeGen/ |
| H A D | ScheduleDAG.h | 257 // Preds/Succs - The SUnits before/after us in the graph.
259 SmallVector<SDep, 4> Succs; // All sunit successors. member in class:llvm::SUnit
430 for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i)
431 if (Succs[i].getSUnit() == N)
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| H A D | GCOVProfiling.cpp | 87 const UniqueVector<BasicBlock *> &Succs);
535 const UniqueVector<BasicBlock *> &Succs) {
543 Int64PtrTy, Succs.size() * Preds.size());
545 Constant **EdgeTable = new Constant*[Succs.size() * Preds.size()];
547 for (int i = 0, ie = Succs.size() * Preds.size(); i != ie; ++i)
560 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) +
567 ArrayRef<Constant*> V(&EdgeTable[0], Succs.size() * Preds.size());
531 buildEdgeLookupTable( Function *F, GlobalVariable *Counters, const UniqueVector<BasicBlock *> &Preds, const UniqueVector<BasicBlock *> &Succs) argument
|
| /external/llvm/lib/Transforms/Scalar/ |
| H A D | LoopUnswitch.cpp | 1018 SmallVector<BasicBlock*, 4> Succs; local
1020 Succs.push_back(TI->getSuccessor(i));
1025 array_pod_sort(Succs.begin(), Succs.end());
1026 Succs.erase(std::unique(Succs.begin(), Succs.end()), Succs.end());
1035 for (unsigned i = 0; i != Succs.size(); ++i)
1036 if (pred_begin(Succs[
[all...] |
| H A D | SCCP.cpp | 449 void getFeasibleSuccessors(TerminatorInst &TI, SmallVector<bool, 16> &Succs);
523 SmallVector<bool, 16> &Succs) {
524 Succs.resize(TI.getNumSuccessors());
527 Succs[0] = true;
537 Succs[0] = Succs[1] = true;
542 Succs[CI->isZero()] = true;
548 Succs[0] = Succs[1] = true;
554 Succs[
522 getFeasibleSuccessors(TerminatorInst &TI, SmallVector<bool, 16> &Succs) argument
[all...] |
| H A D | ObjCARC.cpp | 1502 /// Preds, Succs - Effective successors and predecessors of the current
1505 SmallVector<BasicBlock *, 2> Succs; member in class:__anon9126::BBState
1573 edge_iterator succ_begin() { return Succs.begin(); }
1574 edge_iterator succ_end() { return Succs.end(); }
1576 void addSucc(BasicBlock *Succ) { Succs.push_back(Succ); }
1579 bool isExit() const { return Succs.empty(); }
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | SelectionDAGISel.cpp | 1351 SmallVector<MachineBasicBlock *, 2> Succs; local
1352 Succs.push_back(SDB->SwitchCases[i].TrueBB);
1354 Succs.push_back(SDB->SwitchCases[i].FalseBB);
1370 for (unsigned i = 0, e = Succs.size(); i != e; ++i) {
1371 FuncInfo->MBB = Succs[i];
|
| /external/llvm/lib/Transforms/Utils/ |
| H A D | SimplifyCFG.cpp | 3310 SmallPtrSet<Value *, 8> Succs; local
3313 if (!Dest->hasAddressTaken() || !Succs.insert(Dest)) {
|