Lines Matching refs:fSpinLock
72 int numEntries() const SK_EXCLUDES(fSpinLock);
74 size_t approxBytesUsedForHash() const SK_EXCLUDES(fSpinLock);
77 void dropAllRefs() SK_EXCLUDES(fSpinLock);
81 void dropUniqueRefs(GrResourceCache* resourceCache) SK_EXCLUDES(fSpinLock);
84 void dropUniqueRefsOlderThan(GrStdSteadyClock::time_point purgeTime) SK_EXCLUDES(fSpinLock);
86 SkDEBUGCODE(bool has(const GrUniqueKey&) SK_EXCLUDES(fSpinLock);)
88 GrSurfaceProxyView find(const GrUniqueKey&) SK_EXCLUDES(fSpinLock);
90 const GrUniqueKey&) SK_EXCLUDES(fSpinLock);
92 GrSurfaceProxyView add(const GrUniqueKey&, const GrSurfaceProxyView&) SK_EXCLUDES(fSpinLock);
94 const GrUniqueKey&, const GrSurfaceProxyView&) SK_EXCLUDES(fSpinLock);
97 const GrSurfaceProxyView&) SK_EXCLUDES(fSpinLock);
99 const GrUniqueKey&, const GrSurfaceProxyView&) SK_EXCLUDES(fSpinLock);
166 const GrUniqueKey&) SK_EXCLUDES(fSpinLock);
173 IsNewerBetter) SK_EXCLUDES(fSpinLock);
175 void remove(const GrUniqueKey&) SK_EXCLUDES(fSpinLock);
295 void makeExistingEntryMRU(Entry*) SK_REQUIRES(fSpinLock);
296 Entry* makeNewEntryMRU(Entry*) SK_REQUIRES(fSpinLock);
298 Entry* getEntry(const GrUniqueKey&, const GrSurfaceProxyView&) SK_REQUIRES(fSpinLock);
299 Entry* getEntry(const GrUniqueKey&, sk_sp<VertexData>) SK_REQUIRES(fSpinLock);
301 void recycleEntry(Entry*) SK_REQUIRES(fSpinLock);
304 const GrUniqueKey&) SK_REQUIRES(fSpinLock);
307 const GrSurfaceProxyView&) SK_REQUIRES(fSpinLock);
310 const GrUniqueKey&) SK_REQUIRES(fSpinLock);
314 IsNewerBetter) SK_REQUIRES(fSpinLock);
316 mutable SkSpinlock fSpinLock; variable
318 SkTDynamicHash<Entry, GrUniqueKey> fUniquelyKeyedEntryMap SK_GUARDED_BY(fSpinLock);
320 SkTInternalLList<Entry> fUniquelyKeyedEntryList SK_GUARDED_BY(fSpinLock);
327 Entry* fFreeEntryList SK_GUARDED_BY(fSpinLock);