1/* 2 * Copyright (c) 2000-2005 The Regents of The University of Michigan 3 * Copyright (c) 2008 The Hewlett-Packard Development Company 4 * All rights reserved. 5 * 6 * Redistribution and use in source and binary forms, with or without 7 * modification, are permitted provided that the following conditions are 8 * met: redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer; 10 * redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution; 13 * neither the name of the copyright holders nor the names of its 14 * contributors may be used to endorse or promote products derived from 15 * this software without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 18 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 19 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 20 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 21 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 22 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 23 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 27 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28 * 29 * Authors: Steve Reinhardt 30 * Nathan Binkert 31 * Steve Raasch 32 */ 33 34#include <cassert> 35#include <iostream> 36#include <string> 37#include <vector> 38 39#include "base/hashmap.hh" 40#include "base/misc.hh" 41#include "base/trace.hh" 42#include "cpu/smt.hh" 43#include "sim/core.hh" 44#include "sim/eventq.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("Main Event Queue"); 55 56#ifndef NDEBUG 57Counter Event::instanceCounter = 0; 58#endif 59 60Event::~Event() 61{
| 1/* 2 * Copyright (c) 2000-2005 The Regents of The University of Michigan 3 * Copyright (c) 2008 The Hewlett-Packard Development Company 4 * All rights reserved. 5 * 6 * Redistribution and use in source and binary forms, with or without 7 * modification, are permitted provided that the following conditions are 8 * met: redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer; 10 * redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution; 13 * neither the name of the copyright holders nor the names of its 14 * contributors may be used to endorse or promote products derived from 15 * this software without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 18 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 19 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 20 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 21 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 22 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 23 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 27 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28 * 29 * Authors: Steve Reinhardt 30 * Nathan Binkert 31 * Steve Raasch 32 */ 33 34#include <cassert> 35#include <iostream> 36#include <string> 37#include <vector> 38 39#include "base/hashmap.hh" 40#include "base/misc.hh" 41#include "base/trace.hh" 42#include "cpu/smt.hh" 43#include "sim/core.hh" 44#include "sim/eventq.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("Main Event Queue"); 55 56#ifndef NDEBUG 57Counter Event::instanceCounter = 0; 58#endif 59 60Event::~Event() 61{
|
62} 63 64const std::string 65Event::name() const 66{ 67#ifndef NDEBUG 68 return csprintf("Event_%d", instance); 69#else 70 return csprintf("Event_%x", (uintptr_t)this); 71#endif 72} 73 74 75Event * 76Event::insertBefore(Event *event, Event *curr) 77{ 78 // Either way, event will be the top element in the 'in bin' list 79 // which is the pointer we need in order to look into the list, so 80 // we need to insert that into the bin list. 81 if (!curr || *event < *curr) { 82 // Insert the event before the current list since it is in the future. 83 event->nextBin = curr; 84 event->nextInBin = NULL; 85 } else { 86 // Since we're on the correct list, we need to point to the next list 87 event->nextBin = curr->nextBin; // curr->nextBin can now become stale 88 89 // Insert event at the top of the stack 90 event->nextInBin = curr; 91 } 92 93 return event; 94} 95 96void 97EventQueue::insert(Event *event) 98{ 99 // Deal with the head case 100 if (!head || *event <= *head) { 101 head = Event::insertBefore(event, head); 102 return; 103 } 104 105 // Figure out either which 'in bin' list we are on, or where a new list 106 // needs to be inserted 107 Event *prev = head; 108 Event *curr = head->nextBin; 109 while (curr && *curr < *event) { 110 prev = curr; 111 curr = curr->nextBin; 112 } 113 114 // Note: this operation may render all nextBin pointers on the 115 // prev 'in bin' list stale (except for the top one) 116 prev->nextBin = Event::insertBefore(event, curr); 117} 118 119Event * 120Event::removeItem(Event *event, Event *top) 121{ 122 Event *curr = top; 123 Event *next = top->nextInBin; 124 125 // if we removed the top item, we need to handle things specially 126 // and just remove the top item, fixing up the next bin pointer of 127 // the new top item 128 if (event == top) { 129 if (!next) 130 return top->nextBin; 131 next->nextBin = top->nextBin; 132 return next; 133 } 134 135 // Since we already checked the current element, we're going to 136 // keep checking event against the next element. 137 while (event != next) { 138 if (!next) 139 panic("event not found!"); 140 141 curr = next; 142 next = next->nextInBin; 143 } 144 145 // remove next from the 'in bin' list since it's what we're looking for 146 curr->nextInBin = next->nextInBin; 147 return top; 148} 149 150void 151EventQueue::remove(Event *event) 152{ 153 if (head == NULL) 154 panic("event not found!"); 155 156 // deal with an event on the head's 'in bin' list (event has the same 157 // time as the head) 158 if (*head == *event) { 159 head = Event::removeItem(event, head); 160 return; 161 } 162 163 // Find the 'in bin' list that this event belongs on 164 Event *prev = head; 165 Event *curr = head->nextBin; 166 while (curr && *curr < *event) { 167 prev = curr; 168 curr = curr->nextBin; 169 } 170 171 if (!curr || *curr != *event) 172 panic("event not found!"); 173 174 // curr points to the top item of the the correct 'in bin' list, when 175 // we remove an item, it returns the new top item (which may be 176 // unchanged) 177 prev->nextBin = Event::removeItem(event, curr); 178} 179 180Event * 181EventQueue::serviceOne() 182{ 183 Event *event = head; 184 Event *next = head->nextInBin; 185 event->flags.clear(Event::Scheduled); 186 187 if (next) { 188 // update the next bin pointer since it could be stale 189 next->nextBin = head->nextBin; 190 191 // pop the stack 192 head = next; 193 } else { 194 // this was the only element on the 'in bin' list, so get rid of 195 // the 'in bin' list and point to the next bin list 196 head = head->nextBin; 197 } 198 199 // handle action 200 if (!event->squashed()) { 201 event->process(); 202 if (event->isExitEvent()) { 203 assert(!event->flags.isSet(Event::AutoDelete)); // would be silly 204 return event; 205 } 206 } else { 207 event->flags.clear(Event::Squashed); 208 } 209 210 if (event->flags.isSet(Event::AutoDelete) && !event->scheduled()) 211 delete event; 212 213 return NULL; 214} 215 216void 217Event::serialize(std::ostream &os) 218{ 219 SERIALIZE_SCALAR(_when); 220 SERIALIZE_SCALAR(_priority); 221 short _flags = flags; 222 SERIALIZE_SCALAR(_flags); 223} 224 225void 226Event::unserialize(Checkpoint *cp, const string §ion) 227{ 228 if (scheduled()) 229 mainEventQueue.deschedule(this); 230 231 UNSERIALIZE_SCALAR(_when); 232 UNSERIALIZE_SCALAR(_priority); 233 234 // need to see if original event was in a scheduled, unsquashed 235 // state, but don't want to restore those flags in the current 236 // object itself (since they aren't immediately true) 237 short _flags; 238 UNSERIALIZE_SCALAR(_flags); 239 flags = _flags; 240 241 bool wasScheduled = flags.isSet(Scheduled) && !flags.isSet(Squashed); 242 flags.clear(Squashed | Scheduled); 243 244 if (wasScheduled) { 245 DPRINTF(Config, "rescheduling at %d\n", _when); 246 mainEventQueue.schedule(this, _when); 247 } 248} 249 250void 251EventQueue::serialize(ostream &os) 252{ 253 std::list<Event *> eventPtrs; 254 255 int numEvents = 0; 256 Event *nextBin = head; 257 while (nextBin) { 258 Event *nextInBin = nextBin; 259 260 while (nextInBin) { 261 if (nextInBin->flags.isSet(Event::AutoSerialize)) { 262 eventPtrs.push_back(nextInBin); 263 paramOut(os, csprintf("event%d", numEvents++), 264 nextInBin->name()); 265 } 266 nextInBin = nextInBin->nextInBin; 267 } 268 269 nextBin = nextBin->nextBin; 270 } 271 272 SERIALIZE_SCALAR(numEvents); 273 274 for (std::list<Event *>::iterator it = eventPtrs.begin(); 275 it != eventPtrs.end(); ++it) { 276 (*it)->nameOut(os); 277 (*it)->serialize(os); 278 } 279} 280 281void 282EventQueue::unserialize(Checkpoint *cp, const std::string §ion) 283{ 284 int numEvents; 285 UNSERIALIZE_SCALAR(numEvents); 286 287 std::string eventName; 288 for (int i = 0; i < numEvents; i++) { 289 // get the pointer value associated with the event 290 paramIn(cp, section, csprintf("event%d", i), eventName); 291 292 // create the event based on its pointer value 293 Serializable::create(cp, eventName); 294 } 295} 296 297void 298EventQueue::dump() const 299{ 300 cprintf("============================================================\n"); 301 cprintf("EventQueue Dump (cycle %d)\n", curTick); 302 cprintf("------------------------------------------------------------\n"); 303 304 if (empty()) 305 cprintf("<No Events>\n"); 306 else { 307 Event *nextBin = head; 308 while (nextBin) { 309 Event *nextInBin = nextBin; 310 while (nextInBin) { 311 nextInBin->dump(); 312 nextInBin = nextInBin->nextInBin; 313 } 314 315 nextBin = nextBin->nextBin; 316 } 317 } 318 319 cprintf("============================================================\n"); 320} 321 322bool 323EventQueue::debugVerify() const 324{ 325 m5::hash_map<long, bool> map; 326 327 Tick time = 0; 328 short priority = 0; 329 330 Event *nextBin = head; 331 while (nextBin) { 332 Event *nextInBin = nextBin; 333 while (nextInBin) { 334 if (nextInBin->when() < time) { 335 cprintf("time goes backwards!"); 336 nextInBin->dump(); 337 return false; 338 } else if (nextInBin->when() == time && 339 nextInBin->priority() < priority) { 340 cprintf("priority inverted!"); 341 nextInBin->dump(); 342 return false; 343 } 344 345 if (map[reinterpret_cast<long>(nextInBin)]) { 346 cprintf("Node already seen"); 347 nextInBin->dump(); 348 return false; 349 } 350 map[reinterpret_cast<long>(nextInBin)] = true; 351 352 time = nextInBin->when(); 353 priority = nextInBin->priority(); 354 355 nextInBin = nextInBin->nextInBin; 356 } 357 358 nextBin = nextBin->nextBin; 359 } 360 361 return true; 362} 363 364void 365dumpMainQueue() 366{ 367 mainEventQueue.dump(); 368} 369 370 371const char * 372Event::description() const 373{ 374 return "generic"; 375} 376 377void 378Event::trace(const char *action) 379{ 380 // This DPRINTF is unconditional because calls to this function 381 // are protected by an 'if (DTRACE(Event))' in the inlined Event 382 // methods. 383 // 384 // This is just a default implementation for derived classes where 385 // it's not worth doing anything special. If you want to put a 386 // more informative message in the trace, override this method on 387 // the particular subclass where you have the information that 388 // needs to be printed. 389 DPRINTFN("%s event %s @ %d\n", description(), action, when()); 390} 391 392void 393Event::dump() const 394{ 395 cprintf("Event %s (%s)\n", name(), description()); 396 cprintf("Flags: %#x\n", flags); 397#ifdef EVENTQ_DEBUG 398 cprintf("Created: %d\n", whenCreated); 399#endif 400 if (scheduled()) { 401#ifdef EVENTQ_DEBUG 402 cprintf("Scheduled at %d\n", whenScheduled); 403#endif 404 cprintf("Scheduled for %d, priority %d\n", when(), _priority); 405 } else { 406 cprintf("Not Scheduled\n"); 407 } 408}
| 63} 64 65const std::string 66Event::name() const 67{ 68#ifndef NDEBUG 69 return csprintf("Event_%d", instance); 70#else 71 return csprintf("Event_%x", (uintptr_t)this); 72#endif 73} 74 75 76Event * 77Event::insertBefore(Event *event, Event *curr) 78{ 79 // Either way, event will be the top element in the 'in bin' list 80 // which is the pointer we need in order to look into the list, so 81 // we need to insert that into the bin list. 82 if (!curr || *event < *curr) { 83 // Insert the event before the current list since it is in the future. 84 event->nextBin = curr; 85 event->nextInBin = NULL; 86 } else { 87 // Since we're on the correct list, we need to point to the next list 88 event->nextBin = curr->nextBin; // curr->nextBin can now become stale 89 90 // Insert event at the top of the stack 91 event->nextInBin = curr; 92 } 93 94 return event; 95} 96 97void 98EventQueue::insert(Event *event) 99{ 100 // Deal with the head case 101 if (!head || *event <= *head) { 102 head = Event::insertBefore(event, head); 103 return; 104 } 105 106 // Figure out either which 'in bin' list we are on, or where a new list 107 // needs to be inserted 108 Event *prev = head; 109 Event *curr = head->nextBin; 110 while (curr && *curr < *event) { 111 prev = curr; 112 curr = curr->nextBin; 113 } 114 115 // Note: this operation may render all nextBin pointers on the 116 // prev 'in bin' list stale (except for the top one) 117 prev->nextBin = Event::insertBefore(event, curr); 118} 119 120Event * 121Event::removeItem(Event *event, Event *top) 122{ 123 Event *curr = top; 124 Event *next = top->nextInBin; 125 126 // if we removed the top item, we need to handle things specially 127 // and just remove the top item, fixing up the next bin pointer of 128 // the new top item 129 if (event == top) { 130 if (!next) 131 return top->nextBin; 132 next->nextBin = top->nextBin; 133 return next; 134 } 135 136 // Since we already checked the current element, we're going to 137 // keep checking event against the next element. 138 while (event != next) { 139 if (!next) 140 panic("event not found!"); 141 142 curr = next; 143 next = next->nextInBin; 144 } 145 146 // remove next from the 'in bin' list since it's what we're looking for 147 curr->nextInBin = next->nextInBin; 148 return top; 149} 150 151void 152EventQueue::remove(Event *event) 153{ 154 if (head == NULL) 155 panic("event not found!"); 156 157 // deal with an event on the head's 'in bin' list (event has the same 158 // time as the head) 159 if (*head == *event) { 160 head = Event::removeItem(event, head); 161 return; 162 } 163 164 // Find the 'in bin' list that this event belongs on 165 Event *prev = head; 166 Event *curr = head->nextBin; 167 while (curr && *curr < *event) { 168 prev = curr; 169 curr = curr->nextBin; 170 } 171 172 if (!curr || *curr != *event) 173 panic("event not found!"); 174 175 // curr points to the top item of the the correct 'in bin' list, when 176 // we remove an item, it returns the new top item (which may be 177 // unchanged) 178 prev->nextBin = Event::removeItem(event, curr); 179} 180 181Event * 182EventQueue::serviceOne() 183{ 184 Event *event = head; 185 Event *next = head->nextInBin; 186 event->flags.clear(Event::Scheduled); 187 188 if (next) { 189 // update the next bin pointer since it could be stale 190 next->nextBin = head->nextBin; 191 192 // pop the stack 193 head = next; 194 } else { 195 // this was the only element on the 'in bin' list, so get rid of 196 // the 'in bin' list and point to the next bin list 197 head = head->nextBin; 198 } 199 200 // handle action 201 if (!event->squashed()) { 202 event->process(); 203 if (event->isExitEvent()) { 204 assert(!event->flags.isSet(Event::AutoDelete)); // would be silly 205 return event; 206 } 207 } else { 208 event->flags.clear(Event::Squashed); 209 } 210 211 if (event->flags.isSet(Event::AutoDelete) && !event->scheduled()) 212 delete event; 213 214 return NULL; 215} 216 217void 218Event::serialize(std::ostream &os) 219{ 220 SERIALIZE_SCALAR(_when); 221 SERIALIZE_SCALAR(_priority); 222 short _flags = flags; 223 SERIALIZE_SCALAR(_flags); 224} 225 226void 227Event::unserialize(Checkpoint *cp, const string §ion) 228{ 229 if (scheduled()) 230 mainEventQueue.deschedule(this); 231 232 UNSERIALIZE_SCALAR(_when); 233 UNSERIALIZE_SCALAR(_priority); 234 235 // need to see if original event was in a scheduled, unsquashed 236 // state, but don't want to restore those flags in the current 237 // object itself (since they aren't immediately true) 238 short _flags; 239 UNSERIALIZE_SCALAR(_flags); 240 flags = _flags; 241 242 bool wasScheduled = flags.isSet(Scheduled) && !flags.isSet(Squashed); 243 flags.clear(Squashed | Scheduled); 244 245 if (wasScheduled) { 246 DPRINTF(Config, "rescheduling at %d\n", _when); 247 mainEventQueue.schedule(this, _when); 248 } 249} 250 251void 252EventQueue::serialize(ostream &os) 253{ 254 std::list<Event *> eventPtrs; 255 256 int numEvents = 0; 257 Event *nextBin = head; 258 while (nextBin) { 259 Event *nextInBin = nextBin; 260 261 while (nextInBin) { 262 if (nextInBin->flags.isSet(Event::AutoSerialize)) { 263 eventPtrs.push_back(nextInBin); 264 paramOut(os, csprintf("event%d", numEvents++), 265 nextInBin->name()); 266 } 267 nextInBin = nextInBin->nextInBin; 268 } 269 270 nextBin = nextBin->nextBin; 271 } 272 273 SERIALIZE_SCALAR(numEvents); 274 275 for (std::list<Event *>::iterator it = eventPtrs.begin(); 276 it != eventPtrs.end(); ++it) { 277 (*it)->nameOut(os); 278 (*it)->serialize(os); 279 } 280} 281 282void 283EventQueue::unserialize(Checkpoint *cp, const std::string §ion) 284{ 285 int numEvents; 286 UNSERIALIZE_SCALAR(numEvents); 287 288 std::string eventName; 289 for (int i = 0; i < numEvents; i++) { 290 // get the pointer value associated with the event 291 paramIn(cp, section, csprintf("event%d", i), eventName); 292 293 // create the event based on its pointer value 294 Serializable::create(cp, eventName); 295 } 296} 297 298void 299EventQueue::dump() const 300{ 301 cprintf("============================================================\n"); 302 cprintf("EventQueue Dump (cycle %d)\n", curTick); 303 cprintf("------------------------------------------------------------\n"); 304 305 if (empty()) 306 cprintf("<No Events>\n"); 307 else { 308 Event *nextBin = head; 309 while (nextBin) { 310 Event *nextInBin = nextBin; 311 while (nextInBin) { 312 nextInBin->dump(); 313 nextInBin = nextInBin->nextInBin; 314 } 315 316 nextBin = nextBin->nextBin; 317 } 318 } 319 320 cprintf("============================================================\n"); 321} 322 323bool 324EventQueue::debugVerify() const 325{ 326 m5::hash_map<long, bool> map; 327 328 Tick time = 0; 329 short priority = 0; 330 331 Event *nextBin = head; 332 while (nextBin) { 333 Event *nextInBin = nextBin; 334 while (nextInBin) { 335 if (nextInBin->when() < time) { 336 cprintf("time goes backwards!"); 337 nextInBin->dump(); 338 return false; 339 } else if (nextInBin->when() == time && 340 nextInBin->priority() < priority) { 341 cprintf("priority inverted!"); 342 nextInBin->dump(); 343 return false; 344 } 345 346 if (map[reinterpret_cast<long>(nextInBin)]) { 347 cprintf("Node already seen"); 348 nextInBin->dump(); 349 return false; 350 } 351 map[reinterpret_cast<long>(nextInBin)] = true; 352 353 time = nextInBin->when(); 354 priority = nextInBin->priority(); 355 356 nextInBin = nextInBin->nextInBin; 357 } 358 359 nextBin = nextBin->nextBin; 360 } 361 362 return true; 363} 364 365void 366dumpMainQueue() 367{ 368 mainEventQueue.dump(); 369} 370 371 372const char * 373Event::description() const 374{ 375 return "generic"; 376} 377 378void 379Event::trace(const char *action) 380{ 381 // This DPRINTF is unconditional because calls to this function 382 // are protected by an 'if (DTRACE(Event))' in the inlined Event 383 // methods. 384 // 385 // This is just a default implementation for derived classes where 386 // it's not worth doing anything special. If you want to put a 387 // more informative message in the trace, override this method on 388 // the particular subclass where you have the information that 389 // needs to be printed. 390 DPRINTFN("%s event %s @ %d\n", description(), action, when()); 391} 392 393void 394Event::dump() const 395{ 396 cprintf("Event %s (%s)\n", name(), description()); 397 cprintf("Flags: %#x\n", flags); 398#ifdef EVENTQ_DEBUG 399 cprintf("Created: %d\n", whenCreated); 400#endif 401 if (scheduled()) { 402#ifdef EVENTQ_DEBUG 403 cprintf("Scheduled at %d\n", whenScheduled); 404#endif 405 cprintf("Scheduled for %d, priority %d\n", when(), _priority); 406 } else { 407 cprintf("Not Scheduled\n"); 408 } 409}
|