/external/llvm/include/llvm/Analysis/ |
D | Interval.h | 44 typedef std::vector<BasicBlock*>::iterator pred_iterator; typedef 114 inline Interval::pred_iterator pred_begin(Interval *I) { in pred_begin() 117 inline Interval::pred_iterator pred_end(Interval *I) { in pred_end() 138 typedef Interval::pred_iterator ChildIteratorType;
|
/external/llvm/include/llvm/IR/ |
D | CFG.h | 85 typedef PredIterator<BasicBlock, Value::user_iterator> pred_iterator; typedef 88 typedef llvm::iterator_range<pred_iterator> pred_range; 91 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); } in pred_begin() 95 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} in pred_end() 326 typedef pred_iterator ChildIteratorType;
|
/external/llvm/lib/Transforms/Utils/ |
D | LoopSimplify.cpp | 128 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in InsertPreheaderForLoop() 167 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); I != E; ++I) { in rewriteLoopExitBlock() 202 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { in addBlockAndPredsToSet() 324 for (pred_iterator PI=pred_begin(Header), E = pred_end(Header); PI!=E; ++PI) { in separateNestedLoop() 379 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){ in insertUniqueBackedgeBlock() 496 for (pred_iterator PI = pred_begin(*BB), in simplifyOneLoop() 568 for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock); in simplifyOneLoop() 830 for (pred_iterator PI = pred_begin(L->getHeader()),
|
D | BreakCriticalEdges.cpp | 220 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); in SplitCriticalEdge() 309 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); I != E; in SplitCriticalEdge()
|
D | SSAUpdater.cpp | 114 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in GetValueInMiddleOfBlock() 252 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in FindPredecessorBlocks()
|
/external/llvm/include/llvm/CodeGen/ |
D | MachineBasicBlock.h | 258 typedef std::vector<MachineBasicBlock *>::iterator pred_iterator; 270 pred_iterator pred_begin() { return Predecessors.begin(); } 272 pred_iterator pred_end() { return Predecessors.end(); } 303 inline iterator_range<pred_iterator> predecessors() { 304 return iterator_range<pred_iterator>(pred_begin(), pred_end()); 743 typedef MachineBasicBlock::pred_iterator ChildIteratorType;
|
/external/llvm/lib/Transforms/Scalar/ |
D | CorrelatedValuePropagation.cpp | 175 pred_iterator PI = pred_begin(C->getParent()), PE = pred_end(C->getParent()); in processCmp() 221 pred_iterator PB = pred_begin(BB), PE = pred_end(BB); in processSwitch() 234 for (pred_iterator PI = PB; PI != PE; ++PI) { in processSwitch()
|
D | SimplifyCFGPass.cpp | 106 pred_iterator PB = pred_begin(RetBlock), PE = pred_end(RetBlock); in mergeEmptyReturnBlocks() 111 for (pred_iterator PI = PB; PI != PE; ++PI) in mergeEmptyReturnBlocks()
|
D | JumpThreading.cpp | 360 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in ComputeValueKnownInPredecessors() 384 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in ComputeValueKnownInPredecessors() 541 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB);PI != E; ++PI){ in ComputeValueKnownInPredecessors() 615 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in ComputeValueKnownInPredecessors() 766 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); in ProcessBlock() 929 for (pred_iterator PI = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad() 982 for (pred_iterator PI = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad() 1019 pred_iterator PB = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad() 1027 for (pred_iterator PI = PB; PI != PE; ++PI) { in SimplifyPartiallyRedundantLoad()
|
D | TailRecursionElimination.cpp | 738 pred_iterator PB = pred_begin(OldEntry), PE = pred_end(OldEntry); in EliminateRecursiveTailCall() 750 for (pred_iterator PI = PB; PI != PE; ++PI) { in EliminateRecursiveTailCall() 805 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in FoldReturnAndProcessPred()
|
D | LoopRotation.cpp | 578 pred_iterator PI = pred_begin(BB); in rotateLoop() 580 for (pred_iterator PE = pred_end(BB); PI != PE; ++PI) in rotateLoop()
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
D | ExplodedGraph.h | 204 typedef ExplodedNode* const * pred_iterator; typedef 207 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin() 208 pred_iterator pred_end() { return Preds.end(); } in pred_end()
|
/external/llvm/lib/Analysis/ |
D | Interval.cpp | 32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode); in isLoop()
|
D | LoopInfo.cpp | 143 pred_iterator PI = pred_begin(H); in getCanonicalInductionVariable() 338 for (pred_iterator PI = pred_begin(ExitBlocks[i]), in hasDedicatedExits() 367 pred_iterator PI = pred_begin(*I); in getUniqueExitBlocks()
|
/external/llvm/lib/IR/ |
D | BasicBlock.cpp | 215 pred_iterator PI = pred_begin(this), E = pred_end(this); in getSinglePredecessor() 228 pred_iterator PI = pred_begin(this), E = pred_end(this); in getUniquePredecessor()
|
/external/llvm/lib/CodeGen/ |
D | MachineSSAUpdater.cpp | 163 for (MachineBasicBlock::pred_iterator PI = BB->pred_begin(), in GetValueInMiddleOfBlock() 278 for (MachineBasicBlock::pred_iterator PI = BB->pred_begin(), in FindPredecessorBlocks()
|
D | ScheduleDAG.cpp | 302 SUnit::pred_iterator BestI = Preds.begin(); in biasCriticalPath() 304 for (SUnit::pred_iterator I = std::next(BestI), E = Preds.end(); I != E; in biasCriticalPath() 606 for (SUnit::pred_iterator in WillCreateCycle()
|
D | LiveRangeCalc.cpp | 287 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(), in findReachingDefs() 399 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(), in updateSSA()
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
D | ScheduleDAGFast.cpp | 163 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in ReleasePredecessors() 286 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors() 358 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors() 483 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in DelayForLiveRegsBottomUp()
|
D | ResourcePriorityQueue.cpp | 72 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in numberRCValPredInSU() 157 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in numberCtrlPredInSU() 509 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in scheduledNode()
|
/external/llvm/lib/Target/R600/ |
D | SIAnnotateControlFlow.cpp | 283 for (pred_iterator PI = pred_begin(Target), PE = pred_end(Target); in handleLoop() 303 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) { in closeControlFlow()
|
/external/llvm/lib/Target/PowerPC/ |
D | PPCLoopPreIncPrep.cpp | 297 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in runOnLoop() 310 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in runOnLoop()
|
D | PPCEarlyReturn.cpp | 71 for (MachineBasicBlock::pred_iterator PI = ReturnMBB.pred_begin(), in processBlock()
|
/external/llvm/include/llvm/Transforms/Utils/ |
D | BasicBlockUtils.h | 157 inline bool SplitCriticalEdge(BasicBlock *Succ, pred_iterator PI,
|
/external/llvm/lib/Transforms/ObjCARC/ |
D | DependencyAnalysis.cpp | 241 pred_iterator PI(LocalStartBB), PE(LocalStartBB, false); in FindDependencies()
|