Searched refs:LookupEntry (Results 1 – 4 of 4) sorted by relevance
220 struct LookupEntry { struct221 LookupEntry(const SkBitmap& bm) in LookupEntry() argument235 LookupEntry* fMoreRecentlyUsed; argument236 LookupEntry* fLessRecentlyUsed; argument243 static int Compare(const LookupEntry* a, const LookupEntry* b);253 int removeEntryFromLookupTable(LookupEntry*);263 int findInLookupTable(const LookupEntry& key, SkBitmapHeapEntry** entry);265 LookupEntry* findEntryToReplace(const SkBitmap& replacement);274 void removeFromLRU(LookupEntry* entry);282 void appendToLRU(LookupEntry*);[all …]
41 int SkBitmapHeap::LookupEntry::Compare(const SkBitmapHeap::LookupEntry *a, in Compare()42 const SkBitmapHeap::LookupEntry *b) { in Compare()123 void SkBitmapHeap::removeFromLRU(SkBitmapHeap::LookupEntry* entry) { in removeFromLRU()151 void SkBitmapHeap::appendToLRU(SkBitmapHeap::LookupEntry* entry) { in appendToLRU()164 SkBitmapHeap::LookupEntry* SkBitmapHeap::findEntryToReplace(const SkBitmap& replacement) { in findEntryToReplace()168 SkBitmapHeap::LookupEntry* iter = fLeastRecentlyUsed; in findEntryToReplace()193 LookupEntry* iter = fLeastRecentlyUsed; in freeMemoryIfPossible()202 LookupEntry* next = iter->fMoreRecentlyUsed; in freeMemoryIfPossible()233 int SkBitmapHeap::findInLookupTable(const LookupEntry& indexEntry, SkBitmapHeapEntry** entry) { in findInLookupTable()234 int index = SkTSearch<const LookupEntry>((const LookupEntry**)fLookupTable.begin(), 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
77 Entry LookupEntry(const string &type) const { in LookupEntry() function88 Entry entry = LookupEntry(type); in GetEntry()106 return LookupEntry(type); in GetEntry()