Lines Matching full:resource

35 class Resource;  variable
56     void insertResource(Resource*);
58     // Find a resource that matches a key.
59     Resource* findAndRefResource(const GraphiteResourceKey& key, skgpu::Budgeted);
62     // Resource should clean itself up if it is the last ref.
63     bool returnResource(Resource*, LastRemovedRef);
99     Resource* topOfPurgeableQueue();
101     bool testingInPurgeableQueue(Resource* resource) { return this->inPurgeableQueue(resource); }  in testingInPurgeableQueue()  argument
113     void refAndMakeResourceMRU(Resource*);
114     void addToNonpurgeableArray(Resource* resource);
115     void removeFromNonpurgeableArray(Resource* resource);
116     void removeFromPurgeableQueue(Resource* resource);
120     void returnResourceToCache(Resource*, LastRemovedRef);
123     void setResourceTimestamp(Resource*, uint32_t timestamp);
125     bool inPurgeableQueue(Resource*) const;
129     void purgeResource(Resource*);
134     bool isInCache(const Resource* r) const;
141         static const GraphiteResourceKey& GetKey(const Resource& r);
144         static void OnFree(Resource*) {}  in OnFree()
146     typedef SkTMultiMap<Resource, GraphiteResourceKey, MapTraits> ResourceMap;
148     static bool CompareTimestamp(Resource* const& a, Resource* const& b);
149     static int* AccessResourceIndex(Resource* const& res);
151     using PurgeableQueue = SkTDPQueue<Resource*, CompareTimestamp, AccessResourceIndex>;
152     using ResourceArray = SkTDArray<Resource*>;
154     // Whenever a resource is added to the cache or the result of a cache lookup, fTimestamp is
155     // assigned as the resource's timestamp and then incremented. fPurgeableQueue orders the
182     using ReturnQueue = std::vector<std::pair<Resource*, LastRemovedRef>>;