12daaed84a
As a first step to migrate ruby to the M5 eventqueue, added a clock variable to the ruby system.
123 lines
3.9 KiB
C++
123 lines
3.9 KiB
C++
|
|
/*
|
|
* Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are
|
|
* met: redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer;
|
|
* redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution;
|
|
* neither the name of the copyright holders nor the names of its
|
|
* contributors may be used to endorse or promote products derived from
|
|
* this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
/*
|
|
* $Id$
|
|
*/
|
|
|
|
#include "mem/ruby/eventqueue/RubyEventQueue.hh"
|
|
#include "mem/ruby/common/Consumer.hh"
|
|
#include "mem/ruby/profiler/Profiler.hh"
|
|
#include "mem/ruby/system/System.hh"
|
|
#include "mem/gems_common/PrioHeap.hh"
|
|
#include "mem/ruby/eventqueue/RubyEventQueueNode.hh"
|
|
|
|
// Class public method definitions
|
|
|
|
RubyEventQueue::RubyEventQueue(Tick _clock)
|
|
: m_clock(_clock)
|
|
{
|
|
m_prio_heap_ptr = NULL;
|
|
init();
|
|
assert(g_eventQueue_ptr == NULL);
|
|
g_eventQueue_ptr = this;
|
|
}
|
|
|
|
RubyEventQueue::~RubyEventQueue()
|
|
{
|
|
delete m_prio_heap_ptr;
|
|
}
|
|
|
|
void RubyEventQueue::init()
|
|
{
|
|
m_globalTime = 1;
|
|
m_timeOfLastRecovery = 1;
|
|
m_prio_heap_ptr = new PrioHeap<RubyEventQueueNode>;
|
|
m_prio_heap_ptr->init();
|
|
}
|
|
|
|
bool RubyEventQueue::isEmpty() const
|
|
{
|
|
return (m_prio_heap_ptr->size() == 0);
|
|
}
|
|
|
|
void RubyEventQueue::scheduleEventAbsolute(Consumer* consumer, Time timeAbs)
|
|
{
|
|
// Check to see if this is a redundant wakeup
|
|
// Time time = timeDelta + m_globalTime;
|
|
ASSERT(consumer != NULL);
|
|
if (consumer->getLastScheduledWakeup() != timeAbs) {
|
|
// This wakeup is not redundant
|
|
RubyEventQueueNode thisNode;
|
|
thisNode.m_consumer_ptr = consumer;
|
|
assert(timeAbs > m_globalTime);
|
|
thisNode.m_time = timeAbs;
|
|
m_prio_heap_ptr->insert(thisNode);
|
|
consumer->setLastScheduledWakeup(timeAbs);
|
|
}
|
|
}
|
|
|
|
void RubyEventQueue::triggerEvents(Time t)
|
|
{
|
|
RubyEventQueueNode thisNode;
|
|
|
|
while(m_prio_heap_ptr->size() > 0 && m_prio_heap_ptr->peekMin().m_time <= t) {
|
|
m_globalTime = m_prio_heap_ptr->peekMin().m_time;
|
|
thisNode = m_prio_heap_ptr->extractMin();
|
|
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(this);
|
|
}
|
|
m_globalTime = t;
|
|
}
|
|
|
|
void RubyEventQueue::triggerAllEvents()
|
|
{
|
|
// FIXME - avoid repeated code
|
|
RubyEventQueueNode thisNode;
|
|
|
|
while(m_prio_heap_ptr->size() > 0) {
|
|
m_globalTime = m_prio_heap_ptr->peekMin().m_time;
|
|
thisNode = m_prio_heap_ptr->extractMin();
|
|
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(this);
|
|
}
|
|
}
|
|
|
|
// Class private method definitions
|
|
|
|
void
|
|
RubyEventQueue::print(ostream& out) const
|
|
{
|
|
out << "[Event Queue: " << *m_prio_heap_ptr << "]";
|
|
}
|