50     idArray->reset(fOpLists.count());  in gatherIDs()
51     for (int i = 0; i < fOpLists.count(); ++i) {  in gatherIDs()
52         if (fOpLists[i]) {  in gatherIDs()
53             (*idArray)[i] = fOpLists[i]->uniqueID();  in gatherIDs()
59     fOpLists.reset();  in reset()
63     if (!fOpLists[index]->unique()) {  in removeOpList()
65         fOpLists[index]->endFlush();  in removeOpList()
68     fOpLists[index] = nullptr;  in removeOpList()
73         if (!fOpLists[i]) {  in removeOpLists()
81     fOpLists.emplace_back(std::move(opList));  in add()
85     fOpLists.push_back_n(opLists.count(), opLists.begin());  in add()
90     opLists->swap(fOpLists);  in swap()
95         SkDEBUGCODE(bool result =) SkTTopoSort<GrOpList, GrOpList::TopoSortTraits>(&fOpLists);  in prepForFlush()
102     if (fOpLists.count()) {  in prepForFlush()
103         GrRenderTargetOpList* prevOpList = fOpLists[0]->asRenderTargetOpList();  in prepForFlush()
104         for (int i = 1; i < fOpLists.count(); ++i) {  in prepForFlush()
105             GrRenderTargetOpList* curOpList = fOpLists[i]->asRenderTargetOpList();  in prepForFlush()
118     for (int i = 0; i < fOpLists.count(); ++i) {  in closeAll()
119         if (fOpLists[i]) {  in closeAll()
120             fOpLists[i]->makeClosed(*caps);  in closeAll()
126     for (int i = 0; i < fOpLists.count(); ++i) {  in cleanup()
127         if (!fOpLists[i]) {  in cleanup()
132         fOpLists[i]->makeClosed(*caps);  in cleanup()
137         if (!fOpLists[i]->unique()) {  in cleanup()
140             fOpLists[i]->endFlush();  in cleanup()
144     fOpLists.reset();  in cleanup()
277     for (int i = 0; i < fOpLists.count(); ++i) {  in flush()
278         SkDEBUGCODE(fOpLists[i]->dump();)  in flush()
498     fDAG.swap(&ddl->fOpLists);  in moveOpListsToDDL()
532     fDAG.add(ddl->fOpLists);  in copyOpListsFromDDL()