Home
last modified time | relevance | path

Searched refs:pred_end (Results 1 – 25 of 104) sorted by relevance

12345

/external/llvm/lib/Transforms/Utils/
DLoopSimplify.cpp159 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()
DBreakCriticalEdges.cpp236 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); in SplitCriticalEdge()
326 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); in SplitCriticalEdge()
DBasicBlockUtils.cpp37 assert((pred_begin(BB) == pred_end(BB) || in DeleteDeadBlock()
528 for (pred_iterator i = pred_begin(OrigBB), e = pred_end(OrigBB); in SplitLandingPadPredecessors()
535 e = pred_end(OrigBB); in SplitLandingPadPredecessors()
690 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); in GetIfCondition()
/external/llvm/lib/IR/
DBasicBlock.cpp184 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()
/external/llvm/include/llvm/Analysis/
DInterval.h120 inline Interval::pred_iterator pred_end(Interval *I) { in pred_end() function
147 return pred_end(N);
/external/llvm/include/llvm/Support/
DCFG.h92 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);
DPredIteratorCache.h46 SmallVector<BasicBlock*, 32> PredCache(pred_begin(BB), pred_end(BB)); in GetPreds()
/external/llvm/lib/Analysis/
DRegionInfo.cpp173 for (pred_iterator PI = pred_begin(entry), PE = pred_end(entry); PI != PE; in getEnteringBlock()
195 for (pred_iterator PI = pred_begin(exit), PE = pred_end(exit); PI != PE; in getExitingBlock()
248 for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB); SI != SE; ++SI) in verifyBBInRegion()
403 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); in getExpandedRegion()
421 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); in getExpandedRegion()
485 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) { in isCommonDomFrontier()
784 for (pred_iterator PI = pred_begin(Exit), PE = pred_end(Exit); PI != PE; in getMaxRegionExit()
DCFG.cpp94 const_pred_iterator I = pred_begin(Dest), E = pred_end(Dest); in isCriticalEdge()
111 E = pred_end(P); in isCriticalEdge()
DInterval.cpp32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode); in isLoop()
DProfileInfo.cpp71 const_pred_iterator PI = pred_begin(BB), PE = pred_end(BB); in getExecutionCount()
514 const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); in CalculateMissingEdge()
586 const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); in EstimateMissingEdges()
781 for (const_pred_iterator NBB = pred_begin(BB), End = pred_end(BB); in repair()
871 for (const_pred_iterator NBB = pred_begin(BB), End = pred_end(BB); in repair()
895 for (const_pred_iterator NBB = pred_begin(BB), End = pred_end(BB); in repair()
937 for (const_pred_iterator NBB = pred_begin(BB), End = pred_end(BB); in repair()
967 for (const_pred_iterator NBB = pred_begin(BB), End = pred_end(BB); in repair()
DProfileEstimatorPass.cpp131 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()
404 const_pred_iterator predi = pred_begin(BB), prede = pred_end(BB); in runOnFunction()
DLoopInfo.cpp147 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()
349 PE = pred_end(ExitBlocks[i]); PI != PE; ++PI) in hasDedicatedExits()
/external/llvm/lib/Transforms/Scalar/
DJumpThreading.cpp171 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()
888 for (pred_iterator PI = pred_begin(LoadBB), PE = pred_end(LoadBB); in SimplifyPartiallyRedundantLoad()
[all …]
DCorrelatedValuePropagation.cpp171 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()
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h210 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()
/external/llvm/include/llvm/CodeGen/
DMachineBasicBlock.h262 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();
/external/clang/lib/Analysis/
DCFGReachabilityAnalysis.cpp72 e = block->pred_end(); i != e; ++i) { in mapReachability()
DReachableCode.cpp69 E = Block->pred_end(); I != E; ++I) { in isDeadCodeRoot()
139 E = Block->pred_end(); I != E; ++I) { in scanBackwards()
/external/llvm/lib/Support/
DDAGDeltaAlgorithm.cpp87 pred_iterator_ty pred_end(change_ty Node) { in pred_end() function in __anone45063c50111::DAGDeltaAlgorithmImpl
215 ie = pred_end(Change); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
344 CurrentSet.insert(pred_begin(*it), pred_end(*it)); in Run()
/external/llvm/lib/Transforms/IPO/
DPruneEH.cpp202 if (pred_begin(UnwindBlock) == pred_end(UnwindBlock)) in SimplifyFunction()
236 assert(pred_begin(BB) == pred_end(BB) && "BB is not dead!"); in DeleteBasicBlock()
/external/clang/include/clang/Analysis/
DCFG.h426 pred_iterator pred_end() { return Preds.end(); } in pred_end() function
428 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end() function
497 return filtered_pred_iterator(pred_begin(), pred_end(), this, f); in filtered_pred_start_end()
904 { return N->pred_end(); }
918 { return N->pred_end(); }
/external/llvm/include/llvm/MC/
DMCFunction.h66 pred_const_iterator pred_end() const { return Predecessors.end(); } in pred_end() function
/external/llvm/lib/CodeGen/
DMachineSSAUpdater.cpp162 E = BB->pred_end(); PI != E; ++PI) { in GetValueInMiddleOfBlock()
287 E = BB->pred_end(); PI != E; ++PI) in FindPredecessorBlocks()
DLiveRangeCalc.cpp206 PE = MBB->pred_end(); PI != PE; ++PI) { in findReachingDefs()
320 PE = MBB->pred_end(); PI != PE; ++PI) { in updateSSA()

12345