X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fpawns.h;h=fbf6df126d995f7f73bde6d1bec5244826bdfaa1;hp=86708488cb276f6c13ce40d768d7bda7991d3485;hb=7a84b8ca34ee8597920de8e52cae074c31543540;hpb=85a7456bd7e8a1a01cdbfa8f4b6fb563d15a37c6 diff --git a/src/pawns.h b/src/pawns.h index 86708488..fbf6df12 100644 --- a/src/pawns.h +++ b/src/pawns.h @@ -17,21 +17,12 @@ along with this program. If not, see . */ - #if !defined(PAWNS_H_INCLUDED) #define PAWNS_H_INCLUDED -//// -//// Includes -//// - -#include "bitboard.h" #include "position.h" -#include "value.h" - -//// -//// Types -//// +#include "tt.h" +#include "types.h" const int PawnTableSize = 16384; @@ -41,6 +32,7 @@ const int PawnTableSize = 16384; /// to add further information in the future. A lookup to the pawn hash table /// (performed by calling the get_pawn_info method in a PawnInfoTable object) /// returns a pointer to a PawnInfo object. + class PawnInfo { friend class PawnInfoTable; @@ -69,43 +61,20 @@ private: Score kingShelters[2]; }; -/// The PawnInfoTable class represents a pawn hash table. It is basically -/// just an array of PawnInfo objects and a few methods for accessing these -/// objects. The most important method is get_pawn_info, which looks up a -/// position in the table and returns a pointer to a PawnInfo object. -class PawnInfoTable { - - enum SideType { KingSide, QueenSide }; - - PawnInfoTable(const PawnInfoTable&); - PawnInfoTable& operator=(const PawnInfoTable&); +/// The PawnInfoTable class represents a pawn hash table. The most important +/// method is get_pawn_info, which returns a pointer to a PawnInfo object. +class PawnInfoTable : public SimpleHash { public: - PawnInfoTable(); - ~PawnInfoTable(); PawnInfo* get_pawn_info(const Position& pos) const; - void prefetch(Key key) const; private: template Score evaluate_pawns(const Position& pos, Bitboard ourPawns, Bitboard theirPawns, PawnInfo* pi) const; - - PawnInfo* entries; }; -//// -//// Inline functions -//// - -inline void PawnInfoTable::prefetch(Key key) const { - - unsigned index = unsigned(key & (PawnTableSize - 1)); - PawnInfo* pi = entries + index; - ::prefetch((char*) pi); -} - inline Score PawnInfo::pawns_value() const { return value; } @@ -119,7 +88,7 @@ inline Bitboard PawnInfo::passed_pawns(Color c) const { } inline int PawnInfo::file_is_half_open(Color c, File f) const { - return (halfOpenFiles[c] & (1 << int(f))); + return halfOpenFiles[c] & (1 << int(f)); } inline int PawnInfo::has_open_file_to_left(Color c, File f) const { @@ -130,31 +99,6 @@ inline int PawnInfo::has_open_file_to_right(Color c, File f) const { return halfOpenFiles[c] & ~((1 << int(f+1)) - 1); } -/// PawnInfo::updateShelter() calculates and caches king shelter. It is called -/// only when king square changes, about 20% of total king_shelter() calls. -template -Score PawnInfo::updateShelter(const Position& pos, Square ksq) { - - const int Shift = (Us == WHITE ? 8 : -8); - - Bitboard pawns; - int r, shelter = 0; - - if (relative_rank(Us, ksq) <= RANK_4) - { - pawns = pos.pieces(PAWN, Us) & this_and_neighboring_files_bb(ksq); - r = square_rank(ksq) * 8; - for (int i = 1; i < 4; i++) - { - r += Shift; - shelter += BitCount8Bit[(pawns >> r) & 0xFF] * (128 >> i); - } - } - kingSquares[Us] = ksq; - kingShelters[Us] = make_score(shelter, 0); - return kingShelters[Us]; -} - template inline Score PawnInfo::king_shelter(const Position& pos, Square ksq) { return kingSquares[Us] == ksq ? kingShelters[Us] : updateShelter(pos, ksq);