kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-05-02 01:29:36 +00:00
Code Issues Releases Wiki Activity

Fix some missing rename from previous patch

Browse source 
No functional change.
This commit is contained in:
Marco Costalba 2015-01-17 22:15:15 +01:00
parent 595fc342cf
commit 05cb58f4fc
2 changed files with 6 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
src/tt.cpp
View file

@ -28,7 +28,7 @@ TranspositionTable TT; // Our global transposition table
/// TranspositionTable::resize() sets the size of the transposition table, /// TranspositionTable::resize() sets the size of the transposition table,
/// measured in megabytes. Transposition table consists of a power of 2 number /// measured in megabytes. Transposition table consists of a power of 2 number
/// of clusters and each cluster consists of TTClusterSize number of TTEntry. /// of clusters and each cluster consists of ClusterSize number of TTEntry.
void TranspositionTable::resize(size_t mbSize) { void TranspositionTable::resize(size_t mbSize) {
@ -77,7 +77,7 @@ TTEntry* TranspositionTable::probe(const Key key, bool& found) const {
TTEntry* const tte = first_entry(key); TTEntry* const tte = first_entry(key);
const uint16_t key16 = key >> 48; // Use the high 16 bits as key inside the cluster const uint16_t key16 = key >> 48; // Use the high 16 bits as key inside the cluster
for (int i = 0; i < TTClusterSize; ++i) for (int i = 0; i < ClusterSize; ++i)
if (!tte[i].key16 || tte[i].key16 == key16) if (!tte[i].key16 || tte[i].key16 == key16)
{ {
if (tte[i].key16) if (tte[i].key16)
@ -88,7 +88,7 @@ TTEntry* TranspositionTable::probe(const Key key, bool& found) const {
// Find an entry to be replaced according to the replacement strategy // Find an entry to be replaced according to the replacement strategy
TTEntry* replace = tte; TTEntry* replace = tte;
for (int i = 1; i < TTClusterSize; ++i) for (int i = 1; i < ClusterSize; ++i)
if ( (( tte[i].genBound8 & 0xFC) == generation8 || tte[i].bound() == BOUND_EXACT) if ( (( tte[i].genBound8 & 0xFC) == generation8 || tte[i].bound() == BOUND_EXACT)
- ((replace->genBound8 & 0xFC) == generation8) - ((replace->genBound8 & 0xFC) == generation8)
- (tte[i].depth8 < replace->depth8) < 0) - (tte[i].depth8 < replace->depth8) < 0)

6
src/tt.h
View file

@ -66,7 +66,7 @@ private:
/// A TranspositionTable consists of a power of 2 number of clusters and each /// A TranspositionTable consists of a power of 2 number of clusters and each
/// cluster consists of TTClusterSize number of TTEntry. Each non-empty entry /// cluster consists of ClusterSize number of TTEntry. Each non-empty entry
/// contains information of exactly one position. The size of a cluster should /// 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 /// not be bigger than a cache line size. In case it is less, it should be padded
/// to guarantee always aligned accesses. /// to guarantee always aligned accesses.
@ -74,10 +74,10 @@ private:
class TranspositionTable { class TranspositionTable {
static const int CacheLineSize = 64; static const int CacheLineSize = 64;
static const int TTClusterSize = 3; static const int ClusterSize = 3;
struct Cluster { struct Cluster {
TTEntry entry[TTClusterSize]; TTEntry entry[ClusterSize];
char padding[2]; // Align to the cache line size char padding[2]; // Align to the cache line size
}; };