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

  /external/llvm/include/llvm/ADT/
GraphTraits.h 33 // static NodeType *getEntryNode(const GraphType &)
91 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {
92 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
  /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 252 static NodeType *getEntryNode(BasicBlock *BB) { return BB; }
265 static NodeType *getEntryNode(const BasicBlock *BB) { return BB; }
283 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
295 static NodeType *getEntryNode(Inverse<const BasicBlock*> G) {
317 static NodeType *getEntryNode(Function *F) { return &F->getEntryBlock(); }
327 static NodeType *getEntryNode(const Function *F) {return &F->getEntryBlock();}
344 static NodeType *getEntryNode(Inverse<Function*> G) {
350 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 677 static NodeType *getEntryNode(const Loop *L) { return L; }
690 static NodeType *getEntryNode(Loop *L) { return L; }
Dominators.h 656 NodeT *entry = TraitsTy::getEntryNode(&F);
882 static NodeType *getEntryNode(NodeType *N) {
895 return df_begin(getEntryNode(N));
899 return df_end(getEntryNode(N));
905 static NodeType *getEntryNode(DominatorTree *DT) {
910 return df_begin(getEntryNode(N));
914 return df_end(getEntryNode(N));
  /external/llvm/include/llvm/CodeGen/
MachineLoopInfo.h 166 static NodeType *getEntryNode(const MachineLoop *L) { return L; }
179 static NodeType *getEntryNode(MachineLoop *L) { return L; }
MachineDominators.h 183 static NodeType *getEntryNode(NodeType *N) {
196 static NodeType *getEntryNode(MachineDominatorTree *DT) {
MachineFunction.h 441 static NodeType *getEntryNode(MachineFunction *F) {
453 static NodeType *getEntryNode(const MachineFunction *F) {
478 static NodeType *getEntryNode(Inverse<MachineFunction*> G) {
484 static NodeType *getEntryNode(Inverse<const MachineFunction *> G) {
MachineBasicBlock.h 623 static NodeType *getEntryNode(MachineBasicBlock *BB) { return BB; }
636 static NodeType *getEntryNode(const MachineBasicBlock *BB) { return BB; }
654 static NodeType *getEntryNode(Inverse<MachineBasicBlock *> G) {
668 static NodeType *getEntryNode(Inverse<const MachineBasicBlock*> G) {
SelectionDAG.h 291 /// getEntryNode - Return the token chain corresponding to the entry of the
293 SDValue getEntryNode() const {
    [all...]
ScheduleDAG.h 641 static inline NodeType *getEntryNode(SUnit *N) { return N; }
SelectionDAGNodes.h     [all...]
  /external/clang/include/clang/Analysis/Analyses/
Dominators.h 175 static NodeType *getEntryNode(NodeType *N) {
188 return df_begin(getEntryNode(N));
192 return df_end(getEntryNode(N));
198 static NodeType *getEntryNode(::clang::DominatorTree *DT) {
203 return df_begin(getEntryNode(N));
207 return df_end(getEntryNode(N));
  /external/clang/include/clang/Analysis/
CallGraph.h 188 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; }
204 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; }
212 static NodeType *getEntryNode(clang::CallGraph *CGN) {
237 static NodeType *getEntryNode(const clang::CallGraph *CGN) {
CFG.h 832 static NodeType* getEntryNode(::clang::CFGBlock *BB)
846 static NodeType* getEntryNode(const clang::CFGBlock *BB)
860 static NodeType *getEntryNode(Inverse< ::clang::CFGBlock*> G)
874 static NodeType *getEntryNode(Inverse<const ::clang::CFGBlock*> G)
891 static NodeType *getEntryNode(::clang::CFG* F) { return &F->getEntry(); }
902 static NodeType *getEntryNode( const ::clang::CFG* F) {
    [all...]
  /external/llvm/lib/Transforms/IPO/
FunctionAttrs.cpp 260 ArgumentGraphNode *getEntryNode() { return &SyntheticRoot; }
317 static inline NodeType *getEntryNode(NodeType *A) { return A; }
327 static NodeType *getEntryNode(ArgumentGraph *AG) {
328 return AG->getEntryNode();
  /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h 439 static inline NodeType* getEntryNode(NodeType* N) {
465 static inline NodeType* getEntryNode(NodeType* N) {

Completed in 700 milliseconds