reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
35 struct GraphTraits {
include/llvm/IR/Type.h 31 template<class GraphType> struct GraphTraits;
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; 90 using ChildItTy = typename GT::ChildIteratorType; 125 Opt.emplace(GT::child_begin(Node)); 130 while (*Opt != GT::child_end(Node)) { 151 return df_iterator(GT::getEntryNode(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; 100 using ChildItTy = typename GT::ChildIteratorType; 108 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); 127 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { 131 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); 141 return po_iterator(GT::getEntryNode(G)); 288 using NodeRef = typename GT::NodeRef;include/llvm/Analysis/RegionInfo.h
644 GraphTraits<RegionNodeT *>>;
include/llvm/Analysis/RegionIterator.h320 : public GraphTraits<FlatIt<RegionNode*>> { 322 df_iterator<NodeRef, df_iterator_default_set<NodeRef>, false, 322 df_iterator<NodeRef, df_iterator_default_set<NodeRef>, false, 323 GraphTraits<FlatIt<NodeRef>>>; 323 GraphTraits<FlatIt<NodeRef>>>; 325 static NodeRef getEntryNode(RegionInfo *RI) { 341 df_iterator<NodeRef, df_iterator_default_set<NodeRef>, false, 341 df_iterator<NodeRef, df_iterator_default_set<NodeRef>, false, 342 GraphTraits<FlatIt<NodeRef>>>; 342 GraphTraits<FlatIt<NodeRef>>>; 344 static NodeRef getEntryNode(RegionInfoPass *RI) {include/llvm/Support/GraphWriter.h
72 using NodeRef = typename GTraits::NodeRef; 74 using child_iterator = typename GTraits::ChildIteratorType; 85 child_iterator EI = GTraits::child_begin(Node); 86 child_iterator EE = GTraits::child_end(Node); 228 child_iterator EI = GTraits::child_begin(Node); 229 child_iterator EE = GTraits::child_end(Node); 246 (unsigned)std::distance(GTraits::child_begin(TargetNode), TargetIt);lib/Analysis/RegionPrinter.cpp
74 GraphTraits<RegionInfo *>::ChildIteratorType CI,
tools/polly/lib/Analysis/ScopGraphPrinter.cpp38 static NodeRef getEntryNode(ScopDetection *SD) { 52 static NodeRef getEntryNode(ScopDetectionWrapperPass *P) { 92 GraphTraits<RegionInfo *>::ChildIteratorType CI,