Searched refs:CurrBlock (Results 1 – 10 of 10) sorted by relevance
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanPredicator.cpp | 137 if (VPDomTree.dominates(CurrBlock, Region->getExit())) { in createOrPropagatePredicates() 139 CurrBlock->setPredicate(RegionBP); in createOrPropagatePredicates() 154 for (VPBlockBase *PredBlock : CurrBlock->getPredecessors()) { in createOrPropagatePredicates() 156 if (VPBlockUtils::isBackEdge(PredBlock, CurrBlock, VPLI)) in createOrPropagatePredicates() 183 CurrBlock->setPredicate(Predicate); in createOrPropagatePredicates() 211 for (VPBlockBase *CurrBlock : RPOT) { in linearizeRegionRec() 218 if (PrevBlock && !VPLI->isLoopHeader(CurrBlock) && in linearizeRegionRec() 222 << CurrBlock->getName() << "\n"); in linearizeRegionRec() 225 CurrBlock->clearPredecessors(); in linearizeRegionRec() 226 VPBlockUtils::connectBlocks(PrevBlock, CurrBlock); in linearizeRegionRec() [all …]
|
| H A D | VPlanPredicator.h | 58 void createOrPropagatePredicates(VPBlockBase *CurrBlock,
|
| /freebsd-13.1/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
| H A D | ThreadSafetyCommon.h | 175 for (const auto *CurrBlock : *SortedGraph) { in walk() 176 VisitedBlocks.insert(CurrBlock); in walk() 178 V.enterCFGBlock(CurrBlock); in walk() 184 for (CFGBlock::const_pred_iterator SI = CurrBlock->pred_begin(), in walk() 185 SE = CurrBlock->pred_end(); in walk() 201 V.enterCFGBlockBody(CurrBlock); in walk() 204 for (const auto &BI : *CurrBlock) { in walk() 223 V.exitCFGBlockBody(CurrBlock); in walk() 230 for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(), in walk() 231 SE = CurrBlock->succ_end(); in walk() [all …]
|
| H A D | Consumed.h | 221 bool allBackEdgesVisited(const CFGBlock *CurrBlock, 248 bool splitState(const CFGBlock *CurrBlock,
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | Consumed.cpp | 1005 assert(CurrBlock && "Block pointer must not be NULL"); in allBackEdgesVisited() 1328 for (const auto *CurrBlock : *SortedGraph) { in run() 1330 CurrStates = BlockInfo.getInfo(CurrBlock); in run() 1342 for (const auto &B : *CurrBlock) { in run() 1377 if (!splitState(CurrBlock, Visitor)) { in run() 1380 if (CurrBlock->succ_size() > 1 || in run() 1381 (CurrBlock->succ_size() == 1 && in run() 1382 (*CurrBlock->succ_begin())->pred_size() > 1)) { in run() 1387 SE = CurrBlock->succ_end(); SI != SE; ++SI) { in run() 1390 if (BlockInfo.isBackEdge(CurrBlock, *SI)) { in run() [all …]
|
| H A D | ThreadSafety.cpp | 738 for (const auto *CurrBlock : *SortedGraph) { in traverseCFG() 742 VisitedBlocks.insert(CurrBlock); in traverseCFG() 781 for (const auto &BI : *CurrBlock) { in traverseCFG() 818 for (const auto *CurrBlock : *SortedGraph) { in findBlockLocations() 839 for (const auto &BI : *CurrBlock) { in findBlockLocations() 846 } else if (CurrBlock->pred_size() == 1 && *CurrBlock->pred_begin() && in findBlockLocations() 1418 if (*SI == CurrBlock && i == branchnum) in getMutexIDs() 2397 for (const auto *CurrBlock : *SortedGraph) { in runAnalysis() 2402 VisitedBlocks.insert(CurrBlock); in runAnalysis() 2483 PrevBlock, CurrBlock); in runAnalysis() [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | FlattenCFG.cpp | 250 BasicBlock *CurrBlock = LastCondBlock; in FlattenParallelAndOr() local 252 for (; CurrBlock != FirstCondBlock; in FlattenParallelAndOr() 253 CurrBlock = CurrBlock->getSinglePredecessor()) { in FlattenParallelAndOr() 254 auto *BI = cast<BranchInst>(CurrBlock->getTerminator()); in FlattenParallelAndOr()
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
| H A D | GVN.h | 201 void eraseTranslateCacheEntry(uint32_t Num, const BasicBlock &CurrBlock);
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | NewGVN.cpp | 3351 const BasicBlock *CurrBlock = getBlockForValue(V); in iterateTouchedInstructions() local 3354 if (CurrBlock != LastBlock) { in iterateTouchedInstructions() 3355 LastBlock = CurrBlock; in iterateTouchedInstructions() 3356 bool BlockReachable = ReachableBlocks.count(CurrBlock); in iterateTouchedInstructions() 3357 const auto &CurrInstRange = BlockInstRange.lookup(CurrBlock); in iterateTouchedInstructions() 3363 << getBlockName(CurrBlock) in iterateTouchedInstructions() 3367 updateProcessedCount(CurrBlock); in iterateTouchedInstructions()
|
| H A D | GVN.cpp | 2067 const BasicBlock &CurrBlock) { in eraseTranslateCacheEntry() argument 2068 for (const BasicBlock *Pred : predecessors(&CurrBlock)) in eraseTranslateCacheEntry()
|