X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;ds=inline;f=src%2Fthread.cpp;h=2c40ef6f8c14ecc7ccc218a01d06dada354d8874;hb=24b25b4827df4b3629d46ef019f4fea645d6dc91;hp=e1c1f8a941dba8b7b8c40f42748885ee9ef30fa8;hpb=4e59c5c2746741e7aedd451ea16b792d1568e5c4;p=stockfish
diff --git a/src/thread.cpp b/src/thread.cpp
index e1c1f8a9..2c40ef6f 100644
--- a/src/thread.cpp
+++ b/src/thread.cpp
@@ -1,7 +1,7 @@
/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
+ Copyright (C) 2008-2012 Marco Costalba, Joona Kiiski, 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
@@ -17,8 +17,10 @@
along with this program. If not, see .
*/
+#include
#include
+#include "movegen.h"
#include "search.h"
#include "thread.h"
#include "ucioption.h"
@@ -62,9 +64,9 @@ namespace { extern "C" {
void Thread::wake_up() {
- lock_grab(&sleepLock);
- cond_signal(&sleepCond);
- lock_release(&sleepLock);
+ lock_grab(sleepLock);
+ cond_signal(sleepCond);
+ lock_release(sleepLock);
}
@@ -112,11 +114,11 @@ bool Thread::is_available_to(int master) const {
void ThreadsManager::read_uci_options() {
- maxThreadsPerSplitPoint = Options["Maximum Number of Threads per Split Point"].value();
- minimumSplitDepth = Options["Minimum Split Depth"].value() * ONE_PLY;
- useSleepingThreads = Options["Use Sleeping Threads"].value();
+ maxThreadsPerSplitPoint = Options["Max Threads per Split Point"];
+ minimumSplitDepth = Options["Min Split Depth"] * ONE_PLY;
+ useSleepingThreads = Options["Use Sleeping Threads"];
- set_size(Options["Threads"].value());
+ set_size(Options["Threads"]);
}
@@ -151,17 +153,17 @@ void ThreadsManager::set_size(int cnt) {
void ThreadsManager::init() {
// Initialize sleep condition and lock used by thread manager
- cond_init(&sleepCond);
- lock_init(&threadsLock);
+ cond_init(sleepCond);
+ lock_init(threadsLock);
// Initialize thread's sleep conditions and split point locks
for (int i = 0; i <= MAX_THREADS; i++)
{
- lock_init(&threads[i].sleepLock);
- cond_init(&threads[i].sleepCond);
+ lock_init(threads[i].sleepLock);
+ cond_init(threads[i].sleepCond);
for (int j = 0; j < MAX_ACTIVE_SPLIT_POINTS; j++)
- lock_init(&(threads[i].splitPoints[j].lock));
+ lock_init(threads[i].splitPoints[j].lock);
}
// Allocate main thread tables to call evaluate() also when not searching
@@ -172,15 +174,10 @@ void ThreadsManager::init() {
for (int i = 0; i <= MAX_THREADS; i++)
{
threads[i].is_searching = false;
- threads[i].do_sleep = true;
+ threads[i].do_sleep = (i != 0); // Avoid a race with start_thinking()
threads[i].threadID = i;
-#if defined(_MSC_VER)
- threads[i].handle = CreateThread(NULL, 0, start_routine, (LPVOID)&threads[i], 0, NULL);
- bool ok = (threads[i].handle != NULL);
-#else
- bool ok = !pthread_create(&threads[i].handle, NULL, start_routine, (void*)&threads[i]);
-#endif
+ bool ok = thread_create(threads[i].handle, start_routine, threads[i]);
if (!ok)
{
@@ -197,27 +194,21 @@ void ThreadsManager::exit() {
for (int i = 0; i <= MAX_THREADS; i++)
{
- threads[i].do_terminate = true;
+ threads[i].do_terminate = true; // Search must be already finished
threads[i].wake_up();
- // Wait for thread termination
-#if defined(_MSC_VER)
- WaitForSingleObject(threads[i].handle, 0);
- CloseHandle(threads[i].handle);
-#else
- pthread_join(threads[i].handle, NULL);
-#endif
+ thread_join(threads[i].handle); // Wait for thread termination
// Now we can safely destroy associated locks and wait conditions
- lock_destroy(&threads[i].sleepLock);
- cond_destroy(&threads[i].sleepCond);
+ lock_destroy(threads[i].sleepLock);
+ cond_destroy(threads[i].sleepCond);
for (int j = 0; j < MAX_ACTIVE_SPLIT_POINTS; j++)
- lock_destroy(&(threads[i].splitPoints[j].lock));
+ lock_destroy(threads[i].splitPoints[j].lock);
}
- lock_destroy(&threadsLock);
- cond_destroy(&sleepCond);
+ lock_destroy(threadsLock);
+ cond_destroy(sleepCond);
}
@@ -308,7 +299,7 @@ Value ThreadsManager::split(Position& pos, Stack* ss, Value alpha, Value beta,
// Try to allocate available threads and ask them to start searching setting
// is_searching flag. This must be done under lock protection to avoid concurrent
// allocation of the same slave by another master.
- lock_grab(&threadsLock);
+ lock_grab(threadsLock);
for (i = 0; !Fake && i < activeThreads && workersCnt < maxThreadsPerSplitPoint; i++)
if (threads[i].is_available_to(master))
@@ -324,7 +315,7 @@ Value ThreadsManager::split(Position& pos, Stack* ss, Value alpha, Value beta,
threads[i].wake_up();
}
- lock_release(&threadsLock);
+ lock_release(threadsLock);
// We failed to allocate even one slave, return
if (!Fake && workersCnt == 1)
@@ -347,12 +338,12 @@ Value ThreadsManager::split(Position& pos, Stack* ss, Value alpha, Value beta,
// We have returned from the idle loop, which means that all threads are
// finished. Note that changing state and decreasing activeSplitPoints is done
// under lock protection to avoid a race with Thread::is_available_to().
- lock_grab(&threadsLock);
+ lock_grab(threadsLock);
masterThread.is_searching = true;
masterThread.activeSplitPoints--;
- lock_release(&threadsLock);
+ lock_release(threadsLock);
masterThread.splitPoint = sp->parent;
pos.set_nodes_searched(pos.nodes_searched() + sp->nodes);
@@ -367,16 +358,16 @@ template Value ThreadsManager::split(Position&, Stack*, Value, Value, Valu
// Thread::timer_loop() is where the timer thread waits maxPly milliseconds and
// then calls do_timer_event(). If maxPly is 0 thread sleeps until is woken up.
-extern void do_timer_event();
+extern void check_time();
void Thread::timer_loop() {
while (!do_terminate)
{
- lock_grab(&sleepLock);
- timed_wait(&sleepCond, &sleepLock, maxPly ? maxPly : INT_MAX);
- lock_release(&sleepLock);
- do_timer_event();
+ lock_grab(sleepLock);
+ timed_wait(sleepCond, sleepLock, maxPly ? maxPly : INT_MAX);
+ lock_release(sleepLock);
+ check_time();
}
}
@@ -388,10 +379,10 @@ void ThreadsManager::set_timer(int msec) {
Thread& timer = threads[MAX_THREADS];
- lock_grab(&timer.sleepLock);
+ lock_grab(timer.sleepLock);
timer.maxPly = msec;
- cond_signal(&timer.sleepCond); // Wake up and restart the timer
- lock_release(&timer.sleepLock);
+ cond_signal(timer.sleepCond); // Wake up and restart the timer
+ lock_release(timer.sleepLock);
}
@@ -402,25 +393,25 @@ void Thread::main_loop() {
while (true)
{
- lock_grab(&sleepLock);
+ lock_grab(sleepLock);
do_sleep = true; // Always return to sleep after a search
is_searching = false;
while (do_sleep && !do_terminate)
{
- cond_signal(&Threads.sleepCond); // Wake up UI thread if needed
- cond_wait(&sleepCond, &sleepLock);
+ cond_signal(Threads.sleepCond); // Wake up UI thread if needed
+ cond_wait(sleepCond, sleepLock);
}
is_searching = true;
- lock_release(&sleepLock);
+ lock_release(sleepLock);
if (do_terminate)
return;
- think(); // This is the search entry point
+ Search::think();
}
}
@@ -431,30 +422,59 @@ void Thread::main_loop() {
// the search to finish.
void ThreadsManager::start_thinking(const Position& pos, const LimitsType& limits,
- const std::vector& searchMoves, bool asyncMode) {
+ const std::set& searchMoves, bool async) {
Thread& main = threads[0];
- lock_grab(&main.sleepLock);
+ lock_grab(main.sleepLock);
// Wait main thread has finished before to launch a new search
while (!main.do_sleep)
- cond_wait(&sleepCond, &main.sleepLock);
+ cond_wait(sleepCond, main.sleepLock);
// Copy input arguments to initialize the search
RootPosition.copy(pos, 0);
Limits = limits;
- SearchMoves = searchMoves;
+ RootMoves.clear();
+
+ // Populate RootMoves with all the legal moves (default) or, if a searchMoves
+ // set is given, with the subset of legal moves to search.
+ for (MoveList ml(pos); !ml.end(); ++ml)
+ if (searchMoves.empty() || searchMoves.count(ml.move()))
+ RootMoves.push_back(RootMove(ml.move()));
// Reset signals before to start the new search
- memset((void*)&Signals, 0, sizeof(Signals));
+ Signals.stopOnPonderhit = Signals.firstRootMove = false;
+ Signals.stop = Signals.failedLowAtRoot = false;
main.do_sleep = false;
- cond_signal(&main.sleepCond); // Wake up main thread and start searching
+ cond_signal(main.sleepCond); // Wake up main thread and start searching
+
+ if (!async)
+ while (!main.do_sleep)
+ cond_wait(sleepCond, main.sleepLock);
+
+ lock_release(main.sleepLock);
+}
- if (!asyncMode)
- cond_wait(&sleepCond, &main.sleepLock);
- lock_release(&main.sleepLock);
+// ThreadsManager::stop_thinking() is used by UI thread to raise a stop request
+// and to wait for the main thread finishing the search. Needed to wait exiting
+// and terminate the threads after a 'quit' command.
+
+void ThreadsManager::stop_thinking() {
+
+ Thread& main = threads[0];
+
+ Search::Signals.stop = true;
+
+ lock_grab(main.sleepLock);
+
+ cond_signal(main.sleepCond); // In case is waiting for stop or ponderhit
+
+ while (!main.do_sleep)
+ cond_wait(sleepCond, main.sleepLock);
+
+ lock_release(main.sleepLock);
}
@@ -471,10 +491,10 @@ void ThreadsManager::wait_for_stop_or_ponderhit() {
Thread& main = threads[0];
- lock_grab(&main.sleepLock);
+ lock_grab(main.sleepLock);
while (!Signals.stop)
- cond_wait(&main.sleepCond, &main.sleepLock);
+ cond_wait(main.sleepCond, main.sleepLock);
- lock_release(&main.sleepLock);
+ lock_release(main.sleepLock);
}