| /external/llvm/lib/Transforms/Utils/ |
| BreakCriticalEdges.cpp | 90 /// new PHIs, as needed. Preds is a list of preds inside the loop, SplitBB
93 static void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds,
114 PHINode::Create(PN->getType(), Preds.size(), "split",
117 for (unsigned i = 0, e = Preds.size(); i != e; ++i)
118 NewPN->addIncoming(V, Preds[i]);
321 // Collect all the preds that are inside the loop, and note
322 // whether there are any preds outside the loop.
323 SmallVector<BasicBlock *, 4> Preds;
331 Preds.clear()
[all...] |
| BasicBlockUtils.cpp | 305 ArrayRef<BasicBlock *> Preds,
319 i = Preds.begin(), e = Preds.end(); i != e; ++i) {
322 // If we need to preserve LCSSA, determine if any of the preds is a loop
329 // If we need to preserve LoopInfo, note whether any of the preds crosses
353 i = Preds.begin(), e = Preds.end(); i != e; ++i) {
381 ArrayRef<BasicBlock*> Preds, BranchInst *BI,
392 InVal = PN->getIncomingValueForBlock(Preds[0]);
393 for (unsigned i = 1, e = Preds.size(); i != e; ++i
[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)) {
205 if (Preds.count(PS) == 0) {
|
| LoopUnrollRuntime.cpp | 115 SmallVector<BasicBlock*, 4> Preds(pred_begin(Exit), pred_end(Exit));
117 SplitBlockPredecessors(Exit, Preds, ".unr-lcssa", P);
120 SplitLandingPadPredecessors(Exit, Preds, ".unr1-lcssa", ".unr2-lcssa",
|
| PromoteMemoryToRegister.cpp | 793 // Get the preds for BB.
794 SmallVector<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB));
799 std::sort(Preds.begin(), Preds.end());
802 // them from the Preds list.
804 // Do a log(n) search of the Preds list for the entry we want.
806 Preds.begin(), Preds.end(), SomePHI->getIncomingBlock(i));
807 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i) &&
811 Preds.erase(EntIt)
[all...] |
| SSAUpdater.cpp | 241 /// FindPredecessorBlocks - Put the predecessors of Info->BB into the Preds
242 /// vector, set Info->NumPreds, and allocate space in Info->Preds.
244 SmallVectorImpl<BasicBlock*> *Preds) {
250 Preds->push_back(SomePhi->getIncomingBlock(PI));
253 Preds->push_back(*PI);
|
| /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 | 57 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
105 if (SU->isAvailable) return; // All preds scheduled.
|
| TailDuplication.cpp | 150 SmallSetVector<MachineBasicBlock*, 8> Preds(MBB->pred_begin(),
156 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(),
157 PE = Preds.end(); PI != PE; ++PI) {
177 if (CheckExtra && !Preds.count(PHIBB)) {
668 SmallVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(),
671 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(),
672 PE = Preds.end(); PI != PE; ++PI) {
757 SmallSetVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(),
759 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(),
760 PE = Preds.end(); PI != PE; ++PI)
[all...] |
| AggressiveAntiDepBreaker.cpp | 261 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
280 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
838 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(),
839 PE = PathSU->Preds.end(); P != PE; ++P) {
847 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(),
848 PE = PathSU->Preds.end(); P != PE; ++P) {
[all...] |
| CriticalAntiDepBreaker.cpp | 130 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
540 for (SUnit::const_pred_iterator P = CriticalPathSU->Preds.begin(),
541 PE = CriticalPathSU->Preds.end(); P != PE; ++P)
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 51 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
56 NumPreds(0), Preds(0), PHITag(0) { }
111 SmallVector<BlkT*, 10> Preds;
114 Preds.clear();
115 Traits::FindPredecessorBlocks(Info->BB, &Preds);
116 Info->NumPreds = Preds.size();
118 Info->Preds = 0;
120 Info->Preds = static_cast<BBInfo**>
125 BlkT *Pred = Preds[p];
130 Info->Preds[p] = BBMapBucket.second
[all...] |
| BasicBlockUtils.h | 148 /// Preds array, which has NumPreds elements in it. The new block is given a
157 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock*> Preds,
162 /// new basic blocks gets the predecessors listed in Preds. The other basic
173 void SplitLandingPadPredecessors(BasicBlock *OrigBB,ArrayRef<BasicBlock*> Preds,
|
| /external/llvm/lib/MC/ |
| MCObjectDisassembler.cpp | 103 BBInfoSetTy Preds;
107 Succ.Preds.insert(this);
158 // Compute succs/preds.
197 for (BBInfoSetTy::iterator PI = BBI->Preds.begin(), PE = BBI->Preds.end();
202 // Set preds/succs.
211 for (BBInfoSetTy::iterator PI = BBI->Preds.begin(), PE = BBI->Preds.end();
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 215 Preds.addNode(V, G);
371 if (N->Preds.empty()) {
377 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end();
407 if (N->Preds.empty())
415 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;
181 unsigned pred_size() const { return Preds.size(); }
183 bool pred_empty() const { return Preds.empty(); }
209 pred_iterator pred_begin() { return Preds.begin(); }
210 pred_iterator pred_end() { return Preds.end(); }
243 void replacePredecessor(ExplodedNode *node) { Preds.replaceNode(node); }
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ResourcePriorityQueue.cpp | 73 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
158 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
218 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
511 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
546 HorizontalVerticalBalance -= (SU->Preds.size() - numberCtrlPredInSU(SU));
582 if (SU->isAvailable) return; // All preds scheduled
[all...] |
| ScheduleDAGRRList.cpp | 526 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
808 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
[all...] |
| ScheduleDAGFast.cpp | 162 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();
476 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
|
| ScheduleDAGVLIW.cpp | 177 if (SUnits[i].Preds.empty()) {
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 262 // Preds/Succs - The SUnits before/after us in the graph.
263 SmallVector<SDep, 4> Preds; // All sunit predecessors.
273 unsigned NumPreds; // # of SDep::Data preds.
275 unsigned NumPredsLeft; // # of preds not scheduled.
277 unsigned WeakPredsLeft; // # of weak preds not scheduled.
439 for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i)
440 if (Preds[i].getSUnit() == N)
618 return Node->Preds[Operand].getSUnit();
632 return SUnitIterator(N, (unsigned)N->Preds.size());
645 return Node->Preds[Operand]
[all...] |
| /external/clang/include/clang/Analysis/ |
| CFG.h | 366 AdjacentBlocks Preds;
386 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false),
425 pred_iterator pred_begin() { return Preds.begin(); }
426 pred_iterator pred_end() { return Preds.end(); }
427 const_pred_iterator pred_begin() const { return Preds.begin(); }
428 const_pred_iterator pred_end() const { return Preds.end(); }
430 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); }
431 pred_reverse_iterator pred_rend() { return Preds.rend(); }
432 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); }
433 const_pred_reverse_iterator pred_rend() const { return Preds.rend();
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 224 for (SUnit::succ_iterator I = SU->Preds.begin(), E = SU->Preds.end();
425 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
512 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
|
| /external/llvm/lib/Transforms/Scalar/ |
| StructurizeCFG.cpp | 464 BBPredicates &Preds = Loops ? LoopPreds[SuccFalse] : Predicates[SuccTrue];
470 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end();
680 BBPredicates &Preds = Predicates[Node->getEntry()];
681 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end();
692 BBPredicates &Preds = Predicates[Node->getEntry()];
699 for (BBPredicates::iterator I = Preds.begin(), E = Preds.end();
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCCTRLoops.cpp | 548 SmallVector<MachineBasicBlock *, 8> Preds;
584 if (!CheckPreds && Preds.empty())
599 Preds.push_back(*PI);
603 MBB = Preds.pop_back_val();
608 } while (!Preds.empty());
|
