1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
|
// Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// See net/disk_cache/disk_cache.h for the public interface.
#ifndef NET_DISK_CACHE_RANKINGS_H_
#define NET_DISK_CACHE_RANKINGS_H_
#include <list>
#include "net/disk_cache/addr.h"
#include "net/disk_cache/mapped_file.h"
#include "net/disk_cache/storage_block.h"
namespace disk_cache {
class BackendImpl;
// Type of crashes generated for the unit tests.
enum RankCrashes {
NO_CRASH = 0,
INSERT_EMPTY_1,
INSERT_EMPTY_2,
INSERT_EMPTY_3,
INSERT_ONE_1,
INSERT_ONE_2,
INSERT_ONE_3,
INSERT_LOAD_1,
INSERT_LOAD_2,
REMOVE_ONE_1,
REMOVE_ONE_2,
REMOVE_ONE_3,
REMOVE_ONE_4,
REMOVE_HEAD_1,
REMOVE_HEAD_2,
REMOVE_HEAD_3,
REMOVE_HEAD_4,
REMOVE_TAIL_1,
REMOVE_TAIL_2,
REMOVE_TAIL_3,
REMOVE_LOAD_1,
REMOVE_LOAD_2,
REMOVE_LOAD_3,
MAX_CRASH
};
// This class handles the ranking information for the cache.
class Rankings {
public:
// This class provides a specialized version of scoped_ptr, that calls
// Rankings whenever a CacheRankingsBlock is deleted, to keep track of cache
// iterators that may go stale.
class ScopedRankingsBlock : public scoped_ptr<CacheRankingsBlock> {
public:
explicit ScopedRankingsBlock(Rankings* rankings) : rankings_(rankings) {}
ScopedRankingsBlock(Rankings* rankings, CacheRankingsBlock* node)
: scoped_ptr<CacheRankingsBlock>(node), rankings_(rankings) {}
~ScopedRankingsBlock() {
rankings_->FreeRankingsBlock(get());
}
// scoped_ptr::reset will delete the object.
void reset(CacheRankingsBlock* p = NULL) {
if (p != get())
rankings_->FreeRankingsBlock(get());
scoped_ptr<CacheRankingsBlock>::reset(p);
}
private:
Rankings* rankings_;
DISALLOW_EVIL_CONSTRUCTORS(ScopedRankingsBlock);
};
Rankings()
: init_(false), head_(0), tail_(0) {}
~Rankings() {}
bool Init(BackendImpl* backend);
// Restores original state, leaving the object ready for initialization.
void Reset();
// Inserts a given entry at the head of the queue.
void Insert(CacheRankingsBlock* node, bool modified);
// Removes a given entry from the LRU list.
void Remove(CacheRankingsBlock* node);
// Moves a given entry to the head.
void UpdateRank(CacheRankingsBlock* node, bool modified);
// Iterates through the list.
CacheRankingsBlock* GetNext(CacheRankingsBlock* node);
CacheRankingsBlock* GetPrev(CacheRankingsBlock* node);
void FreeRankingsBlock(CacheRankingsBlock* node);
// Peforms a simple self-check of the list, and returns the number of items
// or an error code (negative value).
int SelfCheck();
// Returns false if the entry is clearly invalid. from_list is true if the
// node comes from the LRU list.
bool SanityCheck(CacheRankingsBlock* node, bool from_list);
private:
typedef std::pair<CacheAddr, CacheRankingsBlock*> IteratorPair;
typedef std::list<IteratorPair> IteratorList;
Addr ReadHead();
Addr ReadTail();
void WriteHead();
void WriteTail();
// Gets the rankings information for a given rankings node.
bool GetRanking(CacheRankingsBlock* rankings);
// Finishes a list modification after a crash.
void CompleteTransaction();
void FinishInsert(CacheRankingsBlock* rankings);
void RevertRemove(CacheRankingsBlock* rankings);
// Returns false if this entry will not be recognized as dirty (called during
// selfcheck).
bool CheckEntry(CacheRankingsBlock* rankings);
// Returns false if node is not properly linked.
bool CheckLinks(CacheRankingsBlock* node, CacheRankingsBlock* prev,
CacheRankingsBlock* next);
// Checks the links between two consecutive nodes.
bool CheckSingleLink(CacheRankingsBlock* prev, CacheRankingsBlock* next);
// Controls tracking of nodes used for enumerations.
void TrackRankingsBlock(CacheRankingsBlock* node, bool start_tracking);
// Updates the iterators whenever node is being changed.
void UpdateIterators(CacheRankingsBlock* node);
bool init_;
Addr head_;
Addr tail_;
BackendImpl* backend_;
LruData* control_data_; // Data related to the LRU lists.
IteratorList iterators_;
DISALLOW_COPY_AND_ASSIGN(Rankings);
};
} // namespace disk_cache
#endif // NET_DISK_CACHE_RANKINGS_H_
|
