TranspositionTable::TranspositionTable() {
- size = writes = 0;
+ size = overwrites = 0;
entries = 0;
generation = 0;
}
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->save(posKey32, v, t, d, m, generation, statV, kingD);
return;
}
- else if (i == 0) // replace would be a no-op in this common case
+
+ if (i == 0) // replace would be a no-op in this common case
continue;
- int c1 = (replace->generation() == generation ? 2 : 0);
- int c2 = (tte->generation() == generation ? -2 : 0);
- int c3 = (tte->depth() < replace->depth() ? 1 : 0);
+ 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);
- writes++;
+ overwrites++;
}
void TranspositionTable::new_search() {
generation++;
- writes = 0;
+ overwrites = 0;
}
/// TranspositionTable::full() returns the permill of all transposition table
-/// entries which have received at least one write during the current search.
+/// entries which have received at least one overwrite during the current search.
/// It is used to display the "info hashfull ..." information in UCI.
int TranspositionTable::full() const {
double N = double(size) * ClusterSize;
- return int(1000 * (1 - exp(writes * log(1.0 - 1.0/N))));
+ return int(1000 * (1 - exp(overwrites * log(1.0 - 1.0/N))));
}
TTEntry* first_entry(const Key posKey) const;
private:
- // Be sure 'writes' is at least one cache line away
+ // Be sure 'overwrites' is at least one cache line away
// from read only variables.
unsigned char pad_before[64 - sizeof(unsigned)];
- unsigned writes; // heavy SMP read/write access here
+ unsigned overwrites; // heavy SMP read/write access here
unsigned char pad_after[64];
size_t size;