Home
last modified time | relevance | path

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

12

/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DRegionIterator.h83 NodeRef getISucc(BlockT *BB) const { in getISucc()
84 NodeRef succ; in getISucc()
106 inline RNSuccIterator(NodeRef node) in RNSuccIterator()
173 NodeRef Node;
243 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_begin(NodeRef Node) { in succ_begin()
248 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_end(NodeRef Node) { in succ_end()
263 static NodeRef getEntryNode(NodeRef N) { return N; } \
275 static NodeRef getEntryNode(NodeRef N) { return N; } \
301 df_iterator<NodeRef, df_iterator_default_set<NodeRef>, false, \
323 df_iterator<NodeRef, df_iterator_default_set<NodeRef>, false,
[all …]
H A DLoopIterator.h42 using NodeRef = std::pair<const Loop *, BasicBlock *>; member
50 NodeRef, std::ptrdiff_t, NodeRef *, NodeRef> {
54 NodeRef, std::ptrdiff_t, NodeRef *, NodeRef>;
62 NodeRef operator*() const { return {L, *I}; }
66 bool operator()(NodeRef N) const { in operator()
75 static NodeRef getEntryNode(const Loop &G) { return {&G, G.getHeader()}; } in getEntryNode()
77 static ChildIteratorType child_begin(NodeRef Node) { in child_begin()
85 static ChildIteratorType child_end(NodeRef Node) { in child_end()
H A DInterval.h121 using NodeRef = Interval *;
124 static NodeRef getEntryNode(Interval *I) { return I; }
127 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
128 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
132 using NodeRef = Interval *;
135 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
136 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
137 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
H A DCallGraph.h408 using NodeRef = CallGraphNode *;
411 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
417 static ChildIteratorType child_begin(NodeRef N) {
421 static ChildIteratorType child_end(NodeRef N) {
427 using NodeRef = const CallGraphNode *;
438 static ChildIteratorType child_begin(NodeRef N) {
442 static ChildIteratorType child_end(NodeRef N) {
446 static ChildEdgeIteratorType child_edge_begin(NodeRef N) {
451 static NodeRef edge_dest(EdgeRef E) { return E.second; }
459 static NodeRef getEntryNode(CallGraph *CGN) {
[all …]
H A DSyntheticCountsUtils.h35 using NodeRef = typename CGT::NodeRef; variable
37 using SccTy = std::vector<NodeRef>;
41 using GetProfCountTy = function_ref<Optional<Scaled64>(NodeRef, EdgeRef)>;
42 using AddCountTy = function_ref<void(NodeRef, Scaled64)>;
/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A DPostOrderIterator.h63 template <typename NodeRef>
64 bool insertEdge(Optional<NodeRef> From, NodeRef To) { in insertEdge()
69 template <typename NodeRef> void finishPostorder(NodeRef BB) {} in finishPostorder()
84 template <class NodeRef> bool insertEdge(Optional<NodeRef> From, NodeRef To) { in insertEdge()
89 template <class NodeRef> void finishPostorder(NodeRef BB) {} in finishPostorder()
100 using NodeRef = typename GT::NodeRef; variable
107 po_iterator(NodeRef BB) { in po_iterator()
108 this->insertEdge(Optional<NodeRef>(), BB); in po_iterator()
115 po_iterator(NodeRef BB, SetType &S) in po_iterator()
289 using NodeRef = typename GT::NodeRef; variable
[all …]
H A DSCCIterator.h46 using NodeRef = typename GT::NodeRef; variable
48 using SccTy = std::vector<NodeRef>;
53 NodeRef Node; ///< The current node pointer.
72 DenseMap<NodeRef, unsigned> nodeVisitNumbers;
75 std::vector<NodeRef> SCCNodeStack;
85 void DFSVisitOne(NodeRef N);
93 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator()
136 void ReplaceNode(NodeRef Old, NodeRef New) { in ReplaceNode()
160 NodeRef childN = *VisitStack.back().NextChild++; in DFSVisitChildren()
181 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
[all …]
H A DBreadthFirstIterator.h40 template <typename NodeRef, unsigned SmallSize = 8>
41 using bf_iterator_default_set = SmallPtrSet<NodeRef, SmallSize>;
46 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
49 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
53 using NodeRef = typename GT::NodeRef; variable
57 using QueueElement = std::pair<NodeRef, Optional<ChildItTy>>;
67 inline bf_iterator(NodeRef Node) { in bf_iterator()
81 NodeRef Node = H.first; in toNext()
87 NodeRef Next = *(*ChildIt)++; in toNext()
126 const NodeRef &operator*() const { return VisitQueue.front()->first; }
[all …]
H A DDepthFirstIterator.h69 template <typename NodeRef, unsigned SmallSize=8>
71 using BaseSet = SmallPtrSet<NodeRef, SmallSize>;
78 void completed(NodeRef) {} in completed()
90 using NodeRef = typename GT::NodeRef; variable
96 using StackElement = std::pair<NodeRef, Optional<ChildItTy>>;
102 inline df_iterator(NodeRef Node) { in df_iterator()
109 inline df_iterator(NodeRef Node, SetType &S) in df_iterator()
122 NodeRef Node = VisitStack.back().first; in toNext()
132 NodeRef Next = *(*Opt)++; in toNext()
173 NodeRef operator->() const { return **this; }
[all …]
H A Diterator.h339 template <typename ItType, typename NodeRef, typename DataRef>
342 WrappedPairNodeDataIterator<ItType, NodeRef, DataRef>, ItType,
343 typename std::iterator_traits<ItType>::iterator_category, NodeRef,
344 std::ptrdiff_t, NodeRef *, NodeRef &> {
347 typename std::iterator_traits<ItType>::iterator_category, NodeRef,
348 std::ptrdiff_t, NodeRef *, NodeRef &>;
351 mutable NodeRef NR;
359 NodeRef &operator*() const {
H A DIntervalMap.h491 class NodeRef {
501 NodeRef() = default;
521 NodeRef &subtree(unsigned i) const { in subtree()
741 NodeRef safeLookup(KeyT x) const { in safeLookup()
782 Entry(NodeRef Node, unsigned Offset) in Entry()
785 NodeRef &subtree(unsigned i) const { in subtree()
822 NodeRef &subtree(unsigned Level) const { in subtree()
1187 NodeRef node[Nodes]; in branchRoot()
1191 node[n] = NodeRef(L, size[n]); in branchRoot()
1228 NodeRef Node[Nodes]; in splitRoot()
[all …]
H A DGraphTraits.h79 using NodeRef = typename GraphType::UnknownGraphTypeError; member
122 children(const typename GraphTraits<GraphType>::NodeRef &G) {
129 inverse_children(const typename GraphTraits<GraphType>::NodeRef &G) {
136 children_edges(const typename GraphTraits<GraphType>::NodeRef &G) {
/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DCFGDiff.h161 using NodeRef = std::pair<DataRef, BasicBlock *>; member
168 bool operator()(NodeRef N) const { in operator()
177 WrappedPairNodeDataIterator<vec_iterator, NodeRef, DataRef>;
179 concat_iterator<NodeRef, FilterExistingChildrenIterator,
182 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
197 static ChildIteratorType child_end(NodeRef N) { in child_end()
215 using NodeRef = std::pair<DataRef, BasicBlock *>; member
222 bool operator()(NodeRef N) const { in operator()
233 concat_iterator<NodeRef, FilterExistingChildrenIterator,
236 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
[all …]
H A DCFG.h304 using NodeRef = BasicBlock *;
307 static NodeRef getEntryNode(BasicBlock *BB) { return BB; }
309 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
313 using NodeRef = const BasicBlock *;
316 static NodeRef getEntryNode(const BasicBlock *BB) { return BB; }
319 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
328 using NodeRef = BasicBlock *;
333 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
337 using NodeRef = const BasicBlock *;
394 static NodeRef getEntryNode(Inverse<Function *> G) {
[all …]
H A DDominators.h193 using NodeRef = Node *;
197 static NodeRef getEntryNode(NodeRef N) { return N; }
198 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
199 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
201 static nodes_iterator nodes_begin(NodeRef N) {
205 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
219 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }
H A DType.h475 using NodeRef = Type *;
478 static NodeRef getEntryNode(Type *T) { return T; }
479 static ChildIteratorType child_begin(NodeRef N) { return N->subtype_begin(); }
480 static ChildIteratorType child_end(NodeRef N) { return N->subtype_end(); }
484 using NodeRef = const Type *;
487 static NodeRef getEntryNode(NodeRef T) { return T; }
488 static ChildIteratorType child_begin(NodeRef N) { return N->subtype_begin(); }
489 static ChildIteratorType child_end(NodeRef N) { return N->subtype_end(); }
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/AST/
H A DStmtGraphTraits.h25 using NodeRef = clang::Stmt *;
29 static NodeRef getEntryNode(clang::Stmt *S) { return S; }
31 static ChildIteratorType child_begin(NodeRef N) {
36 static ChildIteratorType child_end(NodeRef N) {
51 using NodeRef = const clang::Stmt *;
55 static NodeRef getEntryNode(const clang::Stmt *S) { return S; }
57 static ChildIteratorType child_begin(NodeRef N) {
62 static ChildIteratorType child_end(NodeRef N) {
/freebsd-12.1/contrib/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()
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DMachineLoopInfo.h174 using NodeRef = const MachineLoop *;
177 static NodeRef getEntryNode(const MachineLoop *L) { return L; }
178 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
179 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
183 using NodeRef = MachineLoop *;
186 static NodeRef getEntryNode(MachineLoop *L) { return L; }
187 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
188 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
H A DMachineRegionInfo.h140 using nodes_iterator = df_iterator<NodeRef, df_iterator_default_set<NodeRef>,
141 false, GraphTraits<FlatIt<NodeRef>>>;
143 static NodeRef getEntryNode(MachineRegionInfo *RI) {
160 using nodes_iterator = df_iterator<NodeRef, df_iterator_default_set<NodeRef>,
161 false, GraphTraits<FlatIt<NodeRef>>>;
163 static NodeRef getEntryNode(MachineRegionInfoPass *RI) {
H A DMachineBasicBlock.h847 using NodeRef = MachineBasicBlock *;
850 static NodeRef getEntryNode(MachineBasicBlock *BB) { return BB; }
852 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
856 using NodeRef = const MachineBasicBlock *;
859 static NodeRef getEntryNode(const MachineBasicBlock *BB) { return BB; }
861 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
871 using NodeRef = MachineBasicBlock *;
874 static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) {
879 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
883 using NodeRef = const MachineBasicBlock *;
[all …]
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()
284 static NodeRef getEntryNode(MachineDominatorTree *DT) {
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/
H A DDominators.h166 using NodeRef = ::clang::DomTreeNode *;
169 static NodeRef getEntryNode(NodeRef N) { return N; }
170 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
171 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
187 static NodeRef getEntryNode(::clang::DominatorTree *DT) {
/freebsd-12.1/contrib/llvm/include/llvm/Support/
H A DGraphWriter.h73 using NodeRef = typename GTraits::NodeRef; variable
78 static_assert(std::is_pointer<NodeRef>::value,
85 bool getEdgeSourceLabels(raw_ostream &O, NodeRef Node) { in getEdgeSourceLabels()
162 bool isNodeHidden(NodeRef Node) { in isNodeHidden()
166 void writeNode(NodeRef Node) { in writeNode()
239 void writeEdge(NodeRef Node, unsigned edgeidx, child_iterator EI) { in writeEdge()
240 if (NodeRef TargetNode = *EI) { in writeEdge()
/freebsd-12.1/contrib/llvm/lib/Transforms/Vectorize/
H A DVPlan.h1319 using NodeRef = VPBlockBase *;
1322 static NodeRef getEntryNode(NodeRef N) { return N; }
1328 static inline ChildIteratorType child_end(NodeRef N) {
1334 using NodeRef = const VPBlockBase *;
1337 static NodeRef getEntryNode(NodeRef N) { return N; }
1351 using NodeRef = VPBlockBase *;
1354 static NodeRef getEntryNode(Inverse<NodeRef> B) { return B.Graph; }
1375 using nodes_iterator = df_iterator<NodeRef>;
1394 using nodes_iterator = df_iterator<NodeRef>;
1413 using nodes_iterator = df_iterator<NodeRef>;
[all …]

12