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