1/*
2 * This file is part of rt_sigpending strace test.
3 *
4 * Copyright (c) 2016 Dmitry V. Levin <ldv@altlinux.org>
5 * Copyright (c) 2016-2017 The strace developers.
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 *    notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 *    notice, this list of conditions and the following disclaimer in the
15 *    documentation and/or other materials provided with the distribution.
16 * 3. The name of the author may not be used to endorse or promote products
17 *    derived from this software without specific prior written permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
20 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
22 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
23 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
24 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
28 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 */
30
31#include "tests.h"
32#include <asm/unistd.h>
33
34#ifdef __NR_rt_sigpending
35
36# include <assert.h>
37# include <signal.h>
38# include <stdio.h>
39# include <string.h>
40# include <unistd.h>
41
42static long
43k_sigpending(void *const set, const unsigned long size)
44{
45	return syscall(__NR_rt_sigpending, set, size);
46}
47
48static void
49iterate(const char *const text, unsigned int size, void *set)
50{
51	for (;;) {
52		if (k_sigpending(set, size)) {
53			tprintf("rt_sigpending(%p, %u) = -1 EFAULT (%m)\n",
54				set, size);
55			break;
56		}
57		if (size) {
58#if WORDS_BIGENDIAN
59			if (size < sizeof(long))
60				tprintf("rt_sigpending(%s, %u) = 0\n",
61					"[]", size);
62			else
63#endif
64				tprintf("rt_sigpending(%s, %u) = 0\n",
65					text, size);
66		} else {
67			tprintf("rt_sigpending(%p, %u) = 0\n", set, size);
68			break;
69		}
70		size >>= 1;
71		set += size;
72	}
73}
74
75int
76main(void)
77{
78	tprintf("%s", "");
79
80	const unsigned int big_size = 1024 / 8;
81	void *k_set = tail_alloc(big_size);
82	TAIL_ALLOC_OBJECT_CONST_PTR(sigset_t, libc_set);
83
84	sigemptyset(libc_set);
85	if (sigprocmask(SIG_SETMASK, libc_set, NULL))
86		perror_msg_and_fail("sigprocmask");
87
88	memset(k_set, 0, big_size);
89	unsigned int set_size = big_size;
90	for (; set_size; set_size >>= 1, k_set += set_size) {
91		if (!k_sigpending(k_set, set_size))
92			break;
93		tprintf("rt_sigpending(%p, %u) = -1 EINVAL (%m)\n",
94			k_set, set_size);
95	}
96	if (!set_size)
97		perror_msg_and_fail("rt_sigpending");
98	tprintf("rt_sigpending(%s, %u) = 0\n", "[]", set_size);
99
100	iterate("[]", set_size >> 1, k_set + (set_size >> 1));
101
102	void *const efault = k_set + (set_size >> 1);
103	assert(k_sigpending(efault, set_size) == -1);
104	tprintf("rt_sigpending(%p, %u) = -1 EFAULT (%m)\n",
105		efault, set_size);
106
107	sigaddset(libc_set, SIGHUP);
108	if (sigprocmask(SIG_SETMASK, libc_set, NULL))
109		perror_msg_and_fail("sigprocmask");
110	raise(SIGHUP);
111
112	iterate("[HUP]", set_size, k_set);
113
114	sigaddset(libc_set, SIGINT);
115	if (sigprocmask(SIG_SETMASK, libc_set, NULL))
116		perror_msg_and_fail("sigprocmask");
117	raise(SIGINT);
118
119	iterate("[HUP INT]", set_size, k_set);
120
121	tprintf("+++ exited with 0 +++\n");
122	return 0;
123}
124
125#else
126
127SKIP_MAIN_UNDEFINED("__NR_rt_sigpending")
128
129#endif
130