Lines Matching refs:fSpinLock
71 int numEntries() const SK_EXCLUDES(fSpinLock);
73 size_t approxBytesUsedForHash() const SK_EXCLUDES(fSpinLock);
76 void dropAllRefs() SK_EXCLUDES(fSpinLock);
80 void dropUniqueRefs(GrResourceCache* resourceCache) SK_EXCLUDES(fSpinLock);
83 void dropUniqueRefsOlderThan(GrStdSteadyClock::time_point purgeTime) SK_EXCLUDES(fSpinLock);
85 SkDEBUGCODE(bool has(const GrUniqueKey&) SK_EXCLUDES(fSpinLock);)
87 GrSurfaceProxyView find(const GrUniqueKey&) SK_EXCLUDES(fSpinLock);
89 const GrUniqueKey&) SK_EXCLUDES(fSpinLock);
91 GrSurfaceProxyView add(const GrUniqueKey&, const GrSurfaceProxyView&) SK_EXCLUDES(fSpinLock);
93 const GrUniqueKey&, const GrSurfaceProxyView&) SK_EXCLUDES(fSpinLock);
96 const GrSurfaceProxyView&) SK_EXCLUDES(fSpinLock);
98 const GrUniqueKey&, const GrSurfaceProxyView&) SK_EXCLUDES(fSpinLock);
165 const GrUniqueKey&) SK_EXCLUDES(fSpinLock);
172 IsNewerBetter) SK_EXCLUDES(fSpinLock);
174 void remove(const GrUniqueKey&) SK_EXCLUDES(fSpinLock);
294 void makeExistingEntryMRU(Entry*) SK_REQUIRES(fSpinLock);
295 Entry* makeNewEntryMRU(Entry*) SK_REQUIRES(fSpinLock);
297 Entry* getEntry(const GrUniqueKey&, const GrSurfaceProxyView&) SK_REQUIRES(fSpinLock);
298 Entry* getEntry(const GrUniqueKey&, sk_sp<VertexData>) SK_REQUIRES(fSpinLock);
300 void recycleEntry(Entry*) SK_REQUIRES(fSpinLock);
303 const GrUniqueKey&) SK_REQUIRES(fSpinLock);
306 const GrSurfaceProxyView&) SK_REQUIRES(fSpinLock);
309 const GrUniqueKey&) SK_REQUIRES(fSpinLock);
313 IsNewerBetter) SK_REQUIRES(fSpinLock);
315 mutable SkSpinlock fSpinLock;
317 SkTDynamicHash<Entry, GrUniqueKey> fUniquelyKeyedEntryMap SK_GUARDED_BY(fSpinLock);
319 SkTInternalLList<Entry> fUniquelyKeyedEntryList SK_GUARDED_BY(fSpinLock);
326 Entry* fFreeEntryList SK_GUARDED_BY(fSpinLock);