Lines Matching defs:tail
104 tail = &(blks[numBlocks - 1]);
105 tail->prev = &(blks[numBlocks - 2]);
106 tail->next = nullptr;
107 tail->setPosition(0, numBlocks - 1);
108 tail->data = &dataBlks[(numBlocks - 1) * blkSize];
110 cacheTracking.init(head, tail);
136 // Move the block to the tail to make it the next victim
202 // The victim is always stored on the tail for the FALRU
203 FALRUBlk* victim = tail;
238 // If block is tail, set previous block as new tail
239 if (blk == tail){
241 tail = blk->prev;
242 tail->next = nullptr;
255 cacheTracking.check(head, tail);
262 // If block is not already tail, do the moving
263 if (blk != tail) {
277 blk->prev = tail;
279 tail->next = blk;
280 tail = blk;
282 cacheTracking.check(head, tail);
293 FALRU::CacheTracking::check(const FALRUBlk *head, const FALRUBlk *tail) const
307 if (curr_size == tracked_cache_size && blk != tail) {
321 FALRU::CacheTracking::init(FALRUBlk *head, FALRUBlk *tail)
334 if (curr_size == tracked_cache_size && blk != tail) {
382 // the tail), move the ith boundary 1 block closer to the