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;

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

38#ifndef __MEM_CACHE_REPLACEMENT_POLICIES_LRU_RP_HH__
39#define __MEM_CACHE_REPLACEMENT_POLICIES_LRU_RP_HH__
40
41#include "mem/cache/replacement_policies/base.hh"
42#include "params/LRURP.hh"
43
44class LRURP : public BaseReplacementPolicy
45{
46 public:
47 /** Convenience typedef. */
48 typedef LRURPParams Params;
49
50 /**
51 * Construct and initiliaze this replacement policy.
52 */
53 LRURP(const Params *p);
54
55 /**
56 * Destructor.
57 */
58 ~LRURP() {}
59
60 /**
61 * Touch a block to update its last touch tick.
62 *
63 * @param blk Cache block to be touched.
64 */
65 void touch(CacheBlk *blk) override;
66
67 /**
68 * Reset replacement data for a block. Used when a block is inserted.
69 * Sets its last touch tick as the current tick.
70 *
71 * @param blk Cache block to be reset.
72 */
73 void reset(CacheBlk *blk) override;
74
75 /**
76 * Find replacement victim using LRU timestamps.
77 *
78 * @param candidates Replacement candidates, selected by indexing policy.
79 * @return Cache block to be replaced.
80 */
81 CacheBlk* getVictim(const ReplacementCandidates& candidates) override;
82};
83
84#endif // __MEM_CACHE_REPLACEMENT_POLICIES_LRU_RP_HH__