Home
last modified time | relevance | path

Searched refs:CurrBlock (Results 1 – 10 of 10) sorted by relevance

/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
H A DVPlanPredicator.cpp133 void VPlanPredicator::createOrPropagatePredicates(VPBlockBase *CurrBlock, in createOrPropagatePredicates() argument
137 if (VPDomTree.dominates(CurrBlock, Region->getExit())) { in createOrPropagatePredicates()
139 CurrBlock->setPredicate(RegionBP); in createOrPropagatePredicates()
147 VPBasicBlock *CurrBB = cast<VPBasicBlock>(CurrBlock->getEntryBasicBlock()); 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()
213 assert(!isa<VPRegionBlock>(CurrBlock) && "Nested region not expected"); in linearizeRegionRec()
218 if (PrevBlock && !VPLI->isLoopHeader(CurrBlock) && in linearizeRegionRec()
[all …]
H A DVPlanPredicator.h58 void createOrPropagatePredicates(VPBlockBase *CurrBlock,
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyCommon.h175 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 DConsumed.h221 bool allBackEdgesVisited(const CFGBlock *CurrBlock,
248 bool splitState(const CFGBlock *CurrBlock,
/netbsd-src/external/apache2/llvm/dist/clang/lib/Analysis/
H A DThreadSafety.cpp738 for (const auto *CurrBlock : *SortedGraph) { in traverseCFG()
739 unsigned CurrBlockID = CurrBlock->getBlockID(); in traverseCFG()
742 VisitedBlocks.insert(CurrBlock); in traverseCFG()
747 for (CFGBlock::const_pred_iterator PI = CurrBlock->pred_begin(), in traverseCFG()
748 PE = CurrBlock->pred_end(); PI != PE; ++PI) { in traverseCFG()
781 for (const auto &BI : *CurrBlock) { in traverseCFG()
795 for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(), in traverseCFG()
796 SE = CurrBlock->succ_end(); SI != SE; ++SI) { in traverseCFG()
818 for (const auto *CurrBlock : *SortedGraph) { in findBlockLocations()
819 CFGBlockInfo *CurrBlockInfo = &BlockInfo[CurrBlock->getBlockID()]; in findBlockLocations()
[all …]
H A DConsumed.cpp1003 bool ConsumedBlockInfo::allBackEdgesVisited(const CFGBlock *CurrBlock, in allBackEdgesVisited() argument
1005 assert(CurrBlock && "Block pointer must not be NULL"); in allBackEdgesVisited()
1008 unsigned int CurrBlockOrder = VisitOrder[CurrBlock->getBlockID()]; in allBackEdgesVisited()
1228 bool ConsumedAnalyzer::splitState(const CFGBlock *CurrBlock, in splitState() argument
1235 dyn_cast_or_null<IfStmt>(CurrBlock->getTerminator().getStmt())) { in splitState()
1255 dyn_cast_or_null<BinaryOperator>(CurrBlock->getTerminator().getStmt())) { in splitState()
1291 CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(); in splitState()
1328 for (const auto *CurrBlock : *SortedGraph) { in run()
1330 CurrStates = BlockInfo.getInfo(CurrBlock); in run()
1342 for (const auto &B : *CurrBlock) { in run()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
H A DFlattenCFG.cpp250 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()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Scalar/
H A DGVN.h199 void eraseTranslateCacheEntry(uint32_t Num, const BasicBlock &CurrBlock);
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
H A DNewGVN.cpp3351 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 DGVN.cpp2068 const BasicBlock &CurrBlock) { in eraseTranslateCacheEntry() argument
2069 for (const BasicBlock *Pred : predecessors(&CurrBlock)) in eraseTranslateCacheEntry()