Searched refs:CurrBlock (Results 1 – 5 of 5) sorted by relevance
116 for (const auto *CurrBlock : *SortedGraph) { in walk()117 VisitedBlocks.insert(CurrBlock); in walk()119 V.enterCFGBlock(CurrBlock); in walk()125 for (CFGBlock::const_pred_iterator SI = CurrBlock->pred_begin(), in walk()126 SE = CurrBlock->pred_end(); in walk()142 V.enterCFGBlockBody(CurrBlock); in walk()145 for (const auto &BI : *CurrBlock) { in walk()164 V.exitCFGBlockBody(CurrBlock); in walk()171 for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(), in walk()172 SE = CurrBlock->succ_end(); in walk()[all …]
215 bool allBackEdgesVisited(const CFGBlock *CurrBlock,243 bool splitState(const CFGBlock *CurrBlock,
1027 bool ConsumedBlockInfo::allBackEdgesVisited(const CFGBlock *CurrBlock, in allBackEdgesVisited() argument1030 assert(CurrBlock && "Block pointer must not be NULL"); in allBackEdgesVisited()1033 unsigned int CurrBlockOrder = VisitOrder[CurrBlock->getBlockID()]; in allBackEdgesVisited()1267 bool ConsumedAnalyzer::splitState(const CFGBlock *CurrBlock, in splitState() argument1275 dyn_cast_or_null<IfStmt>(CurrBlock->getTerminator().getStmt())) { in splitState()1299 dyn_cast_or_null<BinaryOperator>(CurrBlock->getTerminator().getStmt())) { in splitState()1338 CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(); in splitState()1376 for (const auto *CurrBlock : *SortedGraph) { in run()1378 CurrStates = BlockInfo.getInfo(CurrBlock); in run()1392 for (const auto &B : *CurrBlock) { in run()[all …]
1287 for (const auto *CurrBlock : *SortedGraph) { in traverseCFG()1288 int CurrBlockID = CurrBlock->getBlockID(); in traverseCFG()1291 VisitedBlocks.insert(CurrBlock); in traverseCFG()1296 for (CFGBlock::const_pred_iterator PI = CurrBlock->pred_begin(), in traverseCFG()1297 PE = CurrBlock->pred_end(); PI != PE; ++PI) { in traverseCFG()1330 for (CFGBlock::const_iterator BI = CurrBlock->begin(), in traverseCFG()1331 BE = CurrBlock->end(); BI != BE; ++BI) { in traverseCFG()1345 for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(), in traverseCFG()1346 SE = CurrBlock->succ_end(); SI != SE; ++SI) { in traverseCFG()1368 for (const auto *CurrBlock : *SortedGraph) { in findBlockLocations()[all …]
239 BasicBlock *CurrBlock = LastCondBlock; in FlattenParallelAndOr() local242 BranchInst *BI = dyn_cast<BranchInst>(CurrBlock->getTerminator()); in FlattenParallelAndOr()251 if (CurrBlock == FirstCondBlock) in FlattenParallelAndOr()253 CurrBlock = CurrBlock->getSinglePredecessor(); in FlattenParallelAndOr()