reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
323 using NodeRef = BasicBlock *;
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/IR/CFG.h
302 static NodeRef getEntryNode(BasicBlock *BB) { return BB; } 303 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); } 304 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); } 326 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; } 327 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); } 328 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); } 349 static NodeRef getEntryNode(Function *F) { return &F->getEntryBlock(); } 389 static NodeRef getEntryNode(Inverse<Function *> 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;