Searched refs:getEntryNode (Results 1 – 25 of 135) sorted by relevance
123456
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) {
269 static NodeType *getEntryNode(NodeType* N) { return N; } \280 static NodeType *getEntryNode(NodeType* N) { return N; } \293 static NodeType *getEntryNode(RegionT* R) { \297 return nodes_iterator::begin(getEntryNode(R)); \300 return nodes_iterator::end(getEntryNode(R)); \307 static NodeType *getEntryNode(RegionT* R) { \311 return nodes_iterator::begin(getEntryNode(R)); \314 return nodes_iterator::end(getEntryNode(R)); \329 static NodeType *getEntryNode(RegionInfo *RI) {330 return GraphTraits<FlatIt<Region*> >::getEntryNode(RI->getTopLevelRegion());[all …]
88 static NodeType *getEntryNode(PostDominatorTree *DT) {93 if (getEntryNode(N))94 return df_begin(getEntryNode(N));96 return df_end(getEntryNode(N));100 return df_end(getEntryNode(N));
315 static NodeType *getEntryNode(CallGraphNode *CGN) { return CGN; }336 static NodeType *getEntryNode(const CallGraphNode *CGN) { return CGN; }342 static NodeType *getEntryNode(CallGraph *CGN) {364 static NodeType *getEntryNode(const CallGraph *CGN) {
128 static NodeType *getEntryNode(Interval *I) { return I; }142 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
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));
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; }
246 static NodeType *getEntryNode(BasicBlock *BB) { return BB; }259 static NodeType *getEntryNode(const BasicBlock *BB) { return BB; }277 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }289 static NodeType *getEntryNode(Inverse<const BasicBlock*> G) {311 static NodeType *getEntryNode(Function *F) { return &F->getEntryBlock(); }320 static NodeType *getEntryNode(const Function *F) {return &F->getEntryBlock();}336 static NodeType *getEntryNode(Inverse<Function*> G) {342 static NodeType *getEntryNode(Inverse<const Function *> G) {
30 static NodeType *getEntryNode(const Value *G) {47 static NodeType *getEntryNode(Value *G) {64 static NodeType *getEntryNode(Inverse<const User*> G) {85 static NodeType *getEntryNode(Inverse<User*> G) {
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(); }
91 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {92 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
88 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {89 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
96 static inline _Self begin(GraphT G) { return _Self(GT::getEntryNode(G)); } in begin()100 return _Self(GT::getEntryNode(G), S); in begin()230 Initialize(GT::getEntryNode(G)); in ReversePostOrderTraversal()
32 static NodeType* getEntryNode(clang::Stmt* S) { return S; }59 static NodeType* getEntryNode(const clang::Stmt* S) { return S; }
432 static NodeType *getEntryNode(MachineFunction *F) {443 static NodeType *getEntryNode(const MachineFunction *F) {465 static NodeType *getEntryNode(Inverse<MachineFunction*> G) {471 static NodeType *getEntryNode(Inverse<const MachineFunction *> G) {
473 static NodeType *getEntryNode(MachineBasicBlock *BB) { return BB; }486 static NodeType *getEntryNode(const MachineBasicBlock *BB) { return BB; }504 static NodeType *getEntryNode(Inverse<MachineBasicBlock *> G) {518 static NodeType *getEntryNode(Inverse<const MachineBasicBlock*> G) {
183 static NodeType *getEntryNode(NodeType *N) {196 static NodeType *getEntryNode(MachineDominatorTree *DT) {