2009-05-11 19:38:43 +02:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are
|
|
|
|
* met: redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer;
|
|
|
|
* redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution;
|
|
|
|
* neither the name of the copyright holders nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived from
|
|
|
|
* this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
2009-05-11 19:38:45 +02:00
|
|
|
#include "mem/ruby/common/Global.hh"
|
2012-08-27 08:00:55 +02:00
|
|
|
#include "mem/ruby/system/System.hh"
|
2010-03-23 02:43:53 +01:00
|
|
|
#include "mem/ruby/system/TimerTable.hh"
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2009-08-04 19:52:52 +02:00
|
|
|
TimerTable::TimerTable()
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-03-23 02:43:53 +01:00
|
|
|
m_consumer_ptr = NULL;
|
|
|
|
m_next_valid = false;
|
|
|
|
m_next_address = Address(0);
|
|
|
|
m_next_time = 0;
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-03-23 02:43:53 +01:00
|
|
|
bool
|
|
|
|
TimerTable::isReady() const
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-06-11 08:17:07 +02:00
|
|
|
if (m_map.empty())
|
2010-03-23 02:43:53 +01:00
|
|
|
return false;
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2010-03-23 02:43:53 +01:00
|
|
|
if (!m_next_valid) {
|
|
|
|
updateNext();
|
|
|
|
}
|
|
|
|
assert(m_next_valid);
|
2012-08-27 08:00:55 +02:00
|
|
|
return (g_system_ptr->getTime() >= m_next_time);
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-03-23 02:43:53 +01:00
|
|
|
const Address&
|
|
|
|
TimerTable::readyAddress() const
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-03-23 02:43:53 +01:00
|
|
|
assert(isReady());
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2010-03-23 02:43:53 +01:00
|
|
|
if (!m_next_valid) {
|
|
|
|
updateNext();
|
|
|
|
}
|
|
|
|
assert(m_next_valid);
|
|
|
|
return m_next_address;
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-03-23 02:43:53 +01:00
|
|
|
void
|
|
|
|
TimerTable::set(const Address& address, Time relative_latency)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-03-23 02:43:53 +01:00
|
|
|
assert(address == line_address(address));
|
|
|
|
assert(relative_latency > 0);
|
2010-06-11 08:17:07 +02:00
|
|
|
assert(!m_map.count(address));
|
2012-08-27 08:00:55 +02:00
|
|
|
Time ready_time = g_system_ptr->getTime() + relative_latency;
|
2010-06-11 08:17:07 +02:00
|
|
|
m_map[address] = ready_time;
|
2010-03-23 02:43:53 +01:00
|
|
|
assert(m_consumer_ptr != NULL);
|
2012-08-27 08:00:55 +02:00
|
|
|
m_consumer_ptr->scheduleEventAbsolute(ready_time);
|
2009-05-11 19:38:43 +02:00
|
|
|
m_next_valid = false;
|
2010-03-23 02:43:53 +01:00
|
|
|
|
|
|
|
// Don't always recalculate the next ready address
|
|
|
|
if (ready_time <= m_next_time) {
|
|
|
|
m_next_valid = false;
|
|
|
|
}
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-03-23 02:43:53 +01:00
|
|
|
void
|
|
|
|
TimerTable::unset(const Address& address)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-03-23 02:43:53 +01:00
|
|
|
assert(address == line_address(address));
|
2010-06-11 08:17:07 +02:00
|
|
|
assert(m_map.count(address));
|
|
|
|
m_map.erase(address);
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2010-03-23 02:43:53 +01:00
|
|
|
// Don't always recalculate the next ready address
|
|
|
|
if (address == m_next_address) {
|
|
|
|
m_next_valid = false;
|
|
|
|
}
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-03-23 02:43:53 +01:00
|
|
|
void
|
2010-04-02 20:20:32 +02:00
|
|
|
TimerTable::print(std::ostream& out) const
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2010-03-23 02:43:53 +01:00
|
|
|
void
|
|
|
|
TimerTable::updateNext() const
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-06-11 08:17:07 +02:00
|
|
|
if (m_map.empty()) {
|
|
|
|
assert(!m_next_valid);
|
2010-03-23 02:43:53 +01:00
|
|
|
return;
|
|
|
|
}
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2010-06-11 08:17:07 +02:00
|
|
|
AddressMap::const_iterator i = m_map.begin();
|
|
|
|
AddressMap::const_iterator end = m_map.end();
|
|
|
|
|
|
|
|
m_next_address = i->first;
|
|
|
|
m_next_time = i->second;
|
|
|
|
++i;
|
|
|
|
|
|
|
|
for (; i != end; ++i) {
|
|
|
|
if (i->second < m_next_time) {
|
|
|
|
m_next_address = i->first;
|
|
|
|
m_next_time = i->second;
|
2010-03-23 02:43:53 +01:00
|
|
|
}
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
2010-06-11 08:17:07 +02:00
|
|
|
|
2010-03-23 02:43:53 +01:00
|
|
|
m_next_valid = true;
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|