1/*
2 * Copyright (c) 2000-2005 The Regents of The University of Michigan
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 * Authors: Steve Reinhardt
29 * Nathan Binkert
30 * Steve Raasch
31 */
32
33#include <assert.h>
34
35#include <iostream>
36#include <string>
37#include <vector>
38
39#include "cpu/smt.hh"
40#include "base/misc.hh"
41
42#include "sim/eventq.hh"
43#include "base/trace.hh"
44#include "sim/root.hh"
45
46using namespace std;
47
48//
49// Main Event Queue
50//
51// Events on this queue are processed at the *beginning* of each
52// cycle, before the pipeline simulation is performed.
53//
54EventQueue mainEventQueue("MainEventQueue");
55
| 1/*
2 * Copyright (c) 2000-2005 The Regents of The University of Michigan
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 * Authors: Steve Reinhardt
29 * Nathan Binkert
30 * Steve Raasch
31 */
32
33#include <assert.h>
34
35#include <iostream>
36#include <string>
37#include <vector>
38
39#include "cpu/smt.hh"
40#include "base/misc.hh"
41
42#include "sim/eventq.hh"
43#include "base/trace.hh"
44#include "sim/root.hh"
45
46using namespace std;
47
48//
49// Main Event Queue
50//
51// Events on this queue are processed at the *beginning* of each
52// cycle, before the pipeline simulation is performed.
53//
54EventQueue mainEventQueue("MainEventQueue");
55
|
57
58void
59EventQueue::insert(Event *event)
60{
61 if (head == NULL || event->when() < head->when() ||
62 (event->when() == head->when() &&
63 event->priority() <= head->priority())) {
64 event->next = head;
65 head = event;
66 } else {
67 Event *prev = head;
68 Event *curr = head->next;
69
70 while (curr) {
71 if (event->when() <= curr->when() &&
72 (event->when() < curr->when() ||
73 event->priority() <= curr->priority()))
74 break;
75
76 prev = curr;
77 curr = curr->next;
78 }
79
80 event->next = curr;
81 prev->next = event;
82 }
83}
84
85void
86EventQueue::remove(Event *event)
87{
88 if (head == NULL)
89 return;
90
91 if (head == event){
92 head = event->next;
93 return;
94 }
95
96 Event *prev = head;
97 Event *curr = head->next;
98 while (curr && curr != event) {
99 prev = curr;
100 curr = curr->next;
101 }
102
103 if (curr == event)
104 prev->next = curr->next;
105}
106
107Event *
108EventQueue::serviceOne()
109{
110 Event *event = head;
111 event->clearFlags(Event::Scheduled);
112 head = event->next;
113
114 // handle action
115 if (!event->squashed()) {
116 event->process();
117 if (event->isExitEvent()) {
118 assert(!event->getFlags(Event::AutoDelete)); // would be silly
119 return event;
120 }
121 } else {
122 event->clearFlags(Event::Squashed);
123 }
124
125 if (event->getFlags(Event::AutoDelete) && !event->scheduled())
126 delete event;
127
128 return NULL;
129}
130
131
132void
133Event::serialize(std::ostream &os)
134{
135 SERIALIZE_SCALAR(_when);
136 SERIALIZE_SCALAR(_priority);
137 SERIALIZE_ENUM(_flags);
138}
139
140
141void
142Event::unserialize(Checkpoint *cp, const string §ion)
143{
144 if (scheduled())
145 deschedule();
146
147 UNSERIALIZE_SCALAR(_when);
148 UNSERIALIZE_SCALAR(_priority);
149
150 // need to see if original event was in a scheduled, unsquashed
151 // state, but don't want to restore those flags in the current
152 // object itself (since they aren't immediately true)
153 UNSERIALIZE_ENUM(_flags);
154 bool wasScheduled = (_flags & Scheduled) && !(_flags & Squashed);
155 _flags &= ~(Squashed | Scheduled);
156
157 if (wasScheduled) {
158 DPRINTF(Config, "rescheduling at %d\n", _when);
159 schedule(_when);
160 }
161}
162
163void
164EventQueue::serialize(ostream &os)
165{
166 std::list<Event *> eventPtrs;
167
168 int numEvents = 0;
169 Event *event = head;
170 while (event) {
171 if (event->getFlags(Event::AutoSerialize)) {
172 eventPtrs.push_back(event);
173 paramOut(os, csprintf("event%d", numEvents++), event->name());
174 }
175 event = event->next;
176 }
177
178 SERIALIZE_SCALAR(numEvents);
179
180 for (std::list<Event *>::iterator it=eventPtrs.begin();
181 it != eventPtrs.end(); ++it) {
182 (*it)->nameOut(os);
183 (*it)->serialize(os);
184 }
185}
186
187void
188EventQueue::unserialize(Checkpoint *cp, const std::string §ion)
189{
190 int numEvents;
191 UNSERIALIZE_SCALAR(numEvents);
192
193 std::string eventName;
194 for (int i = 0; i < numEvents; i++) {
195 // get the pointer value associated with the event
196 paramIn(cp, section, csprintf("event%d", i), eventName);
197
198 // create the event based on its pointer value
199 Serializable::create(cp, eventName);
200 }
201}
202
203void
204EventQueue::dump()
205{
206 cprintf("============================================================\n");
207 cprintf("EventQueue Dump (cycle %d)\n", curTick);
208 cprintf("------------------------------------------------------------\n");
209
210 if (empty())
211 cprintf("<No Events>\n");
212 else {
213 Event *event = head;
214 while (event) {
215 event->dump();
216 event = event->next;
217 }
218 }
219
220 cprintf("============================================================\n");
221}
222
223extern "C"
224void
225dumpMainQueue()
226{
227 mainEventQueue.dump();
228}
229
230
231const char *
232Event::description()
233{
234 return "generic";
235}
236
237#if TRACING_ON
238void
239Event::trace(const char *action)
240{
241 // This DPRINTF is unconditional because calls to this function
242 // are protected by an 'if (DTRACE(Event))' in the inlined Event
243 // methods.
244 //
245 // This is just a default implementation for derived classes where
246 // it's not worth doing anything special. If you want to put a
247 // more informative message in the trace, override this method on
248 // the particular subclass where you have the information that
249 // needs to be printed.
250 DPRINTFN("%s event %s @ %d\n", description(), action, when());
251}
252#endif
253
254void
255Event::dump()
256{
257 cprintf("Event (%s)\n", description());
258 cprintf("Flags: %#x\n", _flags);
259#if TRACING_ON
260 cprintf("Created: %d\n", when_created);
261#endif
262 if (scheduled()) {
263#if TRACING_ON
264 cprintf("Scheduled at %d\n", when_scheduled);
265#endif
266 cprintf("Scheduled for %d, priority %d\n", when(), _priority);
267 }
268 else {
269 cprintf("Not Scheduled\n");
270 }
271}
| 59
60void
61EventQueue::insert(Event *event)
62{
63 if (head == NULL || event->when() < head->when() ||
64 (event->when() == head->when() &&
65 event->priority() <= head->priority())) {
66 event->next = head;
67 head = event;
68 } else {
69 Event *prev = head;
70 Event *curr = head->next;
71
72 while (curr) {
73 if (event->when() <= curr->when() &&
74 (event->when() < curr->when() ||
75 event->priority() <= curr->priority()))
76 break;
77
78 prev = curr;
79 curr = curr->next;
80 }
81
82 event->next = curr;
83 prev->next = event;
84 }
85}
86
87void
88EventQueue::remove(Event *event)
89{
90 if (head == NULL)
91 return;
92
93 if (head == event){
94 head = event->next;
95 return;
96 }
97
98 Event *prev = head;
99 Event *curr = head->next;
100 while (curr && curr != event) {
101 prev = curr;
102 curr = curr->next;
103 }
104
105 if (curr == event)
106 prev->next = curr->next;
107}
108
109Event *
110EventQueue::serviceOne()
111{
112 Event *event = head;
113 event->clearFlags(Event::Scheduled);
114 head = event->next;
115
116 // handle action
117 if (!event->squashed()) {
118 event->process();
119 if (event->isExitEvent()) {
120 assert(!event->getFlags(Event::AutoDelete)); // would be silly
121 return event;
122 }
123 } else {
124 event->clearFlags(Event::Squashed);
125 }
126
127 if (event->getFlags(Event::AutoDelete) && !event->scheduled())
128 delete event;
129
130 return NULL;
131}
132
133
134void
135Event::serialize(std::ostream &os)
136{
137 SERIALIZE_SCALAR(_when);
138 SERIALIZE_SCALAR(_priority);
139 SERIALIZE_ENUM(_flags);
140}
141
142
143void
144Event::unserialize(Checkpoint *cp, const string §ion)
145{
146 if (scheduled())
147 deschedule();
148
149 UNSERIALIZE_SCALAR(_when);
150 UNSERIALIZE_SCALAR(_priority);
151
152 // need to see if original event was in a scheduled, unsquashed
153 // state, but don't want to restore those flags in the current
154 // object itself (since they aren't immediately true)
155 UNSERIALIZE_ENUM(_flags);
156 bool wasScheduled = (_flags & Scheduled) && !(_flags & Squashed);
157 _flags &= ~(Squashed | Scheduled);
158
159 if (wasScheduled) {
160 DPRINTF(Config, "rescheduling at %d\n", _when);
161 schedule(_when);
162 }
163}
164
165void
166EventQueue::serialize(ostream &os)
167{
168 std::list<Event *> eventPtrs;
169
170 int numEvents = 0;
171 Event *event = head;
172 while (event) {
173 if (event->getFlags(Event::AutoSerialize)) {
174 eventPtrs.push_back(event);
175 paramOut(os, csprintf("event%d", numEvents++), event->name());
176 }
177 event = event->next;
178 }
179
180 SERIALIZE_SCALAR(numEvents);
181
182 for (std::list<Event *>::iterator it=eventPtrs.begin();
183 it != eventPtrs.end(); ++it) {
184 (*it)->nameOut(os);
185 (*it)->serialize(os);
186 }
187}
188
189void
190EventQueue::unserialize(Checkpoint *cp, const std::string §ion)
191{
192 int numEvents;
193 UNSERIALIZE_SCALAR(numEvents);
194
195 std::string eventName;
196 for (int i = 0; i < numEvents; i++) {
197 // get the pointer value associated with the event
198 paramIn(cp, section, csprintf("event%d", i), eventName);
199
200 // create the event based on its pointer value
201 Serializable::create(cp, eventName);
202 }
203}
204
205void
206EventQueue::dump()
207{
208 cprintf("============================================================\n");
209 cprintf("EventQueue Dump (cycle %d)\n", curTick);
210 cprintf("------------------------------------------------------------\n");
211
212 if (empty())
213 cprintf("<No Events>\n");
214 else {
215 Event *event = head;
216 while (event) {
217 event->dump();
218 event = event->next;
219 }
220 }
221
222 cprintf("============================================================\n");
223}
224
225extern "C"
226void
227dumpMainQueue()
228{
229 mainEventQueue.dump();
230}
231
232
233const char *
234Event::description()
235{
236 return "generic";
237}
238
239#if TRACING_ON
240void
241Event::trace(const char *action)
242{
243 // This DPRINTF is unconditional because calls to this function
244 // are protected by an 'if (DTRACE(Event))' in the inlined Event
245 // methods.
246 //
247 // This is just a default implementation for derived classes where
248 // it's not worth doing anything special. If you want to put a
249 // more informative message in the trace, override this method on
250 // the particular subclass where you have the information that
251 // needs to be printed.
252 DPRINTFN("%s event %s @ %d\n", description(), action, when());
253}
254#endif
255
256void
257Event::dump()
258{
259 cprintf("Event (%s)\n", description());
260 cprintf("Flags: %#x\n", _flags);
261#if TRACING_ON
262 cprintf("Created: %d\n", when_created);
263#endif
264 if (scheduled()) {
265#if TRACING_ON
266 cprintf("Scheduled at %d\n", when_scheduled);
267#endif
268 cprintf("Scheduled for %d, priority %d\n", when(), _priority);
269 }
270 else {
271 cprintf("Not Scheduled\n");
272 }
273}
|