Searched refs:fDependencies (Results 1 – 7 of 7) sorted by relevance
109 fDependencies.push_back(dependedOn); in addDependency()117 for (GrRenderTask* task : otherTask->fDependencies) { in addDependenciesFromOtherTask()224 for (auto& target : fDependencies) { in replaceDependency()237 replaceWith->fDependencies.push_back(this); in replaceDependent()244 for (int i = 0; i < fDependencies.count(); ++i) { in dependsOn()245 if (fDependencies[i] == dependedOn) { in dependsOn()272 for (int i = 0; i < fDependencies.count(); ++i) { in validate()273 SkASSERT(fDependencies[i]->isDependent(this)); in validate()332 SkDebugf("%sI rely On (%d): ", indent.c_str(), fDependencies.count()); in dump()333 for (int i = 0; i < fDependencies.count(); ++i) { in dump()[all …]
81 SkSpan<GrRenderTask*> dependencies() { return SkMakeSpan(fDependencies); } in dependencies()250 return renderTask->fDependencies.count(); in NumDependencies()253 return renderTask->fDependencies[index]; in Dependency()266 SkSTArray<1, GrRenderTask*, true> fDependencies; variable
97 fDependencies.push_back(dependedOn); in addDependency()130 for (int i = 0; i < fDependencies.count(); ++i) { in dependsOn()131 if (fDependencies[i] == dependedOn) { in dependsOn()158 for (int i = 0; i < fDependencies.count(); ++i) { in validate()159 SkASSERT(fDependencies[i]->isDependedent(this)); in validate()218 SkDebugf("I rely On (%d): ", fDependencies.count()); in dump()219 for (int i = 0; i < fDependencies.count(); ++i) { in dump()220 SkDebugf("%d, ", fDependencies[i]->fUniqueID); in dump()
154 *fDependencies.append() = src; in dependsOn()168 for (int i = 0; i < fDependencies.count(); ++i) { in check()169 if (-1 == fDependencies[i]->outputPos()) { in check()173 if (fOutputPos < fDependencies[i]->outputPos()) { in check()190 static int NumDependencies(TopoTestNode* node) { return node->fDependencies.count(); } in NumDependencies()192 return node->fDependencies[index]; in Dependency()227 SkTDArray<TopoTestNode*> fDependencies; variable
159 void dependsOn(TopoTestNode* src) { *fDependencies.append() = src; } in dependsOn()180 for (int i = 0; i < fDependencies.count(); ++i) { in check()181 if (!fDependencies[i]->fWasOutput) { in check()185 if (fOutputPos < fDependencies[i]->outputPos()) { in check()204 static int NumDependencies(TopoTestNode* node) { return node->fDependencies.count(); } in NumDependencies()206 return node->fDependencies[index]; in Dependency()247 SkTDArray<TopoTestNode*> fDependencies; variable
165 return opList->fDependencies.count(); in NumDependencies()168 return opList->fDependencies[index]; in Dependency()179 SkSTArray<1, GrOpList*, true> fDependencies; variable
21 void addDependency(GrRenderTask* dep) { fDependencies.push_back(dep); } in addDependency()