1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
|
/**
* Copyright (c) 2018 Inria
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met: redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer;
* redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution;
* neither the name of the copyright holders nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* Authors: Daniel Carvalho
*/
#include "mem/cache/replacement_policies/mru_rp.hh"
#include "debug/CacheRepl.hh"
MRURP::MRURP(const Params *p)
: BaseReplacementPolicy(p)
{
}
void
MRURP::touch(CacheBlk *blk)
{
BaseReplacementPolicy::touch(blk);
// Update last touch timestamp
blk->lastTouchTick = curTick();
}
void
MRURP::reset(CacheBlk *blk)
{
BaseReplacementPolicy::reset(blk);
// Set last touch timestamp
blk->lastTouchTick = blk->tickInserted;
}
CacheBlk*
MRURP::getVictim(const ReplacementCandidates& candidates)
{
// There must be at least one replacement candidate
assert(candidates.size() > 0);
// Visit all candidates to find victim
CacheBlk* blk = candidates[0];
for (const auto& candidate : candidates) {
// Stop iteration if found an invalid block
if (!candidate->isValid()) {
blk = candidate;
break;
// Update victim block if necessary
} else if (candidate->lastTouchTick > blk->lastTouchTick) {
blk = candidate;
}
}
DPRINTF(CacheRepl, "set %x, way %x: selecting blk for replacement\n",
blk->set, blk->way);
return blk;
}
MRURP*
MRURPParams::create()
{
return new MRURP(this);
}
|
