Home
last modified time | relevance | path

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

/openbsd-src/gnu/llvm/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyCommon.h177 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 …]
H A DConsumed.h220 bool allBackEdgesVisited(const CFGBlock *CurrBlock,
247 bool splitState(const CFGBlock *CurrBlock,
/openbsd-src/gnu/llvm/clang/lib/Analysis/
H A DThreadSafety.cpp732 for (const auto *CurrBlock : *SortedGraph) { in traverseCFG()
733 unsigned CurrBlockID = CurrBlock->getBlockID(); in traverseCFG()
736 VisitedBlocks.insert(CurrBlock); in traverseCFG()
741 for (CFGBlock::const_pred_iterator PI = CurrBlock->pred_begin(), in traverseCFG()
742 PE = CurrBlock->pred_end(); PI != PE; ++PI) { in traverseCFG()
775 for (const auto &BI : *CurrBlock) { in traverseCFG()
789 for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(), in traverseCFG()
790 SE = CurrBlock->succ_end(); SI != SE; ++SI) { in traverseCFG()
812 for (const auto *CurrBlock : *SortedGraph) { in findBlockLocations()
813 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 …]
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/
H A DFlattenCFG.cpp248 BasicBlock *CurrBlock = LastCondBlock; in FlattenParallelAndOr() local
250 for (; CurrBlock != FirstCondBlock; in FlattenParallelAndOr()
251 CurrBlock = CurrBlock->getSinglePredecessor()) { in FlattenParallelAndOr()
252 auto *BI = cast<BranchInst>(CurrBlock->getTerminator()); in FlattenParallelAndOr()
/openbsd-src/gnu/llvm/llvm/include/llvm/Transforms/Scalar/
H A DGVN.h204 void eraseTranslateCacheEntry(uint32_t Num, const BasicBlock &CurrBlock);
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DNewGVN.cpp3381 const BasicBlock *CurrBlock = getBlockForValue(V); in iterateTouchedInstructions() local
3384 if (CurrBlock != LastBlock) { in iterateTouchedInstructions()
3385 LastBlock = CurrBlock; in iterateTouchedInstructions()
3386 bool BlockReachable = ReachableBlocks.count(CurrBlock); in iterateTouchedInstructions()
3387 const auto &CurrInstRange = BlockInstRange.lookup(CurrBlock); in iterateTouchedInstructions()
3393 << getBlockName(CurrBlock) in iterateTouchedInstructions()
3397 updateProcessedCount(CurrBlock); in iterateTouchedInstructions()
H A DGVN.cpp2192 uint32_t Num, const BasicBlock &CurrBlock) { in eraseTranslateCacheEntry() argument
2193 for (const BasicBlock *Pred : predecessors(&CurrBlock)) in eraseTranslateCacheEntry()