Lines Matching defs:CacheRankingsBlock

22 typedef StorageBlock<RankingsNode> CacheRankingsBlock;
66 // Rankings whenever a CacheRankingsBlock is deleted, to keep track of cache
68 class ScopedRankingsBlock : public scoped_ptr<CacheRankingsBlock> {
72 ScopedRankingsBlock(Rankings* rankings, CacheRankingsBlock* node);
83 void reset(CacheRankingsBlock* p = NULL) {
86 scoped_ptr<CacheRankingsBlock>::reset(p);
101 CacheRankingsBlock* nodes[3]; // Nodes on the first three lists.
114 void Insert(CacheRankingsBlock* node, bool modified, List list);
121 void Remove(CacheRankingsBlock* node, List list, bool strict);
124 void UpdateRank(CacheRankingsBlock* node, bool modified, List list);
127 CacheRankingsBlock* GetNext(CacheRankingsBlock* node, List list);
128 CacheRankingsBlock* GetPrev(CacheRankingsBlock* node, List list);
129 void FreeRankingsBlock(CacheRankingsBlock* node);
132 void TrackRankingsBlock(CacheRankingsBlock* node, bool start_tracking);
140 bool SanityCheck(CacheRankingsBlock* node, bool from_list) const;
141 bool DataSanityCheck(CacheRankingsBlock* node, bool from_list) const;
144 void SetContents(CacheRankingsBlock* node, CacheAddr address);
147 typedef std::pair<CacheAddr, CacheRankingsBlock*> IteratorPair;
158 bool GetRanking(CacheRankingsBlock* rankings);
161 void ConvertToLongLived(CacheRankingsBlock* rankings);
165 void FinishInsert(CacheRankingsBlock* rankings);
166 void RevertRemove(CacheRankingsBlock* rankings);
170 bool CheckLinks(CacheRankingsBlock* node, CacheRankingsBlock* prev,
171 CacheRankingsBlock* next, List* list);
174 bool CheckSingleLink(CacheRankingsBlock* prev, CacheRankingsBlock* next);
192 void UpdateIterators(CacheRankingsBlock* node);
195 void InvalidateIterators(CacheRankingsBlock* node);