178 void LRUCacheShard::LRU_Remove(LRUHandle* e) {  in LRU_Remove()  argument
179   assert(e->next != nullptr);  in LRU_Remove()
180   assert(e->prev != nullptr);  in LRU_Remove()
181   if (lru_low_pri_ == e) {  in LRU_Remove()
182     lru_low_pri_ = e->prev;  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()
187   size_t total_charge = e->CalcTotalCharge(metadata_charge_policy_);  in LRU_Remove()
190   if (e->InHighPriPool()) {  in LRU_Remove()
196 void LRUCacheShard::LRU_Insert(LRUHandle* e) {  in LRU_Insert()  argument
197   assert(e->next == nullptr);  in LRU_Insert()
198   assert(e->prev == nullptr);  in LRU_Insert()
199   size_t total_charge = e->CalcTotalCharge(metadata_charge_policy_);  in LRU_Insert()
200   if (high_pri_pool_ratio_ > 0 && (e->IsHighPri() || e->HasHit())) {  in LRU_Insert()
202     e->next = &lru_;  in LRU_Insert()
203     e->prev = lru_.prev;  in LRU_Insert()
204     e->prev->next = e;  in LRU_Insert()
205     e->next->prev = e;  in LRU_Insert()
206     e->SetInHighPriPool(true);  in LRU_Insert()
212     e->next = lru_low_pri_->next;  in LRU_Insert()
213     e->prev = lru_low_pri_;  in LRU_Insert()
214     e->prev->next = e;  in LRU_Insert()
215     e->next->prev = e;  in LRU_Insert()
216     e->SetInHighPriPool(false);  in LRU_Insert()
217     lru_low_pri_ = e;  in LRU_Insert()
273   LRUHandle* e = table_.Lookup(key, hash);  in Lookup()  local
274   if (e != nullptr) {  in Lookup()
275     assert(e->InCache());  in Lookup()
276     if (!e->HasRefs()) {  in Lookup()
278       LRU_Remove(e);  in Lookup()
280     e->Ref();  in Lookup()
281     e->SetHit();  in Lookup()
283   return reinterpret_cast<Cache::Handle*>(e);  in Lookup()
287   LRUHandle* e = reinterpret_cast<LRUHandle*>(h);  in Ref()  local
290   assert(e->HasRefs());  in Ref()
291   e->Ref();  in Ref()
306   LRUHandle* e = reinterpret_cast<LRUHandle*>(handle);  in Release()  local
310     last_reference = e->Unref();  in Release()
311     if (last_reference && e->InCache()) {  in Release()
317         table_.Remove(e->key(), e->hash);  in Release()
318         e->SetInCache(false);  in Release()
321         LRU_Insert(e);  in Release()
326       size_t total_charge = e->CalcTotalCharge(metadata_charge_policy_);  in Release()
334     e->Free();  in Release()
345   LRUHandle* e = reinterpret_cast<LRUHandle*>(  in Insert()  local
350   e->value = value;  in Insert()
351   e->deleter = deleter;  in Insert()
352   e->charge = charge;  in Insert()
353   e->key_length = key.size();  in Insert()
354   e->flags = 0;  in Insert()
355   e->hash = hash;  in Insert()
356   e->refs = 0;  in Insert()
357   e->next = e->prev = nullptr;  in Insert()
358   e->SetInCache(true);  in Insert()
359   e->SetPriority(priority);  in Insert()
360   memcpy(e->key_data, key.data(), key.size());  in Insert()
361   size_t total_charge = e->CalcTotalCharge(metadata_charge_policy_);  in Insert()
375         e->SetInCache(false);  in Insert()
376         last_reference_list.push_back(e);  in Insert()
378         delete[] reinterpret_cast<char*>(e);  in Insert()
385       LRUHandle* old = table_.Insert(e);  in Insert()
401         LRU_Insert(e);  in Insert()
403         e->Ref();  in Insert()
404         *handle = reinterpret_cast<Cache::Handle*>(e);  in Insert()
418   LRUHandle* e;  in Erase()  local
422     e = table_.Remove(key, hash);  in Erase()
423     if (e != nullptr) {  in Erase()
424       assert(e->InCache());  in Erase()
425       e->SetInCache(false);  in Erase()
426       if (!e->HasRefs()) {  in Erase()
428         LRU_Remove(e);  in Erase()
429         size_t total_charge = e->CalcTotalCharge(metadata_charge_policy_);  in Erase()
440     e->Free();  in Erase()