1 /* $NetBSD: t_bitops.c,v 1.16 2012/12/07 02:28:19 christos Exp $ */
4 * Copyright (c) 2011, 2012 The NetBSD Foundation, Inc.
7 * This code is derived from software contributed to The NetBSD Foundation
8 * by Christos Zoulas and Jukka Ruohonen.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 * POSSIBILITY OF SUCH DAMAGE.
31 #include <sys/cdefs.h>
32 __RCSID("$NetBSD: t_bitops.c,v 1.16 2012/12/07 02:28:19 christos Exp $");
36 #include <sys/cdefs.h>
37 #include <sys/bitops.h>
50 { 0x00, 0, 0 }, { 0x01, 1, 1 }, { 0x02, 2, 2 }, { 0x03, 1, 2 },
51 { 0x04, 3, 3 }, { 0x05, 1, 3 }, { 0x06, 2, 3 }, { 0x07, 1, 3 },
52 { 0x08, 4, 4 }, { 0x09, 1, 4 }, { 0x0A, 2, 4 }, { 0x0B, 1, 4 },
53 { 0x0C, 3, 4 }, { 0x0D, 1, 4 }, { 0x0E, 2, 4 }, { 0x0F, 1, 4 },
55 { 0x10, 5, 5 }, { 0x11, 1, 5 }, { 0x12, 2, 5 }, { 0x13, 1, 5 },
56 { 0x14, 3, 5 }, { 0x15, 1, 5 }, { 0x16, 2, 5 }, { 0x17, 1, 5 },
57 { 0x18, 4, 5 }, { 0x19, 1, 5 }, { 0x1A, 2, 5 }, { 0x1B, 1, 5 },
58 { 0x1C, 3, 5 }, { 0x1D, 1, 5 }, { 0x1E, 2, 5 }, { 0x1F, 1, 5 },
60 { 0xF0, 5, 8 }, { 0xF1, 1, 8 }, { 0xF2, 2, 8 }, { 0xF3, 1, 8 },
61 { 0xF4, 3, 8 }, { 0xF5, 1, 8 }, { 0xF6, 2, 8 }, { 0xF7, 1, 8 },
62 { 0xF8, 4, 8 }, { 0xF9, 1, 8 }, { 0xFA, 2, 8 }, { 0xFB, 1, 8 },
63 { 0xFC, 3, 8 }, { 0xFD, 1, 8 }, { 0xFE, 2, 8 }, { 0xFF, 1, 8 },
68 ATF_TC_HEAD(bitmap_basic
, tc
)
70 atf_tc_set_md_var(tc
, "descr", "A basic test of __BITMAP_*");
73 ATF_TC_BODY(bitmap_basic
, tc
)
75 __BITMAP_TYPE(, uint32_t, 65536) bm
;
78 ATF_REQUIRE(__BITMAP_SIZE(uint32_t, 65536) == 2048);
80 ATF_REQUIRE(__BITMAP_SHIFT(uint32_t) == 5);
82 ATF_REQUIRE(__BITMAP_MASK(uint32_t) == 31);
84 for (size_t i
= 0; i
< 65536; i
+= 2)
87 for (size_t i
= 0; i
< 2048; i
++)
88 ATF_REQUIRE(bm
._b
[i
] == 0x55555555);
90 for (size_t i
= 0; i
< 65536; i
++)
92 ATF_REQUIRE(!__BITMAP_ISSET(i
, &bm
));
94 ATF_REQUIRE(__BITMAP_ISSET(i
, &bm
));
98 for (size_t i
= 0; i
< 65536; i
+= 2)
99 ATF_REQUIRE(!__BITMAP_ISSET(i
, &bm
));
102 ATF_TC(fast_divide32
);
103 ATF_TC_HEAD(fast_divide32
, tc
)
105 atf_tc_set_md_var(tc
, "descr", "A basic test of fast_divide32(3)");
108 ATF_TC_BODY(fast_divide32
, tc
)
110 uint32_t a
, b
, q
, r
, m
;
116 fast_divide32_prepare(b
, &m
, &s1
, &s2
);
118 q
= fast_divide32(a
, b
, m
, s1
, s2
);
119 r
= fast_remainder32(a
, b
, m
, s1
, s2
);
121 ATF_REQUIRE(q
== 0x1111 && r
== 0);
123 for (i
= 1; i
< __arraycount(bits
); i
++) {
128 fast_divide32_prepare(b
, &m
, &s1
, &s2
);
130 q
= fast_divide32(a
, b
, m
, s1
, s2
);
131 r
= fast_remainder32(a
, b
, m
, s1
, s2
);
133 ATF_REQUIRE(q
== a
/ b
);
134 ATF_REQUIRE(r
== a
% b
);
139 ATF_TC_HEAD(ffsfls
, tc
)
141 atf_tc_set_md_var(tc
, "descr", "Test ffs32(3)-family for correctness");
144 ATF_TC_BODY(ffsfls
, tc
)
148 ATF_REQUIRE(ffs32(0) == 0x00);
149 ATF_REQUIRE(fls32(0) == 0x00);
150 ATF_REQUIRE(ffs64(0) == 0x00);
151 ATF_REQUIRE(fls64(0) == 0x00);
153 ATF_REQUIRE(ffs32(UINT32_MAX
) == 0x01);
154 ATF_REQUIRE(fls32(UINT32_MAX
) == 0x20);
155 ATF_REQUIRE(ffs64(UINT64_MAX
) == 0x01);
156 ATF_REQUIRE(fls64(UINT64_MAX
) == 0x40);
158 for (i
= 1; i
< __arraycount(bits
); i
++) {
160 ATF_REQUIRE(ffs32(bits
[i
].val
) == bits
[i
].ffs
);
161 ATF_REQUIRE(fls32(bits
[i
].val
) == bits
[i
].fls
);
162 ATF_REQUIRE(ffs64(bits
[i
].val
) == bits
[i
].ffs
);
163 ATF_REQUIRE(fls64(bits
[i
].val
) == bits
[i
].fls
);
165 ATF_REQUIRE(ffs32(bits
[i
].val
<< 1) == bits
[i
].ffs
+ 1);
166 ATF_REQUIRE(fls32(bits
[i
].val
<< 1) == bits
[i
].fls
+ 1);
167 ATF_REQUIRE(ffs64(bits
[i
].val
<< 1) == bits
[i
].ffs
+ 1);
168 ATF_REQUIRE(fls64(bits
[i
].val
<< 1) == bits
[i
].fls
+ 1);
170 ATF_REQUIRE(ffs32(bits
[i
].val
<< 9) == bits
[i
].ffs
+ 9);
171 ATF_REQUIRE(fls32(bits
[i
].val
<< 9) == bits
[i
].fls
+ 9);
172 ATF_REQUIRE(ffs64(bits
[i
].val
<< 9) == bits
[i
].ffs
+ 9);
173 ATF_REQUIRE(fls64(bits
[i
].val
<< 9) == bits
[i
].fls
+ 9);
178 ATF_TC_HEAD(ilog2_basic
, tc
)
180 atf_tc_set_md_var(tc
, "descr", "Test ilog2(3) for correctness");
183 ATF_TC_BODY(ilog2_basic
, tc
)
187 for (i
= x
= 0; i
< 64; i
++) {
189 x
= (uint64_t)1 << i
;
191 ATF_REQUIRE(i
== (uint64_t)ilog2(x
));
196 ATF_TC_HEAD(ilog2_log2
, tc
)
198 atf_tc_set_md_var(tc
, "descr", "Test log2(3) vs. ilog2(3)");
201 ATF_TC_BODY(ilog2_log2
, tc
)
204 atf_tc_skip("Test is unavailable on vax because of lack of log2()");
210 * This may fail under QEMU; see PR misc/44767.
212 for (i
= 1; i
< UINT32_MAX
; i
+= UINT16_MAX
) {
215 y
= (double)(ilog2(i
));
217 ATF_REQUIRE(ceil(x
) >= y
);
219 if (fabs(floor(x
) - y
) > 1.0e-40) {
220 atf_tc_expect_fail("PR misc/44767");
221 atf_tc_fail("log2(%"PRIu64
") != "
222 "ilog2(%"PRIu64
")", i
, i
);
231 ATF_TP_ADD_TC(tp
, bitmap_basic
);
232 ATF_TP_ADD_TC(tp
, fast_divide32
);
233 ATF_TP_ADD_TC(tp
, ffsfls
);
234 ATF_TP_ADD_TC(tp
, ilog2_basic
);
235 ATF_TP_ADD_TC(tp
, ilog2_log2
);
237 return atf_no_error();