src/mem/cache/compressors/base.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  * Definition of a basic cache compressor.
  33  */
  34
  35 #include "mem/cache/compressors/base.hh"
  36
  37 #include <algorithm>
  38 #include <cstdint>
  39 #include <string>
  40
  41 #include "debug/CacheComp.hh"
  42 #include "mem/cache/tags/super_blk.hh"
  43 #include "params/BaseCacheCompressor.hh"
  44
  45 // Uncomment this line if debugging compression
  46 //#define DEBUG_COMPRESSION
  47
  48 BaseCacheCompressor::CompressionData::CompressionData()
  49     : _size(0)
  50 {
  51 }
  52
  53 BaseCacheCompressor::CompressionData::~CompressionData()
  54 {
  55 }
  56
  57 void
  58 BaseCacheCompressor::CompressionData::setSizeBits(std::size_t size)
  59 {
  60     _size = size;
  61 }
  62
  63 std::size_t
  64 BaseCacheCompressor::CompressionData::getSizeBits() const
  65 {
  66     return _size;
  67 }
  68
  69 std::size_t
  70 BaseCacheCompressor::CompressionData::getSize() const
  71 {
  72     return std::ceil(_size/8);
  73 }
  74
  75 BaseCacheCompressor::BaseCacheCompressor(const Params *p)
  76     : SimObject(p), blkSize(p->block_size)
  77 {
  78 }
  79
  80 void
  81 BaseCacheCompressor::compress(const uint64_t* data, Cycles& comp_lat,
  82                               Cycles& decomp_lat, std::size_t& comp_size_bits)
  83 {
  84     // Apply compression
  85     std::unique_ptr<CompressionData> comp_data =
  86         compress(data, comp_lat, decomp_lat);
  87
  88     // If we are in debug mode apply decompression just after the compression.
  89     // If the results do not match, we've got an error
  90     #ifdef DEBUG_COMPRESSION
  91     uint64_t decomp_data[blkSize/8];
  92
  93     // Apply decompression
  94     decompress(comp_data.get(), decomp_data);
  95
  96     // Check if decompressed line matches original cache line
  97     fatal_if(std::memcmp(data, decomp_data, blkSize),
  98              "Decompressed line does not match original line.");
  99     #endif
 100
 101     // Get compression size
 102     comp_size_bits = comp_data->getSizeBits();
 103
 104     // Update stats
 105     compressionSize[std::ceil(std::log2(comp_size_bits))]++;
 106
 107     // Print debug information
 108     DPRINTF(CacheComp, "Compressed cache line from %d to %d bits. " \
 109             "Compression latency: %llu, decompression latency: %llu\n",
 110             blkSize*8, comp_size_bits, comp_lat, decomp_lat);
 111 }
 112
 113 Cycles
 114 BaseCacheCompressor::getDecompressionLatency(const CacheBlk* blk)
 115 {
 116     const CompressionBlk* comp_blk = static_cast<const CompressionBlk*>(blk);
 117
 118     // If block is compressed, return its decompression latency
 119     if (comp_blk && comp_blk->isCompressed()){
 120         return comp_blk->getDecompressionLatency();
 121     }
 122
 123     // Block is not compressed, so there is no decompression latency
 124     return Cycles(0);
 125 }
 126
 127 void
 128 BaseCacheCompressor::setDecompressionLatency(CacheBlk* blk, const Cycles lat)
 129 {
 130     // Sanity check
 131     assert(blk != nullptr);
 132
 133     // Assign latency
 134     static_cast<CompressionBlk*>(blk)->setDecompressionLatency(lat);
 135 }
 136
 137 void
 138 BaseCacheCompressor::setSizeBits(CacheBlk* blk, const std::size_t size_bits)
 139 {
 140     // Sanity check
 141     assert(blk != nullptr);
 142
 143     // Assign size
 144     static_cast<CompressionBlk*>(blk)->setSizeBits(size_bits);
 145 }
 146
 147 void
 148 BaseCacheCompressor::regStats()
 149 {
 150     SimObject::regStats();
 151
 152     // We also store when compression is bigger than original block size
 153     compressionSize
 154         .init(std::log2(blkSize*8) + 2)
 155         .name(name() + ".compression_size")
 156         .desc("Number of blocks that were compressed to this power of" \
 157               "two size.")
 158         ;
 159
 160     for (unsigned i = 0; i <= std::log2(blkSize*8) + 1; ++i) {
 161         compressionSize.subname(i, std::to_string(1 << i));
 162         compressionSize.subdesc(i, "Number of blocks that compressed to fit " \
 163                                    "in " + std::to_string(1 << i) + " bits");
 164     }
 165 }
 166