X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Ftt.h;h=5d0df726239cabb66cb13628ac3523e9fb676c9c;hp=a820d94ac5181efa74789258c474a167c507ec9e;hb=2b6bc70f7bf266602a3ca59abb606699bdf544c8;hpb=6a8e46d53efca6dd56a396b32f43bef9f95127d6 diff --git a/src/tt.h b/src/tt.h index a820d94a..5d0df726 100644 --- a/src/tt.h +++ b/src/tt.h @@ -1,7 +1,7 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008 Marco Costalba + Copyright (C) 2008-2009 Marco Costalba Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -36,75 +36,89 @@ /// The TTEntry class is the class of transposition table entries /// -/// A TTEntry needs 128 bits to be stored +/// A TTEntry needs 96 bits to be stored /// -/// bit 0-63: key -/// bit 64-95: data -/// bit 96-111: value -/// bit 112-127: depth +/// bit 0-31: key +/// bit 32-63: data +/// bit 64-79: value +/// bit 80-95: depth /// /// the 32 bits of the data field are so defined /// /// bit 0-16: move -/// bit 17: stored value equals static value -/// bit 18-19: not used +/// bit 17-19: not used /// bit 20-22: value type /// bit 23-31: generation class TTEntry { public: - TTEntry(); - TTEntry(Key k, Value v, ValueType t, Depth d, Move m, int generation); - Key key() const { return key_; } + TTEntry() {} + TTEntry(uint32_t k, Value v, ValueType t, Depth d, Move m, int generation) + : key_ (k), data((m & 0x1FFFF) | (t << 20) | (generation << 23)), + value_(int16_t(v)), depth_(int16_t(d)) {} + + uint32_t key() const { return key_; } Depth depth() const { return Depth(depth_); } Move move() const { return Move(data & 0x1FFFF); } Value value() const { return Value(value_); } ValueType type() const { return ValueType((data >> 20) & 7); } int generation() const { return (data >> 23); } - bool staticValue() const { return ((data >> 17) & 1); } - void setStaticValue() { data |= (1 << 17); } private: - Key key_; + uint32_t key_; uint32_t data; int16_t value_; int16_t depth_; }; -/// The transposition table class. This is basically just a huge array + +/// This is the number of TTEntry slots for each position +const int ClusterSize = 5; + +/// Each group of ClusterSize number of TTEntry form a TTCluster +/// that is indexed by a single position key. Cluster is padded +/// to a cache line size so to guarantee always aligned accesses. + +struct TTCluster { + TTEntry data[ClusterSize]; + char cache_line_padding[64 - sizeof(TTEntry[ClusterSize])]; +}; + + +/// The transposition table class. This is basically just a huge array /// containing TTEntry objects, and a few methods for writing new entries /// and reading new ones. class TranspositionTable { public: - TranspositionTable(unsigned mbSize); + TranspositionTable(); ~TranspositionTable(); void set_size(unsigned mbSize); void clear(); - TTEntry* store(const Position &pos, Value v, Depth d, Move m, ValueType type); - TTEntry* retrieve(const Position &pos) const; + void store(const Key posKey, Value v, ValueType type, Depth d, Move m); + TTEntry* retrieve(const Key posKey) const; + void prefetch(const Key posKey) const; void new_search(); - void insert_pv(const Position &pos, Move pv[]); - int full(); + void insert_pv(const Position& pos, Move pv[]); + void extract_pv(const Position& pos, Move pv[], const int PLY_MAX); + int full() const; private: - inline TTEntry* first_entry(const Position &pos) const; + inline TTEntry* first_entry(const Key posKey) const; + + // Be sure 'writes' is at least one cache line away + // from read only variables. + unsigned char pad_before[64 - sizeof(unsigned)]; + unsigned writes; // heavy SMP read/write access here + unsigned char pad_after[64]; unsigned size; - int writes; - TTEntry* entries; + TTCluster* entries; uint8_t generation; }; - -//// -//// Constants and variables -//// - -// Default transposition table size, in megabytes: -const int TTDefaultSize = 32; - +extern TranspositionTable TT; #endif // !defined(TT_H_INCLUDED)