Home
last modified time | relevance | path

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

/external/clang/include/clang/Analysis/Analyses/
DThreadSafetyCommon.h158 for (const auto *CurrBlock : *SortedGraph) { in walk()
159 VisitedBlocks.insert(CurrBlock); in walk()
161 V.enterCFGBlock(CurrBlock); in walk()
167 for (CFGBlock::const_pred_iterator SI = CurrBlock->pred_begin(), in walk()
168 SE = CurrBlock->pred_end(); in walk()
184 V.enterCFGBlockBody(CurrBlock); in walk()
187 for (const auto &BI : *CurrBlock) { in walk()
206 V.exitCFGBlockBody(CurrBlock); in walk()
213 for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(), in walk()
214 SE = CurrBlock->succ_end(); in walk()
[all …]
DConsumed.h219 bool allBackEdgesVisited(const CFGBlock *CurrBlock,
247 bool splitState(const CFGBlock *CurrBlock,
/external/clang/lib/Analysis/
DThreadSafety.cpp693 for (const auto *CurrBlock : *SortedGraph) { in traverseCFG()
694 int CurrBlockID = CurrBlock->getBlockID(); in traverseCFG()
697 VisitedBlocks.insert(CurrBlock); in traverseCFG()
702 for (CFGBlock::const_pred_iterator PI = CurrBlock->pred_begin(), in traverseCFG()
703 PE = CurrBlock->pred_end(); PI != PE; ++PI) { in traverseCFG()
736 for (CFGBlock::const_iterator BI = CurrBlock->begin(), in traverseCFG()
737 BE = CurrBlock->end(); BI != BE; ++BI) { in traverseCFG()
751 for (CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(), in traverseCFG()
752 SE = CurrBlock->succ_end(); SI != SE; ++SI) { in traverseCFG()
774 for (const auto *CurrBlock : *SortedGraph) { in findBlockLocations()
[all …]
DConsumed.cpp1026 bool ConsumedBlockInfo::allBackEdgesVisited(const CFGBlock *CurrBlock, in allBackEdgesVisited() argument
1029 assert(CurrBlock && "Block pointer must not be NULL"); in allBackEdgesVisited()
1032 unsigned int CurrBlockOrder = VisitOrder[CurrBlock->getBlockID()]; in allBackEdgesVisited()
1255 bool ConsumedAnalyzer::splitState(const CFGBlock *CurrBlock, in splitState() argument
1263 dyn_cast_or_null<IfStmt>(CurrBlock->getTerminator().getStmt())) { in splitState()
1287 dyn_cast_or_null<BinaryOperator>(CurrBlock->getTerminator().getStmt())) { in splitState()
1326 CFGBlock::const_succ_iterator SI = CurrBlock->succ_begin(); in splitState()
1363 for (const auto *CurrBlock : *SortedGraph) { in run()
1365 CurrStates = BlockInfo.getInfo(CurrBlock); in run()
1378 for (const auto &B : *CurrBlock) { in run()
[all …]
/external/llvm/lib/Transforms/Utils/
DFlattenCFG.cpp238 BasicBlock *CurrBlock = LastCondBlock; in FlattenParallelAndOr() local
240 for (;CurrBlock != FirstCondBlock; in FlattenParallelAndOr()
241 CurrBlock = CurrBlock->getSinglePredecessor()) { in FlattenParallelAndOr()
242 BranchInst *BI = dyn_cast<BranchInst>(CurrBlock->getTerminator()); in FlattenParallelAndOr()
/external/llvm/lib/Transforms/Scalar/
DLoopInterchange.cpp414 void updateIncomingBlock(BasicBlock *CurrBlock, BasicBlock *OldPred,
1141 void LoopInterchangeTransform::updateIncomingBlock(BasicBlock *CurrBlock, in updateIncomingBlock() argument
1144 for (auto I = CurrBlock->begin(); isa<PHINode>(I); ++I) { in updateIncomingBlock()