popcount32.c revision 1.3 
1/*	$NetBSD: popcount32.c,v 1.3 2009/07/21 19:56:55 drochner Exp $	*/
2/*-
3 * Copyright (c) 2009 The NetBSD Foundation, Inc.
4 * All rights reserved.
5 *
6 * This code is derived from software contributed to The NetBSD Foundation
7 * by Joerg Sonnenberger.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 *
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
17 *    the documentation and/or other materials provided with the
18 *    distribution.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
23 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE
24 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
25 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
26 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
27 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
28 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
29 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
30 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 */
33
34#include <sys/cdefs.h>
35__RCSID("$NetBSD: popcount32.c,v 1.3 2009/07/21 19:56:55 drochner Exp $");
36
37#if !defined(_KERNEL) && !defined(_STANDALONE)
38#include <limits.h>
39#include <strings.h>
40#else
41#include <lib/libkern/libkern.h>
42#include <machine/limits.h>
43#endif
44
45/*
46 * This a hybrid algorithm for bit counting between parallel counting and
47 * using multiplication.  The idea is to sum up the bits in each Byte, so
48 * that the final accumulation can be done with a single multiplication.
49 * If the platform has a slow multiplication instruction, it can be replaced
50 * by the commented out version below.
51 */
52
53unsigned int
54popcount32(uint32_t v)
55{
56	unsigned int c;
57
58	v = v - ((v >> 1) & 0x55555555U);
59	v = (v & 0x33333333U) + ((v >> 2) & 0x33333333U);
60	v = (v + (v >> 4)) & 0x0f0f0f0fU;
61	c = (v * 0x01010101U) >> 24;
62	/*
63	 * v = (v >> 16) + v;
64	 * v = (v >> 8) + v;
65	 * c = v & 255;
66	 */
67
68	return c;
69}
70
71#if UINT_MAX == 0xffffffffU
72__strong_alias(popcount, popcount32)
73#endif
74
75#if ULONG_MAX == 0xffffffffU
76__strong_alias(popcountl, popcount32)
77#endif
78