Dmitry V. Levin | 1165620 | 2016-02-18 00:08:30 +0000 | [diff] [blame] | 1 | /* |
| 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" |
Dmitry V. Levin | 6a2f43c | 2016-08-09 14:38:29 +0000 | [diff] [blame] | 31 | #include <asm/unistd.h> |
Dmitry V. Levin | 1165620 | 2016-02-18 00:08:30 +0000 | [diff] [blame] | 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 | |
| 41 | static long |
| 42 | k_sigpending(void *const set, const unsigned long size) |
| 43 | { |
| 44 | return syscall(__NR_rt_sigpending, set, size); |
| 45 | } |
| 46 | |
| 47 | static void |
| 48 | iterate(const char *const text, unsigned int size, void *set) |
| 49 | { |
| 50 | for (;;) { |
Dmitry V. Levin | fdb2a18 | 2016-04-19 22:16:30 +0000 | [diff] [blame] | 51 | if (k_sigpending(set, size)) { |
| 52 | tprintf("rt_sigpending(%p, %u) = -1 EFAULT (%m)\n", |
| 53 | set, size); |
| 54 | break; |
| 55 | } |
Dmitry V. Levin | 1165620 | 2016-02-18 00:08:30 +0000 | [diff] [blame] | 56 | if (size) { |
| 57 | #if WORDS_BIGENDIAN |
| 58 | if (size < sizeof(long)) |
| 59 | tprintf("rt_sigpending(%s, %u) = 0\n", |
| 60 | "[]", size); |
| 61 | else |
| 62 | #endif |
| 63 | tprintf("rt_sigpending(%s, %u) = 0\n", |
| 64 | text, size); |
| 65 | } else { |
| 66 | tprintf("rt_sigpending(%p, %u) = 0\n", set, size); |
| 67 | break; |
| 68 | } |
| 69 | size >>= 1; |
| 70 | set += size; |
| 71 | } |
| 72 | } |
| 73 | |
| 74 | int |
| 75 | main(void) |
| 76 | { |
| 77 | tprintf("%s", ""); |
| 78 | |
| 79 | const unsigned int big_size = 1024 / 8; |
| 80 | void *k_set = tail_alloc(big_size); |
| 81 | sigset_t *const libc_set = tail_alloc(sizeof(sigset_t)); |
| 82 | |
| 83 | sigemptyset(libc_set); |
| 84 | if (sigprocmask(SIG_SETMASK, libc_set, NULL)) |
| 85 | perror_msg_and_fail("sigprocmask"); |
| 86 | |
| 87 | memset(k_set, 0, big_size); |
| 88 | unsigned int set_size = big_size; |
| 89 | for (; set_size; set_size >>= 1, k_set += set_size) { |
| 90 | if (!k_sigpending(k_set, set_size)) |
| 91 | break; |
| 92 | tprintf("rt_sigpending(%p, %u) = -1 EINVAL (%m)\n", |
| 93 | k_set, set_size); |
| 94 | } |
| 95 | if (!set_size) |
| 96 | perror_msg_and_fail("rt_sigpending"); |
| 97 | tprintf("rt_sigpending(%s, %u) = 0\n", "[]", set_size); |
| 98 | |
| 99 | iterate("[]", set_size >> 1, k_set + (set_size >> 1)); |
| 100 | |
| 101 | void *const efault = k_set + (set_size >> 1); |
| 102 | assert(k_sigpending(efault, set_size) == -1); |
| 103 | tprintf("rt_sigpending(%p, %u) = -1 EFAULT (%m)\n", |
| 104 | efault, set_size); |
| 105 | |
| 106 | sigaddset(libc_set, SIGHUP); |
| 107 | if (sigprocmask(SIG_SETMASK, libc_set, NULL)) |
| 108 | perror_msg_and_fail("sigprocmask"); |
| 109 | raise(SIGHUP); |
| 110 | |
| 111 | iterate("[HUP]", set_size, k_set); |
| 112 | |
| 113 | sigaddset(libc_set, SIGINT); |
| 114 | if (sigprocmask(SIG_SETMASK, libc_set, NULL)) |
| 115 | perror_msg_and_fail("sigprocmask"); |
| 116 | raise(SIGINT); |
| 117 | |
| 118 | iterate("[HUP INT]", set_size, k_set); |
| 119 | |
| 120 | tprintf("+++ exited with 0 +++\n"); |
| 121 | return 0; |
| 122 | } |
| 123 | |
| 124 | #else |
| 125 | |
| 126 | SKIP_MAIN_UNDEFINED("__NR_rt_sigpending") |
| 127 | |
| 128 | #endif |