Lines Matching defs:Node
14 // * Normal depth-first iteration - visit a node and then all of its children.
20 // * Normal depth-first iteration - visit a node and then all of its children.
67 // node have been processed. It is intended to distinguish of back and
93 // First element is node reference, second is the 'next child' to visit.
102 inline df_iterator(NodeRef Node) {
103 this->Visited.insert(Node);
104 VisitStack.push_back(StackElement(Node, None));
109 inline df_iterator(NodeRef Node, SetType &S)
111 if (this->Visited.insert(Node).second)
112 VisitStack.push_back(StackElement(Node, None));
122 NodeRef Node = VisitStack.back().first;
126 Opt.emplace(GT::child_begin(Node));
131 while (*Opt != GT::child_end(Node)) {
140 this->Visited.completed(Node);
170 // time... so that you can actually call methods ON the Node, because
180 /// \brief Skips all children of the current node and traverses to next node
198 // specified node. This is public, and will probably be used to iterate over
201 bool nodeVisited(NodeRef Node) const {
202 return this->Visited.count(Node) != 0;
205 /// getPathLength - Return the length of the path from the entry node to the
206 /// current node, counting both nodes.
209 /// getPath - Return the n'th node in the path from the entry node to the
210 /// current node.
