m5: merge inorder/release-notes/make_release changes
[gem5.git] / src / mem / ruby / eventqueue / RubyEventQueue.cc
1 /*
2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
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
29 #include <cassert>
30
31 #include "mem/ruby/common/Consumer.hh"
32 #include "mem/ruby/eventqueue/RubyEventQueue.hh"
33 #include "mem/ruby/eventqueue/RubyEventQueueNode.hh"
34 #include "mem/ruby/system/System.hh"
35
36 RubyEventQueue::RubyEventQueue(EventQueue* eventq, Tick _clock)
37 : EventManager(eventq), m_clock(_clock)
38 {
39 }
40
41 RubyEventQueue::~RubyEventQueue()
42 {
43 }
44
45 void
46 RubyEventQueue::scheduleEvent(Consumer* consumer, Time timeDelta)
47 {
48 scheduleEventAbsolute(consumer, timeDelta + getTime());
49 }
50
51 void
52 RubyEventQueue::scheduleEventAbsolute(Consumer* consumer, Time timeAbs)
53 {
54 // Check to see if this is a redundant wakeup
55 assert(consumer != NULL);
56 if (!consumer->alreadyScheduled(timeAbs)) {
57 // This wakeup is not redundant
58 RubyEventQueueNode *thisNode = new RubyEventQueueNode(consumer, this);
59 assert(timeAbs > getTime());
60 schedule(thisNode, (timeAbs * m_clock));
61 consumer->insertScheduledWakeupTime(timeAbs);
62 }
63 }
64
65 void
66 RubyEventQueue::print(std::ostream& out) const
67 {
68 out << "[Event Queue:]";
69 }