64   template <typename NodeRef>
65   bool insertEdge(Optional<NodeRef> From, NodeRef To) {  in insertEdge()
70   template <typename NodeRef> void finishPostorder(NodeRef BB) {}  in finishPostorder()
85   template <class NodeRef> bool insertEdge(Optional<NodeRef> From, NodeRef To) {  in insertEdge()
90   template <class NodeRef> void finishPostorder(NodeRef BB) {}  in finishPostorder()
94           class SetType = SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
99   using value_type = typename GT::NodeRef;
105   using NodeRef = typename GT::NodeRef;
110   SmallVector<std::pair<NodeRef, ChildItTy>, 8> VisitStack;
112   po_iterator(NodeRef BB) {  in po_iterator()
113     this->insertEdge(Optional<NodeRef>(), BB);  in po_iterator()
120   po_iterator(NodeRef BB, SetType &S)  in po_iterator()
122     if (this->insertEdge(Optional<NodeRef>(), BB)) {  in po_iterator()
134       NodeRef BB = *VisitStack.back().second++;  in traverseChild()
135       if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {  in traverseChild()
159   const NodeRef &operator*() const { return VisitStack.back().first; }
165   NodeRef operator->() const { return **this; }
194 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>>
216 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>,
239 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>>
292   using NodeRef = typename GT::NodeRef;  variable
294   std::vector<NodeRef> Blocks; // Block list in normal PO order
301   using rpo_iterator = typename std::vector<NodeRef>::reverse_iterator;
302   using const_rpo_iterator = typename std::vector<NodeRef>::const_reverse_iterator;