gem5
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
TimerTable.cc
Go to the documentation of this file.
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 
30 
32 
34  : m_next_time(0)
35 {
36  m_consumer_ptr = NULL;
37  m_next_valid = false;
38  m_next_address = 0;
39 }
40 
41 bool
42 TimerTable::isReady(Tick curTime) const
43 {
44  if (m_map.empty())
45  return false;
46 
47  if (!m_next_valid) {
48  updateNext();
49  }
50  assert(m_next_valid);
51  return (curTime >= m_next_time);
52 }
53 
54 Addr
56 {
57  if (!m_next_valid) {
58  updateNext();
59  }
60  assert(m_next_valid);
61  return m_next_address;
62 }
63 
64 void
65 TimerTable::set(Addr address, Tick ready_time)
66 {
67  assert(address == makeLineAddress(address));
68  assert(!m_map.count(address));
69 
70  m_map[address] = ready_time;
71  assert(m_consumer_ptr != NULL);
73  m_next_valid = false;
74 
75  // Don't always recalculate the next ready address
76  if (ready_time <= m_next_time) {
77  m_next_valid = false;
78  }
79 }
80 
81 void
83 {
84  assert(address == makeLineAddress(address));
85  assert(m_map.count(address));
86  m_map.erase(address);
87 
88  // Don't always recalculate the next ready address
89  if (address == m_next_address) {
90  m_next_valid = false;
91  }
92 }
93 
94 void
95 TimerTable::print(std::ostream& out) const
96 {
97 }
98 
99 void
101 {
102  if (m_map.empty()) {
103  assert(!m_next_valid);
104  return;
105  }
106 
107  AddressMap::const_iterator i = m_map.begin();
108  AddressMap::const_iterator end = m_map.end();
109 
110  m_next_address = i->first;
111  m_next_time = i->second;
112  ++i;
113 
114  for (; i != end; ++i) {
115  if (i->second < m_next_time) {
116  m_next_address = i->first;
117  m_next_time = i->second;
118  }
119  }
120 
121  m_next_valid = true;
122 }
bool m_next_valid
Definition: TimerTable.hh:78
Bitfield< 7 > i
Definition: miscregs.hh:1378
void print(std::ostream &out) const
Definition: TimerTable.cc:95
void set(Addr address, Tick ready_time)
Definition: TimerTable.cc:65
void unset(Addr address)
Definition: TimerTable.cc:82
void scheduleEventAbsolute(Tick timeAbs)
Definition: Consumer.cc:40
Addr m_next_address
Definition: TimerTable.hh:80
uint64_t Tick
Tick count type.
Definition: types.hh:63
uint64_t Addr
Address type This will probably be moved somewhere else in the near future.
Definition: types.hh:142
bool isReady(Tick curTime) const
Definition: TimerTable.cc:42
Addr makeLineAddress(Addr addr)
Definition: Address.cc:112
void updateNext() const
Definition: TimerTable.cc:100
Addr nextAddress() const
Definition: TimerTable.cc:55
Consumer * m_consumer_ptr
Consumer to signal a wakeup()
Definition: TimerTable.hh:83
AddressMap m_map
Definition: TimerTable.hh:77
Tick m_next_time
Definition: TimerTable.hh:79

Generated on Fri Jun 9 2017 13:03:50 for gem5 by doxygen 1.8.6