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 "base/random.hh"
34#include "debug/CacheRepl.hh"
35
36BIPRP::BIPRP(const Params *p)
37 : LRURP(p), btp(p->btp)
38{
39}
40
41void
42BIPRP::reset(CacheBlk *blk)
43{
44 BaseReplacementPolicy::reset(blk);
45
46 // Blocks are inserted as MRU if lower than btp, LRU otherwise
47 if (random_mt.random<unsigned>(1, 100) <= btp) {
48 blk->lastTouchTick = curTick();
49 } else {
50 // Make their timestamps as old as possible, so that they become LRU
51 blk->lastTouchTick = 0;
52 }
53}
54
55BIPRP*
56BIPRPParams::create()
57{
58 return new BIPRP(this);
59}