Home
last modified time | relevance | path

Searched refs:getEntryNode (Results 1 – 25 of 98) sorted by relevance

1234

/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DRegionIterator.h269 static NodeRef getEntryNode(NodeRef N) { return N; } \
281 static NodeRef getEntryNode(NodeRef N) { return N; } \
293 static NodeRef getEntryNode(RegionT *R) { \
297 return nodes_iterator::begin(getEntryNode(R)); \
300 return nodes_iterator::end(getEntryNode(R)); \
309 static NodeRef getEntryNode(RegionT *R) { \
313 return nodes_iterator::begin(getEntryNode(R)); \
316 return nodes_iterator::end(getEntryNode(R)); \
332 static NodeRef getEntryNode(RegionInfo *RI) {
333 return GraphTraits<FlatIt<Region*>>::getEntryNode(RI->getTopLevelRegion());
[all …]
H A DPostDominators.h100 static NodeRef getEntryNode(PostDominatorTree *DT) {
105 if (getEntryNode(N))
106 return df_begin(getEntryNode(N));
108 return df_end(getEntryNode(N));
112 return df_end(getEntryNode(N));
H A DInterval.h120 static NodeRef getEntryNode(Interval *I) { return I; }
131 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
H A DCallGraph.h424 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
444 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
472 static NodeRef getEntryNode(CallGraph *CGN) {
499 static NodeRef getEntryNode(const CallGraph *CGN) {
H A DDDG.h510 static NodeRef getEntryNode(NodeRef N) { return N; }
527 static NodeRef getEntryNode(DataDependenceGraph *DG) {
550 static NodeRef getEntryNode(NodeRef N) { return N; }
568 static NodeRef getEntryNode(const DataDependenceGraph *DG) {
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DMachineRegionInfo.h142 static NodeRef getEntryNode(MachineRegionInfo *RI) {
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) {
163 return GraphTraits<MachineRegionInfo *>::getEntryNode(&RI->getRegionInfo());
H A DMachineLoopInfo.h186 static NodeRef getEntryNode(const MachineLoop *L) { return L; }
195 static NodeRef getEntryNode(MachineLoop *L) { return L; }
H A DMachineDominators.h253 static NodeRef getEntryNode(NodeRef N) { return N; } in getEntryNode() function
274 static NodeRef getEntryNode(MachineDominatorTree *DT) {
H A DMachineFunction.h1149 static NodeRef getEntryNode(MachineFunction *F) { return &F->front(); }
1166 static NodeRef getEntryNode(const MachineFunction *F) { return &F->front(); }
1191 static NodeRef getEntryNode(Inverse<MachineFunction *> G) {
1197 static NodeRef getEntryNode(Inverse<const MachineFunction *> G) {
H A DMachineBasicBlock.h1137 static NodeRef getEntryNode(MachineBasicBlock *BB) { return BB; }
1146 static NodeRef getEntryNode(const MachineBasicBlock *BB) { return BB; }
1161 static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) {
1173 static NodeRef getEntryNode(Inverse<const MachineBasicBlock *> G) {
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/IR/
H A DCFG.h305 static NodeRef getEntryNode(BasicBlock *BB) { return BB; }
314 static NodeRef getEntryNode(const BasicBlock *BB) { return BB; }
329 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
338 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
352 static NodeRef getEntryNode(Function *F) { return &F->getEntryBlock(); }
369 static NodeRef getEntryNode(const Function *F) { return &F->getEntryBlock(); }
392 static NodeRef getEntryNode(Inverse<Function *> G) {
398 static NodeRef getEntryNode(Inverse<const Function *> G) {
H A DDominators.h217 static NodeRef getEntryNode(NodeRef N) { return N; }
222 return df_begin(getEntryNode(N));
225 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
240 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }
243 return df_begin(getEntryNode(N));
247 return df_end(getEntryNode(N));
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/
H A DDominators.h284 static NodeRef getEntryNode(NodeRef N) { return N; }
292 return nodes_iterator(df_begin(getEntryNode(N)));
296 return nodes_iterator(df_end(getEntryNode(N)));
302 static NodeRef getEntryNode(clang::CFGDomTree *DT) {
307 return nodes_iterator(df_begin(getEntryNode(N)));
311 return nodes_iterator(df_end(getEntryNode(N)));
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h85 ProfiledCallGraphNode *getEntryNode() { return &Root; } in getEntryNode() function
134 static NodeRef getEntryNode(NodeRef PCGN) { return PCGN; }
142 static NodeRef getEntryNode(ProfiledCallGraph *PCG) {
143 return PCG->getEntryNode();
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/Analysis/
H A DCallGraph.h248 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; }
258 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; }
265 static NodeType *getEntryNode(clang::CallGraph *CGN) {
291 static NodeType *getEntryNode(const clang::CallGraph *CGN) {
H A DCFG.h1487 static NodeRef getEntryNode(::clang::CFGBlock *BB) { return BB; }
1499 static NodeRef getEntryNode(const clang::CFGBlock *BB) { return BB; }
1511 static NodeRef getEntryNode(Inverse<::clang::CFGBlock *> G) {
1526 static NodeRef getEntryNode(Inverse<const ::clang::CFGBlock *> G) {
1543 static NodeRef getEntryNode(::clang::CFG *F) { return &F->getEntry(); }
1553 static NodeRef getEntryNode(const ::clang::CFG *F) { return &F->getEntry(); }
1572 static NodeRef getEntryNode(::clang::CFG *F) { return &F->getExit(); }
1581 static NodeRef getEntryNode(const ::clang::CFG *F) { return &F->getExit(); }
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/AST/
H A DStmtGraphTraits.h28 static NodeRef getEntryNode(clang::Stmt *S) { return S; }
54 static NodeRef getEntryNode(const clang::Stmt *S) { return S; }
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
H A DDepthFirstIterator.h153 return df_iterator(GT::getEntryNode(G)); in begin()
159 return df_iterator(GT::getEntryNode(G), S); in begin()
H A DPostOrderIterator.h144 return po_iterator(GT::getEntryNode(G)); in begin()
149 return po_iterator(GT::getEntryNode(G), S); in begin()
H A DBreadthFirstIterator.h115 return bf_iterator(GT::getEntryNode(G)); in begin()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Lanai/
H A DLanaiISelDAGToDAG.cpp291 SDValue New = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), in Select()
298 SDValue New = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), in Select()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
H A DVPlan.h1707 static NodeRef getEntryNode(NodeRef N) { return N; }
1722 static NodeRef getEntryNode(NodeRef N) { return N; }
1739 static NodeRef getEntryNode(Inverse<NodeRef> B) { return B.Graph; }
1762 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); }
1781 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); }
1800 static NodeRef getEntryNode(Inverse<GraphRef> N) {
1913 getEntryNode(VPBlockRecursiveTraversalWrapper<VPBlockBase *> N) {
1932 getEntryNode(VPBlockRecursiveTraversalWrapper<const VPBlockBase *> N) {
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DMachineRegionInfo.cpp67 MachineBasicBlock *Entry = GraphTraits<MachineFunction*>::getEntryNode(&F); in recalculate()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp123 static NodeRef getEntryNode(Region *R) { in getEntryNode() function
124 return {GraphTraits<Region *>::getEntryNode(R), nullptr}; in getEntryNode()
127 static NodeRef getEntryNode(NodeRef N) { return N; } in getEntryNode() function
379 auto EntryNode = SubGraphTraits::getEntryNode(ParentRegion); in INITIALIZE_PASS_DEPENDENCY()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
H A DFunctionAttrs.cpp357 ArgumentGraphNode *getEntryNode() { return &SyntheticRoot; } in getEntryNode() function in __anonee0cb9240211::ArgumentGraph
437 static NodeRef getEntryNode(NodeRef A) { return A; } in getEntryNode() function
444 static NodeRef getEntryNode(ArgumentGraph *AG) { return AG->getEntryNode(); } in getEntryNode() function

1234