Do a 32bit bitwise 'and' instead of a 64bit
subtract and bitwise 'and'.
This is possible because even in the biggest
hash table case (8GB) the number of entries
is 2^29 so storable in an unsigned int.
No functional change.
void TranspositionTable::set_size(size_t mbSize) {
void TranspositionTable::set_size(size_t mbSize) {
- size_t newSize = 1ULL << msb((mbSize << 20) / sizeof(TTEntry[ClusterSize]));
+ assert(msb((mbSize << 20) / sizeof(TTEntry)) < 32);
+ uint32_t size = 1 << msb((mbSize << 20) / sizeof(TTEntry[ClusterSize]));
+
+ if (clusterMask == size - 1)
+ clusterMask = size - 1;
delete [] entries;
entries = new (std::nothrow) TTEntry[size * ClusterSize];
delete [] entries;
entries = new (std::nothrow) TTEntry[size * ClusterSize];
void TranspositionTable::clear() {
void TranspositionTable::clear() {
- memset(entries, 0, size * sizeof(TTEntry[ClusterSize]));
+ memset(entries, 0, (clusterMask + 1) * sizeof(TTEntry[ClusterSize]));
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:
TTEntry* entries;
uint8_t generation; // Size must be not bigger then TTEntry::generation8
};
TTEntry* entries;
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 & (size - 1)) * ClusterSize;
+ return entries + ((uint32_t)key & clusterMask) * ClusterSize;