Home
last modified time | relevance | path

Searched refs:nodes_begin (Results 1 – 25 of 44) sorted by relevance

12

/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DRegionIterator.h296 static nodes_iterator nodes_begin(RegionT *R) { \
312 static nodes_iterator nodes_begin(RegionT *R) { \
336 static nodes_iterator nodes_begin(RegionInfo* RI) {
355 static nodes_iterator nodes_begin(RegionInfoPass* RI) {
356 return GraphTraits<RegionInfo*>::nodes_begin(&RI->getRegionInfo());
H A DPostDominators.h104 static nodes_iterator nodes_begin(PostDominatorTree *N) {
H A DCallGraph.h483 static nodes_iterator nodes_begin(CallGraph *CG) {
510 static nodes_iterator nodes_begin(const CallGraph *CG) {
H A DDDG.h519 static nodes_iterator nodes_begin(DataDependenceGraph *DG) {
560 static nodes_iterator nodes_begin(const DataDependenceGraph *DG) {
H A DCFGPrinter.h109 static nodes_iterator nodes_begin(DOTFuncInfo *CFGInfo) {
/llvm-project-15.0.7/clang/include/clang/AST/
H A DStmtGraphTraits.h40 static nodes_iterator nodes_begin(clang::Stmt* S) {
66 static nodes_iterator nodes_begin(const clang::Stmt* S) {
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DMachineRegionInfo.h147 static nodes_iterator nodes_begin(MachineRegionInfo *RI) {
166 static nodes_iterator nodes_begin(MachineRegionInfoPass *RI) {
167 return GraphTraits<MachineRegionInfo *>::nodes_begin(&RI->getRegionInfo());
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DGraphTraits.h111 return make_range(GraphTraits<GraphType>::nodes_begin(G),
117 return make_range(GraphTraits<Inverse<GraphType>>::nodes_begin(G),
/llvm-project-15.0.7/mlir/include/mlir/IR/
H A DRegionGraphTraits.h60 static nodes_iterator nodes_begin(GraphType fn) {
77 static nodes_iterator nodes_begin(GraphType fn) {
/llvm-project-15.0.7/llvm/lib/Target/X86/
H A DImmutableGraph.h91 const Node *nodes_begin() const { return nodes().begin(); } in nodes_begin() function
103 return std::distance(nodes_begin(), &N); in getNodeIndex()
186 return Set.G.nodes_begin() + Current;
414 static NodeRef getEntryNode(GraphT *G) { return G->nodes_begin(); }
425 static nodes_iterator nodes_begin(GraphT *G) {
426 return {G->nodes_begin(), &getNode};
/llvm-project-15.0.7/clang/include/clang/Analysis/
H A DCFG.h1309 iterator nodes_begin() { return iterator(Blocks.begin()); } in nodes_begin() function
1317 const_iterator nodes_begin() const { return const_iterator(Blocks.begin()); } in nodes_begin() function
1538 static nodes_iterator nodes_begin(::clang::CFG* F) { return F->nodes_begin();}
1549 static nodes_iterator nodes_begin( const ::clang::CFG* F) {
1550 return F->nodes_begin();
1567 static nodes_iterator nodes_begin( ::clang::CFG* F) {return F->nodes_begin();}
1577 static nodes_iterator nodes_begin(const ::clang::CFG* F) {
1578 return F->nodes_begin();
H A DCallGraph.h278 static nodes_iterator nodes_begin(clang::CallGraph *CG) {
304 static nodes_iterator nodes_begin(const clang::CallGraph *CG) {
/llvm-project-15.0.7/bolt/include/bolt/Core/
H A DBinaryDomTree.h46 static nodes_iterator nodes_begin(bolt::BinaryDominatorTree *N) {
/llvm-project-15.0.7/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h398 node_iterator nodes_begin() { return Nodes.begin(); } in nodes_begin() function
402 const_node_iterator nodes_begin() const { return Nodes.begin(); } in nodes_begin() function
534 static nodes_iterator nodes_begin(const GraphTy G) {
/llvm-project-15.0.7/llvm/unittests/Analysis/
H A DCallGraphTest.cpp21 auto I = GraphTraits<Ty *>::nodes_begin(G); in canSpecializeGraphTraitsIterators()
/llvm-project-15.0.7/clang/include/clang/Analysis/Analyses/
H A DDominators.h291 static nodes_iterator nodes_begin(::clang::DomTreeNode *N) {
306 static nodes_iterator nodes_begin(clang::CFGDomTree *N) {
/llvm-project-15.0.7/llvm/include/llvm/IR/
H A DDominators.h236 static nodes_iterator nodes_begin(NodeRef N) {
257 static nodes_iterator nodes_begin(DominatorTree *N) {
H A DCFG.h356 static nodes_iterator nodes_begin(Function *F) {
373 static nodes_iterator nodes_begin(const Function *F) {
/llvm-project-15.0.7/polly/include/polly/
H A DScopGraphPrinter.h34 static nodes_iterator nodes_begin(polly::ScopDetection *SD) {
/llvm-project-15.0.7/clang/lib/StaticAnalyzer/Checkers/
H A DAnalyzerStatsChecker.cpp54 for (ExplodedGraph::node_iterator I = G.nodes_begin(); in checkEndAnalysis()
H A DUnreachableCodeChecker.cpp61 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 DCallGraph.h254 static nodes_iterator nodes_begin(mlir::CallGraph *cg) { return cg->begin(); }
/llvm-project-15.0.7/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h202 static ChildIteratorType nodes_begin(ProfiledCallGraph *PCG) {
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DMachineBlockFrequencyInfo.cpp105 static nodes_iterator nodes_begin(const MachineBlockFrequencyInfo *G) { in nodes_begin() function
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DDirectedGraphTest.cpp86 static nodes_iterator nodes_begin(DGTestGraph *DG) { return DG->begin(); } in nodes_begin() function

12