We already have the necessary infrastructure
in place.
No functional change.
Signed-off-by: Marco Costalba <mcostalba@gmail.com>
CACHE_LINE_ALIGNMENT
int BSFTable[64];
CACHE_LINE_ALIGNMENT
int BSFTable[64];
Bitboard RTable[0x19000]; // Storage space for rook attacks
Bitboard BTable[0x1480]; // Storage space for bishop attacks
Bitboard RTable[0x19000]; // Storage space for rook attacks
Bitboard BTable[0x1480]; // Storage space for bishop attacks
return Square(BSFTable[((~(u.b.h ^ (u.b.h - 1))) * 0x783A9B23) >> 26]);
}
return Square(BSFTable[((~(u.b.h ^ (u.b.h - 1))) * 0x783A9B23) >> 26]);
}
-#endif // !defined(USE_BSFQ)
-
-#if !defined(USE_BSFQ)
-
Square last_1(Bitboard b) {
Square last_1(Bitboard b) {
- if (b > 0xFFFFFFFF) {
- b >>= 32;
- result = 32;
+
+ if (b > 0xFFFFFFFF)
+ {
+ b >>= 32;
+ result = 32;
- if (b > 0xFFFF) {
- b >>= 16;
- result += 16;
+
+ if (b > 0xFFFF)
+ {
+ b >>= 16;
+ result += 16;
- if (b > 0xFF) {
- b >>= 8;
- result += 8;
+
+ if (b > 0xFF)
+ {
+ b >>= 8;
+ result += 8;
- return Square(result + MS1BTable[b]);
+
+ return Square(result + BitCount8Bit[b]);
}
#endif // !defined(USE_BSFQ)
}
#endif // !defined(USE_BSFQ)
else
BSFTable[((1ULL << i) * 0x218A392CD3D5DBFULL) >> 58] = i;
else
BSFTable[((1ULL << i) * 0x218A392CD3D5DBFULL) >> 58] = i;
- MS1BTable[0] = 0;
- for (int i = 0, k = 1; i < 8; i++)
- for (int j = 0; j < (1 << i); j++)
- MS1BTable[k++] = i;
-
int steps[][9] = { {}, { 7, 9 }, { 17, 15, 10, 6, -6, -10, -15, -17 },
{}, {}, {}, { 9, 7, -7, -9, 8, 1, -1, -8 } };
int steps[][9] = { {}, { 7, 9 }, { 17, 15, 10, 6, -6, -10, -15, -17 },
{}, {}, {}, { 9, 7, -7, -9, 8, 1, -1, -8 } };
/// first_1() finds the least significant nonzero bit in a nonzero bitboard.
/// pop_1st_bit() finds and clears the least significant nonzero bit in a
/// nonzero bitboard.
/// first_1() finds the least significant nonzero bit in a nonzero bitboard.
/// pop_1st_bit() finds and clears the least significant nonzero bit in a
/// nonzero bitboard.