Home
last modified time | relevance | path

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

123

/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DRegionIterator.h38 template <class NodeRef, class BlockT, class RegionT> class RNSuccIterator {
41 using value_type = NodeRef;
61 static_assert(std::is_pointer<NodeRef>::value,
68 PointerIntPair<NodeRef, 2, ItMode> Node;
80 NodeRef getNode() const { return Node.getPointer(); } in getNode()
87 NodeRef getISucc(BlockT *BB) const { in getISucc()
88 NodeRef succ; in getISucc()
106 using Self = RNSuccIterator<NodeRef, BlockT, RegionT>;
109 inline RNSuccIterator(NodeRef node) in RNSuccIterator()
122 inline RNSuccIterator(NodeRef node, bool) in RNSuccIterator()
[all …]
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 getEntryNod
[all...]
H A DSyntheticCountsUtils.h32 using NodeRef = typename CGT::NodeRef; variable
34 using SccTy = std::vector<NodeRef>;
39 function_ref<std::optional<Scaled64>(NodeRef, EdgeRef)>;
40 using AddCountTy = function_ref<void(NodeRef, Scaled64)>;
H A DCallGraph.h417 using NodeRef = CallGraphNode *;
420 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
426 static ChildIteratorType child_begin(NodeRef N) {
430 static ChildIteratorType child_end(NodeRef N) {
436 using NodeRef = const CallGraphNode *;
440 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
447 static ChildIteratorType child_begin(NodeRef N) {
451 static ChildIteratorType child_end(NodeRef N) {
455 static ChildEdgeIteratorType child_edge_begin(NodeRef N) {
458 static ChildEdgeIteratorType child_edge_end(NodeRef N) { return N->end(); }
[all …]
H A DDDG.h492 using NodeRef = DDGNode *;
504 static NodeRef getEntryNode(NodeRef N) { return N; }
505 static ChildIteratorType child_begin(NodeRef N) {
508 static ChildIteratorType child_end(NodeRef N) {
512 static ChildEdgeIteratorType child_edge_begin(NodeRef N) {
515 static ChildEdgeIteratorType child_edge_end(NodeRef N) { return N->end(); }
521 static NodeRef getEntryNode(DataDependenceGraph *DG) {
532 using NodeRef = const DDGNode *;
544 static NodeRef getEntryNode(NodeRef N) { return N; }
545 static ChildIteratorType child_begin(NodeRef N) {
[all …]
H A DLoopInfo.h551 typedef const Loop *NodeRef;
554 static NodeRef getEntryNode(const Loop *L) { return L; }
555 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
556 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
560 typedef Loop *NodeRef;
563 static NodeRef getEntryNode(Loop *L) { return L; }
564 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
565 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
H A DIteratedDominanceFrontier.h23 using NodeRef = BasicBlock *;
31 ChildrenTy get(const NodeRef &N);
66 ChildrenGetterTy<BasicBlock, IsPostDom>::get(const NodeRef &N) {
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanCFG.h131 using NodeRef = VPBlockBase *;
134 static NodeRef getEntryNode(VPBlockDeepTraversalWrapper<VPBlockBase *> N) {
138 static inline ChildIteratorType child_begin(NodeRef N) {
142 static inline ChildIteratorType child_end(NodeRef N) {
149 using NodeRef = const VPBlockBase *;
152 static NodeRef
157 static inline ChildIteratorType child_begin(NodeRef N) {
161 static inline ChildIteratorType child_end(NodeRef N) {
177 using NodeRef = VPBlockBase *;
180 static NodeRef getEntryNode(VPBlockShallowTraversalWrapper<VPBlockBase *> N) {
[all …]
/freebsd/contrib/llvm-project/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()
95 class SetType = SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
103 using value_type = typename GT::NodeRef;
109 using NodeRef = typename GT::NodeRef;
115 SmallVector<std::tuple<NodeRef, ChildItTy, ChildItTy>, 8> VisitStack;
[all …]
H A DDepthFirstIterator.h69 template <typename NodeRef, unsigned SmallSize=8>
70 struct df_iterator_default_set : public SmallPtrSet<NodeRef, SmallSize> {
71 using BaseSet = SmallPtrSet<NodeRef, SmallSize>;
74 std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); } in insert()
78 void completed(NodeRef) {} in completed()
84 df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
92 using value_type = typename GT::NodeRef;
98 using NodeRef = typename GT::NodeRef;
104 using StackElement = std::pair<NodeRef, std::optional<ChildItTy>>;
109 inline df_iterator(NodeRef Node) { in df_iterator()
[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()
131 NodeRef operator->() const { return **this; }
H A DSCCIterator.h49 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
50 using NodeRef = typename GT::NodeRef; variable
52 using SccTy = std::vector<NodeRef>;
57 NodeRef Node; ///< The current node pointer.
61 StackElement(NodeRef Node, const ChildItTy &Child, unsigned Min) in StackElement()
76 DenseMap<NodeRef, unsigned> nodeVisitNumbers;
79 std::vector<NodeRef> SCCNodeStack;
89 void DFSVisitOne(NodeRef N);
97 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator()
140 void ReplaceNode(NodeRef Old, NodeRef New) { in ReplaceNode()
[all …]
H A DGraphTraits.h95 using NodeRef = typename GraphType::UnknownGraphTypeError; member
101 std::declval<typename GraphTraits<T>::NodeRef>()));
149 children(const typename GraphTraits<GraphType>::NodeRef &G) {
156 inverse_children(const typename GraphTraits<GraphType>::NodeRef &G) {
163 children_edges(const typename GraphTraits<GraphType>::NodeRef &G) {
H A DIntervalMap.h494 class NodeRef {
504 NodeRef() = default;
511 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1) { in NodeRef() function
524 NodeRef &subtree(unsigned i) const { in subtree()
525 return reinterpret_cast<NodeRef*>(pip.getPointer())[i]; in subtree()
534 bool operator==(const NodeRef &RHS) const {
541 bool operator!=(const NodeRef &RHS) const {
704 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
707 const NodeRef &subtree(unsigned i) const { return this->first[i]; } in subtree()
710 NodeRef &subtree(unsigned i) { return this->first[i]; } in subtree()
[all …]
/freebsd/contrib/llvm-project/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) {
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DCFG.h302 using NodeRef = BasicBlock *;
305 static NodeRef getEntryNode(BasicBlock *BB) { return BB; }
306 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
307 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
316 using NodeRef = const BasicBlock *;
319 static NodeRef getEntryNode(const BasicBlock *BB) { return BB; }
321 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
322 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
336 using NodeRef = BasicBlock *;
339 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
[all …]
H A DDominators.h245 using NodeRef = Node *;
249 static NodeRef getEntryNode(NodeRef N) { return N; }
250 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
251 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
253 static nodes_iterator nodes_begin(NodeRef N) {
257 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
272 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }
/freebsd/contrib/llvm-project/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/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineLoopInfo.h179 using NodeRef = const MachineLoop *;
182 static NodeRef getEntryNode(const MachineLoop *L) { return L; }
183 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
184 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
188 using NodeRef = MachineLoop *;
191 static NodeRef getEntryNode(MachineLoop *L) { return L; }
192 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
193 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.h36 using NodeRef = std::pair<NodeId, LaneBitmask>; variable
44 template <> struct hash<llvm::rdf::detail::NodeRef> {
45 std::size_t operator()(llvm::rdf::detail::NodeRef R) const {
58 using NodeRef = detail::NodeRef;
59 using NodeRefSet = std::unordered_set<NodeRef>;
H A DMachineDominators.h161 using NodeRef = Node *; member
164 static NodeRef getEntryNode(NodeRef N) { return N; } in getEntryNode()
165 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); } in child_begin()
166 static ChildIteratorType child_end(NodeRef N) { return N->end(); } in child_end()
185 static NodeRef getEntryNode(MachineDominatorTree *DT) {
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DPostOrderCFGView.h84 using NodeRef = const ::clang::CFGBlock *; member
87 static ChildIteratorType child_begin(NodeRef N) { return N->succ_rbegin(); } in child_begin()
88 static ChildIteratorType child_end(NodeRef N) { return N->succ_rend(); } in child_end()
92 static NodeRef getEntryNode(const ::clang::CFG *F) { in getEntryNode()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h218 using NodeRef = ProfiledCallGraphNode *;
222 static NodeRef getEntryNode(NodeRef PCGN) { return PCGN; }
223 static ChildIteratorType child_begin(NodeRef N) { return N->Edges.begin(); }
224 static ChildIteratorType child_end(NodeRef N) { return N->Edges.end(); }
230 static NodeRef getEntryNode(ProfiledCallGraph *PCG) {
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGraphWriter.h72 using NodeRef = typename GTraits::NodeRef; variable
77 static_assert(std::is_pointer_v<NodeRef>,
84 bool getEdgeSourceLabels(raw_ostream &O, NodeRef Node) { in getEdgeSourceLabels()
173 bool isNodeHidden(NodeRef Node) { return DTraits.isNodeHidden(Node, G); } in isNodeHidden()
175 void writeNode(NodeRef Node) { in writeNode()
290 void writeEdge(NodeRef Node, unsigned edgeidx, child_iterator EI) { in writeEdge()
291 if (NodeRef TargetNode = *EI) { in writeEdge()

123