Lines Matching defs:Node
15 /// The SCC iterator has the important property that if a node in SCC S1 has an
16 /// edge to a node in SCC S2, then it visits S1 *after* S2.
53 NodeRef Node; ///< The current node pointer.
55 unsigned MinVisited; ///< Minimum uplink value of all children of Node.
57 StackElement(NodeRef Node, const ChildItTy &Child, unsigned Min)
58 : Node(Node), NextChild(Child), MinVisited(Min) {}
61 return Node == Other.Node &&
70 /// nodeVisitNumbers are per-node visit numbers, also used as DFS flags.
81 /// node, the next child to visit, and the minimum uplink value of all child
130 /// If the SCC has more than one node, this is trivially true. If not, it may
131 /// still contain a loop if the node has an edge back to itself.
134 /// This informs the \c scc_iterator that the specified \c Old node
150 dbgs() << "TarjanSCC: Node " << N <<
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
164 // this node has never been seen.
181 NodeRef visitingN = VisitStack.back().Node;
186 // Propagate MinVisitNum to parent so we can detect the SCC starting node.
191 dbgs() << "TarjanSCC: Popped node " << visitingN <<
192 " : minVisitNum = " << minVisitNum << "; Node visit num = " <<
