Searched refs:ReachableBlocks (Results 1 – 3 of 3) sorted by relevance
28 ReachableBlocks = 0 variable52 ReachableBlocks = ReachableBlocks + int(s[0]) variable77 print "Reachable Blocks %d" % (ReachableBlocks)
921 assert(ReachableBlocks.empty() && "ReachableBlocks already filled"); in fillReachableBlocks()924 ReachableBlocks.insert(&Cfg->getEntry()); in fillReachableBlocks()932 if (L && isa<SwitchCase>(L) && ReachableBlocks.insert(B).second) in fillReachableBlocks()942 if (*I && ReachableBlocks.insert(*I).second) in fillReachableBlocks()949 assert(!ReachableBlocks.empty() && "ReachableBlocks empty"); in checkFallThroughIntoBlock()972 if (!ReachableBlocks.count(P)) { in checkFallThroughIntoBlock()1070 llvm::SmallPtrSet<const CFGBlock *, 16> ReachableBlocks; member in __anon75d552dd0611::FallthroughMapper
623 SmallPtrSet<const BasicBlock *, 8> ReachableBlocks; member in __anon40e6ade20311::NewGVN1506 if (!ReachableBlocks.count(DefiningInst->getParent())) in performSymbolicLoadEvaluation()2452 if (ReachableBlocks.insert(To).second) { in updateReachableEdge()2981 ReachableBlocks.clear(); in cleanupTables()3222 bool Result = ReachableBlocks.count(Pair.first->getBlock()); in verifyMemoryCongruency()3400 bool BlockReachable = ReachableBlocks.count(CurrBlock); in iterateTouchedInstructions()3490 ReachableBlocks.insert(&F.getEntryBlock()); in runGVN()3510 return !ReachableBlocks.count(&BB); in runGVN()3652 if (ReachableBlocks.count(IBlock) == 0) in convertClassToDFSOrdered()3944 assert((!ReachableBlocks.count(cast<Instruction>(M)->getParent()) || in eliminateInstructions()