Home | History | Annotate | Line # | Download | only in sys
t_bitops.c revision 1.16
      1  1.16  christos /*	$NetBSD: t_bitops.c,v 1.16 2012/12/07 02:28:19 christos Exp $ */
      2   1.1    jruoho 
      3   1.1    jruoho /*-
      4  1.15    jruoho  * Copyright (c) 2011, 2012 The NetBSD Foundation, Inc.
      5   1.1    jruoho  * All rights reserved.
      6   1.1    jruoho  *
      7   1.1    jruoho  * This code is derived from software contributed to The NetBSD Foundation
      8  1.15    jruoho  * by Christos Zoulas and Jukka Ruohonen.
      9   1.1    jruoho  *
     10   1.1    jruoho  * Redistribution and use in source and binary forms, with or without
     11   1.1    jruoho  * modification, are permitted provided that the following conditions
     12   1.1    jruoho  * are met:
     13   1.1    jruoho  * 1. Redistributions of source code must retain the above copyright
     14   1.1    jruoho  *    notice, this list of conditions and the following disclaimer.
     15   1.1    jruoho  * 2. Redistributions in binary form must reproduce the above copyright
     16   1.1    jruoho  *    notice, this list of conditions and the following disclaimer in the
     17   1.1    jruoho  *    documentation and/or other materials provided with the distribution.
     18   1.1    jruoho  *
     19   1.1    jruoho  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     20   1.1    jruoho  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     21   1.1    jruoho  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     22   1.1    jruoho  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     23   1.1    jruoho  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     24   1.1    jruoho  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     25   1.1    jruoho  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     26   1.1    jruoho  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     27   1.1    jruoho  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     28   1.1    jruoho  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     29   1.1    jruoho  * POSSIBILITY OF SUCH DAMAGE.
     30   1.1    jruoho  */
     31   1.7    jruoho #include <sys/cdefs.h>
     32  1.16  christos __RCSID("$NetBSD: t_bitops.c,v 1.16 2012/12/07 02:28:19 christos Exp $");
     33   1.1    jruoho 
     34   1.1    jruoho #include <atf-c.h>
     35   1.1    jruoho 
     36   1.2    jruoho #include <sys/cdefs.h>
     37   1.1    jruoho #include <sys/bitops.h>
     38   1.2    jruoho 
     39   1.1    jruoho #include <math.h>
     40  1.11    jruoho #include <inttypes.h>
     41   1.5    jruoho #include <stdlib.h>
     42   1.8    jruoho #include <string.h>
     43   1.1    jruoho 
     44   1.2    jruoho static const struct {
     45   1.2    jruoho 	uint32_t	val;
     46   1.2    jruoho 	int		ffs;
     47   1.2    jruoho 	int		fls;
     48   1.2    jruoho } bits[] = {
     49   1.2    jruoho 
     50   1.2    jruoho 	{ 0x00, 0, 0 }, { 0x01, 1, 1 },	{ 0x02, 2, 2 },	{ 0x03, 1, 2 },
     51   1.2    jruoho 	{ 0x04, 3, 3 }, { 0x05, 1, 3 },	{ 0x06, 2, 3 },	{ 0x07, 1, 3 },
     52   1.2    jruoho 	{ 0x08, 4, 4 }, { 0x09, 1, 4 },	{ 0x0A, 2, 4 },	{ 0x0B, 1, 4 },
     53   1.2    jruoho 	{ 0x0C, 3, 4 }, { 0x0D, 1, 4 },	{ 0x0E, 2, 4 },	{ 0x0F, 1, 4 },
     54   1.2    jruoho 
     55   1.2    jruoho 	{ 0x10, 5, 5 },	{ 0x11, 1, 5 },	{ 0x12, 2, 5 },	{ 0x13, 1, 5 },
     56   1.2    jruoho 	{ 0x14, 3, 5 },	{ 0x15, 1, 5 },	{ 0x16, 2, 5 },	{ 0x17, 1, 5 },
     57   1.2    jruoho 	{ 0x18, 4, 5 },	{ 0x19, 1, 5 },	{ 0x1A, 2, 5 },	{ 0x1B, 1, 5 },
     58   1.2    jruoho 	{ 0x1C, 3, 5 },	{ 0x1D, 1, 5 },	{ 0x1E, 2, 5 },	{ 0x1F, 1, 5 },
     59   1.2    jruoho 
     60   1.2    jruoho 	{ 0xF0, 5, 8 },	{ 0xF1, 1, 8 },	{ 0xF2, 2, 8 },	{ 0xF3, 1, 8 },
     61   1.2    jruoho 	{ 0xF4, 3, 8 },	{ 0xF5, 1, 8 },	{ 0xF6, 2, 8 },	{ 0xF7, 1, 8 },
     62   1.2    jruoho 	{ 0xF8, 4, 8 },	{ 0xF9, 1, 8 },	{ 0xFA, 2, 8 },	{ 0xFB, 1, 8 },
     63   1.2    jruoho 	{ 0xFC, 3, 8 },	{ 0xFD, 1, 8 },	{ 0xFE, 2, 8 },	{ 0xFF, 1, 8 },
     64   1.2    jruoho 
     65   1.2    jruoho };
     66   1.2    jruoho 
     67  1.15    jruoho ATF_TC(bitmap_basic);
     68  1.15    jruoho ATF_TC_HEAD(bitmap_basic, tc)
     69  1.15    jruoho {
     70  1.15    jruoho         atf_tc_set_md_var(tc, "descr", "A basic test of __BITMAP_*");
     71  1.15    jruoho }
     72  1.15    jruoho 
     73  1.15    jruoho ATF_TC_BODY(bitmap_basic, tc)
     74  1.15    jruoho {
     75  1.16  christos 	__BITMAP_TYPE(, uint32_t, 65536) bm;
     76  1.16  christos 	__BITMAP_ZERO(&bm);
     77  1.15    jruoho 
     78  1.15    jruoho 	ATF_REQUIRE(__BITMAP_SIZE(uint32_t, 65536) == 2048);
     79  1.15    jruoho 
     80  1.15    jruoho 	ATF_REQUIRE(__BITMAP_SHIFT(uint32_t) == 5);
     81  1.15    jruoho 
     82  1.15    jruoho 	ATF_REQUIRE(__BITMAP_MASK(uint32_t) == 31);
     83  1.15    jruoho 
     84  1.15    jruoho 	for (size_t i = 0; i < 65536; i += 2)
     85  1.16  christos 		__BITMAP_SET(i, &bm);
     86  1.15    jruoho 
     87  1.15    jruoho 	for (size_t i = 0; i < 2048; i++)
     88  1.16  christos 		ATF_REQUIRE(bm._b[i] == 0x55555555);
     89  1.15    jruoho 
     90  1.15    jruoho 	for (size_t i = 0; i < 65536; i++)
     91  1.15    jruoho 		if (i & 1)
     92  1.16  christos 			ATF_REQUIRE(!__BITMAP_ISSET(i, &bm));
     93  1.15    jruoho 		else {
     94  1.16  christos 			ATF_REQUIRE(__BITMAP_ISSET(i, &bm));
     95  1.16  christos 			__BITMAP_CLR(i, &bm);
     96  1.15    jruoho 		}
     97  1.15    jruoho 
     98  1.15    jruoho 	for (size_t i = 0; i < 65536; i += 2)
     99  1.16  christos 		ATF_REQUIRE(!__BITMAP_ISSET(i, &bm));
    100  1.15    jruoho }
    101  1.15    jruoho 
    102   1.3    jruoho ATF_TC(fast_divide32);
    103   1.3    jruoho ATF_TC_HEAD(fast_divide32, tc)
    104   1.3    jruoho {
    105   1.3    jruoho 	atf_tc_set_md_var(tc, "descr", "A basic test of fast_divide32(3)");
    106   1.3    jruoho }
    107   1.3    jruoho 
    108   1.3    jruoho ATF_TC_BODY(fast_divide32, tc)
    109   1.3    jruoho {
    110   1.3    jruoho 	uint32_t a, b, q, r, m;
    111   1.3    jruoho 	uint8_t i, s1, s2;
    112   1.3    jruoho 
    113   1.3    jruoho 	a = 0xFFFF;
    114   1.3    jruoho 	b = 0x000F;
    115   1.3    jruoho 
    116   1.3    jruoho 	fast_divide32_prepare(b, &m, &s1, &s2);
    117   1.3    jruoho 
    118   1.3    jruoho 	q = fast_divide32(a, b, m, s1, s2);
    119   1.3    jruoho 	r = fast_remainder32(a, b, m, s1, s2);
    120   1.3    jruoho 
    121   1.3    jruoho 	ATF_REQUIRE(q == 0x1111 && r == 0);
    122   1.3    jruoho 
    123   1.3    jruoho 	for (i = 1; i < __arraycount(bits); i++) {
    124   1.3    jruoho 
    125   1.3    jruoho 		a = bits[i].val;
    126   1.3    jruoho 		b = bits[i].ffs;
    127   1.3    jruoho 
    128   1.3    jruoho 		fast_divide32_prepare(b, &m, &s1, &s2);
    129   1.3    jruoho 
    130   1.3    jruoho 		q = fast_divide32(a, b, m, s1, s2);
    131   1.3    jruoho 		r = fast_remainder32(a, b, m, s1, s2);
    132   1.3    jruoho 
    133   1.3    jruoho 		ATF_REQUIRE(q == a / b);
    134   1.3    jruoho 		ATF_REQUIRE(r == a % b);
    135   1.3    jruoho 	}
    136   1.3    jruoho }
    137   1.3    jruoho 
    138   1.2    jruoho ATF_TC(ffsfls);
    139   1.2    jruoho ATF_TC_HEAD(ffsfls, tc)
    140   1.2    jruoho {
    141   1.2    jruoho 	atf_tc_set_md_var(tc, "descr", "Test ffs32(3)-family for correctness");
    142   1.2    jruoho }
    143   1.2    jruoho 
    144   1.2    jruoho ATF_TC_BODY(ffsfls, tc)
    145   1.2    jruoho {
    146   1.2    jruoho 	uint8_t i;
    147   1.2    jruoho 
    148   1.2    jruoho 	ATF_REQUIRE(ffs32(0) == 0x00);
    149   1.2    jruoho 	ATF_REQUIRE(fls32(0) == 0x00);
    150   1.2    jruoho 	ATF_REQUIRE(ffs64(0) == 0x00);
    151   1.2    jruoho 	ATF_REQUIRE(fls64(0) == 0x00);
    152   1.2    jruoho 
    153   1.2    jruoho 	ATF_REQUIRE(ffs32(UINT32_MAX) == 0x01);
    154   1.2    jruoho 	ATF_REQUIRE(fls32(UINT32_MAX) == 0x20);
    155   1.2    jruoho 	ATF_REQUIRE(ffs64(UINT64_MAX) == 0x01);
    156   1.2    jruoho 	ATF_REQUIRE(fls64(UINT64_MAX) == 0x40);
    157   1.2    jruoho 
    158   1.2    jruoho 	for (i = 1; i < __arraycount(bits); i++) {
    159   1.2    jruoho 
    160   1.2    jruoho 		ATF_REQUIRE(ffs32(bits[i].val) == bits[i].ffs);
    161   1.2    jruoho 		ATF_REQUIRE(fls32(bits[i].val) == bits[i].fls);
    162   1.2    jruoho 		ATF_REQUIRE(ffs64(bits[i].val) == bits[i].ffs);
    163   1.2    jruoho 		ATF_REQUIRE(fls64(bits[i].val) == bits[i].fls);
    164   1.2    jruoho 
    165   1.2    jruoho 		ATF_REQUIRE(ffs32(bits[i].val << 1) == bits[i].ffs + 1);
    166   1.2    jruoho 		ATF_REQUIRE(fls32(bits[i].val << 1) == bits[i].fls + 1);
    167   1.2    jruoho 		ATF_REQUIRE(ffs64(bits[i].val << 1) == bits[i].ffs + 1);
    168   1.2    jruoho 		ATF_REQUIRE(fls64(bits[i].val << 1) == bits[i].fls + 1);
    169   1.2    jruoho 
    170   1.2    jruoho 		ATF_REQUIRE(ffs32(bits[i].val << 9) == bits[i].ffs + 9);
    171   1.2    jruoho 		ATF_REQUIRE(fls32(bits[i].val << 9) == bits[i].fls + 9);
    172   1.2    jruoho 		ATF_REQUIRE(ffs64(bits[i].val << 9) == bits[i].ffs + 9);
    173   1.2    jruoho 		ATF_REQUIRE(fls64(bits[i].val << 9) == bits[i].fls + 9);
    174   1.2    jruoho 	}
    175   1.2    jruoho }
    176   1.2    jruoho 
    177   1.8    jruoho ATF_TC(ilog2_basic);
    178   1.8    jruoho ATF_TC_HEAD(ilog2_basic, tc)
    179   1.1    jruoho {
    180   1.1    jruoho 	atf_tc_set_md_var(tc, "descr", "Test ilog2(3) for correctness");
    181   1.1    jruoho }
    182   1.1    jruoho 
    183   1.8    jruoho ATF_TC_BODY(ilog2_basic, tc)
    184   1.1    jruoho {
    185   1.1    jruoho 	uint64_t i, x;
    186   1.1    jruoho 
    187   1.1    jruoho 	for (i = x = 0; i < 64; i++) {
    188   1.1    jruoho 
    189   1.1    jruoho 		x = (uint64_t)1 << i;
    190   1.1    jruoho 
    191   1.1    jruoho 		ATF_REQUIRE(i == (uint64_t)ilog2(x));
    192   1.1    jruoho 	}
    193   1.1    jruoho }
    194   1.1    jruoho 
    195   1.8    jruoho ATF_TC(ilog2_log2);
    196   1.8    jruoho ATF_TC_HEAD(ilog2_log2, tc)
    197   1.1    jruoho {
    198   1.1    jruoho 	atf_tc_set_md_var(tc, "descr", "Test log2(3) vs. ilog2(3)");
    199   1.1    jruoho }
    200   1.1    jruoho 
    201   1.8    jruoho ATF_TC_BODY(ilog2_log2, tc)
    202   1.1    jruoho {
    203  1.13  christos #ifdef __vax__
    204  1.12  christos 	atf_tc_skip("Test is unavailable on vax because of lack of log2()");
    205  1.12  christos #else
    206   1.1    jruoho 	double  x, y;
    207   1.1    jruoho 	uint64_t i;
    208   1.1    jruoho 
    209   1.5    jruoho 	/*
    210   1.5    jruoho 	 * This may fail under QEMU; see PR misc/44767.
    211   1.5    jruoho 	 */
    212   1.1    jruoho 	for (i = 1; i < UINT32_MAX; i += UINT16_MAX) {
    213   1.1    jruoho 
    214   1.1    jruoho 		x = log2(i);
    215   1.1    jruoho 		y = (double)(ilog2(i));
    216   1.1    jruoho 
    217   1.1    jruoho 		ATF_REQUIRE(ceil(x) >= y);
    218  1.11    jruoho 
    219  1.11    jruoho 		if (fabs(floor(x) - y) > 1.0e-40) {
    220  1.11    jruoho 			atf_tc_expect_fail("PR misc/44767");
    221  1.14  pgoyette 			atf_tc_fail("log2(%"PRIu64") != "
    222  1.11    jruoho 			    "ilog2(%"PRIu64")", i, i);
    223  1.11    jruoho 		}
    224   1.1    jruoho 	}
    225  1.12  christos #endif
    226   1.1    jruoho }
    227   1.1    jruoho 
    228   1.1    jruoho ATF_TP_ADD_TCS(tp)
    229   1.1    jruoho {
    230   1.1    jruoho 
    231  1.15    jruoho         ATF_TP_ADD_TC(tp, bitmap_basic);
    232   1.3    jruoho 	ATF_TP_ADD_TC(tp, fast_divide32);
    233   1.2    jruoho 	ATF_TP_ADD_TC(tp, ffsfls);
    234   1.8    jruoho 	ATF_TP_ADD_TC(tp, ilog2_basic);
    235   1.8    jruoho 	ATF_TP_ADD_TC(tp, ilog2_log2);
    236   1.1    jruoho 
    237   1.1    jruoho 	return atf_no_error();
    238   1.1    jruoho }
    239