1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
|
/*
* Copyright (c) 2012 The Regents of The University of Michigan
* Copyright (c) 2012-2013 Mark D. Hill and David A. Wood
* Copyright (c) 2013 Advanced Micro Devices, Inc.
* 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.
*
* Authors: Steve Reinhardt
* Nathan Binkert
* Nilay Vaish
*/
#ifndef __SIM_EVENTQ_IMPL_HH__
#define __SIM_EVENTQ_IMPL_HH__
#include "base/trace.hh"
#include "sim/eventq.hh"
inline void
EventQueue::schedule(Event *event, Tick when, bool global)
{
assert(when >= getCurTick());
assert(!event->scheduled());
assert(event->initialized());
event->setWhen(when, this);
// The check below is to make sure of two things
// a. a thread schedules local events on other queues through the asyncq
// b. a thread schedules global events on the asyncq, whether or not
// this event belongs to this eventq. This is required to maintain
// a total order amongst the global events. See global_event.{cc,hh}
// for more explanation.
if (inParallelMode && (this != curEventQueue() || global)) {
asyncInsert(event);
} else {
insert(event);
}
event->flags.set(Event::Scheduled);
event->acquire();
if (DTRACE(Event))
event->trace("scheduled");
}
inline void
EventQueue::deschedule(Event *event)
{
assert(event->scheduled());
assert(event->initialized());
assert(!inParallelMode || this == curEventQueue());
remove(event);
event->flags.clear(Event::Squashed);
event->flags.clear(Event::Scheduled);
if (DTRACE(Event))
event->trace("descheduled");
event->release();
}
inline void
EventQueue::reschedule(Event *event, Tick when, bool always)
{
assert(when >= getCurTick());
assert(always || event->scheduled());
assert(event->initialized());
assert(!inParallelMode || this == curEventQueue());
if (event->scheduled()) {
remove(event);
} else {
event->acquire();
}
event->setWhen(when, this);
insert(event);
event->flags.clear(Event::Squashed);
event->flags.set(Event::Scheduled);
if (DTRACE(Event))
event->trace("rescheduled");
}
#endif // __SIM_EVENTQ_IMPL_HH__
|
