120             bool used = std::any_of(fDAG.begin(), fDAG.end(), [&](auto& task) {  in flush()
191         SkDEBUGCODE(SkDebugf("RenderTasks (%d):\n", fDAG.count()));  in flush()
192         for (const auto& task : fDAG) {  in flush()
199                 for (const auto& task : fDAG) {  in flush()
247     SkDebugf("Flushing %d opsTasks\n", fDAG.size());  in executeRenderTasks()
248     for (int i = 0; i < fDAG.size(); ++i) {  in executeRenderTasks()
249         if (fDAG[i]) {  in executeRenderTasks()
251             label.printf("task %d/%d", i, fDAG.size());  in executeRenderTasks()
252             fDAG[i]->dump(label, {}, true, true);  in executeRenderTasks()
259     for (const auto& renderTask : fDAG) {  in executeRenderTasks()
281     for (const auto& renderTask : fDAG) {  in executeRenderTasks()
308     for (const auto& task : fDAG) {  in removeRenderTasks()
318     fDAG.clear();  in removeRenderTasks()
325     for (size_t i = 0, start = 0, end; start < SkToSizeT(fDAG.size()); ++i, start = end + 1) {  in sortTasks()
326         end = i == fReorderBlockerTaskIndices.size() ? fDAG.size() : fReorderBlockerTaskIndices[i];  in sortTasks()
327         SkSpan span(fDAG.begin() + start, end - start);  in sortTasks()
332         SkASSERT(span.end() == fDAG.end() || fDAG[end]->blocksReordering());  in sortTasks()
393     for (size_t i = 0, start = 0, end; start < SkToSizeT(fDAG.size()); ++i, start = end + 1) {  in reorderTasks()
394         end = i == fReorderBlockerTaskIndices.size() ? fDAG.size() : fReorderBlockerTaskIndices[i];  in reorderTasks()
395         SkSpan span(fDAG.begin() + start, end - start);  in reorderTasks()
406             SkASSERT(fDAG[fReorderBlockerTaskIndices[i]]->blocksReordering());  in reorderTasks()
407             subllist.addToTail(fDAG[fReorderBlockerTaskIndices[i]].get());  in reorderTasks()
427     reorder_array_by_llist(llist, &fDAG);  in reorderTasks()
430     for (int i = 0; i < fDAG.size(); i++) {  in reorderTasks()
431         sk_sp<GrRenderTask>& task = fDAG[i];  in reorderTasks()
433             size_t remaining = fDAG.size() - i - 1;  in reorderTasks()
434             SkSpan<sk_sp<GrRenderTask>> nextTasks{fDAG.end() - remaining, remaining};  in reorderTasks()
441         fDAG[newCount++] = std::move(task);  in reorderTasks()
443     fDAG.resize_back(newCount);  in reorderTasks()
448     for (auto& task : fDAG) {  in closeAllTasks()
459     if (fDAG.empty()) {  in insertTaskBeforeLast()
460         return fDAG.push_back(std::move(task)).get();  in insertTaskBeforeLast()
462     if (!fReorderBlockerTaskIndices.empty() && fReorderBlockerTaskIndices.back() == fDAG.size()) {  in insertTaskBeforeLast()
465     fDAG.push_back(std::move(task));  in insertTaskBeforeLast()
466     auto& penultimate = fDAG.fromBack(1);  in insertTaskBeforeLast()
467     fDAG.back().swap(penultimate);  in insertTaskBeforeLast()
476         fReorderBlockerTaskIndices.push_back(fDAG.size());  in appendTask()
478     return fDAG.push_back(std::move(task)).get();  in appendTask()
595     fDAG.swap(ddl->fRenderTasks);  in moveRenderTasksToDDL()
596     SkASSERT(fDAG.empty());  in moveRenderTasksToDDL()
653         SkASSERT(!fDAG.empty());  in validate()
655         SkASSERT(fActiveOpsTask == fDAG.back().get());  in validate()
658     for (int i = 0; i < fDAG.size(); ++i) {  in validate()
659         if (fActiveOpsTask != fDAG[i].get()) {  in validate()
663                 fActiveOpsTask && fActiveOpsTask->fTextureResolveTask == fDAG[i].get();  in validate()
664             bool isAtlas = fDAG[i]->isSetFlag(GrRenderTask::kAtlas_Flag);  in validate()
665             SkASSERT(isActiveResolveTask || isAtlas || fDAG[i]->isClosed());  in validate()
670     if (!fDAG.empty()) {  in validate()
671         if (fDAG.back()->isSetFlag(GrRenderTask::kAtlas_Flag)) {  in validate()
673             SkASSERT(!fDAG.back()->isClosed());  in validate()
674         } else if (fDAG.back()->isClosed()) {  in validate()
677             SkASSERT(fActiveOpsTask == fDAG.back().get());  in validate()