| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 320 ArrayRef<BasicBlock *> Preds,
334 i = Preds.begin(), e = Preds.end(); i != e; ++i) {
337 // If we need to preserve LCSSA, determine if any of the preds is a loop
344 // If we need to preserve LoopInfo, note whether any of the preds crosses
368 i = Preds.begin(), e = Preds.end(); i != e; ++i) {
396 ArrayRef<BasicBlock*> Preds, BranchInst *BI,
407 InVal = PN->getIncomingValueForBlock(Preds[0]);
408 for (unsigned i = 1, e = Preds.size(); i != e; ++i
[all...] |
| BreakCriticalEdges.cpp | 100 assert(I != E && "No preds, but we have an edge to the block?");
107 // non-critical iff all preds come from TI's block.
122 /// new PHIs, as needed. Preds is a list of preds inside the loop, SplitBB
125 static void CreatePHIsForSplitLoopExit(SmallVectorImpl<BasicBlock *> &Preds,
143 PHINode *NewPN = PHINode::Create(PN->getType(), Preds.size(), "split",
145 for (unsigned i = 0, e = Preds.size(); i != e; ++i)
146 NewPN->addIncoming(V, Preds[i]);
350 // Collect all the preds that are inside the loop, and note
351 // whether there are any preds outside the loop
[all...] |
| 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 | 630 // Get the preds for BB.
631 SmallVector<BasicBlock*, 16> Preds(pred_begin(BB), pred_end(BB));
636 std::sort(Preds.begin(), Preds.end());
639 // them from the Preds list.
641 // Do a log(n) search of the Preds list for the entry we want.
643 std::lower_bound(Preds.begin(), Preds.end(),
645 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i)&&
649 Preds.erase(EntIt)
[all...] |
| SSAUpdater.cpp | 275 /// FindPredecessorBlocks - Put the predecessors of Info->BB into the Preds
276 /// vector, set Info->NumPreds, and allocate space in Info->Preds.
278 SmallVectorImpl<BasicBlock*> *Preds) {
284 Preds->push_back(SomePhi->getIncomingBlock(PI));
287 Preds->push_back(*PI);
|
| /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 | 167 /// Preds array, which has NumPreds elements in it. The new block is given a
176 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock*> Preds,
181 /// new basic blocks gets the predecessors listed in Preds. The other basic
192 void SplitLandingPadPredecessors(BasicBlock *OrigBB,ArrayRef<BasicBlock*> Preds,
|
| /external/llvm/lib/CodeGen/ |
| ScheduleDAG.cpp | 67 for (SmallVector<SDep, 4>::const_iterator I = Preds.begin(), E = Preds.end();
90 Preds.push_back(D);
104 for (SmallVector<SDep, 4>::iterator I = Preds.begin(), E = Preds.end();
119 assert(FoundSucc && "Mismatching preds / succs lists!");
121 Preds.erase(I);
168 for (SUnit::const_pred_iterator I = SU->Preds.begin(),
169 E = SU->Preds.end(); I != E; ++I) {
209 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 | 141 SmallSetVector<MachineBasicBlock*, 8> Preds(MBB->pred_begin(),
147 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(),
148 PE = Preds.end(); PI != PE; ++PI) {
168 if (CheckExtra && !Preds.count(PHIBB)) {
659 SmallVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(),
662 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(),
663 PE = Preds.end(); PI != PE; ++PI) {
748 SmallSetVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(),
750 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(),
751 PE = Preds.end(); PI != PE; ++PI)
[all...] |
| AggressiveAntiDepBreaker.cpp | 280 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
299 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
860 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(),
861 PE = PathSU->Preds.end(); P != PE; ++P) {
869 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(),
870 PE = PathSU->Preds.end(); P != PE; ++P) {
[all...] |
| MachineScheduler.cpp | 366 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
416 if (I->Preds.empty())
|
| CriticalAntiDepBreaker.cpp | 164 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
569 for (SUnit::const_pred_iterator P = CriticalPathSU->Preds.begin(),
570 PE = CriticalPathSU->Preds.end(); P != PE; ++P)
|
| MachineSSAUpdater.cpp | 288 /// FindPredecessorBlocks - Put the predecessors of BB into the Preds
291 SmallVectorImpl<MachineBasicBlock*> *Preds){
294 Preds->push_back(*PI);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 161 Preds.addNode(V, G);
325 if (N->Preds.empty()) {
331 for (ExplodedNode** I=N->Preds.begin(), **E=N->Preds.end(); I!=E; ++I)
360 if (N->Preds.empty())
368 for (ExplodedNode **I=N->Preds.begin(), **E=N->Preds.end(); I!=E; ++I) {
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 112 /// Preds - The predecessors of this node.
113 NodeGroup Preds;
170 unsigned pred_size() const { return Preds.size(); }
172 bool pred_empty() const { return Preds.empty(); }
194 pred_iterator pred_begin() { return Preds.begin(); }
195 pred_iterator pred_end() { return Preds.end(); }
228 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 | 506 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
784 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
[all...] |
| ScheduleDAGFast.cpp | 157 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
280 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
350 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
471 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
|
| ScheduleDAGVLIW.cpp | 175 if (SUnits[i].Preds.empty()) {
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 237 // Preds/Succs - The SUnits before/after us in the graph.
238 SmallVector<SDep, 4> Preds; // All sunit predecessors.
248 unsigned NumPreds; // # of SDep::Data preds.
250 unsigned NumPredsLeft; // # of preds not scheduled.
399 for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i)
400 if (Preds[i].getSUnit() == N)
590 return Node->Preds[Operand].getSUnit();
604 return SUnitIterator(N, (unsigned)N->Preds.size());
617 return Node->Preds[Operand];
|
| /external/clang/include/clang/Analysis/ |
| CFG.h | 333 AdjacentBlocks Preds;
353 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false),
392 pred_iterator pred_begin() { return Preds.begin(); }
393 pred_iterator pred_end() { return Preds.end(); }
394 const_pred_iterator pred_begin() const { return Preds.begin(); }
395 const_pred_iterator pred_end() const { return Preds.end(); }
397 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); }
398 pred_reverse_iterator pred_rend() { return Preds.rend(); }
399 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); }
400 const_pred_reverse_iterator pred_rend() const { return Preds.rend();
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 86 const UniqueVector<BasicBlock *> &Preds,
527 const UniqueVector<BasicBlock *> &Preds,
533 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]].
536 Int64PtrTy, Succs.size() * Preds.size());
538 Constant **EdgeTable = new Constant*[Succs.size() * Preds.size()];
540 for (int i = 0, ie = Succs.size() * Preds.size(); i != ie; ++i)
553 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) +
554 (Preds.idFor(BB)-1)] = cast<Constant>(Counter);
560 ArrayRef<Constant*> V(&EdgeTable[0], Succs.size() * Preds.size());
|
| /external/llvm/include/llvm/Analysis/ |
| ProfileInfo.h | 163 BType *const *Preds, unsigned NumPreds);
|
| /external/llvm/lib/VMCore/ |
| Verifier.cpp | 729 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
731 std::sort(Preds.begin(), Preds.end());
738 Assert1(PN->getNumIncomingValues() == Preds.size(),
763 Assert3(Values[i].first == Preds[i],
765 Values[i].first, Preds[i]);
[all...] |
