Searched defs:getEntryNode (Results 1 - 25 of 28) sorted by relevance

12

/external/clang/include/clang/AST/
H A DStmtGraphTraits.h32 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/ADT/
H A DGraphTraits.h33 // 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);
/external/llvm/unittests/ADT/
H A DSCCIteratorTest.cpp235 static inline NodeType *getEntryNode(const Graph<N> &G) { return G.AccessNode(0); } function in struct:llvm::GraphTraits
/external/llvm/include/llvm/Analysis/
H A DPostDominators.h99 static NodeType *getEntryNode(PostDominatorTree *DT) { function in struct:llvm::GraphTraits
104 if (getEntryNode(N))
105 return df_begin(getEntryNode(N));
107 return df_end(getEntryNode(N));
111 return df_end(getEntryNode(N));
H A DInterval.h125 static NodeType *getEntryNode(Interval *I) { return I; } function in struct:llvm::GraphTraits
139 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; } function in struct:llvm::GraphTraits
H A 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) { function in struct:llvm::GraphTraits
317 return GraphTraits<FlatIt<Region*> >::getEntryNode(R
332 static NodeType *getEntryNode(RegionInfoPass *RI) { function in struct:llvm::GraphTraits
[all...]
H A DCallGraph.h404 static NodeType *getEntryNode(CallGraphNode *CGN) { return CGN; } function in struct:GraphTraits
425 static NodeType *getEntryNode(const CallGraphNode *CGN) { return CGN; } function in struct:GraphTraits
442 static NodeType *getEntryNode(CallGraph *CGN) { function in struct:GraphTraits
463 static NodeType *getEntryNode(const CallGraph *CGN) { function in struct:GraphTraits
H A DLazyCallGraph.h525 static NodeType *getEntryNode(NodeType *N) { return N; } function in struct:llvm::GraphTraits
533 static NodeType *getEntryNode(NodeType *N) { return N; } function in struct:llvm::GraphTraits
H A DLoopInfo.h697 static NodeType *getEntryNode(const Loop *L) { return L; } function in struct:llvm::GraphTraits
710 static NodeType *getEntryNode(Loop *L) { return L; } function in struct:llvm::GraphTraits
/external/clang/include/clang/Analysis/Analyses/
H A DDominators.h173 static NodeType *getEntryNode(NodeType *N) { function in struct:llvm::GraphTraits
186 return df_begin(getEntryNode(N));
190 return df_end(getEntryNode(N));
196 static NodeType *getEntryNode(::clang::DominatorTree *DT) { function in struct:llvm::GraphTraits
201 return df_begin(getEntryNode(N));
205 return df_end(getEntryNode(N));
/external/llvm/include/llvm/CodeGen/
H A DMachineLoopInfo.h167 static NodeType *getEntryNode(const MachineLoop *L) { return L; } function in struct:llvm::GraphTraits
180 static NodeType *getEntryNode(MachineLoop *L) { return L; } function in struct:llvm::GraphTraits
H A DMachineRegionInfo.h148 static NodeType *getEntryNode(MachineRegionInfo *RI) { function in struct:llvm::GraphTraits
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) { function in struct:llvm::GraphTraits
165 return GraphTraits<MachineRegionInfo*>::getEntryNode(&RI->getRegionInfo());
H A DMachineDominators.h255 static NodeType *getEntryNode(NodeType *N) { function in struct:llvm::GraphTraits
268 static NodeType *getEntryNode(MachineDominatorTree *DT) { function in struct:llvm::GraphTraits
H A DMachineFunction.h501 static NodeType *getEntryNode(MachineFunction *F) {
513 static NodeType *getEntryNode(const MachineFunction *F) { function in struct:llvm::GraphTraits
538 static NodeType *getEntryNode(Inverse<MachineFunction*> G) { function in struct:llvm::GraphTraits
544 static NodeType *getEntryNode(Inverse<const MachineFunction *> G) { function in struct:llvm::GraphTraits
H A DMachineBasicBlock.h713 static NodeType *getEntryNode(MachineBasicBlock *BB) { return BB; } function in struct:llvm::GraphTraits
726 static NodeType *getEntryNode(const MachineBasicBlock *BB) { return BB; } function in struct:llvm::GraphTraits
744 static NodeType *getEntryNode(Inverse<MachineBasicBlock *> G) { function in struct:llvm::GraphTraits
758 static NodeType *getEntryNode(Inverse<const MachineBasicBlock*> G) { function in struct:llvm::GraphTraits
H A DScheduleDAG.h666 static inline NodeType *getEntryNode(SUnit *N) { return N; } function in struct:llvm::SUnit::GraphTraits
H A DSelectionDAG.h325 SDValue getEntryNode() const { function in class:llvm::SelectionDAG
/external/clang/include/clang/Analysis/
H A DCallGraph.h178 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; } function in struct:llvm::GraphTraits
194 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; } function in struct:llvm::GraphTraits
202 static NodeType *getEntryNode(clang::CallGraph *CGN) { function in struct:llvm::GraphTraits
227 static NodeType *getEntryNode(const clang::CallGraph *CGN) { function in struct:llvm::GraphTraits
/external/llvm/include/llvm/IR/
H A DDominators.h133 static NodeType *getEntryNode(NodeType *N) { function in struct:llvm::GraphTraits
146 return df_begin(getEntryNode(N));
150 return df_end(getEntryNode(N));
156 static NodeType *getEntryNode(DominatorTree *DT) { function in struct:llvm::GraphTraits
161 return df_begin(getEntryNode(N));
165 return df_end(getEntryNode(N));
H A DCFG.h296 static NodeType *getEntryNode(BasicBlock *BB) { return BB; } function in struct:llvm::GraphTraits
309 static NodeType *getEntryNode(const BasicBlock *BB) { return BB; } function in struct:llvm::GraphTraits
327 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; } function in struct:llvm::GraphTraits
339 static NodeType *getEntryNode(Inverse<const BasicBlock*> G) { function in struct:llvm::GraphTraits
361 static NodeType *getEntryNode(Function *F) { return &F->getEntryBlock(); } function in struct:llvm::GraphTraits
371 static NodeType *getEntryNode(const Function *F) {return &F->getEntryBlock();} function in struct:llvm::GraphTraits
388 static NodeType *getEntryNode(Inverse<Function*> G) { function in struct:llvm::GraphTraits
394 static NodeType *getEntryNode(Inverse<const Function *> G) { function in struct:llvm::GraphTraits
/external/llvm/lib/Analysis/
H A DBlockFrequencyInfo.cpp57 static inline const NodeType *getEntryNode(const BlockFrequencyInfo *G) { function in struct:llvm::GraphTraits
H A DBlockFrequencyInfoImpl.cpp592 static const NodeType *getEntryNode(const GraphT &G) { function in struct:llvm::GraphTraits
/external/llvm/lib/CodeGen/
H A DMachineBlockFrequencyInfo.cpp59 const NodeType *getEntryNode(const MachineBlockFrequencyInfo *G) { function in struct:llvm::GraphTraits
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h448 static inline NodeType* getEntryNode(NodeType* N) { function in struct:llvm::GraphTraits
474 static inline NodeType* getEntryNode(NodeType* N) { function in struct:llvm::GraphTraits
/external/llvm/lib/Transforms/IPO/
H A DFunctionAttrs.cpp332 ArgumentGraphNode *getEntryNode() { return &SyntheticRoot; } function in class:__anon10957::ArgumentGraph
390 static inline NodeType *getEntryNode(NodeType *A) { return A; } function in struct:llvm::GraphTraits
400 static NodeType *getEntryNode(ArgumentGraph *AG) { function in struct:llvm::GraphTraits
401 return AG->getEntryNode();

Completed in 599 milliseconds

12