Searched refs:CacheEntry (Results 1 – 5 of 5) sorted by relevance
50 class BitmapCache::CacheEntry class in sd::slidesorter::cache::BitmapCache54 CacheEntry(sal_Int32 nLastAccessTime, bool bIsPrecious);55 ~CacheEntry (void) {}; in ~CacheEntry()56 inline void Recycle (const CacheEntry& rEntry);94 class CacheEntry;113 ::sd::slidesorter::cache::BitmapCache::CacheEntry>552 BitmapCache::CacheEntry::CacheEntry( in CacheEntry() function in sd::slidesorter::cache::BitmapCache::CacheEntry566 BitmapCache::CacheEntry::CacheEntry( in CacheEntry() function in sd::slidesorter::cache::BitmapCache::CacheEntry581 inline void BitmapCache::CacheEntry::Recycle (const CacheEntry& rEntry) in Recycle()643 inline void BitmapCache::CacheEntry::Decompress (void) in Decompress()[all …]
62 class CacheEntry;224 void UpdateCacheSize (const CacheEntry& rKey, CacheOperation eOperation);
41 struct CacheEntry struct in LRU_Cache45 CacheEntry * pPred; argument46 CacheEntry * pSucc; argument48 typedef ::std::hash_map< t_Key, CacheEntry *, t_KeyHash, t_KeyEqual > t_Key2Element;54 CacheEntry * _pBlock;55 mutable CacheEntry * _pHead;56 mutable CacheEntry * _pTail;57 inline void toFront( CacheEntry * pEntry ) const;106 _pBlock = new CacheEntry[_nCachedElements]; in LRU_Cache()160 CacheEntry * pEntry = (*iFind).second; in getValue()[all …]
42 struct CacheEntry struct in LRU_Cache46 CacheEntry * pPred; argument47 CacheEntry * pSucc; argument55 CacheEntry * _pBlock;56 mutable CacheEntry * _pHead;57 mutable CacheEntry * _pTail;58 inline void toFront( CacheEntry * pEntry ) const;107 _pBlock = new CacheEntry[_nCachedElements]; in LRU_Cache()126 CacheEntry * pEntry ) const in toFront()164 CacheEntry * pEntry = (*iFind).second; in getValue()[all …]
59 struct CacheEntry struct in ImplPageCache65 std::vector< CacheEntry > maPages;
Completed in 48 milliseconds