#include <cassert>
#include <cmath>
#include <cstring>
-#include <xmmintrin.h>
#include "movegen.h"
#include "tt.h"
+#if defined(_MSC_VER)
+#include <xmmintrin.h>
+#endif
-/// This is the number of TTEntry slots for each position
-static const int ClusterSize = 5;
+// This is the number of TTEntry slots for each position
+static const int ClusterSize = 4;
+// The main transposition table
+TranspositionTable TT;
////
//// Functions
}
+/// TranspositionTable::first_entry returns a pointer to the first
+/// entry of a cluster given a position. The low 32 bits of the key
+/// are used to get the index in the table.
+
+inline TTEntry* TranspositionTable::first_entry(const Key posKey) const {
+
+ return entries + ((uint32_t(posKey) & (size - 1)) * ClusterSize);
+}
+
+
/// TranspositionTable::store writes a new entry containing a position,
/// a value, a value type, a search depth, and a best move to the
/// transposition table. Transposition table is organized in clusters of
TTEntry* TranspositionTable::retrieve(const Key posKey) const {
uint32_t posKey32 = posKey >> 32;
- TTEntry *tte = first_entry(posKey);
+ TTEntry* tte = first_entry(posKey);
for (int i = 0; i < ClusterSize; i++, tte++)
if (tte->key() == posKey32)
return NULL;
}
+
/// TranspositionTable::prefetch looks up the current position in the
/// transposition table and load it in L1/L2 cache. This is a non
/// blocking function and do not stalls the CPU waiting for data
void TranspositionTable::prefetch(const Key posKey) const {
+#if defined(_MSC_VER)
_mm_prefetch((char*)first_entry(posKey), _MM_HINT_T0);
+#else
+ __builtin_prefetch((const void*)first_entry(posKey), 0, 3);
+#endif
}
-/// TranspositionTable::first_entry returns a pointer to the first
-/// entry of a cluster given a position. The low 32 bits of the key
-/// are used to get the index in the table.
-
-inline TTEntry* TranspositionTable::first_entry(const Key posKey) const {
-
- return entries + ((uint32_t(posKey) & (size - 1)) * ClusterSize);
-}
/// TranspositionTable::new_search() is called at the beginning of every new
/// search. It increments the "generation" variable, which is used to