AbstractReplacementPolicy.hh revision 9505
112027Sjungma@eit.uni-kl.de/* 212027Sjungma@eit.uni-kl.de * Copyright (c) 2007 Mark D. Hill and David A. Wood 312027Sjungma@eit.uni-kl.de * All rights reserved. 412027Sjungma@eit.uni-kl.de * 512027Sjungma@eit.uni-kl.de * Redistribution and use in source and binary forms, with or without 612027Sjungma@eit.uni-kl.de * modification, are permitted provided that the following conditions are 712027Sjungma@eit.uni-kl.de * met: redistributions of source code must retain the above copyright 812027Sjungma@eit.uni-kl.de * notice, this list of conditions and the following disclaimer; 912027Sjungma@eit.uni-kl.de * redistributions in binary form must reproduce the above copyright 1012027Sjungma@eit.uni-kl.de * notice, this list of conditions and the following disclaimer in the 1112027Sjungma@eit.uni-kl.de * documentation and/or other materials provided with the distribution; 1212027Sjungma@eit.uni-kl.de * neither the name of the copyright holders nor the names of its 1312027Sjungma@eit.uni-kl.de * contributors may be used to endorse or promote products derived from 1412027Sjungma@eit.uni-kl.de * this software without specific prior written permission. 1512027Sjungma@eit.uni-kl.de * 1612027Sjungma@eit.uni-kl.de * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 1712027Sjungma@eit.uni-kl.de * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 1812027Sjungma@eit.uni-kl.de * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 1912027Sjungma@eit.uni-kl.de * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 2012027Sjungma@eit.uni-kl.de * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 2112027Sjungma@eit.uni-kl.de * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 2212027Sjungma@eit.uni-kl.de * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 2312027Sjungma@eit.uni-kl.de * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 2412027Sjungma@eit.uni-kl.de * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 2512027Sjungma@eit.uni-kl.de * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 2612027Sjungma@eit.uni-kl.de * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 2712027Sjungma@eit.uni-kl.de */ 2812027Sjungma@eit.uni-kl.de 2912027Sjungma@eit.uni-kl.de#ifndef __MEM_RUBY_SYSTEM_ABSTRACTREPLACEMENTPOLICY_HH__ 3012027Sjungma@eit.uni-kl.de#define __MEM_RUBY_SYSTEM_ABSTRACTREPLACEMENTPOLICY_HH__ 3112027Sjungma@eit.uni-kl.de 3212027Sjungma@eit.uni-kl.de#include "base/types.hh" 3312027Sjungma@eit.uni-kl.de 3412027Sjungma@eit.uni-kl.declass AbstractReplacementPolicy 3512027Sjungma@eit.uni-kl.de{ 3612027Sjungma@eit.uni-kl.de public: 3712027Sjungma@eit.uni-kl.de AbstractReplacementPolicy(Index num_sets, Index assoc); 3812027Sjungma@eit.uni-kl.de virtual ~AbstractReplacementPolicy(); 3912027Sjungma@eit.uni-kl.de 4012027Sjungma@eit.uni-kl.de /* touch a block. a.k.a. update timestamp */ 4112027Sjungma@eit.uni-kl.de virtual void touch(Index set, Index way, Tick time) = 0; 42 43 /* returns the way to replace */ 44 virtual Index getVictim(Index set) const = 0; 45 46 /* get the time of the last access */ 47 Tick getLastAccess(Index set, Index 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(Index num_sets, 57 Index 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(Index set, Index way) 85{ 86 return m_last_ref_ptr[set][way]; 87} 88 89#endif // __MEM_RUBY_SYSTEM_ABSTRACTREPLACEMENTPOLICY_HH__ 90