X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Ftt.cpp;h=8da3ca75767755f0e4198f98125fd0e23da12dfb;hp=55aad112af3c252d6006265132e8cb657d70d5f6;hb=0f50f10327bc1a53d656d5d8c918a9ee413e5e84;hpb=06a5b602dc32e5dcbb00f32968f1c18004ec93a2 diff --git a/src/tt.cpp b/src/tt.cpp index 55aad112..8da3ca75 100644 --- a/src/tt.cpp +++ b/src/tt.cpp @@ -25,7 +25,9 @@ #include #include #include -#include +#if !defined(__hpux) +# include +#endif #include "movegen.h" #include "tt.h" @@ -53,11 +55,9 @@ TranspositionTable::~TranspositionTable() { /// TranspositionTable::set_size sets the size of the transposition table, /// measured in megabytes. -void TranspositionTable::set_size(unsigned mbSize) { - - assert(mbSize >= 4 && mbSize <= 4096); +void TranspositionTable::set_size(size_t mbSize) { - unsigned newSize = 1024; + size_t newSize = 1024; // We store a cluster of ClusterSize number of TTEntry for each position // and newSize is the maximum number of storable positions. @@ -169,11 +169,14 @@ TTEntry* TranspositionTable::retrieve(const Key posKey) const { /// to be loaded from RAM, that can be very slow. When we will /// subsequently call retrieve() the TT data will be already /// quickly accessible in L1/L2 CPU cache. +#if defined(__hpux) +void TranspositionTable::prefetch(const Key) const {} // Not supported on HP UX +#else void TranspositionTable::prefetch(const Key posKey) const { #if defined(__INTEL_COMPILER) || defined(__ICL) - // This hack prevents prefetches to be optimized away by the + // This hack prevents prefetches to be optimized away by // Intel compiler. Both MSVC and gcc seems not affected. __asm__ (""); #endif @@ -183,6 +186,7 @@ void TranspositionTable::prefetch(const Key posKey) const { _mm_prefetch(addr+64, _MM_HINT_T2); // 64 bytes ahead } +#endif /// TranspositionTable::new_search() is called at the beginning of every new /// search. It increments the "generation" variable, which is used to @@ -208,7 +212,9 @@ void TranspositionTable::insert_pv(const Position& pos, Move pv[]) { for (int i = 0; pv[i] != MOVE_NONE; i++) { - store(p.get_key(), VALUE_NONE, VALUE_TYPE_NONE, Depth(-127*OnePly), pv[i]); + TTEntry *tte = retrieve(p.get_key()); + if (!tte || tte->move() != pv[i]) + store(p.get_key(), VALUE_NONE, VALUE_TYPE_NONE, Depth(-127*OnePly), pv[i]); p.do_move(pv[i], st); } }