2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2012 Marco Costalba, Joona Kiiski, Tord Romstad
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
12 Stockfish is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>.
21 #if !defined(BITCOUNT_H_INCLUDED)
22 #define BITCOUNT_H_INCLUDED
35 /// Determine at compile time the best popcount<> specialization according if
36 /// platform is 32 or 64 bits, to the maximum number of nonzero bits to count or
37 /// use hardware popcnt instruction when available.
38 const BitCountType Full = HasPopCnt ? CNT_HW_POPCNT : Is64Bit ? CNT_64 : CNT_32;
39 const BitCountType Max15 = HasPopCnt ? CNT_HW_POPCNT : Is64Bit ? CNT_64_MAX15 : CNT_32_MAX15;
42 /// popcount() counts the number of nonzero bits in a bitboard
43 template<BitCountType> inline int popcount(Bitboard);
46 inline int popcount<CNT_64>(Bitboard b) {
47 b -= ((b>>1) & 0x5555555555555555ULL);
48 b = ((b>>2) & 0x3333333333333333ULL) + (b & 0x3333333333333333ULL);
49 b = ((b>>4) + b) & 0x0F0F0F0F0F0F0F0FULL;
50 b *= 0x0101010101010101ULL;
55 inline int popcount<CNT_64_MAX15>(Bitboard b) {
56 b -= (b>>1) & 0x5555555555555555ULL;
57 b = ((b>>2) & 0x3333333333333333ULL) + (b & 0x3333333333333333ULL);
58 b *= 0x1111111111111111ULL;
63 inline int popcount<CNT_32>(Bitboard b) {
64 unsigned w = unsigned(b >> 32), v = unsigned(b);
65 v -= (v >> 1) & 0x55555555; // 0-2 in 2 bits
66 w -= (w >> 1) & 0x55555555;
67 v = ((v >> 2) & 0x33333333) + (v & 0x33333333); // 0-4 in 4 bits
68 w = ((w >> 2) & 0x33333333) + (w & 0x33333333);
69 v = ((v >> 4) + v) & 0x0F0F0F0F; // 0-8 in 8 bits
70 v += (((w >> 4) + w) & 0x0F0F0F0F); // 0-16 in 8 bits
71 v *= 0x01010101; // mul is fast on amd procs
76 inline int popcount<CNT_32_MAX15>(Bitboard b) {
77 unsigned w = unsigned(b >> 32), v = unsigned(b);
78 v -= (v >> 1) & 0x55555555; // 0-2 in 2 bits
79 w -= (w >> 1) & 0x55555555;
80 v = ((v >> 2) & 0x33333333) + (v & 0x33333333); // 0-4 in 4 bits
81 w = ((w >> 2) & 0x33333333) + (w & 0x33333333);
82 v += w; // 0-8 in 4 bits
88 inline int popcount<CNT_HW_POPCNT>(Bitboard b) {
90 #if !defined(USE_POPCNT)
93 return int(b != 0); // Avoid 'b not used' warning
95 #elif defined(_MSC_VER) && defined(__INTEL_COMPILER)
97 return _mm_popcnt_u64(b);
99 #elif defined(_MSC_VER)
101 return (int)__popcnt64(b);
106 __asm__("popcnt %1, %0" : "=r" (ret) : "r" (b));
112 #endif // !defined(BITCOUNT_H_INCLUDED)