2
* Copyright (C) 2007 Free Software Foundation
4
* This program is free software; you can redistribute it and/or modify
5
* it under the terms of the GNU General Public License as published by
6
* the Free Software Foundation; either version 2, or (at your option)
9
* This program is distributed in the hope that it will be useful,
10
* but WITHOUT ANY WARRANTY; without even the implied warranty of
11
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12
* GNU General Public License for more details.
14
* You should have received a copy of the GNU General Public License
15
* along with this program; if not, write to the Free Software
16
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
19
/* Written by Ben Pfaff. */
23
#include "count-one-bits.h"
29
#define ASSERT(expr) \
34
fprintf (stderr, "%s:%d: assertion \"%s\" failed\n", \
35
__FILE__, __LINE__, #expr); \
41
#define UINT_BIT (sizeof (unsigned int) * CHAR_BIT)
42
#define ULONG_BIT (sizeof (unsigned long int) * CHAR_BIT)
43
#define ULLONG_BIT (sizeof (unsigned long long int) * CHAR_BIT)
46
# define HALF (1ULL << (sizeof (unsigned long long int) * CHAR_BIT - 1))
47
# define ULLONG_MAX (HALF - 1 + HALF)
51
main (int argc, char *argv[])
55
#define TEST_COUNT_ONE_BITS(FUNC, TYPE, BITS, MAX, ONE) \
56
ASSERT (FUNC (0) == 0); \
57
for (i = 0; i < BITS; i++) \
59
ASSERT (FUNC (ONE << i) == 1); \
60
for (j = i + 1; j < BITS; j++) \
61
ASSERT (FUNC ((ONE << i) | (ONE << j)) == 2); \
63
for (i = 0; i < 1000; i++) \
65
TYPE value = rand () ^ (rand () << 31 << 1); \
67
for (j = 0; j < BITS; j++) \
68
count += (value & (ONE << j)) != 0; \
69
ASSERT (count == FUNC (value)); \
71
ASSERT (FUNC (MAX) == BITS);
73
TEST_COUNT_ONE_BITS (count_one_bits, unsigned int, UINT_BIT, UINT_MAX, 1U);
74
TEST_COUNT_ONE_BITS (count_one_bits_l, unsigned long int,
75
ULONG_BIT, ULONG_MAX, 1UL);
76
#ifdef HAVE_UNSIGNED_LONG_LONG_INT
77
TEST_COUNT_ONE_BITS (count_one_bits_ll,
78
unsigned long long int, ULLONG_BIT, ULLONG_MAX, 1ULL);