Searched refs:ReachableBlocks (Results 1 – 2 of 2) sorted by relevance
1036 assert(ReachableBlocks.empty() && "ReachableBlocks already filled"); in fillReachableBlocks()1039 ReachableBlocks.insert(&Cfg->getEntry()); in fillReachableBlocks()1047 if (L && isa<SwitchCase>(L) && ReachableBlocks.insert(B).second) in fillReachableBlocks()1057 if (*I && ReachableBlocks.insert(*I).second) in fillReachableBlocks()1065 assert(!ReachableBlocks.empty() && "ReachableBlocks empty"); in checkFallThroughIntoBlock()1088 if (!ReachableBlocks.count(P)) { in checkFallThroughIntoBlock()1195 llvm::SmallPtrSet<const CFGBlock *, 16> ReachableBlocks; member in __anon1610bc2a0811::FallthroughMapper
623 SmallPtrSet<const BasicBlock *, 8> ReachableBlocks; member in __anon46287ded0311::NewGVN1509 if (!ReachableBlocks.count(DefiningInst->getParent())) in performSymbolicLoadEvaluation()2455 if (ReachableBlocks.insert(To).second) { in updateReachableEdge()2984 ReachableBlocks.clear(); in cleanupTables()3221 bool Result = ReachableBlocks.count(Pair.first->getBlock()); in verifyMemoryCongruency()3398 bool BlockReachable = ReachableBlocks.count(CurrBlock); in iterateTouchedInstructions()3488 ReachableBlocks.insert(&F.getEntryBlock()); in runGVN()3510 return !ReachableBlocks.count(&BB); in runGVN()3652 if (ReachableBlocks.count(IBlock) == 0) in convertClassToDFSOrdered()3913 assert((!ReachableBlocks.count(cast<Instruction>(M)->getParent()) || in eliminateInstructions()