Searched refs:CurrBlock (Results 1 – 5 of 5) sorted by relevance
158 for (const auto *CurrBlock : *SortedGraph) { in walk()159 VisitedBlocks.insert(CurrBlock); in walk()161 V.enterCFGBlock(CurrBlock); in walk()167 for (CFGBlock::const_pred_iterator SI = CurrBlock->pred_begin(), in walk()168 SE = CurrBlock->pred_end(); in walk()184 V.enterCFGBlockBody(CurrBlock); in walk()187 for (const auto &BI : *CurrBlock) { in walk()206 V.exitCFGBlockBody(CurrBlock); in walk()213 for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(), in walk()214 SE = CurrBlock->succ_end(); in walk()[all …]
215 bool allBackEdgesVisited(const CFGBlock *CurrBlock,243 bool splitState(const CFGBlock *CurrBlock,
691 for (const auto *CurrBlock : *SortedGraph) { in traverseCFG()692 int CurrBlockID = CurrBlock->getBlockID(); in traverseCFG()695 VisitedBlocks.insert(CurrBlock); in traverseCFG()700 for (CFGBlock::const_pred_iterator PI = CurrBlock->pred_begin(), in traverseCFG()701 PE = CurrBlock->pred_end(); PI != PE; ++PI) { in traverseCFG()734 for (CFGBlock::const_iterator BI = CurrBlock->begin(), in traverseCFG()735 BE = CurrBlock->end(); BI != BE; ++BI) { in traverseCFG()749 for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(), in traverseCFG()750 SE = CurrBlock->succ_end(); SI != SE; ++SI) { in traverseCFG()772 for (const auto *CurrBlock : *SortedGraph) { in findBlockLocations()[all …]
1026 bool ConsumedBlockInfo::allBackEdgesVisited(const CFGBlock *CurrBlock, in allBackEdgesVisited() argument1029 assert(CurrBlock && "Block pointer must not be NULL"); in allBackEdgesVisited()1032 unsigned int CurrBlockOrder = VisitOrder[CurrBlock->getBlockID()]; in allBackEdgesVisited()1266 bool ConsumedAnalyzer::splitState(const CFGBlock *CurrBlock, in splitState() argument1274 dyn_cast_or_null<IfStmt>(CurrBlock->getTerminator().getStmt())) { in splitState()1298 dyn_cast_or_null<BinaryOperator>(CurrBlock->getTerminator().getStmt())) { in splitState()1337 CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(); in splitState()1375 for (const auto *CurrBlock : *SortedGraph) { in run()1377 CurrStates = BlockInfo.getInfo(CurrBlock); in run()1391 for (const auto &B : *CurrBlock) { in run()[all …]
239 BasicBlock *CurrBlock = LastCondBlock; in FlattenParallelAndOr() local241 for (;CurrBlock != FirstCondBlock; in FlattenParallelAndOr()242 CurrBlock = CurrBlock->getSinglePredecessor()) { in FlattenParallelAndOr()243 BranchInst *BI = dyn_cast<BranchInst>(CurrBlock->getTerminator()); in FlattenParallelAndOr()