TimerTable.cc revision 6467
112855Sgabeblack@google.com 212855Sgabeblack@google.com/* 312855Sgabeblack@google.com * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 412855Sgabeblack@google.com * All rights reserved. 512855Sgabeblack@google.com * 612855Sgabeblack@google.com * Redistribution and use in source and binary forms, with or without 712855Sgabeblack@google.com * modification, are permitted provided that the following conditions are 812855Sgabeblack@google.com * met: redistributions of source code must retain the above copyright 912855Sgabeblack@google.com * notice, this list of conditions and the following disclaimer; 1012855Sgabeblack@google.com * redistributions in binary form must reproduce the above copyright 1112855Sgabeblack@google.com * notice, this list of conditions and the following disclaimer in the 1212855Sgabeblack@google.com * documentation and/or other materials provided with the distribution; 1312855Sgabeblack@google.com * neither the name of the copyright holders nor the names of its 1412855Sgabeblack@google.com * contributors may be used to endorse or promote products derived from 1512855Sgabeblack@google.com * this software without specific prior written permission. 1612855Sgabeblack@google.com * 1712855Sgabeblack@google.com * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 1812855Sgabeblack@google.com * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 1912855Sgabeblack@google.com * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 2012855Sgabeblack@google.com * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 2112855Sgabeblack@google.com * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 2212855Sgabeblack@google.com * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 2312855Sgabeblack@google.com * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 2412855Sgabeblack@google.com * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 2512855Sgabeblack@google.com * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 2612855Sgabeblack@google.com * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 2712855Sgabeblack@google.com * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 2812855Sgabeblack@google.com */ 2912855Sgabeblack@google.com 3012855Sgabeblack@google.com/* 3112855Sgabeblack@google.com * $Id$ 3212855Sgabeblack@google.com */ 3312855Sgabeblack@google.com 3412855Sgabeblack@google.com#include "mem/ruby/common/Global.hh" 3512855Sgabeblack@google.com#include "mem/ruby/system/TimerTable.hh" 3612855Sgabeblack@google.com#include "mem/ruby/eventqueue/RubyEventQueue.hh" 3712855Sgabeblack@google.com 3812855Sgabeblack@google.comTimerTable::TimerTable() 3912855Sgabeblack@google.com{ 4012855Sgabeblack@google.com m_consumer_ptr = NULL; 4112855Sgabeblack@google.com m_next_valid = false; 4212855Sgabeblack@google.com m_next_address = Address(0); 4312855Sgabeblack@google.com m_next_time = 0; 4412855Sgabeblack@google.com} 4512855Sgabeblack@google.com 4612855Sgabeblack@google.com 4712855Sgabeblack@google.combool TimerTable::isReady() const 4812855Sgabeblack@google.com{ 4912855Sgabeblack@google.com if (m_map.size() == 0) { 5012855Sgabeblack@google.com return false; 5112855Sgabeblack@google.com } 5212855Sgabeblack@google.com 5312855Sgabeblack@google.com if (!m_next_valid) { 5412855Sgabeblack@google.com updateNext(); 5512855Sgabeblack@google.com } 5612855Sgabeblack@google.com assert(m_next_valid); 5712855Sgabeblack@google.com return (g_eventQueue_ptr->getTime() >= m_next_time); 5812855Sgabeblack@google.com} 5912855Sgabeblack@google.com 6012855Sgabeblack@google.comconst Address& TimerTable::readyAddress() const 6112855Sgabeblack@google.com{ 6212855Sgabeblack@google.com assert(isReady()); 6312855Sgabeblack@google.com 6412855Sgabeblack@google.com if (!m_next_valid) { 6512855Sgabeblack@google.com updateNext(); 6612855Sgabeblack@google.com } 6712855Sgabeblack@google.com assert(m_next_valid); 6812855Sgabeblack@google.com return m_next_address; 6912855Sgabeblack@google.com} 7012855Sgabeblack@google.com 7112855Sgabeblack@google.comvoid TimerTable::set(const Address& address, Time relative_latency) 7212855Sgabeblack@google.com{ 7312855Sgabeblack@google.com assert(address == line_address(address)); 7412855Sgabeblack@google.com assert(relative_latency > 0); 7512855Sgabeblack@google.com assert(m_map.exist(address) == false); 7612855Sgabeblack@google.com Time ready_time = g_eventQueue_ptr->getTime() + relative_latency; 7712855Sgabeblack@google.com m_map.add(address, ready_time); 7812855Sgabeblack@google.com assert(m_consumer_ptr != NULL); 7912855Sgabeblack@google.com g_eventQueue_ptr->scheduleEventAbsolute(m_consumer_ptr, ready_time); 8012855Sgabeblack@google.com m_next_valid = false; 8112855Sgabeblack@google.com 8212855Sgabeblack@google.com // Don't always recalculate the next ready address 8312855Sgabeblack@google.com if (ready_time <= m_next_time) { 8412855Sgabeblack@google.com m_next_valid = false; 8512855Sgabeblack@google.com } 8612855Sgabeblack@google.com} 8712855Sgabeblack@google.com 8812855Sgabeblack@google.comvoid TimerTable::unset(const Address& address) 8912855Sgabeblack@google.com{ 9012855Sgabeblack@google.com assert(address == line_address(address)); 9112855Sgabeblack@google.com assert(m_map.exist(address) == true); 9212855Sgabeblack@google.com m_map.remove(address); 9312855Sgabeblack@google.com 9412855Sgabeblack@google.com // Don't always recalculate the next ready address 9512855Sgabeblack@google.com if (address == m_next_address) { 9612855Sgabeblack@google.com m_next_valid = false; 9712855Sgabeblack@google.com } 9812855Sgabeblack@google.com} 9912855Sgabeblack@google.com 10012855Sgabeblack@google.comvoid TimerTable::print(ostream& out) const 10112855Sgabeblack@google.com{ 10212855Sgabeblack@google.com} 10312855Sgabeblack@google.com 10412855Sgabeblack@google.com 10512855Sgabeblack@google.comvoid TimerTable::updateNext() const 10612855Sgabeblack@google.com{ 10712855Sgabeblack@google.com if (m_map.size() == 0) { 10812855Sgabeblack@google.com assert(m_next_valid == false); 10912855Sgabeblack@google.com return; 11012855Sgabeblack@google.com } 11112855Sgabeblack@google.com 11212855Sgabeblack@google.com Vector<Address> addresses = m_map.keys(); 11312855Sgabeblack@google.com m_next_address = addresses[0]; 11412855Sgabeblack@google.com m_next_time = m_map.lookup(m_next_address); 11512855Sgabeblack@google.com 11612855Sgabeblack@google.com // Search for the minimum time 11712855Sgabeblack@google.com int size = addresses.size(); 11812855Sgabeblack@google.com for (int i=1; i<size; i++) { 11912855Sgabeblack@google.com Address maybe_next_address = addresses[i]; 12012855Sgabeblack@google.com Time maybe_next_time = m_map.lookup(maybe_next_address); 121 if (maybe_next_time < m_next_time) { 122 m_next_time = maybe_next_time; 123 m_next_address= maybe_next_address; 124 } 125 } 126 m_next_valid = true; 127} 128