/*
- Glaurung, a UCI chess playing engine.
- Copyright (C) 2004-2008 Tord Romstad
+ Stockfish, a UCI chess playing engine derived from Glaurung 2.1
+ Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
+ Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
- Glaurung is free software: you can redistribute it and/or modify
+ Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
- Glaurung is distributed in the hope that it will be useful,
+ Stockfish is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
-
-#if !defined(MISC_H_INCLUDED)
+#ifndef MISC_H_INCLUDED
#define MISC_H_INCLUDED
+#include <cassert>
+#include <ostream>
+#include <string>
+#include <vector>
+
+#include "types.h"
-////
-//// Includes
-////
+const std::string engine_info(bool to_uci = false);
+void prefetch(void* addr);
+void start_logger(bool b);
-#include <string>
+void dbg_hit_on(bool b);
+void dbg_hit_on(bool c, bool b);
+void dbg_mean_of(int v);
+void dbg_print();
+
+
+namespace Time {
+ typedef int64_t point;
+ point now();
+}
+
+
+template<class Entry, int Size>
+struct HashTable {
+ Entry* operator[](Key key) { return &table[(uint32_t)key & (Size - 1)]; }
+private:
+ std::vector<Entry> table = std::vector<Entry>(Size);
+};
-////
-//// Constants
-////
+enum SyncCout { IO_LOCK, IO_UNLOCK };
+std::ostream& operator<<(std::ostream&, SyncCout);
-/// Version number. If this is left empty, the current date (in the format
-/// YYMMDD) is used as a version number.
+#define sync_cout std::cout << IO_LOCK
+#define sync_endl std::endl << IO_UNLOCK
-const std::string EngineVersion = "2.1";
+/// 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
+/// <http://vigna.di.unimi.it/ftp/papers/xorshift.pdf>
-////
-//// Macros
-////
+class PRNG {
-#define Min(x, y) (((x) < (y))? (x) : (y))
-#define Max(x, y) (((x) < (y))? (y) : (x))
+ uint64_t s;
+ uint64_t rand64() {
-////
-//// Prototypes
-////
+ s ^= s >> 12, s ^= s << 25, s ^= s >> 27;
+ return s * 2685821657736338717LL;
+ }
-extern const std::string engine_name();
-extern int get_system_time();
-extern int cpu_count();
-extern int Bioskey();
+public:
+ PRNG(uint64_t seed) : s(seed) { assert(seed); }
-////
-//// Debug
-////
-extern long dbg_cnt0;
-extern long dbg_cnt1;
-extern void dbg_print_hit_rate();
+ template<typename T> T rand() { return T(rand64()); }
-#define dbg_hit_on(x) { dbg_cnt0++; if (x) dbg_cnt1++; }
+ /// Special generator used to fast init magic numbers.
+ /// Output values only have 1/8th of their bits set on average.
+ template<typename T> T sparse_rand()
+ { return T(rand64() & rand64() & rand64()); }
+};
-#endif // !defined(MISC_H_INCLUDED)
+#endif // #ifndef MISC_H_INCLUDED