| /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 | 76 for (SmallVector<SDep, 4>::iterator II = PredSU->Succs.begin(),
77 EE = PredSU->Succs.end(); II != EE; ++II) {
108 N->Succs.push_back(P);
129 for (SmallVector<SDep, 4>::iterator II = N->Succs.begin(),
130 EE = N->Succs.end(); II != EE; ++II)
133 N->Succs.erase(II);
136 assert(FoundSucc && "Mismatching preds / succs lists!");
169 for (SUnit::const_succ_iterator I = SU->Succs.begin(),
170 E = SU->Succs.end(); I != E; ++I) {
259 for (SUnit::const_succ_iterator I = Cur->Succs.begin()
[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();
|
| 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...] |
| MachineSink.cpp | 540 SmallVector<MachineBasicBlock*, 4> Succs(MBB->succ_begin(), MBB->succ_end());
541 std::stable_sort(Succs.begin(), Succs.end(), SuccessorSorter(LI));
542 for (SmallVector<MachineBasicBlock*, 4>::iterator SI = Succs.begin(),
543 E = Succs.end(); SI != E; ++SI) {
|
| ScheduleDAGInstrs.cpp | 645 for (SUnit::const_succ_iterator I = SUb->Succs.begin(), E = SUb->Succs.end();
676 for (SUnit::const_succ_iterator J = (*I)->Succs.begin(),
677 JE = (*I)->Succs.end(); J != JE; ++J)
[all...] |
| MachineScheduler.cpp | 457 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
600 if (I->Succs.empty())
926 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
[all...] |
| IfConversion.cpp | [all...] |
| PostRASchedulerList.cpp | 617 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) {
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/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...] |
| 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();
525 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");
|
| ScheduleDAGVLIW.cpp | 139 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
| ScheduleDAGRRList.cpp | 720 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
827 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
[all...] |
| /external/clang/include/clang/Analysis/ |
| CFG.h | 335 AdjacentBlocks Succs;
354 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false),
403 succ_iterator succ_begin() { return Succs.begin(); }
404 succ_iterator succ_end() { return Succs.end(); }
405 const_succ_iterator succ_begin() const { return Succs.begin(); }
406 const_succ_iterator succ_end() const { return Succs.end(); }
408 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); }
409 succ_reverse_iterator succ_rend() { return Succs.rend(); }
410 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); }
411 const_succ_reverse_iterator succ_rend() const { return Succs.rend();
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopUnswitch.cpp | [all...] |
| 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[0] = true
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 82 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
248 if (Packet[i]->Succs.size() == 0)
250 for (SUnit::const_succ_iterator I = Packet[i]->Succs.begin(),
251 E = Packet[i]->Succs.end(); I != E; ++I) {
325 if (I->Succs.empty())
503 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
701 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end()
[all...] |
| HexagonVLIWPacketizer.cpp | [all...] |
| /external/llvm/lib/Transforms/IPO/ |
| PruneEH.cpp | 250 std::vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB));
252 for (unsigned i = 0, e = Succs.size(); i != e; ++i)
253 Succs[i]->removePredecessor(BB);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 184 V->Succs.addNode(this, G);
410 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/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 87 const UniqueVector<BasicBlock *> &Succs);
535 const UniqueVector<BasicBlock *> &Succs) {
540 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]].
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());
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 257 // Preds/Succs - The SUnits before/after us in the graph.
259 SmallVector<SDep, 4> Succs; // All sunit successors.
271 unsigned NumSuccsLeft; // # of succs not scheduled.
430 for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i)
431 if (Succs[i].getSUnit() == N)
|
