Increase the maximum hash size by a factor of 256

[stockfish] / src / tt.cpp

diff --git a/src/tt.cpp b/src/tt.cpp
index 080d3a6bd480006e4c821661d2ec9800a4b7523b..92aaee001824276e49f1090c72ec451070900dd0 100644 (file)
--- a/src/tt.cpp
+++ b/src/tt.cpp
@@ -63,10 +63,12 @@ void TranspositionTable::resize(size_t mbSize) {
 
   Threads.main()->wait_for_search_finished();
 
 
   Threads.main()->wait_for_search_finished();
 

-  free(mem);
+  aligned_ttmem_free(mem);

 
 

-  clusterCount = mbSize * 1024 * 1024 / sizeof(Cluster);
-  table = static_cast<Cluster*>(aligned_ttmem_alloc(clusterCount * sizeof(Cluster), &mem));
+  superClusterCount = mbSize * 1024 * 1024 / (sizeof(Cluster) * ClustersPerSuperCluster);
+
+  table = static_cast<Cluster*>(
+      aligned_ttmem_alloc(superClusterCount * ClustersPerSuperCluster * sizeof(Cluster), mem));

   if (!mem)
   {
       std::cerr << "Failed to allocate " << mbSize
   if (!mem)
   {
       std::cerr << "Failed to allocate " << mbSize


@@ -89,13 +91,15 @@ void TranspositionTable::clear() {
   {
       threads.emplace_back([this, idx]() {
 
   {
       threads.emplace_back([this, idx]() {
 

+          const size_t clusterCount = superClusterCount * ClustersPerSuperCluster;
+

           // Thread binding gives faster search on systems with a first-touch policy
           if (Options["Threads"] > 8)
               WinProcGroup::bindThisThread(idx);
 
           // Each thread will zero its part of the hash table
           // Thread binding gives faster search on systems with a first-touch policy
           if (Options["Threads"] > 8)
               WinProcGroup::bindThisThread(idx);
 
           // Each thread will zero its part of the hash table

-          const size_t stride = clusterCount / Options["Threads"],
-                       start  = stride * idx,
+          const size_t stride = size_t(clusterCount / Options["Threads"]),
+                       start  = size_t(stride * idx),

                        len    = idx != Options["Threads"] - 1 ?
                                 stride : clusterCount - start;
 
                        len    = idx != Options["Threads"] - 1 ?
                                 stride : clusterCount - start;
 


@@ -103,7 +107,7 @@ void TranspositionTable::clear() {
       });
   }
 
       });
   }
 

-  for (std::thread& th: threads)
+  for (std::thread& th : threads)

       th.join();
 }
 
       th.join();
 }
 


@@ -148,9 +152,9 @@ TTEntry* TranspositionTable::probe(const Key key, bool& found) const {
 int TranspositionTable::hashfull() const {
 
   int cnt = 0;
 int TranspositionTable::hashfull() const {
 
   int cnt = 0;

-  for (int i = 0; i < 1000 / ClusterSize; ++i)
+  for (int i = 0; i < 1000; ++i)

       for (int j = 0; j < ClusterSize; ++j)
           cnt += (table[i].entry[j].genBound8 & 0xF8) == generation8;
 
       for (int j = 0; j < ClusterSize; ++j)
           cnt += (table[i].entry[j].genBound8 & 0xF8) == generation8;
 

-  return cnt * 1000 / (ClusterSize * (1000 / ClusterSize));
+  return cnt / ClusterSize;

 }
 }