curSplitPoint = NULL;
start_fn = fn;
idx = Threads.size();
-
- do_sleep = (fn != &Thread::main_loop); // Avoid a race with start_searching()
+ do_sleep = true;
if (!thread_create(handle, start_routine, this))
{
assert(do_sleep);
do_exit = true; // Search must be already finished
- wake_up();
+ notify_one();
thread_join(handle); // Wait for thread termination
}
}
-// Thread::wake_up() wakes up the thread, normally at the beginning of the search
-// or, if "sleeping threads" is used at split time.
+// Thread::notify_one() wakes up the thread, normally at the beginning of the
+// search or, if "sleeping threads" is used at split time.
-void Thread::wake_up() {
+void Thread::notify_one() {
mutex.lock();
sleepCondition.notify_one();
}
-// Thread::wait_for_stop_or_ponderhit() is called when the maximum depth is
-// reached while the program is pondering. The point is to work around a wrinkle
-// in the UCI protocol: When pondering, the engine is not allowed to give a
-// "bestmove" before the GUI sends it a "stop" or "ponderhit" command. We simply
-// wait here until one of these commands (that raise StopRequest) is sent and
-// then return, after which the bestmove and pondermove will be printed.
-
-void Thread::wait_for_stop_or_ponderhit() {
+// Thread::wait_for() set the thread to sleep until condition 'b' turns true
- Signals.stopOnPonderhit = true;
+void Thread::wait_for(volatile const bool& b) {
mutex.lock();
- while (!Signals.stop) sleepCondition.wait(mutex);
+ while (!b) sleepCondition.wait(mutex);
mutex.unlock();
}
}
-// wake_up() is called before a new search to start the threads that are waiting
-// on the sleep condition and to reset maxPly. When useSleepingThreads is set
-// threads will be woken up at split time.
-
-void ThreadPool::wake_up() const {
-
- for (size_t i = 0; i < threads.size(); i++)
- {
- threads[i]->maxPly = 0;
- threads[i]->do_sleep = false;
-
- if (!useSleepingThreads)
- threads[i]->wake_up();
- }
-}
-
-
-// sleep() is called after the search finishes to ask all the threads but the
-// main one to go waiting on a sleep condition.
-
-void ThreadPool::sleep() const {
-
- // Main thread will go to sleep by itself to avoid a race with start_searching()
- for (size_t i = 1; i < threads.size(); i++)
- threads[i]->do_sleep = true;
-}
-
-
// available_slave_exists() tries to find an idle thread which is available as
// a slave for the thread 'master'.
}
+// set_timer() is used to set the timer to trigger after msec milliseconds.
+// If msec is 0 then timer is stopped.
+
+void ThreadPool::set_timer(int msec) {
+
+ timer->maxPly = msec;
+ timer->notify_one(); // Wake up and restart the timer
+}
+
+
// split() does the actual work of distributing the work at a node between
// several available threads. If it does not succeed in splitting the node
// (because no idle threads are available, or because we have no unused split
threads[i]->is_searching = true; // Slave leaves idle_loop()
if (useSleepingThreads)
- threads[i]->wake_up();
+ threads[i]->notify_one();
if (++slavesCnt + 1 >= maxThreadsPerSplitPoint) // Master is always included
break;
template Value ThreadPool::split<true>(Position&, Stack*, Value, Value, Value, Move*, Depth, Move, int, MovePicker&, int);
-// set_timer() is used to set the timer to trigger after msec milliseconds.
-// If msec is 0 then timer is stopped.
-
-void ThreadPool::set_timer(int msec) {
-
- timer->mutex.lock();
- timer->maxPly = msec;
- timer->sleepCondition.notify_one(); // Wake up and restart the timer
- timer->mutex.unlock();
-}
-
-
// wait_for_search_finished() waits for main thread to go to sleep, this means
// search is finished. Then returns.
Thread* t = main_thread();
t->mutex.lock();
- t->sleepCondition.notify_one(); // In case is waiting for stop or ponderhit
while (!t->do_sleep) sleepCondition.wait(t->mutex);
t->mutex.unlock();
}
RootMoves.push_back(RootMove(ml.move()));
main_thread()->do_sleep = false;
- main_thread()->wake_up();
+ main_thread()->notify_one();
}