Author: Gerd Isenberg
Date: 14:44:59 11/30/02
Go up one level in this thread
On November 30, 2002 at 17:30:16, Russell Reagan wrote:
>On November 29, 2002 at 19:19:02, Gerd Isenberg wrote:
>
>>int BitSearch_v2(BitBoard bb)
>>{
>> __asm
>> {
>> bsf eax,[bb+4]
>> xor eax, 32
>> bsf eax,[bb]
>> }
>>}
>
>Just out of curiosity, is it faster to do an 'xor' there than it is an 'add'?
Should be about the same. In principle xor is faster to implement in hardware
than add (IMHO). No sideeffect to neighboured bits.
Btw. the above routine is a bit suspicious because the manuals say that
bsf(reg32, zero) leaves the target register undefined (may be under some strange
conditions).
Gerd
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.