t_sched.c revision 1.5 1 1.5 christos /* $NetBSD: t_sched.c,v 1.5 2012/03/25 04:11:42 christos Exp $ */
2 1.1 jruoho
3 1.1 jruoho /*-
4 1.1 jruoho * Copyright (c) 2011 The NetBSD Foundation, Inc.
5 1.1 jruoho * All rights reserved.
6 1.1 jruoho *
7 1.1 jruoho * This code is derived from software contributed to The NetBSD Foundation
8 1.1 jruoho * by Jukka Ruohonen.
9 1.1 jruoho *
10 1.1 jruoho * Redistribution and use in source and binary forms, with or without
11 1.1 jruoho * modification, are permitted provided that the following conditions
12 1.1 jruoho * are met:
13 1.1 jruoho * 1. Redistributions of source code must retain the above copyright
14 1.1 jruoho * notice, this list of conditions and the following disclaimer.
15 1.1 jruoho * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 jruoho * notice, this list of conditions and the following disclaimer in the
17 1.1 jruoho * documentation and/or other materials provided with the distribution.
18 1.1 jruoho *
19 1.1 jruoho * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.1 jruoho * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.1 jruoho * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.1 jruoho * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.1 jruoho * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.1 jruoho * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.1 jruoho * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.1 jruoho * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.1 jruoho * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.1 jruoho * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.1 jruoho * POSSIBILITY OF SUCH DAMAGE.
30 1.1 jruoho */
31 1.1 jruoho #include <sys/cdefs.h>
32 1.5 christos __RCSID("$NetBSD: t_sched.c,v 1.5 2012/03/25 04:11:42 christos Exp $");
33 1.1 jruoho
34 1.1 jruoho #include <sched.h>
35 1.1 jruoho #include <limits.h>
36 1.1 jruoho #include <unistd.h>
37 1.1 jruoho
38 1.1 jruoho #include <atf-c.h>
39 1.1 jruoho
40 1.1 jruoho static void sched_priority_set(int, int);
41 1.1 jruoho
42 1.1 jruoho ATF_TC(sched_getparam);
43 1.1 jruoho ATF_TC_HEAD(sched_getparam, tc)
44 1.1 jruoho {
45 1.1 jruoho atf_tc_set_md_var(tc, "descr", "A basic test of sched_getparam(3)");
46 1.1 jruoho }
47 1.1 jruoho
48 1.1 jruoho ATF_TC_BODY(sched_getparam, tc)
49 1.1 jruoho {
50 1.1 jruoho struct sched_param s1, s2;
51 1.1 jruoho pid_t p = getpid();
52 1.1 jruoho
53 1.1 jruoho /*
54 1.1 jruoho * IEEE Std 1003.1-2008: if the supplied pid is zero,
55 1.1 jruoho * the parameters for the calling process are returned.
56 1.1 jruoho */
57 1.1 jruoho ATF_REQUIRE(sched_getparam(0, &s1) == 0);
58 1.1 jruoho ATF_REQUIRE(sched_getparam(p, &s2) == 0);
59 1.1 jruoho
60 1.5 christos ATF_CHECK_EQ(s1.sched_priority, s2.sched_priority);
61 1.1 jruoho
62 1.1 jruoho /*
63 1.1 jruoho * The behavior is undefined but should error
64 1.1 jruoho * out in case the supplied PID is negative.
65 1.1 jruoho */
66 1.1 jruoho ATF_REQUIRE(sched_getparam(-1, &s1) != 0);
67 1.1 jruoho }
68 1.1 jruoho
69 1.1 jruoho ATF_TC(sched_priority);
70 1.1 jruoho ATF_TC_HEAD(sched_priority, tc)
71 1.1 jruoho {
72 1.1 jruoho atf_tc_set_md_var(tc, "descr", "Test sched(3) priority ranges");
73 1.1 jruoho }
74 1.1 jruoho
75 1.1 jruoho ATF_TC_BODY(sched_priority, tc)
76 1.1 jruoho {
77 1.1 jruoho static const int pol[3] = { SCHED_OTHER, SCHED_FIFO, SCHED_RR };
78 1.1 jruoho int pmax, pmin;
79 1.1 jruoho size_t i;
80 1.1 jruoho
81 1.1 jruoho /*
82 1.1 jruoho * Test that bogus values error out.
83 1.1 jruoho */
84 1.1 jruoho if (INT_MAX > SCHED_RR)
85 1.1 jruoho ATF_REQUIRE(sched_get_priority_max(INT_MAX) != 0);
86 1.1 jruoho
87 1.1 jruoho if (-INT_MAX < SCHED_OTHER)
88 1.1 jruoho ATF_REQUIRE(sched_get_priority_max(-INT_MAX) != 0);
89 1.1 jruoho
90 1.1 jruoho /*
91 1.1 jruoho * Test that we have a valid range.
92 1.1 jruoho */
93 1.1 jruoho for (i = 0; i < __arraycount(pol); i++) {
94 1.1 jruoho
95 1.1 jruoho pmax = sched_get_priority_max(pol[i]);
96 1.1 jruoho pmin = sched_get_priority_min(pol[i]);
97 1.1 jruoho
98 1.1 jruoho ATF_REQUIRE(pmax != -1);
99 1.1 jruoho ATF_REQUIRE(pmin != -1);
100 1.1 jruoho ATF_REQUIRE(pmax > pmin);
101 1.1 jruoho }
102 1.1 jruoho }
103 1.1 jruoho
104 1.1 jruoho static void
105 1.1 jruoho sched_priority_set(int pri, int pol)
106 1.1 jruoho {
107 1.1 jruoho struct sched_param sched;
108 1.1 jruoho
109 1.1 jruoho sched.sched_priority = pri;
110 1.1 jruoho
111 1.1 jruoho ATF_REQUIRE(pri >= 0);
112 1.1 jruoho ATF_REQUIRE(sched_setscheduler(0, pol, &sched) == 0);
113 1.1 jruoho
114 1.1 jruoho /*
115 1.1 jruoho * Test that the policy was changed.
116 1.1 jruoho */
117 1.5 christos ATF_CHECK_EQ(sched_getscheduler(0), pol);
118 1.1 jruoho
119 1.1 jruoho /*
120 1.1 jruoho * And that sched_getparam(3) returns the new priority.
121 1.1 jruoho */
122 1.1 jruoho sched.sched_priority = -1;
123 1.1 jruoho
124 1.1 jruoho ATF_REQUIRE(sched_getparam(0, &sched) == 0);
125 1.5 christos ATF_CHECK_EQ(sched.sched_priority, pri);
126 1.1 jruoho }
127 1.1 jruoho
128 1.1 jruoho ATF_TC(sched_setscheduler_1);
129 1.1 jruoho ATF_TC_HEAD(sched_setscheduler_1, tc)
130 1.1 jruoho {
131 1.1 jruoho atf_tc_set_md_var(tc, "descr", "sched_setscheduler(3), max, RR");
132 1.1 jruoho atf_tc_set_md_var(tc, "require.user", "root");
133 1.1 jruoho }
134 1.1 jruoho
135 1.1 jruoho ATF_TC_BODY(sched_setscheduler_1, tc)
136 1.1 jruoho {
137 1.1 jruoho int pri;
138 1.1 jruoho
139 1.1 jruoho pri = sched_get_priority_max(SCHED_RR);
140 1.1 jruoho sched_priority_set(pri, SCHED_RR);
141 1.1 jruoho }
142 1.1 jruoho
143 1.1 jruoho ATF_TC(sched_setscheduler_2);
144 1.1 jruoho ATF_TC_HEAD(sched_setscheduler_2, tc)
145 1.1 jruoho {
146 1.1 jruoho atf_tc_set_md_var(tc, "descr", "sched_setscheduler(3), min, RR");
147 1.1 jruoho atf_tc_set_md_var(tc, "require.user", "root");
148 1.1 jruoho }
149 1.1 jruoho
150 1.1 jruoho ATF_TC_BODY(sched_setscheduler_2, tc)
151 1.1 jruoho {
152 1.1 jruoho int pri;
153 1.1 jruoho
154 1.1 jruoho pri = sched_get_priority_min(SCHED_RR);
155 1.1 jruoho sched_priority_set(pri, SCHED_RR);
156 1.1 jruoho }
157 1.1 jruoho
158 1.1 jruoho ATF_TC(sched_setscheduler_3);
159 1.1 jruoho ATF_TC_HEAD(sched_setscheduler_3, tc)
160 1.1 jruoho {
161 1.1 jruoho atf_tc_set_md_var(tc, "descr", "sched_setscheduler(3), max, FIFO");
162 1.1 jruoho atf_tc_set_md_var(tc, "require.user", "root");
163 1.1 jruoho }
164 1.1 jruoho
165 1.1 jruoho ATF_TC_BODY(sched_setscheduler_3, tc)
166 1.1 jruoho {
167 1.1 jruoho int pri;
168 1.1 jruoho
169 1.1 jruoho pri = sched_get_priority_max(SCHED_FIFO);
170 1.1 jruoho sched_priority_set(pri, SCHED_FIFO);
171 1.1 jruoho }
172 1.1 jruoho
173 1.1 jruoho ATF_TC(sched_setscheduler_4);
174 1.1 jruoho ATF_TC_HEAD(sched_setscheduler_4, tc)
175 1.1 jruoho {
176 1.1 jruoho atf_tc_set_md_var(tc, "descr", "sched_setscheduler(3), min, FIFO");
177 1.1 jruoho atf_tc_set_md_var(tc, "require.user", "root");
178 1.1 jruoho }
179 1.1 jruoho
180 1.1 jruoho ATF_TC_BODY(sched_setscheduler_4, tc)
181 1.1 jruoho {
182 1.1 jruoho int pri;
183 1.1 jruoho
184 1.1 jruoho pri = sched_get_priority_min(SCHED_FIFO);
185 1.1 jruoho sched_priority_set(pri, SCHED_FIFO);
186 1.1 jruoho }
187 1.1 jruoho
188 1.1 jruoho ATF_TC(sched_rr_get_interval_1);
189 1.1 jruoho ATF_TC_HEAD(sched_rr_get_interval_1, tc)
190 1.1 jruoho {
191 1.3 christos atf_tc_set_md_var(tc, "descr", "Test sched_rr_get_interval(3), #1"
192 1.4 jruoho " (PR lib/44768)");
193 1.1 jruoho atf_tc_set_md_var(tc, "require.user", "root");
194 1.1 jruoho }
195 1.1 jruoho
196 1.1 jruoho ATF_TC_BODY(sched_rr_get_interval_1, tc)
197 1.1 jruoho {
198 1.1 jruoho struct timespec tv;
199 1.1 jruoho int pri;
200 1.1 jruoho
201 1.1 jruoho pri = sched_get_priority_min(SCHED_RR);
202 1.1 jruoho sched_priority_set(pri, SCHED_RR);
203 1.1 jruoho
204 1.1 jruoho /*
205 1.1 jruoho * This should fail with ESRCH for invalid PID.
206 1.1 jruoho */
207 1.1 jruoho ATF_REQUIRE(sched_rr_get_interval(-INT_MAX, &tv) != 0);
208 1.1 jruoho }
209 1.1 jruoho
210 1.1 jruoho ATF_TC(sched_rr_get_interval_2);
211 1.1 jruoho ATF_TC_HEAD(sched_rr_get_interval_2, tc)
212 1.1 jruoho {
213 1.1 jruoho atf_tc_set_md_var(tc, "descr", "Test sched_rr_get_interval(3), #2");
214 1.1 jruoho atf_tc_set_md_var(tc, "require.user", "root");
215 1.1 jruoho }
216 1.1 jruoho
217 1.1 jruoho ATF_TC_BODY(sched_rr_get_interval_2, tc)
218 1.1 jruoho {
219 1.1 jruoho struct timespec tv1, tv2;
220 1.1 jruoho int pri;
221 1.1 jruoho
222 1.1 jruoho pri = sched_get_priority_min(SCHED_RR);
223 1.1 jruoho sched_priority_set(pri, SCHED_RR);
224 1.1 jruoho
225 1.1 jruoho tv1.tv_sec = tv2.tv_sec = -1;
226 1.2 jruoho tv1.tv_nsec = tv2.tv_nsec = -1;
227 1.1 jruoho
228 1.1 jruoho ATF_REQUIRE(sched_rr_get_interval(0, &tv1) == 0);
229 1.1 jruoho ATF_REQUIRE(sched_rr_get_interval(getpid(), &tv2) == 0);
230 1.1 jruoho
231 1.1 jruoho ATF_REQUIRE(tv1.tv_sec != -1);
232 1.1 jruoho ATF_REQUIRE(tv2.tv_sec != -1);
233 1.1 jruoho
234 1.1 jruoho ATF_REQUIRE(tv1.tv_nsec != -1);
235 1.1 jruoho ATF_REQUIRE(tv2.tv_nsec != -1);
236 1.1 jruoho
237 1.1 jruoho ATF_REQUIRE(tv1.tv_sec == tv2.tv_sec);
238 1.1 jruoho ATF_REQUIRE(tv1.tv_nsec == tv2.tv_nsec);
239 1.1 jruoho }
240 1.1 jruoho
241 1.1 jruoho ATF_TP_ADD_TCS(tp)
242 1.1 jruoho {
243 1.1 jruoho
244 1.1 jruoho ATF_TP_ADD_TC(tp, sched_getparam);
245 1.1 jruoho ATF_TP_ADD_TC(tp, sched_priority);
246 1.1 jruoho
247 1.1 jruoho ATF_TP_ADD_TC(tp, sched_setscheduler_1);
248 1.1 jruoho ATF_TP_ADD_TC(tp, sched_setscheduler_2);
249 1.1 jruoho ATF_TP_ADD_TC(tp, sched_setscheduler_3);
250 1.1 jruoho ATF_TP_ADD_TC(tp, sched_setscheduler_4);
251 1.1 jruoho
252 1.1 jruoho ATF_TP_ADD_TC(tp, sched_rr_get_interval_1);
253 1.1 jruoho ATF_TP_ADD_TC(tp, sched_rr_get_interval_2);
254 1.1 jruoho
255 1.1 jruoho return atf_no_error();
256 1.1 jruoho }
257