X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Ftt.cpp;h=b8fe7567c569a6a3d633c2d9b086fcd39fafd96d;hp=57dd00790e816670cea1bdfbfea870896492dce5;hb=2985a6b5d7be8b813da528886ff11265bfac449b;hpb=6c0a37bbf2ecb828cb41cb3cfac122f34c2a6e4b
diff --git a/src/tt.cpp b/src/tt.cpp
index 57dd0079..b8fe7567 100644
--- a/src/tt.cpp
+++ b/src/tt.cpp
@@ -1,7 +1,8 @@
/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
+ Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
+ Copyright (C) 2015-2019 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
@@ -17,210 +18,142 @@
along with this program. If not, see .
*/
+#include // For std::memset
+#include
+#include
-////
-//// Includes
-////
-
-#include
-#include
-#include
-
-#include "movegen.h"
+#include "bitboard.h"
+#include "misc.h"
+#include "thread.h"
#include "tt.h"
+#include "uci.h"
-// The main transposition table
-TranspositionTable TT;
-
-////
-//// Functions
-////
-
-TranspositionTable::TranspositionTable() {
-
- size = overwrites = 0;
- entries = 0;
- generation = 0;
-}
-
-TranspositionTable::~TranspositionTable() {
-
- delete [] entries;
-}
-
+TranspositionTable TT; // Our global transposition table
-/// TranspositionTable::set_size sets the size of the transposition table,
-/// measured in megabytes.
+/// TTEntry::save populates the TTEntry with a new node's data, possibly
+/// overwriting an old position. Update is not atomic and can be racy.
-void TranspositionTable::set_size(size_t mbSize) {
+void TTEntry::save(Key k, Value v, bool pv, Bound b, Depth d, Move m, Value ev) {
- size_t newSize = 1024;
+ assert(d / ONE_PLY * ONE_PLY == d);
- // We store a cluster of ClusterSize number of TTEntry for each position
- // and newSize is the maximum number of storable positions.
- while ((2 * newSize) * sizeof(TTCluster) <= (mbSize << 20))
- newSize *= 2;
+ // Preserve any existing move for the same position
+ if (m || (k >> 48) != key16)
+ move16 = (uint16_t)m;
- if (newSize != size)
+ // Overwrite less valuable entries
+ if ( (k >> 48) != key16
+ || d / ONE_PLY + 10 > depth8
+ || b == BOUND_EXACT)
{
- size = newSize;
- delete [] entries;
- entries = new TTCluster[size];
- if (!entries)
- {
- std::cerr << "Failed to allocate " << mbSize
- << " MB for transposition table." << std::endl;
- Application::exit_with_failure();
- }
- clear();
+ key16 = (uint16_t)(k >> 48);
+ value16 = (int16_t)v;
+ eval16 = (int16_t)ev;
+ genBound8 = (uint8_t)(TT.generation8 | uint8_t(pv) << 2 | b);
+ assert((d - DEPTH_NONE) / ONE_PLY >= 0);
+ depth8 = (uint8_t)((d - DEPTH_NONE) / ONE_PLY);
}
}
-/// TranspositionTable::clear overwrites the entire transposition table
-/// with zeroes. It is called whenever the table is resized, or when the
-/// user asks the program to clear the table (from the UCI interface).
-/// Perhaps we should also clear it when the "ucinewgame" command is recieved?
-
-void TranspositionTable::clear() {
-
- memset(entries, 0, size * sizeof(TTCluster));
-}
+/// TranspositionTable::resize() sets the size of the transposition table,
+/// measured in megabytes. Transposition table consists of a power of 2 number
+/// of clusters and each cluster consists of ClusterSize number of TTEntry.
+void TranspositionTable::resize(size_t mbSize) {
-/// TranspositionTable::store writes a new entry containing a position,
-/// a value, a value type, a search depth, and a best move to the
-/// transposition table. Transposition table is organized in clusters of
-/// four TTEntry objects, and when a new entry is written, it replaces
-/// the least valuable of the four entries in a cluster. A TTEntry t1 is
-/// considered to be more valuable than a TTEntry t2 if t1 is from the
-/// current search and t2 is from a previous search, or if the depth of t1
-/// is bigger than the depth of t2. A TTEntry of type VALUE_TYPE_EVAL
-/// never replaces another entry for the same position.
+ Threads.main()->wait_for_search_finished();
-void TranspositionTable::store(const Key posKey, Value v, ValueType t, Depth d, Move m, Value statV, Value kingD) {
+ clusterCount = mbSize * 1024 * 1024 / sizeof(Cluster);
- int c1, c2, c3;
- TTEntry *tte, *replace;
- uint32_t posKey32 = posKey >> 32; // Use the high 32 bits as key
+ free(mem);
+ mem = malloc(clusterCount * sizeof(Cluster) + CacheLineSize - 1);
- tte = replace = first_entry(posKey);
- for (int i = 0; i < ClusterSize; i++, tte++)
+ if (!mem)
{
- if (!tte->key() || tte->key() == posKey32) // empty or overwrite old
- {
- // Preserve any exsisting ttMove
- if (m == MOVE_NONE)
- m = tte->move();
-
- tte->save(posKey32, v, t, d, m, generation, statV, kingD);
- return;
- }
-
- if (i == 0) // replace would be a no-op in this common case
- continue;
-
- c1 = (replace->generation() == generation ? 2 : 0);
- c2 = (tte->generation() == generation ? -2 : 0);
- c3 = (tte->depth() < replace->depth() ? 1 : 0);
-
- if (c1 + c2 + c3 > 0)
- replace = tte;
+ std::cerr << "Failed to allocate " << mbSize
+ << "MB for transposition table." << std::endl;
+ exit(EXIT_FAILURE);
}
- replace->save(posKey32, v, t, d, m, generation, statV, kingD);
- overwrites++;
-}
-
-
-/// TranspositionTable::retrieve looks up the current position in the
-/// transposition table. Returns a pointer to the TTEntry or NULL
-/// if position is not found.
-TTEntry* TranspositionTable::retrieve(const Key posKey) const {
-
- uint32_t posKey32 = posKey >> 32;
- TTEntry* tte = first_entry(posKey);
-
- for (int i = 0; i < ClusterSize; i++, tte++)
- if (tte->key() == posKey32)
- return tte;
-
- return NULL;
+ table = (Cluster*)((uintptr_t(mem) + CacheLineSize - 1) & ~(CacheLineSize - 1));
+ clear();
}
-/// TranspositionTable::new_search() is called at the beginning of every new
-/// search. It increments the "generation" variable, which is used to
-/// distinguish transposition table entries from previous searches from
-/// entries from the current search.
+/// TranspositionTable::clear() initializes the entire transposition table to zero,
+// in a multi-threaded way.
-void TranspositionTable::new_search() {
-
- generation++;
- overwrites = 0;
-}
+void TranspositionTable::clear() {
+ std::vector threads;
-/// TranspositionTable::insert_pv() is called at the end of a search
-/// iteration, and inserts the PV back into the PV. This makes sure
-/// the old PV moves are searched first, even if the old TT entries
-/// have been overwritten.
+ for (size_t idx = 0; idx < Options["Threads"]; ++idx)
+ {
+ threads.emplace_back([this, idx]() {
-void TranspositionTable::insert_pv(const Position& pos, Move pv[]) {
+ // Thread binding gives faster search on systems with a first-touch policy
+ if (Options["Threads"] > 8)
+ WinProcGroup::bindThisThread(idx);
- StateInfo st;
- Position p(pos, pos.thread());
+ // Each thread will zero its part of the hash table
+ const size_t stride = clusterCount / Options["Threads"],
+ start = stride * idx,
+ len = idx != Options["Threads"] - 1 ?
+ stride : clusterCount - start;
- for (int i = 0; pv[i] != MOVE_NONE; i++)
- {
- TTEntry *tte = retrieve(p.get_key());
- if (!tte || tte->move() != pv[i])
- store(p.get_key(), VALUE_NONE, VALUE_TYPE_NONE, Depth(-127*OnePly), pv[i], VALUE_NONE, VALUE_NONE);
- p.do_move(pv[i], st);
+ std::memset(&table[start], 0, len * sizeof(Cluster));
+ });
}
-}
+ for (std::thread& th: threads)
+ th.join();
+}
-/// TranspositionTable::extract_pv() extends a PV by adding moves from the
-/// transposition table at the end. This should ensure that the PV is almost
-/// always at least two plies long, which is important, because otherwise we
-/// will often get single-move PVs when the search stops while failing high,
-/// and a single-move PV means that we don't have a ponder move.
+/// TranspositionTable::probe() looks up the current position in the transposition
+/// table. It returns true and a pointer to the TTEntry if the position is found.
+/// Otherwise, it returns false and a pointer to an empty or least valuable TTEntry
+/// to be replaced later. The replace value of an entry is calculated as its depth
+/// minus 8 times its relative age. TTEntry t1 is considered more valuable than
+/// TTEntry t2 if its replace value is greater than that of t2.
-void TranspositionTable::extract_pv(const Position& pos, Move bestMove, Move pv[], const int PLY_MAX) {
+TTEntry* TranspositionTable::probe(const Key key, bool& found) const {
- const TTEntry* tte;
- StateInfo st;
- Position p(pos, pos.thread());
- int ply = 0;
+ TTEntry* const tte = first_entry(key);
+ const uint16_t key16 = key >> 48; // Use the high 16 bits as key inside the cluster
- assert(bestMove != MOVE_NONE);
+ for (int i = 0; i < ClusterSize; ++i)
+ if (!tte[i].key16 || tte[i].key16 == key16)
+ {
+ tte[i].genBound8 = uint8_t(generation8 | (tte[i].genBound8 & 0x7)); // Refresh
- pv[ply] = bestMove;
- p.do_move(pv[ply++], st);
+ return found = (bool)tte[i].key16, &tte[i];
+ }
- // Extract moves from TT when possible. We try hard to always
- // get a ponder move, that's the reason of ply < 2 conditions.
- while ( (tte = retrieve(p.get_key())) != NULL
- && tte->move() != MOVE_NONE
- && (tte->type() == VALUE_TYPE_EXACT || ply < 2)
- && move_is_legal(p, tte->move())
- && (!p.is_draw() || ply < 2)
- && ply < PLY_MAX)
- {
- pv[ply] = tte->move();
- p.do_move(pv[ply++], st);
- }
- pv[ply] = MOVE_NONE;
+ // Find an entry to be replaced according to the replacement strategy
+ TTEntry* replace = tte;
+ for (int i = 1; i < ClusterSize; ++i)
+ // Due to our packed storage format for generation and its cyclic
+ // nature we add 263 (256 is the modulus plus 7 to keep the unrelated
+ // lowest three bits from affecting the result) to calculate the entry
+ // age correctly even after generation8 overflows into the next cycle.
+ if ( replace->depth8 - ((263 + generation8 - replace->genBound8) & 0xF8)
+ > tte[i].depth8 - ((263 + generation8 - tte[i].genBound8) & 0xF8))
+ replace = &tte[i];
+
+ return found = false, replace;
}
-/// TranspositionTable::full() returns the permill of all transposition table
-/// entries which have received at least one overwrite during the current search.
-/// It is used to display the "info hashfull ..." information in UCI.
+/// TranspositionTable::hashfull() returns an approximation of the hashtable
+/// occupation during a search. The hash is x permill full, as per UCI protocol.
+
+int TranspositionTable::hashfull() const {
-int TranspositionTable::full() const {
+ int cnt = 0;
+ for (int i = 0; i < 1000 / ClusterSize; ++i)
+ for (int j = 0; j < ClusterSize; ++j)
+ cnt += (table[i].entry[j].genBound8 & 0xF8) == generation8;
- double N = double(size) * ClusterSize;
- return int(1000 * (1 - exp(overwrites * log(1.0 - 1.0/N))));
+ return cnt * 1000 / (ClusterSize * (1000 / ClusterSize));
}