X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fthread.cpp;h=97beb58009eb2feb855e9b725c0290606581e92f;hp=eb360869b53380510513ff134938f0ba515e5cb8;hb=1b6459195c82395d861cddf3f2056ed1c9a3bd5b;hpb=043a469f83b4c81f94ab991029b4cd49fb05452e diff --git a/src/thread.cpp b/src/thread.cpp index eb360869..97beb580 100644 --- a/src/thread.cpp +++ b/src/thread.cpp @@ -2,7 +2,7 @@ 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 - Copyright (C) 2015-2017 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad + Copyright (C) 2015-2018 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 @@ -24,6 +24,7 @@ #include "movegen.h" #include "search.h" #include "thread.h" +#include "uci.h" #include "syzygy/tbprobe.h" ThreadPool Threads; // Global object @@ -35,7 +36,6 @@ ThreadPool Threads; // Global object Thread::Thread(size_t n) : idx(n), stdThread(&Thread::idle_loop, this) { wait_for_search_finished(); - clear(); // Zero-init histories (based on std::array) } @@ -58,6 +58,7 @@ void Thread::clear() { counterMoves.fill(MOVE_NONE); mainHistory.fill(0); + captureHistory.fill(0); for (auto& to : contHistory) for (auto& h : to) @@ -91,7 +92,13 @@ void Thread::wait_for_search_finished() { void Thread::idle_loop() { - WinProcGroup::bindThisThread(idx); + // If OS already scheduled us on a different group than 0 then don't overwrite + // the choice, eventually we are one of many one-threaded processes running on + // some Windows NUMA hardware, for instance in fishtest. To make it simple, + // just check if running threads are below a threshold, in this case all this + // NUMA machinery is not needed. + if (Options["Threads"] >= 8) + WinProcGroup::bindThisThread(idx); while (true) { @@ -109,42 +116,40 @@ void Thread::idle_loop() { } } +/// ThreadPool::set() creates/destroys threads to match the requested number. +/// Created and launced threads wil go immediately to sleep in idle_loop. +/// Upon resizing, threads are recreated to allow for binding if necessary. -/// ThreadPool::init() creates and launches the threads that will go -/// immediately to sleep in idle_loop. We cannot use the constructor because -/// Threads is a static object and we need a fully initialized engine at -/// this point due to allocation of Endgames in the Thread constructor. - -void ThreadPool::init(size_t requested) { - - push_back(new MainThread(0)); - set(requested); -} +void ThreadPool::set(size_t requested) { + if (size() > 0) { // destroy any existing thread(s) + main()->wait_for_search_finished(); -/// ThreadPool::exit() terminates threads before the program exits. Cannot be -/// done in the destructor because threads must be terminated before deleting -/// any static object, so before main() returns. + while (size() > 0) + delete back(), pop_back(); + } -void ThreadPool::exit() { + if (requested > 0) { // create new thread(s) + push_back(new MainThread(0)); - main()->wait_for_search_finished(); - set(0); + while (size() < requested) + push_back(new Thread(size())); + clear(); + } } +/// ThreadPool::clear() sets threadPool data to initial values. -/// ThreadPool::set() creates/destroys threads to match the requested number +void ThreadPool::clear() { -void ThreadPool::set(size_t requested) { + for (Thread* th : *this) + th->clear(); - while (size() < requested) - push_back(new Thread(size())); - - while (size() > requested) - delete back(), pop_back(); + main()->callsCnt = 0; + main()->previousScore = VALUE_INFINITE; + main()->previousTimeReduction = 1; } - /// ThreadPool::start_thinking() wakes up main thread waiting in idle_loop() and /// returns immediately. Main thread will wake up other threads and start the search. @@ -180,9 +185,9 @@ void ThreadPool::start_thinking(Position& pos, StateListPtr& states, // is shared by threads but is accessed in read-only mode. StateInfo tmp = setupStates->back(); - for (Thread* th : Threads) + for (Thread* th : *this) { - th->nodes = th->tbHits = 0; + th->nodes = th->tbHits = th->nmp_ply = th->nmp_odd = 0; th->rootDepth = th->completedDepth = DEPTH_ZERO; th->rootMoves = rootMoves; th->rootPos.set(pos.fen(), pos.is_chess960(), &setupStates->back(), th);