LRUPolicy.hh (10301:44839e8febbd) LRUPolicy.hh (10314:94b6b28fc968)
1/*
2 * Copyright (c) 2007 Mark D. Hill and David A. Wood
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;

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

31
32#include "mem/ruby/structures/AbstractReplacementPolicy.hh"
33
34/* Simple true LRU replacement policy */
35
36class LRUPolicy : public AbstractReplacementPolicy
37{
38 public:
1/*
2 * Copyright (c) 2007 Mark D. Hill and David A. Wood
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;

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

31
32#include "mem/ruby/structures/AbstractReplacementPolicy.hh"
33
34/* Simple true LRU replacement policy */
35
36class LRUPolicy : public AbstractReplacementPolicy
37{
38 public:
39 LRUPolicy(Index num_sets, Index assoc);
39 LRUPolicy(int64 num_sets, int64 assoc);
40 ~LRUPolicy();
41
40 ~LRUPolicy();
41
42 void touch(Index set, Index way, Tick time);
43 Index getVictim(Index set) const;
42 void touch(int64 set, int64 way, Tick time);
43 int64 getVictim(int64 set) const;
44};
45
46inline
44};
45
46inline
47LRUPolicy::LRUPolicy(Index num_sets, Index assoc)
47LRUPolicy::LRUPolicy(int64 num_sets, int64 assoc)
48 : AbstractReplacementPolicy(num_sets, assoc)
49{
50}
51
52inline
53LRUPolicy::~LRUPolicy()
54{
55}
56
57inline void
48 : AbstractReplacementPolicy(num_sets, assoc)
49{
50}
51
52inline
53LRUPolicy::~LRUPolicy()
54{
55}
56
57inline void
58LRUPolicy::touch(Index set, Index index, Tick time)
58LRUPolicy::touch(int64 set, int64 index, Tick time)
59{
60 assert(index >= 0 && index < m_assoc);
61 assert(set >= 0 && set < m_num_sets);
62
63 m_last_ref_ptr[set][index] = time;
64}
65
59{
60 assert(index >= 0 && index < m_assoc);
61 assert(set >= 0 && set < m_num_sets);
62
63 m_last_ref_ptr[set][index] = time;
64}
65
66inline Index
67LRUPolicy::getVictim(Index set) const
66inline int64
67LRUPolicy::getVictim(int64 set) const
68{
69 // assert(m_assoc != 0);
70 Tick time, smallest_time;
68{
69 // assert(m_assoc != 0);
70 Tick time, smallest_time;
71 Index smallest_index;
71 int64 smallest_index;
72
73 smallest_index = 0;
74 smallest_time = m_last_ref_ptr[set][0];
75
76 for (unsigned i = 0; i < m_assoc; i++) {
77 time = m_last_ref_ptr[set][i];
78 // assert(m_cache[cacheSet][i].m_Permission !=
79 // AccessPermission_NotPresent);

--- 16 unchanged lines hidden --- 		72
73 smallest_index = 0;
74 smallest_time = m_last_ref_ptr[set][0];
75
76 for (unsigned i = 0; i < m_assoc; i++) {
77 time = m_last_ref_ptr[set][i];
78 // assert(m_cache[cacheSet][i].m_Permission !=
79 // AccessPermission_NotPresent);

--- 16 unchanged lines hidden ---