X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fbitboard.cpp;h=bdde916183294fa26e1b29cfd05921c16efb0482;hb=7b4b65d7a95b3c8b40a11fe5b3efe959d5129008;hp=21cd34a2997812998b828901cbb575f0007afb4d;hpb=dfd030b67af4e651a73232ab15182fe669909ef1;p=stockfish diff --git a/src/bitboard.cpp b/src/bitboard.cpp index 21cd34a2..bdde9161 100644 --- a/src/bitboard.cpp +++ b/src/bitboard.cpp @@ -25,19 +25,19 @@ #include "bitcount.h" #include "rkiss.h" +CACHE_LINE_ALIGNMENT + Bitboard RMasks[64]; Bitboard RMagics[64]; Bitboard* RAttacks[64]; -int RShifts[64]; +unsigned RShifts[64]; Bitboard BMasks[64]; Bitboard BMagics[64]; Bitboard* BAttacks[64]; -int BShifts[64]; - -Bitboard SetMaskBB[65]; -Bitboard ClearMaskBB[65]; +unsigned BShifts[64]; +Bitboard SquareBB[64]; Bitboard FileBB[8]; Bitboard RankBB[8]; Bitboard AdjacentFilesBB[8]; @@ -48,7 +48,6 @@ Bitboard BetweenBB[64][64]; Bitboard SquaresInFrontMask[2][64]; Bitboard PassedPawnMask[2][64]; Bitboard AttackSpanMask[2][64]; - Bitboard PseudoAttacks[6][64]; uint8_t BitCount8Bit[256]; @@ -65,7 +64,7 @@ namespace { typedef unsigned (Fn)(Square, Bitboard); void init_magics(Bitboard table[], Bitboard* attacks[], Bitboard magics[], - Bitboard masks[], int shifts[], Square deltas[], Fn get_index); + Bitboard masks[], unsigned shifts[], Square deltas[], Fn index); } @@ -78,7 +77,7 @@ void print_bitboard(Bitboard b) { { std::cout << "+---+---+---+---+---+---+---+---+" << '\n'; for (File f = FILE_A; f <= FILE_H; f++) - std::cout << "| " << (bit_is_set(b, make_square(f, r)) ? "X " : " "); + std::cout << "| " << ((b & make_square(f, r)) ? "X " : " "); std::cout << "|\n"; } @@ -157,12 +156,7 @@ void bitboards_init() { BitCount8Bit[b] = (uint8_t)popcount(b); for (Square s = SQ_A1; s <= SQ_H8; s++) - { - SetMaskBB[s] = 1ULL << s; - ClearMaskBB[s] = ~SetMaskBB[s]; - } - - ClearMaskBB[SQ_NONE] = ~0ULL; + SquareBB[s] = 1ULL << s; FileBB[FILE_A] = FileABB; RankBB[RANK_1] = Rank1BB; @@ -219,30 +213,30 @@ void bitboards_init() { Square to = s + Square(c == WHITE ? steps[pt][k] : -steps[pt][k]); if (square_is_ok(to) && square_distance(s, to) < 3) - set_bit(&StepAttacksBB[make_piece(c, pt)][s], to); + StepAttacksBB[make_piece(c, pt)][s] |= to; } Square RDeltas[] = { DELTA_N, DELTA_E, DELTA_S, DELTA_W }; Square BDeltas[] = { DELTA_NE, DELTA_SE, DELTA_SW, DELTA_NW }; - init_magics(RTable, RAttacks, RMagics, RMasks, RShifts, RDeltas, r_index); - init_magics(BTable, BAttacks, BMagics, BMasks, BShifts, BDeltas, b_index); + init_magics(RTable, RAttacks, RMagics, RMasks, RShifts, RDeltas, magic_index); + init_magics(BTable, BAttacks, BMagics, BMasks, BShifts, BDeltas, magic_index); for (Square s = SQ_A1; s <= SQ_H8; s++) { - PseudoAttacks[BISHOP][s] = bishop_attacks_bb(s, 0); - PseudoAttacks[ROOK][s] = rook_attacks_bb(s, 0); + PseudoAttacks[BISHOP][s] = attacks_bb(s, 0); + PseudoAttacks[ROOK][s] = attacks_bb(s, 0); PseudoAttacks[QUEEN][s] = PseudoAttacks[BISHOP][s] | PseudoAttacks[ROOK][s]; } for (Square s1 = SQ_A1; s1 <= SQ_H8; s1++) for (Square s2 = SQ_A1; s2 <= SQ_H8; s2++) - if (bit_is_set(PseudoAttacks[QUEEN][s1], s2)) + if (PseudoAttacks[QUEEN][s1] & s2) { Square delta = (s2 - s1) / square_distance(s1, s2); for (Square s = s1 + delta; s != s2; s += delta) - set_bit(&BetweenBB[s1][s2], s); + BetweenBB[s1][s2] |= s; } } @@ -258,9 +252,9 @@ namespace { square_is_ok(s) && square_distance(s, s - deltas[i]) == 1; s += deltas[i]) { - set_bit(&attack, s); + attack |= s; - if (bit_is_set(occupied, s)) + if (occupied & s) break; } @@ -296,7 +290,7 @@ namespace { // use the so called "fancy" approach. void init_magics(Bitboard table[], Bitboard* attacks[], Bitboard magics[], - Bitboard masks[], int shifts[], Square deltas[], Fn get_index) { + Bitboard masks[], unsigned shifts[], Square deltas[], Fn index) { int MagicBoosters[][8] = { { 3191, 2184, 1310, 3618, 2091, 1308, 2452, 3996 }, { 1059, 3608, 605, 3234, 3326, 38, 2029, 3043 } }; @@ -348,7 +342,7 @@ namespace { // effect of verifying the magic. for (i = 0; i < size; i++) { - Bitboard& attack = attacks[s][get_index(s, occupancy[i])]; + Bitboard& attack = attacks[s][index(s, occupancy[i])]; if (attack && attack != reference[i]) break;