summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
c698362)
We can encode the ClusterSize directly in the
hashMask, this allows to skip the left shift.
There is no real change, but bench number is now
different because instead of using the lowest order
bits of the key to index the start of the cluster,
now we don't use the last two lsb bits that are
always set to zero (cluster size is 4). So for
instance, if 10 bits are used to index the cluster,
instead of bits [9..0] now we use bits [11..2].
This changes the positions that end up in the same
cluster affecting TT hits and so bench is different.
Also some renaming while there.
bench:
5383795
assert(msb((mbSize << 20) / sizeof(TTEntry)) < 32);
assert(msb((mbSize << 20) / sizeof(TTEntry)) < 32);
- uint32_t size = 1 << msb((mbSize << 20) / sizeof(TTEntry[ClusterSize]));
+ uint32_t size = ClusterSize << msb((mbSize << 20) / sizeof(TTEntry[ClusterSize]));
- if (clusterMask == size - 1)
+ if (hashMask == size - ClusterSize)
- clusterMask = size - 1;
- delete [] entries;
- entries = new (std::nothrow) TTEntry[size * ClusterSize];
+ hashMask = size - ClusterSize;
+ delete [] table;
+ table = new (std::nothrow) TTEntry[size];
{
std::cerr << "Failed to allocate " << mbSize
<< "MB for transposition table." << std::endl;
{
std::cerr << "Failed to allocate " << mbSize
<< "MB for transposition table." << std::endl;
void TranspositionTable::clear() {
void TranspositionTable::clear() {
- memset(entries, 0, (clusterMask + 1) * sizeof(TTEntry[ClusterSize]));
+ memset(table, 0, (hashMask + ClusterSize) * sizeof(TTEntry));
static const unsigned ClusterSize = 4; // A cluster is 64 Bytes
public:
static const unsigned ClusterSize = 4; // A cluster is 64 Bytes
public:
- ~TranspositionTable() { delete [] entries; }
+ ~TranspositionTable() { delete [] table; }
void new_search() { generation++; }
TTEntry* probe(const Key key) const;
void new_search() { generation++; }
TTEntry* probe(const Key key) const;
void store(const Key key, Value v, Bound type, Depth d, Move m, Value statV, Value kingD);
private:
void store(const Key key, Value v, Bound type, Depth d, Move m, Value statV, Value kingD);
private:
- uint32_t clusterMask;
- TTEntry* entries;
+ uint32_t hashMask;
+ TTEntry* table;
uint8_t generation; // Size must be not bigger then TTEntry::generation8
};
uint8_t generation; // Size must be not bigger then TTEntry::generation8
};
inline TTEntry* TranspositionTable::first_entry(const Key key) const {
inline TTEntry* TranspositionTable::first_entry(const Key key) const {
- return entries + ((uint32_t)key & clusterMask) * ClusterSize;
+ return table + ((uint32_t)key & hashMask);