Home
last modified time | relevance | path

Searched refs:NodeRef (Results 1 – 25 of 61) sorted by relevance

123

/openbsd/gnu/llvm/llvm/include/llvm/Analysis/
H A DRegionIterator.h41 using value_type = NodeRef;
88 NodeRef succ; in getISucc()
174 NodeRef Node;
179 using value_type = NodeRef;
249 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_begin(NodeRef Node) { in succ_begin()
254 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_end(NodeRef Node) { in succ_end()
269 static NodeRef getEntryNode(NodeRef N) { return N; } \
281 static NodeRef getEntryNode(NodeRef N) { return N; } \
307 df_iterator<NodeRef, df_iterator_default_set<NodeRef>, false, \
329 df_iterator<NodeRef, df_iterator_default_set<NodeRef>, false,
[all …]
H A DInterval.h117 using NodeRef = Interval *;
120 static NodeRef getEntryNode(Interval *I) { return I; }
123 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
124 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
128 using NodeRef = Interval *;
131 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
132 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
133 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
H A DLoopIterator.h41 using NodeRef = std::pair<const Loop *, BasicBlock *>; member
49 NodeRef, std::ptrdiff_t, NodeRef *, NodeRef> {
53 NodeRef, std::ptrdiff_t, NodeRef *, NodeRef>;
61 NodeRef operator*() const { return {L, *I}; }
65 bool operator()(NodeRef N) const { in operator()
74 static NodeRef getEntryNode(const Loop &G) { return {&G, G.getHeader()}; } in getEntryNode()
76 static ChildIteratorType child_begin(NodeRef Node) { in child_begin()
84 static ChildIteratorType child_end(NodeRef Node) { in child_end()
H A DSyntheticCountsUtils.h31 using NodeRef = typename CGT::NodeRef; variable
33 using SccTy = std::vector<NodeRef>;
38 function_ref<std::optional<Scaled64>(NodeRef, EdgeRef)>;
39 using AddCountTy = function_ref<void(NodeRef, Scaled64)>;
H A DCallGraph.h429 using NodeRef = CallGraphNode *;
432 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
438 static ChildIteratorType child_begin(NodeRef N) {
442 static ChildIteratorType child_end(NodeRef N) {
448 using NodeRef = const CallGraphNode *;
459 static ChildIteratorType child_begin(NodeRef N) {
463 static ChildIteratorType child_end(NodeRef N) {
467 static ChildEdgeIteratorType child_edge_begin(NodeRef N) {
472 static NodeRef edge_dest(EdgeRef E) { return E.second; }
480 static NodeRef getEntryNode(CallGraph *CGN) {
[all …]
H A DDDG.h487 using NodeRef = DDGNode *;
499 static NodeRef getEntryNode(NodeRef N) { return N; }
500 static ChildIteratorType child_begin(NodeRef N) {
503 static ChildIteratorType child_end(NodeRef N) {
507 static ChildEdgeIteratorType child_edge_begin(NodeRef N) {
516 static NodeRef getEntryNode(DataDependenceGraph *DG) {
527 using NodeRef = const DDGNode *;
539 static NodeRef getEntryNode(NodeRef N) { return N; }
540 static ChildIteratorType child_begin(NodeRef N) {
543 static ChildIteratorType child_end(NodeRef N) {
[all …]
/openbsd/gnu/llvm/llvm/lib/Transforms/Vectorize/
H A DVPlanCFG.h128 using NodeRef = VPBlockBase *;
146 using NodeRef = const VPBlockBase *;
149 static NodeRef
174 using NodeRef = VPBlockBase *;
195 static NodeRef
241 using NodeRef = VPBlockBase *;
244 static NodeRef getEntryNode(NodeRef N) { return N; }
259 static NodeRef getEntryNode(NodeRef N) { return N; }
274 using NodeRef = VPBlockBase *;
277 static NodeRef getEntryNode(Inverse<NodeRef> B) {
[all …]
/openbsd/gnu/llvm/llvm/include/llvm/ADT/
H A DPostOrderIterator.h64 template <typename NodeRef>
65 bool insertEdge(std::optional<NodeRef> From, NodeRef To) { in insertEdge()
70 template <typename NodeRef> void finishPostorder(NodeRef BB) {} in finishPostorder()
85 template <class NodeRef>
86 bool insertEdge(std::optional<NodeRef> From, NodeRef To) { in insertEdge()
91 template <class NodeRef> void finishPostorder(NodeRef BB) {} in finishPostorder()
100 using value_type = typename GT::NodeRef;
106 using NodeRef = typename GT::NodeRef;
113 po_iterator(NodeRef BB) { in po_iterator()
121 po_iterator(NodeRef BB, SetType &S) in po_iterator()
[all …]
H A DDepthFirstIterator.h68 template <typename NodeRef, unsigned SmallSize=8>
70 using BaseSet = SmallPtrSet<NodeRef, SmallSize>;
77 void completed(NodeRef) {} in completed()
88 using value_type = typename GT::NodeRef;
94 using NodeRef = typename GT::NodeRef;
105 inline df_iterator(NodeRef Node) { in df_iterator()
112 inline df_iterator(NodeRef Node, SetType &S) in df_iterator()
125 NodeRef Node = VisitStack.back().first; in toNext()
135 NodeRef Next = *(*Opt)++; in toNext()
174 NodeRef operator->() const { return **this; }
[all …]
H A DBreadthFirstIterator.h39 template <typename NodeRef, unsigned SmallSize = 8>
40 using bf_iterator_default_set = SmallPtrSet<NodeRef, SmallSize>;
45 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
50 using value_type = typename GT::NodeRef;
56 using NodeRef = typename GT::NodeRef;
60 using QueueElement = std::pair<NodeRef, std::optional<ChildItTy>>;
69 inline bf_iterator(NodeRef Node) { in bf_iterator()
83 NodeRef Node = H.first; in toNext()
89 NodeRef Next = *(*ChildIt)++; in toNext()
126 const NodeRef &operator*() const { return VisitQueue.front()->first; }
[all …]
H A DSCCIterator.h49 using NodeRef = typename GT::NodeRef; variable
51 using SccTy = std::vector<NodeRef>;
56 NodeRef Node; ///< The current node pointer.
75 DenseMap<NodeRef, unsigned> nodeVisitNumbers;
78 std::vector<NodeRef> SCCNodeStack;
88 void DFSVisitOne(NodeRef N);
96 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator()
139 void ReplaceNode(NodeRef Old, NodeRef New) { in ReplaceNode()
166 NodeRef childN = *VisitStack.back().NextChild++; in DFSVisitChildren()
187 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
[all …]
H A DGraphTraits.h80 using NodeRef = typename GraphType::UnknownGraphTypeError; member
123 children(const typename GraphTraits<GraphType>::NodeRef &G) {
130 inverse_children(const typename GraphTraits<GraphType>::NodeRef &G) {
137 children_edges(const typename GraphTraits<GraphType>::NodeRef &G) {
H A DIntervalMap.h493 class NodeRef {
503 NodeRef() = default;
523 NodeRef &subtree(unsigned i) const { in subtree()
743 NodeRef safeLookup(KeyT x) const { in safeLookup()
784 Entry(NodeRef Node, unsigned Offset) in Entry()
787 NodeRef &subtree(unsigned i) const { in subtree()
824 NodeRef &subtree(unsigned Level) const { in subtree()
1233 NodeRef node[Nodes]; in branchRoot()
1237 node[n] = NodeRef(L, size[n]); in branchRoot()
1274 NodeRef Node[Nodes]; in splitRoot()
[all …]
/openbsd/gnu/llvm/clang/include/clang/AST/
H A DStmtGraphTraits.h24 using NodeRef = clang::Stmt *;
28 static NodeRef getEntryNode(clang::Stmt *S) { return S; }
30 static ChildIteratorType child_begin(NodeRef N) {
35 static ChildIteratorType child_end(NodeRef N) {
50 using NodeRef = const clang::Stmt *;
54 static NodeRef getEntryNode(const clang::Stmt *S) { return S; }
56 static ChildIteratorType child_begin(NodeRef N) {
61 static ChildIteratorType child_end(NodeRef N) {
/openbsd/gnu/llvm/llvm/include/llvm/IR/
H A DCFG.h301 using NodeRef = BasicBlock *;
304 static NodeRef getEntryNode(BasicBlock *BB) { return BB; }
306 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
310 using NodeRef = const BasicBlock *;
313 static NodeRef getEntryNode(const BasicBlock *BB) { return BB; }
316 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
325 using NodeRef = BasicBlock *;
330 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
334 using NodeRef = const BasicBlock *;
391 static NodeRef getEntryNode(Inverse<Function *> G) {
[all …]
H A DDominators.h240 using NodeRef = Node *;
244 static NodeRef getEntryNode(NodeRef N) { return N; }
245 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
246 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
248 static nodes_iterator nodes_begin(NodeRef N) {
252 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
267 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }
/openbsd/gnu/llvm/llvm/lib/Support/
H A DIntervalMap.cpp25 NodeRef Path::getLeftSibling(unsigned Level) const { in getLeftSibling()
28 return NodeRef(); in getLeftSibling()
37 return NodeRef(); in getLeftSibling()
40 NodeRef NR = path[l].subtree(path[l].offset - 1); in getLeftSibling()
65 NodeRef NR = subtree(l); in moveLeft()
75 NodeRef Path::getRightSibling(unsigned Level) const { in getRightSibling()
78 return NodeRef(); in getRightSibling()
87 return NodeRef(); in getRightSibling()
90 NodeRef NR = path[l].subtree(path[l].offset + 1); in getRightSibling()
110 NodeRef NR = subtree(l); in moveRight()
/openbsd/gnu/llvm/llvm/include/llvm/CodeGen/
H A DMachineLoopInfo.h185 using NodeRef = const MachineLoop *;
188 static NodeRef getEntryNode(const MachineLoop *L) { return L; }
189 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
190 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
194 using NodeRef = MachineLoop *;
197 static NodeRef getEntryNode(MachineLoop *L) { return L; }
198 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
199 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
H A DMachineRegionInfo.h139 using nodes_iterator = df_iterator<NodeRef, df_iterator_default_set<NodeRef>,
140 false, GraphTraits<FlatIt<NodeRef>>>;
142 static NodeRef getEntryNode(MachineRegionInfo *RI) {
159 using nodes_iterator = df_iterator<NodeRef, df_iterator_default_set<NodeRef>,
160 false, GraphTraits<FlatIt<NodeRef>>>;
162 static NodeRef getEntryNode(MachineRegionInfoPass *RI) {
H A DRDFLiveness.h39 using NodeRef = std::pair<NodeId, LaneBitmask>; variable
47 template <> struct hash<llvm::rdf::detail::NodeRef> {
48 std::size_t operator()(llvm::rdf::detail::NodeRef R) const {
75 using NodeRef = detail::NodeRef;
76 using NodeRefSet = std::unordered_set<NodeRef>;
H A DMachineDominators.h261 using NodeRef = Node *; member
264 static NodeRef getEntryNode(NodeRef N) { return N; } in getEntryNode()
265 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); } in child_begin()
266 static ChildIteratorType child_end(NodeRef N) { return N->end(); } in child_end()
285 static NodeRef getEntryNode(MachineDominatorTree *DT) {
/openbsd/gnu/llvm/clang/include/clang/Analysis/Analyses/
H A DDominators.h196 using NodeRef = typename GraphTraits<clang::CFGBlock *>::NodeRef;
197 using ChildrenTy = SmallVector<NodeRef, 8>;
199 ChildrenTy get(const NodeRef &N) {
281 using NodeRef = ::clang::DomTreeNode *;
284 static NodeRef getEntryNode(NodeRef N) { return N; }
285 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
286 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
302 static NodeRef getEntryNode(clang::CFGDomTree *DT) {
/openbsd/gnu/llvm/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h186 using NodeRef = ProfiledCallGraphNode *;
190 static NodeRef getEntryNode(NodeRef PCGN) { return PCGN; }
191 static ChildIteratorType child_begin(NodeRef N) { return N->Edges.begin(); }
192 static ChildIteratorType child_end(NodeRef N) { return N->Edges.end(); }
198 static NodeRef getEntryNode(ProfiledCallGraph *PCG) {
/openbsd/gnu/llvm/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h40 using NodeRef = typename GraphTraits<NodeTy *>::NodeRef; member
41 using ChildrenTy = SmallVector<NodeRef, 8>;
43 ChildrenTy get(const NodeRef &N);
120 ChildrenGetterTy<NodeTy, IsPostDom>::get(const NodeRef &N) { in get()
H A DGraphWriter.h71 using NodeRef = typename GTraits::NodeRef; variable
76 static_assert(std::is_pointer<NodeRef>::value,
83 bool getEdgeSourceLabels(raw_ostream &O, NodeRef Node) { in getEdgeSourceLabels()
172 bool isNodeHidden(NodeRef Node) { return DTraits.isNodeHidden(Node, G); } in isNodeHidden()
174 void writeNode(NodeRef Node) { in writeNode()
288 void writeEdge(NodeRef Node, unsigned edgeidx, child_iterator EI) { in writeEdge()
289 if (NodeRef TargetNode = *EI) { in writeEdge()

123