Lines Matching refs:nodes
55 std::deque<Node*> nodes(1, initial_node);
57 // RecomputeNodeDirty might return new validation nodes that need to be
58 // checked for dirty state, keep a queue of nodes to visit.
59 while (!nodes.empty()) {
60 Node* node = nodes.front();
61 nodes.pop_front();
68 nodes.insert(nodes.end(), new_validation_nodes.begin(),
159 // Store any validation nodes from the edge for adding to the initial
160 // nodes. Don't recurse into them, that would trigger the dependency
162 // RecomputeDirty will add the validation nodes to the initial nodes
435 // The lookups_ vector is used as a stack of visited nodes/variables
754 Node* node = deps->nodes[i];