Lines Matching refs:Rankings
662 scoped_ptr<Rankings::Iterator> iterator( in SyncEndEnumeration()
663 reinterpret_cast<Rankings::Iterator*>(iter)); in SyncEndEnumeration()
1261 data_->header.lru.sizes[Rankings::DELETED]; in GetEntryCount()
1681 scoped_ptr<Rankings::Iterator> iterator( in OpenFollowingEntry()
1682 reinterpret_cast<Rankings::Iterator*>(*iter)); in OpenFollowingEntry()
1686 iterator.reset(new Rankings::Iterator(&rankings_)); in OpenFollowingEntry()
1692 ret |= OpenFollowingEntryFromList(forward, static_cast<Rankings::List>(i), in OpenFollowingEntry()
1708 static_cast<Rankings::List>(i)); in OpenFollowingEntry()
1739 iterator->list = static_cast<Rankings::List>(newest); in OpenFollowingEntry()
1742 iterator->list = static_cast<Rankings::List>(oldest); in OpenFollowingEntry()
1749 bool BackendImpl::OpenFollowingEntryFromList(bool forward, Rankings::List list, in OpenFollowingEntryFromList()
1755 if (!new_eviction_ && Rankings::NO_USE != list) in OpenFollowingEntryFromList()
1758 Rankings::ScopedRankingsBlock rankings(&rankings_, *from_entry); in OpenFollowingEntryFromList()
1762 Rankings::ScopedRankingsBlock next(&rankings_, next_block); in OpenFollowingEntryFromList()
1774 Rankings::List list) { in GetEnumeratedEntry()
1990 data_->header.lru.sizes[Rankings::NO_USE] = data_->header.num_entries; in UpgradeTo2_1()