/freebsd-9.3-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | BreakCriticalEdges.cpp | 88 /// new PHIs, as needed. Preds is a list of preds inside the loop, SplitBB 91 static void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds, argument 112 PHINode::Create(PN->getType(), Preds.size(), "split", 115 for (unsigned i = 0, e = Preds.size(); i != e; ++i) 116 NewPN->addIncoming(V, Preds[i]); 320 SmallVector<BasicBlock *, 4> Preds; local 328 Preds.clear(); 331 Preds.push_back(P); 337 // the edges. The Preds.empty() check is needed because a block 341 if (!Preds [all...] |
H A D | BasicBlockUtils.cpp | 304 ArrayRef<BasicBlock *> Preds, 318 i = Preds.begin(), e = Preds.end(); i != e; ++i) { 352 i = Preds.begin(), e = Preds.end(); i != e; ++i) { 380 ArrayRef<BasicBlock*> Preds, BranchInst *BI, 391 InVal = PN->getIncomingValueForBlock(Preds[0]); 392 for (unsigned i = 1, e = Preds.size(); i != e; ++i) 393 if (InVal != PN->getIncomingValueForBlock(Preds[i])) { 403 for (unsigned i = 0, e = Preds 303 UpdateAnalysisInformation(BasicBlock *OldBB, BasicBlock *NewBB, ArrayRef<BasicBlock *> Preds, Pass *P, bool &HasLoopExit) argument 379 UpdatePHINodes(BasicBlock *OrigBB, BasicBlock *NewBB, ArrayRef<BasicBlock*> Preds, BranchInst *BI, Pass *P, bool HasLoopExit) argument 442 SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock*> Preds, const char *Suffix, Pass *P) argument 495 SplitLandingPadPredecessors(BasicBlock *OrigBB, ArrayRef<BasicBlock*> Preds, const char *Suffix1, const char *Suffix2, Pass *P, SmallVectorImpl<BasicBlock*> &NewBBs) argument [all...] |
H A D | 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) {
|
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 | 728 SmallVector<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB)); 733 std::sort(Preds.begin(), Preds.end()); 736 // them from the Preds list. 738 // Do a log(n) search of the Preds list for the entry we want. 740 Preds.begin(), Preds.end(), SomePHI->getIncomingBlock(i)); 741 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i) && 745 Preds.erase(EntIt); 757 for (unsigned pred = 0, e = Preds [all...] |
H A D | 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); 243 FindPredecessorBlocks(BasicBlock *BB, SmallVectorImpl<BasicBlock*> *Preds) argument
|
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/ |
H A D | 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(); 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(), 243 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)) { 666 SmallVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(), 669 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), 670 PE = Preds.end(); PI != PE; ++PI) { 755 SmallSetVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(), 757 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), 758 PE = Preds [all...] |
H A D | 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) {
|
H A D | 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)
|
/freebsd-9.3-release/contrib/llvm/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 | 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,
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/ |
H A D | ExplodedGraph.cpp | 215 Preds.addNode(V, G); 370 if (N->Preds.empty()) { 376 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end(); 405 if (N->Preds.empty()) 413 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end();
|
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ExplodedGraph.h | 117 /// Preds - The predecessors of this node. 118 NodeGroup Preds; member in class:clang::ento::ExplodedNode 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); }
|
/freebsd-9.3-release/contrib/llvm/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(); 510 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 545 HorizontalVerticalBalance -= (SU->Preds.size() - numberCtrlPredInSU(SU));
|
H A D | 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(); 1021 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 1102 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 1264 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds [all...] |
H A D | 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();
|
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Analysis/ |
H A D | CFG.h | 394 AdjacentBlocks Preds; 414 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false), 453 pred_iterator pred_begin() { return Preds.begin(); } 454 pred_iterator pred_end() { return Preds.end(); } 455 const_pred_iterator pred_begin() const { return Preds.begin(); } 456 const_pred_iterator pred_end() const { return Preds.end(); } 458 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); } 459 pred_reverse_iterator pred_rend() { return Preds.rend(); } 460 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); } 461 const_pred_reverse_iterator pred_rend() const { return Preds [all...] |
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAG.h | 262 // Preds/Succs - The SUnits before/after us in the graph. 263 SmallVector<SDep, 4> Preds; // All sunit predecessors. local 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];
|
/freebsd-9.3-release/contrib/llvm/lib/MC/ |
H A D | MCObjectDisassembler.cpp | 164 BBInfoSetTy Preds; member in struct:__anon2260::BBInfo 171 Succ.Preds.insert(this); 284 for (BBInfoSetTy::iterator PI = BBI->Preds.begin(), PE = BBI->Preds.end(); 299 for (BBInfoSetTy::iterator PI = BBI->Preds.begin(), PE = BBI->Preds.end();
|
H A D | MCModuleYAML.cpp | 109 std::vector<yaml::Hex64> Preds; member in struct:llvm::MCModuleYAML::BasicBlock 199 IO.mapRequired("Preds", BB.Preds); 344 BB.Preds.push_back((*PI)->getInsts()->getBeginAddr()); 417 for (AddrIt PI = BBI->Preds.begin(), PE = BBI->Preds.end(); PI != PE;
|
/freebsd-9.3-release/contrib/llvm/lib/Target/Hexagon/ |
H A D | 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(); 510 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
|
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | StructurizeCFG.cpp | 477 BBPredicates &Preds = Loops ? LoopPreds[SuccFalse] : Predicates[SuccTrue]; local 483 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end(); 693 BBPredicates &Preds = Predicates[Node->getEntry()]; local 694 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end(); 705 BBPredicates &Preds = Predicates[Node->getEntry()]; local 712 for (BBPredicates::iterator I = Preds.begin(), E = Preds.end();
|
/freebsd-9.3-release/contrib/llvm/lib/Target/PowerPC/ |
H A D | PPCCTRLoops.cpp | 565 SmallVector<MachineBasicBlock *, 8> Preds; local 601 if (!CheckPreds && Preds.empty()) 616 Preds.push_back(*PI); 620 MBB = Preds.pop_back_val(); 625 } while (!Preds.empty());
|