Searched refs:LookupEntry (Results 1 – 3 of 3) sorted by relevance
211 struct LookupEntry { struct212 LookupEntry(const SkBitmap& bm) in LookupEntry() argument226 LookupEntry* fMoreRecentlyUsed; argument227 LookupEntry* fLessRecentlyUsed; argument234 static bool Less(const LookupEntry& a, const LookupEntry& b);244 int removeEntryFromLookupTable(LookupEntry*);254 int findInLookupTable(const LookupEntry& key, SkBitmapHeapEntry** entry);256 LookupEntry* findEntryToReplace(const SkBitmap& replacement);265 void removeFromLRU(LookupEntry* entry);273 void appendToLRU(LookupEntry*);[all …]
47 bool SkBitmapHeap::LookupEntry::Less(const SkBitmapHeap::LookupEntry& a, in Less()48 const SkBitmapHeap::LookupEntry& b) { in Less()114 void SkBitmapHeap::removeFromLRU(SkBitmapHeap::LookupEntry* entry) { in removeFromLRU()142 void SkBitmapHeap::appendToLRU(SkBitmapHeap::LookupEntry* entry) { in appendToLRU()155 SkBitmapHeap::LookupEntry* SkBitmapHeap::findEntryToReplace(const SkBitmap& replacement) { in findEntryToReplace()159 SkBitmapHeap::LookupEntry* iter = fLeastRecentlyUsed; in findEntryToReplace()184 LookupEntry* iter = fLeastRecentlyUsed; in freeMemoryIfPossible()193 LookupEntry* next = iter->fMoreRecentlyUsed; in freeMemoryIfPossible()224 int SkBitmapHeap::findInLookupTable(const LookupEntry& indexEntry, SkBitmapHeapEntry** entry) { in findInLookupTable()225 int index = SkTSearch<const LookupEntry, LookupEntry::Less>( in findInLookupTable()[all …]
61 const EntryType *entry = LookupEntry(key); in GetEntry()86 const EntryType *entry = this->LookupEntry(key); in LoadEntryFromSharedObject()98 virtual const EntryType *LookupEntry( in LookupEntry() function