181   uint32_t hash;  member
247   static size_t hash(const CacheKey& a) {  in hash()  function
272   Status Insert(const Slice& key, uint32_t hash, void* value, size_t charge,
275   Cache::Handle* Lookup(const Slice& key, uint32_t hash) override;
282   void Erase(const Slice& key, uint32_t hash) override;
283   bool EraseAndConfirm(const Slice& key, uint32_t hash,
342   CacheHandle* Insert(const Slice& key, uint32_t hash, void* value,
514         table_.erase(CacheKey(handle->key, handle->hash));  in TryEvict()
564 CacheHandle* ClockCacheShard::Insert(const Slice& key, uint32_t hash,  in Insert()  argument
592   handle->hash = hash;  in Insert()
599   if (table_.find(accessor, CacheKey(key, hash))) {  in Insert()
604   table_.insert(HashTable::value_type(CacheKey(key, hash), handle));  in Insert()
612 Status ClockCacheShard::Insert(const Slice& key, uint32_t hash, void* value,  in Insert()  argument
621   CacheHandle* handle = Insert(key_copy, hash, value, charge, deleter,  in Insert()
635 Cache::Handle* ClockCacheShard::Lookup(const Slice& key, uint32_t hash) {  in Lookup()  argument
637   if (!table_.find(accessor, CacheKey(key, hash))) {  in Lookup()
650   if (hash != handle->hash || key != handle->key) {  in Lookup()
665     erased = EraseAndConfirm(handle->key, handle->hash, &context);  in Release()
671 void ClockCacheShard::Erase(const Slice& key, uint32_t hash) {  in Erase()  argument
673   EraseAndConfirm(key, hash, &context);  in Erase()
677 bool ClockCacheShard::EraseAndConfirm(const Slice& key, uint32_t hash,  in EraseAndConfirm()  argument
682   if (table_.find(accessor, CacheKey(key, hash))) {  in EraseAndConfirm()
737     return reinterpret_cast<const CacheHandle*>(handle)->hash;  in GetHash()