Home
last modified time | relevance | path

Searched refs:SortedGraph (Results 1 – 4 of 4) sorted by relevance

/freebsd-14.2/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyCommon.h163 SortedGraph = AC.getAnalysis<PostOrderCFGView>(); in init()
164 if (!SortedGraph) in init()
177 for (const auto *CurrBlock : *SortedGraph) { in walk()
261 const PostOrderCFGView *getSortedGraph() const { return SortedGraph; } in getSortedGraph()
266 PostOrderCFGView *SortedGraph = nullptr; variable
H A DConsumed.h217 ConsumedBlockInfo(unsigned int NumBlocks, PostOrderCFGView *SortedGraph) in ConsumedBlockInfo() argument
220 for (const auto BI : *SortedGraph) in ConsumedBlockInfo()
/freebsd-14.2/contrib/llvm-project/clang/lib/Analysis/
H A DThreadSafety.cpp512 void traverseCFG(CFG *CFGraph, const PostOrderCFGView *SortedGraph,
727 const PostOrderCFGView *SortedGraph, in traverseCFG() argument
731 for (const auto *CurrBlock : *SortedGraph) { in traverseCFG()
809 const PostOrderCFGView *SortedGraph, in findBlockLocations() argument
811 for (const auto *CurrBlock : *SortedGraph) { in findBlockLocations()
2302 const PostOrderCFGView *SortedGraph = walker.getSortedGraph(); in runAnalysis() local
2312 LocalVarMap.traverseCFG(CFGraph, SortedGraph, BlockInfo); in runAnalysis()
2315 findBlockLocations(CFGraph, SortedGraph, BlockInfo); in runAnalysis()
2324 if (!SortedGraph->empty() && D->hasAttrs()) { in runAnalysis()
2325 assert(*SortedGraph->begin() == &CFGraph->getEntry()); in runAnalysis()
[all …]
H A DConsumed.cpp1315 PostOrderCFGView *SortedGraph = AC.getAnalysis<PostOrderCFGView>(); in run() local
1318 BlockInfo = ConsumedBlockInfo(CFGraph->getNumBlockIDs(), SortedGraph); in run()
1328 for (const auto *CurrBlock : *SortedGraph) { in run()