Fix some missing rename from previous patch

No functional change.

diff --git a/src/tt.cpp b/src/tt.cpp
index cc3bea2023d7d51d3f0b3149a991420bde05572a..66113ee8f2c4969bbe76e1cb2e3aa5e88e8c082f 100644 (file)
--- a/src/tt.cpp
+++ b/src/tt.cpp
@@ -28,7 +28,7 @@ TranspositionTable TT; // Our global transposition table
 
 /// TranspositionTable::resize() sets the size of the transposition table,
 /// measured in megabytes. Transposition table consists of a power of 2 number
 
 /// TranspositionTable::resize() sets the size of the transposition table,
 /// 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);
   const uint16_t key16 = key >> 48;  // Use the high 16 bits as key inside the cluster
 
   TTEntry* const tte = first_entry(key);
   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)
       if (!tte[i].key16 || tte[i].key16 == 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
   TTEntry* replace = tte;
 
   // Find an entry to be replaced according to the replacement strategy
   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)
           - ((replace->genBound8 & 0xFC) == generation8)
           - (tte[i].depth8 < replace->depth8) < 0)
       if (  ((  tte[i].genBound8 & 0xFC) == generation8 || tte[i].bound() == BOUND_EXACT)
           - ((replace->genBound8 & 0xFC) == generation8)
           - (tte[i].depth8 < replace->depth8) < 0)

diff --git a/src/tt.h b/src/tt.h
index 420aaa6b60c03a106a949a6c8dfc7e447273fdf0..4df015c07cbc34c5f847f4a91202b64b79a90b3f 100644 (file)
--- a/src/tt.h
+++ b/src/tt.h
@@ -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
 /// not be bigger than a cache line size. In case it is less, it should be padded
 /// to guarantee always aligned accesses.
 /// 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.


@@ -74,10 +74,10 @@ private:
 class TranspositionTable {
 
   static const int CacheLineSize = 64;
 class TranspositionTable {
 
   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
   };