Searched refs:getEntryNode (Results 1 – 25 of 172) sorted by relevance
1234567
263 static NodeRef getEntryNode(NodeRef N) { return N; } \275 static NodeRef getEntryNode(NodeRef N) { return N; } \287 static NodeRef getEntryNode(RegionT *R) { \291 return nodes_iterator::begin(getEntryNode(R)); \294 return nodes_iterator::end(getEntryNode(R)); \303 static NodeRef getEntryNode(RegionT *R) { \307 return nodes_iterator::begin(getEntryNode(R)); \310 return nodes_iterator::end(getEntryNode(R)); \326 static NodeRef getEntryNode(RegionInfo *RI) {327 return GraphTraits<FlatIt<Region*>>::getEntryNode(RI->getTopLevelRegion());[all …]
98 static NodeRef getEntryNode(PostDominatorTree *DT) {103 if (getEntryNode(N))104 return df_begin(getEntryNode(N));106 return df_end(getEntryNode(N));110 return df_end(getEntryNode(N));
124 static NodeRef getEntryNode(Interval *I) { return I; }135 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
411 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }431 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }459 static NodeRef getEntryNode(CallGraph *CGN) {486 static NodeRef getEntryNode(const CallGraph *CGN) {
256 static NodeType *getEntryNode(NodeType* N) { return N; } \267 static NodeType *getEntryNode(NodeType* N) { return N; } \280 static NodeType *getEntryNode(RegionT* R) { \284 return nodes_iterator::begin(getEntryNode(R)); \287 return nodes_iterator::end(getEntryNode(R)); \294 static NodeType *getEntryNode(RegionT* R) { \298 return nodes_iterator::begin(getEntryNode(R)); \301 return nodes_iterator::end(getEntryNode(R)); \316 static NodeType *getEntryNode(RegionInfo *RI) {317 return GraphTraits<FlatIt<Region*> >::getEntryNode(RI->getTopLevelRegion());[all …]
92 static NodeType *getEntryNode(PostDominatorTree *DT) {97 if (getEntryNode(N))98 return df_begin(getEntryNode(N));100 return df_end(getEntryNode(N));104 return df_end(getEntryNode(N));
127 static NodeType *getEntryNode(Interval *I) { return I; }141 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
418 static NodeType *getEntryNode(CallGraphNode *CGN) { return CGN; }439 static NodeType *getEntryNode(const CallGraphNode *CGN) { return CGN; }456 static NodeType *getEntryNode(CallGraph *CGN) {479 static NodeType *getEntryNode(const CallGraph *CGN) {
173 static NodeType *getEntryNode(NodeType *N) {186 return df_begin(getEntryNode(N));190 return df_end(getEntryNode(N));196 static NodeType *getEntryNode(::clang::DominatorTree *DT) {201 return df_begin(getEntryNode(N));205 return df_end(getEntryNode(N));
160 static NodeType *getEntryNode(BasicBlock *BB) { return BB; }173 static NodeType *getEntryNode(const BasicBlock *BB) { return BB; }191 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }203 static NodeType *getEntryNode(Inverse<const BasicBlock*> G) {225 static NodeType *getEntryNode(Function *F) { return &F->getEntryBlock(); }235 static NodeType *getEntryNode(const Function *F) {return &F->getEntryBlock();}252 static NodeType *getEntryNode(Inverse<Function*> G) {258 static NodeType *getEntryNode(Inverse<const Function *> G) {
162 static NodeType *getEntryNode(NodeType *N) { return N; }169 return df_begin(getEntryNode(N));173 return df_end(getEntryNode(N));188 static NodeType *getEntryNode(DominatorTree *DT) {193 return df_begin(getEntryNode(N));197 return df_end(getEntryNode(N));
143 static NodeRef getEntryNode(MachineRegionInfo *RI) {144 return GraphTraits<FlatIt<MachineRegion *>>::getEntryNode(149 return nodes_iterator::begin(getEntryNode(RI));153 return nodes_iterator::end(getEntryNode(RI));163 static NodeRef getEntryNode(MachineRegionInfoPass *RI) {164 return GraphTraits<MachineRegionInfo *>::getEntryNode(&RI->getRegionInfo());
177 static NodeRef getEntryNode(const MachineLoop *L) { return L; }186 static NodeRef getEntryNode(MachineLoop *L) { return L; }
264 static NodeRef getEntryNode(NodeRef N) { return N; } in getEntryNode() function284 static NodeRef getEntryNode(MachineDominatorTree *DT) {
148 static NodeType *getEntryNode(MachineRegionInfo *RI) {149 return GraphTraits<FlatIt<MachineRegion*> >::getEntryNode(RI->getTopLevelRegion());152 return nodes_iterator::begin(getEntryNode(RI));155 return nodes_iterator::end(getEntryNode(RI));164 static NodeType *getEntryNode(MachineRegionInfoPass *RI) {165 return GraphTraits<MachineRegionInfo*>::getEntryNode(&RI->getRegionInfo());
154 static NodeType *getEntryNode(const MachineLoop *L) { return L; }167 static NodeType *getEntryNode(MachineLoop *L) { return L; }
616 static NodeType *getEntryNode(MachineFunction *F) {628 static NodeType *getEntryNode(const MachineFunction *F) {653 static NodeType *getEntryNode(Inverse<MachineFunction*> G) {659 static NodeType *getEntryNode(Inverse<const MachineFunction *> G) {
277 static NodeType *getEntryNode(NodeType *N) { return N; } in getEntryNode() function299 static NodeType *getEntryNode(MachineDominatorTree *DT) {
172 static NodeRef getEntryNode(BasicBlock *BB) { return BB; }181 static NodeRef getEntryNode(const BasicBlock *BB) { return BB; }196 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }205 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }219 static NodeRef getEntryNode(Function *F) { return &F->getEntryBlock(); }236 static NodeRef getEntryNode(const Function *F) { return &F->getEntryBlock(); }259 static NodeRef getEntryNode(Inverse<Function *> G) {265 static NodeRef getEntryNode(Inverse<const Function *> G) {
191 static NodeRef getEntryNode(NodeRef N) { return N; }196 return df_begin(getEntryNode(N));199 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }213 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }216 return df_begin(getEntryNode(N));220 return df_end(getEntryNode(N));
91 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {92 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
138 return po_iterator(GT::getEntryNode(G)); in begin()143 return po_iterator(GT::getEntryNode(G), S); in begin()291 ReversePostOrderTraversal(GraphT G) { Initialize(GT::getEntryNode(G)); } in ReversePostOrderTraversal()
178 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; }194 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; }202 static NodeType *getEntryNode(clang::CallGraph *CGN) {227 static NodeType *getEntryNode(const clang::CallGraph *CGN) {
1004 static NodeType* getEntryNode(::clang::CFGBlock *BB)1018 static NodeType* getEntryNode(const clang::CFGBlock *BB)1032 static NodeType *getEntryNode(Inverse< ::clang::CFGBlock*> G)1046 static NodeType *getEntryNode(Inverse<const ::clang::CFGBlock*> G)1063 static NodeType *getEntryNode(::clang::CFG* F) { return &F->getEntry(); }1074 static NodeType *getEntryNode( const ::clang::CFG* F) {1093 static NodeType *getEntryNode( ::clang::CFG* F) { return &F->getExit(); }1103 static NodeType *getEntryNode(const ::clang::CFG* F) { return &F->getExit(); }
32 static NodeType* getEntryNode(clang::Stmt* S) { return S; }59 static NodeType* getEntryNode(const clang::Stmt* S) { return S; }