Lines Matching defs:resources
637 // up iterating over all the resources that already have timestamps.
742 // We need to make sure to free any resources that were waiting on a free message but never
778 // We need to make sure to free any resources that were waiting on a free message but never
1078 // When the timestamp overflows validate() is called. validate() checks that resources in
1115 // We keep unbudgeted resources with a unique key in the purgeable queue of the cache so
1133 // We should at least free this resource, perhaps dependent resources as well.
1146 // resources are the only resources that can be in that state and they aren't allowed to
1293 // resources in the timestamp-sorted queue will have a frame number >= to this
1315 // Make a list of the scratch resources to delete
1332 // Delete the scratch resources. This must be done as a separate pass
1354 //Make a list of the scratch resources to delete
1432 //Make lists of the need purged resources to delete
1472 //Make a list of the scratch resources to delete
1517 // Success! Release the resources.
1519 std::vector<GrGpuResource*> resources;
1520 resources.reserve(purgeCnt);
1522 resources.push_back(fPurgeableQueue.at(i));
1524 for (GrGpuResource* resource : resources) {
1539 // Make a list of the scratch resources to delete
1552 // Delete the scratch resources. This must be done as a separate pass
1562 // Purge any remaining resources in LRU order
1627 // If we wrap then all the existing resources will appear older than any resources that get
1632 // Reset all the timestamps. We sort the resources by timestamp and then assign
1646 // Pick resources out of the purgeable and non-purgeable arrays based on lowest
1689 SkTDArray<GrGpuResource*> resources;
1691 *resources.append() = fNonpurgeableResources[i];
1694 *resources.append() = fPurgeableQueue.at(i);
1696 for (int i = 0; i < resources.count(); i++) {
1697 auto resource = resources.getAt(i);