738   for (const auto *CurrBlock : *SortedGraph) {  in traverseCFG()
739     unsigned CurrBlockID = CurrBlock->getBlockID();  in traverseCFG()
742     VisitedBlocks.insert(CurrBlock);  in traverseCFG()
747     for (CFGBlock::const_pred_iterator PI = CurrBlock->pred_begin(),  in traverseCFG()
748          PE  = CurrBlock->pred_end(); PI != PE; ++PI) {  in traverseCFG()
781     for (const auto &BI : *CurrBlock) {  in traverseCFG()
795     for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(),  in traverseCFG()
796          SE  = CurrBlock->succ_end(); SI != SE; ++SI) {  in traverseCFG()
818   for (const auto *CurrBlock : *SortedGraph) {  in findBlockLocations()
819     CFGBlockInfo *CurrBlockInfo = &BlockInfo[CurrBlock->getBlockID()];  in findBlockLocations()
823     if (const Stmt *S = CurrBlock->getTerminatorStmt()) {  in findBlockLocations()
826       for (CFGBlock::const_reverse_iterator BI = CurrBlock->rbegin(),  in findBlockLocations()
827            BE = CurrBlock->rend(); BI != BE; ++BI) {  in findBlockLocations()
839       for (const auto &BI : *CurrBlock) {  in findBlockLocations()
846     } else if (CurrBlock->pred_size() == 1 && *CurrBlock->pred_begin() &&  in findBlockLocations()
847                CurrBlock != &CFGraph->getExit()) {  in findBlockLocations()
851           BlockInfo[(*CurrBlock->pred_begin())->getBlockID()].ExitLoc;  in findBlockLocations()
1043                    const CFGBlock *PredBlock, const CFGBlock *CurrBlock,
1051                       const CFGBlock *CurrBlock);
1399                                        const CFGBlock *CurrBlock,  in getMutexIDs()  argument
1416     if (*SI == CurrBlock && i == branchnum)  in getMutexIDs()
1512                                           const CFGBlock *CurrBlock) {  in getEdgeLockset()  argument
1542                     Exp, FunDecl, PredBlock, CurrBlock, A->getSuccessValue(),  in getEdgeLockset()
1550                     PredBlock, CurrBlock, A->getSuccessValue(), Negate);  in getEdgeLockset()
1557                     PredBlock, CurrBlock, A->getSuccessValue(), Negate);  in getEdgeLockset()
2380   for (const auto *CurrBlock : *SortedGraph) {  in runAnalysis()
2381     unsigned CurrBlockID = CurrBlock->getBlockID();  in runAnalysis()
2385     VisitedBlocks.insert(CurrBlock);  in runAnalysis()
2402     for (CFGBlock::const_pred_iterator PI = CurrBlock->pred_begin(),  in runAnalysis()
2403          PE  = CurrBlock->pred_end(); PI != PE; ++PI) {  in runAnalysis()
2430       getEdgeLockset(PrevLockset, PrevBlockInfo->ExitSet, *PI, CurrBlock);  in runAnalysis()
2466                        PrevBlock, CurrBlock);  in runAnalysis()
2478     for (const auto &BI : *CurrBlock) {  in runAnalysis()
2510     for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(),  in runAnalysis()
2511          SE  = CurrBlock->succ_end(); SI != SE; ++SI) {  in runAnalysis()