fa_lru.cc revision 13215
12810Srdreslin@umich.edu/* 213165Sodanrc@yahoo.com.br * Copyright (c) 2018 Inria 312665Snikos.nikoleris@arm.com * Copyright (c) 2013,2016-2018 ARM Limited 49796Sprakash.ramrakhyani@arm.com * All rights reserved. 59796Sprakash.ramrakhyani@arm.com * 69796Sprakash.ramrakhyani@arm.com * The license below extends only to copyright in the software and shall 79796Sprakash.ramrakhyani@arm.com * not be construed as granting a license to any other intellectual 89796Sprakash.ramrakhyani@arm.com * property including but not limited to intellectual property relating 99796Sprakash.ramrakhyani@arm.com * to a hardware implementation of the functionality of the software 109796Sprakash.ramrakhyani@arm.com * licensed hereunder. You may use the software subject to the license 119796Sprakash.ramrakhyani@arm.com * terms below provided that you ensure that this notice is replicated 129796Sprakash.ramrakhyani@arm.com * unmodified and in its entirety in all distributions of the software, 139796Sprakash.ramrakhyani@arm.com * modified or unmodified, in source code or in binary form. 149796Sprakash.ramrakhyani@arm.com * 152810Srdreslin@umich.edu * Copyright (c) 2003-2005 The Regents of The University of Michigan 162810Srdreslin@umich.edu * All rights reserved. 172810Srdreslin@umich.edu * 182810Srdreslin@umich.edu * Redistribution and use in source and binary forms, with or without 192810Srdreslin@umich.edu * modification, are permitted provided that the following conditions are 202810Srdreslin@umich.edu * met: redistributions of source code must retain the above copyright 212810Srdreslin@umich.edu * notice, this list of conditions and the following disclaimer; 222810Srdreslin@umich.edu * redistributions in binary form must reproduce the above copyright 232810Srdreslin@umich.edu * notice, this list of conditions and the following disclaimer in the 242810Srdreslin@umich.edu * documentation and/or other materials provided with the distribution; 252810Srdreslin@umich.edu * neither the name of the copyright holders nor the names of its 262810Srdreslin@umich.edu * contributors may be used to endorse or promote products derived from 272810Srdreslin@umich.edu * this software without specific prior written permission. 282810Srdreslin@umich.edu * 292810Srdreslin@umich.edu * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 302810Srdreslin@umich.edu * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 312810Srdreslin@umich.edu * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 322810Srdreslin@umich.edu * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 332810Srdreslin@umich.edu * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 342810Srdreslin@umich.edu * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 352810Srdreslin@umich.edu * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 362810Srdreslin@umich.edu * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 372810Srdreslin@umich.edu * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 382810Srdreslin@umich.edu * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 392810Srdreslin@umich.edu * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 402810Srdreslin@umich.edu * 412810Srdreslin@umich.edu * Authors: Erik Hallnor 4212665Snikos.nikoleris@arm.com * Nikos Nikoleris 4313165Sodanrc@yahoo.com.br * Daniel Carvalho 442810Srdreslin@umich.edu */ 452810Srdreslin@umich.edu 462810Srdreslin@umich.edu/** 472810Srdreslin@umich.edu * @file 482810Srdreslin@umich.edu * Definitions a fully associative LRU tagstore. 492810Srdreslin@umich.edu */ 502810Srdreslin@umich.edu 5111486Snikos.nikoleris@arm.com#include "mem/cache/tags/fa_lru.hh" 5211486Snikos.nikoleris@arm.com 536216Snate@binkert.org#include <cassert> 542810Srdreslin@umich.edu#include <sstream> 552810Srdreslin@umich.edu 562810Srdreslin@umich.edu#include "base/intmath.hh" 5712334Sgabeblack@google.com#include "base/logging.hh" 5812727Snikos.nikoleris@arm.com#include "mem/cache/base.hh" 592810Srdreslin@umich.edu 609796Sprakash.ramrakhyani@arm.comFALRU::FALRU(const Params *p) 6112665Snikos.nikoleris@arm.com : BaseTags(p), 6212665Snikos.nikoleris@arm.com 6312665Snikos.nikoleris@arm.com cacheTracking(p->min_tracked_cache_size, size, blkSize) 642810Srdreslin@umich.edu{ 652810Srdreslin@umich.edu if (!isPowerOf2(blkSize)) 662810Srdreslin@umich.edu fatal("cache block size (in bytes) `%d' must be a power of two", 672810Srdreslin@umich.edu blkSize); 682810Srdreslin@umich.edu if (!isPowerOf2(size)) 692810Srdreslin@umich.edu fatal("Cache Size must be power of 2 for now"); 702810Srdreslin@umich.edu 7112665Snikos.nikoleris@arm.com blks = new FALRUBlk[numBlocks]; 722810Srdreslin@umich.edu 732810Srdreslin@umich.edu head = &(blks[0]); 7411484Snikos.nikoleris@arm.com head->prev = nullptr; 752810Srdreslin@umich.edu head->next = &(blks[1]); 7612665Snikos.nikoleris@arm.com head->set = 0; 7712665Snikos.nikoleris@arm.com head->way = 0; 7812629Sodanrc@yahoo.com.br head->data = &dataBlks[0]; 792810Srdreslin@umich.edu 806978SLisa.Hsu@amd.com for (unsigned i = 1; i < numBlocks - 1; i++) { 812810Srdreslin@umich.edu blks[i].prev = &(blks[i-1]); 822810Srdreslin@umich.edu blks[i].next = &(blks[i+1]); 8310941Sdavid.guillen@arm.com blks[i].set = 0; 8410941Sdavid.guillen@arm.com blks[i].way = i; 8512629Sodanrc@yahoo.com.br 8612629Sodanrc@yahoo.com.br // Associate a data chunk to the block 8712629Sodanrc@yahoo.com.br blks[i].data = &dataBlks[blkSize*i]; 882810Srdreslin@umich.edu } 8912665Snikos.nikoleris@arm.com 9012665Snikos.nikoleris@arm.com tail = &(blks[numBlocks - 1]); 9112665Snikos.nikoleris@arm.com tail->prev = &(blks[numBlocks - 2]); 9212665Snikos.nikoleris@arm.com tail->next = nullptr; 9312665Snikos.nikoleris@arm.com tail->set = 0; 9412665Snikos.nikoleris@arm.com tail->way = numBlocks - 1; 9512665Snikos.nikoleris@arm.com tail->data = &dataBlks[(numBlocks - 1) * blkSize]; 9612665Snikos.nikoleris@arm.com 9712665Snikos.nikoleris@arm.com cacheTracking.init(head, tail); 982810Srdreslin@umich.edu} 992810Srdreslin@umich.edu 1009086Sandreas.hansson@arm.comFALRU::~FALRU() 1019086Sandreas.hansson@arm.com{ 1029086Sandreas.hansson@arm.com delete[] blks; 1039086Sandreas.hansson@arm.com} 1049086Sandreas.hansson@arm.com 1052810Srdreslin@umich.eduvoid 1069796Sprakash.ramrakhyani@arm.comFALRU::regStats() 1072810Srdreslin@umich.edu{ 1089796Sprakash.ramrakhyani@arm.com BaseTags::regStats(); 10912665Snikos.nikoleris@arm.com cacheTracking.regStats(name()); 1102810Srdreslin@umich.edu} 1112810Srdreslin@umich.edu 1122810Srdreslin@umich.eduvoid 11310815Sdavid.guillen@arm.comFALRU::invalidate(CacheBlk *blk) 1142810Srdreslin@umich.edu{ 11513165Sodanrc@yahoo.com.br // Erase block entry reference in the hash table 11613165Sodanrc@yahoo.com.br auto num_erased = tagHash.erase(std::make_pair(blk->tag, blk->isSecure())); 11713165Sodanrc@yahoo.com.br 11813165Sodanrc@yahoo.com.br // Sanity check; only one block reference should be erased 11913165Sodanrc@yahoo.com.br assert(num_erased == 1); 12013165Sodanrc@yahoo.com.br 12113165Sodanrc@yahoo.com.br // Invalidate block entry. Must be done after the hash is erased 12212566Snikos.nikoleris@arm.com BaseTags::invalidate(blk); 12312636Sodanrc@yahoo.com.br 12412745Sodanrc@yahoo.com.br // Decrease the number of tags in use 12512745Sodanrc@yahoo.com.br tagsInUse--; 12612745Sodanrc@yahoo.com.br 12712648Sodanrc@yahoo.com.br // Move the block to the tail to make it the next victim 12812648Sodanrc@yahoo.com.br moveToTail((FALRUBlk*)blk); 1292810Srdreslin@umich.edu} 1302810Srdreslin@umich.edu 13110815Sdavid.guillen@arm.comCacheBlk* 13211870Snikos.nikoleris@arm.comFALRU::accessBlock(Addr addr, bool is_secure, Cycles &lat) 13310815Sdavid.guillen@arm.com{ 13411870Snikos.nikoleris@arm.com return accessBlock(addr, is_secure, lat, 0); 13510815Sdavid.guillen@arm.com} 13610815Sdavid.guillen@arm.com 13710815Sdavid.guillen@arm.comCacheBlk* 13812665Snikos.nikoleris@arm.comFALRU::accessBlock(Addr addr, bool is_secure, Cycles &lat, 13912665Snikos.nikoleris@arm.com CachesMask *in_caches_mask) 1402810Srdreslin@umich.edu{ 14112665Snikos.nikoleris@arm.com CachesMask mask = 0; 14212677Sodanrc@yahoo.com.br FALRUBlk* blk = static_cast<FALRUBlk*>(findBlock(addr, is_secure)); 1432810Srdreslin@umich.edu 14412775Snikos.nikoleris@arm.com if (blk && blk->isValid()) { 14511722Ssophiane.senni@gmail.com // If a cache hit 14611722Ssophiane.senni@gmail.com lat = accessLatency; 14711722Ssophiane.senni@gmail.com // Check if the block to be accessed is available. If not, 14811722Ssophiane.senni@gmail.com // apply the accessLatency on top of block->whenReady. 14911722Ssophiane.senni@gmail.com if (blk->whenReady > curTick() && 15011722Ssophiane.senni@gmail.com cache->ticksToCycles(blk->whenReady - curTick()) > 15111722Ssophiane.senni@gmail.com accessLatency) { 15211722Ssophiane.senni@gmail.com lat = cache->ticksToCycles(blk->whenReady - curTick()) + 15311722Ssophiane.senni@gmail.com accessLatency; 15411722Ssophiane.senni@gmail.com } 15512665Snikos.nikoleris@arm.com mask = blk->inCachesMask; 15612677Sodanrc@yahoo.com.br 15712665Snikos.nikoleris@arm.com moveToHead(blk); 1582810Srdreslin@umich.edu } else { 15911722Ssophiane.senni@gmail.com // If a cache miss 16011722Ssophiane.senni@gmail.com lat = lookupLatency; 1612810Srdreslin@umich.edu } 16212665Snikos.nikoleris@arm.com if (in_caches_mask) { 16312665Snikos.nikoleris@arm.com *in_caches_mask = mask; 1642810Srdreslin@umich.edu } 1652810Srdreslin@umich.edu 16612665Snikos.nikoleris@arm.com cacheTracking.recordAccess(blk); 16712665Snikos.nikoleris@arm.com 1682810Srdreslin@umich.edu return blk; 1692810Srdreslin@umich.edu} 1702810Srdreslin@umich.edu 17110815Sdavid.guillen@arm.comCacheBlk* 17210028SGiacomo.Gabrielli@arm.comFALRU::findBlock(Addr addr, bool is_secure) const 1732810Srdreslin@umich.edu{ 17412775Snikos.nikoleris@arm.com FALRUBlk* blk = nullptr; 17512775Snikos.nikoleris@arm.com 17612677Sodanrc@yahoo.com.br Addr tag = extractTag(addr); 17712775Snikos.nikoleris@arm.com auto iter = tagHash.find(std::make_pair(tag, is_secure)); 17812775Snikos.nikoleris@arm.com if (iter != tagHash.end()) { 17912775Snikos.nikoleris@arm.com blk = (*iter).second; 18012775Snikos.nikoleris@arm.com } 1812810Srdreslin@umich.edu 1822810Srdreslin@umich.edu if (blk && blk->isValid()) { 18312677Sodanrc@yahoo.com.br assert(blk->tag == tag); 18412676Sodanrc@yahoo.com.br assert(blk->isSecure() == is_secure); 1852810Srdreslin@umich.edu } 18612775Snikos.nikoleris@arm.com 1872810Srdreslin@umich.edu return blk; 1882810Srdreslin@umich.edu} 1892810Srdreslin@umich.edu 19012743Sodanrc@yahoo.com.brReplaceableEntry* 19110941Sdavid.guillen@arm.comFALRU::findBlockBySetAndWay(int set, int way) const 19210941Sdavid.guillen@arm.com{ 19310941Sdavid.guillen@arm.com assert(set == 0); 19410941Sdavid.guillen@arm.com return &blks[way]; 19510941Sdavid.guillen@arm.com} 19610941Sdavid.guillen@arm.com 19710941Sdavid.guillen@arm.comCacheBlk* 19812746Sodanrc@yahoo.com.brFALRU::findVictim(Addr addr, const bool is_secure, 19912746Sodanrc@yahoo.com.br std::vector<CacheBlk*>& evict_blks) const 2002810Srdreslin@umich.edu{ 20112744Sodanrc@yahoo.com.br // The victim is always stored on the tail for the FALRU 20212744Sodanrc@yahoo.com.br FALRUBlk* victim = tail; 20312744Sodanrc@yahoo.com.br 20412744Sodanrc@yahoo.com.br // There is only one eviction for this replacement 20512744Sodanrc@yahoo.com.br evict_blks.push_back(victim); 20612744Sodanrc@yahoo.com.br 20712744Sodanrc@yahoo.com.br return victim; 2082810Srdreslin@umich.edu} 2092810Srdreslin@umich.edu 2102810Srdreslin@umich.eduvoid 21113215Sodanrc@yahoo.com.brFALRU::insertBlock(const Addr addr, const bool is_secure, 21213215Sodanrc@yahoo.com.br const int src_master_ID, const uint32_t task_ID, 21313215Sodanrc@yahoo.com.br CacheBlk *blk) 2145717Shsul@eecs.umich.edu{ 21512636Sodanrc@yahoo.com.br FALRUBlk* falruBlk = static_cast<FALRUBlk*>(blk); 21612636Sodanrc@yahoo.com.br 21712636Sodanrc@yahoo.com.br // Make sure block is not present in the cache 21812665Snikos.nikoleris@arm.com assert(falruBlk->inCachesMask == 0); 21912636Sodanrc@yahoo.com.br 22012636Sodanrc@yahoo.com.br // Do common block insertion functionality 22113215Sodanrc@yahoo.com.br BaseTags::insertBlock(addr, is_secure, src_master_ID, task_ID, blk); 22212636Sodanrc@yahoo.com.br 22312745Sodanrc@yahoo.com.br // Increment tag counter 22412745Sodanrc@yahoo.com.br tagsInUse++; 22512745Sodanrc@yahoo.com.br 22612636Sodanrc@yahoo.com.br // New block is the MRU 22712636Sodanrc@yahoo.com.br moveToHead(falruBlk); 22812636Sodanrc@yahoo.com.br 22912636Sodanrc@yahoo.com.br // Insert new block in the hash table 23012775Snikos.nikoleris@arm.com tagHash[std::make_pair(blk->tag, blk->isSecure())] = falruBlk; 2315717Shsul@eecs.umich.edu} 2325717Shsul@eecs.umich.edu 2335717Shsul@eecs.umich.eduvoid 2342810Srdreslin@umich.eduFALRU::moveToHead(FALRUBlk *blk) 2352810Srdreslin@umich.edu{ 23612648Sodanrc@yahoo.com.br // If block is not already head, do the moving 23712648Sodanrc@yahoo.com.br if (blk != head) { 23812665Snikos.nikoleris@arm.com cacheTracking.moveBlockToHead(blk); 23912648Sodanrc@yahoo.com.br // If block is tail, set previous block as new tail 2402810Srdreslin@umich.edu if (blk == tail){ 24111484Snikos.nikoleris@arm.com assert(blk->next == nullptr); 2422810Srdreslin@umich.edu tail = blk->prev; 24311484Snikos.nikoleris@arm.com tail->next = nullptr; 24412648Sodanrc@yahoo.com.br // Inform block's surrounding blocks that it has been moved 2452810Srdreslin@umich.edu } else { 2462810Srdreslin@umich.edu blk->prev->next = blk->next; 2472810Srdreslin@umich.edu blk->next->prev = blk->prev; 2482810Srdreslin@umich.edu } 24912648Sodanrc@yahoo.com.br 25012648Sodanrc@yahoo.com.br // Swap pointers 2512810Srdreslin@umich.edu blk->next = head; 25211484Snikos.nikoleris@arm.com blk->prev = nullptr; 2532810Srdreslin@umich.edu head->prev = blk; 2542810Srdreslin@umich.edu head = blk; 25512665Snikos.nikoleris@arm.com 25612665Snikos.nikoleris@arm.com cacheTracking.check(head, tail); 2572810Srdreslin@umich.edu } 2582810Srdreslin@umich.edu} 2592810Srdreslin@umich.edu 26012648Sodanrc@yahoo.com.brvoid 26112648Sodanrc@yahoo.com.brFALRU::moveToTail(FALRUBlk *blk) 26212648Sodanrc@yahoo.com.br{ 26312648Sodanrc@yahoo.com.br // If block is not already tail, do the moving 26412648Sodanrc@yahoo.com.br if (blk != tail) { 26512665Snikos.nikoleris@arm.com cacheTracking.moveBlockToTail(blk); 26612648Sodanrc@yahoo.com.br // If block is head, set next block as new head 26712648Sodanrc@yahoo.com.br if (blk == head){ 26812648Sodanrc@yahoo.com.br assert(blk->prev == nullptr); 26912648Sodanrc@yahoo.com.br head = blk->next; 27012648Sodanrc@yahoo.com.br head->prev = nullptr; 27112648Sodanrc@yahoo.com.br // Inform block's surrounding blocks that it has been moved 27212648Sodanrc@yahoo.com.br } else { 27312648Sodanrc@yahoo.com.br blk->prev->next = blk->next; 27412648Sodanrc@yahoo.com.br blk->next->prev = blk->prev; 27512648Sodanrc@yahoo.com.br } 27612648Sodanrc@yahoo.com.br 27712648Sodanrc@yahoo.com.br // Swap pointers 27812648Sodanrc@yahoo.com.br blk->prev = tail; 27912648Sodanrc@yahoo.com.br blk->next = nullptr; 28012648Sodanrc@yahoo.com.br tail->next = blk; 28112648Sodanrc@yahoo.com.br tail = blk; 28212665Snikos.nikoleris@arm.com 28312665Snikos.nikoleris@arm.com cacheTracking.check(head, tail); 28412648Sodanrc@yahoo.com.br } 28512648Sodanrc@yahoo.com.br} 28612648Sodanrc@yahoo.com.br 2879796Sprakash.ramrakhyani@arm.comFALRU * 2889796Sprakash.ramrakhyani@arm.comFALRUParams::create() 2899796Sprakash.ramrakhyani@arm.com{ 2909796Sprakash.ramrakhyani@arm.com return new FALRU(this); 2919796Sprakash.ramrakhyani@arm.com} 2929796Sprakash.ramrakhyani@arm.com 29312665Snikos.nikoleris@arm.comvoid 29413164Sodanrc@yahoo.com.brFALRU::CacheTracking::check(const FALRUBlk *head, const FALRUBlk *tail) const 29512665Snikos.nikoleris@arm.com{ 29612665Snikos.nikoleris@arm.com#ifdef FALRU_DEBUG 29713164Sodanrc@yahoo.com.br const FALRUBlk* blk = head; 29812665Snikos.nikoleris@arm.com unsigned curr_size = 0; 29912665Snikos.nikoleris@arm.com unsigned tracked_cache_size = minTrackedSize; 30012665Snikos.nikoleris@arm.com CachesMask in_caches_mask = inAllCachesMask; 30112665Snikos.nikoleris@arm.com int j = 0; 30212665Snikos.nikoleris@arm.com 30312665Snikos.nikoleris@arm.com while (blk) { 30412665Snikos.nikoleris@arm.com panic_if(blk->inCachesMask != in_caches_mask, "Expected cache mask " 30512665Snikos.nikoleris@arm.com "%x found %x", blk->inCachesMask, in_caches_mask); 30612665Snikos.nikoleris@arm.com 30712665Snikos.nikoleris@arm.com curr_size += blkSize; 30812665Snikos.nikoleris@arm.com if (curr_size == tracked_cache_size && blk != tail) { 30912665Snikos.nikoleris@arm.com panic_if(boundaries[j] != blk, "Unexpected boundary for the %d-th " 31012665Snikos.nikoleris@arm.com "cache", j); 31112665Snikos.nikoleris@arm.com tracked_cache_size <<= 1; 31212665Snikos.nikoleris@arm.com // from this point, blocks fit only in the larger caches 31312665Snikos.nikoleris@arm.com in_caches_mask &= ~(1U << j); 31412665Snikos.nikoleris@arm.com ++j; 31512665Snikos.nikoleris@arm.com } 31612665Snikos.nikoleris@arm.com blk = blk->next; 31712665Snikos.nikoleris@arm.com } 31812665Snikos.nikoleris@arm.com#endif // FALRU_DEBUG 31912665Snikos.nikoleris@arm.com} 32012665Snikos.nikoleris@arm.com 32112665Snikos.nikoleris@arm.comvoid 32212665Snikos.nikoleris@arm.comFALRU::CacheTracking::init(FALRUBlk *head, FALRUBlk *tail) 32312665Snikos.nikoleris@arm.com{ 32412665Snikos.nikoleris@arm.com // early exit if we are not tracking any extra caches 32512665Snikos.nikoleris@arm.com FALRUBlk* blk = numTrackedCaches ? head : nullptr; 32612665Snikos.nikoleris@arm.com unsigned curr_size = 0; 32712665Snikos.nikoleris@arm.com unsigned tracked_cache_size = minTrackedSize; 32812665Snikos.nikoleris@arm.com CachesMask in_caches_mask = inAllCachesMask; 32912665Snikos.nikoleris@arm.com int j = 0; 33012665Snikos.nikoleris@arm.com 33112665Snikos.nikoleris@arm.com while (blk) { 33212665Snikos.nikoleris@arm.com blk->inCachesMask = in_caches_mask; 33312665Snikos.nikoleris@arm.com 33412665Snikos.nikoleris@arm.com curr_size += blkSize; 33512665Snikos.nikoleris@arm.com if (curr_size == tracked_cache_size && blk != tail) { 33612665Snikos.nikoleris@arm.com boundaries[j] = blk; 33712665Snikos.nikoleris@arm.com 33812665Snikos.nikoleris@arm.com tracked_cache_size <<= 1; 33912665Snikos.nikoleris@arm.com // from this point, blocks fit only in the larger caches 34012665Snikos.nikoleris@arm.com in_caches_mask &= ~(1U << j); 34112665Snikos.nikoleris@arm.com ++j; 34212665Snikos.nikoleris@arm.com } 34312665Snikos.nikoleris@arm.com blk = blk->next; 34412665Snikos.nikoleris@arm.com } 34512665Snikos.nikoleris@arm.com} 34612665Snikos.nikoleris@arm.com 34712665Snikos.nikoleris@arm.com 34812665Snikos.nikoleris@arm.comvoid 34912665Snikos.nikoleris@arm.comFALRU::CacheTracking::moveBlockToHead(FALRUBlk *blk) 35012665Snikos.nikoleris@arm.com{ 35112665Snikos.nikoleris@arm.com // Get the mask of all caches, in which the block didn't fit 35212665Snikos.nikoleris@arm.com // before moving it to the head 35312665Snikos.nikoleris@arm.com CachesMask update_caches_mask = inAllCachesMask ^ blk->inCachesMask; 35412665Snikos.nikoleris@arm.com 35512665Snikos.nikoleris@arm.com for (int i = 0; i < numTrackedCaches; i++) { 35612665Snikos.nikoleris@arm.com CachesMask current_cache_mask = 1U << i; 35712665Snikos.nikoleris@arm.com if (current_cache_mask & update_caches_mask) { 35812665Snikos.nikoleris@arm.com // if the ith cache didn't fit the block (before it is moved to 35912665Snikos.nikoleris@arm.com // the head), move the ith boundary 1 block closer to the 36012665Snikos.nikoleris@arm.com // MRU 36112665Snikos.nikoleris@arm.com boundaries[i]->inCachesMask &= ~current_cache_mask; 36212665Snikos.nikoleris@arm.com boundaries[i] = boundaries[i]->prev; 36312665Snikos.nikoleris@arm.com } else if (boundaries[i] == blk) { 36412665Snikos.nikoleris@arm.com // Make sure the boundary doesn't point to the block 36512665Snikos.nikoleris@arm.com // we are about to move 36612665Snikos.nikoleris@arm.com boundaries[i] = blk->prev; 36712665Snikos.nikoleris@arm.com } 36812665Snikos.nikoleris@arm.com } 36912665Snikos.nikoleris@arm.com 37012665Snikos.nikoleris@arm.com // Make block reside in all caches 37112665Snikos.nikoleris@arm.com blk->inCachesMask = inAllCachesMask; 37212665Snikos.nikoleris@arm.com} 37312665Snikos.nikoleris@arm.com 37412665Snikos.nikoleris@arm.comvoid 37512665Snikos.nikoleris@arm.comFALRU::CacheTracking::moveBlockToTail(FALRUBlk *blk) 37612665Snikos.nikoleris@arm.com{ 37712665Snikos.nikoleris@arm.com CachesMask update_caches_mask = blk->inCachesMask; 37812665Snikos.nikoleris@arm.com 37912665Snikos.nikoleris@arm.com for (int i = 0; i < numTrackedCaches; i++) { 38012665Snikos.nikoleris@arm.com CachesMask current_cache_mask = 1U << i; 38112665Snikos.nikoleris@arm.com if (current_cache_mask & update_caches_mask) { 38212665Snikos.nikoleris@arm.com // if the ith cache fitted the block (before it is moved to 38312665Snikos.nikoleris@arm.com // the tail), move the ith boundary 1 block closer to the 38412665Snikos.nikoleris@arm.com // LRU 38512665Snikos.nikoleris@arm.com boundaries[i] = boundaries[i]->next; 38612665Snikos.nikoleris@arm.com if (boundaries[i] == blk) { 38712665Snikos.nikoleris@arm.com // Make sure the boundary doesn't point to the block 38812665Snikos.nikoleris@arm.com // we are about to move 38912665Snikos.nikoleris@arm.com boundaries[i] = blk->next; 39012665Snikos.nikoleris@arm.com } 39112665Snikos.nikoleris@arm.com boundaries[i]->inCachesMask |= current_cache_mask; 39212665Snikos.nikoleris@arm.com } 39312665Snikos.nikoleris@arm.com } 39412665Snikos.nikoleris@arm.com 39512665Snikos.nikoleris@arm.com // The block now fits only in the actual cache 39612665Snikos.nikoleris@arm.com blk->inCachesMask = 0; 39712665Snikos.nikoleris@arm.com} 39812665Snikos.nikoleris@arm.com 39912665Snikos.nikoleris@arm.comvoid 40012665Snikos.nikoleris@arm.comFALRU::CacheTracking::recordAccess(FALRUBlk *blk) 40112665Snikos.nikoleris@arm.com{ 40212665Snikos.nikoleris@arm.com for (int i = 0; i < numTrackedCaches; i++) { 40312665Snikos.nikoleris@arm.com if (blk && ((1U << i) & blk->inCachesMask)) { 40412665Snikos.nikoleris@arm.com hits[i]++; 40512665Snikos.nikoleris@arm.com } else { 40612665Snikos.nikoleris@arm.com misses[i]++; 40712665Snikos.nikoleris@arm.com } 40812665Snikos.nikoleris@arm.com } 40912665Snikos.nikoleris@arm.com 41012665Snikos.nikoleris@arm.com // Record stats for the actual cache too 41112775Snikos.nikoleris@arm.com if (blk && blk->isValid()) { 41212665Snikos.nikoleris@arm.com hits[numTrackedCaches]++; 41312665Snikos.nikoleris@arm.com } else { 41412665Snikos.nikoleris@arm.com misses[numTrackedCaches]++; 41512665Snikos.nikoleris@arm.com } 41612665Snikos.nikoleris@arm.com 41712665Snikos.nikoleris@arm.com accesses++; 41812665Snikos.nikoleris@arm.com} 41912665Snikos.nikoleris@arm.com 42012665Snikos.nikoleris@arm.comvoid 42112665Snikos.nikoleris@arm.comprintSize(std::ostream &stream, size_t size) 42212665Snikos.nikoleris@arm.com{ 42312665Snikos.nikoleris@arm.com static const char *SIZES[] = { "B", "kB", "MB", "GB", "TB", "ZB" }; 42412665Snikos.nikoleris@arm.com int div = 0; 42512665Snikos.nikoleris@arm.com while (size >= 1024 && div < (sizeof SIZES / sizeof *SIZES)) { 42612665Snikos.nikoleris@arm.com div++; 42712665Snikos.nikoleris@arm.com size >>= 10; 42812665Snikos.nikoleris@arm.com } 42912665Snikos.nikoleris@arm.com stream << size << SIZES[div]; 43012665Snikos.nikoleris@arm.com} 43112665Snikos.nikoleris@arm.com 43212665Snikos.nikoleris@arm.comvoid 43312665Snikos.nikoleris@arm.comFALRU::CacheTracking::regStats(std::string name) 43412665Snikos.nikoleris@arm.com{ 43512665Snikos.nikoleris@arm.com hits 43612665Snikos.nikoleris@arm.com .init(numTrackedCaches + 1) 43712665Snikos.nikoleris@arm.com .name(name + ".falru_hits") 43812665Snikos.nikoleris@arm.com .desc("The number of hits in each cache size.") 43912665Snikos.nikoleris@arm.com ; 44012665Snikos.nikoleris@arm.com misses 44112665Snikos.nikoleris@arm.com .init(numTrackedCaches + 1) 44212665Snikos.nikoleris@arm.com .name(name + ".falru_misses") 44312665Snikos.nikoleris@arm.com .desc("The number of misses in each cache size.") 44412665Snikos.nikoleris@arm.com ; 44512665Snikos.nikoleris@arm.com accesses 44612665Snikos.nikoleris@arm.com .name(name + ".falru_accesses") 44712665Snikos.nikoleris@arm.com .desc("The number of accesses to the FA LRU cache.") 44812665Snikos.nikoleris@arm.com ; 44912665Snikos.nikoleris@arm.com 45012665Snikos.nikoleris@arm.com for (unsigned i = 0; i < numTrackedCaches + 1; ++i) { 45112665Snikos.nikoleris@arm.com std::stringstream size_str; 45212665Snikos.nikoleris@arm.com printSize(size_str, minTrackedSize << i); 45312665Snikos.nikoleris@arm.com hits.subname(i, size_str.str()); 45412665Snikos.nikoleris@arm.com hits.subdesc(i, "Hits in a " + size_str.str() + " cache"); 45512665Snikos.nikoleris@arm.com misses.subname(i, size_str.str()); 45612665Snikos.nikoleris@arm.com misses.subdesc(i, "Misses in a " + size_str.str() + " cache"); 45712665Snikos.nikoleris@arm.com } 45812665Snikos.nikoleris@arm.com} 459