Searched refs:CurrBlock (Results 1 – 6 of 6) sorted by relevance
177 for (const auto *CurrBlock : *SortedGraph) { in walk()178 VisitedBlocks.insert(CurrBlock); in walk()180 V.enterCFGBlock(CurrBlock); in walk()186 for (CFGBlock::const_pred_iterator SI = CurrBlock->pred_begin(), in walk()187 SE = CurrBlock->pred_end(); in walk()203 V.enterCFGBlockBody(CurrBlock); in walk()206 for (const auto &BI : *CurrBlock) { in walk()225 V.exitCFGBlockBody(CurrBlock); in walk()232 for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(), in walk()233 SE = CurrBlock->succ_end(); in walk()[all …]
224 bool allBackEdgesVisited(const CFGBlock *CurrBlock,251 bool splitState(const CFGBlock *CurrBlock,
248 BasicBlock *CurrBlock = LastCondBlock; in FlattenParallelAndOr() local250 for (; CurrBlock != FirstCondBlock; in FlattenParallelAndOr()251 CurrBlock = CurrBlock->getSinglePredecessor()) { in FlattenParallelAndOr()252 auto *BI = cast<BranchInst>(CurrBlock->getTerminator()); in FlattenParallelAndOr()
3388 const BasicBlock *CurrBlock = getBlockForValue(V); in iterateTouchedInstructions() local3391 if (CurrBlock != LastBlock) { in iterateTouchedInstructions()3392 LastBlock = CurrBlock; in iterateTouchedInstructions()3393 bool BlockReachable = ReachableBlocks.count(CurrBlock); in iterateTouchedInstructions()3394 const auto &CurrInstRange = BlockInstRange.lookup(CurrBlock); in iterateTouchedInstructions()3400 << getBlockName(CurrBlock) in iterateTouchedInstructions()3405 CacheIdx = RPOOrdering.lookup(DT->getNode(CurrBlock)) - 1; in iterateTouchedInstructions()3406 updateProcessedCount(CurrBlock); in iterateTouchedInstructions()
2380 uint32_t Num, const BasicBlock &CurrBlock) { in eraseTranslateCacheEntry() argument2381 for (const BasicBlock *Pred : predecessors(&CurrBlock)) in eraseTranslateCacheEntry()
204 void eraseTranslateCacheEntry(uint32_t Num, const BasicBlock &CurrBlock);