Lines Matching defs:CurrBlock
736 for (const auto *CurrBlock : *SortedGraph) {
737 unsigned CurrBlockID = CurrBlock->getBlockID();
740 VisitedBlocks.insert(CurrBlock);
745 for (CFGBlock::const_pred_iterator PI = CurrBlock->pred_begin(),
746 PE = CurrBlock->pred_end(); PI != PE; ++PI) {
747 // if *PI -> CurrBlock is a back edge, so skip it
779 for (const auto &BI : *CurrBlock) {
793 for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(),
794 SE = CurrBlock->succ_end(); SI != SE; ++SI) {
795 // if CurrBlock -> *SI is *not* a back edge
816 for (const auto *CurrBlock : *SortedGraph) {
817 CFGBlockInfo *CurrBlockInfo = &BlockInfo[CurrBlock->getBlockID()];
821 if (const Stmt *S = CurrBlock->getTerminatorStmt()) {
824 for (CFGBlock::const_reverse_iterator BI = CurrBlock->rbegin(),
825 BE = CurrBlock->rend(); BI != BE; ++BI) {
837 for (const auto &BI : *CurrBlock) {
844 } else if (CurrBlock->pred_size() == 1 && *CurrBlock->pred_begin() &&
845 CurrBlock != &CFGraph->getExit()) {
849 BlockInfo[(*CurrBlock->pred_begin())->getBlockID()].ExitLoc;
850 } else if (CurrBlock->succ_size() == 1 && *CurrBlock->succ_begin()) {
854 BlockInfo[(*CurrBlock->succ_begin())->getBlockID()].EntryLoc;
1062 const CFGBlock *PredBlock, const CFGBlock *CurrBlock,
1070 const CFGBlock *CurrBlock);
1384 const CFGBlock *CurrBlock,
1401 if (*SI == CurrBlock && i == branchnum)
1492 /// and CurrBlock. The edge set is the exit set of PredBlock (passed
1497 const CFGBlock *CurrBlock) {
1526 Exp, FunDecl, PredBlock, CurrBlock, A->getSuccessValue(),
1532 getMutexIDs(ExclusiveLocksToAdd, A, Exp, FunDecl, PredBlock, CurrBlock,
1538 getMutexIDs(SharedLocksToAdd, A, Exp, FunDecl, PredBlock, CurrBlock,
2553 for (const auto *CurrBlock : *SortedGraph) {
2554 unsigned CurrBlockID = CurrBlock->getBlockID();
2558 VisitedBlocks.insert(CurrBlock);
2574 for (CFGBlock::const_pred_iterator PI = CurrBlock->pred_begin(),
2575 PE = CurrBlock->pred_end(); PI != PE; ++PI) {
2576 // if *PI -> CurrBlock is a back edge
2591 getEdgeLockset(PrevLockset, PrevBlockInfo->ExitSet, *PI, CurrBlock);
2615 for (const auto &BI : *CurrBlock) {
2666 // For every back edge from CurrBlock (the end of the loop) to another block
2670 for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(),
2671 SE = CurrBlock->succ_end(); SI != SE; ++SI) {
2672 // if CurrBlock -> *SI is *not* a back edge