HomeSort by relevance Sort by last modified time
    Searched defs:getEntryNode (Results 1 - 22 of 22) sorted by null

  /external/llvm/include/llvm/ADT/
GraphTraits.h 33 // static NodeType *getEntryNode(const GraphType &)
88 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {
89 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
Trie.h 283 static inline NodeType *getEntryNode(const TrieType& T) {
  /external/llvm/include/llvm/Support/
DataFlow.h 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) {
CFG.h 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) {
  /external/clang/include/clang/AST/
StmtGraphTraits.h 32 static NodeType* getEntryNode(clang::Stmt* S) { return S; }
59 static NodeType* getEntryNode(const clang::Stmt* S) { return S; }
  /external/llvm/unittests/ADT/
SCCIteratorTest.cpp 237 static inline NodeType *getEntryNode(const Graph<N> &G) { return G.AccessNode(0); }
  /external/llvm/include/llvm/Analysis/
PostDominators.h 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));
Interval.h 128 static NodeType *getEntryNode(Interval *I) { return I; }
142 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
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) {
330 return GraphTraits<FlatIt<Region*> >::getEntryNode(RI->getTopLevelRegion())
    [all...]
CallGraph.h 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) {
LoopInfo.h     [all...]
Dominators.h 837 static NodeType *getEntryNode(NodeType *N) {
850 return df_begin(getEntryNode(N));
854 return df_end(getEntryNode(N));
860 static NodeType *getEntryNode(DominatorTree *DT) {
865 return df_begin(getEntryNode(N));
869 return df_end(getEntryNode(N));
  /external/llvm/include/llvm/CodeGen/
MachineLoopInfo.h 154 static NodeType *getEntryNode(const MachineLoop *L) { return L; }
167 static NodeType *getEntryNode(MachineLoop *L) { return L; }
MachineDominators.h 182 static NodeType *getEntryNode(NodeType *N) {
195 static NodeType *getEntryNode(MachineDominatorTree *DT) {
MachineFunction.h 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) {
MachineBasicBlock.h 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) {
SelectionDAG.h 251 /// getEntryNode - Return the token chain corresponding to the entry of the
253 SDValue getEntryNode() const {
    [all...]
ScheduleDAG.h 639 static inline NodeType *getEntryNode(SUnit *N) { return N; }
SelectionDAGNodes.h     [all...]
  /external/clang/include/clang/Index/
CallGraph.h 116 static NodeType *getEntryNode(GraphType *CG) {
  /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h 417 static inline NodeType* getEntryNode(NodeType* N) {
443 static inline NodeType* getEntryNode(NodeType* N) {
  /external/clang/include/clang/Analysis/
CFG.h 760 static NodeType* getEntryNode(::clang::CFGBlock *BB)
774 static NodeType* getEntryNode(const clang::CFGBlock *BB)
788 static NodeType *getEntryNode(Inverse<const ::clang::CFGBlock*> G)
805 static NodeType *getEntryNode(::clang::CFG* F) { return &F->getEntry(); }
815 static NodeType *getEntryNode( const ::clang::CFG* F) {
831 static NodeType *getEntryNode(const ::clang::CFG* F) { return &F->getExit(); }

Completed in 448 milliseconds