Lines Matching refs:dependent
44 for (Node* dependent : fNodesThatDependOnMe) {
45 REPORTER_ASSERT(reporter, this->indexInSort() < dependent->indexInSort());
55 Node* dependent(int index) const {
72 void addDependent(Node* dependent) {
73 fNodesThatDependOnMe.push_back(dependent);
102 // 'dependedOn' must appear before 'dependent' in the sort
103 void addEdge(Node* dependedOn, Node* dependent) {
107 this->addEdges(&tmp, dependent);
110 // All the nodes in 'dependedOn' must appear before 'dependent' in the sort.
125 void addEdges(SkTDArray<Node*>* dependedOn, Node* dependent) {
130 if ((*dependedOn)[i]->indexInSort() < dependent->indexInSort()) {
131 dependent->addDependency((*dependedOn)[i]);
135 dependent->addDependency((*dependedOn)[i]);
150 // use case (i.e., the same dependent for all the new edges).
158 if (!dependent->visited()) {
159 this->dfs(dependent, (*dependedOn)[i]->indexInSort());
162 lowerBound = std::min(dependent->indexInSort(), lowerBound);
230 Node* dependent = node->dependent(i);
232 SkASSERT(dependent->indexInSort() != upperBound); // this would be a cycle
234 if (!dependent->visited() && dependent->indexInSort() < upperBound) {
235 this->dfs(dependent, upperBound);