Author: Robert Hyatt
Date: 19:01:27 10/28/00
Go up one level in this thread
On October 28, 2000 at 15:09:11, Simon Waters wrote: >Hi, > >been bit twiddling the gnuchess leadz and nbits routines, that find most >significant bit and population count respectively. > >Seems to have had a minor performance benefits (few %) and got rid of the nasty >table lookup's. > >Anyone know of any good reference on these things? > >Anyone know of a C library that implements bit counting efficently across >architectures? > >Crafty appears to have gone "assembler" on this.... but it would be nice to >delegate to a library. Is Intel x86 (and clones) the only architecture not to >implement a bit count? > > Simon "Cyrix Instead" Waters Crafty still has C code for these, although they are replaced by asm modules on the X86 machines... if you look in "boolean.c" you will find the way I do these things...
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.