LRUPolicy.hh (10441:5377550e1e15) LRUPolicy.hh (10970:ea8bdb1d9f1e)
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;

--- 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
29#ifndef __MEM_RUBY_STRUCTURES_LRUPOLICY_HH__
30#define __MEM_RUBY_STRUCTURES_LRUPOLICY_HH__
31
32#include "mem/ruby/structures/AbstractReplacementPolicy.hh"
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;

--- 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
29#ifndef __MEM_RUBY_STRUCTURES_LRUPOLICY_HH__
30#define __MEM_RUBY_STRUCTURES_LRUPOLICY_HH__
31
32#include "mem/ruby/structures/AbstractReplacementPolicy.hh"
33#include "params/LRUReplacementPolicy.hh"
33
34/* Simple true LRU replacement policy */
35
36class LRUPolicy : public AbstractReplacementPolicy
37{
38 public:
34
35/* Simple true LRU replacement policy */
36
37class LRUPolicy : public AbstractReplacementPolicy
38{
39 public:
39 LRUPolicy(int64 num_sets, int64 assoc);
40 typedef LRUReplacementPolicyParams Params;
41 LRUPolicy(const Params * p);
40 ~LRUPolicy();
41
42 void touch(int64 set, int64 way, Tick time);
43 int64 getVictim(int64 set) const;
44};
45
42 ~LRUPolicy();
43
44 void touch(int64 set, int64 way, Tick time);
45 int64 getVictim(int64 set) const;
46};
47
46inline
47LRUPolicy::LRUPolicy(int64 num_sets, int64 assoc)
48 : AbstractReplacementPolicy(num_sets, assoc)
49{
50}
51
52inline
53LRUPolicy::~LRUPolicy()
54{
55}
56
57inline void
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
66inline int64
67LRUPolicy::getVictim(int64 set) const
68{
69 // assert(m_assoc != 0);
70 Tick time, smallest_time;
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);
80
81 if (time < smallest_time) {
82 smallest_index = i;
83 smallest_time = time;
84 }
85 }
86
87 // DEBUG_EXPR(CACHE_COMP, MedPrio, cacheSet);
88 // DEBUG_EXPR(CACHE_COMP, MedPrio, smallest_index);
89 // DEBUG_EXPR(CACHE_COMP, MedPrio, m_cache[cacheSet][smallest_index]);
90 // DEBUG_EXPR(CACHE_COMP, MedPrio, *this);
91
92 return smallest_index;
93}
94
95#endif // __MEM_RUBY_STRUCTURES_LRUPOLICY_HH__
48#endif // __MEM_RUBY_STRUCTURES_LRUPOLICY_HH__