| /external/llvm/tools/llvm-objdump/ |
| MCFunction.h | 51 SetTy Succs;
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/llvm/lib/Analysis/ |
| 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[1] = true
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAGEmit.cpp | 46 for (SUnit::const_succ_iterator II = SU->Succs.begin(),
47 EE = SU->Succs.end(); II != EE; ++II) {
|
| LatencyPriorityQueue.cpp | 76 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
92 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
| ScheduleDAG.cpp | 114 N->Succs.push_back(P);
135 for (SmallVector<SDep, 4>::iterator II = N->Succs.begin(),
136 EE = N->Succs.end(); II != EE; ++II)
139 N->Succs.erase(II);
142 assert(FoundSucc && "Mismatching preds / succs lists!");
175 for (SUnit::const_succ_iterator I = SU->Succs.begin(),
176 E = SU->Succs.end(); I != E; ++I) {
265 for (SUnit::const_succ_iterator I = Cur->Succs.begin(),
266 E = Cur->Succs.end(); I != E; ++I) {
299 dbgs() << " # succs left : " << NumSuccsLeft << "\n"
[all...] |
| TailDuplication.cpp | 96 SmallSetVector<MachineBasicBlock*, 8> &Succs);
191 SmallSetVector<MachineBasicBlock*, 8> Succs(MBB->succ_begin(),
209 UpdateSuccessorsPHIs(MBB, isDead, TDBBs, Succs);
444 SmallSetVector<MachineBasicBlock*,8> &Succs) {
445 for (SmallSetVector<MachineBasicBlock*, 8>::iterator SI = Succs.begin(),
446 SE = Succs.end(); SI != SE; ++SI) {
632 SmallPtrSet<MachineBasicBlock*, 8> Succs(BB.succ_begin(), BB.succ_end());
657 SmallPtrSet<MachineBasicBlock*, 8> Succs(TailBB->succ_begin(),
669 if (bothUsedInPHI(*PredBB, Succs))
[all...] |
| IfConversion.cpp | [all...] |
| PostRASchedulerList.cpp | 568 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
| VirtRegRewriter.cpp | 461 SmallVectorImpl<MachineBasicBlock *> &Succs){
466 Succs.push_back(SuccMBB);
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 115 /// Succs - The successors of this node.
116 NodeGroup Succs;
166 unsigned succ_size() const { return Succs.size(); }
168 bool succ_empty() const { return Succs.empty(); }
171 bool isSink() const { return Succs.getFlag(); }
172 void markAsSink() { Succs.setFlag(); }
198 succ_iterator succ_begin() { return Succs.begin(); }
199 succ_iterator succ_end() { return Succs.end(); }
221 void replaceSuccessor(ExplodedNode *node) { Succs.replaceNode(node); }
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopUnswitch.cpp | [all...] |
| SCCP.cpp | 454 void getFeasibleSuccessors(TerminatorInst &TI, SmallVector<bool, 16> &Succs);
555 SmallVector<bool, 16> &Succs) {
556 Succs.resize(TI.getNumSuccessors());
559 Succs[0] = true;
569 Succs[0] = Succs[1] = true;
574 Succs[CI->isZero()] = true;
580 Succs[0] = Succs[1] = true;
586 Succs[0] = true
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGFast.cpp | 188 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
290 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
358 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
395 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
530 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");
|
| ScheduleDAGList.cpp | 131 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
| ScheduleDAGRRList.cpp | 623 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
689 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
868 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
946 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
[all...] |
| SelectionDAGISel.cpp | [all...] |
| /external/clang/include/clang/Analysis/ |
| CFG.h | 334 AdjacentBlocks Succs;
350 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false) {}
398 succ_iterator succ_begin() { return Succs.begin(); }
399 succ_iterator succ_end() { return Succs.end(); }
400 const_succ_iterator succ_begin() const { return Succs.begin(); }
401 const_succ_iterator succ_end() const { return Succs.end(); }
403 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); }
404 succ_reverse_iterator succ_rend() { return Succs.rend(); }
405 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); }
406 const_succ_reverse_iterator succ_rend() const { return Succs.rend();
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| PruneEH.cpp | 251 std::vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB));
253 for (unsigned i = 0, e = Succs.size(); i != e; ++i)
254 Succs[i]->removePredecessor(BB);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 143 V->Succs.addNode(this, G);
364 for (ExplodedNode **I=N->Succs.begin(), **E=N->Succs.end(); I!=E; ++I) {
|
| /external/llvm/include/llvm/Analysis/ |
| SparsePropagation.h | 195 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 85 const UniqueVector<BasicBlock *> &Succs);
527 const UniqueVector<BasicBlock *> &Succs) {
532 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]].
535 Int64PtrTy, Succs.size() * Preds.size());
537 Constant **EdgeTable = new Constant*[Succs.size() * Preds.size()];
539 for (int i = 0, ie = Succs.size() * Preds.size(); i != ie; ++i)
552 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) +
559 ArrayRef<Constant*> V(&EdgeTable[0], Succs.size() * Preds.size());
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 236 // Preds/Succs - The SUnits before/after us in the graph.
238 SmallVector<SDep, 4> Succs; // All sunit successors.
250 unsigned NumSuccsLeft; // # of succs not scheduled.
406 for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i)
407 if (Succs[i].getSUnit() == N)
550 /// BuildSchedGraph - Build SUnits and set up their Preds and Succs
|
| /external/llvm/lib/Transforms/Utils/ |
| CodeExtractor.cpp | 727 std::vector<BasicBlock*> Succs(succ_begin(codeReplacer),
729 for (unsigned i = 0, e = Succs.size(); i != e; ++i)
730 for (BasicBlock::iterator I = Succs[i]->begin(); isa<PHINode>(I); ++I) {
|
| SimplifyCFG.cpp | [all...] |
