Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyCommon.h176 for (const auto *CurrBlock : *SortedGraph) { in walk()
177 VisitedBlocks.insert(CurrBlock); in walk()
179 V.enterCFGBlock(CurrBlock); in walk()
185 for (CFGBlock::const_pred_iterator SI = CurrBlock->pred_begin(), in walk()
186 SE = CurrBlock->pred_end(); in walk()
202 V.enterCFGBlockBody(CurrBlock); in walk()
205 for (const auto &BI : *CurrBlock) { in walk()
224 V.exitCFGBlockBody(CurrBlock); in walk()
231 for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(), in walk()
232 SE = CurrBlock->succ_end(); in walk()
[all …]
H A DConsumed.h222 bool allBackEdgesVisited(const CFGBlock *CurrBlock,
249 bool splitState(const CFGBlock *CurrBlock,
/freebsd-12.1/contrib/llvm/tools/clang/lib/Analysis/
H A DThreadSafety.cpp734 for (const auto *CurrBlock : *SortedGraph) { in traverseCFG()
738 VisitedBlocks.insert(CurrBlock); in traverseCFG()
777 for (const auto &BI : *CurrBlock) { in traverseCFG()
814 for (const auto *CurrBlock : *SortedGraph) { in findBlockLocations()
835 for (const auto &BI : *CurrBlock) { in findBlockLocations()
842 } else if (CurrBlock->pred_size() == 1 && *CurrBlock->pred_begin() && in findBlockLocations()
1401 if (*SI == CurrBlock && i == branchnum) in getMutexIDs()
2363 for (const auto *CurrBlock : *SortedGraph) { in runAnalysis()
2368 VisitedBlocks.insert(CurrBlock); in runAnalysis()
2449 PrevBlock, CurrBlock); in runAnalysis()
[all …]
H A DConsumed.cpp1006 assert(CurrBlock && "Block pointer must not be NULL"); in allBackEdgesVisited()
1329 for (const auto *CurrBlock : *SortedGraph) { in run()
1331 CurrStates = BlockInfo.getInfo(CurrBlock); in run()
1343 for (const auto &B : *CurrBlock) { in run()
1378 if (!splitState(CurrBlock, Visitor)) { in run()
1381 if (CurrBlock->succ_size() > 1 || in run()
1382 (CurrBlock->succ_size() == 1 && in run()
1383 (*CurrBlock->succ_begin())->pred_size() > 1)) { in run()
1388 SE = CurrBlock->succ_end(); SI != SE; ++SI) { in run()
1391 if (BlockInfo.isBackEdge(CurrBlock, *SI)) { in run()
[all …]
/freebsd-12.1/contrib/llvm/lib/Transforms/Utils/
H A DFlattenCFG.cpp251 BasicBlock *CurrBlock = LastCondBlock; in FlattenParallelAndOr() local
253 for (; CurrBlock != FirstCondBlock; in FlattenParallelAndOr()
254 CurrBlock = CurrBlock->getSinglePredecessor()) { in FlattenParallelAndOr()
255 BranchInst *BI = dyn_cast<BranchInst>(CurrBlock->getTerminator()); in FlattenParallelAndOr()
/freebsd-12.1/contrib/llvm/include/llvm/Transforms/Scalar/
H A DGVN.h139 void eraseTranslateCacheEntry(uint32_t Num, const BasicBlock &CurrBlock);
/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DNewGVN.cpp3393 const BasicBlock *CurrBlock = getBlockForValue(V); in iterateTouchedInstructions() local
3396 if (CurrBlock != LastBlock) { in iterateTouchedInstructions()
3397 LastBlock = CurrBlock; in iterateTouchedInstructions()
3398 bool BlockReachable = ReachableBlocks.count(CurrBlock); in iterateTouchedInstructions()
3399 const auto &CurrInstRange = BlockInstRange.lookup(CurrBlock); in iterateTouchedInstructions()
3405 << getBlockName(CurrBlock) in iterateTouchedInstructions()
3409 updateProcessedCount(CurrBlock); in iterateTouchedInstructions()
H A DLoopInterchange.cpp1283 static void updateIncomingBlock(BasicBlock *CurrBlock, BasicBlock *OldPred, in updateIncomingBlock() argument
1285 for (PHINode &PHI : CurrBlock->phis()) { in updateIncomingBlock()
H A DGVN.cpp1595 const BasicBlock &CurrBlock) { in eraseTranslateCacheEntry() argument
1596 for (const BasicBlock *Pred : predecessors(&CurrBlock)) { in eraseTranslateCacheEntry()