Lines Matching refs:get
87 rankings_->GetPrev(node.get(), Rankings::NO_USE));
89 while (header_->num_bytes > target_size && next.get()) {
94 next.reset(rankings_->GetPrev(node.get(), Rankings::NO_USE));
98 rankings_->TrackRankingsBlock(node.get(), false);
99 if (!EvictEntry(node.get(), empty))
240 // Get a node from each list.
247 if (!empty && NodeIsOldEnough(next[i].get(), i)) {
260 !NodeIsOldEnough(next[list].get(), 0))
271 while (header_->num_bytes > target_size && next[list].get()) {
276 next[list].reset(rankings_->GetPrev(node.get(),
281 rankings_->TrackRankingsBlock(node.get(), false);
282 if (!EvictEntry(node.get(), empty))
402 rankings_->GetPrev(node.get(), Rankings::DELETED));
403 for (int i = 0; (i < 4 || empty) && next.get(); i++) {
405 next.reset(rankings_->GetPrev(node.get(), Rankings::DELETED));
406 RemoveDeletedNode(node.get());
474 if (last1.get())
476 Time::FromInternalValue(last1.get()->Data()->last_used));
477 if (last2.get())
479 Time::FromInternalValue(last2.get()->Data()->last_used));
480 if (last3.get())
482 Time::FromInternalValue(last3.get()->Data()->last_used));
483 if (last4.get())
485 Time::FromInternalValue(last4.get()->Data()->last_used));
