Searched refs:getEntryNode (Results 1 - 25 of 92) sorted by relevance

1234

/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DPostDominators.h100 static NodeRef getEntryNode(PostDominatorTree *DT) { function in struct:llvm::GraphTraits
105 if (getEntryNode(N))
106 return df_begin(getEntryNode(N));
108 return df_end(getEntryNode(N));
112 return df_end(getEntryNode(N));
H A DRegionIterator.h262 static NodeRef getEntryNode(NodeRef N) { return N; } \
274 static NodeRef getEntryNode(NodeRef N) { return N; } \
286 static NodeRef getEntryNode(RegionT *R) { \
290 return nodes_iterator::begin(getEntryNode(R)); \
293 return nodes_iterator::end(getEntryNode(R)); \
302 static NodeRef getEntryNode(RegionT *R) { \
306 return nodes_iterator::begin(getEntryNode(R)); \
309 return nodes_iterator::end(getEntryNode(R)); \
325 static NodeRef getEntryNode(RegionInfo *RI) { function in struct:llvm::GraphTraits
326 return GraphTraits<FlatIt<Region*>>::getEntryNode(R
344 static NodeRef getEntryNode(RegionInfoPass *RI) { function in struct:llvm::GraphTraits
[all...]
H A DInterval.h123 static NodeRef getEntryNode(Interval *I) { return I; } function in struct:llvm::GraphTraits
134 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; } function in struct:llvm::GraphTraits
H A DCallGraph.h431 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; } function in struct:GraphTraits
451 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; } function in struct:GraphTraits
479 static NodeRef getEntryNode(CallGraph *CGN) { function in struct:GraphTraits
506 static NodeRef getEntryNode(const CallGraph *CGN) { function in struct:GraphTraits
H A DDDG.h484 static NodeRef getEntryNode(NodeRef N) { return N; } function in struct:llvm::DDGEdge::GraphTraits
501 static NodeRef getEntryNode(DataDependenceGraph *DG) { function in struct:llvm::DDGEdge::GraphTraits
524 static NodeRef getEntryNode(NodeRef N) { return N; } function in struct:llvm::DDGEdge::GraphTraits
542 static NodeRef getEntryNode(const DataDependenceGraph *DG) { function in struct:llvm::DDGEdge::GraphTraits
H A DLoopIterator.h74 static NodeRef getEntryNode(const Loop &G) { return {&G, G.getHeader()}; } function in struct:llvm::LoopBodyTraits
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineRegionInfo.h142 static NodeRef getEntryNode(MachineRegionInfo *RI) { function in struct:llvm::GraphTraits
143 return GraphTraits<FlatIt<MachineRegion *>>::getEntryNode(
148 return nodes_iterator::begin(getEntryNode(RI));
152 return nodes_iterator::end(getEntryNode(RI));
162 static NodeRef getEntryNode(MachineRegionInfoPass *RI) { function in struct:llvm::GraphTraits
163 return GraphTraits<MachineRegionInfo *>::getEntryNode(&RI->getRegionInfo());
H A DMachineLoopInfo.h180 static NodeRef getEntryNode(const MachineLoop *L) { return L; } function in struct:llvm::GraphTraits
189 static NodeRef getEntryNode(MachineLoop *L) { return L; } function in struct:llvm::GraphTraits
H A DMachineDominators.h254 static NodeRef getEntryNode(NodeRef N) { return N; } function in struct:llvm::MachineDomTreeGraphTraitsBase
275 static NodeRef getEntryNode(MachineDominatorTree *DT) { function in struct:llvm::GraphTraits
H A DMachineBasicBlock.h954 static NodeRef getEntryNode(MachineBasicBlock *BB) { return BB; } function in struct:llvm::GraphTraits
963 static NodeRef getEntryNode(const MachineBasicBlock *BB) { return BB; } function in struct:llvm::GraphTraits
978 static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) { function in struct:llvm::GraphTraits
990 static NodeRef getEntryNode(Inverse<const MachineBasicBlock *> G) { function in struct:llvm::GraphTraits
H A DMachineFunction.h1083 static NodeRef getEntryNode(MachineFunction *F) { return &F->front(); }
1100 static NodeRef getEntryNode(const MachineFunction *F) { return &F->front(); } function in struct:llvm::MachineFunction::GraphTraits
1125 static NodeRef getEntryNode(Inverse<MachineFunction *> G) { function in struct:llvm::MachineFunction::GraphTraits
1131 static NodeRef getEntryNode(Inverse<const MachineFunction *> G) { function in struct:llvm::MachineFunction::GraphTraits
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/AST/
H A DStmtGraphTraits.h28 static NodeRef getEntryNode(clang::Stmt *S) { return S; } function in struct:llvm::GraphTraits
54 static NodeRef getEntryNode(const clang::Stmt *S) { return S; } function in struct:llvm::GraphTraits
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DDominators.h198 static NodeRef getEntryNode(NodeRef N) { return N; } function in struct:llvm::DomTreeGraphTraitsBase
203 return df_begin(getEntryNode(N));
206 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
221 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); } function in struct:llvm::GraphTraits
224 return df_begin(getEntryNode(N));
228 return df_end(getEntryNode(N));
H A DCFG.h303 static NodeRef getEntryNode(BasicBlock *BB) { return BB; } function in struct:llvm::GraphTraits
312 static NodeRef getEntryNode(const BasicBlock *BB) { return BB; } function in struct:llvm::GraphTraits
327 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; } function in struct:llvm::GraphTraits
336 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; } function in struct:llvm::GraphTraits
350 static NodeRef getEntryNode(Function *F) { return &F->getEntryBlock(); } function in struct:llvm::GraphTraits
367 static NodeRef getEntryNode(const Function *F) { return &F->getEntryBlock(); } function in struct:llvm::GraphTraits
390 static NodeRef getEntryNode(Inverse<Function *> G) { function in struct:llvm::GraphTraits
396 static NodeRef getEntryNode(Inverse<const Function *> G) { function in struct:llvm::GraphTraits
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DDominators.h354 static NodeRef getEntryNode(NodeRef N) { return N; } function in struct:llvm::GraphTraits
362 return nodes_iterator(df_begin(getEntryNode(N)));
366 return nodes_iterator(df_end(getEntryNode(N)));
372 static NodeRef getEntryNode(clang::CFGDomTree *DT) { function in struct:llvm::GraphTraits
377 return nodes_iterator(df_begin(getEntryNode(N)));
381 return nodes_iterator(df_end(getEntryNode(N)));
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/Analysis/
H A DCallGraph.h248 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; } function in struct:llvm::GraphTraits
258 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; } function in struct:llvm::GraphTraits
265 static NodeType *getEntryNode(clang::CallGraph *CGN) { function in struct:llvm::GraphTraits
291 static NodeType *getEntryNode(const clang::CallGraph *CGN) { function in struct:llvm::GraphTraits
H A DCFG.h1475 static NodeRef getEntryNode(::clang::CFGBlock *BB) { return BB; }
1487 static NodeRef getEntryNode(const clang::CFGBlock *BB) { return BB; }
1499 static NodeRef getEntryNode(Inverse<::clang::CFGBlock *> G) {
1514 static NodeRef getEntryNode(Inverse<const ::clang::CFGBlock *> G) {
1531 static NodeRef getEntryNode(::clang::CFG *F) { return &F->getEntry(); }
1541 static NodeRef getEntryNode(const ::clang::CFG *F) { return &F->getEntry(); }
1560 static NodeRef getEntryNode(::clang::CFG *F) { return &F->getExit(); }
1569 static NodeRef getEntryNode(const ::clang::CFG *F) { return &F->getExit(); }
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DPostOrderIterator.h142 return po_iterator(GT::getEntryNode(G));
147 return po_iterator(GT::getEntryNode(G), S);
301 ReversePostOrderTraversal(GraphT G) { Initialize(GT::getEntryNode(G)); }
H A DBreadthFirstIterator.h114 return bf_iterator(GT::getEntryNode(G));
H A DDepthFirstIterator.h151 return df_iterator(GT::getEntryNode(G));
157 return df_iterator(GT::getEntryNode(G), S);
H A DSCCIterator.h102 return scc_iterator(GT::getEntryNode(G));
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineRegionInfo.cpp67 MachineBasicBlock *Entry = GraphTraits<MachineFunction*>::getEntryNode(&F);
H A DMachineBlockFrequencyInfo.cpp93 static NodeRef getEntryNode(const MachineBlockFrequencyInfo *G) { function in struct:llvm::GraphTraits
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Lanai/
H A DLanaiISelDAGToDAG.cpp291 SDValue New = CurDAG->getCopyFromReg(CurDAG->getEntryNode(),
298 SDValue New = CurDAG->getCopyFromReg(CurDAG->getEntryNode(),
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp121 static NodeRef getEntryNode(Region *R) { function in struct:__anon4717::SubGraphTraits
122 return {GraphTraits<Region *>::getEntryNode(R), nullptr};
125 static NodeRef getEntryNode(NodeRef N) { return N; } function in struct:__anon4717::SubGraphTraits
374 auto EntryNode = SubGraphTraits::getEntryNode(ParentRegion);

Completed in 106 milliseconds

1234