Home
last modified time | relevance | path

Searched refs:pred_begin (Results 1 – 25 of 112) sorted by relevance

12345

/external/llvm/lib/Transforms/Utils/
DLoopSimplify.cpp117 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()
691 assert(pred_begin(ExitingBlock) == pred_end(ExitingBlock)); in simplifyOneLoop()
821 for (pred_iterator PI = pred_begin(L->getHeader()),
DBreakCriticalEdges.cpp236 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()
/external/llvm/include/llvm/Analysis/
DInterval.h114 inline Interval::pred_iterator pred_begin(Interval *I) { in pred_begin() function
141 return pred_begin(N);
/external/llvm/include/llvm/IR/
DCFG.h88 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); } in pred_begin() function
89 inline const_pred_iterator pred_begin(const BasicBlock *BB) { in pred_begin() function
311 return pred_begin(N);
325 return pred_begin(N);
DPredIteratorCache.h46 SmallVector<BasicBlock*, 32> PredCache(pred_begin(BB), pred_end(BB)); in GetPreds()
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h192 return pred_empty() ? nullptr : *(pred_begin()); in getFirstPred()
209 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin() function
212 const_pred_iterator pred_begin() const { in pred_begin() function
213 return const_cast<ExplodedNode*>(this)->pred_begin(); in pred_begin()
/external/llvm/include/llvm/CodeGen/
DMachineBasicBlock.h270 pred_iterator pred_begin() { return Predecessors.begin(); }
271 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
304 return iterator_range<pred_iterator>(pred_begin(), pred_end());
307 return iterator_range<const_pred_iterator>(pred_begin(), pred_end());
742 return N->pred_begin();
756 return N->pred_begin();
/external/llvm/lib/IR/
DBasicBlock.cpp188 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()
223 find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) && in removePredecessor()
/external/llvm/lib/Analysis/
DRegionInfo.cpp169 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()
DInterval.cpp32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode); in isLoop()
DLoopInfo.cpp145 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/llvm/lib/CodeGen/
DMachineBlockPlacement.cpp381 for (MachineBasicBlock::pred_iterator PI = (*SI)->pred_begin(), in selectBestSuccessor()
565 for (MachineBasicBlock::pred_iterator PI = L.getHeader()->pred_begin(), in findBestLoopTop()
592 (*BestPred->pred_begin())->succ_size() == 1 && in findBestLoopTop()
593 *BestPred->pred_begin() != L.getHeader()) in findBestLoopTop()
594 BestPred = *BestPred->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()
DMachineSSAUpdater.cpp163 for (MachineBasicBlock::pred_iterator PI = BB->pred_begin(), in GetValueInMiddleOfBlock()
278 for (MachineBasicBlock::pred_iterator PI = BB->pred_begin(), in FindPredecessorBlocks()
DLiveRangeCalc.cpp199 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(), in findReachingDefs()
313 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(), in updateSSA()
/external/llvm/lib/Transforms/Scalar/
DJumpThreading.cpp185 if (pred_begin(BB) == pred_end(BB) && in runOnFunction()
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()
629 unsigned MinNumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); in GetBestDestForJumpOnUndef()
632 unsigned NumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); in GetBestDestForJumpOnUndef()
657 if (pred_begin(BB) == pred_end(BB) && in ProcessBlock()
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()
[all …]
DCorrelatedValuePropagation.cpp172 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()
DReg2Mem.cpp76 assert(pred_begin(BBEntry) == pred_end(BBEntry) && in INITIALIZE_PASS_DEPENDENCY()
/external/clang/lib/StaticAnalyzer/Checkers/
DUnreachableCodeChecker.cpp179 for (CFGBlock::const_pred_iterator I = CB->pred_begin(), E = CB->pred_end(); in FindUnreachableEntryPoints()
224 const CFGBlock *pred = *CB->pred_begin(); in isInvalidPath()
DUndefBranchChecker.cpp89 ExplodedNode *PrevN = *N->pred_begin(); in checkBranchCondition()
/external/clang/lib/Analysis/
DCFGReachabilityAnalysis.cpp70 for (CFGBlock::const_pred_iterator i = block->pred_begin(), in mapReachability()
/external/llvm/lib/Support/
DDAGDeltaAlgorithm.cpp85 pred_iterator_ty pred_begin(change_ty Node) { in pred_begin() function in __anonfd798cff0111::DAGDeltaAlgorithmImpl
216 for (pred_iterator_ty it = pred_begin(Change), in DAGDeltaAlgorithmImpl()
346 CurrentSet.insert(pred_begin(*it), pred_end(*it)); in Run()
/external/llvm/lib/Transforms/IPO/
DPruneEH.cpp203 if (pred_begin(UnwindBlock) == pred_end(UnwindBlock)) in SimplifyFunction()
237 assert(pred_begin(BB) == pred_end(BB) && "BB is not dead!"); in DeleteBasicBlock()
/external/llvm/include/llvm/MC/MCAnalysis/
DMCFunction.h66 pred_const_iterator pred_begin() const { return Predecessors.begin(); } in pred_begin() function
/external/clang/lib/StaticAnalyzer/Core/
DExplodedGraph.cpp102 const ExplodedNode *pred = *(node->pred_begin()); in shouldCollect()
170 ExplodedNode *pred = *(node->pred_begin()); in collectNode()
/external/clang/include/clang/Analysis/
DCFG.h533 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin() function
535 const_pred_iterator pred_begin() const { return Preds.begin(); } in pred_begin() function
610 return filtered_pred_iterator(pred_begin(), pred_end(), this, f); in filtered_pred_start_end()
1038 { return N->pred_begin(); }
1052 { return N->pred_begin(); }

12345