693   for (const auto *CurrBlock : *SortedGraph) {  in traverseCFG()
694     int CurrBlockID = CurrBlock->getBlockID();  in traverseCFG()
697     VisitedBlocks.insert(CurrBlock);  in traverseCFG()
702     for (CFGBlock::const_pred_iterator PI = CurrBlock->pred_begin(),  in traverseCFG()
703          PE  = CurrBlock->pred_end(); PI != PE; ++PI) {  in traverseCFG()
736     for (CFGBlock::const_iterator BI = CurrBlock->begin(),  in traverseCFG()
737          BE = CurrBlock->end(); BI != BE; ++BI) {  in traverseCFG()
751     for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(),  in traverseCFG()
752          SE  = CurrBlock->succ_end(); SI != SE; ++SI) {  in traverseCFG()
774   for (const auto *CurrBlock : *SortedGraph) {  in findBlockLocations()
775     CFGBlockInfo *CurrBlockInfo = &BlockInfo[CurrBlock->getBlockID()];  in findBlockLocations()
779     if (const Stmt *S = CurrBlock->getTerminator()) {  in findBlockLocations()
782       for (CFGBlock::const_reverse_iterator BI = CurrBlock->rbegin(),  in findBlockLocations()
783            BE = CurrBlock->rend(); BI != BE; ++BI) {  in findBlockLocations()
795       for (CFGBlock::const_iterator BI = CurrBlock->begin(),  in findBlockLocations()
796            BE = CurrBlock->end(); BI != BE; ++BI) {  in findBlockLocations()
803     } else if (CurrBlock->pred_size() == 1 && *CurrBlock->pred_begin() &&  in findBlockLocations()
804                CurrBlock != &CFGraph->getExit()) {  in findBlockLocations()
808           BlockInfo[(*CurrBlock->pred_begin())->getBlockID()].ExitLoc;  in findBlockLocations()
941                    const CFGBlock *PredBlock, const CFGBlock *CurrBlock,
949                       const CFGBlock *CurrBlock);
1286                                        const CFGBlock *CurrBlock,  in getMutexIDs()  argument
1303     if (*SI == CurrBlock && i == branchnum)  in getMutexIDs()
1393                                           const CFGBlock *CurrBlock) {  in getEdgeLockset()  argument
1424                     PredBlock, CurrBlock, A->getSuccessValue(), Negate);  in getEdgeLockset()
1432                     PredBlock, CurrBlock, A->getSuccessValue(), Negate);  in getEdgeLockset()
2195   for (const auto *CurrBlock : *SortedGraph) {  in runAnalysis()
2196     int CurrBlockID = CurrBlock->getBlockID();  in runAnalysis()
2200     VisitedBlocks.insert(CurrBlock);  in runAnalysis()
2217     for (CFGBlock::const_pred_iterator PI = CurrBlock->pred_begin(),  in runAnalysis()
2218          PE  = CurrBlock->pred_end(); PI != PE; ++PI) {  in runAnalysis()
2246       getEdgeLockset(PrevLockset, PrevBlockInfo->ExitSet, *PI, CurrBlock);  in runAnalysis()
2282                        PrevBlock, CurrBlock);  in runAnalysis()
2296     for (CFGBlock::const_iterator BI = CurrBlock->begin(),  in runAnalysis()
2297          BE = CurrBlock->end(); BI != BE; ++BI) {  in runAnalysis()
2329     for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(),  in runAnalysis()
2330          SE  = CurrBlock->succ_end(); SI != SE; ++SI) {  in runAnalysis()