Home
last modified time | relevance | path

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

123

/external/llvm/include/llvm/Analysis/
DRegionIterator.h256 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 …]
DPostDominators.h99 static NodeType *getEntryNode(PostDominatorTree *DT) {
104 if (getEntryNode(N))
105 return df_begin(getEntryNode(N));
107 return df_end(getEntryNode(N));
111 return df_end(getEntryNode(N));
DCallGraph.h404 static NodeType *getEntryNode(CallGraphNode *CGN) { return CGN; }
425 static NodeType *getEntryNode(const CallGraphNode *CGN) { return CGN; }
442 static NodeType *getEntryNode(CallGraph *CGN) {
463 static NodeType *getEntryNode(const CallGraph *CGN) {
DInterval.h125 static NodeType *getEntryNode(Interval *I) { return I; }
139 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
DLazyCallGraph.h525 static NodeType *getEntryNode(NodeType *N) { return N; }
533 static NodeType *getEntryNode(NodeType *N) { return N; }
/external/clang/include/clang/Analysis/Analyses/
DDominators.h173 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));
/external/llvm/include/llvm/CodeGen/
DMachineRegionInfo.h148 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());
DMachineFunction.h501 static NodeType *getEntryNode(MachineFunction *F) {
513 static NodeType *getEntryNode(const MachineFunction *F) {
538 static NodeType *getEntryNode(Inverse<MachineFunction*> G) {
544 static NodeType *getEntryNode(Inverse<const MachineFunction *> G) {
DMachineLoopInfo.h167 static NodeType *getEntryNode(const MachineLoop *L) { return L; }
180 static NodeType *getEntryNode(MachineLoop *L) { return L; }
DMachineDominators.h255 static NodeType *getEntryNode(NodeType *N) {
268 static NodeType *getEntryNode(MachineDominatorTree *DT) {
DMachineBasicBlock.h713 static NodeType *getEntryNode(MachineBasicBlock *BB) { return BB; }
726 static NodeType *getEntryNode(const MachineBasicBlock *BB) { return BB; }
744 static NodeType *getEntryNode(Inverse<MachineBasicBlock *> G) {
758 static NodeType *getEntryNode(Inverse<const MachineBasicBlock*> G) {
/external/llvm/include/llvm/IR/
DDominators.h133 static NodeType *getEntryNode(NodeType *N) {
146 return df_begin(getEntryNode(N));
150 return df_end(getEntryNode(N));
156 static NodeType *getEntryNode(DominatorTree *DT) {
161 return df_begin(getEntryNode(N));
165 return df_end(getEntryNode(N));
DCFG.h296 static NodeType *getEntryNode(BasicBlock *BB) { return BB; }
309 static NodeType *getEntryNode(const BasicBlock *BB) { return BB; }
327 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
339 static NodeType *getEntryNode(Inverse<const BasicBlock*> G) {
361 static NodeType *getEntryNode(Function *F) { return &F->getEntryBlock(); }
371 static NodeType *getEntryNode(const Function *F) {return &F->getEntryBlock();}
388 static NodeType *getEntryNode(Inverse<Function*> G) {
394 static NodeType *getEntryNode(Inverse<const Function *> G) {
DType.h451 static inline NodeType *getEntryNode(Type *T) { return T; }
464 static inline NodeType *getEntryNode(NodeType *T) { return T; }
/external/llvm/include/llvm/ADT/
DGraphTraits.h91 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {
92 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
DPostOrderIterator.h138 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()
DDepthFirstIterator.h134 return df_iterator(GT::getEntryNode(G)); in begin()
140 return df_iterator(GT::getEntryNode(G), S); in begin()
/external/clang/include/clang/Analysis/
DCallGraph.h178 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) {
DCFG.h1004 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(); }
/external/clang/include/clang/AST/
DStmtGraphTraits.h32 static NodeType* getEntryNode(clang::Stmt* S) { return S; }
59 static NodeType* getEntryNode(const clang::Stmt* S) { return S; }
/external/llvm/unittests/Analysis/
DCallGraphTest.cpp34 NodeTy *N = GraphTraits<Ty *>::getEntryNode(G); in canSpecializeGraphTraitsIterators()
/external/llvm/lib/Target/R600/
DSIISelLowering.cpp853 return LowerParameter(DAG, VT, VT, DL, DAG.getEntryNode(), in LowerINTRINSIC_WO_CHAIN()
856 return LowerParameter(DAG, VT, VT, DL, DAG.getEntryNode(), in LowerINTRINSIC_WO_CHAIN()
859 return LowerParameter(DAG, VT, VT, DL, DAG.getEntryNode(), in LowerINTRINSIC_WO_CHAIN()
862 return LowerParameter(DAG, VT, VT, DL, DAG.getEntryNode(), in LowerINTRINSIC_WO_CHAIN()
865 return LowerParameter(DAG, VT, VT, DL, DAG.getEntryNode(), in LowerINTRINSIC_WO_CHAIN()
868 return LowerParameter(DAG, VT, VT, DL, DAG.getEntryNode(), in LowerINTRINSIC_WO_CHAIN()
871 return LowerParameter(DAG, VT, VT, DL, DAG.getEntryNode(), in LowerINTRINSIC_WO_CHAIN()
874 return LowerParameter(DAG, VT, VT, DL, DAG.getEntryNode(), in LowerINTRINSIC_WO_CHAIN()
877 return LowerParameter(DAG, VT, VT, DL, DAG.getEntryNode(), in LowerINTRINSIC_WO_CHAIN()
881 return LowerParameter(DAG, VT, VT, DL, DAG.getEntryNode(), in LowerINTRINSIC_WO_CHAIN()
[all …]
/external/llvm/lib/CodeGen/
DMachineRegionInfo.cpp62 MachineBasicBlock *Entry = GraphTraits<MachineFunction*>::getEntryNode(&F); in recalculate()
DMachineBlockFrequencyInfo.cpp59 const NodeType *getEntryNode(const MachineBlockFrequencyInfo *G) { in getEntryNode() function
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h448 static inline NodeType* getEntryNode(NodeType* N) {
474 static inline NodeType* getEntryNode(NodeType* N) {

123