/macosx-10.10.1/llvmCore-3425.0.34/lib/Transforms/Utils/ |
H A D | BasicBlockUtils.cpp | 320 ArrayRef<BasicBlock *> Preds, 334 i = Preds.begin(), e = Preds.end(); i != e; ++i) { 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) 409 if (InVal != PN->getIncomingValueForBlock(Preds[i])) { 419 for (unsigned i = 0, e = Preds 319 UpdateAnalysisInformation(BasicBlock *OldBB, BasicBlock *NewBB, ArrayRef<BasicBlock *> Preds, Pass *P, bool &HasLoopExit) argument 395 UpdatePHINodes(BasicBlock *OrigBB, BasicBlock *NewBB, ArrayRef<BasicBlock*> Preds, BranchInst *BI, Pass *P, bool HasLoopExit) argument 454 SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock*> Preds, const char *Suffix, Pass *P) argument 507 SplitLandingPadPredecessors(BasicBlock *OrigBB, ArrayRef<BasicBlock*> Preds, const char *Suffix1, const char *Suffix2, Pass *P, SmallVectorImpl<BasicBlock*> &NewBBs) argument [all...] |
H A D | BreakCriticalEdges.cpp | 122 /// new PHIs, as needed. Preds is a list of preds inside the loop, SplitBB 125 static void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds, argument 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]); 355 SmallVector<BasicBlock *, 4> Preds; local 363 Preds.clear(); 366 Preds.push_back(P); 372 // the edges. The Preds.empty() check is needed because a block 376 if (!Preds [all...] |
H A D | 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",
|
H A D | PromoteMemoryToRegister.cpp | 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); 661 for (unsigned pred = 0, e = Preds [all...] |
H A D | 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); 280 FindPredecessorBlocks(BasicBlock *BB, SmallVectorImpl<BasicBlock*> *Preds) argument
|
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/Transforms/Utils/ |
H A D | SSAUpdaterImpl.h | 51 BBInfo **Preds; // Array[NumPreds] of predecessor blocks. member in class:llvm::SSAUpdaterImpl::BBInfo 56 NumPreds(0), Preds(0), PHITag(0) { } 111 SmallVector<BlkT*, 10> Preds; local 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[ [all...] |
H A D | BasicBlockUtils.h | 169 /// Preds array, which has NumPreds elements in it. The new block is given a 178 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock*> Preds, 183 /// new basic blocks gets the predecessors listed in Preds. The other basic 194 void SplitLandingPadPredecessors(BasicBlock *OrigBB,ArrayRef<BasicBlock*> Preds,
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/CodeGen/ |
H A D | ScheduleDAG.cpp | 67 for (SmallVector<SDep, 4>::iterator I = Preds.begin(), E = Preds.end(); 107 Preds.push_back(D); 121 for (SmallVector<SDep, 4>::iterator I = Preds.begin(), E = Preds.end(); 138 Preds.erase(I); 185 for (SUnit::const_pred_iterator I = SU->Preds.begin(), 186 E = SU->Preds.end(); I != E; ++I) { 226 for (SUnit::const_pred_iterator I = Cur->Preds.begin(), 227 E = Cur->Preds [all...] |
H A D | LatencyPriorityQueue.cpp | 57 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
|
H A D | 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 [all...] |
H A D | AggressiveAntiDepBreaker.cpp | 278 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); 297 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); 855 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), 856 PE = PathSU->Preds.end(); P != PE; ++P) { 864 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), 865 PE = PathSU->Preds.end(); P != PE; ++P) {
|
H A D | CriticalAntiDepBreaker.cpp | 146 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); 546 for (SUnit::const_pred_iterator P = CriticalPathSU->Preds.begin(), 547 PE = CriticalPathSU->Preds.end(); P != PE; ++P)
|
H A D | MachineSSAUpdater.cpp | 283 /// FindPredecessorBlocks - Put the predecessors of BB into the Preds 286 SmallVectorImpl<MachineBasicBlock*> *Preds){ 289 Preds->push_back(*PI); 285 FindPredecessorBlocks(MachineBasicBlock *BB, SmallVectorImpl<MachineBasicBlock*> *Preds) argument
|
H A D | MachineScheduler.cpp | 347 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 523 if (I->Preds.empty()) 774 for (SUnit::succ_iterator I = SU->Preds.begin(), E = SU->Preds.end();
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/CodeGen/SelectionDAG/ |
H A D | 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));
|
H A D | ScheduleDAGRRList.cpp | 507 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 787 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 1001 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 1080 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 1241 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds [all...] |
H A D | 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(); 466 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
|
H A D | ScheduleDAGVLIW.cpp | 175 if (SUnits[i].Preds.empty()) {
|
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/CodeGen/ |
H A D | ScheduleDAG.h | 257 // Preds/Succs - The SUnits before/after us in the graph. 258 SmallVector<SDep, 4> Preds; // All sunit predecessors. member in class:llvm::SUnit 422 for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i) 423 if (Preds[i].getSUnit() == N) 597 return Node->Preds[Operand].getSUnit(); 611 return SUnitIterator(N, (unsigned)N->Preds.size()); 624 return Node->Preds[Operand];
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/Target/Hexagon/ |
H A D | HexagonMachineScheduler.cpp | 212 for (SUnit::succ_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 413 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 500 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/Transforms/Instrumentation/ |
H A D | GCOVProfiling.cpp | 86 const UniqueVector<BasicBlock *> &Preds, 536 const UniqueVector<BasicBlock *> &Preds, 545 Int64PtrTy, Succs.size() * Preds.size()); 547 Constant **EdgeTable = new Constant*[Succs.size() * Preds.size()]; 549 for (int i = 0, ie = Succs.size() * Preds.size(); i != ie; ++i) 562 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) + 563 (Preds.idFor(BB)-1)] = cast<Constant>(Counter); 569 ArrayRef<Constant*> V(&EdgeTable[0], Succs.size() * Preds.size()); 533 buildEdgeLookupTable( Function *F, GlobalVariable *Counters, const UniqueVector<BasicBlock *> &Preds, const UniqueVector<BasicBlock *> &Succs) argument
|
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/Analysis/ |
H A D | ProfileInfo.h | 163 BType *const *Preds, unsigned NumPreds);
|
/macosx-10.10.1/llvmCore-3425.0.34/utils/TableGen/ |
H A D | CodeGenSchedule.cpp | 1297 RecVec Preds; 1300 Preds.push_back(PI->Predicate); 1302 RecIter PredsEnd = std::unique(Preds.begin(), Preds.end()); 1303 Preds.resize(PredsEnd - Preds.begin()); 1304 SCTrans.PredTerm = Preds;
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/VMCore/ |
H A D | Verifier.cpp | 732 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB)); 734 std::sort(Preds.begin(), Preds.end()); 741 Assert1(PN->getNumIncomingValues() == Preds.size(), 766 Assert3(Values[i].first == Preds[i], 768 Values[i].first, Preds[i]);
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/Transforms/Scalar/ |
H A D | LoopUnswitch.cpp | 747 SmallVector<BasicBlock *, 4> Preds(pred_begin(ExitBlock), 753 SplitBlockPredecessors(ExitBlock, Preds, ".us-lcssa", this); 756 SplitLandingPadPredecessors(ExitBlock, Preds, ".us-lcssa", ".us-lcssa",
|