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;

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

27 *
28 * Authors: Daniel Carvalho
29 */
30
31/**
32 * @file
33 * Declaration of a Least Frequently Used replacement policy.
34 * The victim is chosen using the reference frequency. The least referenced
35 * block is always chosen to be evicted, regardless of the amount of times
36 * it has been touched, or how long has passed since its last touch.
37 */
38
39#ifndef __MEM_CACHE_REPLACEMENT_POLICIES_LFU_RP_HH__
40#define __MEM_CACHE_REPLACEMENT_POLICIES_LFU_RP_HH__
41
42#include "mem/cache/replacement_policies/base.hh"
43#include "params/LFURP.hh"
44
45class LFURP : public BaseReplacementPolicy
46{
47 public:
48 /** Convenience typedef. */
49 typedef LFURPParams Params;
50
51 /**
52 * Construct and initiliaze this replacement policy.
53 */
54 LFURP(const Params *p);
55
56 /**
57 * Destructor.
58 */
59 ~LFURP() {}
60
61 /**
62 * Find replacement victim using reference frequency.
63 *
64 * @param cands Replacement candidates, selected by indexing policy.
65 * @return Cache block to be replaced.
66 */
67 CacheBlk* getVictim(const ReplacementCandidates& candidates) override;
68};
69
70#endif // __MEM_CACHE_REPLACEMENT_POLICIES_LFU_RP_HH__