1026 bool ConsumedBlockInfo::allBackEdgesVisited(const CFGBlock *CurrBlock,  in allBackEdgesVisited()  argument
1029   assert(CurrBlock && "Block pointer must not be NULL");  in allBackEdgesVisited()
1032   unsigned int CurrBlockOrder = VisitOrder[CurrBlock->getBlockID()];  in allBackEdgesVisited()
1266 bool ConsumedAnalyzer::splitState(const CFGBlock *CurrBlock,  in splitState()  argument
1274     dyn_cast_or_null<IfStmt>(CurrBlock->getTerminator().getStmt())) {  in splitState()
1298     dyn_cast_or_null<BinaryOperator>(CurrBlock->getTerminator().getStmt())) {  in splitState()
1337   CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin();  in splitState()
1375   for (const auto *CurrBlock : *SortedGraph) {  in run()
1377       CurrStates = BlockInfo.getInfo(CurrBlock);  in run()
1391     for (const auto &B : *CurrBlock) {  in run()
1426     if (!splitState(CurrBlock, Visitor)) {  in run()
1429       if (CurrBlock->succ_size() > 1 ||  in run()
1430           (CurrBlock->succ_size() == 1 &&  in run()
1431            (*CurrBlock->succ_begin())->pred_size() > 1)) {  in run()
1435         for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(),  in run()
1436              SE = CurrBlock->succ_end(); SI != SE; ++SI) {  in run()
1440           if (BlockInfo.isBackEdge(CurrBlock, *SI)) {  in run()
1441             BlockInfo.borrowInfo(*SI)->intersectAtLoopHead(*SI, CurrBlock,  in run()
1445             if (BlockInfo.allBackEdgesVisited(CurrBlock, *SI))  in run()
1459     if (CurrBlock == &AC.getCFG()->getExit() &&  in run()