| /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 | 84 typedef PredIterator<BasicBlock, Value::user_iterator> pred_iterator; typedef
88 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); } in pred_begin()
92 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} in pred_end()
308 typedef pred_iterator ChildIteratorType;
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LoopSimplify.cpp | 117 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in InsertPreheaderForLoop()
161 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()
319 for (pred_iterator PI=pred_begin(Header), E = pred_end(Header); PI!=E; ++PI) { in separateNestedLoop()
374 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){ in insertUniqueBackedgeBlock()
491 for (pred_iterator PI = pred_begin(*BB), in simplifyOneLoop()
564 for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock); in simplifyOneLoop()
821 for (pred_iterator PI = pred_begin(L->getHeader()),
|
| D | BreakCriticalEdges.cpp | 236 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); in SplitCriticalEdge()
324 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); I != E; in SplitCriticalEdge()
|
| D | SSAUpdater.cpp | 113 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in GetValueInMiddleOfBlock()
251 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());
737 typedef MachineBasicBlock::pred_iterator ChildIteratorType;
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | SimplifyCFGPass.cpp | 125 pred_iterator PB = pred_begin(RetBlock), PE = pred_end(RetBlock); in mergeEmptyReturnBlocks()
130 for (pred_iterator PI = PB; PI != PE; ++PI) in mergeEmptyReturnBlocks()
|
| D | CorrelatedValuePropagation.cpp | 172 pred_iterator PI = pred_begin(C->getParent()), PE = pred_end(C->getParent()); in processCmp()
216 pred_iterator PB = pred_begin(BB), PE = pred_end(BB); in processSwitch()
229 for (pred_iterator PI = PB; PI != PE; ++PI) { in processSwitch()
|
| D | JumpThreading.cpp | 356 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in ComputeValueKnownInPredecessors()
380 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in ComputeValueKnownInPredecessors()
535 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB);PI != E; ++PI){ in ComputeValueKnownInPredecessors()
609 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in ComputeValueKnownInPredecessors()
764 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); in ProcessBlock()
907 for (pred_iterator PI = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad()
960 for (pred_iterator PI = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad()
997 pred_iterator PB = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad()
1005 for (pred_iterator PI = PB; PI != PE; ++PI) { in SimplifyPartiallyRedundantLoad()
|
| D | TailRecursionElimination.cpp | 743 pred_iterator PB = pred_begin(OldEntry), PE = pred_end(OldEntry); in EliminateRecursiveTailCall()
755 for (pred_iterator PI = PB; PI != PE; ++PI) { in EliminateRecursiveTailCall()
810 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in FoldReturnAndProcessPred()
|
| D | LoopRotation.cpp | 536 pred_iterator PI = pred_begin(BB); in rotateLoop()
538 for (pred_iterator PE = pred_end(BB); PI != PE; ++PI) in rotateLoop()
|
| /external/llvm/lib/Analysis/ |
| D | RegionInfo.cpp | 169 for (pred_iterator PI = pred_begin(entry), PE = pred_end(entry); PI != PE; in getEnteringBlock()
191 for (pred_iterator PI = pred_begin(exit), PE = pred_end(exit); PI != PE; in getExitingBlock()
244 for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB); SI != SE; ++SI) in verifyBBInRegion()
405 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); in getExpandedRegion()
423 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); in getExpandedRegion()
487 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) { in isCommonDomFrontier()
786 for (pred_iterator PI = pred_begin(Exit), PE = pred_end(Exit); PI != PE; in getMaxRegionExit()
|
| D | Interval.cpp | 32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode); in isLoop()
|
| D | LoopInfo.cpp | 145 pred_iterator PI = pred_begin(H); in getCanonicalInductionVariable()
339 for (pred_iterator PI = pred_begin(ExitBlocks[i]), in hasDedicatedExits()
368 pred_iterator PI = pred_begin(*I); in getUniqueExitBlocks()
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| D | ExplodedGraph.h | 206 typedef ExplodedNode* const * pred_iterator; typedef
209 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
210 pred_iterator pred_end() { return Preds.end(); } in pred_end()
|
| /external/llvm/lib/IR/ |
| D | BasicBlock.cpp | 188 pred_iterator PI = pred_begin(this), E = pred_end(this); in getSinglePredecessor()
201 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 | LiveRangeCalc.cpp | 199 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(), in findReachingDefs()
313 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(), in updateSSA()
|
| D | MachineBlockPlacement.cpp | 381 for (MachineBasicBlock::pred_iterator PI = (*SI)->pred_begin(), in selectBestSuccessor()
565 for (MachineBasicBlock::pred_iterator PI = L.getHeader()->pred_begin(), in findBestLoopTop()
740 for (MachineBasicBlock::pred_iterator PI = Top->pred_begin(), in rotateLoop()
822 for (MachineBasicBlock::pred_iterator PI = (*BCI)->pred_begin(), in buildLoopChains()
923 for (MachineBasicBlock::pred_iterator PI = (*BCI)->pred_begin(), in buildCFGChains()
|
| D | ScheduleDAG.cpp | 303 SUnit::pred_iterator BestI = Preds.begin(); in biasCriticalPath()
305 for (SUnit::pred_iterator I = std::next(BestI), E = Preds.end(); I != E; in biasCriticalPath()
607 for (SUnit::pred_iterator in WillCreateCycle()
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| D | ExplodedGraph.cpp | 381 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end(); in trim()
419 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end(); in trim()
|
| /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()
477 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in DelayForLiveRegsBottomUp()
|
| D | ResourcePriorityQueue.cpp | 74 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in numberRCValPredInSU()
159 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in numberCtrlPredInSU()
511 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in scheduledNode()
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | BasicBlockUtils.h | 106 inline bool SplitCriticalEdge(BasicBlock *Succ, pred_iterator PI,
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| D | DependencyAnalysis.cpp | 224 pred_iterator PI(LocalStartBB), PE(LocalStartBB, false); in FindDependencies()
|