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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
|
/*
* Copyright (c) 1996 - 2000
* HD Associates, 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:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by HD Associates, Inc
* 4. Neither the name of the author nor the names of any co-contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY HD ASSOCIATES 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 HD ASSOCIATES 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.
*
* $FreeBSD$
*/
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
#include <errno.h>
#include <err.h>
#include <fcntl.h>
#include <sys/types.h>
#include <sys/mman.h>
#include <sys/time.h>
#include <sched.h>
#include <signal.h>
volatile int ticked;
#define CAN_USE_ALARMS
#ifdef CAN_USE_ALARMS
void tick(int arg)
{
ticked = 1;
}
#endif
/* Fifo: Verify that fifo and round-robin scheduling seem to work.
*
* This tests:
* 1. That sched_rr_get_interval seems to work;
* 2. That FIFO scheduling doesn't seeem to be round-robin;
* 3. That round-robin scheduling seems to work.
*
*/
static pid_t child;
static void tidyup(void)
{
if (child)
kill(child, SIGHUP);
}
static double
tvsub(const struct timeval *a, const struct timeval *b)
{
long sdiff;
long udiff;
sdiff = a->tv_sec - b->tv_sec;
udiff = a->tv_usec - b->tv_usec;
return (double)(sdiff * 1000000 + udiff) / 1e6;
}
int fifo(int argc, char *argv[])
{
int e = 0;
volatile long *p, pid;
int i;
struct sched_param fifo_param;
struct timespec interval;
#define MAX_RANAT 32
struct timeval ranat[MAX_RANAT];
#ifdef CAN_USE_ALARMS
static struct itimerval itimerval;
#endif
/* What is the round robin interval?
*/
if (sched_rr_get_interval(0, &interval) == -1) {
perror("sched_rr_get_interval");
exit(errno);
}
#ifdef CAN_USE_ALARMS
signal(SIGALRM, tick);
#endif
fifo_param.sched_priority = 1;
p = (long *)mmap(0, sizeof(*p),
PROT_READ|PROT_WRITE, MAP_ANON|MAP_SHARED|MAP_INHERIT, -1, 0);
if (p == (long *)-1)
err(errno, "mmap");
*p = 0;
if (sched_setscheduler(0, SCHED_FIFO, &fifo_param) == -1)
{
perror("sched_setscheduler");
return -1;
}
pid = getpid();
if ((child = fork()) == 0)
{
/* Child process. Just keep setting the pointer to our
* PID. The parent will kill us when it wants to.
*/
pid = getpid();
while (1)
*p = pid;
}
else
{
atexit(tidyup);
*p = pid;
ticked = 0;
#ifdef CAN_USE_ALARMS
/* Set an alarm for 250 times the round-robin interval.
* Then we will verify that a similar priority process
* will not run when we are using the FIFO scheduler.
*/
itimerval.it_value.tv_usec = interval.tv_nsec / (1000 / 250);
itimerval.it_value.tv_sec = itimerval.it_value.tv_usec / 1000000;
itimerval.it_value.tv_usec %= 1000000;
if (setitimer(ITIMER_REAL, &itimerval, 0) == -1) {
perror("setitimer");
exit(errno);
}
#endif
gettimeofday(ranat, 0);
i = 1;
while (!ticked && i < MAX_RANAT)
if (*p == child) {
gettimeofday(ranat + i, 0);
*p = 0;
e = -1;
i++;
}
if (e) {
int j;
fprintf(stderr,
"SCHED_FIFO had erroneous context switches:\n");
for (j = 1; j < i; j++) {
fprintf(stderr, "%d %g\n", j,
tvsub(ranat + j, ranat + j - 1));
}
return e;
}
/* Switch to the round robin scheduler and the child
* should run within twice the interval.
*/
if (sched_setscheduler(child, SCHED_RR, &fifo_param) == -1 ||
sched_setscheduler(0, SCHED_RR, &fifo_param) == -1)
{
perror("sched_setscheduler");
return -1;
}
e = -1;
ticked = 0;
#ifdef CAN_USE_ALARMS
/* Now we do want to see it run. But only set
* the alarm for twice the interval:
*/
itimerval.it_value.tv_usec = interval.tv_nsec / 500;
if (setitimer(ITIMER_REAL, &itimerval, 0) == -1) {
perror("setitimer");
exit(errno);
}
#endif
for (i = 0; !ticked; i++)
if (*p == child) {
e = 0;
break;
}
if (e)
fprintf(stderr,"Child never ran when it should have.\n");
}
exit(e);
}
#ifdef STANDALONE_TESTS
int main(int argc, char *argv[]) { return fifo(argc, argv); }
#endif
|
