| /external/llvm/lib/CodeGen/ |
| ScheduleDAG.cpp | 67 for (SmallVectorImpl<SDep>::iterator I = Preds.begin(), E = Preds.end();
121 Preds.push_back(D);
135 for (SmallVectorImpl<SDep>::iterator I = Preds.begin(), E = Preds.end();
144 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!");
146 Preds.erase(I);
201 for (SUnit::const_pred_iterator I = SU->Preds.begin(),
202 E = SU->Preds.end(); I != E; ++I) {
242 for (SUnit::const_pred_iterator I = Cur->Preds.begin()
[all...] |
| LatencyPriorityQueue.cpp | 58 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
106 if (SU->isAvailable) return; // All preds scheduled.
|
| TailDuplication.cpp | 165 SmallSetVector<MachineBasicBlock*, 8> Preds(MBB->pred_begin(),
171 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(),
172 PE = Preds.end(); PI != PE; ++PI) {
192 if (CheckExtra && !Preds.count(PHIBB)) {
690 SmallVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(),
693 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(),
694 PE = Preds.end(); PI != PE; ++PI) {
780 SmallSetVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(),
782 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(),
783 PE = Preds.end(); PI != PE; ++PI)
[all...] |
| AggressiveAntiDepBreaker.cpp | 255 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
271 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
873 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(),
874 PE = PathSU->Preds.end(); P != PE; ++P) {
882 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(),
883 PE = PathSU->Preds.end(); P != PE; ++P)
[all...] |
| CriticalAntiDepBreaker.cpp | 133 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
562 for (SUnit::const_pred_iterator P = CriticalPathSU->Preds.begin(),
563 PE = CriticalPathSU->Preds.end(); P != PE; ++P)
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 53 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
58 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
113 SmallVector<BlkT*, 10> Preds;
116 Preds.clear();
117 Traits::FindPredecessorBlocks(Info->BB, &Preds);
118 Info->NumPreds = Preds.size();
120 Info->Preds = nullptr;
122 Info->Preds = static_cast<BBInfo**>
127 BlkT *Pred = Preds[p];
132 Info->Preds[p] = BBMapBucket.second
[all...] |
| LoopVersioning.h | 104 SCEVUnionPredicate Preds;
|
| BasicBlockUtils.h | 196 /// Preds array. The new block is given a suffix of 'Suffix'. Returns new basic
197 /// block to which predecessors from Preds are now pointing.
208 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds,
216 /// new basic blocks gets the predecessors listed in Preds. The other basic
227 ArrayRef<BasicBlock *> Preds,
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCHazardRecognizers.cpp | 40 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) {
41 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit());
45 if (!SU->Preds[i].isNormalMemory() && !SU->Preds[i].isBarrier())
49 if (SU->Preds[i].getSUnit() == CurGroup[j])
66 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) {
67 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit());
71 if (SU->Preds[i].isCtrl())
75 if (SU->Preds[i].getSUnit() == CurGroup[j])
|
| PPCCTRLoops.cpp | 609 SmallVector<MachineBasicBlock *, 8> Preds;
645 if (!CheckPreds && Preds.empty())
660 Preds.push_back(*PI);
664 MBB = Preds.pop_back_val();
669 } while (!Preds.empty());
|
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 317 ArrayRef<BasicBlock *> Preds,
334 for (ArrayRef<BasicBlock *>::iterator i = Preds.begin(), e = Preds.end();
338 // If we need to preserve LCSSA, determine if any of the preds is a loop
345 // If we need to preserve LoopInfo, note whether any of the preds crosses
366 i = Preds.begin(), e = Preds.end(); i != e; ++i) {
394 ArrayRef<BasicBlock *> Preds, BranchInst *BI,
397 SmallPtrSet<BasicBlock *, 16> PredSet(Preds.begin(), Preds.end())
[all...] |
| FlattenCFG.cpp | 135 SmallPtrSet<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB));
136 for (SmallPtrSetIterator<BasicBlock *> PI = Preds.begin(), PE = Preds.end();
153 if (UnCondBlock || !PP || (Preds.count(PP) == 0) ||
169 if (PP && Preds.count(PP)) {
206 if (Preds.count(PS) == 0) {
|
| BreakCriticalEdges.cpp | 81 /// new PHIs, as needed. Preds is a list of preds inside the loop, SplitBB
84 static void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds,
105 PN->getType(), Preds.size(), "split",
107 for (unsigned i = 0, e = Preds.size(); i != e; ++i)
108 NewPN->addIncoming(V, Preds[i]);
|
| PromoteMemoryToRegister.cpp | 732 // Get the preds for BB.
733 SmallVector<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB));
738 std::sort(Preds.begin(), Preds.end());
741 // them from the Preds list.
743 // Do a log(n) search of the Preds list for the entry we want.
745 Preds.begin(), Preds.end(), SomePHI->getIncomingBlock(i));
746 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i) &&
750 Preds.erase(EntIt)
[all...] |
| SSAUpdater.cpp | 242 /// FindPredecessorBlocks - Put the predecessors of Info->BB into the Preds
243 /// vector, set Info->NumPreds, and allocate space in Info->Preds.
245 SmallVectorImpl<BasicBlock*> *Preds) {
250 Preds->append(SomePhi->block_begin(), SomePhi->block_end());
253 Preds->push_back(*PI);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 220 Preds.addNode(V, G);
372 if (N->Preds.empty()) {
378 WL1.append(N->Preds.begin(), N->Preds.end());
406 if (N->Preds.empty())
414 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end();
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 117 /// Preds - The predecessors of this node.
118 NodeGroup Preds;
179 unsigned pred_size() const { return Preds.size(); }
181 bool pred_empty() const { return Preds.empty(); }
207 pred_iterator pred_begin() { return Preds.begin(); }
208 pred_iterator pred_end() { return Preds.end(); }
241 void replacePredecessor(ExplodedNode *node) { Preds.replaceNode(node); }
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ResourcePriorityQueue.cpp | 72 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
157 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
217 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
509 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
544 HorizontalVerticalBalance -= (SU->Preds.size() - numberCtrlPredInSU(SU));
580 if (SU->isAvailable) return; // All preds scheduled
[all...] |
| ScheduleDAGRRList.cpp | 527 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
809 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
[all...] |
| ScheduleDAGFast.cpp | 163 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
285 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
357 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
482 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 274 // Preds/Succs - The SUnits before/after us in the graph.
275 SmallVector<SDep, 4> Preds; // All sunit predecessors.
285 unsigned NumPreds; // # of SDep::Data preds.
287 unsigned NumPredsLeft; // # of preds not scheduled.
289 unsigned WeakPredsLeft; // # of weak preds not scheduled.
459 for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i)
460 if (Preds[i].getSUnit() == N)
632 return Node->Preds[Operand].getSUnit();
646 return SUnitIterator(N, (unsigned)N->Preds.size());
659 return Node->Preds[Operand]
[all...] |
| /external/clang/include/clang/Analysis/ |
| CFG.h | 473 AdjacentBlocks Preds;
493 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false),
531 pred_iterator pred_begin() { return Preds.begin(); }
532 pred_iterator pred_end() { return Preds.end(); }
533 const_pred_iterator pred_begin() const { return Preds.begin(); }
534 const_pred_iterator pred_end() const { return Preds.end(); }
536 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); }
537 pred_reverse_iterator pred_rend() { return Preds.rend(); }
538 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); }
539 const_pred_reverse_iterator pred_rend() const { return Preds.rend();
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 232 for (SUnit::succ_iterator I = SU->Preds.begin(), E = SU->Preds.end();
433 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
518 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
|
| /external/llvm/lib/Transforms/Scalar/ |
| StructurizeCFG.cpp | 529 BBPredicates &Preds = Loops ? LoopPreds[SuccFalse] : Predicates[SuccTrue];
535 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end();
746 BBPredicates &Preds = Predicates[Node->getEntry()];
747 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end();
758 BBPredicates &Preds = Predicates[Node->getEntry()];
765 for (BBPredicates::iterator I = Preds.begin(), E = Preds.end();
|
| /external/llvm/lib/Target/AMDGPU/ |
| SIAnnotateControlFlow.cpp | 310 std::vector<BasicBlock*> Preds;
313 Preds.push_back(*PI);
315 BB = llvm::SplitBlockPredecessors(BB, Preds, "endcf.split", DT, LI, false);
|
