Lines Matching refs:CacheRankingsBlock
64 // Rankings whenever a CacheRankingsBlock is deleted, to keep track of cache
66 class ScopedRankingsBlock : public scoped_ptr<CacheRankingsBlock> {
70 ScopedRankingsBlock(Rankings* rankings, CacheRankingsBlock* node)
71 : scoped_ptr<CacheRankingsBlock>(node), rankings_(rankings) {}
82 void reset(CacheRankingsBlock* p = NULL) {
85 scoped_ptr<CacheRankingsBlock>::reset(p);
100 CacheRankingsBlock* nodes[3]; // Nodes on the first three lists.
113 void Insert(CacheRankingsBlock* node, bool modified, List list);
120 void Remove(CacheRankingsBlock* node, List list, bool strict);
123 void UpdateRank(CacheRankingsBlock* node, bool modified, List list);
126 CacheRankingsBlock* GetNext(CacheRankingsBlock* node, List list);
127 CacheRankingsBlock* GetPrev(CacheRankingsBlock* node, List list);
128 void FreeRankingsBlock(CacheRankingsBlock* node);
131 void TrackRankingsBlock(CacheRankingsBlock* node, bool start_tracking);
139 bool SanityCheck(CacheRankingsBlock* node, bool from_list) const;
140 bool DataSanityCheck(CacheRankingsBlock* node, bool from_list) const;
143 void SetContents(CacheRankingsBlock* node, CacheAddr address);
146 typedef std::pair<CacheAddr, CacheRankingsBlock*> IteratorPair;
157 bool GetRanking(CacheRankingsBlock* rankings);
160 void ConvertToLongLived(CacheRankingsBlock* rankings);
164 void FinishInsert(CacheRankingsBlock* rankings);
165 void RevertRemove(CacheRankingsBlock* rankings);
169 bool CheckEntry(CacheRankingsBlock* rankings);
173 bool CheckLinks(CacheRankingsBlock* node, CacheRankingsBlock* prev,
174 CacheRankingsBlock* next, List* list);
177 bool CheckSingleLink(CacheRankingsBlock* prev, CacheRankingsBlock* next);
189 void UpdateIterators(CacheRankingsBlock* node);
192 void InvalidateIterators(CacheRankingsBlock* node);
