Home
last modified time | relevance | path

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

1234

/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
HDRegionIterator.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 …]
HDPostDominators.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));
HDCallGraph.h411 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
431 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
459 static NodeRef getEntryNode(CallGraph *CGN) {
486 static NodeRef getEntryNode(const CallGraph *CGN) {
HDInterval.h123 static NodeRef getEntryNode(Interval *I) { return I; }
134 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
HDDDG.h444 static NodeRef getEntryNode(NodeRef N) { return N; }
461 static NodeRef getEntryNode(DataDependenceGraph *DG) {
484 static NodeRef getEntryNode(NodeRef N) { return N; }
502 static NodeRef getEntryNode(const DataDependenceGraph *DG) {
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
HDMachineRegionInfo.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());
HDMachineLoopInfo.h180 static NodeRef getEntryNode(const MachineLoop *L) { return L; }
189 static NodeRef getEntryNode(MachineLoop *L) { return L; }
HDMachineDominators.h263 static NodeRef getEntryNode(NodeRef N) { return N; } in getEntryNode() function
283 static NodeRef getEntryNode(MachineDominatorTree *DT) {
HDMachineFunction.h1027 static NodeRef getEntryNode(MachineFunction *F) { return &F->front(); }
1044 static NodeRef getEntryNode(const MachineFunction *F) { return &F->front(); }
1069 static NodeRef getEntryNode(Inverse<MachineFunction *> G) {
1075 static NodeRef getEntryNode(Inverse<const MachineFunction *> G) {
HDMachineBasicBlock.h874 static NodeRef getEntryNode(MachineBasicBlock *BB) { return BB; }
883 static NodeRef getEntryNode(const MachineBasicBlock *BB) { return BB; }
898 static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) {
910 static NodeRef getEntryNode(Inverse<const MachineBasicBlock *> G) {
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/
HDCFG.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) {
HDDominators.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));
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
HDDominators.h356 static NodeRef getEntryNode(NodeRef N) { return N; }
364 return nodes_iterator(df_begin(getEntryNode(N)));
368 return nodes_iterator(df_end(getEntryNode(N)));
374 static NodeRef getEntryNode(clang::CFGDomTree *DT) {
379 return nodes_iterator(df_begin(getEntryNode(N)));
383 return nodes_iterator(df_end(getEntryNode(N)));
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Analysis/
HDCallGraph.h190 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; }
200 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; }
207 static NodeType *getEntryNode(clang::CallGraph *CGN) {
233 static NodeType *getEntryNode(const clang::CallGraph *CGN) {
HDCFG.h1476 static NodeRef getEntryNode(::clang::CFGBlock *BB) { return BB; }
1488 static NodeRef getEntryNode(const clang::CFGBlock *BB) { return BB; }
1500 static NodeRef getEntryNode(Inverse<::clang::CFGBlock *> G) {
1515 static NodeRef getEntryNode(Inverse<const ::clang::CFGBlock *> G) {
1532 static NodeRef getEntryNode(::clang::CFG *F) { return &F->getEntry(); }
1542 static NodeRef getEntryNode(const ::clang::CFG *F) { return &F->getEntry(); }
1561 static NodeRef getEntryNode(::clang::CFG *F) { return &F->getExit(); }
1570 static NodeRef getEntryNode(const ::clang::CFG *F) { return &F->getExit(); }
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/
HDStmtGraphTraits.h28 static NodeRef getEntryNode(clang::Stmt *S) { return S; }
54 static NodeRef getEntryNode(const clang::Stmt *S) { return S; }
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
HDPostOrderIterator.h141 return po_iterator(GT::getEntryNode(G)); in begin()
146 return po_iterator(GT::getEntryNode(G), S); in begin()
300 ReversePostOrderTraversal(GraphT G) { Initialize(GT::getEntryNode(G)); } in ReversePostOrderTraversal()
HDDepthFirstIterator.h151 return df_iterator(GT::getEntryNode(G)); in begin()
157 return df_iterator(GT::getEntryNode(G), S); in begin()
HDBreadthFirstIterator.h114 return bf_iterator(GT::getEntryNode(G)); in begin()
HDSCCIterator.h102 return scc_iterator(GT::getEntryNode(G)); in begin()
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
HDVPlan.h1235 static NodeRef getEntryNode(NodeRef N) { return N; }
1250 static NodeRef getEntryNode(NodeRef N) { return N; }
1267 static NodeRef getEntryNode(Inverse<NodeRef> B) { return B.Graph; }
1290 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); }
1309 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); }
1328 static NodeRef getEntryNode(Inverse<GraphRef> N) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Lanai/
HDLanaiISelDAGToDAG.cpp291 SDValue New = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), in Select()
298 SDValue New = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), in Select()
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
HDMachineRegionInfo.cpp67 MachineBasicBlock *Entry = GraphTraits<MachineFunction*>::getEntryNode(&F); in recalculate()
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
HDFunctionAttrs.cpp346 ArgumentGraphNode *getEntryNode() { return &SyntheticRoot; } in getEntryNode() function in __anon0cd6c7b00211::ArgumentGraph
426 static NodeRef getEntryNode(NodeRef A) { return A; } in getEntryNode() function
433 static NodeRef getEntryNode(ArgumentGraph *AG) { return AG->getEntryNode(); } in getEntryNode() function
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
HDLegalizeDAG.cpp334 ISD::EXTLOAD, dl, OrigVT, DAG.getEntryNode(), CPIdx, in ExpandConstantFP()
340 OrigVT, dl, DAG.getEntryNode(), CPIdx, in ExpandConstantFP()
353 VT, dl, DAG.getEntryNode(), CPIdx, in ExpandConstant()
384 DAG.getEntryNode(), dl, Tmp1, StackPtr, in PerformInsertVectorEltInMemory()
1312 if (!ST->getChain().reachesChainWithoutSideEffects(DAG.getEntryNode())) in ExpandExtractFromVectorThroughStack()
1335 Ch = DAG.getStore(DAG.getEntryNode(), dl, Vec, StackPtr, in ExpandExtractFromVectorThroughStack()
1380 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, Vec, StackPtr, PtrInfo); in ExpandInsertToVectorThroughStack()
1422 Stores.push_back(DAG.getTruncStore(DAG.getEntryNode(), dl, in ExpandVectorBuildThroughStack()
1426 Stores.push_back(DAG.getStore(DAG.getEntryNode(), dl, Node->getOperand(i), in ExpandVectorBuildThroughStack()
1434 StoreChain = DAG.getEntryNode(); in ExpandVectorBuildThroughStack()
[all …]

1234