Searched refs:ReachableBlocks (Results 1 – 3 of 3) sorted by relevance
1379 std::vector<const BlockT *> ReachableBlocks;1380 findReachableBlocks(ReachableBlocks);1381 if (ReachableBlocks.empty())1388 auto Freq = std::vector<Scaled64>(ReachableBlocks.size());1390 for (size_t I = 0; I < ReachableBlocks.size(); I++) {1391 const BlockT *BB = ReachableBlocks[I];1399 << " with " << ReachableBlocks.size() << " blocks\n");1409 initTransitionProbabilities(ReachableBlocks, BlockIndex, ProbMatrix);
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 __anon363ca66f0811::FallthroughMapper
627 SmallPtrSet<const BasicBlock *, 8> ReachableBlocks; member in __anon0afe5c7c0211::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()