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