diff options
Diffstat (limited to 'src/mem/ruby/eventqueue')
| -rw-r--r-- | src/mem/ruby/eventqueue/RubyEventQueue.cc | 6 | ||||
| -rw-r--r-- | src/mem/ruby/eventqueue/RubyEventQueue.hh | 4 |
2 files changed, 5 insertions, 5 deletions
diff --git a/src/mem/ruby/eventqueue/RubyEventQueue.cc b/src/mem/ruby/eventqueue/RubyEventQueue.cc index 4a979942f..1a4159f1d 100644 --- a/src/mem/ruby/eventqueue/RubyEventQueue.cc +++ b/src/mem/ruby/eventqueue/RubyEventQueue.cc @@ -49,7 +49,7 @@ RubyEventQueue::RubyEventQueue() RubyEventQueue::~RubyEventQueue() { - // delete m_prio_heap_ptr; + delete m_prio_heap_ptr; } void RubyEventQueue::init() @@ -91,7 +91,7 @@ void RubyEventQueue::triggerEvents(Time t) assert(thisNode.m_consumer_ptr != NULL); DEBUG_EXPR(EVENTQUEUE_COMP,MedPrio,*(thisNode.m_consumer_ptr)); DEBUG_EXPR(EVENTQUEUE_COMP,MedPrio,thisNode.m_time); - thisNode.m_consumer_ptr->triggerWakeup(); + thisNode.m_consumer_ptr->triggerWakeup(this); } m_globalTime = t; } @@ -107,7 +107,7 @@ void RubyEventQueue::triggerAllEvents() assert(thisNode.m_consumer_ptr != NULL); DEBUG_EXPR(EVENTQUEUE_COMP,MedPrio,*(thisNode.m_consumer_ptr)); DEBUG_EXPR(EVENTQUEUE_COMP,MedPrio,thisNode.m_time); - thisNode.m_consumer_ptr->triggerWakeup(); + thisNode.m_consumer_ptr->triggerWakeup(this); } } diff --git a/src/mem/ruby/eventqueue/RubyEventQueue.hh b/src/mem/ruby/eventqueue/RubyEventQueue.hh index a2112c922..fe7bc2833 100644 --- a/src/mem/ruby/eventqueue/RubyEventQueue.hh +++ b/src/mem/ruby/eventqueue/RubyEventQueue.hh @@ -30,7 +30,7 @@ /* * $Id$ * - * Description: The EventQueue class implements an event queue which + * Description: The RubyEventQueue class implements an event queue which * can be trigger events, allowing our simulation to be event driven. * * Currently, the only event we support is a Consumer being signaled @@ -48,7 +48,7 @@ * and a consumer pointer. The event queue will call the wakeup() * method of the consumer at the appropriate time. * - * This implementation of EventQueue uses a dynamically sized array + * This implementation of RubyEventQueue uses a dynamically sized array * managed as a heap. The algorithms used has O(lg n) for insert and * O(lg n) for extract minimum element. (Based on chapter 7 of Cormen, * Leiserson, and Rivest.) The array is dynamically sized and is |