gem5
v20.1.0.0
mem
cache
tags
indexing_policies
set_associative.cc
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
#include "
mem/cache/tags/indexing_policies/set_associative.hh
"
48
49
#include "
mem/cache/replacement_policies/replaceable_entry.hh
"
50
51
SetAssociative::SetAssociative
(
const
Params
*
p
)
52
:
BaseIndexingPolicy
(
p
)
53
{
54
}
55
56
uint32_t
57
SetAssociative::extractSet
(
const
Addr
addr
)
const
58
{
59
return
(
addr
>>
setShift
) &
setMask
;
60
}
61
62
Addr
63
SetAssociative::regenerateAddr
(
const
Addr
tag,
const
ReplaceableEntry
* entry)
64
const
65
{
66
return
(tag <<
tagShift
) | (entry->
getSet
() <<
setShift
);
67
}
68
69
std::vector<ReplaceableEntry*>
70
SetAssociative::getPossibleEntries
(
const
Addr
addr
)
const
71
{
72
return
sets
[
extractSet
(
addr
)];
73
}
74
75
SetAssociative
*
76
SetAssociativeParams::create()
77
{
78
return
new
SetAssociative
(
this
);
79
}
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
BaseIndexingPolicy::setMask
const unsigned setMask
Mask out all bits that aren't part of the set index.
Definition:
base.hh:84
ReplaceableEntry::getSet
uint32_t getSet() const
Get set number.
Definition:
replaceable_entry.hh:94
std::vector
STL vector class.
Definition:
stl.hh:37
BaseIndexingPolicy::sets
std::vector< std::vector< ReplaceableEntry * > > sets
The cache sets.
Definition:
base.hh:89
set_associative.hh
replaceable_entry.hh
SetAssociative
A set associative indexing policy.
Definition:
set_associative.hh:79
SetAssociative::SetAssociative
SetAssociative(const Params *p)
Construct and initialize this policy.
Definition:
set_associative.cc:51
Addr
uint64_t Addr
Address type This will probably be moved somewhere else in the near future.
Definition:
types.hh:142
SetAssociative::getPossibleEntries
std::vector< ReplaceableEntry * > getPossibleEntries(const Addr addr) const override
Find all possible entries for insertion and replacement of an address.
Definition:
set_associative.cc:70
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
SetAssociative::extractSet
virtual uint32_t extractSet(const Addr addr) const
Apply a hash function to calculate address set.
Definition:
set_associative.cc:57
SetAssociative::regenerateAddr
Addr regenerateAddr(const Addr tag, const ReplaceableEntry *entry) const override
Regenerate an entry's address from its tag and assigned set and way.
Definition:
set_associative.cc:63
addr
ip6_addr_t addr
Definition:
inet.hh:423
BaseIndexingPolicy
A common base class for indexing table locations.
Definition:
base.hh:63
MipsISA::p
Bitfield< 0 > p
Definition:
pra_constants.hh:323
Generated on Wed Sep 30 2020 14:02:12 for gem5 by
doxygen
1.8.17