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;

--- 196 unchanged lines hidden (view full) ---

205
206 /// Determine if the current event is scheduled
207 bool scheduled() const { return getFlags(Scheduled); }
208
209 /// Schedule the event with the current priority or default priority
210 void schedule(Tick t);
211
212 /// Reschedule the event with the current priority
213 void reschedule(Tick t);
214
215 /// Remove the event from the current schedule
216 void deschedule();
217
218 /// Return a C string describing the event. This string should
219 /// *not* be dynamically allocated; just a const char array
220 /// describing the event class.
221 virtual const char *description();

--- 175 unchanged lines hidden (view full) ---

397 assert(scheduled());
398
399 clearFlags(Squashed);
400 clearFlags(Scheduled);
401 queue->deschedule(this);
402}
403
404inline void
405Event::reschedule(Tick t)
406{
407 assert(scheduled());
408 clearFlags(Squashed);
409
410#if TRACING_ON
411 when_scheduled = curTick;
412#endif
413 _when = t;
414 queue->reschedule(this);
415}
416
417inline void
418EventQueue::schedule(Event *event)
419{
420 insert(event);
421 if (DTRACE(Event))
422 event->trace("scheduled");

--- 22 unchanged lines hidden ---