| /external/llvm/include/llvm/Analysis/ |
| D | Interval.h | 44 typedef std::vector<BasicBlock*>::iterator pred_iterator; typedef
117 inline Interval::pred_iterator pred_begin(Interval *I) { in pred_begin()
120 inline Interval::pred_iterator pred_end(Interval *I) { in pred_end()
141 typedef Interval::pred_iterator ChildIteratorType;
|
| /external/llvm/include/llvm/Support/ |
| D | CFG.h | 76 typedef PredIterator<BasicBlock, Value::use_iterator> pred_iterator; typedef
80 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); } in pred_begin()
84 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} in pred_end()
276 typedef pred_iterator ChildIteratorType;
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LoopSimplify.cpp | 154 for (pred_iterator PI = pred_begin(*BB), in ProcessLoop()
222 for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock); in ProcessLoop()
359 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in InsertPreheaderForLoop()
394 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); I != E; ++I) { in RewriteLoopExitBlock()
426 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { in AddBlockAndPredsToSet()
574 for (pred_iterator PI=pred_begin(Header), E = pred_end(Header); PI!=E; ++PI) { in SeparateNestedLoop()
626 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){ in InsertUniqueBackedgeBlock()
730 for (pred_iterator PI = pred_begin(L->getHeader()), in verifyAnalysis()
|
| D | BreakCriticalEdges.cpp | 257 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); in SplitCriticalEdge()
350 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); in SplitCriticalEdge()
|
| D | SSAUpdater.cpp | 143 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in GetValueInMiddleOfBlock()
286 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in FindPredecessorBlocks()
|
| /external/llvm/lib/CodeGen/ |
| D | DwarfEHPrepare.cpp | 379 for (pred_iterator PI = pred_begin(LPad), PE = pred_end(LPad); in NormalizeLandingPads()
413 for (pred_iterator PI = pred_begin(LPad), PE = pred_end(LPad); PI != PE; ) { in NormalizeLandingPads()
424 pred_iterator PB = pred_begin(NewBB), PE = pred_end(NewBB); in NormalizeLandingPads()
429 for (pred_iterator PI = PB; PI != PE; ++PI) { in NormalizeLandingPads()
443 for (pred_iterator PI = PB; PI != PE; ++PI) in NormalizeLandingPads()
454 for (pred_iterator PI = PB; PI != PE; ++PI) in NormalizeLandingPads()
|
| D | MachineSSAUpdater.cpp | 161 for (MachineBasicBlock::pred_iterator PI = BB->pred_begin(), in GetValueInMiddleOfBlock()
293 for (MachineBasicBlock::pred_iterator PI = BB->pred_begin(), in FindPredecessorBlocks()
|
| D | ShrinkWrapping.cpp | 243 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(), in calcAvailInOut()
449 MachineBasicBlock::pred_iterator PI = HDR->pred_begin(); in calculateSets()
569 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(), in addUsesForMEMERegion()
610 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(), in addUsesForMEMERegion()
683 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(), in calcSpillPlacements()
|
| D | Splitter.cpp | 417 for (MachineBasicBlock::pred_iterator pbItr = header->pred_begin(), in canInsertPreHeader()
444 for (MachineBasicBlock::pred_iterator predItr = header.pred_begin(), in insertPreHeader()
509 for (MachineBasicBlock::pred_iterator predItr = preHeader->pred_begin(), in insertPreHeader()
720 for (MachineBasicBlock::pred_iterator predItr = header.pred_begin(), in processHeader()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineBasicBlock.h | 154 typedef std::vector<MachineBasicBlock *>::iterator pred_iterator;
167 pred_iterator pred_begin() { return Predecessors.begin(); }
169 pred_iterator pred_end() { return Predecessors.end(); }
503 typedef MachineBasicBlock::pred_iterator ChildIteratorType;
|
| /external/llvm/lib/Analysis/ |
| D | LoopInfo.cpp | 132 pred_iterator PI = pred_begin(H); in getCanonicalInductionVariable()
307 for (pred_iterator PI = pred_begin(ExitBlocks[i]), in hasDedicatedExits()
341 pred_iterator PI = pred_begin(*I); in getUniqueExitBlocks()
|
| D | RegionInfo.cpp | 141 for (pred_iterator PI = pred_begin(entry), PE = pred_end(entry); PI != PE; in getEnteringBlock()
163 for (pred_iterator PI = pred_begin(exit), PE = pred_end(exit); PI != PE; in getExitingBlock()
218 for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB); SI != SE; ++SI) in verifyBBInRegion()
389 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); in getExpandedRegion()
407 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); in getExpandedRegion()
469 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) { in isCommonDomFrontier()
768 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 | ProfileEstimatorPass.cpp | 131 for ( pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); in recurseBasicBlock()
370 for (pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); in runOnFunction()
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| D | ExplodedGraph.h | 183 typedef ExplodedNode** pred_iterator; typedef
186 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
187 pred_iterator pred_end() { return Preds.end(); } in pred_end()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | JumpThreading.cpp | 326 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in ComputeValueKnownInPredecessors()
350 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in ComputeValueKnownInPredecessors()
505 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB);PI != E; ++PI){ in ComputeValueKnownInPredecessors()
579 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in ComputeValueKnownInPredecessors()
732 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); in ProcessBlock()
863 for (pred_iterator PI = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad()
911 for (pred_iterator PI = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad()
946 pred_iterator PB = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad()
954 for (pred_iterator PI = PB; PI != PE; ++PI) { in SimplifyPartiallyRedundantLoad()
|
| D | SimplifyCFGPass.cpp | 263 pred_iterator PB = pred_begin(RetBlock), PE = pred_end(RetBlock); in MergeEmptyReturnBlocks()
268 for (pred_iterator PI = PB; PI != PE; ++PI) in MergeEmptyReturnBlocks()
|
| D | TailRecursionElimination.cpp | 531 pred_iterator PB = pred_begin(OldEntry), PE = pred_end(OldEntry); in EliminateRecursiveTailCall()
543 for (pred_iterator PI = PB; PI != PE; ++PI) { in EliminateRecursiveTailCall()
598 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in FoldReturnAndProcessPred()
|
| D | TailDuplication.cpp | 120 pred_iterator PI = pred_begin(Dest), PE = pred_end(Dest); in shouldEliminateUnconditionalBranch()
202 pred_iterator PI = pred_begin(SrcBlock), PE = pred_end(SrcBlock); in FindObviousSharedDomOf()
|
| D | CorrelatedValuePropagation.cpp | 149 pred_iterator PI = pred_begin(C->getParent()), PE = pred_end(C->getParent()); in processCmp()
|
| /external/llvm/lib/VMCore/ |
| D | BasicBlock.cpp | 178 pred_iterator PI = pred_begin(this), E = pred_end(this); in getSinglePredecessor()
191 pred_iterator PI = pred_begin(this), E = pred_end(this); in getUniquePredecessor()
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGFast.cpp | 157 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in ReleasePredecessors()
280 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
350 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
471 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in DelayForLiveRegsBottomUp()
|
| D | ScheduleDAGRRList.cpp | 425 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in ReleasePredecessors()
676 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in UnscheduleNodeBottomUp()
859 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
938 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
1074 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in DelayForLiveRegsBottomUp()
1929 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in ScheduledNode()
2011 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in UnscheduledNode()
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | BasicBlockUtils.h | 124 inline bool SplitCriticalEdge(BasicBlock *Succ, pred_iterator PI, Pass *P = 0) {
|
| /external/clang/include/clang/Analysis/ |
| D | CFG.h | 369 typedef AdjacentBlocks::iterator pred_iterator; typedef
379 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
380 pred_iterator pred_end() { return Preds.end(); } in pred_end()
|