TimerTable.cc revision 9465 
1/*
2 * Copyright (c) 1999-2008 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;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29#include "mem/ruby/common/Global.hh"
30#include "mem/ruby/system/System.hh"
31#include "mem/ruby/system/TimerTable.hh"
32
33TimerTable::TimerTable()
34{
35    m_consumer_ptr  = NULL;
36    m_clockobj_ptr = NULL;
37
38    m_next_valid = false;
39    m_next_address = Address(0);
40    m_next_time = 0;
41}
42
43bool
44TimerTable::isReady() const
45{
46    if (m_map.empty())
47        return false;
48
49    if (!m_next_valid) {
50        updateNext();
51    }
52    assert(m_next_valid);
53    return (m_clockobj_ptr->curCycle() >= m_next_time);
54}
55
56const Address&
57TimerTable::readyAddress() const
58{
59    assert(isReady());
60
61    if (!m_next_valid) {
62        updateNext();
63    }
64    assert(m_next_valid);
65    return m_next_address;
66}
67
68void
69TimerTable::set(const Address& address, Time relative_latency)
70{
71    assert(address == line_address(address));
72    assert(relative_latency > 0);
73    assert(!m_map.count(address));
74    Time ready_time = m_clockobj_ptr->curCycle() + relative_latency;
75    m_map[address] = ready_time;
76    assert(m_consumer_ptr != NULL);
77    m_consumer_ptr->scheduleEventAbsolute(ready_time);
78    m_next_valid = false;
79
80    // Don't always recalculate the next ready address
81    if (ready_time <= m_next_time) {
82        m_next_valid = false;
83    }
84}
85
86void
87TimerTable::unset(const Address& address)
88{
89    assert(address == line_address(address));
90    assert(m_map.count(address));
91    m_map.erase(address);
92
93    // Don't always recalculate the next ready address
94    if (address == m_next_address) {
95        m_next_valid = false;
96    }
97}
98
99void
100TimerTable::print(std::ostream& out) const
101{
102}
103
104void
105TimerTable::updateNext() const
106{
107    if (m_map.empty()) {
108        assert(!m_next_valid);
109        return;
110    }
111
112    AddressMap::const_iterator i = m_map.begin();
113    AddressMap::const_iterator end = m_map.end();
114
115    m_next_address = i->first;
116    m_next_time = i->second;
117    ++i;
118
119    for (; i != end; ++i) {
120        if (i->second < m_next_time) {
121            m_next_address = i->first;
122            m_next_time = i->second;
123        }
124    }
125
126    m_next_valid = true;
127}
128