Lines Matching refs:CurrBlock

732   for (const auto *CurrBlock : *SortedGraph) {  in traverseCFG()
733 unsigned CurrBlockID = CurrBlock->getBlockID(); in traverseCFG()
736 VisitedBlocks.insert(CurrBlock); in traverseCFG()
741 for (CFGBlock::const_pred_iterator PI = CurrBlock->pred_begin(), in traverseCFG()
742 PE = CurrBlock->pred_end(); PI != PE; ++PI) { in traverseCFG()
775 for (const auto &BI : *CurrBlock) { in traverseCFG()
789 for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(), in traverseCFG()
790 SE = CurrBlock->succ_end(); SI != SE; ++SI) { in traverseCFG()
812 for (const auto *CurrBlock : *SortedGraph) { in findBlockLocations()
813 CFGBlockInfo *CurrBlockInfo = &BlockInfo[CurrBlock->getBlockID()]; in findBlockLocations()
817 if (const Stmt *S = CurrBlock->getTerminatorStmt()) { in findBlockLocations()
820 for (CFGBlock::const_reverse_iterator BI = CurrBlock->rbegin(), in findBlockLocations()
821 BE = CurrBlock->rend(); BI != BE; ++BI) { in findBlockLocations()
833 for (const auto &BI : *CurrBlock) { in findBlockLocations()
840 } else if (CurrBlock->pred_size() == 1 && *CurrBlock->pred_begin() && in findBlockLocations()
841 CurrBlock != &CFGraph->getExit()) { in findBlockLocations()
845 BlockInfo[(*CurrBlock->pred_begin())->getBlockID()].ExitLoc; in findBlockLocations()
846 } else if (CurrBlock->succ_size() == 1 && *CurrBlock->succ_begin()) { in findBlockLocations()
850 BlockInfo[(*CurrBlock->succ_begin())->getBlockID()].EntryLoc; in findBlockLocations()
1037 const CFGBlock *PredBlock, const CFGBlock *CurrBlock,
1045 const CFGBlock *CurrBlock);
1347 const CFGBlock *CurrBlock, in getMutexIDs() argument
1364 if (*SI == CurrBlock && i == branchnum) in getMutexIDs()
1460 const CFGBlock *CurrBlock) { in getEdgeLockset() argument
1489 Exp, FunDecl, PredBlock, CurrBlock, A->getSuccessValue(), in getEdgeLockset()
1495 getMutexIDs(ExclusiveLocksToAdd, A, Exp, FunDecl, PredBlock, CurrBlock, in getEdgeLockset()
1501 getMutexIDs(SharedLocksToAdd, A, Exp, FunDecl, PredBlock, CurrBlock, in getEdgeLockset()
2337 for (const auto *CurrBlock : *SortedGraph) { in runAnalysis()
2338 unsigned CurrBlockID = CurrBlock->getBlockID(); in runAnalysis()
2342 VisitedBlocks.insert(CurrBlock); in runAnalysis()
2358 for (CFGBlock::const_pred_iterator PI = CurrBlock->pred_begin(), in runAnalysis()
2359 PE = CurrBlock->pred_end(); PI != PE; ++PI) { in runAnalysis()
2375 getEdgeLockset(PrevLockset, PrevBlockInfo->ExitSet, *PI, CurrBlock); in runAnalysis()
2399 for (const auto &BI : *CurrBlock) { in runAnalysis()
2445 for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(), in runAnalysis()
2446 SE = CurrBlock->succ_end(); SI != SE; ++SI) { in runAnalysis()