t_sched.c revision 272458 
10SN/A/* $NetBSD: t_sched.c,v 1.5 2012/03/25 04:11:42 christos Exp $ */
215381Svaleriep
30SN/A/*-
40SN/A * Copyright (c) 2011 The NetBSD Foundation, Inc.
50SN/A * All rights reserved.
60SN/A *
72362SN/A * This code is derived from software contributed to The NetBSD Foundation
80SN/A * by Jukka Ruohonen.
92362SN/A *
100SN/A * Redistribution and use in source and binary forms, with or without
110SN/A * modification, are permitted provided that the following conditions
120SN/A * are met:
130SN/A * 1. Redistributions of source code must retain the above copyright
140SN/A *    notice, this list of conditions and the following disclaimer.
150SN/A * 2. Redistributions in binary form must reproduce the above copyright
160SN/A *    notice, this list of conditions and the following disclaimer in the
170SN/A *    documentation and/or other materials provided with the distribution.
180SN/A *
190SN/A * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
200SN/A * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
212362SN/A * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
222362SN/A * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
232362SN/A * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
240SN/A * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
250SN/A * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
260SN/A * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
270SN/A * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
280SN/A * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
290SN/A * POSSIBILITY OF SUCH DAMAGE.
300SN/A */
310SN/A#include <sys/cdefs.h>
320SN/A__RCSID("$NetBSD: t_sched.c,v 1.5 2012/03/25 04:11:42 christos Exp $");
330SN/A
3415381Svaleriep#include <sched.h>
3515381Svaleriep#include <limits.h>
360SN/A#include <unistd.h>
370SN/A
380SN/A#include <atf-c.h>
390SN/A
400SN/Astatic void	 sched_priority_set(int, int);
410SN/A
420SN/AATF_TC(sched_getparam);
430SN/AATF_TC_HEAD(sched_getparam, tc)
440SN/A{
450SN/A	atf_tc_set_md_var(tc, "descr", "A basic test of sched_getparam(3)");
460SN/A}
470SN/A
480SN/AATF_TC_BODY(sched_getparam, tc)
490SN/A{
500SN/A	struct sched_param s1, s2;
510SN/A	pid_t p = getpid();
520SN/A
530SN/A	/*
540SN/A	 * IEEE Std 1003.1-2008: if the supplied pid is zero,
550SN/A	 * the parameters for the calling process are returned.
560SN/A	 */
570SN/A	ATF_REQUIRE(sched_getparam(0, &s1) == 0);
580SN/A	ATF_REQUIRE(sched_getparam(p, &s2) == 0);
590SN/A
600SN/A	ATF_CHECK_EQ(s1.sched_priority, s2.sched_priority);
610SN/A
620SN/A	/*
630SN/A	 * The behavior is undefined but should error
640SN/A	 * out in case the supplied PID is negative.
650SN/A	 */
6615381Svaleriep	ATF_REQUIRE(sched_getparam(-1, &s1) != 0);
670SN/A}
680SN/A
690SN/AATF_TC(sched_priority);
700SN/AATF_TC_HEAD(sched_priority, tc)
710SN/A{
720SN/A	atf_tc_set_md_var(tc, "descr", "Test sched(3) priority ranges");
730SN/A}
740SN/A
750SN/AATF_TC_BODY(sched_priority, tc)
760SN/A{
770SN/A	static const int pol[3] = { SCHED_OTHER, SCHED_FIFO, SCHED_RR };
780SN/A	int pmax, pmin;
790SN/A	size_t i;
800SN/A
813384SN/A	/*
820SN/A	 * Test that bogus values error out.
830SN/A	 */
840SN/A	if (INT_MAX > SCHED_RR)
850SN/A		ATF_REQUIRE(sched_get_priority_max(INT_MAX) != 0);
860SN/A
870SN/A	if (-INT_MAX < SCHED_OTHER)
880SN/A		ATF_REQUIRE(sched_get_priority_max(-INT_MAX) != 0);
89
90	/*
91	 * Test that we have a valid range.
92	 */
93	for (i = 0; i < __arraycount(pol); i++) {
94
95		pmax = sched_get_priority_max(pol[i]);
96		pmin = sched_get_priority_min(pol[i]);
97
98		ATF_REQUIRE(pmax != -1);
99		ATF_REQUIRE(pmin != -1);
100		ATF_REQUIRE(pmax > pmin);
101	}
102}
103
104static void
105sched_priority_set(int pri, int pol)
106{
107	struct sched_param sched;
108
109	sched.sched_priority = pri;
110
111	ATF_REQUIRE(pri >= 0);
112	ATF_REQUIRE(sched_setscheduler(0, pol, &sched) == 0);
113
114	/*
115	 * Test that the policy was changed.
116	 */
117	ATF_CHECK_EQ(sched_getscheduler(0), pol);
118
119	/*
120	 * And that sched_getparam(3) returns the new priority.
121	 */
122	sched.sched_priority = -1;
123
124	ATF_REQUIRE(sched_getparam(0, &sched) == 0);
125	ATF_CHECK_EQ(sched.sched_priority, pri);
126}
127
128ATF_TC(sched_setscheduler_1);
129ATF_TC_HEAD(sched_setscheduler_1, tc)
130{
131	atf_tc_set_md_var(tc, "descr", "sched_setscheduler(3), max, RR");
132	atf_tc_set_md_var(tc, "require.user", "root");
133}
134
135ATF_TC_BODY(sched_setscheduler_1, tc)
136{
137	int pri;
138
139	pri = sched_get_priority_max(SCHED_RR);
140	sched_priority_set(pri, SCHED_RR);
141}
142
143ATF_TC(sched_setscheduler_2);
144ATF_TC_HEAD(sched_setscheduler_2, tc)
145{
146	atf_tc_set_md_var(tc, "descr", "sched_setscheduler(3), min, RR");
147	atf_tc_set_md_var(tc, "require.user", "root");
148}
149
150ATF_TC_BODY(sched_setscheduler_2, tc)
151{
152	int pri;
153
154	pri = sched_get_priority_min(SCHED_RR);
155	sched_priority_set(pri, SCHED_RR);
156}
157
158ATF_TC(sched_setscheduler_3);
159ATF_TC_HEAD(sched_setscheduler_3, tc)
160{
161	atf_tc_set_md_var(tc, "descr", "sched_setscheduler(3), max, FIFO");
162	atf_tc_set_md_var(tc, "require.user", "root");
163}
164
165ATF_TC_BODY(sched_setscheduler_3, tc)
166{
167	int pri;
168
169	pri = sched_get_priority_max(SCHED_FIFO);
170	sched_priority_set(pri, SCHED_FIFO);
171}
172
173ATF_TC(sched_setscheduler_4);
174ATF_TC_HEAD(sched_setscheduler_4, tc)
175{
176	atf_tc_set_md_var(tc, "descr", "sched_setscheduler(3), min, FIFO");
177	atf_tc_set_md_var(tc, "require.user", "root");
178}
179
180ATF_TC_BODY(sched_setscheduler_4, tc)
181{
182	int pri;
183
184	pri = sched_get_priority_min(SCHED_FIFO);
185	sched_priority_set(pri, SCHED_FIFO);
186}
187
188ATF_TC(sched_rr_get_interval_1);
189ATF_TC_HEAD(sched_rr_get_interval_1, tc)
190{
191	atf_tc_set_md_var(tc, "descr", "Test sched_rr_get_interval(3), #1"
192	    " (PR lib/44768)");
193	atf_tc_set_md_var(tc, "require.user", "root");
194}
195
196ATF_TC_BODY(sched_rr_get_interval_1, tc)
197{
198	struct timespec tv;
199	int pri;
200
201	pri = sched_get_priority_min(SCHED_RR);
202	sched_priority_set(pri, SCHED_RR);
203
204	/*
205	 * This should fail with ESRCH for invalid PID.
206	 */
207	ATF_REQUIRE(sched_rr_get_interval(-INT_MAX, &tv) != 0);
208}
209
210ATF_TC(sched_rr_get_interval_2);
211ATF_TC_HEAD(sched_rr_get_interval_2, tc)
212{
213	atf_tc_set_md_var(tc, "descr", "Test sched_rr_get_interval(3), #2");
214	atf_tc_set_md_var(tc, "require.user", "root");
215}
216
217ATF_TC_BODY(sched_rr_get_interval_2, tc)
218{
219	struct timespec tv1, tv2;
220	int pri;
221
222	pri = sched_get_priority_min(SCHED_RR);
223	sched_priority_set(pri, SCHED_RR);
224
225	tv1.tv_sec = tv2.tv_sec = -1;
226	tv1.tv_nsec = tv2.tv_nsec = -1;
227
228	ATF_REQUIRE(sched_rr_get_interval(0, &tv1) == 0);
229	ATF_REQUIRE(sched_rr_get_interval(getpid(), &tv2) == 0);
230
231	ATF_REQUIRE(tv1.tv_sec != -1);
232	ATF_REQUIRE(tv2.tv_sec != -1);
233
234	ATF_REQUIRE(tv1.tv_nsec != -1);
235	ATF_REQUIRE(tv2.tv_nsec != -1);
236
237	ATF_REQUIRE(tv1.tv_sec == tv2.tv_sec);
238	ATF_REQUIRE(tv1.tv_nsec == tv2.tv_nsec);
239}
240
241ATF_TP_ADD_TCS(tp)
242{
243
244	ATF_TP_ADD_TC(tp, sched_getparam);
245	ATF_TP_ADD_TC(tp, sched_priority);
246
247	ATF_TP_ADD_TC(tp, sched_setscheduler_1);
248	ATF_TP_ADD_TC(tp, sched_setscheduler_2);
249	ATF_TP_ADD_TC(tp, sched_setscheduler_3);
250	ATF_TP_ADD_TC(tp, sched_setscheduler_4);
251
252	ATF_TP_ADD_TC(tp, sched_rr_get_interval_1);
253	ATF_TP_ADD_TC(tp, sched_rr_get_interval_2);
254
255	return atf_no_error();
256}
257