/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(ArrayRef<BasicBlock *> Preds, 146 PHINode::Create(PN->getType(), Preds.size(), "split", 149 for (unsigned i = 0, e = Preds.size(); i != e; ++i) 150 NewPN->addIncoming(V, Preds[i]); 353 // Collect all the preds that are inside the loop, and note 354 // 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 | 638 // Get the preds for BB. 639 SmallVector<BasicBlock*, 16> Preds(pred_begin(BB), pred_end(BB)); 644 std::sort(Preds.begin(), Preds.end()); 647 // them from the Preds list. 649 // Do a log(n) search of the Preds list for the entry we want. 651 std::lower_bound(Preds.begin(), Preds.end(), 653 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i)&& 657 Preds.erase(EntIt) [all...] |
SSAUpdater.cpp | 278 /// FindPredecessorBlocks - Put the predecessors of Info->BB into the Preds 279 /// vector, set Info->NumPreds, and allocate space in Info->Preds. 281 SmallVectorImpl<BasicBlock*> *Preds) { 287 Preds->push_back(SomePhi->getIncomingBlock(PI)); 290 Preds->push_back(*PI);
|
/external/llvm/lib/CodeGen/ |
ScheduleDAG.cpp | 67 for (SmallVector<SDep, 4>::iterator I = Preds.begin(), E = Preds.end(); 121 Preds.push_back(D); 135 for (SmallVector<SDep, 4>::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)) { 670 SmallVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(), 673 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), 674 PE = Preds.end(); PI != PE; ++PI) { 759 SmallSetVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(), 761 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), 762 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)
|
MachineSSAUpdater.cpp | 282 /// FindPredecessorBlocks - Put the predecessors of BB into the Preds 285 SmallVectorImpl<MachineBasicBlock*> *Preds){ 288 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 | 170 /// Preds array, which has NumPreds elements in it. The new block is given a 179 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock*> Preds, 184 /// new basic blocks gets the predecessors listed in Preds. The other basic 195 void SplitLandingPadPredecessors(BasicBlock *OrigBB,ArrayRef<BasicBlock*> Preds,
|
/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(); } 205 pred_iterator pred_begin() { return Preds.begin(); } 206 pred_iterator pred_end() { return Preds.end(); } 239 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 | 281 // Preds/Succs - The SUnits before/after us in the graph. 282 SmallVector<SDep, 4> Preds; // All sunit predecessors. 292 unsigned NumPreds; // # of SDep::Data preds. 294 unsigned NumPredsLeft; // # of preds not scheduled. 296 unsigned WeakPredsLeft; // # of weak preds not scheduled. 457 for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i) 458 if (Preds[i].getSUnit() == N) 636 return Node->Preds[Operand].getSUnit(); 650 return SUnitIterator(N, (unsigned)N->Preds.size()); 663 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 | 223 for (SUnit::succ_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 424 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 511 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
|
/external/llvm/lib/Target/R600/ |
AMDGPUStructurizeCFG.cpp | 472 BBPredicates &Preds = Loops ? LoopPreds[SuccFalse] : Predicates[SuccTrue]; 478 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end(); 692 BBPredicates &Preds = Predicates[Node->getEntry()]; 693 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end(); 705 BBPredicates &Preds = Predicates[Node->getEntry()]; 712 for (BBPredicates::iterator I = Preds.begin(), E = Preds.end();
|
/external/llvm/lib/Transforms/Instrumentation/ |
GCOVProfiling.cpp | 115 const UniqueVector<BasicBlock *>&Preds, 592 const UniqueVector<BasicBlock *> &Preds, 598 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]]. 599 size_t TableSize = Succs.size() * Preds.size(); 618 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) + 619 (Preds.idFor(BB)-1)] = cast<Constant>(Counter);
|
/external/llvm/include/llvm/Analysis/ |
ProfileInfo.h | 163 BType *const *Preds, unsigned NumPreds);
|