1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
|
/*
* Copyright (c) 2018 Inria
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met: redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer;
* redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution;
* neither the name of the copyright holders nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* Authors: Daniel Carvalho
*/
/** @file
* Definition of a basic cache compressor.
* A cache compressor must consist of a compression and a decompression
* methods. It must also be aware of the size of an uncompressed cache
* line.
*/
#ifndef __MEM_CACHE_COMPRESSORS_BASE_HH__
#define __MEM_CACHE_COMPRESSORS_BASE_HH__
#include <cstdint>
#include "base/statistics.hh"
#include "base/types.hh"
#include "sim/sim_object.hh"
class CacheBlk;
struct BaseCacheCompressorParams;
/**
* Base cache compressor interface. Every cache compressor must implement a
* compression and a decompression method.
*/
class BaseCacheCompressor : public SimObject {
protected:
/**
* Forward declaration of compression data. Every new compressor must
* create a new compression data based on it.
*/
class CompressionData;
/**
* Uncompressed cache line size (in bytes).
*/
const std::size_t blkSize;
/**
* @defgroup CompressionStats Compression specific statistics.
* @{
*/
/** Number of blocks that were compressed to this power of two size. */
Stats::Vector compressionSize;
/**
* @}
*/
/**
* Apply the compression process to the cache line.
* Returns the number of cycles used by the compressor, however it is
* usually covered by a good pipelined execution, and is currently ignored.
* The decompression latency is also returned, in order to avoid
* increasing simulation time and memory consumption.
*
* @param cache_line The cache line to be compressed.
* @param comp_lat Compression latency in number of cycles.
* @param decomp_lat Decompression latency in number of cycles.
* @return Cache line after compression.
*/
virtual std::unique_ptr<CompressionData> compress(
const uint64_t* cache_line, Cycles& comp_lat, Cycles& decomp_lat) = 0;
/**
* Apply the decompression process to the compressed data.
*
* @param comp_data Compressed cache line.
* @param cache_line The cache line to be decompressed.
*/
virtual void decompress(const CompressionData* comp_data,
uint64_t* cache_line) = 0;
public:
/** Convenience typedef. */
typedef BaseCacheCompressorParams Params;
/**
* Default constructor.
*/
BaseCacheCompressor(const Params *p);
/**
* Default destructor.
*/
virtual ~BaseCacheCompressor() {};
/**
* Apply the compression process to the cache line. Ignores compression
* cycles.
*
* @param data The cache line to be compressed.
* @param comp_lat Compression latency in number of cycles.
* @param decomp_lat Decompression latency in number of cycles.
* @param comp_size_bits Compressed data size (in bits).
*/
void compress(const uint64_t* data, Cycles& comp_lat,
Cycles& decomp_lat, std::size_t& comp_size_bits);
/**
* Get the decompression latency if the block is compressed. Latency is 0
* otherwise.
*
* @param blk The compressed block.
*/
static Cycles getDecompressionLatency(const CacheBlk* blk);
/**
* Set the decompression latency of compressed block.
*
* @param blk The compressed block.
* @param lat The decompression latency.
*/
static void setDecompressionLatency(CacheBlk* blk, const Cycles lat);
/**
* Set the size of the compressed block, in bits.
*
* @param blk The compressed block.
* @param size_bits The block size.
*/
static void setSizeBits(CacheBlk* blk, const std::size_t size_bits);
/**
* Register local statistics.
*/
void regStats() override;
};
class BaseCacheCompressor::CompressionData {
private:
/**
* Compressed cache line size (in bits).
*/
std::size_t _size;
public:
/**
* Default constructor.
*/
CompressionData();
/**
* Virtual destructor. Without it unique_ptr will cause mem leak.
*/
virtual ~CompressionData();
/**
* Set compression size (in bits).
*
* @param size Compressed data size.
*/
void setSizeBits(std::size_t size);
/**
* Get compression size (in bits).
*
* @return Compressed data size.
*/
std::size_t getSizeBits() const;
/**
* Get compression size (in bytes).
*
* @return Compressed data size.
*/
std::size_t getSize() const;
};
#endif //__MEM_CACHE_COMPRESSORS_BASE_HH__
|
