mru_rp.cc

Go to the documentation of this file.

 
#include "mem/cache/replacement_policies/mru_rp.hh"
 
#include <cassert>
#include <memory>
 
#include "params/MRURP.hh"
#include "sim/cur_tick.hh"
 
namespace gem5
{
 
namespace replacement_policy
{
 
MRU::MRU(const Params &p)
  : Base(p)
{
}
 
void
MRU::invalidate(const std::shared_ptr<ReplacementData>& replacement_data)
{
    // Reset last touch timestamp
    std::static_pointer_cast<MRUReplData>(
        replacement_data)->lastTouchTick = Tick(0);
}
 
void
MRU::touch(const std::shared_ptr<ReplacementData>& replacement_data) const
{
    // Update last touch timestamp
    std::static_pointer_cast<MRUReplData>(
        replacement_data)->lastTouchTick = curTick();
}
 
void
MRU::reset(const std::shared_ptr<ReplacementData>& replacement_data) const
{
    // Set last touch timestamp
    std::static_pointer_cast<MRUReplData>(
        replacement_data)->lastTouchTick = curTick();
}
 
ReplaceableEntry*
MRU::getVictim(const ReplacementCandidates& candidates) const
{
    // There must be at least one replacement candidate
    assert(candidates.size() > 0);
 
    // Visit all candidates to find victim
    ReplaceableEntry* victim = candidates[0];
    for (const auto& candidate : candidates) {
        std::shared_ptr<MRUReplData> candidate_replacement_data =
            std::static_pointer_cast<MRUReplData>(candidate->replacementData);
 
        // Stop searching entry if a cache line that doesn't warm up is found.
        if (candidate_replacement_data->lastTouchTick == 0) {
            victim = candidate;
            break;
        } else if (candidate_replacement_data->lastTouchTick >
                std::static_pointer_cast<MRUReplData>(
                    victim->replacementData)->lastTouchTick) {
            victim = candidate;
        }
    }
 
    return victim;
}
 
std::shared_ptr<ReplacementData>
MRU::instantiateEntry()
{
    return std::shared_ptr<ReplacementData>(new MRUReplData());
}
 
} // namespace replacement_policy
} // namespace gem5