X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fbitboard.cpp;h=3621d6b204ca38eb5d6f8b7021439bcbbe378ea5;hp=458f9318f9d00d0d6c3b716c6268a78d7caef9de;hb=a9e55d43262d11a916bdfa68cd1de0174d884cd3;hpb=29b01b6d825d32184a6307def3b17598bb5b4b0a diff --git a/src/bitboard.cpp b/src/bitboard.cpp index 458f9318..3621d6b2 100644 --- a/src/bitboard.cpp +++ b/src/bitboard.cpp @@ -1,13 +1,14 @@ /* - Glaurung, a UCI chess playing engine. - Copyright (C) 2004-2008 Tord Romstad + Stockfish, a UCI chess playing engine derived from Glaurung 2.1 + Copyright (C) 2004-2008 Tord Romstad (Glaurung author) + Copyright (C) 2008 Marco Costalba - Glaurung is free software: you can redistribute it and/or modify + Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. - Glaurung is distributed in the hope that it will be useful, + Stockfish is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. @@ -21,70 +22,22 @@ //// Includes //// +#ifdef _MSC_VER + #include + #ifdef _WIN64 + #pragma intrinsic(_BitScanForward64) + #else + #pragma intrinsic(_BitScanForward) + #endif + #define USING_INTRINSICS +#endif + #include #include "bitboard.h" #include "direction.h" -//// -//// Constants and variables -//// - -const Bitboard SquaresByColorBB[2] = {BlackSquaresBB, WhiteSquaresBB}; - -const Bitboard FileBB[8] = { - FileABB, FileBBB, FileCBB, FileDBB, FileEBB, FileFBB, FileGBB, FileHBB -}; - -const Bitboard NeighboringFilesBB[8] = { - FileBBB, FileABB|FileCBB, FileBBB|FileDBB, FileCBB|FileEBB, - FileDBB|FileFBB, FileEBB|FileGBB, FileFBB|FileHBB, FileGBB -}; - -const Bitboard ThisAndNeighboringFilesBB[8] = { - FileABB|FileBBB, FileABB|FileBBB|FileCBB, - FileBBB|FileCBB|FileDBB, FileCBB|FileDBB|FileEBB, - FileDBB|FileEBB|FileFBB, FileEBB|FileFBB|FileGBB, - FileFBB|FileGBB|FileHBB, FileGBB|FileHBB -}; - -const Bitboard RankBB[8] = { - Rank1BB, Rank2BB, Rank3BB, Rank4BB, Rank5BB, Rank6BB, Rank7BB, Rank8BB -}; - -const Bitboard RelativeRankBB[2][8] = { - { - Rank1BB, Rank2BB, Rank3BB, Rank4BB, Rank5BB, Rank6BB, Rank7BB, Rank8BB - }, - { - Rank8BB, Rank7BB, Rank6BB, Rank5BB, Rank4BB, Rank3BB, Rank2BB, Rank1BB - } -}; - -const Bitboard InFrontBB[2][8] = { - { - Rank2BB | Rank3BB | Rank4BB | Rank5BB | Rank6BB | Rank7BB | Rank8BB, - Rank3BB | Rank4BB | Rank5BB | Rank6BB | Rank7BB | Rank8BB, - Rank4BB | Rank5BB | Rank6BB | Rank7BB | Rank8BB, - Rank5BB | Rank6BB | Rank7BB | Rank8BB, - Rank6BB | Rank7BB | Rank8BB, - Rank7BB | Rank8BB, - Rank8BB, - EmptyBoardBB - }, - { - EmptyBoardBB, - Rank1BB, - Rank2BB | Rank1BB, - Rank3BB | Rank2BB | Rank1BB, - Rank4BB | Rank3BB | Rank2BB | Rank1BB, - Rank5BB | Rank4BB | Rank3BB | Rank2BB | Rank1BB, - Rank6BB | Rank5BB | Rank4BB | Rank3BB | Rank2BB | Rank1BB, - Rank7BB | Rank6BB | Rank5BB | Rank4BB | Rank3BB | Rank2BB | Rank1BB - } -}; - #if defined(USE_COMPACT_ROOK_ATTACKS) Bitboard RankAttacks[8][64], FileAttacks[8][64]; @@ -239,8 +192,8 @@ Bitboard BMask[64]; int BAttackIndex[64]; Bitboard BAttacks[0x1480]; -Bitboard SetMaskBB[64]; -Bitboard ClearMaskBB[64]; +Bitboard SetMaskBB[65]; +Bitboard ClearMaskBB[65]; Bitboard StepAttackBB[16][64]; Bitboard RayBB[64][8]; @@ -259,6 +212,7 @@ Bitboard QueenPseudoAttacks[64]; //// namespace { + void init_masks(); void init_ray_bitboards(); void init_attacks(); @@ -274,7 +228,7 @@ namespace { #if defined(USE_COMPACT_ROOK_ATTACKS) void init_file_and_rank_attacks(); #endif -}; +} //// @@ -339,20 +293,39 @@ Square first_1(Bitboard b) { /// pop_1st_bit() finds and clears the least significant nonzero bit in a /// nonzero bitboard. -#if defined(USE_32BIT_ATTACKS) && defined(_WIN32) +#if defined(USE_32BIT_ATTACKS) + +// Use type-punning +union b_union { + + Bitboard b; + struct { + uint32_t l; + uint32_t h; + }; +}; +// WARNING: Needs -fno-strict-aliasing compiler option Square pop_1st_bit(Bitboard *bb) { - uint32_t a = uint32_t(*bb); - uint32_t* ptr = a ? (uint32_t*)bb : (uint32_t*)bb + 1; // Little endian only? - uint32_t b = a ? a : *ptr; - uint32_t c = ~(b ^ (b - 1)); + b_union u; + uint32_t b; - *ptr = b & c; // clear the bit - if (a) - c = ~c; + u.b = *bb; - return Square(BitTable[(c * 0x783a9b23) >> 26]); + if (u.l) + { + b = u.l; + *((uint32_t*)bb) = b & (b - 1); + b ^= (b - 1); + } + else + { + b = u.h; + *((uint32_t*)bb+1) = b & (b - 1); // Little endian only? + b = ~(b ^ (b - 1)); + } + return Square(BitTable[(b * 0x783a9b23) >> 26]); } #else @@ -403,6 +376,8 @@ namespace { // be necessary to touch any of them. void init_masks() { + SetMaskBB[SQ_NONE] = 0ULL; + ClearMaskBB[SQ_NONE] = ~SetMaskBB[SQ_NONE]; for(Square s = SQ_A1; s <= SQ_H8; s++) { SetMaskBB[s] = (1ULL << s); ClearMaskBB[s] = ~SetMaskBB[s];