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()
1369     CFGBlockInfo *CurrBlockInfo = &BlockInfo[CurrBlock->getBlockID()];  in findBlockLocations()
1373     if (const Stmt *S = CurrBlock->getTerminator()) {  in findBlockLocations()
1376       for (CFGBlock::const_reverse_iterator BI = CurrBlock->rbegin(),  in findBlockLocations()
1377            BE = CurrBlock->rend(); BI != BE; ++BI) {  in findBlockLocations()
1389       for (CFGBlock::const_iterator BI = CurrBlock->begin(),  in findBlockLocations()
1390            BE = CurrBlock->end(); BI != BE; ++BI) {  in findBlockLocations()
1397     } else if (CurrBlock->pred_size() == 1 && *CurrBlock->pred_begin() &&  in findBlockLocations()
1398                CurrBlock != &CFGraph->getExit()) {  in findBlockLocations()
1402           BlockInfo[(*CurrBlock->pred_begin())->getBlockID()].ExitLoc;  in findBlockLocations()
1431                    const CFGBlock *PredBlock, const CFGBlock *CurrBlock,
1439                       const CFGBlock *CurrBlock);
1632                                        const CFGBlock *CurrBlock,  in getMutexIDs()  argument
1649     if (*SI == CurrBlock && i == branchnum)  in getMutexIDs()
1740                                           const CFGBlock *CurrBlock) {  in getEdgeLockset()  argument
1771                     PredBlock, CurrBlock, A->getSuccessValue(), Negate);  in getEdgeLockset()
1779                     PredBlock, CurrBlock, A->getSuccessValue(), Negate);  in getEdgeLockset()
2439   for (const auto *CurrBlock : *SortedGraph) {  in runAnalysis()
2440     int CurrBlockID = CurrBlock->getBlockID();  in runAnalysis()
2444     VisitedBlocks.insert(CurrBlock);  in runAnalysis()
2461     for (CFGBlock::const_pred_iterator PI = CurrBlock->pred_begin(),  in runAnalysis()
2462          PE  = CurrBlock->pred_end(); PI != PE; ++PI) {  in runAnalysis()
2490       getEdgeLockset(PrevLockset, PrevBlockInfo->ExitSet, *PI, CurrBlock);  in runAnalysis()
2526                        PrevBlock, CurrBlock);  in runAnalysis()
2540     for (CFGBlock::const_iterator BI = CurrBlock->begin(),  in runAnalysis()
2541          BE = CurrBlock->end(); BI != BE; ++BI) {  in runAnalysis()
2573     for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(),  in runAnalysis()
2574          SE  = CurrBlock->succ_end(); SI != SE; ++SI) {  in runAnalysis()