t_sigqueue.c revision 314817 
1/* $NetBSD: t_sigqueue.c,v 1.7 2017/01/13 20:44:10 christos Exp $ */
2
3/*-
4 * Copyright (c) 2011 The NetBSD Foundation, Inc.
5 * All rights reserved.
6 *
7 * This code is derived from software contributed to The NetBSD Foundation
8 * by Christos Zoulas.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 *    notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 *    notice, this list of conditions and the following disclaimer in the
17 *    documentation and/or other materials provided with the distribution.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 * POSSIBILITY OF SUCH DAMAGE.
30 */
31
32#include <sys/cdefs.h>
33__RCSID("$NetBSD: t_sigqueue.c,v 1.7 2017/01/13 20:44:10 christos Exp $");
34
35#include <atf-c.h>
36#include <err.h>
37#include <errno.h>
38#include <signal.h>
39#include <stdio.h>
40#include <stdlib.h>
41#include <sched.h>
42#include <unistd.h>
43
44static void	handler(int, siginfo_t *, void *);
45
46#define VALUE (int)0xc001dad1
47static int value;
48
49static void
50handler(int signo __unused, siginfo_t *info, void *data __unused)
51{
52	value = info->si_value.sival_int;
53	kill(0, SIGINFO);
54}
55
56ATF_TC(sigqueue_basic);
57ATF_TC_HEAD(sigqueue_basic, tc)
58{
59	atf_tc_set_md_var(tc, "descr", "Checks sigqueue(3) sigval delivery");
60}
61
62ATF_TC_BODY(sigqueue_basic, tc)
63{
64	struct sigaction sa;
65	union sigval sv;
66
67	sa.sa_sigaction = handler;
68	sigemptyset(&sa.sa_mask);
69	sa.sa_flags = SA_SIGINFO;
70
71	if (sigaction(SIGUSR1, &sa, NULL) != 0)
72		atf_tc_fail("sigaction failed");
73
74	sv.sival_int = VALUE;
75
76#ifdef __FreeBSD__
77	/*
78	 * From kern_sig.c:
79	 * Specification says sigqueue can only send signal to single process.
80	 */
81	if (sigqueue(getpid(), SIGUSR1, sv) != 0)
82#else
83	if (sigqueue(0, SIGUSR1, sv) != 0)
84#endif
85		atf_tc_fail("sigqueue failed");
86
87	sched_yield();
88	ATF_REQUIRE_EQ(sv.sival_int, value);
89}
90
91ATF_TC(sigqueue_err);
92ATF_TC_HEAD(sigqueue_err, tc)
93{
94	atf_tc_set_md_var(tc, "descr", "Test errors from sigqueue(3)");
95}
96
97ATF_TC_BODY(sigqueue_err, tc)
98{
99	static union sigval sv;
100
101	errno = 0;
102	ATF_REQUIRE_ERRNO(EINVAL, sigqueue(getpid(), -1, sv) == -1);
103}
104
105static int signals[] = {
106	SIGINT, SIGRTMIN + 1, SIGINT, SIGRTMIN + 0, SIGRTMIN + 2,
107	SIGQUIT, SIGRTMIN + 1
108};
109#ifdef __arraycount
110#define CNT	__arraycount(signals)
111#else
112#define CNT	(sizeof(signals) / sizeof(signals[0]))
113#endif
114
115static sig_atomic_t count = 0;
116static int delivered[CNT];
117
118static void
119myhandler(int signo, siginfo_t *info, void *context __unused)
120{
121	delivered[count++] = signo;
122	printf("Signal #%zu: signo: %d\n", (size_t)count, signo);
123}
124
125static int
126asc(const void *a, const void *b)
127{
128	const int *ia = a, *ib = b;
129	return *ib - *ia;
130}
131
132/*
133 * given a array of signals to be delivered in tosend of size len
134 * place in ordered the signals to be delivered in delivery order
135 * and return the number of signals that should be delivered
136 */
137static size_t
138sigorder(int *ordered, const int *tosend, size_t len)
139{
140	memcpy(ordered, tosend, len * sizeof(*tosend));
141	qsort(ordered, len, sizeof(*ordered), asc);
142	if (len == 1)
143		return len;
144
145#ifdef __FreeBSD__
146	/*
147	 * Don't dedupe signal numbers (bug 212173)
148	 *
149	 * Per kib's comment..
150	 *
151	 * "
152	 * OTOH, FreeBSD behaviour is to treat all signals as realtime while
153	 * there is no mem shortage and siginfo can be allocated.  In
154	 * particular, signals < SIGRTMIN are not collapsed when queued more
155	 * than once.
156	 * "
157	 */
158
159	return len;
160#else
161
162	size_t i, j;
163	for (i = 0, j = 0; i < len - 1; i++) {
164		if (ordered[i] >= SIGRTMIN)
165			continue;
166		if (j == 0)
167			j = i + 1;
168		while (ordered[i] == ordered[j] && j < len)
169			j++;
170		if (j == len)
171			break;
172		ordered[i + 1] = ordered[j];
173	}
174	return i + 1;
175#endif
176}
177
178ATF_TC(sigqueue_rt);
179ATF_TC_HEAD(sigqueue_rt, tc)
180{
181	atf_tc_set_md_var(tc, "descr", "Test queuing of real-time signals");
182}
183
184ATF_TC_BODY(sigqueue_rt, tc)
185{
186	pid_t pid;
187	union sigval val;
188	struct sigaction act;
189	int ordered[CNT];
190	struct sigaction oact[CNT];
191	size_t ndelivered;
192
193	ndelivered = sigorder(ordered, signals, CNT);
194
195	act.sa_flags = SA_SIGINFO;
196	act.sa_sigaction = myhandler;
197	sigemptyset(&act.sa_mask);
198	for (size_t i = 0; i < ndelivered; i++)
199		ATF_REQUIRE(sigaction(ordered[i], &act, &oact[i]) != -1);
200
201	val.sival_int = 0;
202	pid = getpid();
203
204	sigset_t mask, orig;
205	sigemptyset(&mask);
206	for (size_t i = 0; i < CNT; i++)
207		if (sigaddset(&mask, signals[i]) == -1)
208			warn("sigaddset");
209
210	ATF_REQUIRE(sigprocmask(SIG_BLOCK, &mask, &orig) != -1);
211
212	for (size_t i = 0; i < CNT; i++)
213		ATF_REQUIRE(sigqueue(pid, signals[i], val) != -1);
214
215	ATF_REQUIRE(sigprocmask(SIG_UNBLOCK, &mask, &orig) != -1);
216	sleep(1);
217	ATF_CHECK_MSG((size_t)count == ndelivered,
218	    "count %zu != ndelivered %zu", (size_t)count, ndelivered);
219	for (size_t i = 0; i < ndelivered; i++)
220		ATF_REQUIRE_MSG(ordered[i] == delivered[i],
221		    "%zu: ordered %d != delivered %d",
222		    i, ordered[i], delivered[i]);
223
224	if ((size_t)count > ndelivered)
225		for (size_t i = ndelivered; i < (size_t)count; i++)
226			printf("Undelivered signal #%zu: %d\n", i, ordered[i]);
227
228	for (size_t i = 0; i < ndelivered; i++)
229		ATF_REQUIRE(sigaction(signals[i], &oact[i], NULL) != -1);
230}
231
232ATF_TP_ADD_TCS(tp)
233{
234
235	ATF_TP_ADD_TC(tp, sigqueue_basic);
236	ATF_TP_ADD_TC(tp, sigqueue_err);
237	ATF_TP_ADD_TC(tp, sigqueue_rt);
238
239	return atf_no_error();
240}
241