45     idArray->reset(fOpLists.count());  in gatherIDs()
46     for (int i = 0; i < fOpLists.count(); ++i) {  in gatherIDs()
47         if (fOpLists[i]) {  in gatherIDs()
48             (*idArray)[i] = fOpLists[i]->uniqueID();  in gatherIDs()
54     fOpLists.reset();  in reset()
58     if (!fOpLists[index]->unique()) {  in removeOpList()
60         fOpLists[index]->endFlush();  in removeOpList()
63     fOpLists[index] = nullptr;  in removeOpList()
68         if (!fOpLists[i]) {  in removeOpLists()
76     fOpLists.emplace_back(std::move(opList));  in add()
80     fOpLists.push_back_n(opLists.count(), opLists.begin());  in add()
85     opLists->swap(fOpLists);  in swap()
90         SkDEBUGCODE(bool result =) SkTTopoSort<GrOpList, GrOpList::TopoSortTraits>(&fOpLists);  in prepForFlush()
97     if (fOpLists.count()) {  in prepForFlush()
98         GrRenderTargetOpList* prevOpList = fOpLists[0]->asRenderTargetOpList();  in prepForFlush()
99         for (int i = 1; i < fOpLists.count(); ++i) {  in prepForFlush()
100             GrRenderTargetOpList* curOpList = fOpLists[i]->asRenderTargetOpList();  in prepForFlush()
113     for (int i = 0; i < fOpLists.count(); ++i) {  in closeAll()
114         if (fOpLists[i]) {  in closeAll()
115             fOpLists[i]->makeClosed(*caps);  in closeAll()
121     for (int i = 0; i < fOpLists.count(); ++i) {  in cleanup()
122         if (!fOpLists[i]) {  in cleanup()
127         fOpLists[i]->makeClosed(*caps);  in cleanup()
132         if (!fOpLists[i]->unique()) {  in cleanup()
135             fOpLists[i]->endFlush();  in cleanup()
139     fOpLists.reset();  in cleanup()
291     for (int i = 0; i < fOpLists.count(); ++i) {  in flush()
292         SkDEBUGCODE(fOpLists[i]->dump();)  in flush()
546     fDAG.swap(&ddl->fOpLists);  in moveOpListsToDDL()
580     fDAG.add(ddl->fOpLists);  in copyOpListsFromDDL()