X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Ftt.cpp;h=24e94c8008bd691c4045719f065359dd1ff3ee5a;hp=1dc97f5d71cb9d6e05ae3aabe6887a6ce4ebc617;hb=40c863d41af5058a02f1de3423a000d801dcb08a;hpb=02f96fcf5ec82ddf4b94f7992acdfb548a7a218c
diff --git a/src/tt.cpp b/src/tt.cpp
index 1dc97f5d..24e94c80 100644
--- a/src/tt.cpp
+++ b/src/tt.cpp
@@ -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-2010 Marco Costalba, Joona Kiiski, Tord Romstad
+ Copyright (C) 2008-2014 Marco Costalba, Joona Kiiski, 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,197 +17,105 @@
along with this program. If not, see .
*/
-
-////
-//// Includes
-////
-
-#include
#include
+#include
-#include "evaluate.h"
-#include "movegen.h"
+#include "bitboard.h"
#include "tt.h"
-// The main transposition table
-TranspositionTable TT;
+TranspositionTable TT; // Our global transposition table
-////
-//// Functions
-////
-TranspositionTable::TranspositionTable() {
-
- size = 0;
- entries = 0;
- generation = 0;
-}
-
-TranspositionTable::~TranspositionTable() {
-
- delete [] entries;
-}
+/// TranspositionTable::set_size() 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::set_size(uint64_t mbSize) {
-/// TranspositionTable::set_size sets the size of the transposition table,
-/// measured in megabytes.
+ assert(msb((mbSize << 20) / sizeof(TTEntry)) < 32);
-void TranspositionTable::set_size(size_t mbSize) {
+ uint32_t size = ClusterSize << msb((mbSize << 20) / sizeof(TTEntry[ClusterSize]));
- size_t newSize = 1024;
+ if (hashMask == size - ClusterSize)
+ return;
- // 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;
+ hashMask = size - ClusterSize;
+ free(mem);
+ mem = calloc(size * sizeof(TTEntry) + CACHE_LINE_SIZE - 1, 1);
- if (newSize != size)
+ if (!mem)
{
- 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();
- }
+ std::cerr << "Failed to allocate " << mbSize
+ << "MB for transposition table." << std::endl;
+ exit(EXIT_FAILURE);
}
+
+ table = (TTEntry*)((uintptr_t(mem) + CACHE_LINE_SIZE - 1) & ~(CACHE_LINE_SIZE - 1));
}
-/// TranspositionTable::clear overwrites the entire transposition table
+/// 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::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.
-
-void TranspositionTable::store(const Key posKey, Value v, ValueType t, Depth d, Move m, Value statV, Value kingD) {
-
- int c1, c2, c3;
- TTEntry *tte, *replace;
- uint32_t posKey32 = posKey >> 32; // Use the high 32 bits as key
-
- tte = replace = first_entry(posKey);
- for (int i = 0; i < ClusterSize; i++, tte++)
- {
- 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;
- }
- replace->save(posKey32, v, t, d, m, generation, statV, kingD);
+ std::memset(table, 0, (hashMask + ClusterSize) * sizeof(TTEntry));
}
-/// TranspositionTable::retrieve looks up the current position in the
-/// transposition table. Returns a pointer to the TTEntry or NULL
-/// if position is not found.
+/// TranspositionTable::probe() 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 {
+const TTEntry* TranspositionTable::probe(const Key key) const {
- uint32_t posKey32 = posKey >> 32;
- TTEntry* tte = first_entry(posKey);
+ const TTEntry* tte = first_entry(key);
+ uint32_t key32 = key >> 32;
- for (int i = 0; i < ClusterSize; i++, tte++)
- if (tte->key() == posKey32)
+ for (unsigned i = 0; i < ClusterSize; ++i, ++tte)
+ if (tte->key() == key32)
return tte;
return NULL;
}
-/// 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.
-
-void TranspositionTable::new_search() {
- generation++;
-}
+/// TranspositionTable::store() writes a new entry containing position key and
+/// valuable information of current position. The lowest order bits of position
+/// key are used to decide in which cluster the position will be placed.
+/// When a new entry is written and there are no empty entries available in the
+/// cluster, it replaces the least valuable of the entries. 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.
+void TranspositionTable::store(const Key key, Value v, Bound b, Depth d, Move m, Value statV) {
-/// 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.
-
-void TranspositionTable::insert_pv(const Position& pos, Move pv[]) {
+ int c1, c2, c3;
+ TTEntry *tte, *replace;
+ uint32_t key32 = key >> 32; // Use the high 32 bits as key inside the cluster
- StateInfo st;
- EvalInfo ei;
- Value v;
- Position p(pos, pos.thread());
+ tte = replace = first_entry(key);
- for (int i = 0; pv[i] != MOVE_NONE; i++)
+ for (unsigned i = 0; i < ClusterSize; ++i, ++tte)
{
- TTEntry *tte = retrieve(p.get_key());
- if (!tte || tte->move() != pv[i])
+ if (!tte->key() || tte->key() == key32) // Empty or overwrite old
{
- v = (p.is_check() ? VALUE_NONE : evaluate(p, ei));
- store(p.get_key(), VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, pv[i], v, ei.kingDanger[pos.side_to_move()]);
- }
- p.do_move(pv[i], st);
- }
-}
+ if (!m)
+ m = tte->move(); // Preserve any existing ttMove
+ replace = tte;
+ break;
+ }
-/// TranspositionTable::extract_pv() builds a PV by adding moves from the
-/// transposition table. We consider also failing high nodes and not only
-/// VALUE_TYPE_EXACT nodes. This allow to always have a ponder move even
-/// when we fail high at root and also a long PV to print that is important
-/// for position analysis.
-
-void TranspositionTable::extract_pv(const Position& pos, Move bestMove, Move pv[], const int PLY_MAX) {
-
- const TTEntry* tte;
- StateInfo st;
- Position p(pos, pos.thread());
- int ply = 0;
-
- assert(bestMove != MOVE_NONE);
-
- pv[ply] = bestMove;
- p.do_move(pv[ply++], st);
+ // Implement replace strategy
+ c1 = (replace->generation() == generation ? 2 : 0);
+ c2 = (tte->generation() == generation || tte->bound() == BOUND_EXACT ? -2 : 0);
+ c3 = (tte->depth() < replace->depth() ? 1 : 0);
- while ( (tte = retrieve(p.get_key())) != NULL
- && tte->move() != MOVE_NONE
- && move_is_legal(p, tte->move())
- && (!p.is_draw() || ply < 2)
- && ply < PLY_MAX)
- {
- pv[ply] = tte->move();
- p.do_move(pv[ply++], st);
+ if (c1 + c2 + c3 > 0)
+ replace = tte;
}
- pv[ply] = MOVE_NONE;
+
+ replace->save(key32, v, b, d, m, generation, statV);
}