83       LRUHandle* next = h->next_hash;  in Resize()  local
88       h = next;  in Resize()
112   lru_.next = &lru_;  in LRUCacheShard()
122     while (lru_.next != &lru_) {  in EraseUnRefEntries()
123       LRUHandle* old = lru_.next;  in EraseUnRefEntries()
164   LRUHandle* lru_handle = lru_.next;  in TEST_GetLRUSize()
168     lru_handle = lru_handle->next;  in TEST_GetLRUSize()
179   assert(e->next != nullptr);  in LRU_Remove()
184   e->next->prev = e->prev;  in LRU_Remove()
185   e->prev->next = e->next;  in LRU_Remove()
186   e->prev = e->next = nullptr;  in LRU_Remove()
197   assert(e->next == nullptr);  in LRU_Insert()
202     e->next = &lru_;  in LRU_Insert()
204     e->prev->next = e;  in LRU_Insert()
205     e->next->prev = e;  in LRU_Insert()
212     e->next = lru_low_pri_->next;  in LRU_Insert()
214     e->prev->next = e;  in LRU_Insert()
215     e->next->prev = e;  in LRU_Insert()
225     lru_low_pri_ = lru_low_pri_->next;  in MaintainPoolSize()
237   while ((usage_ + charge) > capacity_ && lru_.next != &lru_) {  in EvictFromLRU()
238     LRUHandle* old = lru_.next;  in EvictFromLRU()
315         assert(lru_.next == &lru_ || force_erase);  in Release()
357   e->next = e->prev = nullptr;  in Insert()