34 LRUHandle* LRUHandleTable::Lookup(const Slice& key, uint32_t hash) {  in Lookup()  argument
35   return *FindPointer(key, hash);  in Lookup()
39   LRUHandle** ptr = FindPointer(h->key(), h->hash);  in Insert()
54 LRUHandle* LRUHandleTable::Remove(const Slice& key, uint32_t hash) {  in Remove()  argument
55   LRUHandle** ptr = FindPointer(key, hash);  in Remove()
64 LRUHandle** LRUHandleTable::FindPointer(const Slice& key, uint32_t hash) {  in FindPointer()  argument
65   LRUHandle** ptr = &list_[hash & (length_ - 1)];  in FindPointer()
66   while (*ptr != nullptr && ((*ptr)->hash != hash || key != (*ptr)->key())) {  in FindPointer()
84       uint32_t hash = h->hash;  in Resize()  local
85       LRUHandle** ptr = &new_list[hash & (new_length - 1)];  in Resize()
127       table_.Remove(old->key(), old->hash);  in EraseUnRefEntries()
242     table_.Remove(old->key(), old->hash);  in EvictFromLRU()
271 Cache::Handle* LRUCacheShard::Lookup(const Slice& key, uint32_t hash) {  in Lookup()  argument
273   LRUHandle* e = table_.Lookup(key, hash);  in Lookup()
317         table_.Remove(e->key(), e->hash);  in Release()
339 Status LRUCacheShard::Insert(const Slice& key, uint32_t hash, void* value,  in Insert()  argument
355   e->hash = hash;  in Insert()
417 void LRUCacheShard::Erase(const Slice& key, uint32_t hash) {  in Erase()  argument
422     e = table_.Remove(key, hash);  in Erase()
511   return reinterpret_cast<const LRUHandle*>(handle)->hash;  in GetHash()