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;

--- 16 unchanged lines hidden (view full) ---

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/lfu_rp.hh"
32
33#include "debug/CacheRepl.hh"
34
35LFURP::LFURP(const Params *p)
36 : BaseReplacementPolicy(p)
37{
38}
39
40CacheBlk*
41LFURP::getVictim(const ReplacementCandidates& candidates)
42{
43 // There must be at least one replacement candidate
44 assert(candidates.size() > 0);
45
46 // Visit all candidates to find victim
47 CacheBlk* blk = candidates[0];
48 for (const auto& candidate : candidates) {
49 // Stop iteration if found an invalid block
50 if (!candidate->isValid()) {
51 blk = candidate;
52 break;
53 // Update victim block if necessary
54 } else if (candidate->refCount < blk->refCount) {
55 blk = candidate;
56 }
57 }
58
59 DPRINTF(CacheRepl, "set %x, way %x: selecting blk for replacement\n",
60 blk->set, blk->way);
61
62 return blk;
63}
64
65LFURP*
66LFURPParams::create()
67{
68 return new LFURP(this);
69}