1/**
2 * Copyright (c) 2018 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 * Authors: Daniel Carvalho
29 */
30
31#include "mem/cache/replacement_policies/mru_rp.hh"
32
| 1/**
2 * Copyright (c) 2018 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 * Authors: Daniel Carvalho
29 */
30
31#include "mem/cache/replacement_policies/mru_rp.hh"
32
|
33#include "debug/CacheRepl.hh"
| 33#include <memory>
|
34
35MRURP::MRURP(const Params *p)
36 : BaseReplacementPolicy(p)
37{
38}
39
40void
| 34
35MRURP::MRURP(const Params *p)
36 : BaseReplacementPolicy(p)
37{
38}
39
40void
|
41MRURP::touch(CacheBlk *blk)
| 41MRURP::invalidate(const std::shared_ptr<ReplacementData>& replacement_data)
42const
|
42{
| 43{
|
43 BaseReplacementPolicy::touch(blk);
| 44 // Reset last touch timestamp
45 std::static_pointer_cast<MRUReplData>(
46 replacement_data)->lastTouchTick = Tick(0);
47}
|
44
| 48
|
| 49void
50MRURP::touch(const std::shared_ptr<ReplacementData>& replacement_data) const
51{
|
45 // Update last touch timestamp
| 52 // Update last touch timestamp
|
46 blk->lastTouchTick = curTick();
| 53 std::static_pointer_cast<MRUReplData>(
54 replacement_data)->lastTouchTick = curTick();
|
47}
48
49void
| 55}
56
57void
|
50MRURP::reset(CacheBlk *blk)
| 58MRURP::reset(const std::shared_ptr<ReplacementData>& replacement_data) const
|
51{
| 59{
|
52 BaseReplacementPolicy::reset(blk);
53
| |
54 // Set last touch timestamp
| 60 // Set last touch timestamp
|
55 blk->lastTouchTick = blk->tickInserted;
| 61 std::static_pointer_cast<MRUReplData>(
62 replacement_data)->lastTouchTick = curTick();
|
56}
57
| 63}
64
|
58CacheBlk*
59MRURP::getVictim(const ReplacementCandidates& candidates)
| 65ReplaceableEntry*
66MRURP::getVictim(const ReplacementCandidates& candidates) const
|
60{
61 // There must be at least one replacement candidate
62 assert(candidates.size() > 0);
63
64 // Visit all candidates to find victim
| 67{
68 // There must be at least one replacement candidate
69 assert(candidates.size() > 0);
70
71 // Visit all candidates to find victim
|
65 CacheBlk* blk = candidates[0];
| 72 ReplaceableEntry* victim = candidates[0];
|
66 for (const auto& candidate : candidates) {
| 73 for (const auto& candidate : candidates) {
|
67 // Stop iteration if found an invalid block
68 if (!candidate->isValid()) {
69 blk = candidate;
70 break;
71 // Update victim block if necessary
72 } else if (candidate->lastTouchTick > blk->lastTouchTick) {
73 blk = candidate;
| 74 // Update victim entry if necessary
75 if (std::static_pointer_cast<MRUReplData>(
76 candidate->replacementData)->lastTouchTick >
77 std::static_pointer_cast<MRUReplData>(
78 victim->replacementData)->lastTouchTick) {
79 victim = candidate;
|
74 }
75 }
76
| 80 }
81 }
82
|
77 DPRINTF(CacheRepl, "set %x, way %x: selecting blk for replacement\n",
78 blk->set, blk->way);
| 83 return victim;
84}
|
79
| 85
|
80 return blk;
| 86std::shared_ptr<ReplacementData>
87MRURP::instantiateEntry()
88{
89 return std::shared_ptr<ReplacementData>(new MRUReplData());
|
81}
82
83MRURP*
84MRURPParams::create()
85{
86 return new MRURP(this);
87}
| 90}
91
92MRURP*
93MRURPParams::create()
94{
95 return new MRURP(this);
96}
|