Update Red Hat Copyright Notices
[nbdkit.git] / common / include / test-ispowerof2.c
blob9620192f02498807fc075df83af895c03836d52c
1 /* nbdkit
2 * Copyright Red Hat
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are
6 * met:
8 * * Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
11 * * Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * * Neither the name of Red Hat nor the names of its contributors may be
16 * used to endorse or promote products derived from this software without
17 * specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY RED HAT AND CONTRIBUTORS ''AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
21 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
22 * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL RED HAT OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
26 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
27 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
28 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
29 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
33 #include <config.h>
35 #include <stdio.h>
36 #include <stdlib.h>
37 #include <stdint.h>
38 #include <string.h>
39 #undef NDEBUG /* Keep test strong even for nbdkit built without assertions */
40 #include <assert.h>
42 #include "ispowerof2.h"
44 int
45 main (void)
47 uint64_t i;
49 assert (! is_power_of_2 (0));
51 /* is_power_of_2 is only defined for unsigned long type, which is
52 * 32 bit on 32 bit platforms. We need to store i in a 64 bit type
53 * so the loops don't wrap around.
55 for (i = 1; i <= 0x80000000; i <<= 1)
56 assert (is_power_of_2 (i));
58 for (i = 4; i <= 0x80000000; i <<= 1)
59 assert (! is_power_of_2 (i-1));
61 /* Check log_2_bits on some known values. */
62 assert (log_2_bits (1) == 0);
63 assert (log_2_bits (512) == 9);
64 assert (log_2_bits (4096) == 12);
65 assert (log_2_bits (0x80000000) == 31);
66 #if SIZEOF_LONG == 8
67 assert (log_2_bits (0x100000000) == 32);
68 assert (log_2_bits (0x8000000000000000) == 63);
69 #endif
71 exit (EXIT_SUCCESS);