diff options
author | Daniel R. Carvalho <odanrc@yahoo.com.br> | 2018-03-09 16:44:23 +0100 |
---|---|---|
committer | Daniel Carvalho <odanrc@yahoo.com.br> | 2018-03-30 18:38:17 +0000 |
commit | c2d03ba24f52aec96bf569309a59022e0d4e3c21 (patch) | |
tree | 2cf87a19c6ba796bca4ec1297595b02b4f57e63d /src/mem/cache/replacement_policies/lfu_rp.cc | |
parent | 2b5245bdd8b6cb11462a37528cfe0d6e637aacff (diff) | |
download | gem5-c2d03ba24f52aec96bf569309a59022e0d4e3c21.tar.xz |
mem-cache: Create LFU replacement policy
Implementation of a Least Frequently Used replacement policy.
Change-Id: I772afccd3a7955777e53d59341e922718db44e5c
Reviewed-on: https://gem5-review.googlesource.com/8890
Reviewed-by: Nikos Nikoleris <nikos.nikoleris@arm.com>
Maintainer: Nikos Nikoleris <nikos.nikoleris@arm.com>
Diffstat (limited to 'src/mem/cache/replacement_policies/lfu_rp.cc')
-rw-r--r-- | src/mem/cache/replacement_policies/lfu_rp.cc | 69 |
1 files changed, 69 insertions, 0 deletions
diff --git a/src/mem/cache/replacement_policies/lfu_rp.cc b/src/mem/cache/replacement_policies/lfu_rp.cc new file mode 100644 index 000000000..90a5ee227 --- /dev/null +++ b/src/mem/cache/replacement_policies/lfu_rp.cc @@ -0,0 +1,69 @@ +/** + * 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/lfu_rp.hh" + +#include "debug/CacheRepl.hh" + +LFURP::LFURP(const Params *p) + : BaseReplacementPolicy(p) +{ +} + +CacheBlk* +LFURP::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->refCount < blk->refCount) { + blk = candidate; + } + } + + DPRINTF(CacheRepl, "set %x, way %x: selecting blk for replacement\n", + blk->set, blk->way); + + return blk; +} + +LFURP* +LFURPParams::create() +{ + return new LFURP(this); +} |