Lines Matching defs:node
33 // Recursively visit a node and all the other nodes it depends on.
36 bool GrTTopoSort_Visit(T* node, uint32_t* counter) {
37 if (Traits::IsTempMarked(node)) {
44 // If the node under consideration has been already been output it means it
46 if (!Traits::WasOutput(node)) {
47 // This node hasn't been output yet. Recursively assess all the
49 Traits::SetTempMark(node);
50 for (int i = 0; i < Traits::NumDependencies(node); ++i) {
51 if (!GrTTopoSort_Visit<T, Traits>(Traits::Dependency(node, i), counter)) {
55 Traits::Output(node, *counter); // mark this node as output
57 Traits::ResetTempMark(node);
63 // Topologically sort the nodes in 'graph'. For this sort, when node 'i' depends
64 // on node 'j' it means node 'j' must appear in the result before node 'i'.
81 // TODO: potentially add a version that takes a seed node and just outputs that
82 // node and all the nodes on which it depends. This could be used to partially
96 // This node was depended on by some earlier node and has already
101 // Output this node after all the nodes it depends on have been output.