LRUPolicy.hh revision 9505
13584Ssaidi@eecs.umich.edu/* 23584Ssaidi@eecs.umich.edu * Copyright (c) 2007 Mark D. Hill and David A. Wood 33584Ssaidi@eecs.umich.edu * All rights reserved. 43584Ssaidi@eecs.umich.edu * 53584Ssaidi@eecs.umich.edu * Redistribution and use in source and binary forms, with or without 63584Ssaidi@eecs.umich.edu * modification, are permitted provided that the following conditions are 73584Ssaidi@eecs.umich.edu * met: redistributions of source code must retain the above copyright 83584Ssaidi@eecs.umich.edu * notice, this list of conditions and the following disclaimer; 93584Ssaidi@eecs.umich.edu * redistributions in binary form must reproduce the above copyright 103584Ssaidi@eecs.umich.edu * notice, this list of conditions and the following disclaimer in the 113584Ssaidi@eecs.umich.edu * documentation and/or other materials provided with the distribution; 123584Ssaidi@eecs.umich.edu * neither the name of the copyright holders nor the names of its 133584Ssaidi@eecs.umich.edu * contributors may be used to endorse or promote products derived from 143584Ssaidi@eecs.umich.edu * this software without specific prior written permission. 153584Ssaidi@eecs.umich.edu * 163584Ssaidi@eecs.umich.edu * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 173584Ssaidi@eecs.umich.edu * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 183584Ssaidi@eecs.umich.edu * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 193584Ssaidi@eecs.umich.edu * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 203584Ssaidi@eecs.umich.edu * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 213584Ssaidi@eecs.umich.edu * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 223584Ssaidi@eecs.umich.edu * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 233584Ssaidi@eecs.umich.edu * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 243584Ssaidi@eecs.umich.edu * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 253584Ssaidi@eecs.umich.edu * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 263584Ssaidi@eecs.umich.edu * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 273584Ssaidi@eecs.umich.edu */ 283584Ssaidi@eecs.umich.edu 293584Ssaidi@eecs.umich.edu#ifndef __MEM_RUBY_SYSTEM_LRUPOLICY_HH__ 303584Ssaidi@eecs.umich.edu#define __MEM_RUBY_SYSTEM_LRUPOLICY_HH__ 313584Ssaidi@eecs.umich.edu 323603Ssaidi@eecs.umich.edu#include "mem/ruby/system/AbstractReplacementPolicy.hh" 333584Ssaidi@eecs.umich.edu 343584Ssaidi@eecs.umich.edu/* Simple true LRU replacement policy */ 353584Ssaidi@eecs.umich.edu 363584Ssaidi@eecs.umich.educlass LRUPolicy : public AbstractReplacementPolicy 373584Ssaidi@eecs.umich.edu{ 383584Ssaidi@eecs.umich.edu public: 393584Ssaidi@eecs.umich.edu LRUPolicy(Index num_sets, Index assoc); 403584Ssaidi@eecs.umich.edu ~LRUPolicy(); 413584Ssaidi@eecs.umich.edu 423584Ssaidi@eecs.umich.edu void touch(Index set, Index way, Tick time); 433584Ssaidi@eecs.umich.edu Index getVictim(Index set) const; 443584Ssaidi@eecs.umich.edu}; 453584Ssaidi@eecs.umich.edu 463584Ssaidi@eecs.umich.eduinline 473584Ssaidi@eecs.umich.eduLRUPolicy::LRUPolicy(Index num_sets, Index assoc) 483584Ssaidi@eecs.umich.edu : AbstractReplacementPolicy(num_sets, assoc) 493584Ssaidi@eecs.umich.edu{ 503584Ssaidi@eecs.umich.edu} 513584Ssaidi@eecs.umich.edu 523584Ssaidi@eecs.umich.eduinline 533584Ssaidi@eecs.umich.eduLRUPolicy::~LRUPolicy() 543584Ssaidi@eecs.umich.edu{ 553584Ssaidi@eecs.umich.edu} 563584Ssaidi@eecs.umich.edu 573584Ssaidi@eecs.umich.eduinline void 583584Ssaidi@eecs.umich.eduLRUPolicy::touch(Index set, Index index, Tick time) 593584Ssaidi@eecs.umich.edu{ 603584Ssaidi@eecs.umich.edu assert(index >= 0 && index < m_assoc); 613584Ssaidi@eecs.umich.edu assert(set >= 0 && set < m_num_sets); 623584Ssaidi@eecs.umich.edu 633584Ssaidi@eecs.umich.edu m_last_ref_ptr[set][index] = time; 643584Ssaidi@eecs.umich.edu} 653584Ssaidi@eecs.umich.edu 663603Ssaidi@eecs.umich.eduinline Index 673603Ssaidi@eecs.umich.eduLRUPolicy::getVictim(Index set) const 683603Ssaidi@eecs.umich.edu{ 693603Ssaidi@eecs.umich.edu // assert(m_assoc != 0); 703584Ssaidi@eecs.umich.edu Tick time, smallest_time; 713584Ssaidi@eecs.umich.edu Index smallest_index; 723584Ssaidi@eecs.umich.edu 733584Ssaidi@eecs.umich.edu smallest_index = 0; 743584Ssaidi@eecs.umich.edu smallest_time = m_last_ref_ptr[set][0]; 753584Ssaidi@eecs.umich.edu 763603Ssaidi@eecs.umich.edu for (unsigned i = 0; i < m_assoc; i++) { 773603Ssaidi@eecs.umich.edu time = m_last_ref_ptr[set][i]; 783603Ssaidi@eecs.umich.edu // assert(m_cache[cacheSet][i].m_Permission != 793603Ssaidi@eecs.umich.edu // AccessPermission_NotPresent); 803584Ssaidi@eecs.umich.edu 813584Ssaidi@eecs.umich.edu 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_SYSTEM_LRUPOLICY_HH__ 96