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;

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

26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 *
28 * Authors: Daniel Carvalho
29 */
30
31/**
32 * @file
33 * Declaration of a First In First Out replacement policy.
34 * The victim is chosen using the timestamp. The oldest block is always chosen
35 * to be evicted, regardless of the amount of times it has been touched.
36 */
37
38#ifndef __MEM_CACHE_REPLACEMENT_POLICIES_FIFO_RP_HH__
39#define __MEM_CACHE_REPLACEMENT_POLICIES_FIFO_RP_HH__
40
41#include "mem/cache/replacement_policies/base.hh"
42#include "params/FIFORP.hh"
43
44class FIFORP : public BaseReplacementPolicy
45{
46 public:
47 /** Convenience typedef. */
48 typedef FIFORPParams Params;
49
50 /**
51 * Construct and initiliaze this replacement policy.
52 */
53 FIFORP(const Params *p);
54
55 /**
56 * Destructor.
57 */
58 ~FIFORP() {}
59
60 /**
61 * Find replacement victim using insertion timestamps.
62 *
63 * @param cands Replacement candidates, selected by indexing policy.
64 * @return Cache block to be replaced.
65 */
66 CacheBlk* getVictim(const ReplacementCandidates& cands) override;
67};
68
69#endif // __MEM_CACHE_REPLACEMENT_POLICIES_FIFO_RP_HH__