gem5
v24.1.0.1
Toggle main menu visibility
Main Page
Related Pages
Topics
Namespaces
Namespace List
Namespace Members
All
_
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
Functions
_
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
Variables
_
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
Typedefs
_
a
b
c
d
e
f
g
h
i
l
m
n
o
p
q
r
s
t
u
v
w
x
Enumerations
_
a
b
c
d
e
f
g
h
i
k
l
m
o
p
q
r
s
t
v
x
Enumerator
_
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
Classes
Class List
Class Index
Class Hierarchy
Class Members
All
:
_
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
~
Functions
_
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
~
Variables
_
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
Typedefs
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
q
r
s
t
u
v
w
y
Enumerations
a
b
c
d
e
f
g
h
i
l
m
n
o
p
r
s
t
u
w
Enumerator
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
q
r
s
t
u
v
w
x
z
Related Symbols
:
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
q
r
s
t
u
v
w
x
Files
File List
File Members
All
_
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
q
r
s
t
u
v
w
x
Functions
a
b
c
d
e
f
g
h
i
l
m
n
o
p
s
t
v
w
Variables
a
b
c
d
e
f
g
h
i
l
m
n
o
p
r
s
t
u
v
w
Typedefs
a
b
c
d
g
h
i
l
m
r
s
t
u
w
Enumerations
b
h
i
o
p
Enumerator
h
i
o
Macros
_
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
q
r
s
t
u
v
w
x
•
All
Classes
Namespaces
Files
Functions
Variables
Typedefs
Enumerations
Enumerator
Friends
Macros
Modules
Pages
Loading...
Searching...
No Matches
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
namespace
gem5
52
{
53
54
SetAssociative::SetAssociative
(
const
Params
&
p
)
55
:
BaseIndexingPolicy
(
p
,
p
.size /
p
.entry_size,
floorLog2
(
p
.entry_size))
56
{
57
}
54
SetAssociative::SetAssociative
(
const
Params
&
p
) {
…
}
58
59
uint32_t
60
SetAssociative::extractSet
(
const
Addr
addr
)
const
61
{
62
return
(
addr
>>
setShift
) &
setMask
;
63
}
60
SetAssociative::extractSet
(
const
Addr
addr
)
const
{
…
}
64
65
Addr
66
SetAssociative::regenerateAddr
(
const
Addr
&tag,
67
const
ReplaceableEntry
* entry)
const
68
{
69
return
(tag <<
tagShift
) | (entry->
getSet
() <<
setShift
);
70
}
66
SetAssociative::regenerateAddr
(
const
Addr
&tag, {
…
}
71
72
std::vector<ReplaceableEntry*>
73
SetAssociative::getPossibleEntries
(
const
Addr
&
addr
)
const
74
{
75
return
sets
[
extractSet
(
addr
)];
76
}
73
SetAssociative::getPossibleEntries
(
const
Addr
&
addr
)
const
{
…
}
77
78
}
// namespace gem5
gem5::IndexingPolicyTemplate
A common base class for indexing table locations.
Definition
base.hh:73
gem5::IndexingPolicyTemplate::tagShift
const int tagShift
The amount to shift the address to get the tag.
Definition
base.hh:106
gem5::IndexingPolicyTemplate::sets
std::vector< std::vector< ReplaceableEntry * > > sets
The cache sets.
Definition
base.hh:101
gem5::IndexingPolicyTemplate::setMask
const unsigned setMask
Mask out all bits that aren't part of the set index.
Definition
base.hh:96
gem5::IndexingPolicyTemplate::setShift
const int setShift
The amount to shift the address to get the set.
Definition
base.hh:91
gem5::ReplaceableEntry
A replaceable entry is a basic entry in a 2d table-like structure that needs to have replacement func...
Definition
replaceable_entry.hh:63
gem5::ReplaceableEntry::getSet
uint32_t getSet() const
Get set number.
Definition
replaceable_entry.hh:103
gem5::SetAssociative::SetAssociative
SetAssociative(const Params &p)
Construct and initialize this policy.
Definition
set_associative.cc:54
gem5::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:66
gem5::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:73
gem5::SetAssociative::extractSet
virtual uint32_t extractSet(const Addr addr) const
Apply a hash function to calculate address set.
Definition
set_associative.cc:60
gem5::SetAssociative::Params
SetAssociativeParams Params
Convenience typedef.
Definition
set_associative.hh:97
std::vector
STL vector class.
Definition
stl.hh:37
gem5::floorLog2
static constexpr std::enable_if_t< std::is_integral_v< T >, int > floorLog2(T x)
Definition
intmath.hh:59
gem5::MipsISA::p
Bitfield< 0 > p
Definition
pra_constants.hh:326
gem5::X86ISA::addr
Bitfield< 3 > addr
Definition
types.hh:84
gem5
Copyright (c) 2024 Arm Limited All rights reserved.
Definition
binary32.hh:36
gem5::Addr
uint64_t Addr
Address type This will probably be moved somewhere else in the near future.
Definition
types.hh:147
replaceable_entry.hh
set_associative.hh
Declaration of a set associative indexing policy.
Generated on Mon Jan 13 2025 04:28:38 for gem5 by
doxygen
1.9.8