Home
last modified time | relevance | path

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

1234

/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));
DInterval.h125 static NodeType *getEntryNode(Interval *I) { return I; }
139 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
DCallGraph.h410 static NodeType *getEntryNode(CallGraphNode *CGN) { return CGN; }
431 static NodeType *getEntryNode(const CallGraphNode *CGN) { return CGN; }
448 static NodeType *getEntryNode(CallGraph *CGN) {
471 static NodeType *getEntryNode(const CallGraph *CGN) {
DLazyCallGraph.h524 static NodeType *getEntryNode(NodeType *N) { return N; }
532 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/IR/
DCFG.h160 static NodeType *getEntryNode(BasicBlock *BB) { return BB; }
173 static NodeType *getEntryNode(const BasicBlock *BB) { return BB; }
191 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
203 static NodeType *getEntryNode(Inverse<const BasicBlock*> G) {
225 static NodeType *getEntryNode(Function *F) { return &F->getEntryBlock(); }
235 static NodeType *getEntryNode(const Function *F) {return &F->getEntryBlock();}
252 static NodeType *getEntryNode(Inverse<Function*> G) {
258 static NodeType *getEntryNode(Inverse<const Function *> G) {
DDominators.h149 static NodeType *getEntryNode(NodeType *N) { return N; } in getEntryNode() function
156 return df_begin(getEntryNode(N)); in nodes_begin()
160 return df_end(getEntryNode(N)); in nodes_end()
175 static NodeType *getEntryNode(DominatorTree *DT) {
180 return df_begin(getEntryNode(N));
184 return df_end(getEntryNode(N));
DType.h443 static inline NodeType *getEntryNode(Type *T) { return T; }
456 static inline NodeType *getEntryNode(NodeType *T) { return T; }
/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());
DMachineLoopInfo.h162 static NodeType *getEntryNode(const MachineLoop *L) { return L; }
175 static NodeType *getEntryNode(MachineLoop *L) { return L; }
DMachineFunction.h535 static NodeType *getEntryNode(MachineFunction *F) {
547 static NodeType *getEntryNode(const MachineFunction *F) {
572 static NodeType *getEntryNode(Inverse<MachineFunction*> G) {
578 static NodeType *getEntryNode(Inverse<const MachineFunction *> G) {
DMachineDominators.h254 static NodeType *getEntryNode(NodeType *N) { return N; } in getEntryNode() function
276 static NodeType *getEntryNode(MachineDominatorTree *DT) {
DMachineBasicBlock.h800 static NodeType *getEntryNode(MachineBasicBlock *BB) { return BB; }
813 static NodeType *getEntryNode(const MachineBasicBlock *BB) { return BB; }
831 static NodeType *getEntryNode(Inverse<MachineBasicBlock *> G) {
845 static NodeType *getEntryNode(Inverse<const MachineBasicBlock*> G) {
/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/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) {
/external/llvm/lib/Target/AMDGPU/
DSIISelLowering.cpp1140 DAG.getEntryNode(), Offset, false); in lowerImplicitZextParam()
1165 return LowerParameter(DAG, VT, VT, DL, DAG.getEntryNode(), in LowerINTRINSIC_WO_CHAIN()
1168 return LowerParameter(DAG, VT, VT, DL, DAG.getEntryNode(), in LowerINTRINSIC_WO_CHAIN()
1171 return LowerParameter(DAG, VT, VT, DL, DAG.getEntryNode(), in LowerINTRINSIC_WO_CHAIN()
1174 return LowerParameter(DAG, VT, VT, DL, DAG.getEntryNode(), in LowerINTRINSIC_WO_CHAIN()
1177 return LowerParameter(DAG, VT, VT, DL, DAG.getEntryNode(), in LowerINTRINSIC_WO_CHAIN()
1180 return LowerParameter(DAG, VT, VT, DL, DAG.getEntryNode(), in LowerINTRINSIC_WO_CHAIN()
1245 SDValue M0 = copyToM0(DAG, DAG.getEntryNode(), DL, Op.getOperand(3)); in LowerINTRINSIC_WO_CHAIN()
1261 SDValue M0 = copyToM0(DAG, DAG.getEntryNode(), DL, Op.getOperand(3)); in LowerINTRINSIC_WO_CHAIN()
1271 SDValue M0 = copyToM0(DAG, DAG.getEntryNode(), DL, Op.getOperand(4)); in LowerINTRINSIC_WO_CHAIN()
[all …]

1234