/external/llvm/include/llvm/Analysis/ |
H A D | PostDominators.h | 88 static NodeType *getEntryNode(PostDominatorTree *DT) { function in struct:llvm::GraphTraits 93 if (getEntryNode(N)) 94 return df_begin(getEntryNode(N)); 96 return df_end(getEntryNode(N)); 100 return df_end(getEntryNode(N));
|
H A D | RegionIterator.h | 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) { function in struct:llvm::GraphTraits 330 return GraphTraits<FlatIt<Region*> >::getEntryNode(R [all...] |
H A D | Interval.h | 128 static NodeType *getEntryNode(Interval *I) { return I; } function in struct:llvm::GraphTraits 142 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; } function in struct:llvm::GraphTraits
|
H A D | CallGraph.h | 315 static NodeType *getEntryNode(CallGraphNode *CGN) { return CGN; } function in struct:GraphTraits 336 static NodeType *getEntryNode(const CallGraphNode *CGN) { return CGN; } function in struct:GraphTraits 342 static NodeType *getEntryNode(CallGraph *CGN) { function in struct:GraphTraits 364 static NodeType *getEntryNode(const CallGraph *CGN) { function in struct:GraphTraits
|
H A D | Dominators.h | 656 NodeT *entry = TraitsTy::getEntryNode(&F); 882 static NodeType *getEntryNode(NodeType *N) { function in struct:llvm::GraphTraits 895 return df_begin(getEntryNode(N)); 899 return df_end(getEntryNode(N)); 905 static NodeType *getEntryNode(DominatorTree *DT) { function in struct:llvm::GraphTraits 910 return df_begin(getEntryNode(N)); 914 return df_end(getEntryNode(N));
|
/external/llvm/include/llvm/ADT/ |
H A D | GraphTraits.h | 33 // static NodeType *getEntryNode(const GraphType &) 91 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) { function in struct:llvm::GraphTraits 92 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
|
H A D | PostOrderIterator.h | 136 static inline _Self begin(GraphT G) { return _Self(GT::getEntryNode(G)); } 140 return _Self(GT::getEntryNode(G), S); 269 Initialize(GT::getEntryNode(G));
|
H A D | DepthFirstIterator.h | 135 return _Self(GT::getEntryNode(G)); 141 return _Self(GT::getEntryNode(G), S);
|
H A D | SCCIterator.h | 141 static inline _Self begin(const GraphT &G){return _Self(GT::getEntryNode(G));}
|
/external/llvm/include/llvm/Support/ |
H A D | DataFlow.h | 30 static NodeType *getEntryNode(const Value *G) { function in struct:llvm::GraphTraits 47 static NodeType *getEntryNode(Value *G) { function in struct:llvm::GraphTraits 64 static NodeType *getEntryNode(Inverse<const User*> G) { function in struct:llvm::GraphTraits 85 static NodeType *getEntryNode(Inverse<User*> G) { function in struct:llvm::GraphTraits
|
H A D | CFG.h | 252 static NodeType *getEntryNode(BasicBlock *BB) { return BB; } function in struct:llvm::GraphTraits 265 static NodeType *getEntryNode(const BasicBlock *BB) { return BB; } function in struct:llvm::GraphTraits 283 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; } function in struct:llvm::GraphTraits 295 static NodeType *getEntryNode(Inverse<const BasicBlock*> G) { function in struct:llvm::GraphTraits 317 static NodeType *getEntryNode(Function *F) { return &F->getEntryBlock(); } function in struct:llvm::GraphTraits 327 static NodeType *getEntryNode(const Function *F) {return &F->getEntryBlock();} function in struct:llvm::GraphTraits 344 static NodeType *getEntryNode(Inverse<Function*> G) { function in struct:llvm::GraphTraits 350 static NodeType *getEntryNode(Inverse<const Function *> G) { function in struct:llvm::GraphTraits
|
/external/clang/include/clang/Analysis/Analyses/ |
H A D | Dominators.h | 175 static NodeType *getEntryNode(NodeType *N) { function in struct:llvm::GraphTraits 188 return df_begin(getEntryNode(N)); 192 return df_end(getEntryNode(N)); 198 static NodeType *getEntryNode(::clang::DominatorTree *DT) { function in struct:llvm::GraphTraits 203 return df_begin(getEntryNode(N)); 207 return df_end(getEntryNode(N));
|
/external/clang/include/clang/AST/ |
H A D | StmtGraphTraits.h | 32 static NodeType* getEntryNode(clang::Stmt* S) { return S; } function in struct:llvm::GraphTraits 59 static NodeType* getEntryNode(const clang::Stmt* S) { return S; } function in struct:llvm::GraphTraits
|
/external/llvm/include/llvm/CodeGen/ |
H A D | MachineLoopInfo.h | 166 static NodeType *getEntryNode(const MachineLoop *L) { return L; } function in struct:llvm::GraphTraits 179 static NodeType *getEntryNode(MachineLoop *L) { return L; } function in struct:llvm::GraphTraits
|
H A D | MachineDominators.h | 183 static NodeType *getEntryNode(NodeType *N) { function in struct:llvm::GraphTraits 196 static NodeType *getEntryNode(MachineDominatorTree *DT) { function in struct:llvm::GraphTraits
|
H A D | MachineFunction.h | 441 static NodeType *getEntryNode(MachineFunction *F) { 453 static NodeType *getEntryNode(const MachineFunction *F) { function in struct:llvm::GraphTraits 478 static NodeType *getEntryNode(Inverse<MachineFunction*> G) { function in struct:llvm::GraphTraits 484 static NodeType *getEntryNode(Inverse<const MachineFunction *> G) { function in struct:llvm::GraphTraits
|
H A D | MachineBasicBlock.h | 623 static NodeType *getEntryNode(MachineBasicBlock *BB) { return BB; } function in struct:llvm::GraphTraits 636 static NodeType *getEntryNode(const MachineBasicBlock *BB) { return BB; } function in struct:llvm::GraphTraits 654 static NodeType *getEntryNode(Inverse<MachineBasicBlock *> G) { function in struct:llvm::GraphTraits 668 static NodeType *getEntryNode(Inverse<const MachineBasicBlock*> G) { function in struct:llvm::GraphTraits
|
/external/clang/include/clang/Analysis/ |
H A D | CallGraph.h | 188 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; } function in struct:llvm::GraphTraits 204 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; } function in struct:llvm::GraphTraits 212 static NodeType *getEntryNode(clang::CallGraph *CGN) { function in struct:llvm::GraphTraits 237 static NodeType *getEntryNode(const clang::CallGraph *CGN) { function in struct:llvm::GraphTraits
|
H A D | CFG.h | 832 static NodeType* getEntryNode(::clang::CFGBlock *BB) function in struct:clang::llvm::GraphTraits 846 static NodeType* getEntryNode(const clang::CFGBlock *BB) function in struct:clang::llvm::GraphTraits 860 static NodeType *getEntryNode(Inverse< ::clang::CFGBlock*> G) function in struct:clang::llvm::GraphTraits 874 static NodeType *getEntryNode(Inverse<const ::clang::CFGBlock*> G) function in struct:clang::llvm::GraphTraits 891 static NodeType *getEntryNode(::clang::CFG* F) { return &F->getEntry(); } function in struct:clang::llvm::GraphTraits 902 static NodeType *getEntryNode( const ::clang::CFG* F) { function in struct:clang::llvm::GraphTraits 921 static NodeType *getEntryNode( ::clang::CFG* F) { return &F->getExit(); } function in struct:clang::llvm::GraphTraits 931 static NodeType *getEntryNode(const ::clang::CFG* F) { return &F->getExit(); } function in struct:clang::llvm::GraphTraits
|
/external/llvm/include/llvm/ |
H A D | Type.h | 429 static inline NodeType *getEntryNode(Type *T) { return T; } 442 static inline NodeType *getEntryNode(NodeType *T) { return T; }
|
/external/llvm/lib/Transforms/IPO/ |
H A D | FunctionAttrs.cpp | 260 ArgumentGraphNode *getEntryNode() { return &SyntheticRoot; } function in class:__anon9045::ArgumentGraph 317 static inline NodeType *getEntryNode(NodeType *A) { return A; } function in struct:llvm::GraphTraits 327 static NodeType *getEntryNode(ArgumentGraph *AG) { function in struct:llvm::GraphTraits 328 return AG->getEntryNode();
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ExplodedGraph.h | 439 static inline NodeType* getEntryNode(NodeType* N) { function in struct:llvm::GraphTraits 465 static inline NodeType* getEntryNode(NodeType* N) { function in struct:llvm::GraphTraits
|
/external/llvm/lib/Target/Mips/ |
H A D | MipsISelDAGToDAG.cpp | 489 SDValue Zero = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), dl, 494 SDValue Zero = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), dl, 561 SDValue Chain = CurDAG->getCopyToReg(CurDAG->getEntryNode(), dl, DestReg,
|
/external/llvm/lib/Target/X86/ |
H A D | X86ISelDAGToDAG.cpp | 515 SDValue Store = CurDAG->getTruncStore(CurDAG->getEntryNode(), dl, 2186 SDValue InFlag = CurDAG->getCopyToReg(CurDAG->getEntryNode(), dl, LoReg, 2241 SDValue InFlag = CurDAG->getCopyToReg(CurDAG->getEntryNode(), dl, LoReg, 2262 SDValue Result = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), dl, 2281 SDValue Result = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), dl, 2289 SDValue Result = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), dl, 2369 Chain = CurDAG->getEntryNode(); 2375 CurDAG->getCopyToReg(CurDAG->getEntryNode(), dl, 2385 InFlag = CurDAG->getCopyToReg(CurDAG->getEntryNode(), dl, ClrReg, 2408 SDValue Result = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), d [all...] |
/external/llvm/unittests/ADT/ |
H A D | SCCIteratorTest.cpp | 237 static inline NodeType *getEntryNode(const Graph<N> &G) { return G.AccessNode(0); } function in struct:llvm::GraphTraits
|