Home
last modified time | relevance | path

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

1234

/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DRegionIterator.h263 static NodeRef getEntryNode(NodeRef N) { return N; } \
275 static NodeRef getEntryNode(NodeRef N) { return N; } \
287 static NodeRef getEntryNode(RegionT *R) { \
291 return nodes_iterator::begin(getEntryNode(R)); \
294 return nodes_iterator::end(getEntryNode(R)); \
326 static NodeRef getEntryNode(RegionInfo *RI) {
327 return GraphTraits<FlatIt<Region*>>::getEntryNode(RI->getTopLevelRegion());
331 return nodes_iterator::begin(getEntryNode(RI));
335 return nodes_iterator::end(getEntryNode(RI));
345 static NodeRef getEntryNode(RegionInfoPass *RI) {
[all …]
H A DPostDominators.h98 static NodeRef getEntryNode(PostDominatorTree *DT) {
103 if (getEntryNode(N))
104 return df_begin(getEntryNode(N));
106 return df_end(getEntryNode(N));
110 return df_end(getEntryNode(N));
H A DCallGraph.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) {
H A DInterval.h124 static NodeRef getEntryNode(Interval *I) { return I; }
135 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/
H A DDominators.h169 static NodeRef getEntryNode(NodeRef N) { return N; }
177 return nodes_iterator(df_begin(getEntryNode(N)));
181 return nodes_iterator(df_end(getEntryNode(N)));
187 static NodeRef getEntryNode(::clang::DominatorTree *DT) {
192 return nodes_iterator(df_begin(getEntryNode(N)));
196 return nodes_iterator(df_end(getEntryNode(N)));
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DMachineRegionInfo.h143 static NodeRef getEntryNode(MachineRegionInfo *RI) {
144 return GraphTraits<FlatIt<MachineRegion *>>::getEntryNode(
149 return nodes_iterator::begin(getEntryNode(RI));
153 return nodes_iterator::end(getEntryNode(RI));
163 static NodeRef getEntryNode(MachineRegionInfoPass *RI) {
164 return GraphTraits<MachineRegionInfo *>::getEntryNode(&RI->getRegionInfo());
H A DMachineLoopInfo.h177 static NodeRef getEntryNode(const MachineLoop *L) { return L; }
186 static NodeRef getEntryNode(MachineLoop *L) { return L; }
H A DMachineDominators.h264 static NodeRef getEntryNode(NodeRef N) { return N; } in getEntryNode() function
284 static NodeRef getEntryNode(MachineDominatorTree *DT) {
H A DMachineBasicBlock.h850 static NodeRef getEntryNode(MachineBasicBlock *BB) { return BB; }
859 static NodeRef getEntryNode(const MachineBasicBlock *BB) { return BB; }
874 static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) {
886 static NodeRef getEntryNode(Inverse<const MachineBasicBlock *> G) {
H A DMachineFunction.h956 static NodeRef getEntryNode(MachineFunction *F) { return &F->front(); }
973 static NodeRef getEntryNode(const MachineFunction *F) { return &F->front(); }
998 static NodeRef getEntryNode(Inverse<MachineFunction *> G) {
1004 static NodeRef getEntryNode(Inverse<const MachineFunction *> G) {
/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DCFG.h307 static NodeRef getEntryNode(BasicBlock *BB) { return BB; }
316 static NodeRef getEntryNode(const BasicBlock *BB) { return BB; }
331 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
340 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
354 static NodeRef getEntryNode(Function *F) { return &F->getEntryBlock(); }
371 static NodeRef getEntryNode(const Function *F) { return &F->getEntryBlock(); }
394 static NodeRef getEntryNode(Inverse<Function *> G) {
400 static NodeRef getEntryNode(Inverse<const Function *> G) {
H A DDominators.h197 static NodeRef getEntryNode(NodeRef N) { return N; }
202 return df_begin(getEntryNode(N));
205 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
219 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }
222 return df_begin(getEntryNode(N));
226 return df_end(getEntryNode(N));
H A DType.h478 static NodeRef getEntryNode(Type *T) { return T; }
487 static NodeRef getEntryNode(NodeRef T) { return T; }
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/
H A DCallGraph.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) {
H A DCFG.h1244 static NodeRef getEntryNode(::clang::CFGBlock *BB) { return BB; }
1253 static NodeRef getEntryNode(const clang::CFGBlock *BB) { return BB; }
1262 static NodeRef getEntryNode(Inverse<::clang::CFGBlock *> G) {
1274 static NodeRef getEntryNode(Inverse<const ::clang::CFGBlock *> G) {
1288 static NodeRef getEntryNode(::clang::CFG *F) { return &F->getEntry(); }
1298 static NodeRef getEntryNode(const ::clang::CFG *F) { return &F->getEntry(); }
1317 static NodeRef getEntryNode(::clang::CFG *F) { return &F->getExit(); }
1326 static NodeRef getEntryNode(const ::clang::CFG *F) { return &F->getExit(); }
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/AST/
H A DStmtGraphTraits.h29 static NodeRef getEntryNode(clang::Stmt *S) { return S; }
55 static NodeRef getEntryNode(const clang::Stmt *S) { return S; }
/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A DPostOrderIterator.h142 return po_iterator(GT::getEntryNode(G)); in begin()
147 return po_iterator(GT::getEntryNode(G), S); in begin()
301 ReversePostOrderTraversal(GraphT G) { Initialize(GT::getEntryNode(G)); } in ReversePostOrderTraversal()
H A DDepthFirstIterator.h152 return df_iterator(GT::getEntryNode(G)); in begin()
158 return df_iterator(GT::getEntryNode(G), S); in begin()
H A DBreadthFirstIterator.h115 return bf_iterator(GT::getEntryNode(G)); in begin()
/freebsd-12.1/contrib/llvm/lib/Transforms/Vectorize/
H A DVPlan.h1322 static NodeRef getEntryNode(NodeRef N) { return N; }
1337 static NodeRef getEntryNode(NodeRef N) { return N; }
1354 static NodeRef getEntryNode(Inverse<NodeRef> B) { return B.Graph; }
1377 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); }
1396 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); }
1415 static NodeRef getEntryNode(Inverse<GraphRef> N) {
/freebsd-12.1/contrib/llvm/lib/Target/Lanai/
H A DLanaiISelDAGToDAG.cpp292 SDValue New = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), in Select()
299 SDValue New = CurDAG->getCopyFromReg(CurDAG->getEntryNode(), in Select()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DMachineRegionInfo.cpp67 MachineBasicBlock *Entry = GraphTraits<MachineFunction*>::getEntryNode(&F); in recalculate()
/freebsd-12.1/contrib/llvm/lib/Transforms/IPO/
H A DFunctionAttrs.cpp340 ArgumentGraphNode *getEntryNode() { return &SyntheticRoot; } in getEntryNode() function in __anon3955e1fe0211::ArgumentGraph
420 static NodeRef getEntryNode(NodeRef A) { return A; } in getEntryNode() function
427 static NodeRef getEntryNode(ArgumentGraph *AG) { return AG->getEntryNode(); } in getEntryNode() function
/freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeDAG.cpp319 ISD::EXTLOAD, dl, OrigVT, DAG.getEntryNode(), CPIdx, in ExpandConstantFP()
325 OrigVT, dl, DAG.getEntryNode(), CPIdx, in ExpandConstantFP()
338 VT, dl, DAG.getEntryNode(), CPIdx, in ExpandConstant()
369 DAG.getEntryNode(), dl, Tmp1, StackPtr, in PerformInsertVectorEltInMemory()
1414 StoreChain = DAG.getEntryNode(); in ExpandVectorBuildThroughStack()
1946 VT, dl, DAG.getEntryNode(), CPIdx, in ExpandBUILD_VECTOR()
2017 SDValue InChain = DAG.getEntryNode(); in ExpandLibCall()
2075 .setChain(DAG.getEntryNode()) in ExpandLibCall()
2183 SDValue InChain = DAG.getEntryNode(); in ExpandDivRemLibCall()
2278 SDValue InChain = DAG.getEntryNode(); in ExpandSinCosLibCall()
[all …]
/freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/
H A DAMDGPUISelLowering.h268 return CreateLiveInRegister(DAG, RC, Reg, VT, SDLoc(DAG.getEntryNode())); in CreateLiveInRegister()
275 return CreateLiveInRegister(DAG, RC, Reg, VT, SDLoc(DAG.getEntryNode()), true); in CreateLiveInRegisterRaw()

1234