reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
895 using NodeRef = MachineBasicBlock *;
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/ADT/SCCIterator.h
44 const std::vector<typename GT::NodeRef>, ptrdiff_t> { 45 using NodeRef = typename GT::NodeRef;include/llvm/CodeGen/MachineBasicBlock.h
874 static NodeRef getEntryNode(MachineBasicBlock *BB) { return BB; } 875 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); } 876 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); } 898 static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) { 902 static ChildIteratorType child_begin(NodeRef N) { return N->pred_begin(); } 903 static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }include/llvm/CodeGen/MachineFunction.h
1025 static NodeRef getEntryNode(MachineFunction *F) { return &F->front(); } 1067 static NodeRef getEntryNode(Inverse<MachineFunction *> G) {include/llvm/Support/GenericDomTree.h
221 static_assert(std::is_pointer<typename GraphTraits<NodeT *>::NodeRef>::value, 772 void Split(typename GraphTraits<N>::NodeRef NewBB) { 774 using NodeRef = typename GraphT::NodeRef;