Searched refs:ReachableBlocks (Results 1 – 2 of 2) sorted by relevance
1065 assert(ReachableBlocks.empty() && "ReachableBlocks already filled"); in fillReachableBlocks()1068 ReachableBlocks.insert(&Cfg->getEntry()); in fillReachableBlocks()1076 if (L && isa<SwitchCase>(L) && ReachableBlocks.insert(B).second) in fillReachableBlocks()1086 if (*I && ReachableBlocks.insert(*I).second) in fillReachableBlocks()1094 assert(!ReachableBlocks.empty() && "ReachableBlocks empty"); in checkFallThroughIntoBlock()1117 if (!ReachableBlocks.count(P)) { in checkFallThroughIntoBlock()1224 llvm::SmallPtrSet<const CFGBlock *, 16> ReachableBlocks; member in __anondf82a8a60811::FallthroughMapper
627 SmallPtrSet<const BasicBlock *, 8> ReachableBlocks; member in __anonccb5b2130211::NewGVN1531 if (!ReachableBlocks.count(DefiningInst->getParent())) in performSymbolicLoadEvaluation()2401 if (ReachableBlocks.insert(To).second) { in updateReachableEdge()2939 ReachableBlocks.clear(); in cleanupTables()3179 bool Result = ReachableBlocks.count(Pair.first->getBlock()); in verifyMemoryCongruency()3356 bool BlockReachable = ReachableBlocks.count(CurrBlock); in iterateTouchedInstructions()3445 ReachableBlocks.insert(&F.getEntryBlock()); in runGVN()3467 return !ReachableBlocks.count(&BB); in runGVN()3609 if (ReachableBlocks.count(IBlock) == 0) in convertClassToDFSOrdered()3871 assert((!ReachableBlocks.count(cast<Instruction>(M)->getParent()) || in eliminateInstructions()