Home
last modified time | relevance | path

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

12345

/freebsd/contrib/llvm-project/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)); \
309 static NodeRef getEntryNode(RegionT *R) { \
313 return nodes_iterator::begin(getEntryNode(R)); \
316 return nodes_iterator::end(getEntryNode(R)); \
332 static NodeRef getEntryNode(RegionInfo *RI) {
333 return GraphTraits<FlatIt<Region*>>::getEntryNode(RI->getTopLevelRegion());
[all …]
H A DPostDominators.h102 static NodeRef getEntryNode(PostDominatorTree *DT) {
107 return df_begin(getEntryNode(N));
111 return df_end(getEntryNode(N));
H A DCallGraph.h436 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
456 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
484 static NodeRef getEntryNode(CallGraph *CGN) {
511 static NodeRef getEntryNode(const CallGraph *CGN) {
H A DDDG.h500 static NodeRef getEntryNode(NodeRef N) { return N; }
517 static NodeRef getEntryNode(DataDependenceGraph *DG) {
540 static NodeRef getEntryNode(NodeRef N) { return N; }
558 static NodeRef getEntryNode(const DataDependenceGraph *DG) {
H A DLoopInfo.h556 static NodeRef getEntryNode(const Loop *L) { return L; }
565 static NodeRef getEntryNode(Loop *L) { return L; }
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanCFG.h132 static NodeRef getEntryNode(VPBlockDeepTraversalWrapper<VPBlockBase *> N) {
151 getEntryNode(VPBlockDeepTraversalWrapper<const VPBlockBase *> N) {
178 static NodeRef getEntryNode(VPBlockShallowTraversalWrapper<VPBlockBase *> N) {
197 getEntryNode(VPBlockShallowTraversalWrapper<const VPBlockBase *> N) {
245 static NodeRef getEntryNode(NodeRef N) { return N; }
260 static NodeRef getEntryNode(NodeRef N) { return N; }
278 static NodeRef getEntryNode(Inverse<NodeRef> B) {
296 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); }
H A DVPlanDominatorTree.h31 static NodePtr getEntryNode(ParentPtr Parent) { return Parent->getEntry(); }
/freebsd/contrib/llvm-project/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.h178 static NodeRef getEntryNode(const MachineLoop *L) { return L; }
187 static NodeRef getEntryNode(MachineLoop *L) { return L; }
H A DMachineDominators.h333 static NodeRef getEntryNode(NodeRef N) { return N; } in getEntryNode() function
354 static NodeRef getEntryNode(MachineDominatorTree *DT) {
H A DMachineCFGPrinter.h33 static NodeRef getEntryNode(DOTMachineFuncInfo *CFGInfo) {
H A DMachineFunction.h1396 static NodeRef getEntryNode(MachineFunction *F) { return &F->front(); }
1413 static NodeRef getEntryNode(const MachineFunction *F) { return &F->front(); }
1438 static NodeRef getEntryNode(Inverse<MachineFunction *> G) {
1444 static NodeRef getEntryNode(Inverse<const MachineFunction *> G) {
/freebsd/contrib/llvm-project/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.h244 static NodeRef getEntryNode(NodeRef N) { return N; }
249 return df_begin(getEntryNode(N));
252 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
267 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }
270 return df_begin(getEntryNode(N));
274 return df_end(getEntryNode(N));
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h135 ProfiledCallGraphNode *getEntryNode() { return &Root; }
223 static NodeRef getEntryNode(NodeRef PCGN) { return PCGN; }
231 static NodeRef getEntryNode(ProfiledCallGraph *PCG) {
232 return PCG->getEntryNode();
138 ProfiledCallGraphNode *getEntryNode() { return &Root; } getEntryNode() function
/freebsd/contrib/llvm-project/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.h1485 static NodeRef getEntryNode(::clang::CFGBlock *BB) { return BB; }
1494 static NodeRef getEntryNode(const clang::CFGBlock *BB) { return BB; }
1503 static NodeRef getEntryNode(Inverse<::clang::CFGBlock *> G) {
1515 static NodeRef getEntryNode(Inverse<const ::clang::CFGBlock *> G) {
1529 static NodeRef getEntryNode(::clang::CFG *F) { return &F->getEntry(); }
1539 static NodeRef getEntryNode(const ::clang::CFG *F) { return &F->getEntry(); }
1558 static NodeRef getEntryNode(::clang::CFG *F) { return &F->getExit(); }
1567 static NodeRef getEntryNode(const ::clang::CFG *F) { return &F->getExit(); }
/freebsd/contrib/llvm-project/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; }
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DR600ISelDAGToDAG.cpp181 Base = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), in SelectADDRVTX_READ()
182 SDLoc(CurDAG->getEntryNode()), R600::ZERO, in SelectADDRVTX_READ()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDepthFirstIterator.h153 return df_iterator(GT::getEntryNode(G)); in begin()
159 return df_iterator(GT::getEntryNode(G), S); in begin()
H A DPostOrderIterator.h149 return po_iterator(GT::getEntryNode(G)); in begin()
154 return po_iterator(GT::getEntryNode(G), S); in begin()
/freebsd/contrib/llvm-project/llvm/lib/Target/VE/
H A DVEISelDAGToDAG.cpp286 New = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), SDLoc(N), VE::VM0, in Select()
289 New = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), SDLoc(N), VE::VMP0, in Select()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineRegionInfo.cpp67 MachineBasicBlock *Entry = GraphTraits<MachineFunction*>::getEntryNode(&F); in recalculate()
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DPostOrderCFGView.h92 static NodeRef getEntryNode(const ::clang::CFG *F) { in getEntryNode() function
/freebsd/contrib/llvm-project/llvm/lib/Target/Lanai/
H A DLanaiISelDAGToDAG.cpp329 SDValue New = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), in Select()
336 SDValue New = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), in Select()

12345