| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | RegionIterator.h | 299 static nodes_iterator nodes_end(RegionT *R) { \ 315 static nodes_iterator nodes_end(RegionT *R) { \ 340 static nodes_iterator nodes_end(RegionInfo *RI) { 359 static nodes_iterator nodes_end(RegionInfoPass *RI) { 360 return GraphTraits<RegionInfo*>::nodes_end(&RI->getRegionInfo());
|
| H A D | PostDominators.h | 108 static nodes_iterator nodes_end(PostDominatorTree *N) {
|
| H A D | CallGraph.h | 487 static nodes_iterator nodes_end(CallGraph *CG) { 514 static nodes_iterator nodes_end(const CallGraph *CG) {
|
| H A D | DDG.h | 522 static nodes_iterator nodes_end(DataDependenceGraph *DG) { return DG->end(); } 563 static nodes_iterator nodes_end(const DataDependenceGraph *DG) {
|
| H A D | CFGPrinter.h | 113 static nodes_iterator nodes_end(DOTFuncInfo *CFGInfo) {
|
| /llvm-project-15.0.7/clang/include/clang/AST/ |
| H A D | StmtGraphTraits.h | 44 static nodes_iterator nodes_end(clang::Stmt* S) { 70 static nodes_iterator nodes_end(const clang::Stmt* S) {
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | MachineRegionInfo.h | 151 static nodes_iterator nodes_end(MachineRegionInfo *RI) { 170 static nodes_iterator nodes_end(MachineRegionInfoPass *RI) { 171 return GraphTraits<MachineRegionInfo *>::nodes_end(&RI->getRegionInfo());
|
| /llvm-project-15.0.7/llvm/include/llvm/ADT/ |
| H A D | GraphTraits.h | 112 GraphTraits<GraphType>::nodes_end(G)); 118 GraphTraits<Inverse<GraphType>>::nodes_end(G));
|
| /llvm-project-15.0.7/mlir/include/mlir/IR/ |
| H A D | RegionGraphTraits.h | 63 static nodes_iterator nodes_end(GraphType fn) { 80 static nodes_iterator nodes_end(GraphType fn) {
|
| /llvm-project-15.0.7/clang/include/clang/Analysis/ |
| H A D | CFG.h | 1310 iterator nodes_end() { return iterator(Blocks.end()); } in nodes_end() function 1318 const_iterator nodes_end() const { return const_iterator(Blocks.end()); } in nodes_end() function 1539 static nodes_iterator nodes_end(::clang::CFG* F) { return F->nodes_end(); } 1553 static nodes_iterator nodes_end( const ::clang::CFG* F) { 1554 return F->nodes_end(); 1568 static nodes_iterator nodes_end( ::clang::CFG* F) { return F->nodes_end(); } 1581 static nodes_iterator nodes_end(const ::clang::CFG* F) { 1582 return F->nodes_end();
|
| H A D | CallGraph.h | 282 static nodes_iterator nodes_end (clang::CallGraph *CG) { 308 static nodes_iterator nodes_end(const clang::CallGraph *CG) {
|
| /llvm-project-15.0.7/bolt/include/bolt/Core/ |
| H A D | BinaryDomTree.h | 50 static nodes_iterator nodes_end(bolt::BinaryDominatorTree *N) {
|
| /llvm-project-15.0.7/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | ExplodedGraph.h | 400 node_iterator nodes_end() { return Nodes.end(); } in nodes_end() function 404 const_node_iterator nodes_end() const { return Nodes.end(); } in nodes_end() function 538 static nodes_iterator nodes_end(const GraphTy G) {
|
| /llvm-project-15.0.7/llvm/unittests/Analysis/ |
| H A D | CallGraphTest.cpp | 22 auto E = GraphTraits<Ty *>::nodes_end(G); in canSpecializeGraphTraitsIterators()
|
| /llvm-project-15.0.7/clang/include/clang/Analysis/Analyses/ |
| H A D | Dominators.h | 295 static nodes_iterator nodes_end(::clang::DomTreeNode *N) { 310 static nodes_iterator nodes_end(clang::CFGDomTree *N) {
|
| /llvm-project-15.0.7/llvm/include/llvm/IR/ |
| H A D | Dominators.h | 240 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); } 261 static nodes_iterator nodes_end(DominatorTree *N) {
|
| H A D | CFG.h | 360 static nodes_iterator nodes_end(Function *F) { 377 static nodes_iterator nodes_end(const Function *F) {
|
| /llvm-project-15.0.7/polly/include/polly/ |
| H A D | ScopGraphPrinter.h | 37 static nodes_iterator nodes_end(polly::ScopDetection *SD) {
|
| /llvm-project-15.0.7/llvm/lib/Target/X86/ |
| H A D | ImmutableGraph.h | 92 const Node *nodes_end() const { return nodes().end(); } in nodes_end() function 428 static nodes_iterator nodes_end(GraphT *G) { 429 return {G->nodes_end(), &getNode};
|
| /llvm-project-15.0.7/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | AnalyzerStatsChecker.cpp | 55 I != G.nodes_end(); ++I) { in checkEndAnalysis()
|
| H A D | UnreachableCodeChecker.cpp | 61 for (ExplodedGraph::node_iterator I = G.nodes_begin(), E = G.nodes_end(); in checkEndAnalysis()
|
| /llvm-project-15.0.7/mlir/include/mlir/Analysis/ |
| H A D | CallGraph.h | 255 static nodes_iterator nodes_end(mlir::CallGraph *cg) { return cg->end(); }
|
| /llvm-project-15.0.7/llvm/include/llvm/Transforms/IPO/ |
| H A D | ProfiledCallGraph.h | 206 static ChildIteratorType nodes_end(ProfiledCallGraph *PCG) {
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | MachineBlockFrequencyInfo.cpp | 109 static nodes_iterator nodes_end(const MachineBlockFrequencyInfo *G) { in nodes_end() function
|
| /llvm-project-15.0.7/llvm/unittests/ADT/ |
| H A D | DirectedGraphTest.cpp | 87 static nodes_iterator nodes_end(DGTestGraph *DG) { return DG->end(); } in nodes_end() function
|