Mercurial > gnulib
view tests/test-ffs.c @ 17363:5a51fb7777a9
sys_select, sys_time: port 2013-01-30 Solaris 2.6 fix to Cygwin
Problem reported by Marco Atzeri in
<http://lists.gnu.org/archive/html/bug-gnulib/2013-03/msg00000.html>.
* lib/sys_select.in.h [HAVE_SYS_SELECT_H && _CYGWIN_SYS_TIME_H]:
Simply delegate to the system <sys/select.h> in this case too.
Also, pay attention to _GL_SYS_SELECT_H_REDIRECT_FROM_SYS_TIME_H only
if OSF/1, since otherwise Cygwin breaks, and it doesn't seem to
be needed on Solaris either.
* lib/sys_time.in.h [_CYGWIN_SYS_TIME_H]:
Simply delgate to the system <sys/time.h> in this case.
author | Paul Eggert <eggert@cs.ucla.edu> |
---|---|
date | Tue, 19 Mar 2013 09:08:47 -0700 |
parents | e542fd46ad6f |
children | 344018b6e5d7 |
line wrap: on
line source
/* * Copyright (C) 2011-2013 Free Software Foundation, Inc. * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 3 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see <http://www.gnu.org/licenses/>. */ /* Written by Eric Blake. */ #include <config.h> #include <strings.h> #include "signature.h" SIGNATURE_CHECK (ffs, int, (int)); #include <limits.h> #include "macros.h" #define NBITS (sizeof (int) * CHAR_BIT) static int naive (int i) { unsigned int j; for (j = 0; j < NBITS; j++) if (i & (1U << j)) return j + 1; return 0; } int main (int argc, char *argv[]) { int x; int i; for (x = -128; x <= 128; x++) ASSERT (ffs (x) == naive (x)); for (i = 0; i < NBITS; i++) { ASSERT (ffs (1U << i) == naive (1U << i)); ASSERT (ffs (1U << i) == i + 1); ASSERT (ffs (-1U << i) == i + 1); } for (i = 0; i < NBITS - 1; i++) { ASSERT (ffs (3U << i) == i + 1); ASSERT (ffs (-3U << i) == i + 1); } for (i = 0; i < NBITS - 2; i++) { ASSERT (ffs (5U << i) == i + 1); ASSERT (ffs (-5U << i) == i + 1); ASSERT (ffs (7U << i) == i + 1); ASSERT (ffs (-7U << i) == i + 1); } return 0; }