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