691   for (const auto *CurrBlock : *SortedGraph) {  in traverseCFG()
692     int CurrBlockID = CurrBlock->getBlockID();  in traverseCFG()
695     VisitedBlocks.insert(CurrBlock);  in traverseCFG()
700     for (CFGBlock::const_pred_iterator PI = CurrBlock->pred_begin(),  in traverseCFG()
701          PE  = CurrBlock->pred_end(); PI != PE; ++PI) {  in traverseCFG()
734     for (CFGBlock::const_iterator BI = CurrBlock->begin(),  in traverseCFG()
735          BE = CurrBlock->end(); BI != BE; ++BI) {  in traverseCFG()
749     for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(),  in traverseCFG()
750          SE  = CurrBlock->succ_end(); SI != SE; ++SI) {  in traverseCFG()
772   for (const auto *CurrBlock : *SortedGraph) {  in findBlockLocations()
773     CFGBlockInfo *CurrBlockInfo = &BlockInfo[CurrBlock->getBlockID()];  in findBlockLocations()
777     if (const Stmt *S = CurrBlock->getTerminator()) {  in findBlockLocations()
780       for (CFGBlock::const_reverse_iterator BI = CurrBlock->rbegin(),  in findBlockLocations()
781            BE = CurrBlock->rend(); BI != BE; ++BI) {  in findBlockLocations()
793       for (CFGBlock::const_iterator BI = CurrBlock->begin(),  in findBlockLocations()
794            BE = CurrBlock->end(); BI != BE; ++BI) {  in findBlockLocations()
801     } else if (CurrBlock->pred_size() == 1 && *CurrBlock->pred_begin() &&  in findBlockLocations()
802                CurrBlock != &CFGraph->getExit()) {  in findBlockLocations()
806           BlockInfo[(*CurrBlock->pred_begin())->getBlockID()].ExitLoc;  in findBlockLocations()
939                    const CFGBlock *PredBlock, const CFGBlock *CurrBlock,
947                       const CFGBlock *CurrBlock);
1289                                        const CFGBlock *CurrBlock,  in getMutexIDs()  argument
1306     if (*SI == CurrBlock && i == branchnum)  in getMutexIDs()
1396                                           const CFGBlock *CurrBlock) {  in getEdgeLockset()  argument
1427                     PredBlock, CurrBlock, A->getSuccessValue(), Negate);  in getEdgeLockset()
1435                     PredBlock, CurrBlock, A->getSuccessValue(), Negate);  in getEdgeLockset()
2190   for (const auto *CurrBlock : *SortedGraph) {  in runAnalysis()
2191     int CurrBlockID = CurrBlock->getBlockID();  in runAnalysis()
2195     VisitedBlocks.insert(CurrBlock);  in runAnalysis()
2212     for (CFGBlock::const_pred_iterator PI = CurrBlock->pred_begin(),  in runAnalysis()
2213          PE  = CurrBlock->pred_end(); PI != PE; ++PI) {  in runAnalysis()
2241       getEdgeLockset(PrevLockset, PrevBlockInfo->ExitSet, *PI, CurrBlock);  in runAnalysis()
2277                        PrevBlock, CurrBlock);  in runAnalysis()
2291     for (CFGBlock::const_iterator BI = CurrBlock->begin(),  in runAnalysis()
2292          BE = CurrBlock->end(); BI != BE; ++BI) {  in runAnalysis()
2324     for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(),  in runAnalysis()
2325          SE  = CurrBlock->succ_end(); SI != SE; ++SI) {  in runAnalysis()