X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fbitboard.h;h=390966e3494273969bdb53a50c6953a6c9782611;hp=967a68f59f8f8247397bb62e24eb8a7a3a569b7a;hb=5e4cd3fc0d4b88eeb09ae458b9cb9f73db8c4ae7;hpb=d4af15f682c1967450233ab62cba1a6c5d601df6 diff --git a/src/bitboard.h b/src/bitboard.h index 967a68f5..390966e3 100644 --- a/src/bitboard.h +++ b/src/bitboard.h @@ -61,16 +61,6 @@ const Bitboard Rank8BB = Rank1BB << (8 * 7); extern int SquareDistance[SQUARE_NB][SQUARE_NB]; -extern Bitboard RookMasks [SQUARE_NB]; -extern Bitboard RookMagics [SQUARE_NB]; -extern Bitboard* RookAttacks[SQUARE_NB]; -extern unsigned RookShifts [SQUARE_NB]; - -extern Bitboard BishopMasks [SQUARE_NB]; -extern Bitboard BishopMagics [SQUARE_NB]; -extern Bitboard* BishopAttacks[SQUARE_NB]; -extern unsigned BishopShifts [SQUARE_NB]; - extern Bitboard SquareBB[SQUARE_NB]; extern Bitboard FileBB[FILE_NB]; extern Bitboard RankBB[RANK_NB]; @@ -225,6 +215,13 @@ template<> inline int distance(Square x, Square y) { return distance(rank_ template inline unsigned magic_index(Square s, Bitboard occupied) { + extern Bitboard RookMasks[SQUARE_NB]; + extern Bitboard RookMagics[SQUARE_NB]; + extern unsigned RookShifts[SQUARE_NB]; + extern Bitboard BishopMasks[SQUARE_NB]; + extern Bitboard BishopMagics[SQUARE_NB]; + extern unsigned BishopShifts[SQUARE_NB]; + Bitboard* const Masks = Pt == ROOK ? RookMasks : BishopMasks; Bitboard* const Magics = Pt == ROOK ? RookMagics : BishopMagics; unsigned* const Shifts = Pt == ROOK ? RookShifts : BishopShifts; @@ -242,6 +239,10 @@ inline unsigned magic_index(Square s, Bitboard occupied) { template inline Bitboard attacks_bb(Square s, Bitboard occupied) { + + extern Bitboard* RookAttacks[SQUARE_NB]; + extern Bitboard* BishopAttacks[SQUARE_NB]; + return (Pt == ROOK ? RookAttacks : BishopAttacks)[s][magic_index(s, occupied)]; } @@ -257,56 +258,61 @@ inline Bitboard attacks_bb(Piece pc, Square s, Bitboard occupied) { } -/// lsb() and msb() return the least/most significant bit in a non-zero bitboard +/// popcount() counts the number of non-zero bits in a bitboard -#ifdef USE_BSFQ +inline int popcount(Bitboard b) { -# if defined(_MSC_VER) && !defined(__INTEL_COMPILER) +#ifndef USE_POPCNT -inline Square lsb(Bitboard b) { - unsigned long idx; - _BitScanForward64(&idx, b); - return (Square) idx; -} + extern uint8_t PopCnt16[1 << 16]; + union { Bitboard bb; uint16_t u[4]; } v = { b }; + return PopCnt16[v.u[0]] + PopCnt16[v.u[1]] + PopCnt16[v.u[2]] + PopCnt16[v.u[3]]; -inline Square msb(Bitboard b) { - unsigned long idx; - _BitScanReverse64(&idx, b); - return (Square) idx; -} +#elif defined(_MSC_VER) || defined(__INTEL_COMPILER) -# elif defined(__arm__) + return (int)_mm_popcnt_u64(b); -inline int lsb32(uint32_t v) { - __asm__("rbit %0, %1" : "=r"(v) : "r"(v)); - return __builtin_clz(v); -} +#else // Assumed gcc or compatible compiler -inline Square msb(Bitboard b) { - return (Square) (63 - __builtin_clzll(b)); + return __builtin_popcountll(b); + +#endif } + +/// lsb() and msb() return the least/most significant bit in a non-zero bitboard + +#if defined(__GNUC__) + inline Square lsb(Bitboard b) { - return (Square) (uint32_t(b) ? lsb32(uint32_t(b)) : 32 + lsb32(uint32_t(b >> 32))); + assert(b); + return Square(__builtin_ctzll(b)); } -# else // Assumed gcc or compatible compiler +inline Square msb(Bitboard b) { + assert(b); + return Square(63 - __builtin_clzll(b)); +} -inline Square lsb(Bitboard b) { // Assembly code by Heinz van Saanen - Bitboard idx; - __asm__("bsfq %1, %0": "=r"(idx): "rm"(b) ); +#elif defined(_WIN64) && defined(_MSC_VER) + +inline Square lsb(Bitboard b) { + assert(b); + unsigned long idx; + _BitScanForward64(&idx, b); return (Square) idx; } inline Square msb(Bitboard b) { - Bitboard idx; - __asm__("bsrq %1, %0": "=r"(idx): "rm"(b) ); + assert(b); + unsigned long idx; + _BitScanReverse64(&idx, b); return (Square) idx; } -# endif +#else -#else // ifdef(USE_BSFQ) +#define NO_BSF // Fallback on software implementation for other cases Square lsb(Bitboard b); Square msb(Bitboard b);