To align to C++ std::thread conventions.
No functional change.
&& !sp->slavesMask)
{
assert(!sp->master->is_searching);
&& !sp->slavesMask)
{
assert(!sp->master->is_searching);
+ sp->master->notify_one();
}
// After releasing the lock we cannot access anymore any SplitPoint
}
// After releasing the lock we cannot access anymore any SplitPoint
assert(do_sleep);
do_exit = true; // Search must be already finished
assert(do_sleep);
do_exit = true; // Search must be already finished
thread_join(handle); // Wait for thread termination
}
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();
mutex.lock();
sleepCondition.notify_one();
threads[i]->do_sleep = false;
if (!useSleepingThreads)
threads[i]->do_sleep = false;
if (!useSleepingThreads)
+ threads[i]->notify_one();
+// 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
// 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]->is_searching = true; // Slave leaves idle_loop()
if (useSleepingThreads)
+ threads[i]->notify_one();
if (++slavesCnt + 1 >= maxThreadsPerSplitPoint) // Master is always included
break;
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);
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.
// wait_for_search_finished() waits for main thread to go to sleep, this means
// search is finished. Then returns.
RootMoves.push_back(RootMove(ml.move()));
main_thread()->do_sleep = false;
RootMoves.push_back(RootMove(ml.move()));
main_thread()->do_sleep = false;
- main_thread()->wake_up();
+ main_thread()->notify_one();
Thread(Fn fn);
~Thread();
Thread(Fn fn);
~Thread();
bool cutoff_occurred() const;
bool is_available_to(Thread* master) const;
void idle_loop();
bool cutoff_occurred() const;
bool is_available_to(Thread* master) const;
void idle_loop();
if (token != "ponderhit" || Search::Signals.stopOnPonderhit)
{
Search::Signals.stop = true;
if (token != "ponderhit" || Search::Signals.stopOnPonderhit)
{
Search::Signals.stop = true;
- Threads.main_thread()->wake_up(); // Could be sleeping
+ Threads.main_thread()->notify_one(); // Could be sleeping
}
else
Search::Limits.ponder = false;
}
else
Search::Limits.ponder = false;