src/mem/cache/sector_blk.cc

   1 /**
   2  * Copyright (c) 2018 Inria
   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: Daniel Carvalho
  29  */
  30
  31 /** @file
  32  * Implementation of a simple sector block class. Each sector consists of a
  33  * sequence of cache blocks that may or may not be present in the cache.
  34  */
  35
  36 #include "mem/cache/sector_blk.hh"
  37
  38 #include <cassert>
  39
  40 #include "base/logging.hh"
  41
  42 void
  43 SectorSubBlk::setSectorBlock(SectorBlk* sector_blk)
  44 {
  45     assert(sector_blk != nullptr);
  46     _sectorBlk = sector_blk;
  47 }
  48
  49 const SectorBlk*
  50 SectorSubBlk::getSectorBlock() const
  51 {
  52     return _sectorBlk;
  53 }
  54
  55 void
  56 SectorSubBlk::setSectorOffset(const int sector_offset)
  57 {
  58     _sectorOffset = sector_offset;
  59 }
  60
  61 int
  62 SectorSubBlk::getSectorOffset() const
  63 {
  64     return _sectorOffset;
  65 }
  66
  67 Addr
  68 SectorSubBlk::getTag() const
  69 {
  70     return _sectorBlk->getTag();
  71 }
  72
  73 void
  74 SectorSubBlk::insert(const Addr tag, const bool is_secure,
  75                      const int src_master_ID, const uint32_t task_ID)
  76 {
  77     // Make sure it is not overwriting another sector
  78     panic_if((_sectorBlk && _sectorBlk->isValid()) &&
  79              ((_sectorBlk->getTag() != tag) ||
  80               (_sectorBlk->isSecure() != is_secure)),
  81               "Overwriting valid sector!");
  82
  83     CacheBlk::insert(tag, is_secure, src_master_ID, task_ID);
  84
  85     // Set sector tag
  86     _sectorBlk->setTag(tag);
  87 }
  88
  89 bool
  90 SectorBlk::isValid() const
  91 {
  92     // If any of the blocks in the sector is valid, so is the sector
  93     for (const auto& blk : blks) {
  94         if (blk->isValid()) {
  95             return true;
  96         }
  97     }
  98     return false;
  99 }
 100
 101 bool
 102 SectorBlk::isSecure() const
 103 {
 104     // If any of the valid blocks in the sector is secure, so is the sector
 105     for (const auto& blk : blks) {
 106         if (blk->isValid()) {
 107             return blk->isSecure();
 108         }
 109     }
 110     return false;
 111 }
 112
 113 void
 114 SectorBlk::setTag(const Addr tag)
 115 {
 116     _tag = tag;
 117 }
 118
 119 Addr
 120 SectorBlk::getTag() const
 121 {
 122     return _tag;
 123 }