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; --- 20 unchanged lines hidden (view full) --- 29#ifndef __MEM_RUBY_SYSTEM_ABSTRACTREPLACEMENTPOLICY_HH__ 30#define __MEM_RUBY_SYSTEM_ABSTRACTREPLACEMENTPOLICY_HH__ 31 32#include "base/types.hh" 33 34class AbstractReplacementPolicy 35{ 36 public: |
37 AbstractReplacementPolicy(int64 num_sets, int64 assoc); |
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 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 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; --- 10 unchanged lines hidden (view full) --- 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_SYSTEM_ABSTRACTREPLACEMENTPOLICY_HH__ |