1/*
2 * Copyright (c) 2002-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;
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 * Authors: Nathan Binkert
29 */
30
31#include <string>
32
33#include "base/callback.hh"
34#include "base/hostinfo.hh"
35#include "sim/eventq.hh"
36#include "sim/param.hh"
37#include "sim/sim_events.hh"
38#include "sim/sim_exit.hh"
39#include "sim/startup.hh"
40#include "sim/stats.hh"
41
42using namespace std;
43
44//
45// handle termination event
46//
47void
| 1/*
2 * Copyright (c) 2002-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;
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 * Authors: Nathan Binkert
29 */
30
31#include <string>
32
33#include "base/callback.hh"
34#include "base/hostinfo.hh"
35#include "sim/eventq.hh"
36#include "sim/param.hh"
37#include "sim/sim_events.hh"
38#include "sim/sim_exit.hh"
39#include "sim/startup.hh"
40#include "sim/stats.hh"
41
42using namespace std;
43
44//
45// handle termination event
46//
47void
|
48SimExitEvent::process()
| 48SimLoopExitEvent::process()
|
49{
| 49{
|
50 // This event does not autodelete because exitNow may be called,
51 // and the function will never be allowed to finish.
52 if (theQueue() == &mainEventQueue) {
53 string _cause = cause;
54 int _code = code;
| 50 // if this got scheduled on a different queue (e.g. the committed
51 // instruction queue) then make a corresponding event on the main
52 // queue.
53 if (theQueue() != &mainEventQueue) {
54 exitSimLoop(cause, code);
|
55 delete this;
| 55 delete this;
|
56 exitNow(_cause, _code);
57 } else {
58 new SimExitEvent(cause, code);
59 delete this;
| |
60 }
| 56 }
|
| 57
58 // otherwise do nothing... the IsExitEvent flag takes care of
59 // exiting the simulation loop and returning this object to Python
|
61}
62
63
64const char *
| 60}
61
62
63const char *
|
65SimExitEvent::description()
| 64SimLoopExitEvent::description()
|
66{
| 65{
|
67 return "simulation termination";
| 66 return "simulation loop exit";
|
68}
69
| 67}
68
|
| 69void
70exitSimLoop(Tick when, const std::string &message, int exit_code)
71{
72 new SimLoopExitEvent(when, message, exit_code);
73}
74
75void
76exitSimLoop(const std::string &message, int exit_code)
77{
78 exitSimLoop(curTick, message, exit_code);
79}
80
|
70//
71// constructor: automatically schedules at specified time
72//
73CountedExitEvent::CountedExitEvent(EventQueue *q, const std::string &_cause,
74 Tick _when, int &_downCounter)
75 : Event(q, Sim_Exit_Pri),
76 cause(_cause),
77 downCounter(_downCounter)
78{
79 // catch stupid mistakes
80 assert(downCounter > 0);
81
82 schedule(_when);
83}
84
85
86//
87// handle termination event
88//
89void
90CountedExitEvent::process()
91{
92 if (--downCounter == 0) {
| 81//
82// constructor: automatically schedules at specified time
83//
84CountedExitEvent::CountedExitEvent(EventQueue *q, const std::string &_cause,
85 Tick _when, int &_downCounter)
86 : Event(q, Sim_Exit_Pri),
87 cause(_cause),
88 downCounter(_downCounter)
89{
90 // catch stupid mistakes
91 assert(downCounter > 0);
92
93 schedule(_when);
94}
95
96
97//
98// handle termination event
99//
100void
101CountedExitEvent::process()
102{
103 if (--downCounter == 0) {
|
93 new SimExitEvent(cause, 0);
| 104 exitSimLoop(cause, 0);
|
94 }
95}
96
97
98const char *
99CountedExitEvent::description()
100{
101 return "counted exit";
102}
103
104#ifdef CHECK_SWAP_CYCLES
105new CheckSwapEvent(&mainEventQueue, CHECK_SWAP_CYCLES);
106#endif
107
108void
109CheckSwapEvent::process()
110{
111 /* Check the amount of free swap space */
112 long swap;
113
114 /* returns free swap in KBytes */
115 swap = procInfo("/proc/meminfo", "SwapFree:");
116
117 if (swap < 1000)
118 ccprintf(cerr, "\a\a\aWarning! Swap space is low (%d)\n", swap);
119
120 if (swap < 100) {
121 cerr << "\a\aAborting Simulation! Inadequate swap space!\n\n";
| 105 }
106}
107
108
109const char *
110CountedExitEvent::description()
111{
112 return "counted exit";
113}
114
115#ifdef CHECK_SWAP_CYCLES
116new CheckSwapEvent(&mainEventQueue, CHECK_SWAP_CYCLES);
117#endif
118
119void
120CheckSwapEvent::process()
121{
122 /* Check the amount of free swap space */
123 long swap;
124
125 /* returns free swap in KBytes */
126 swap = procInfo("/proc/meminfo", "SwapFree:");
127
128 if (swap < 1000)
129 ccprintf(cerr, "\a\a\aWarning! Swap space is low (%d)\n", swap);
130
131 if (swap < 100) {
132 cerr << "\a\aAborting Simulation! Inadequate swap space!\n\n";
|
122 new SimExitEvent("Lack of swap space");
| 133 exitSimLoop("Lack of swap space");
|
123 }
124
125 schedule(curTick + interval);
126}
127
128const char *
129CheckSwapEvent::description()
130{
131 return "check swap";
132}
133
134//
135// handle progress event: print message and reschedule
136//
137void
138ProgressEvent::process()
139{
140 DPRINTFN("ProgressEvent\n");
141 // reschedule for next interval
142 schedule(curTick + interval);
143}
144
145
146const char *
147ProgressEvent::description()
148{
149 return "progress message";
150}
| 134 }
135
136 schedule(curTick + interval);
137}
138
139const char *
140CheckSwapEvent::description()
141{
142 return "check swap";
143}
144
145//
146// handle progress event: print message and reschedule
147//
148void
149ProgressEvent::process()
150{
151 DPRINTFN("ProgressEvent\n");
152 // reschedule for next interval
153 schedule(curTick + interval);
154}
155
156
157const char *
158ProgressEvent::description()
159{
160 return "progress message";
161}
|