| /external/llvm/lib/Analysis/ |
| SparsePropagation.cpp | 122 SmallVectorImpl<bool> &Succs,
124 Succs.resize(TI.getNumSuccessors());
129 Succs[0] = true;
142 Succs[0] = Succs[1] = true;
153 Succs[0] = Succs[1] = true;
158 Succs[C->isNullValue()] = true;
165 Succs[0] = Succs[1] = true
[all...] |
| /external/llvm/lib/CodeGen/ |
| LatencyPriorityQueue.cpp | 77 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
93 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
| ScheduleDAG.cpp | 80 for (SmallVectorImpl<SDep>::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...] |
| TailDuplication.cpp | 105 SmallSetVector<MachineBasicBlock*, 8> &Succs);
216 SmallSetVector<MachineBasicBlock*, 8> Succs(MBB->succ_begin(),
234 UpdateSuccessorsPHIs(MBB, isDead, TDBBs, Succs);
466 SmallSetVector<MachineBasicBlock*,8> &Succs) {
467 for (SmallSetVector<MachineBasicBlock*, 8>::iterator SI = Succs.begin(),
468 SE = Succs.end(); SI != SE; ++SI) {
688 SmallPtrSet<MachineBasicBlock*, 8> Succs(TailBB->succ_begin(),
700 if (bothUsedInPHI(*PredBB, Succs))
[all...] |
| MachineSink.cpp | 545 auto Succs = AllSuccessors.find(MBB);
546 if (Succs != AllSuccessors.end())
547 return Succs->second;
|
| ScheduleDAGInstrs.cpp | 674 for (SUnit::const_succ_iterator I = SUb->Succs.begin(), E = SUb->Succs.end();
707 for (SUnit::const_succ_iterator J = (*I)->Succs.begin(),
708 JE = (*I)->Succs.end(); J != JE; ++J)
[all...] |
| PostRASchedulerList.cpp | 474 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) {
178 unsigned succ_size() const { return Succs.size(); }
180 bool succ_empty() const { return Succs.empty(); }
183 bool isSink() const { return Succs.getFlag(); }
217 succ_iterator succ_begin() { return Succs.begin(); }
218 succ_iterator succ_end() { return Succs.end(); }
240 void replaceSuccessor(ExplodedNode *node) { Succs.replaceNode(node); }
|
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyCFGStackify.cpp | 107 SmallVector<MachineBasicBlock *, 0> Succs;
121 : MBB(MBB), Succs(MBB->successors()) {
129 Succs.begin(), Succs.end(),
187 SmallVectorImpl<MachineBasicBlock *> &Succs = Entry.Succs;
188 if (!Succs.empty()) {
189 MachineBasicBlock *Succ = Succs.pop_back_val();
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ResourcePriorityQueue.cpp | 110 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
147 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
235 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
274 for (SUnit::const_succ_iterator I = Packet[i]->Succs.begin(),
275 E = Packet[i]->Succs.end(); I != E; ++I) {
525 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end()
[all...] |
| ScheduleDAGVLIW.cpp | 142 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
| ScheduleDAGFast.cpp | 194 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();
541 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");
|
| ScheduleDAGRRList.cpp | 740 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
851 for (auto &Succ : SU->Succs) {
865 for (auto &Succ2 : SU->Succs) {
[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) {
251 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
451 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
512 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
| HexagonVLIWPacketizer.cpp | 806 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) {
807 auto &Dep = PacketSU->Succs[i];
871 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) {
872 auto Dep = PacketSU->Succs[i];
[all...] |
| /external/clang/include/clang/Analysis/ |
| CFG.h | 474 AdjacentBlocks Succs;
493 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false),
541 succ_iterator succ_begin() { return Succs.begin(); }
542 succ_iterator succ_end() { return Succs.end(); }
543 const_succ_iterator succ_begin() const { return Succs.begin(); }
544 const_succ_iterator succ_end() const { return Succs.end(); }
546 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); }
547 succ_reverse_iterator succ_rend() { return Succs.rend(); }
548 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); }
549 const_succ_reverse_iterator succ_rend() const { return Succs.rend();
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| PruneEH.cpp | 267 std::vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB));
269 for (unsigned i = 0, e = Succs.size(); i != e; ++i)
270 Succs[i]->removePredecessor(BB);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 221 V->Succs.addNode(this, G);
427 for (ExplodedNode::succ_iterator I = N->Succs.begin(), E = N->Succs.end();
|
| /external/llvm/include/llvm/Analysis/ |
| SparsePropagation.h | 191 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 274 // Preds/Succs - The SUnits before/after us in the graph.
276 SmallVector<SDep, 4> Succs; // All sunit successors.
288 unsigned NumSuccsLeft; // # of succs not scheduled.
290 unsigned WeakSuccsLeft; // # of weak succs not scheduled.
467 for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i)
468 if (Succs[i].getSUnit() == N)
|
| /external/llvm/lib/Transforms/Scalar/ |
| SCCP.cpp | 445 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs);
527 SmallVectorImpl<bool> &Succs) {
528 Succs.resize(TI.getNumSuccessors());
531 Succs[0] = true;
541 Succs[0] = Succs[1] = true;
546 Succs[CI->isZero()] = true;
552 Succs.assign(TI.getNumSuccessors(), true);
558 Succs[0] = true;
567 Succs.assign(TI.getNumSuccessors(), true)
[all...] |
| /external/llvm/lib/Target/AMDGPU/ |
| R600Packetizer.cpp | 200 for (unsigned i = 0, e = SUJ->Succs.size(); i < e; ++i) {
201 const SDep &Dep = SUJ->Succs[i];
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 120 const UniqueVector<BasicBlock*>&Succs);
714 const UniqueVector<BasicBlock *> &Succs) {
719 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]].
720 size_t TableSize = Succs.size() * Preds.size();
739 EdgeTable[((Succs.idFor(Succ) - 1) * Preds.size()) +
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| CodeExtractor.cpp | 753 std::vector<BasicBlock*> Succs(succ_begin(codeReplacer),
755 for (unsigned i = 0, e = Succs.size(); i != e; ++i)
756 for (BasicBlock::iterator I = Succs[i]->begin(); isa<PHINode>(I); ++I) {
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 203 SmallVector<BasicBlock *, 2> Succs;
306 edge_iterator succ_begin() const { return Succs.begin(); }
307 edge_iterator succ_end() const { return Succs.end(); }
309 void addSucc(BasicBlock *Succ) { Succs.push_back(Succ); }
312 bool isExit() const { return Succs.empty(); }
[all...] |
