Whenever I need to do bit manipulations, I always check the Linux kernel source. I figure that any bit manipulation I'd ever want to do is also done in the kernel, and I'm usually right:
Seconded. That's probably one of the best places to find bit twiddling resouces ever. I remember I had one of those Coriolis kernel printout books back in the 90s, and I used to crib from that, some hashing function and the page allocator all the time.
Another great resource for tidbits like this is _Hacker's Delight_, by Henry S. Warren, Jr. It covers a number of other tricks outside of bit twiddling, as well. Worth checking out for anyone who finds this sort of stuff fascinating.
For this sort of thing, it would seem helpful to release it under "any license viewed as free by the FSF" or similar. Is that sort of statement likely to cause problems? Or at least license it MIT/BSD/whatever. For such a small piece, it would be nice if projects can just import it without having to move from "all code is BSD" to "all code is BSD except bithacks.h which is MIT, but we also comply with that license".
MIT license is compatible with BSD and GPL licenses, so I don't see a big issue there. But I could put it in public domain, so that there were no license issues at all.
So this is nice, but is it super fast/efficient? It would seem to me that this sort of thing is where inline assembly, on a per processor basis, would really make a huge difference. Is this sort of thing well enough known that compilers already do it for us? Anyone know a lot about this sort of thing?
In general, this will probably get you close to maximum performance. Most CPUs implement shift, rotate, AND, OR, XOR, and NOT instructions, and usually not much else in the way of bit manipulation (besides maybe a few very specialized intrinsics for popular encryption algorithms/hash functions (see SSE)). DSPs and more domain-specific microcontrollers generally have more bit-banging instructions, and you might be able to make better use of them with assembly or intrinsics.
A smart compiler could theoretically transform your crappy implementation of "is the Nth bit set?" into something more intelligent, but it is rarely profitable enough to do so, as programmers who write code in which bit-banging is the bottleneck typically know how to do this themselves; in fact, most of the macros linked are what I consider to be the most parsimonious implementation.
One thing where an intrinsic will definitely beat a C-level implementation is population count (how many bits are set in this int/long?) Many recent x86 parts and many DSPs implement a POPCOUNT/BC instruction which will outperform even a smart LUT-based implementation (without the memory capacity/bandwidth requirement too). There's an interesting anecdote about that instruction here (http://www.moyogo.com/blog/2005/09/secret-opcodes.html ), no idea if it's true.
Catonmat never fails in fascinating me, regardless of how stupid this may sound, the more unpopular the language he implements his tutorial/illustration in, the more I realize how unimportant the language actually is. As long as we can/are reuse/reusing what we write, we can rest in the idea that what we do/did now/before actually matters for what we can/are do/doing in the future/present.
[+] [-] scott_s|16 years ago|reply
http://miller.cs.wm.edu/lxr3.linux/http/source/include/linux...
http://miller.cs.wm.edu/lxr3.linux/http/source/include/linux...
http://miller.cs.wm.edu/lxr3.linux/http/source/lib/bitmap.c?...
[+] [-] pkrumins|16 years ago|reply
[+] [-] electronslave|16 years ago|reply
[+] [-] vColin|16 years ago|reply
The comments accompanying the code are interesting too.
[+] [-] azanar|16 years ago|reply
Link: http://www.amazon.com/Hackers-Delight-Henry-S-Warren/dp/0201...
[+] [-] sb|16 years ago|reply
and probably alan mycrofts more useful c-interpretation: http://www.cl.cam.ac.uk/~am21/hakmemc.html
[+] [-] unknown|16 years ago|reply
[deleted]
[+] [-] trinket|16 years ago|reply
[+] [-] pkrumins|16 years ago|reply
[+] [-] sophacles|16 years ago|reply
[+] [-] sparky|16 years ago|reply
A smart compiler could theoretically transform your crappy implementation of "is the Nth bit set?" into something more intelligent, but it is rarely profitable enough to do so, as programmers who write code in which bit-banging is the bottleneck typically know how to do this themselves; in fact, most of the macros linked are what I consider to be the most parsimonious implementation.
One thing where an intrinsic will definitely beat a C-level implementation is population count (how many bits are set in this int/long?) Many recent x86 parts and many DSPs implement a POPCOUNT/BC instruction which will outperform even a smart LUT-based implementation (without the memory capacity/bandwidth requirement too). There's an interesting anecdote about that instruction here (http://www.moyogo.com/blog/2005/09/secret-opcodes.html ), no idea if it's true.
[+] [-] mlLK|16 years ago|reply
[+] [-] pmorici|16 years ago|reply