Lines Matching defs:Rankings
5 #include "net/disk_cache/rankings.h"
26 // This class provides a simple lock for the LRU list of rankings. Whenever an
189 Rankings::Iterator::Iterator(Rankings* rankings) {
191 my_rankings = rankings;
194 Rankings::Iterator::~Iterator() {
199 Rankings::Rankings() : init_(false) {}
201 Rankings::~Rankings() {}
203 bool Rankings::Init(BackendImpl* backend, bool count_lists) {
222 void Rankings::Reset() {
231 void Rankings::Insert(CacheRankingsBlock* node, bool modified, List list) {
301 void Rankings::Remove(CacheRankingsBlock* node, List list, bool strict) {
313 LOG(ERROR) << "Invalid rankings info.";
382 void Rankings::UpdateRank(CacheRankingsBlock* node, bool modified, List list) {
396 CacheRankingsBlock* Rankings::GetNext(CacheRankingsBlock* node, List list) {
429 CacheRankingsBlock* Rankings::GetPrev(CacheRankingsBlock* node, List list) {
462 void Rankings::FreeRankingsBlock(CacheRankingsBlock* node) {
466 void Rankings::TrackRankingsBlock(CacheRankingsBlock* node,
479 int Rankings::SelfCheck() {
490 bool Rankings::SanityCheck(CacheRankingsBlock* node, bool from_list) const {
512 if (!next_addr.SanityCheck() || next_addr.file_type() != RANKINGS ||
513 !prev_addr.SanityCheck() || prev_addr.file_type() != RANKINGS)
519 bool Rankings::DataSanityCheck(CacheRankingsBlock* node, bool from_list) const {
531 void Rankings::SetContents(CacheRankingsBlock* node, CacheAddr address) {
536 void Rankings::ReadHeads() {
541 void Rankings::ReadTails() {
546 void Rankings::WriteHead(List list) {
550 void Rankings::WriteTail(List list) {
554 bool Rankingsrankings) {
555 if (!rankings->address().is_initialized())
559 if (!rankings->Load())
562 if (!SanityCheck(rankings, true)) {
570 if (!rankings->Data()->dirty && !rankings->Data()->dummy)
573 EntryImpl* entry = backend_->GetOpenEntry(rankings);
579 rankings->Data()->dummy = 0;
580 rankings->Data()->dirty = backend_->GetCurrentEntryId() - 1;
581 if (!rankings->Data()->dirty)
582 rankings->Data()->dirty--;
586 // Note that we should not leave this module without deleting rankings first.
587 rankings->SetData(entry->rankings()->Data());
593 void Rankings::ConvertToLongLived(CacheRankingsBlock* rankings) {
594 if (rankings->own_data())
601 *temp.Data() = *rankings->Data();
602 rankings->StopSharingData();
603 *rankings->Data() = *temp.Data();
606 void Rankings::CompleteTransaction() {
610 LOG(ERROR) << "Invalid rankings info.";
641 void Rankings::FinishInsert(CacheRankingsBlock* node) {
659 void Rankings::RevertRemove(CacheRankingsBlock* node) {
669 LOG(WARNING) << "Invalid rankings info.";
716 bool Rankings::CheckEntry(CacheRankingsBlock* rankings) {
717 if (!rankings->Data()->dummy)
721 return backend_->GetCurrentEntryId() != rankings->Data()->dirty;
724 bool Rankings::CheckLinks(CacheRankingsBlock* node, CacheRankingsBlock* prev,
763 bool Rankings::CheckSingleLink(CacheRankingsBlock* prev,
776 int Rankings::CheckList(List list) {
817 bool Rankings::IsHead(CacheAddr addr, List* list) const {
829 bool Rankings::IsTail(CacheAddr addr, List* list) const {
844 void Rankings::UpdateIterators(CacheRankingsBlock* node) {
855 void Rankings::InvalidateIterators(CacheRankingsBlock* node) {
870 void Rankings::IncrementCounter(List list) {
879 void Rankings::DecrementCounter(List list) {
