droidfish/DroidFish/jni/stockfish/tt.h

105 lines
3.1 KiB
C
Raw Normal View History

2011-11-12 20:44:06 +01:00
/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
Copyright (C) 2008-2014 Marco Costalba, Joona Kiiski, Tord Romstad
2011-11-12 20:44:06 +01:00
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Stockfish is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef TT_H_INCLUDED
2011-11-12 20:44:06 +01:00
#define TT_H_INCLUDED
#include "misc.h"
2011-11-12 20:44:06 +01:00
#include "types.h"
/// The TTEntry is the 14 bytes transposition table entry, defined as below:
2011-11-12 20:44:06 +01:00
///
/// key 32 bit
/// move 16 bit
/// bound type 8 bit
/// generation 8 bit
/// value 16 bit
/// depth 16 bit
/// eval value 16 bit
2011-11-12 20:44:06 +01:00
struct TTEntry {
2011-11-12 20:44:06 +01:00
Move move() const { return (Move )move16; }
Bound bound() const { return (Bound)bound8; }
Value value() const { return (Value)value16; }
Depth depth() const { return (Depth)depth16; }
Value eval_value() const { return (Value)evalValue; }
2011-11-12 20:44:06 +01:00
private:
friend class TranspositionTable;
2011-11-12 20:44:06 +01:00
void save(uint32_t k, Value v, Bound b, Depth d, Move m, uint8_t g, Value ev) {
key32 = (uint32_t)k;
move16 = (uint16_t)m;
bound8 = (uint8_t)b;
generation8 = (uint8_t)g;
value16 = (int16_t)v;
depth16 = (int16_t)d;
evalValue = (int16_t)ev;
}
2011-11-12 20:44:06 +01:00
uint32_t key32;
uint16_t move16;
uint8_t bound8, generation8;
int16_t value16, depth16, evalValue;
2011-11-12 20:44:06 +01:00
};
/// A TranspositionTable consists of a power of 2 number of clusters and each
/// cluster consists of ClusterSize number of TTEntry. Each non-empty entry
/// contains information of exactly one position. The size of a cluster should
/// not be bigger than a cache line size. In case it is less, it should be padded
/// to guarantee always aligned accesses.
2011-11-12 20:44:06 +01:00
class TranspositionTable {
static const unsigned ClusterSize = 4;
2011-11-12 20:44:06 +01:00
public:
~TranspositionTable() { free(mem); }
void new_search() { ++generation; }
const TTEntry* probe(const Key key) const;
TTEntry* first_entry(const Key key) const;
void resize(uint64_t mbSize);
2011-11-12 20:44:06 +01:00
void clear();
void store(const Key key, Value v, Bound type, Depth d, Move m, Value statV);
2011-11-12 20:44:06 +01:00
private:
uint32_t hashMask;
TTEntry* table;
void* mem;
uint8_t generation; // Size must be not bigger than TTEntry::generation8
2011-11-12 20:44:06 +01:00
};
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.
inline TTEntry* TranspositionTable::first_entry(const Key key) const {
2011-11-12 20:44:06 +01:00
return table + ((uint32_t)key & hashMask);
2011-11-12 20:44:06 +01:00
}
#endif // #ifndef TT_H_INCLUDED