Searched refs:pred_begin (Results 1 - 25 of 105) sorted by relevance

12345

/freebsd-10.1-release/contrib/llvm/include/llvm/Support/
H A DPredIteratorCache.h41 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
46 SmallVector<BasicBlock*, 32> PredCache(pred_begin(BB), pred_end(BB));
H A DCFG.h88 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); } function in namespace:llvm
89 inline const_pred_iterator pred_begin(const BasicBlock *BB) { function in namespace:llvm
293 return pred_begin(N);
307 return pred_begin(N);
/freebsd-10.1-release/contrib/llvm/lib/Analysis/
H A DInterval.cpp32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode);
H A DRegionInfo.cpp171 for (pred_iterator PI = pred_begin(entry), PE = pred_end(entry); PI != PE;
193 for (pred_iterator PI = pred_begin(exit), PE = pred_end(exit); PI != PE;
246 for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB); SI != SE; ++SI)
401 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit());
419 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit());
483 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) {
782 for (pred_iterator PI = pred_begin(Exit), PE = pred_end(Exit); PI != PE;
/freebsd-10.1-release/contrib/llvm/include/llvm/Analysis/
H A DInterval.h114 /// pred_begin/pred_end - define methods so that Intervals may be used
117 inline Interval::pred_iterator pred_begin(Interval *I) { function in namespace:llvm
144 return pred_begin(N);
/freebsd-10.1-release/contrib/llvm/tools/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.cpp70 for (CFGBlock::const_pred_iterator i = block->pred_begin(),
H A DReachableCode.cpp68 for (CFGBlock::const_pred_iterator I = Block->pred_begin(),
141 for (CFGBlock::const_pred_iterator I = Block->pred_begin(),
/freebsd-10.1-release/contrib/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp158 for (pred_iterator PI = pred_begin(*BB),
231 for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock);
345 assert(pred_begin(ExitingBlock) == pred_end(ExitingBlock));
376 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header);
419 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); I != E; ++I) {
460 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
615 for (pred_iterator PI=pred_begin(Header), E = pred_end(Header); PI!=E; ++PI) {
670 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){
774 for (pred_iterator PI = pred_begin(L->getHeader()),
H A DBreakCriticalEdges.cpp227 // faster than iterating pred_begin/end.
233 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB);
323 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit);
/freebsd-10.1-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h192 return pred_empty() ? NULL : *(pred_begin());
209 pred_iterator pred_begin() { return Preds.begin(); } function in class:clang::ento::ExplodedNode
212 const_pred_iterator pred_begin() const { function in class:clang::ento::ExplodedNode
213 return const_cast<ExplodedNode*>(this)->pred_begin();
/freebsd-10.1-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
H A DUndefBranchChecker.cpp89 ExplodedNode *PrevN = *N->pred_begin();
H A DUnreachableCodeChecker.cpp179 for (CFGBlock::const_pred_iterator I = CB->pred_begin(), E = CB->pred_end();
221 const CFGBlock *pred = *CB->pred_begin();
/freebsd-10.1-release/contrib/llvm/lib/IR/
H A DBasicBlock.cpp184 pred_iterator PI = pred_begin(this), E = pred_end(this);
197 pred_iterator PI = pred_begin(this), E = pred_end(this);
219 find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) &&
/freebsd-10.1-release/contrib/llvm/include/llvm/MC/
H A DMCFunction.h65 pred_const_iterator pred_begin() const { return Predecessors.begin(); } function in class:llvm::MCBasicBlock
/freebsd-10.1-release/contrib/llvm/lib/Transforms/Scalar/
H A DReg2Mem.cpp76 assert(pred_begin(BBEntry) == pred_end(BBEntry) &&
H A DCorrelatedValuePropagation.cpp171 pred_iterator PI = pred_begin(C->getParent()), PE = pred_end(C->getParent());
215 pred_iterator PB = pred_begin(BB), PE = pred_end(BB);
H A DJumpThreading.cpp171 if (pred_begin(BB) == pred_end(BB) &&
342 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
366 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) {
521 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB);PI != E; ++PI){
595 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
615 unsigned MinNumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB));
618 unsigned NumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB));
643 if (pred_begin(BB) == pred_end(BB) &&
750 pred_iterator PI = pred_begin(BB), PE = pred_end(BB);
893 for (pred_iterator PI = pred_begin(LoadB
[all...]
H A DSimplifyCFGPass.cpp124 pred_iterator PB = pred_begin(RetBlock), PE = pred_end(RetBlock);
/freebsd-10.1-release/contrib/llvm/lib/CodeGen/
H A DMachineBlockPlacement.cpp372 for (MachineBasicBlock::pred_iterator PI = (*SI)->pred_begin(),
571 for (MachineBasicBlock::pred_iterator PI = L.getHeader()->pred_begin(),
598 (*BestPred->pred_begin())->succ_size() == 1 &&
599 *BestPred->pred_begin() != L.getHeader())
600 BestPred = *BestPred->pred_begin();
743 for (MachineBasicBlock::pred_iterator PI = Top->pred_begin(),
825 for (MachineBasicBlock::pred_iterator PI = (*BCI)->pred_begin(),
926 for (MachineBasicBlock::pred_iterator PI = (*BCI)->pred_begin(),
H A DLiveRangeCalc.cpp200 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(),
314 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(),
H A DMachineSSAUpdater.cpp161 for (MachineBasicBlock::pred_iterator PI = BB->pred_begin(),
286 for (MachineBasicBlock::pred_iterator PI = BB->pred_begin(),
/freebsd-10.1-release/contrib/llvm/lib/Transforms/IPO/
H A DPruneEH.cpp202 if (pred_begin(UnwindBlock) == pred_end(UnwindBlock))
236 assert(pred_begin(BB) == pred_end(BB) && "BB is not dead!");
/freebsd-10.1-release/contrib/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp83 pred_iterator_ty pred_begin(change_ty Node) { function in class:__anon2402::DAGDeltaAlgorithmImpl
214 for (pred_iterator_ty it = pred_begin(Change),
344 CurrentSet.insert(pred_begin(*it), pred_end(*it));
/freebsd-10.1-release/contrib/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h260 pred_iterator pred_begin() { return Predecessors.begin(); } function in class:llvm::MachineBasicBlock
261 const_pred_iterator pred_begin() const { return Predecessors.begin(); } function in class:llvm::MachineBasicBlock
715 return N->pred_begin();
729 return N->pred_begin();
/freebsd-10.1-release/contrib/llvm/tools/clang/include/clang/Analysis/FlowSensitive/
H A DDataflowSolver.h71 static PrevBItr PrevBegin(const CFGBlock *B) { return B->pred_begin(); }
97 static NextBItr NextBegin(const CFGBlock *B) { return B->pred_begin(); }

Completed in 271 milliseconds

12345