| /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/ |
| ScheduleDAG.cpp | 80 for (SmallVector<SDep, 4>::iterator II = PredSU->Succs.begin(),
81 EE = PredSU->Succs.end(); II != EE; ++II) {
122 N->Succs.push_back(P);
142 SmallVectorImpl<SDep>::iterator Succ = std::find(N->Succs.begin(),
143 N->Succs.end(), P);
144 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!");
145 N->Succs.erase(Succ);
185 for (SUnit::const_succ_iterator I = SU->Succs.begin(),
186 E = SU->Succs.end(); I != E; ++I)
[all...] |
| 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();
|
| MachineSink.cpp | 538 SmallVector<MachineBasicBlock*, 4> Succs(MBB->succ_begin(), MBB->succ_end());
539 std::stable_sort(Succs.begin(), Succs.end(), SuccessorSorter(LI));
540 for (SmallVector<MachineBasicBlock*, 4>::iterator SI = Succs.begin(),
541 E = Succs.end(); SI != E; ++SI) {
|
| 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))
[all...] |
| ScheduleDAGInstrs.cpp | 592 for (SUnit::const_succ_iterator I = SUb->Succs.begin(), E = SUb->Succs.end();
623 for (SUnit::const_succ_iterator J = (*I)->Succs.begin(),
624 JE = (*I)->Succs.end(); J != JE; ++J)
[all...] |
| IfConversion.cpp | [all...] |
| PostRASchedulerList.cpp | 601 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 120 /// Succs - The successors of this node.
121 NodeGroup Succs;
127 : Location(loc), State(state), Succs(IsSink) {
180 unsigned succ_size() const { return Succs.size(); }
182 bool succ_empty() const { return Succs.empty(); }
185 bool isSink() const { return Succs.getFlag(); }
215 succ_iterator succ_begin() { return Succs.begin(); }
216 succ_iterator succ_end() { return Succs.end(); }
238 void replaceSuccessor(ExplodedNode *node) { Succs.replaceNode(node); }
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ResourcePriorityQueue.cpp | 111 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
148 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
236 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
275 for (SUnit::const_succ_iterator I = Packet[i]->Succs.begin(),
276 E = Packet[i]->Succs.end(); I != E; ++I) {
527 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end()
[all...] |
| ScheduleDAGVLIW.cpp | 141 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
| ScheduleDAGFast.cpp | 193 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
295 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
365 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
402 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
535 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");
|
| ScheduleDAGRRList.cpp | 739 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
850 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 66 if (Packet[i]->Succs.size() == 0)
68 for (SUnit::const_succ_iterator I = Packet[i]->Succs.begin(),
69 E = Packet[i]->Succs.end(); I != E; ++I) {
242 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
442 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
505 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
| HexagonVLIWPacketizer.cpp | [all...] |
| /external/clang/include/clang/Analysis/ |
| CFG.h | 367 AdjacentBlocks Succs;
386 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false),
435 succ_iterator succ_begin() { return Succs.begin(); }
436 succ_iterator succ_end() { return Succs.end(); }
437 const_succ_iterator succ_begin() const { return Succs.begin(); }
438 const_succ_iterator succ_end() const { return Succs.end(); }
440 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); }
441 succ_reverse_iterator succ_rend() { return Succs.rend(); }
442 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); }
443 const_succ_reverse_iterator succ_rend() const { return Succs.rend();
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopUnswitch.cpp | [all...] |
| SCCP.cpp | 442 void getFeasibleSuccessors(TerminatorInst &TI, SmallVector<bool, 16> &Succs);
516 SmallVector<bool, 16> &Succs) {
517 Succs.resize(TI.getNumSuccessors());
520 Succs[0] = true;
530 Succs[0] = Succs[1] = true;
535 Succs[CI->isZero()] = true;
541 Succs[0] = Succs[1] = true;
547 Succs[0] = true
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| PruneEH.cpp | 254 std::vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB));
256 for (unsigned i = 0, e = Succs.size(); i != e; ++i)
257 Succs[i]->removePredecessor(BB);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 216 V->Succs.addNode(this, G);
428 for (ExplodedNode::succ_iterator I = N->Succs.begin(), E = N->Succs.end();
|
| /external/llvm/include/llvm/Analysis/ |
| SparsePropagation.h | 195 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 281 // Preds/Succs - The SUnits before/after us in the graph.
283 SmallVector<SDep, 4> Succs; // All sunit successors.
295 unsigned NumSuccsLeft; // # of succs not scheduled.
297 unsigned WeakSuccsLeft; // # of weak succs not scheduled.
465 for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i)
466 if (Succs[i].getSUnit() == N)
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 116 const UniqueVector<BasicBlock*>&Succs);
593 const UniqueVector<BasicBlock *> &Succs) {
598 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]].
599 size_t TableSize = Succs.size() * Preds.size();
618 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) +
|
| /external/llvm/lib/Transforms/Utils/ |
| CodeExtractor.cpp | 752 std::vector<BasicBlock*> Succs(succ_begin(codeReplacer),
754 for (unsigned i = 0, e = Succs.size(); i != e; ++i)
755 for (BasicBlock::iterator I = Succs[i]->begin(); isa<PHINode>(I); ++I) {
|
