X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Ftt.h;h=6c7caf75fce19bbab5c55886a26e6d75f27f47c1;hp=bc981c9450991ebf20f2a7c484af00478fed4c0d;hb=feeafb0a50556654e345a09d16529a5eb7715dc0;hpb=a46b53e1c21ba56b09d7d9e47335d383b5240ce0
diff --git a/src/tt.h b/src/tt.h
index bc981c94..6c7caf75 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-2010 Marco Costalba, Joona Kiiski, Tord Romstad
+ Copyright (C) 2008-2012 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,57 +17,13 @@
along with this program. If not, see .
*/
-
#if !defined(TT_H_INCLUDED)
#define TT_H_INCLUDED
-////
-//// Includes
-////
-
-#include "depth.h"
-#include "move.h"
-#include "value.h"
-
-
-////
-//// Types
-////
-
-
-/// A simple fixed size hash table used to store pawns and material
-/// configurations. It is basically just an array of Entry objects.
-/// Without cluster concept or overwrite policy.
-
-template
-class SimpleHash {
-
- SimpleHash(const SimpleHash&);
- SimpleHash& operator=(const SimpleHash&);
-
-public:
- SimpleHash() {
-
- entries = new Entry[HashSize];
- if (!entries)
- {
- std::cerr << "Failed to allocate " << HashSize * sizeof(Entry)
- << " bytes for material hash table." << std::endl;
- exit(EXIT_FAILURE);
- }
- memset(entries, 0, HashSize * sizeof(Entry));
- }
-
- ~SimpleHash() { delete [] entries; }
+#include "misc.h"
+#include "types.h"
- Entry* find(Key key) const { return entries + ((uint32_t)key & (HashSize - 1)); }
-
-protected:
- Entry* entries;
-};
-
-
-/// The TTEntry class is the class of transposition table entries
+/// The TTEntry is the class of transposition table entries
///
/// A TTEntry needs 128 bits to be stored
///
@@ -88,51 +44,71 @@ protected:
class TTEntry {
public:
- void save(uint32_t k, Value v, ValueType t, Depth d, Move m, int g, Value statV, Value kd) {
-
- key32 = k;
- data = (m & 0xFFFF) | (t << 21) | (g << 23);
- value16 = (int16_t)v;
- depth16 = (int16_t)d;
- staticValue = (int16_t)statV;
- staticValueMargin = (int16_t)kd;
+ void save(uint32_t k, Value v, Bound b, Depth d, Move m, int g) {
+
+ key32 = (uint32_t)k;
+ move16 = (uint16_t)m;
+ bound = (uint8_t)b;
+ generation8 = (uint8_t)g;
+ valueUpper = (int16_t)(b & BOUND_UPPER ? v : VALUE_NONE);
+ depthUpper = (int16_t)(b & BOUND_UPPER ? d : DEPTH_NONE);
+ valueLower = (int16_t)(b & BOUND_LOWER ? v : VALUE_NONE);
+ depthLower = (int16_t)(b & BOUND_LOWER ? d : DEPTH_NONE);
}
- void set_generation(int g) { data = move() | (type() << 21) | (g << 23); }
- uint32_t key() const { return key32; }
- Depth depth() const { return Depth(depth16); }
- Move move() const { return Move(data & 0xFFFF); }
- Value value() const { return Value(value16); }
- ValueType type() const { return ValueType((data >> 21) & 3); }
- int generation() const { return data >> 23; }
- Value static_value() const { return Value(staticValue); }
- Value static_value_margin() const { return Value(staticValueMargin); }
+ void update(Value v, Bound b, Depth d, Move m, int g) {
+
+ move16 = (uint16_t)m;
+ bound |= (uint8_t)b;
+ generation8 = (uint8_t)g;
+
+ if (b & BOUND_UPPER)
+ {
+ valueUpper = (int16_t)v;
+ depthUpper = (int16_t)d;
+ }
+
+ if (b & BOUND_LOWER)
+ {
+ valueLower = (int16_t)v;
+ depthLower = (int16_t)d;
+ }
+ }
+
+ void set_generation(int g) { generation8 = (uint8_t)g; }
+
+ uint32_t key() const { return key32; }
+ Depth depth() const { return (Depth)depthLower; }
+ Depth depth_upper() const { return (Depth)depthUpper; }
+ Move move() const { return (Move)move16; }
+ Value value() const { return (Value)valueLower; }
+ Value value_upper() const { return (Value)valueUpper; }
+ Bound type() const { return (Bound)bound; }
+ int generation() const { return (int)generation8; }
private:
uint32_t key32;
- uint32_t data;
- int16_t value16;
- int16_t depth16;
- int16_t staticValue;
- int16_t staticValueMargin;
+ uint16_t move16;
+ uint8_t bound, generation8;
+ int16_t valueLower, depthLower, valueUpper, depthUpper;
};
/// This is the number of TTEntry slots for each cluster
const int ClusterSize = 4;
-/// TTCluster consists of ClusterSize number of TTEntries.
-/// Size of TTCluster must not be bigger than a cache line size.
-/// In case it is less, it should be padded to guarantee always aligned accesses.
+
+/// TTCluster consists of ClusterSize number of TTEntries. Size of TTCluster
+/// must not be bigger than a cache line size. In case it is less, it should
+/// be padded to guarantee always aligned accesses.
struct TTCluster {
TTEntry data[ClusterSize];
};
-/// The transposition table class. This is basically just a huge array
-/// containing TTCluster objects, and a few methods for writing new entries
-/// and reading new ones.
+/// The transposition table class. This is basically just a huge array containing
+/// TTCluster objects, and a few methods for writing and reading entries.
class TranspositionTable {
@@ -144,8 +120,8 @@ public:
~TranspositionTable();
void set_size(size_t mbSize);
void clear();
- void store(const Key posKey, Value v, ValueType type, Depth d, Move m, Value statV, Value kingD);
- TTEntry* retrieve(const Key posKey) const;
+ void store(const Key posKey, Value v, Bound b, Depth d, Move m);
+ TTEntry* probe(const Key posKey) const;
void new_search();
TTEntry* first_entry(const Key posKey) const;
void refresh(const TTEntry* tte) const;
@@ -153,15 +129,15 @@ public:
private:
size_t size;
TTCluster* entries;
- uint8_t generation; // To properly compare, size must be smaller then TT stored value
+ uint8_t generation; // Size must be not bigger then TTEntry::generation8
};
extern TranspositionTable TT;
-/// TranspositionTable::first_entry returns a pointer to the first
-/// entry of a cluster given a position. The lowest order bits of the key
-/// are used to get the index of the cluster.
+/// TranspositionTable::first_entry() returns a pointer to the first entry of
+/// a cluster given a position. The lowest order bits of the key are used to
+/// get the index of the cluster.
inline TTEntry* TranspositionTable::first_entry(const Key posKey) const {
@@ -169,8 +145,8 @@ inline TTEntry* TranspositionTable::first_entry(const Key posKey) const {
}
-/// TranspositionTable::refresh updates the 'generation' value of the TTEntry
-/// to avoid aging. Normally called after a TT hit, before to return.
+/// TranspositionTable::refresh() updates the 'generation' value of the TTEntry
+/// to avoid aging. Normally called after a TT hit.
inline void TranspositionTable::refresh(const TTEntry* tte) const {