AbstractReplacementPolicy.hh (10441:5377550e1e15) | AbstractReplacementPolicy.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_ABSTRACTREPLACEMENTPOLICY_HH__ 30#define __MEM_RUBY_STRUCTURES_ABSTRACTREPLACEMENTPOLICY_HH__ 31 32#include "base/types.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_ABSTRACTREPLACEMENTPOLICY_HH__ 30#define __MEM_RUBY_STRUCTURES_ABSTRACTREPLACEMENTPOLICY_HH__ 31 32#include "base/types.hh" |
33#include "mem/ruby/common/TypeDefines.hh" 34#include "params/ReplacementPolicy.hh" 35#include "sim/sim_object.hh" |
|
33 | 36 |
34class AbstractReplacementPolicy | 37class AbstractReplacementPolicy : public SimObject |
35{ 36 public: | 38{ 39 public: |
37 AbstractReplacementPolicy(int64 num_sets, int64 assoc); | 40 typedef ReplacementPolicyParams Params; 41 AbstractReplacementPolicy(const Params * p); |
38 virtual ~AbstractReplacementPolicy(); 39 40 /* touch a block. a.k.a. update timestamp */ 41 virtual void touch(int64 set, int64 way, Tick time) = 0; 42 43 /* returns the way to replace */ 44 virtual int64 getVictim(int64 set) const = 0; 45 46 /* get the time of the last access */ 47 Tick getLastAccess(int64 set, int64 way); 48 | 42 virtual ~AbstractReplacementPolicy(); 43 44 /* touch a block. a.k.a. update timestamp */ 45 virtual void touch(int64 set, int64 way, Tick time) = 0; 46 47 /* returns the way to replace */ 48 virtual int64 getVictim(int64 set) const = 0; 49 50 /* get the time of the last access */ 51 Tick getLastAccess(int64 set, int64 way); 52 |
53 virtual bool useOccupancy() const { return false; } 54 |
|
49 protected: 50 unsigned m_num_sets; /** total number of sets */ 51 unsigned m_assoc; /** set associativity */ 52 Tick **m_last_ref_ptr; /** timestamp of last reference */ 53}; 54 | 55 protected: 56 unsigned m_num_sets; /** total number of sets */ 57 unsigned m_assoc; /** set associativity */ 58 Tick **m_last_ref_ptr; /** timestamp of last reference */ 59}; 60 |
55inline 56AbstractReplacementPolicy::AbstractReplacementPolicy(int64 num_sets, 57 int64 assoc) 58{ 59 m_num_sets = num_sets; 60 m_assoc = assoc; 61 m_last_ref_ptr = new Tick*[m_num_sets]; 62 for(unsigned i = 0; i < m_num_sets; i++){ 63 m_last_ref_ptr[i] = new Tick[m_assoc]; 64 for(unsigned j = 0; j < m_assoc; j++){ 65 m_last_ref_ptr[i][j] = 0; 66 } 67 } 68} 69 70inline 71AbstractReplacementPolicy::~AbstractReplacementPolicy() 72{ 73 if (m_last_ref_ptr != NULL){ 74 for (unsigned i = 0; i < m_num_sets; i++){ 75 if (m_last_ref_ptr[i] != NULL){ 76 delete[] m_last_ref_ptr[i]; 77 } 78 } 79 delete[] m_last_ref_ptr; 80 } 81} 82 83inline Tick 84AbstractReplacementPolicy::getLastAccess(int64 set, int64 way) 85{ 86 return m_last_ref_ptr[set][way]; 87} 88 | |
89#endif // __MEM_RUBY_STRUCTURES_ABSTRACTREPLACEMENTPOLICY_HH__ | 61#endif // __MEM_RUBY_STRUCTURES_ABSTRACTREPLACEMENTPOLICY_HH__ |