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;

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

25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 *
28 * Authors: Daniel Carvalho
29 */
30
31#include "mem/cache/replacement_policies/bip_rp.hh"
32
33#include <memory>
34
35#include "base/random.hh"
34#include "debug/CacheRepl.hh"
36
37BIPRP::BIPRP(const Params *p)
38 : LRURP(p), btp(p->btp)
39{
40}
41
42void
42BIPRP::reset(CacheBlk *blk)
43BIPRP::reset(const std::shared_ptr<ReplacementData>& replacement_data) const
44{
44 BaseReplacementPolicy::reset(blk);
45 std::shared_ptr<LRUReplData> casted_replacement_data =
46 std::static_pointer_cast<LRUReplData>(replacement_data);
47
46 // Blocks are inserted as MRU if lower than btp, LRU otherwise
48 // Entries are inserted as MRU if lower than btp, LRU otherwise
49 if (random_mt.random<unsigned>(1, 100) <= btp) {
48 blk->lastTouchTick = curTick();
50 casted_replacement_data->lastTouchTick = curTick();
51 } else {
52 // Make their timestamps as old as possible, so that they become LRU
51 blk->lastTouchTick = 0;
53 casted_replacement_data->lastTouchTick = 1;
54 }
55}
56
57BIPRP*
58BIPRPParams::create()
59{
60 return new BIPRP(this);
61}