15 class Node : public SkRefCnt {  class
26             for (Node* tmp : fNodesIDependOn) {  in print()
32             for (Node* tmp : fNodesThatDependOnMe) {  in print()
41         for (Node* dependedOn : fNodesIDependOn) {  in validate()
44         for (Node* dependent : fNodesThatDependOnMe) {  in validate()
50     static bool CompareIndicesGT(Node* const& a, Node* const& b) {  in CompareIndicesGT()
55     Node* dependent(int index) const {  in dependent()
63     explicit Node(char id) : fID(id), fIndexInSort(-1), fVisited(false) {}  in Node()  function in Node
67     void addDependency(Node* dependedOn) {  in addDependency()
72     void addDependent(Node* dependent) {  in addDependent()
77     SkTDArray<Node*> fNodesIDependOn;      // These nodes must appear before this one in the sort
78     SkTDArray<Node*> fNodesThatDependOnMe; // These ones must appear after this one
92     Node* addNode(uint32_t id) {  in addNode()
94         sk_sp<Node> tmp(new Node(id));  in addNode()
103     void addEdge(Node* dependedOn, Node* dependent) {  in addEdge()
106         SkTDArray<Node*> tmp(&dependedOn, 1);  in addEdge()
125     void addEdges(SkTDArray<Node*>* dependedOn, Node* dependent) {  in addEdges()
147         SkTQSort<Node*>(dependedOn->begin(), dependedOn->end() - 1, Node::CompareIndicesGT);  in addEdges()
226     void dfs(Node* node, int upperBound) {  in dfs()
230             Node* dependent = node->dependent(i);  in dfs()
244     void moveNodeInSort(sk_sp<Node> node, int index) {  in moveNodeInSort()
253     bool stackContains(Node* node) {  in stackContains()
270             sk_sp<Node> node = fNodes[index];  in shift()
306     SkTArray<sk_sp<Node>> fNodes;
309         sk_sp<Node> fNode;  // This gets a ref bc, in 'shift' it will be pulled out of 'fNodes'
310         Node*       fDest;
322     Node* nodeQ = g.addNode('q');  in test_1()
323     Node* nodeY = g.addNode('y');  in test_1()
324     Node* nodeA = g.addNode('a');  in test_1()
325     Node* nodeZ = g.addNode('z');  in test_1()
326     Node* nodeB = g.addNode('b');  in test_1()
328     Node* nodeW = g.addNode('w');  in test_1()
329     Node* nodeD = g.addNode('d');  in test_1()
330     Node* nodeX = g.addNode('x');  in test_1()
331     Node* nodeR = g.addNode('r');  in test_1()
362     Node* nodeY = g.addNode('y');  in test_2()
364     Node* nodeW = g.addNode('w');  in test_2()
366     Node* nodeZ = g.addNode('z');  in test_2()
367     Node* nodeU = g.addNode('u');  in test_2()
369     Node* nodeX = g.addNode('x');  in test_2()
371     Node* nodeV = g.addNode('v');  in test_2()
421     Node* nodeD = g.addNode('d');  in test_diamond()
422     Node* nodeC = g.addNode('c');  in test_diamond()
423     Node* nodeB = g.addNode('b');  in test_diamond()
426         SkTDArray<Node*> dependedOn;  in test_diamond()
433     Node* nodeA = g.addNode('a');  in test_diamond()
463     Node* nodeG = g.addNode('g');  in test_lopsided_binary_tree()
464     Node* nodeF = g.addNode('f');  in test_lopsided_binary_tree()
465     Node* nodeE = g.addNode('e');  in test_lopsided_binary_tree()
466     Node* nodeD = g.addNode('d');  in test_lopsided_binary_tree()
467     Node* nodeC = g.addNode('c');  in test_lopsided_binary_tree()
468     Node* nodeB = g.addNode('b');  in test_lopsided_binary_tree()
469     Node* nodeA = g.addNode('a');  in test_lopsided_binary_tree()