1*b0d29bc4SBrooks Davisdnl Copyright 2010 The Kyua Authors. 2*b0d29bc4SBrooks Davisdnl All rights reserved. 3*b0d29bc4SBrooks Davisdnl 4*b0d29bc4SBrooks Davisdnl Redistribution and use in source and binary forms, with or without 5*b0d29bc4SBrooks Davisdnl modification, are permitted provided that the following conditions are 6*b0d29bc4SBrooks Davisdnl met: 7*b0d29bc4SBrooks Davisdnl 8*b0d29bc4SBrooks Davisdnl * Redistributions of source code must retain the above copyright 9*b0d29bc4SBrooks Davisdnl notice, this list of conditions and the following disclaimer. 10*b0d29bc4SBrooks Davisdnl * Redistributions in binary form must reproduce the above copyright 11*b0d29bc4SBrooks Davisdnl notice, this list of conditions and the following disclaimer in the 12*b0d29bc4SBrooks Davisdnl documentation and/or other materials provided with the distribution. 13*b0d29bc4SBrooks Davisdnl * Neither the name of Google Inc. nor the names of its contributors 14*b0d29bc4SBrooks Davisdnl may be used to endorse or promote products derived from this software 15*b0d29bc4SBrooks Davisdnl without specific prior written permission. 16*b0d29bc4SBrooks Davisdnl 17*b0d29bc4SBrooks Davisdnl THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 18*b0d29bc4SBrooks Davisdnl "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 19*b0d29bc4SBrooks Davisdnl LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 20*b0d29bc4SBrooks Davisdnl A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 21*b0d29bc4SBrooks Davisdnl OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 22*b0d29bc4SBrooks Davisdnl SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 23*b0d29bc4SBrooks Davisdnl LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 24*b0d29bc4SBrooks Davisdnl DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 25*b0d29bc4SBrooks Davisdnl THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 26*b0d29bc4SBrooks Davisdnl (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 27*b0d29bc4SBrooks Davisdnl OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28*b0d29bc4SBrooks Davis 29*b0d29bc4SBrooks Davisdnl 30*b0d29bc4SBrooks Davisdnl KYUA_LAST_SIGNO 31*b0d29bc4SBrooks Davisdnl 32*b0d29bc4SBrooks Davisdnl Detect the last valid signal number. 33*b0d29bc4SBrooks Davisdnl 34*b0d29bc4SBrooks DavisAC_DEFUN([KYUA_LAST_SIGNO], [ 35*b0d29bc4SBrooks Davis AC_CACHE_CHECK( 36*b0d29bc4SBrooks Davis [for the last valid signal], 37*b0d29bc4SBrooks Davis [kyua_cv_signals_lastno], [ 38*b0d29bc4SBrooks Davis AC_RUN_IFELSE([AC_LANG_PROGRAM([#include <err.h> 39*b0d29bc4SBrooks Davis#include <errno.h> 40*b0d29bc4SBrooks Davis#include <signal.h> 41*b0d29bc4SBrooks Davis#include <stdio.h> 42*b0d29bc4SBrooks Davis#include <stdio.h> 43*b0d29bc4SBrooks Davis#include <stdlib.h>], [ 44*b0d29bc4SBrooks Davis static const int max_signals = 256; 45*b0d29bc4SBrooks Davis int i; 46*b0d29bc4SBrooks Davis FILE *f; 47*b0d29bc4SBrooks Davis 48*b0d29bc4SBrooks Davis i = 0; 49*b0d29bc4SBrooks Davis while (i < max_signals) { 50*b0d29bc4SBrooks Davis i++; 51*b0d29bc4SBrooks Davis if (i != SIGKILL && i != SIGSTOP) { 52*b0d29bc4SBrooks Davis struct sigaction sa; 53*b0d29bc4SBrooks Davis int ret; 54*b0d29bc4SBrooks Davis 55*b0d29bc4SBrooks Davis sa.sa_handler = SIG_DFL; 56*b0d29bc4SBrooks Davis sigemptyset(&sa.sa_mask); 57*b0d29bc4SBrooks Davis sa.sa_flags = 0; 58*b0d29bc4SBrooks Davis 59*b0d29bc4SBrooks Davis ret = sigaction(i, &sa, NULL); 60*b0d29bc4SBrooks Davis if (ret == -1) { 61*b0d29bc4SBrooks Davis warn("sigaction(%d) failed", i); 62*b0d29bc4SBrooks Davis if (errno == EINVAL) { 63*b0d29bc4SBrooks Davis i--; 64*b0d29bc4SBrooks Davis break; 65*b0d29bc4SBrooks Davis } else 66*b0d29bc4SBrooks Davis err(EXIT_FAILURE, "sigaction failed"); 67*b0d29bc4SBrooks Davis } 68*b0d29bc4SBrooks Davis } 69*b0d29bc4SBrooks Davis } 70*b0d29bc4SBrooks Davis if (i == max_signals) 71*b0d29bc4SBrooks Davis errx(EXIT_FAILURE, "too many signals"); 72*b0d29bc4SBrooks Davis 73*b0d29bc4SBrooks Davis f = fopen("conftest.cnt", "w"); 74*b0d29bc4SBrooks Davis if (f == NULL) 75*b0d29bc4SBrooks Davis err(EXIT_FAILURE, "failed to open file"); 76*b0d29bc4SBrooks Davis 77*b0d29bc4SBrooks Davis fprintf(f, "%d\n", i); 78*b0d29bc4SBrooks Davis fclose(f); 79*b0d29bc4SBrooks Davis 80*b0d29bc4SBrooks Davis return EXIT_SUCCESS; 81*b0d29bc4SBrooks Davis])], 82*b0d29bc4SBrooks Davis [if test ! -f conftest.cnt; then 83*b0d29bc4SBrooks Davis kyua_cv_signals_lastno=15 84*b0d29bc4SBrooks Davis else 85*b0d29bc4SBrooks Davis kyua_cv_signals_lastno=$(cat conftest.cnt) 86*b0d29bc4SBrooks Davis rm -f conftest.cnt 87*b0d29bc4SBrooks Davis fi], 88*b0d29bc4SBrooks Davis [kyua_cv_signals_lastno=15]) 89*b0d29bc4SBrooks Davis ]) 90*b0d29bc4SBrooks Davis AC_DEFINE_UNQUOTED([LAST_SIGNO], [${kyua_cv_signals_lastno}], 91*b0d29bc4SBrooks Davis [Define to the last valid signal number]) 92*b0d29bc4SBrooks Davis]) 93