mem: Delete authors lists from mem files.
[gem5.git] / src / mem / cache / compressors / base_dictionary_compressor.cc
1 /*
2 * Copyright (c) 2018-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
29 /** @file
30 * Implementation of a base sim object for the templated dictionary-based
31 * cache compressor.
32 */
33
34 #include "mem/cache/compressors/dictionary_compressor.hh"
35 #include "params/BaseDictionaryCompressor.hh"
36
37 BaseDictionaryCompressor::BaseDictionaryCompressor(const Params *p)
38 : BaseCacheCompressor(p), dictionarySize(p->dictionary_size), numEntries(0)
39 {
40 }
41
42 void
43 BaseDictionaryCompressor::regStats()
44 {
45 BaseCacheCompressor::regStats();
46
47 // We store the frequency of each pattern
48 patternStats
49 .init(getNumPatterns())
50 .name(name() + ".pattern")
51 .desc("Number of data entries that were compressed to this pattern.")
52 ;
53
54 for (unsigned i = 0; i < getNumPatterns(); ++i) {
55 patternStats.subname(i, getName(i));
56 patternStats.subdesc(i, "Number of data entries that match pattern " +
57 getName(i));
58 }
59 }