Home
last modified time | relevance | path

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

1234567891011

/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DRegionIterator.h262 static NodeRef getEntryNode(NodeRef N) { return N; } \
274 static NodeRef getEntryNode(NodeRef N) { return N; } \
286 static NodeRef getEntryNode(RegionT *R) { \
290 return nodes_iterator::begin(getEntryNode(R)); \
293 return nodes_iterator::end(getEntryNode(R)); \
302 static NodeRef getEntryNode(RegionT *R) { \
306 return nodes_iterator::begin(getEntryNode(R)); \
309 return nodes_iterator::end(getEntryNode(R)); \
325 static NodeRef getEntryNode(RegionInfo *RI) {
326 return GraphTraits<FlatIt<Region*>>::getEntryNode(RI->getTopLevelRegion());
[all …]
DPostDominators.h102 static NodeRef getEntryNode(PostDominatorTree *DT) {
107 if (getEntryNode(N))
108 return df_begin(getEntryNode(N));
110 return df_end(getEntryNode(N));
114 return df_end(getEntryNode(N));
/external/llvm-project/llvm/include/llvm/Analysis/
DRegionIterator.h262 static NodeRef getEntryNode(NodeRef N) { return N; } \
274 static NodeRef getEntryNode(NodeRef N) { return N; } \
286 static NodeRef getEntryNode(RegionT *R) { \
290 return nodes_iterator::begin(getEntryNode(R)); \
293 return nodes_iterator::end(getEntryNode(R)); \
302 static NodeRef getEntryNode(RegionT *R) { \
306 return nodes_iterator::begin(getEntryNode(R)); \
309 return nodes_iterator::end(getEntryNode(R)); \
325 static NodeRef getEntryNode(RegionInfo *RI) {
326 return GraphTraits<FlatIt<Region*>>::getEntryNode(RI->getTopLevelRegion());
[all …]
DPostDominators.h100 static NodeRef getEntryNode(PostDominatorTree *DT) {
105 if (getEntryNode(N))
106 return df_begin(getEntryNode(N));
108 return df_end(getEntryNode(N));
112 return df_end(getEntryNode(N));
/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.h92 static NodeType *getEntryNode(PostDominatorTree *DT) {
97 if (getEntryNode(N))
98 return df_begin(getEntryNode(N));
100 return df_end(getEntryNode(N));
104 return df_end(getEntryNode(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-project/polly/lib/Analysis/
DScopGraphPrinter.cpp38 static NodeRef getEntryNode(ScopDetection *SD) { in getEntryNode() function
39 return GraphTraits<RegionInfo *>::getEntryNode(SD->getRI()); in getEntryNode()
42 return nodes_iterator::begin(getEntryNode(SD)); in nodes_begin()
45 return nodes_iterator::end(getEntryNode(SD)); in nodes_end()
52 static NodeRef getEntryNode(ScopDetectionWrapperPass *P) { in getEntryNode() function
53 return GraphTraits<ScopDetection *>::getEntryNode(&P->getSD()); in getEntryNode()
56 return nodes_iterator::begin(getEntryNode(P)); in nodes_begin()
59 return nodes_iterator::end(getEntryNode(P)); in nodes_end()
/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.h162 static NodeType *getEntryNode(NodeType *N) { return N; }
169 return df_begin(getEntryNode(N));
173 return df_end(getEntryNode(N));
188 static NodeType *getEntryNode(DominatorTree *DT) {
193 return df_begin(getEntryNode(N));
197 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());
/external/llvm-project/llvm/include/llvm/CodeGen/
DMachineRegionInfo.h142 static NodeRef getEntryNode(MachineRegionInfo *RI) {
143 return GraphTraits<FlatIt<MachineRegion *>>::getEntryNode(
148 return nodes_iterator::begin(getEntryNode(RI));
152 return nodes_iterator::end(getEntryNode(RI));
162 static NodeRef getEntryNode(MachineRegionInfoPass *RI) {
163 return GraphTraits<MachineRegionInfo *>::getEntryNode(&RI->getRegionInfo());
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
DMachineRegionInfo.h142 static NodeRef getEntryNode(MachineRegionInfo *RI) {
143 return GraphTraits<FlatIt<MachineRegion *>>::getEntryNode(
148 return nodes_iterator::begin(getEntryNode(RI));
152 return nodes_iterator::end(getEntryNode(RI));
162 static NodeRef getEntryNode(MachineRegionInfoPass *RI) {
163 return GraphTraits<MachineRegionInfo *>::getEntryNode(&RI->getRegionInfo());
/external/llvm-project/llvm/unittests/CodeGen/
DSelectionDAGAddressAnalysisTest.cpp108 SDValue Store = DAG->getStore(DAG->getEntryNode(), Loc, Value, Index, in TEST_F()
138 SDValue Store0 = DAG->getStore(DAG->getEntryNode(), Loc, Value, Index0, in TEST_F()
140 SDValue Store1 = DAG->getStore(DAG->getEntryNode(), Loc, Value, Index1, in TEST_F()
172 SDValue Store0 = DAG->getStore(DAG->getEntryNode(), Loc, Value, Index0, in TEST_F()
174 SDValue Store1 = DAG->getStore(DAG->getEntryNode(), Loc, Value, Index1, in TEST_F()
201 SDValue Store = DAG->getStore(DAG->getEntryNode(), Loc, Value, Index, in TEST_F()
209 SDValue GStore = DAG->getStore(DAG->getEntryNode(), Loc, GValue, GAddr, in TEST_F()
242 SDValue Store0 = DAG->getStore(DAG->getEntryNode(), Loc, Value0, Index0, in TEST_F()
244 SDValue Store1 = DAG->getStore(DAG->getEntryNode(), Loc, Value1, Index1, in TEST_F()
285 SDValue Store0 = DAG->getStore(DAG->getEntryNode(), Loc, Value0, Index0, in TEST_F()
[all …]
/external/llvm-project/mlir/include/mlir/IR/
DRegionGraphTraits.h27 static NodeRef getEntryNode(NodeRef bb) { return bb; }
39 static NodeRef getEntryNode(Inverse<NodeRef> inverseGraph) {
55 static NodeRef getEntryNode(GraphType fn) { return &fn->front(); }
72 static NodeRef getEntryNode(GraphType fn) { return &fn.Graph->front(); }
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
DCFG.h302 static NodeRef getEntryNode(BasicBlock *BB) { return BB; }
311 static NodeRef getEntryNode(const BasicBlock *BB) { return BB; }
326 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
335 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
349 static NodeRef getEntryNode(Function *F) { return &F->getEntryBlock(); }
366 static NodeRef getEntryNode(const Function *F) { return &F->getEntryBlock(); }
389 static NodeRef getEntryNode(Inverse<Function *> G) {
395 static NodeRef getEntryNode(Inverse<const Function *> G) {
DDominators.h196 static NodeRef getEntryNode(NodeRef N) { return N; }
201 return df_begin(getEntryNode(N));
204 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
218 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }
221 return df_begin(getEntryNode(N));
225 return df_end(getEntryNode(N));
/external/llvm-project/llvm/include/llvm/IR/
DCFG.h303 static NodeRef getEntryNode(BasicBlock *BB) { return BB; }
312 static NodeRef getEntryNode(const BasicBlock *BB) { return BB; }
327 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
336 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
350 static NodeRef getEntryNode(Function *F) { return &F->getEntryBlock(); }
367 static NodeRef getEntryNode(const Function *F) { return &F->getEntryBlock(); }
390 static NodeRef getEntryNode(Inverse<Function *> G) {
396 static NodeRef getEntryNode(Inverse<const Function *> G) {
DDominators.h214 static NodeRef getEntryNode(NodeRef N) { return N; }
219 return df_begin(getEntryNode(N));
222 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
237 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }
240 return df_begin(getEntryNode(N));
244 return df_end(getEntryNode(N));
/external/llvm-project/clang/include/clang/Analysis/Analyses/
DDominators.h284 static NodeRef getEntryNode(NodeRef N) { return N; }
292 return nodes_iterator(df_begin(getEntryNode(N)));
296 return nodes_iterator(df_end(getEntryNode(N)));
302 static NodeRef getEntryNode(clang::CFGDomTree *DT) {
307 return nodes_iterator(df_begin(getEntryNode(N)));
311 return nodes_iterator(df_end(getEntryNode(N)));
/external/llvm/include/llvm/ADT/
DGraphTraits.h91 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {
92 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
/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) {
/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-project/clang/include/clang/AST/
DStmtGraphTraits.h28 static NodeRef getEntryNode(clang::Stmt *S) { return S; }
54 static NodeRef getEntryNode(const clang::Stmt *S) { return S; }
/external/llvm-project/clang/include/clang/Analysis/
DCallGraph.h248 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; }
258 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; }
265 static NodeType *getEntryNode(clang::CallGraph *CGN) {
291 static NodeType *getEntryNode(const clang::CallGraph *CGN) {

1234567891011