Home
last modified time | relevance | path

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

12345

/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DRegionIterator.h269 static NodeRef getEntryNode(NodeRef N) { return N; } \
281 static NodeRef getEntryNode(NodeRef N) { return N; } \
293 static NodeRef getEntryNode(RegionT *R) { \
297 return nodes_iterator::begin(getEntryNode(R)); \
300 return nodes_iterator::end(getEntryNode(R)); \
332 static NodeRef getEntryNode(RegionInfo *RI) {
333 return GraphTraits<FlatIt<Region*>>::getEntryNode(RI->getTopLevelRegion());
337 return nodes_iterator::begin(getEntryNode(RI));
341 return nodes_iterator::end(getEntryNode(RI));
351 static NodeRef getEntryNode(RegionInfoPass *RI) {
[all …]
H A DPostDominators.h100 static NodeRef getEntryNode(PostDominatorTree *DT) {
105 return df_begin(getEntryNode(N));
109 return df_end(getEntryNode(N));
H A DInterval.h120 static NodeRef getEntryNode(Interval *I) { return I; }
131 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
H A DCallGraph.h423 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
443 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
471 static NodeRef getEntryNode(CallGraph *CGN) {
498 static NodeRef getEntryNode(const CallGraph *CGN) {
H A DDDG.h499 static NodeRef getEntryNode(NodeRef N) { return N; }
516 static NodeRef getEntryNode(DataDependenceGraph *DG) {
539 static NodeRef getEntryNode(NodeRef N) { return N; }
557 static NodeRef getEntryNode(const DataDependenceGraph *DG) {
/llvm-project-15.0.7/llvm/unittests/CodeGen/
H A DSelectionDAGAddressAnalysisTest.cpp111 SDValue Store = DAG->getStore(DAG->getEntryNode(), Loc, Value, Index, in TEST_F()
134 SDValue Store = DAG->getStore(DAG->getEntryNode(), Loc, Value, Index, in TEST_F()
164 SDValue Store0 = DAG->getStore(DAG->getEntryNode(), Loc, Value, Index0, in TEST_F()
166 SDValue Store1 = DAG->getStore(DAG->getEntryNode(), Loc, Value, Index1, in TEST_F()
195 DAG->getStore(DAG->getEntryNode(), Loc, Value, FIPtr, PtrInfo); in TEST_F()
196 SDValue Store1 = DAG->getStore(DAG->getEntryNode(), Loc, Value, Index1, in TEST_F()
221 SDValue Store = DAG->getStore(DAG->getEntryNode(), Loc, Value, Index, in TEST_F()
229 SDValue GStore = DAG->getStore(DAG->getEntryNode(), Loc, GValue, GAddr, in TEST_F()
249 SDValue GStore = DAG->getStore(DAG->getEntryNode(), Loc, GValue, GAddr, in TEST_F()
257 DAG->getStore(DAG->getEntryNode(), Loc, AliasedGValue, AliasedGAddr, in TEST_F()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A 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());
H A DMachineLoopInfo.h188 static NodeRef getEntryNode(const MachineLoop *L) { return L; }
197 static NodeRef getEntryNode(MachineLoop *L) { return L; }
H A DMachineDominators.h264 static NodeRef getEntryNode(NodeRef N) { return N; } in getEntryNode() function
285 static NodeRef getEntryNode(MachineDominatorTree *DT) {
/llvm-project-15.0.7/polly/include/polly/
H A DScopGraphPrinter.h31 static NodeRef getEntryNode(polly::ScopDetection *SD) {
32 return GraphTraits<RegionInfo *>::getEntryNode(SD->getRI());
35 return nodes_iterator::begin(getEntryNode(SD));
38 return nodes_iterator::end(getEntryNode(SD));
/llvm-project-15.0.7/mlir/include/mlir/IR/
H A DRegionGraphTraits.h28 static NodeRef getEntryNode(NodeRef bb) { return bb; }
41 static NodeRef getEntryNode(Inverse<NodeRef> inverseGraph) {
57 static NodeRef getEntryNode(GraphType fn) { return &fn->front(); }
74 static NodeRef getEntryNode(GraphType fn) { return &fn.Graph->front(); }
H A DDominance.h210 static NodeRef getEntryNode(NodeRef N) { return N; }
220 static NodeRef getEntryNode(NodeRef N) { return N; }
/llvm-project-15.0.7/bolt/include/bolt/Core/
H A DBinaryDomTree.h42 static NodeRef getEntryNode(bolt::BinaryDominatorTree *DT) {
47 return df_begin(getEntryNode(N));
51 return df_end(getEntryNode(N));
/llvm-project-15.0.7/llvm/include/llvm/IR/
H A DCFG.h304 static NodeRef getEntryNode(BasicBlock *BB) { return BB; }
313 static NodeRef getEntryNode(const BasicBlock *BB) { return BB; }
328 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
337 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
351 static NodeRef getEntryNode(Function *F) { return &F->getEntryBlock(); }
368 static NodeRef getEntryNode(const Function *F) { return &F->getEntryBlock(); }
391 static NodeRef getEntryNode(Inverse<Function *> G) {
397 static NodeRef getEntryNode(Inverse<const Function *> G) {
H A DDominators.h232 static NodeRef getEntryNode(NodeRef N) { return N; }
237 return df_begin(getEntryNode(N));
240 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
255 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }
258 return df_begin(getEntryNode(N));
262 return df_end(getEntryNode(N));
/llvm-project-15.0.7/clang/include/clang/Analysis/Analyses/
H A 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)));
/llvm-project-15.0.7/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h128 ProfiledCallGraphNode *getEntryNode() { return &Root; } in getEntryNode() function
190 static NodeRef getEntryNode(NodeRef PCGN) { return PCGN; }
198 static NodeRef getEntryNode(ProfiledCallGraph *PCG) {
199 return PCG->getEntryNode();
/llvm-project-15.0.7/clang/include/clang/AST/
H A DStmtGraphTraits.h28 static NodeRef getEntryNode(clang::Stmt *S) { return S; }
54 static NodeRef getEntryNode(const clang::Stmt *S) { return S; }
/llvm-project-15.0.7/clang/include/clang/Analysis/
H A 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) {
H A DCFG.h1493 static NodeRef getEntryNode(::clang::CFGBlock *BB) { return BB; }
1502 static NodeRef getEntryNode(const clang::CFGBlock *BB) { return BB; }
1511 static NodeRef getEntryNode(Inverse<::clang::CFGBlock *> G) {
1523 static NodeRef getEntryNode(Inverse<const ::clang::CFGBlock *> G) {
1537 static NodeRef getEntryNode(::clang::CFG *F) { return &F->getEntry(); }
1547 static NodeRef getEntryNode(const ::clang::CFG *F) { return &F->getEntry(); }
1566 static NodeRef getEntryNode(::clang::CFG *F) { return &F->getExit(); }
1575 static NodeRef getEntryNode(const ::clang::CFG *F) { return &F->getExit(); }
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DR600ISelDAGToDAG.cpp165 Base = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), in SelectADDRVTX_READ()
166 SDLoc(CurDAG->getEntryNode()), R600::ZERO, in SelectADDRVTX_READ()
/llvm-project-15.0.7/mlir/include/mlir/Analysis/
H A DCallGraph.h227 static NodeRef getEntryNode(NodeRef node) { return node; }
248 static NodeRef getEntryNode(const mlir::CallGraph *cg) {
/llvm-project-15.0.7/llvm/lib/Target/LoongArch/
H A DLoongArchISelDAGToDAG.cpp44 SDValue New = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), DL, in Select()
136 CurDAG->getCopyFromReg(CurDAG->getEntryNode(), DL, LoongArch::R0, VT); in selectShiftMask()
/llvm-project-15.0.7/llvm/unittests/Analysis/
H A DCallGraphTest.cpp33 NodeRef N = GraphTraits<Ty *>::getEntryNode(G); in canSpecializeGraphTraitsIterators()
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DDirectedGraphTest.cpp68 static NodeRef getEntryNode(NodeRef N) { return N; } in getEntryNode() function
85 static NodeRef getEntryNode(DGTestGraph *DG) { return *DG->begin(); } in getEntryNode() function

12345