1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-04-30 16:53:09 +00:00

Micro-optimize pop_1st_bit() for 32 bits

Small perft speed-up of 2% and also a code
simplification.

No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba 2012-02-13 09:52:58 +01:00
parent 7b4b65d7a9
commit 3b906ffc27

View file

@ -112,7 +112,7 @@ Square first_1(Bitboard b) {
// Use type-punning
union b_union {
Bitboard b;
Bitboard dummy;
struct {
#if defined (BIGENDIAN)
uint32_t h;
@ -121,27 +121,21 @@ union b_union {
uint32_t l;
uint32_t h;
#endif
} dw;
} b;
};
Square pop_1st_bit(Bitboard* bb) {
Square pop_1st_bit(Bitboard* b) {
b_union u;
Square ret;
const b_union u = *((b_union*)b);
u.b = *bb;
if (u.dw.l)
if (u.b.l)
{
ret = Square(BSFTable[((u.dw.l ^ (u.dw.l - 1)) * 0x783A9B23) >> 26]);
u.dw.l &= (u.dw.l - 1);
*bb = u.b;
return ret;
((b_union*)b)->b.l = u.b.l & (u.b.l - 1);
return Square(BSFTable[((u.b.l ^ (u.b.l - 1)) * 0x783A9B23) >> 26]);
}
ret = Square(BSFTable[((~(u.dw.h ^ (u.dw.h - 1))) * 0x783A9B23) >> 26]);
u.dw.h &= (u.dw.h - 1);
*bb = u.b;
return ret;
((b_union*)b)->b.h = u.b.h & (u.b.h - 1);
return Square(BSFTable[((~(u.b.h ^ (u.b.h - 1))) * 0x783A9B23) >> 26]);
}
#endif // !defined(USE_BSFQ)