Lines Matching refs:RANKINGS
5 #include "net/disk_cache/rankings.h"
30 // This class provides a simple lock for the LRU list of rankings. Whenever an
193 Rankings::ScopedRankingsBlock::ScopedRankingsBlock() : rankings_(NULL) {}
195 Rankings::ScopedRankingsBlock::ScopedRankingsBlock(Rankings* rankings)
196 : rankings_(rankings) {}
198 Rankings::ScopedRankingsBlock::ScopedRankingsBlock(
199 Rankings* rankings, CacheRankingsBlock* node)
200 : scoped_ptr<CacheRankingsBlock>(node), rankings_(rankings) {}
202 Rankings::Iterator::Iterator(Rankings* rankings) {
204 my_rankings = rankings;
207 Rankings::Iterator::~Iterator() {
212 Rankings::Rankings() : init_(false) {}
214 Rankings::~Rankings() {}
216 bool Rankings::Init(BackendImpl* backend, bool count_lists) {
235 void Rankings::Reset() {
244 void Rankings::Insert(CacheRankingsBlock* node, bool modified, List list) {
315 void Rankings::Remove(CacheRankingsBlock* node, List list, bool strict) {
327 LOG(ERROR) << "Invalid rankings info.";
400 void Rankings::UpdateRank(CacheRankingsBlock* node, bool modified, List list) {
414 CacheRankingsBlock* Rankings::GetNext(CacheRankingsBlock* node, List list) {
447 CacheRankingsBlock* Rankings::GetPrev(CacheRankingsBlock* node, List list) {
480 void Rankings::FreeRankingsBlock(CacheRankingsBlock* node) {
484 void Rankings::TrackRankingsBlock(CacheRankingsBlock* node,
497 int Rankings::SelfCheck() {
511 bool Rankings::SanityCheck(CacheRankingsBlock* node, bool from_list) const {
536 if (!next_addr.SanityCheckV2() || next_addr.file_type() != RANKINGS ||
537 !prev_addr.SanityCheckV2() || prev_addr.file_type() != RANKINGS)
543 bool Rankings
555 void Rankings::SetContents(CacheRankingsBlock* node, CacheAddr address) {
560 void Rankings::ReadHeads() {
565 void Rankings::ReadTails() {
570 void Rankings::WriteHead(List list) {
574 void Rankings::WriteTail(List list) {
578 bool Rankings::GetRanking(CacheRankingsBlock* rankings) {
579 if (!rankings->address().is_initialized())
583 if (!rankings->Load())
586 if (!SanityCheck(rankings, true)) {
595 if (!backend_->read_only() && !rankings->Data()->dirty)
598 EntryImpl* entry = backend_->GetOpenEntry(rankings);
606 rankings->Data()->dirty = backend_->GetCurrentEntryId() - 1;
607 if (!rankings->Data()->dirty)
608 rankings->Data()->dirty--;
612 // Note that we should not leave this module without deleting rankings first.
613 rankings->SetData(entry->rankings()->Data());
619 void Rankings::ConvertToLongLived(CacheRankingsBlock* rankings) {
620 if (rankings->own_data())
627 *temp.Data() = *rankings->Data();
628 rankings->StopSharingData();
629 *rankings->Data() = *temp.Data();
632 void Rankings::CompleteTransaction() {
636 LOG(ERROR) << "Invalid rankings info.";
666 void Rankings::FinishInsert(CacheRankingsBlock* node) {
684 void Rankings::RevertRemove(CacheRankingsBlock* node) {
694 LOG(WARNING) << "Invalid rankings info.";
742 bool Rankings::CheckLinks(CacheRankingsBlock* node, CacheRankingsBlock* prev,
783 bool Rankings::CheckSingleLink(CacheRankingsBlock* prev,
796 int Rankings::CheckList(List list) {
810 int Rankings::CheckListSection(List list, Addr end1, Addr end2, bool forward,
855 bool Rankings::IsHead(CacheAddr addr, List* list) const {
867 bool Rankings::IsTail(CacheAddr addr, List* list) const {
882 void Rankings::UpdateIterators(CacheRankingsBlock* node) {
893 void Rankings::InvalidateIterators(CacheRankingsBlock* node) {
904 void Rankings::IncrementCounter(List list) {
913 void Rankings::DecrementCounter(List list) {
