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