Rev 154 | Go to most recent revision | Details | Last modification | View Log | RSS feed
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 96 | pmbaty | 1 | /* |
| 2 | Stockfish, a UCI chess playing engine derived from Glaurung 2.1 |
||
| 3 | Copyright (C) 2004-2008 Tord Romstad (Glaurung author) |
||
| 4 | Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad |
||
| 5 | Copyright (C) 2015-2016 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad |
||
| 6 | |||
| 7 | Stockfish is free software: you can redistribute it and/or modify |
||
| 8 | it under the terms of the GNU General Public License as published by |
||
| 9 | the Free Software Foundation, either version 3 of the License, or |
||
| 10 | (at your option) any later version. |
||
| 11 | |||
| 12 | Stockfish is distributed in the hope that it will be useful, |
||
| 13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
||
| 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||
| 15 | GNU General Public License for more details. |
||
| 16 | |||
| 17 | You should have received a copy of the GNU General Public License |
||
| 18 | along with this program. If not, see <http://www.gnu.org/licenses/>. |
||
| 19 | */ |
||
| 20 | |||
| 21 | #ifndef MISC_H_INCLUDED |
||
| 22 | #define MISC_H_INCLUDED |
||
| 23 | |||
| 24 | #include <cassert> |
||
| 25 | #include <chrono> |
||
| 26 | #include <ostream> |
||
| 27 | #include <string> |
||
| 28 | #include <vector> |
||
| 29 | |||
| 30 | #include "types.h" |
||
| 31 | |||
| 32 | const std::string engine_info(bool to_uci = false); |
||
| 33 | void prefetch(void* addr); |
||
| 34 | void start_logger(bool b); |
||
| 35 | |||
| 36 | void dbg_hit_on(bool b); |
||
| 37 | void dbg_hit_on(bool c, bool b); |
||
| 38 | void dbg_mean_of(int v); |
||
| 39 | void dbg_print(); |
||
| 40 | |||
| 41 | typedef std::chrono::milliseconds::rep TimePoint; // A value in milliseconds |
||
| 42 | |||
| 43 | inline TimePoint now() { |
||
| 44 | return std::chrono::duration_cast<std::chrono::milliseconds> |
||
| 45 | (std::chrono::steady_clock::now().time_since_epoch()).count(); |
||
| 46 | } |
||
| 47 | |||
| 48 | template<class Entry, int Size> |
||
| 49 | struct HashTable { |
||
| 50 | Entry* operator[](Key key) { return &table[(uint32_t)key & (Size - 1)]; } |
||
| 51 | |||
| 52 | private: |
||
| 53 | std::vector<Entry> table = std::vector<Entry>(Size); |
||
| 54 | }; |
||
| 55 | |||
| 56 | |||
| 57 | enum SyncCout { IO_LOCK, IO_UNLOCK }; |
||
| 58 | std::ostream& operator<<(std::ostream&, SyncCout); |
||
| 59 | |||
| 60 | #define sync_cout std::cout << IO_LOCK |
||
| 61 | #define sync_endl std::endl << IO_UNLOCK |
||
| 62 | |||
| 63 | |||
| 64 | /// xorshift64star Pseudo-Random Number Generator |
||
| 65 | /// This class is based on original code written and dedicated |
||
| 66 | /// to the public domain by Sebastiano Vigna (2014). |
||
| 67 | /// It has the following characteristics: |
||
| 68 | /// |
||
| 69 | /// - Outputs 64-bit numbers |
||
| 70 | /// - Passes Dieharder and SmallCrush test batteries |
||
| 71 | /// - Does not require warm-up, no zeroland to escape |
||
| 72 | /// - Internal state is a single 64-bit integer |
||
| 73 | /// - Period is 2^64 - 1 |
||
| 74 | /// - Speed: 1.60 ns/call (Core i7 @3.40GHz) |
||
| 75 | /// |
||
| 76 | /// For further analysis see |
||
| 77 | /// <http://vigna.di.unimi.it/ftp/papers/xorshift.pdf> |
||
| 78 | |||
| 79 | class PRNG { |
||
| 80 | |||
| 81 | uint64_t s; |
||
| 82 | |||
| 83 | uint64_t rand64() { |
||
| 84 | |||
| 85 | s ^= s >> 12, s ^= s << 25, s ^= s >> 27; |
||
| 86 | return s * 2685821657736338717LL; |
||
| 87 | } |
||
| 88 | |||
| 89 | public: |
||
| 90 | PRNG(uint64_t seed) : s(seed) { assert(seed); } |
||
| 91 | |||
| 92 | template<typename T> T rand() { return T(rand64()); } |
||
| 93 | |||
| 94 | /// Special generator used to fast init magic numbers. |
||
| 95 | /// Output values only have 1/8th of their bits set on average. |
||
| 96 | template<typename T> T sparse_rand() |
||
| 97 | { return T(rand64() & rand64() & rand64()); } |
||
| 98 | }; |
||
| 99 | |||
| 100 | #endif // #ifndef MISC_H_INCLUDED |