src/mem/cache/tags/random_repl.cc

   1 /*
   2  * Copyright (c) 2014 The Regents of The University of Michigan
   3  * All rights reserved.
   4  *
   5  * Redistribution and use in source and binary forms, with or without
   6  * modification, are permitted provided that the following conditions are
   7  * met: redistributions of source code must retain the above copyright
   8  * notice, this list of conditions and the following disclaimer;
   9  * redistributions in binary form must reproduce the above copyright
  10  * notice, this list of conditions and the following disclaimer in the
  11  * documentation and/or other materials provided with the distribution;
  12  * neither the name of the copyright holders nor the names of its
  13  * contributors may be used to endorse or promote products derived from
  14  * this software without specific prior written permission.
  15  *
  16  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  17  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  18  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  19  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  20  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  21  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  22  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  23  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  24  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  25  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  26  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  27  *
  28  * Authors: Anthony Gutierrez
  29  */
  30
  31 /**
  32  * @file
  33  * Definitions of a random replacement tag store.
  34  */
  35
  36 #include "base/random.hh"
  37 #include "debug/CacheRepl.hh"
  38 #include "mem/cache/tags/random_repl.hh"
  39 #include "mem/cache/base.hh"
  40
  41 RandomRepl::RandomRepl(const Params *p)
  42     : BaseSetAssoc(p)
  43
  44 {
  45 }
  46
  47 CacheBlk*
  48 RandomRepl::accessBlock(Addr addr, bool is_secure, Cycles &lat, int master_id)
  49 {
  50     return BaseSetAssoc::accessBlock(addr, is_secure, lat, master_id);
  51 }
  52
  53 CacheBlk*
  54 RandomRepl::findVictim(Addr addr)
  55 {
  56     CacheBlk *blk = BaseSetAssoc::findVictim(addr);
  57     unsigned set = extractSet(addr);
  58
  59     // if all blocks are valid, pick a replacement at random
  60     if (blk && blk->isValid()) {
  61         // find a random index within the bounds of the set
  62         int idx = random_mt.random<int>(0, assoc - 1);
  63         blk = sets[set].blks[idx];
  64         // Enforce allocation limit
  65         while (blk->way >= allocAssoc) {
  66             idx = (idx + 1) % assoc;
  67             blk = sets[set].blks[idx];
  68         }
  69
  70         assert(idx < assoc);
  71         assert(idx >= 0);
  72         assert(blk->way < allocAssoc);
  73
  74         DPRINTF(CacheRepl, "set %x: selecting blk %x for replacement\n",
  75                 blk->set, regenerateBlkAddr(blk->tag, blk->set));
  76     }
  77
  78     return blk;
  79 }
  80
  81 void
  82 RandomRepl::insertBlock(PacketPtr pkt, BlkType *blk)
  83 {
  84     BaseSetAssoc::insertBlock(pkt, blk);
  85 }
  86
  87 void
  88 RandomRepl::invalidate(CacheBlk *blk)
  89 {
  90     BaseSetAssoc::invalidate(blk);
  91 }
  92
  93 RandomRepl*
  94 RandomReplParams::create()
  95 {
  96     return new RandomRepl(this);
  97 }