reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
1372 using NodeRef = VPBlockBase *;
86 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>, 88 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>; 89 using NodeRef = typename GT::NodeRef;include/llvm/ADT/GraphTraits.h
121 children(const typename GraphTraits<GraphType>::NodeRef &G) { 128 inverse_children(const typename GraphTraits<GraphType>::NodeRef &G) {include/llvm/ADT/PostOrderIterator.h
96 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>, 98 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>; 99 using NodeRef = typename GT::NodeRef; 288 using NodeRef = typename GT::NodeRef;include/llvm/Support/GenericDomTree.h
221 static_assert(std::is_pointer<typename GraphTraits<NodeT *>::NodeRef>::value,
lib/Transforms/Vectorize/VPlan.h1343 static NodeRef getEntryNode(NodeRef N) { return N; } 1343 static NodeRef getEntryNode(NodeRef N) { return N; } 1345 static inline ChildIteratorType child_begin(NodeRef N) { 1349 static inline ChildIteratorType child_end(NodeRef N) { 1375 static NodeRef getEntryNode(Inverse<NodeRef> B) { return B.Graph; } 1375 static NodeRef getEntryNode(Inverse<NodeRef> B) { return B.Graph; } 1377 static inline ChildIteratorType child_begin(NodeRef N) { 1381 static inline ChildIteratorType child_end(NodeRef N) { 1396 using nodes_iterator = df_iterator<NodeRef>; 1398 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); } 1434 using nodes_iterator = df_iterator<NodeRef>; 1436 static NodeRef getEntryNode(Inverse<GraphRef> N) {