gem5  v19.0.0.0
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
perfect.hh
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2019 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 
36 #ifndef __MEM_CACHE_COMPRESSORS_PERFECT_COMPRESSOR_HH__
37 #define __MEM_CACHE_COMPRESSORS_PERFECT_COMPRESSOR_HH__
38 
39 #include <cstdint>
40 #include <memory>
41 #include <vector>
42 
43 #include "base/types.hh"
45 
46 struct PerfectCompressorParams;
47 
49 {
50  protected:
51  class CompData;
52 
54  const int compressedSize;
55 
58 
61 
62  std::unique_ptr<CompressionData> compress(const uint64_t* cache_line,
63  Cycles& comp_lat, Cycles& decomp_lat) override;
64 
65  void decompress(const CompressionData* comp_data, uint64_t* data) override;
66 
67  public:
68  typedef PerfectCompressorParams Params;
69  PerfectCompressor(const Params *p);
71 };
72 
74 {
75  public:
78 
85  CompData(const uint64_t* data, std::size_t num_entries);
86  ~CompData() = default;
87 };
88 
89 #endif //__MEM_CACHE_COMPRESSORS_PERFECT_COMPRESSOR_HH__
Cycles is a wrapper class for representing cycle counts, i.e.
Definition: types.hh:83
CompData(const uint64_t *data, std::size_t num_entries)
Default constructor that creates a copy of the original data.
Definition: perfect.cc:43
PerfectCompressorParams Params
Definition: perfect.hh:68
std::unique_ptr< CompressionData > compress(const uint64_t *cache_line, Cycles &comp_lat, Cycles &decomp_lat) override
Apply the compression process to the cache line.
Definition: perfect.cc:58
Definition of a basic cache compressor.
Defines global host-dependent types: Counter, Tick, and (indirectly) {int,uint}{8,16,32,64}_t.
Base cache compressor interface.
Definition: base.hh:54
PerfectCompressor(const Params *p)
Definition: perfect.cc:49
const Cycles compressionLatency
Number of cycles needed to perform compression.
Definition: perfect.hh:57
void decompress(const CompressionData *comp_data, uint64_t *data) override
Apply the decompression process to the compressed data.
Definition: perfect.cc:74
const Cycles decompressionLatency
Number of cycles needed to perform decompression.
Definition: perfect.hh:60
std::vector< uint64_t > entries
The original data is simply copied over to this vector.
Definition: perfect.hh:77
Bitfield< 0 > p
const int compressedSize
Size to which this compressor always compresses.
Definition: perfect.hh:51
const char data[]

Generated on Fri Feb 28 2020 16:27:01 for gem5 by doxygen 1.8.13