| /freebsd-9-stable/contrib/llvm/lib/Transforms/Utils/ |
| D | LoopSimplify.cpp | 159 PE = pred_end(*BB); PI != PE; ++PI) { in ProcessLoop()
231 for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock); in ProcessLoop()
345 assert(pred_begin(ExitingBlock) == pred_end(ExitingBlock)); in ProcessLoop()
376 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); in InsertPreheaderForLoop()
419 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); I != E; ++I) { in RewriteLoopExitBlock()
460 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { in AddBlockAndPredsToSet()
615 for (pred_iterator PI=pred_begin(Header), E = pred_end(Header); PI!=E; ++PI) { in SeparateNestedLoop()
670 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){ in InsertUniqueBackedgeBlock()
775 PE = pred_end(L->getHeader()); PI != PE; ++PI) in verifyAnalysis()
|
| D | BreakCriticalEdges.cpp | 233 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); in SplitCriticalEdge()
323 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); in SplitCriticalEdge()
|
| D | BasicBlockUtils.cpp | 37 assert((pred_begin(BB) == pred_end(BB) || in DeleteDeadBlock()
531 for (pred_iterator i = pred_begin(OrigBB), e = pred_end(OrigBB); in SplitLandingPadPredecessors()
538 e = pred_end(OrigBB); in SplitLandingPadPredecessors()
693 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); in GetIfCondition()
|
| D | CloneFunction.cpp | 458 NumPreds = std::distance(pred_begin(NewBB), pred_end(NewBB)); in CloneAndPruneFunctionInto()
463 for (pred_iterator PI = pred_begin(NewBB), E = pred_end(NewBB); in CloneAndPruneFunctionInto()
524 if (I != Begin && (pred_begin(I) == pred_end(I) || in CloneAndPruneFunctionInto()
|
| /freebsd-9-stable/contrib/llvm/lib/IR/ |
| D | BasicBlock.cpp | 184 pred_iterator PI = pred_begin(this), E = pred_end(this); in getSinglePredecessor()
197 pred_iterator PI = pred_begin(this), E = pred_end(this); in getUniquePredecessor()
219 find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) && in removePredecessor()
|
| /freebsd-9-stable/contrib/llvm/include/llvm/Support/ |
| D | CFG.h | 92 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} in pred_end() function
93 inline const_pred_iterator pred_end(const BasicBlock *BB) { in pred_end() function
296 return pred_end(N);
310 return pred_end(N);
|
| D | PredIteratorCache.h | 46 SmallVector<BasicBlock*, 32> PredCache(pred_begin(BB), pred_end(BB)); in GetPreds()
|
| /freebsd-9-stable/contrib/llvm/include/llvm/Analysis/ |
| D | Interval.h | 120 inline Interval::pred_iterator pred_end(Interval *I) { in pred_end() function
147 return pred_end(N);
|
| /freebsd-9-stable/contrib/llvm/lib/Transforms/Scalar/ |
| D | JumpThreading.cpp | 171 if (pred_begin(BB) == pred_end(BB) && in runOnFunction()
342 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in ComputeValueKnownInPredecessors()
366 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { in ComputeValueKnownInPredecessors()
521 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB);PI != E; ++PI){ in ComputeValueKnownInPredecessors()
595 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) in ComputeValueKnownInPredecessors()
615 unsigned MinNumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); in GetBestDestForJumpOnUndef()
618 unsigned NumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); in GetBestDestForJumpOnUndef()
643 if (pred_begin(BB) == pred_end(BB) && in ProcessBlock()
750 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); in ProcessBlock()
893 for (pred_iterator PI = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad()
[all …]
|
| D | CorrelatedValuePropagation.cpp | 171 pred_iterator PI = pred_begin(C->getParent()), PE = pred_end(C->getParent()); in processCmp()
215 pred_iterator PB = pred_begin(BB), PE = pred_end(BB); in processSwitch()
|
| /freebsd-9-stable/contrib/llvm/lib/Analysis/ |
| D | RegionInfo.cpp | 171 for (pred_iterator PI = pred_begin(entry), PE = pred_end(entry); PI != PE; in getEnteringBlock()
193 for (pred_iterator PI = pred_begin(exit), PE = pred_end(exit); PI != PE; in getExitingBlock()
246 for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB); SI != SE; ++SI) in verifyBBInRegion()
401 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); in getExpandedRegion()
419 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); in getExpandedRegion()
483 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) { in isCommonDomFrontier()
782 for (pred_iterator PI = pred_begin(Exit), PE = pred_end(Exit); PI != PE; in getMaxRegionExit()
|
| D | LoopInfo.cpp | 147 assert(PI != pred_end(H) && in getCanonicalInductionVariable()
150 if (PI == pred_end(H)) return 0; // dead loop in getCanonicalInductionVariable()
152 if (PI != pred_end(H)) return 0; // multiple backedges? in getCanonicalInductionVariable()
342 PE = pred_end(ExitBlocks[i]); PI != PE; ++PI) in hasDedicatedExits()
|
| D | CFG.cpp | 94 const_pred_iterator I = pred_begin(Dest), E = pred_end(Dest); in isCriticalEdge()
111 E = pred_end(P); in isCriticalEdge()
|
| D | Interval.cpp | 32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode); in isLoop()
|
| /freebsd-9-stable/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| D | ExplodedGraph.h | 210 pred_iterator pred_end() { return Preds.end(); } in pred_end() function
215 const_pred_iterator pred_end() const { in pred_end() function
216 return const_cast<ExplodedNode*>(this)->pred_end(); in pred_end()
|
| /freebsd-9-stable/contrib/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 87 pred_iterator_ty pred_end(change_ty Node) { in pred_end() function in __anon31970b390111::DAGDeltaAlgorithmImpl
215 ie = pred_end(Change); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
344 CurrentSet.insert(pred_begin(*it), pred_end(*it)); in Run()
|
| /freebsd-9-stable/contrib/llvm/include/llvm/CodeGen/ |
| D | MachineBasicBlock.h | 262 pred_iterator pred_end() { return Predecessors.end(); }
263 const_pred_iterator pred_end() const { return Predecessors.end(); }
718 return N->pred_end();
732 return N->pred_end();
|
| /freebsd-9-stable/contrib/llvm/tools/clang/lib/Analysis/ |
| D | CFGReachabilityAnalysis.cpp | 71 e = block->pred_end(); i != e; ++i) { in mapReachability()
|
| D | ReachableCode.cpp | 69 E = Block->pred_end(); I != E; ++I) { in isDeadCodeRoot()
142 E = Block->pred_end(); I != E; ++I) { in scanBackwards()
|
| /freebsd-9-stable/contrib/llvm/lib/Transforms/IPO/ |
| D | PruneEH.cpp | 202 if (pred_begin(UnwindBlock) == pred_end(UnwindBlock)) in SimplifyFunction()
236 assert(pred_begin(BB) == pred_end(BB) && "BB is not dead!"); in DeleteBasicBlock()
|
| /freebsd-9-stable/contrib/llvm/tools/clang/include/clang/Analysis/ |
| D | CFG.h | 454 pred_iterator pred_end() { return Preds.end(); } in pred_end() function
456 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end() function
525 return filtered_pred_iterator(pred_begin(), pred_end(), this, f); in filtered_pred_start_end()
936 { return N->pred_end(); }
950 { return N->pred_end(); }
|
| /freebsd-9-stable/contrib/llvm/lib/CodeGen/ |
| D | MachineSSAUpdater.cpp | 162 E = BB->pred_end(); PI != E; ++PI) { in GetValueInMiddleOfBlock()
287 E = BB->pred_end(); PI != E; ++PI) in FindPredecessorBlocks()
|
| D | MachineBlockPlacement.cpp | 373 PE = (*SI)->pred_end(); in selectBestSuccessor()
572 PE = L.getHeader()->pred_end(); in findBestLoopTop()
744 PE = Top->pred_end(); in rotateLoop()
826 PE = (*BCI)->pred_end(); in buildLoopChains()
927 PE = (*BCI)->pred_end(); in buildCFGChains()
|
| D | LiveRangeCalc.cpp | 201 PE = MBB->pred_end(); PI != PE; ++PI) { in findReachingDefs()
315 PE = MBB->pred_end(); PI != PE; ++PI) { in updateSSA()
|
| /freebsd-9-stable/contrib/llvm/include/llvm/MC/ |
| D | MCFunction.h | 66 pred_const_iterator pred_end() const { return Predecessors.end(); } in pred_end() function
|