Lines Matching defs:next
116 Rankings::ScopedRankingsBlock next(rankings_,
119 while ((header_->num_bytes > target_size || test_mode_) && next.get()) {
121 if (!next->HasData())
123 node.reset(next.release());
124 next.reset(rankings_->GetPrev(node.get(), Rankings::NO_USE));
294 Rankings::ScopedRankingsBlock next[kListsToSearch];
300 next[i].set_rankings(rankings_);
303 next[i].reset(rankings_->GetPrev(NULL, static_cast<Rankings::List>(i)));
304 if (!empty && NodeIsOldEnough(next[i].get(), i)) {
312 list = SelectListByLength(next);
322 next[list].get()) {
324 if (!next[list]->HasData())
326 node.reset(next[list].release());
327 next[list].reset(rankings_->GetPrev(node.get(),
471 Rankings::ScopedRankingsBlock next(rankings_,
474 while (next.get() &&
476 node.reset(next.release());
477 next.reset(rankings_->GetPrev(node.get(), Rankings::DELETED));
526 int Eviction::SelectListByLength(Rankings::ScopedRankingsBlock* next) {
539 if (!NodeIsOldEnough(next[list].get(), 0) &&
