| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 321 ArrayRef<BasicBlock *> Preds,
335 i = Preds.begin(), e = Preds.end(); i != e; ++i) {
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
369 i = Preds.begin(), e = Preds.end(); i != e; ++i) {
397 ArrayRef<BasicBlock*> Preds, BranchInst *BI,
408 InVal = PN->getIncomingValueForBlock(Preds[0]);
409 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...] |
| PromoteMemoryToRegister.cpp | 627 // Get the preds for BB.
628 SmallVector<BasicBlock*, 16> Preds(pred_begin(BB), pred_end(BB));
633 std::sort(Preds.begin(), Preds.end());
636 // them from the Preds list.
638 // Do a log(n) search of the Preds list for the entry we want.
640 std::lower_bound(Preds.begin(), Preds.end(),
642 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i)&&
646 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);
|
| SimplifyCFG.cpp | 691 SmallVector<BasicBlock*, 16> Preds(pred_begin(BB), pred_end(BB));
692 while (!Preds.empty()) {
693 BasicBlock *Pred = Preds.pop_back_val();
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAGEmit.cpp | 37 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
39 if (I->isCtrl()) continue; // ignore chain preds
48 if (II->isCtrl()) continue; // ignore chain preds
|
| ScheduleDAG.cpp | 90 for (SmallVector<SDep, 4>::const_iterator I = Preds.begin(), E = Preds.end();
113 Preds.push_back(D);
127 for (SmallVector<SDep, 4>::iterator I = Preds.begin(), E = Preds.end();
142 assert(FoundSucc && "Mismatching preds / succs lists!");
144 Preds.erase(I);
191 for (SUnit::const_pred_iterator I = SU->Preds.begin(),
192 E = SU->Preds.end(); I != E; ++I) {
232 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 | 140 SmallSetVector<MachineBasicBlock*, 8> Preds(MBB->pred_begin(),
146 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(),
147 PE = Preds.end(); PI != PE; ++PI) {
167 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();
857 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(),
858 PE = PathSU->Preds.end(); P != PE; ++P) {
866 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(),
867 PE = PathSU->Preds.end(); P != PE; ++P) {
[all...] |
| CriticalAntiDepBreaker.cpp | 163 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
551 for (SUnit::const_pred_iterator P = CriticalPathSU->Preds.begin(),
552 PE = CriticalPathSU->Preds.end(); P != PE; ++P)
|
| MachineSSAUpdater.cpp | 289 /// FindPredecessorBlocks - Put the predecessors of BB into the Preds
292 SmallVectorImpl<MachineBasicBlock*> *Preds){
295 Preds->push_back(*PI);
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 43 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
48 NumPreds(0), Preds(0), PHITag(0) { }
103 SmallVector<BlkT*, 10> Preds;
106 Preds.clear();
107 Traits::FindPredecessorBlocks(Info->BB, &Preds);
108 Info->NumPreds = Preds.size();
110 Info->Preds = 0;
112 Info->Preds = static_cast<BBInfo**>
117 BlkT *Pred = Preds[p];
122 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, BasicBlock *const *Preds,
182 /// new basic blocks gets the predecessors listed in Preds. The other basic
193 void SplitLandingPadPredecessors(BasicBlock *OrigBB,ArrayRef<BasicBlock*> Preds,
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 142 Preds.addNode(V, G);
309 if (N->Preds.empty()) {
315 for (ExplodedNode** I=N->Preds.begin(), **E=N->Preds.end(); I!=E; ++I)
344 if (N->Preds.empty())
352 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;
167 unsigned pred_size() const { return Preds.size(); }
169 bool pred_empty() const { return Preds.empty(); }
188 pred_iterator pred_begin() { return Preds.begin(); }
189 pred_iterator pred_end() { return Preds.end(); }
222 void replacePredecessor(ExplodedNode *node) { Preds.replaceNode(node); }
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGRRList.cpp | 425 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
676 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
859 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
938 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();
|
| ScheduleDAGList.cpp | 167 if (SUnits[i].Preds.empty()) {
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 236 // Preds/Succs - The SUnits before/after us in the graph.
237 SmallVector<SDep, 4> Preds; // All sunit predecessors.
247 unsigned NumPreds; // # of SDep::Data preds.
249 unsigned NumPredsLeft; // # of preds not scheduled.
398 for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i)
399 if (Preds[i].getSUnit() == N)
550 /// BuildSchedGraph - Build SUnits and set up their Preds and Succs
605 return Node->Preds[Operand].getSUnit();
619 return SUnitIterator(N, (unsigned)N->Preds.size());
632 return Node->Preds[Operand]
[all...] |
| /external/clang/include/clang/Analysis/ |
| CFG.h | 333 AdjacentBlocks Preds;
350 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false) {}
388 pred_iterator pred_begin() { return Preds.begin(); }
389 pred_iterator pred_end() { return Preds.end(); }
390 const_pred_iterator pred_begin() const { return Preds.begin(); }
391 const_pred_iterator pred_end() const { return Preds.end(); }
393 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); }
394 pred_reverse_iterator pred_rend() { return Preds.rend(); }
395 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); }
396 const_pred_reverse_iterator pred_rend() const { return Preds.rend();
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 84 const UniqueVector<BasicBlock *> &Preds,
526 const UniqueVector<BasicBlock *> &Preds,
532 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]].
535 Int64PtrTy, Succs.size() * Preds.size());
537 Constant **EdgeTable = new Constant*[Succs.size() * Preds.size()];
539 for (int i = 0, ie = Succs.size() * Preds.size(); i != ie; ++i)
552 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) +
553 (Preds.idFor(BB)-1)] = cast<Constant>(Counter);
559 ArrayRef<Constant*> V(&EdgeTable[0], Succs.size() * Preds.size());
|
| /external/llvm/include/llvm/Analysis/ |
| ProfileInfo.h | 164 BType *const *Preds, unsigned NumPreds);
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopUnswitch.cpp | 562 SmallVector<BasicBlock *, 4> Preds(pred_begin(ExitBlock),
568 SplitBlockPredecessors(ExitBlock, Preds.data(), Preds.size(),
572 SplitLandingPadPredecessors(ExitBlock, Preds, ".us-lcssa", ".us-lcssa",
[all...] |
| /external/llvm/lib/VMCore/ |
| Verifier.cpp | 736 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
738 std::sort(Preds.begin(), Preds.end());
745 Assert1(PN->getNumIncomingValues() == Preds.size(),
770 Assert3(Values[i].first == Preds[i],
772 Values[i].first, Preds[i]);
[all...] |
