X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmisc.h;h=e0e0e98be8357cee894b2133ead6f654c0abc3f4;hp=b9277372aa4ac224dd2c4baf68aebfceef64d711;hb=f83cb95740de019db6ff5567d6f84f218b18cd9e;hpb=158864270a055fe20dca4a87f4b7a8aa9cedfeb9 diff --git a/src/misc.h b/src/misc.h index b9277372..e0e0e98b 100644 --- a/src/misc.h +++ b/src/misc.h @@ -1,7 +1,8 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2014 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2015-2020 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -20,6 +21,8 @@ #ifndef MISC_H_INCLUDED #define MISC_H_INCLUDED +#include +#include #include #include #include @@ -27,29 +30,31 @@ #include "types.h" const std::string engine_info(bool to_uci = false); -void timed_wait(WaitCondition&, Lock&, int); -void prefetch(char* addr); -void start_logger(bool b); +const std::string compiler_info(); +void prefetch(void* addr); +void start_logger(const std::string& fname); +void* aligned_ttmem_alloc(size_t size, void*& mem); void dbg_hit_on(bool b); -void dbg_hit_on_c(bool c, bool b); +void dbg_hit_on(bool c, bool b); void dbg_mean_of(int v); void dbg_print(); +typedef std::chrono::milliseconds::rep TimePoint; // A value in milliseconds -namespace Time { - typedef int64_t point; - inline point now() { return system_time_to_msec(); } -} +static_assert(sizeof(TimePoint) == sizeof(int64_t), "TimePoint should be 64 bits"); +inline TimePoint now() { + return std::chrono::duration_cast + (std::chrono::steady_clock::now().time_since_epoch()).count(); +} template struct HashTable { - HashTable() : table(Size, Entry()) {} Entry* operator[](Key key) { return &table[(uint32_t)key & (Size - 1)]; } private: - std::vector table; + std::vector table = std::vector(Size); // Allocate on the heap }; @@ -59,37 +64,60 @@ std::ostream& operator<<(std::ostream&, SyncCout); #define sync_cout std::cout << IO_LOCK #define sync_endl std::endl << IO_UNLOCK +namespace Utility { + +/// Clamp a value between lo and hi. Available in c++17. +template constexpr const T& clamp(const T& v, const T& lo, const T& hi) { + return v < lo ? lo : v > hi ? hi : v; +} + +} /// xorshift64star Pseudo-Random Number Generator /// This class is based on original code written and dedicated /// to the public domain by Sebastiano Vigna (2014). /// It has the following characteristics: +/// /// - Outputs 64-bit numbers /// - Passes Dieharder and SmallCrush test batteries /// - Does not require warm-up, no zeroland to escape /// - Internal state is a single 64-bit integer /// - Period is 2^64 - 1 /// - Speed: 1.60 ns/call (Core i7 @3.40GHz) +/// /// For further analysis see /// class PRNG { - uint64_t x; + uint64_t s; uint64_t rand64() { - x^=x>>12; x^=x<<25; x^=x>>27; - return x * 2685821657736338717LL; + + s ^= s >> 12, s ^= s << 25, s ^= s >> 27; + return s * 2685821657736338717LL; } public: - PRNG(uint64_t seed) : x(seed) { assert(seed); } + PRNG(uint64_t seed) : s(seed) { assert(seed); } template T rand() { return T(rand64()); } /// Special generator used to fast init magic numbers. /// Output values only have 1/8th of their bits set on average. - template T sparse_rand() { return T(rand64() & rand64() & rand64()); } + template T sparse_rand() + { return T(rand64() & rand64() & rand64()); } }; + +/// Under Windows it is not possible for a process to run on more than one +/// logical processor group. This usually means to be limited to use max 64 +/// cores. To overcome this, some special platform specific API should be +/// called to set group affinity for each thread. Original code from Texel by +/// Peter Österlund. + +namespace WinProcGroup { + void bindThisThread(size_t idx); +} + #endif // #ifndef MISC_H_INCLUDED