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-2017 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
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.
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.
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/>.
21 #include <algorithm> // For std::count
27 #include "syzygy/tbprobe.h"
29 ThreadPool Threads; // Global object
32 /// Thread constructor launches the thread and waits until it goes to sleep
33 /// in idle_loop(). Note that 'searching' and 'exit' should be alredy set.
35 Thread::Thread(size_t n) : idx(n), stdThread(&Thread::idle_loop, this) {
37 wait_for_search_finished();
38 clear(); // Zero-init histories (based on std::array)
42 /// Thread destructor wakes up the thread in idle_loop() and waits
43 /// for its termination. Thread should be already waiting.
55 /// Thread::clear() reset histories, usually before a new game
57 void Thread::clear() {
59 counterMoves.fill(MOVE_NONE);
61 captureHistory.fill(0);
63 for (auto& to : contHistory)
67 contHistory[NO_PIECE][0].fill(Search::CounterMovePruneThreshold - 1);
70 /// Thread::start_searching() wakes up the thread that will start the search
72 void Thread::start_searching() {
74 std::lock_guard<Mutex> lk(mutex);
76 cv.notify_one(); // Wake up the thread in idle_loop()
80 /// Thread::wait_for_search_finished() blocks on the condition variable
81 /// until the thread has finished searching.
83 void Thread::wait_for_search_finished() {
85 std::unique_lock<Mutex> lk(mutex);
86 cv.wait(lk, [&]{ return !searching; });
90 /// Thread::idle_loop() is where the thread is parked, blocked on the
91 /// condition variable, when it has no work to do.
93 void Thread::idle_loop() {
95 WinProcGroup::bindThisThread(idx);
99 std::unique_lock<Mutex> lk(mutex);
101 cv.notify_one(); // Wake up anyone waiting for search finished
102 cv.wait(lk, [&]{ return searching; });
114 /// ThreadPool::init() creates and launches the threads that will go
115 /// immediately to sleep in idle_loop. We cannot use the constructor because
116 /// Threads is a static object and we need a fully initialized engine at
117 /// this point due to allocation of Endgames in the Thread constructor.
119 void ThreadPool::init(size_t requested) {
121 push_back(new MainThread(0));
126 /// ThreadPool::exit() terminates threads before the program exits. Cannot be
127 /// done in the destructor because threads must be terminated before deleting
128 /// any static object, so before main() returns.
130 void ThreadPool::exit() {
132 main()->wait_for_search_finished();
137 /// ThreadPool::set() creates/destroys threads to match the requested number
139 void ThreadPool::set(size_t requested) {
141 while (size() < requested)
142 push_back(new Thread(size()));
144 while (size() > requested)
145 delete back(), pop_back();
149 /// ThreadPool::start_thinking() wakes up main thread waiting in idle_loop() and
150 /// returns immediately. Main thread will wake up other threads and start the search.
152 void ThreadPool::start_thinking(Position& pos, StateListPtr& states,
153 const Search::LimitsType& limits, bool ponderMode) {
155 main()->wait_for_search_finished();
157 stopOnPonderhit = stop = false;
159 Search::Limits = limits;
160 Search::RootMoves rootMoves;
162 for (const auto& m : MoveList<LEGAL>(pos))
163 if ( limits.searchmoves.empty()
164 || std::count(limits.searchmoves.begin(), limits.searchmoves.end(), m))
165 rootMoves.emplace_back(m);
167 if (!rootMoves.empty())
168 Tablebases::filter_root_moves(pos, rootMoves);
170 // After ownership transfer 'states' becomes empty, so if we stop the search
171 // and call 'go' again without setting a new position states.get() == NULL.
172 assert(states.get() || setupStates.get());
175 setupStates = std::move(states); // Ownership transfer, states is now empty
177 // We use Position::set() to set root position across threads. But there are
178 // some StateInfo fields (previous, pliesFromNull, capturedPiece) that cannot
179 // be deduced from a fen string, so set() clears them and to not lose the info
180 // we need to backup and later restore setupStates->back(). Note that setupStates
181 // is shared by threads but is accessed in read-only mode.
182 StateInfo tmp = setupStates->back();
184 for (Thread* th : Threads)
186 th->nodes = th->tbHits = 0;
187 th->rootDepth = th->completedDepth = DEPTH_ZERO;
188 th->rootMoves = rootMoves;
189 th->rootPos.set(pos.fen(), pos.is_chess960(), &setupStates->back(), th);
192 setupStates->back() = tmp;
194 main()->start_searching();