gem5  v20.1.0.0
base.hh
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2018 Inria
3  * Copyright (c) 2012-2014,2017 ARM Limited
4  * All rights reserved.
5  *
6  * The license below extends only to copyright in the software and shall
7  * not be construed as granting a license to any other intellectual
8  * property including but not limited to intellectual property relating
9  * to a hardware implementation of the functionality of the software
10  * licensed hereunder. You may use the software subject to the license
11  * terms below provided that you ensure that this notice is replicated
12  * unmodified and in its entirety in all distributions of the software,
13  * modified or unmodified, in source code or in binary form.
14  *
15  * Copyright (c) 2003-2005,2014 The Regents of The University of Michigan
16  * All rights reserved.
17  *
18  * Redistribution and use in source and binary forms, with or without
19  * modification, are permitted provided that the following conditions are
20  * met: redistributions of source code must retain the above copyright
21  * notice, this list of conditions and the following disclaimer;
22  * redistributions in binary form must reproduce the above copyright
23  * notice, this list of conditions and the following disclaimer in the
24  * documentation and/or other materials provided with the distribution;
25  * neither the name of the copyright holders nor the names of its
26  * contributors may be used to endorse or promote products derived from
27  * this software without specific prior written permission.
28  *
29  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
30  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
31  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
32  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
33  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
34  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
35  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
36  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
37  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
38  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
39  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
40  */
41 
47 #ifndef __MEM_CACHE_INDEXING_POLICIES_BASE_HH__
48 #define __MEM_CACHE_INDEXING_POLICIES_BASE_HH__
49 
50 #include <vector>
51 
52 #include "params/BaseIndexingPolicy.hh"
53 #include "sim/sim_object.hh"
54 
55 class ReplaceableEntry;
56 
64 {
65  protected:
69  const unsigned assoc;
70 
74  const uint32_t numSets;
75 
79  const int setShift;
80 
84  const unsigned setMask;
85 
90 
94  const int tagShift;
95 
96  public:
100  typedef BaseIndexingPolicyParams Params;
101 
105  BaseIndexingPolicy(const Params *p);
106 
111 
118  void setEntry(ReplaceableEntry* entry, const uint64_t index);
119 
128  ReplaceableEntry* getEntry(const uint32_t set, const uint32_t way) const;
129 
136  virtual Addr extractTag(const Addr addr) const;
137 
147  const = 0;
148 
156  virtual Addr regenerateAddr(const Addr tag, const ReplaceableEntry* entry)
157  const = 0;
158 };
159 
160 #endif //__MEM_CACHE_INDEXING_POLICIES_BASE_HH__
ReplaceableEntry
A replaceable entry is a basic entry in a 2d table-like structure that needs to have replacement func...
Definition: replaceable_entry.hh:53
MipsISA::index
Bitfield< 30, 0 > index
Definition: pra_constants.hh:44
BaseIndexingPolicy::setMask
const unsigned setMask
Mask out all bits that aren't part of the set index.
Definition: base.hh:84
BaseIndexingPolicy::regenerateAddr
virtual Addr regenerateAddr(const Addr tag, const ReplaceableEntry *entry) const =0
Regenerate an entry's address from its tag and assigned indexing bits.
BaseIndexingPolicy::getEntry
ReplaceableEntry * getEntry(const uint32_t set, const uint32_t way) const
Get an entry based on its set and way.
Definition: base.cc:72
BaseIndexingPolicy::~BaseIndexingPolicy
~BaseIndexingPolicy()
Destructor.
Definition: base.hh:110
std::vector
STL vector class.
Definition: stl.hh:37
BaseIndexingPolicy::sets
std::vector< std::vector< ReplaceableEntry * > > sets
The cache sets.
Definition: base.hh:89
sim_object.hh
BaseIndexingPolicy::BaseIndexingPolicy
BaseIndexingPolicy(const Params *p)
Construct and initialize this policy.
Definition: base.cc:55
BaseIndexingPolicy::setEntry
void setEntry(ReplaceableEntry *entry, const uint64_t index)
Associate a pointer to an entry to its physical counterpart.
Definition: base.cc:78
BaseIndexingPolicy::extractTag
virtual Addr extractTag(const Addr addr) const
Generate the tag from the given address.
Definition: base.cc:96
Addr
uint64_t Addr
Address type This will probably be moved somewhere else in the near future.
Definition: types.hh:142
BaseIndexingPolicy::getPossibleEntries
virtual std::vector< ReplaceableEntry * > getPossibleEntries(const Addr addr) const =0
Find all possible entries for insertion and replacement of an address.
BaseIndexingPolicy::setShift
const int setShift
The amount to shift the address to get the set.
Definition: base.hh:79
BaseIndexingPolicy::tagShift
const int tagShift
The amount to shift the address to get the tag.
Definition: base.hh:94
BaseIndexingPolicy::Params
BaseIndexingPolicyParams Params
Convenience typedef.
Definition: base.hh:100
addr
ip6_addr_t addr
Definition: inet.hh:423
BaseIndexingPolicy::assoc
const unsigned assoc
The associativity.
Definition: base.hh:69
BaseIndexingPolicy
A common base class for indexing table locations.
Definition: base.hh:63
MipsISA::p
Bitfield< 0 > p
Definition: pra_constants.hh:323
BaseIndexingPolicy::numSets
const uint32_t numSets
The number of sets in the cache.
Definition: base.hh:74
SimObject
Abstract superclass for simulation objects.
Definition: sim_object.hh:92

Generated on Wed Sep 30 2020 14:02:07 for gem5 by doxygen 1.8.17