41         for (Node* dependedOn : fNodesIDependOn) {  in validate()
42             REPORTER_ASSERT(reporter, dependedOn->indexInSort() < this->indexInSort());  in validate()
67     void addDependency(Node* dependedOn) {  in addDependency()  argument
68         fNodesIDependOn.push_back(dependedOn);  in addDependency()
70         dependedOn->addDependent(this);  in addDependency()
103     void addEdge(Node* dependedOn, Node* dependent) {  in addEdge()  argument
106         SkTDArray<Node*> tmp(&dependedOn, 1);  in addEdge()
125     void addEdges(SkTDArray<Node*>* dependedOn, Node* dependent) {  in addEdges()  argument
129         for (int i = 0; i < dependedOn->count(); ++i) {  in addEdges()
130             if ((*dependedOn)[i]->indexInSort() < dependent->indexInSort()) {  in addEdges()
131                 dependent->addDependency((*dependedOn)[i]);  in addEdges()
132                 dependedOn->removeShuffle(i);  in addEdges()
135                 dependent->addDependency((*dependedOn)[i]);  in addEdges()
139         if (dependedOn->isEmpty()) {  in addEdges()
147         SkTQSort<Node*>(dependedOn->begin(), dependedOn->end() - 1, Node::CompareIndicesGT);  in addEdges()
153         for (int i = 0; i < dependedOn->count(); ++i) {  in addEdges()
154             if ((*dependedOn)[i]->indexInSort() < lowerBound) {  in addEdges()
159                 this->dfs(dependent, (*dependedOn)[i]->indexInSort());  in addEdges()
426         SkTDArray<Node*> dependedOn;  in test_diamond()  local
427         dependedOn.push_back(nodeB);  in test_diamond()
428         dependedOn.push_back(nodeC);  in test_diamond()
430         g.addEdges(&dependedOn, nodeD); // nodes B and C must come before node D  in test_diamond()