2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2020 The Stockfish developers (see AUTHORS file)
5 Stockfish is free software: you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation, either version 3 of the License, or
8 (at your option) any later version.
10 Stockfish is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <http://www.gnu.org/licenses/>.
20 #if _WIN32_WINNT < 0x0601
22 #define _WIN32_WINNT 0x0601 // Force to include needed API prototypes
30 // The needed Windows API for processor groups could be missed from old Windows
31 // versions, so instead of calling them directly (forcing the linker to resolve
32 // the calls at compile time), try to load them at runtime. To do this we need
33 // first to define the corresponding function pointers.
35 typedef bool(*fun1_t)(LOGICAL_PROCESSOR_RELATIONSHIP,
36 PSYSTEM_LOGICAL_PROCESSOR_INFORMATION_EX, PDWORD);
37 typedef bool(*fun2_t)(USHORT, PGROUP_AFFINITY);
38 typedef bool(*fun3_t)(HANDLE, CONST GROUP_AFFINITY*, PGROUP_AFFINITY);
49 #if defined(__linux__) && !defined(__ANDROID__)
54 #if defined(__APPLE__) || defined(__ANDROID__) || defined(__OpenBSD__) || (defined(__GLIBCXX__) && !defined(_GLIBCXX_HAVE_ALIGNED_ALLOC) && !defined(_WIN32))
55 #define POSIXALIGNEDALLOC
66 /// Version number. If Version is left empty, then compile date in the format
67 /// DD-MM-YY and show in engine_info.
68 const string Version = "";
70 /// Our fancy logging facility. The trick here is to replace cin.rdbuf() and
71 /// cout.rdbuf() with two Tie objects that tie cin and cout to a file stream. We
72 /// can toggle the logging of std::cout and std:cin at runtime whilst preserving
73 /// usual I/O functionality, all without changing a single line of code!
74 /// Idea from http://groups.google.com/group/comp.lang.c++/msg/1d941c0f26ea0d81
76 struct Tie: public streambuf { // MSVC requires split streambuf for cin and cout
78 Tie(streambuf* b, streambuf* l) : buf(b), logBuf(l) {}
80 int sync() override { return logBuf->pubsync(), buf->pubsync(); }
81 int overflow(int c) override { return log(buf->sputc((char)c), "<< "); }
82 int underflow() override { return buf->sgetc(); }
83 int uflow() override { return log(buf->sbumpc(), ">> "); }
85 streambuf *buf, *logBuf;
87 int log(int c, const char* prefix) {
89 static int last = '\n'; // Single log file
92 logBuf->sputn(prefix, 3);
94 return last = logBuf->sputc((char)c);
100 Logger() : in(cin.rdbuf(), file.rdbuf()), out(cout.rdbuf(), file.rdbuf()) {}
101 ~Logger() { start(""); }
107 static void start(const std::string& fname) {
111 if (!fname.empty() && !l.file.is_open())
113 l.file.open(fname, ifstream::out);
115 if (!l.file.is_open())
117 cerr << "Unable to open debug log file " << fname << endl;
124 else if (fname.empty() && l.file.is_open())
126 cout.rdbuf(l.out.buf);
135 /// engine_info() returns the full name of the current Stockfish version. This
136 /// will be either "Stockfish <Tag> DD-MM-YY" (where DD-MM-YY is the date when
137 /// the program was compiled) or "Stockfish <Version>", depending on whether
138 /// Version is empty.
140 const string engine_info(bool to_uci) {
142 const string months("Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec");
143 string month, day, year;
144 stringstream ss, date(__DATE__); // From compiler, format is "Sep 21 2008"
146 ss << "Stockfish " << Version << setfill('0');
150 date >> month >> day >> year;
151 ss << setw(2) << day << setw(2) << (1 + months.find(month) / 4) << year.substr(2);
154 ss << (to_uci ? "\nid author ": " by ")
155 << "the Stockfish developers (see AUTHORS file)";
161 /// compiler_info() returns a string trying to describe the compiler we use
163 const std::string compiler_info() {
165 #define stringify2(x) #x
166 #define stringify(x) stringify2(x)
167 #define make_version_string(major, minor, patch) stringify(major) "." stringify(minor) "." stringify(patch)
169 /// Predefined macros hell:
171 /// __GNUC__ Compiler is gcc, Clang or Intel on Linux
172 /// __INTEL_COMPILER Compiler is Intel
173 /// _MSC_VER Compiler is MSVC or Intel on Windows
174 /// _WIN32 Building on Windows (any)
175 /// _WIN64 Building on Windows 64 bit
177 std::string compiler = "\nCompiled by ";
180 compiler += "clang++ ";
181 compiler += make_version_string(__clang_major__, __clang_minor__, __clang_patchlevel__);
182 #elif __INTEL_COMPILER
183 compiler += "Intel compiler ";
184 compiler += "(version ";
185 compiler += stringify(__INTEL_COMPILER) " update " stringify(__INTEL_COMPILER_UPDATE);
189 compiler += "(version ";
190 compiler += stringify(_MSC_FULL_VER) "." stringify(_MSC_BUILD);
193 compiler += "g++ (GNUC) ";
194 compiler += make_version_string(__GNUC__, __GNUC_MINOR__, __GNUC_PATCHLEVEL__);
196 compiler += "Unknown compiler ";
197 compiler += "(unknown version)";
200 #if defined(__APPLE__)
201 compiler += " on Apple";
202 #elif defined(__CYGWIN__)
203 compiler += " on Cygwin";
204 #elif defined(__MINGW64__)
205 compiler += " on MinGW64";
206 #elif defined(__MINGW32__)
207 compiler += " on MinGW32";
208 #elif defined(__ANDROID__)
209 compiler += " on Android";
210 #elif defined(__linux__)
211 compiler += " on Linux";
212 #elif defined(_WIN64)
213 compiler += " on Microsoft Windows 64-bit";
214 #elif defined(_WIN32)
215 compiler += " on Microsoft Windows 32-bit";
217 compiler += " on unknown system";
220 compiler += "\nCompilation settings include: ";
221 compiler += (Is64Bit ? " 64bit" : " 32bit");
222 #if defined(USE_VNNI)
225 #if defined(USE_AVX512)
226 compiler += " AVX512";
228 compiler += (HasPext ? " BMI2" : "");
229 #if defined(USE_AVX2)
232 #if defined(USE_SSE41)
233 compiler += " SSE41";
235 #if defined(USE_SSSE3)
236 compiler += " SSSE3";
238 #if defined(USE_SSE2)
241 compiler += (HasPopCnt ? " POPCNT" : "");
247 compiler += " DEBUG";
250 compiler += "\n__VERSION__ macro expands to: ";
252 compiler += __VERSION__;
254 compiler += "(undefined macro)";
262 /// Debug functions used mainly to collect run-time statistics
263 static std::atomic<int64_t> hits[2], means[2];
265 void dbg_hit_on(bool b) { ++hits[0]; if (b) ++hits[1]; }
266 void dbg_hit_on(bool c, bool b) { if (c) dbg_hit_on(b); }
267 void dbg_mean_of(int v) { ++means[0]; means[1] += v; }
272 cerr << "Total " << hits[0] << " Hits " << hits[1]
273 << " hit rate (%) " << 100 * hits[1] / hits[0] << endl;
276 cerr << "Total " << means[0] << " Mean "
277 << (double)means[1] / means[0] << endl;
281 /// Used to serialize access to std::cout to avoid multiple threads writing at
284 std::ostream& operator<<(std::ostream& os, SyncCout sc) {
298 /// Trampoline helper to avoid moving Logger to misc.h
299 void start_logger(const std::string& fname) { Logger::start(fname); }
302 /// prefetch() preloads the given address in L1/L2 cache. This is a non-blocking
303 /// function that doesn't stall the CPU waiting for data to be loaded from memory,
304 /// which can be quite slow.
307 void prefetch(void*) {}
311 void prefetch(void* addr) {
313 # if defined(__INTEL_COMPILER)
314 // This hack prevents prefetches from being optimized away by
315 // Intel compiler. Both MSVC and gcc seem not be affected by this.
319 # if defined(__INTEL_COMPILER) || defined(_MSC_VER)
320 _mm_prefetch((char*)addr, _MM_HINT_T0);
322 __builtin_prefetch(addr);
328 /// Wrappers for systems where the c++17 implementation doesn't guarantee the availability of aligned_alloc.
329 /// Memory allocated with std_aligned_alloc must be freed with std_aligned_free.
332 void* std_aligned_alloc(size_t alignment, size_t size) {
333 #if defined(POSIXALIGNEDALLOC)
335 if(posix_memalign(&pointer, alignment, size) == 0)
338 #elif defined(_WIN32)
339 return _mm_malloc(size, alignment);
341 return std::aligned_alloc(alignment, size);
345 void std_aligned_free(void* ptr) {
346 #if defined(POSIXALIGNEDALLOC)
348 #elif defined(_WIN32)
355 /// aligned_ttmem_alloc() will return suitably aligned memory, and if possible use large pages.
356 /// The returned pointer is the aligned one, while the mem argument is the one that needs
357 /// to be passed to free. With c++17 some of this functionality could be simplified.
359 #if defined(__linux__) && !defined(__ANDROID__)
361 void* aligned_ttmem_alloc(size_t allocSize, void*& mem) {
363 constexpr size_t alignment = 2 * 1024 * 1024; // assumed 2MB page sizes
364 size_t size = ((allocSize + alignment - 1) / alignment) * alignment; // multiple of alignment
365 if (posix_memalign(&mem, alignment, size))
367 madvise(mem, allocSize, MADV_HUGEPAGE);
371 #elif defined(_WIN64)
373 static void* aligned_ttmem_alloc_large_pages(size_t allocSize) {
375 HANDLE hProcessToken { };
379 const size_t largePageSize = GetLargePageMinimum();
383 // We need SeLockMemoryPrivilege, so try to enable it for the process
384 if (!OpenProcessToken(GetCurrentProcess(), TOKEN_ADJUST_PRIVILEGES | TOKEN_QUERY, &hProcessToken))
387 if (LookupPrivilegeValue(NULL, SE_LOCK_MEMORY_NAME, &luid))
389 TOKEN_PRIVILEGES tp { };
390 TOKEN_PRIVILEGES prevTp { };
393 tp.PrivilegeCount = 1;
394 tp.Privileges[0].Luid = luid;
395 tp.Privileges[0].Attributes = SE_PRIVILEGE_ENABLED;
397 // Try to enable SeLockMemoryPrivilege. Note that even if AdjustTokenPrivileges() succeeds,
398 // we still need to query GetLastError() to ensure that the privileges were actually obtained.
399 if (AdjustTokenPrivileges(
400 hProcessToken, FALSE, &tp, sizeof(TOKEN_PRIVILEGES), &prevTp, &prevTpLen) &&
401 GetLastError() == ERROR_SUCCESS)
403 // Round up size to full pages and allocate
404 allocSize = (allocSize + largePageSize - 1) & ~size_t(largePageSize - 1);
406 NULL, allocSize, MEM_RESERVE | MEM_COMMIT | MEM_LARGE_PAGES, PAGE_READWRITE);
408 // Privilege no longer needed, restore previous state
409 AdjustTokenPrivileges(hProcessToken, FALSE, &prevTp, 0, NULL, NULL);
413 CloseHandle(hProcessToken);
418 void* aligned_ttmem_alloc(size_t allocSize, void*& mem) {
420 static bool firstCall = true;
422 // Try to allocate large pages
423 mem = aligned_ttmem_alloc_large_pages(allocSize);
425 // Suppress info strings on the first call. The first call occurs before 'uci'
426 // is received and in that case this output confuses some GUIs.
430 sync_cout << "info string Hash table allocation: Windows large pages used." << sync_endl;
432 sync_cout << "info string Hash table allocation: Windows large pages not used." << sync_endl;
436 // Fall back to regular, page aligned, allocation if necessary
438 mem = VirtualAlloc(NULL, allocSize, MEM_RESERVE | MEM_COMMIT, PAGE_READWRITE);
445 void* aligned_ttmem_alloc(size_t allocSize, void*& mem) {
447 constexpr size_t alignment = 64; // assumed cache line size
448 size_t size = allocSize + alignment - 1; // allocate some extra space
450 void* ret = reinterpret_cast<void*>((uintptr_t(mem) + alignment - 1) & ~uintptr_t(alignment - 1));
457 /// aligned_ttmem_free() will free the previously allocated ttmem
461 void aligned_ttmem_free(void* mem) {
463 if (mem && !VirtualFree(mem, 0, MEM_RELEASE))
465 DWORD err = GetLastError();
466 std::cerr << "Failed to free transposition table. Error code: 0x" <<
467 std::hex << err << std::dec << std::endl;
474 void aligned_ttmem_free(void *mem) {
481 namespace WinProcGroup {
485 void bindThisThread(size_t) {}
489 /// best_group() retrieves logical processor information using Windows specific
490 /// API and returns the best group id for the thread with index idx. Original
491 /// code from Texel by Peter Ă–sterlund.
493 int best_group(size_t idx) {
498 DWORD returnLength = 0;
499 DWORD byteOffset = 0;
501 // Early exit if the needed API is not available at runtime
502 HMODULE k32 = GetModuleHandle("Kernel32.dll");
503 auto fun1 = (fun1_t)(void(*)())GetProcAddress(k32, "GetLogicalProcessorInformationEx");
507 // First call to get returnLength. We expect it to fail due to null buffer
508 if (fun1(RelationAll, nullptr, &returnLength))
511 // Once we know returnLength, allocate the buffer
512 SYSTEM_LOGICAL_PROCESSOR_INFORMATION_EX *buffer, *ptr;
513 ptr = buffer = (SYSTEM_LOGICAL_PROCESSOR_INFORMATION_EX*)malloc(returnLength);
515 // Second call, now we expect to succeed
516 if (!fun1(RelationAll, buffer, &returnLength))
522 while (byteOffset < returnLength)
524 if (ptr->Relationship == RelationNumaNode)
527 else if (ptr->Relationship == RelationProcessorCore)
530 threads += (ptr->Processor.Flags == LTP_PC_SMT) ? 2 : 1;
534 byteOffset += ptr->Size;
535 ptr = (SYSTEM_LOGICAL_PROCESSOR_INFORMATION_EX*)(((char*)ptr) + ptr->Size);
540 std::vector<int> groups;
542 // Run as many threads as possible on the same node until core limit is
543 // reached, then move on filling the next node.
544 for (int n = 0; n < nodes; n++)
545 for (int i = 0; i < cores / nodes; i++)
548 // In case a core has more than one logical processor (we assume 2) and we
549 // have still threads to allocate, then spread them evenly across available
551 for (int t = 0; t < threads - cores; t++)
552 groups.push_back(t % nodes);
554 // If we still have more threads than the total number of logical processors
555 // then return -1 and let the OS to decide what to do.
556 return idx < groups.size() ? groups[idx] : -1;
560 /// bindThisThread() set the group affinity of the current thread
562 void bindThisThread(size_t idx) {
564 // Use only local variables to be thread-safe
565 int group = best_group(idx);
570 // Early exit if the needed API are not available at runtime
571 HMODULE k32 = GetModuleHandle("Kernel32.dll");
572 auto fun2 = (fun2_t)(void(*)())GetProcAddress(k32, "GetNumaNodeProcessorMaskEx");
573 auto fun3 = (fun3_t)(void(*)())GetProcAddress(k32, "SetThreadGroupAffinity");
578 GROUP_AFFINITY affinity;
579 if (fun2(group, &affinity))
580 fun3(GetCurrentThread(), &affinity, nullptr);
585 } // namespace WinProcGroup