Date: Thu, 15 Nov 2012 14:55:50 -0500 From: Jung-uk Kim <jkim@FreeBSD.org> To: Julian Elischer <julian@freebsd.org> Cc: freebsd-arch@freebsd.org Subject: Re: [RFC] Generic population count function Message-ID: <50A548C6.5070208@FreeBSD.org> In-Reply-To: <50A477BA.4020700@freebsd.org> References: <50A43B52.8030102@FreeBSD.org> <50A477BA.4020700@freebsd.org>
next in thread | previous in thread | raw e-mail | index | archive | help
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On 2012-11-15 00:03:54 -0500, Julian Elischer wrote: > there are more efficient algorithms than the one you show in > bitcount.h see the bit-twidling site: > > http://graphics.stanford.edu/~seander/bithacks.html Yes, I know that. __bitcount32() is a fall-back for *unsupported* compilers anyway, I didn't see much point in improving it further. If you are looking for better population count functions, this site is better, actually: http://www.dalkescientific.com/writings/diary/archive/2011/11/02/faster_popcount_update.html Jung-uk Kim -----BEGIN PGP SIGNATURE----- Version: GnuPG v2.0.19 (FreeBSD) Comment: Using GnuPG with Mozilla - http://www.enigmail.net/ iEYEARECAAYFAlClSMYACgkQmlay1b9qnVPIegCgyPDEgRaKkgEj9TWAfI09G5Cg ugQAn1orRlZDSqUUTYa2fCIwtYSIAegh =49wE -----END PGP SIGNATURE-----
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?50A548C6.5070208>