void ThreadBase::notify_one() {
- std::unique_lock<std::mutex>(this->mutex);
+ std::unique_lock<Mutex>(this->mutex);
sleepCondition.notify_one();
}
void ThreadBase::wait_for(volatile const bool& condition) {
- std::unique_lock<std::mutex> lk(mutex);
+ std::unique_lock<Mutex> lk(mutex);
sleepCondition.wait(lk, [&]{ return condition; });
}
// Try to allocate available threads and ask them to start searching setting
// 'searching' flag. This must be done under lock protection to avoid concurrent
// allocation of the same slave by another master.
- Threads.spinlock.acquire();
- sp.spinlock.acquire();
+ Threads.mutex.lock();
+ sp.mutex.lock();
sp.allSlavesSearching = true; // Must be set under lock protection
++splitPointsSize;
// it will instantly launch a search, because its 'searching' flag is set.
// The thread will return from the idle loop when all slaves have finished
// their work at this split point.
- sp.spinlock.release();
- Threads.spinlock.release();
+ sp.mutex.unlock();
+ Threads.mutex.unlock();
Thread::idle_loop(); // Force a call to base class idle_loop()
// We have returned from the idle loop, which means that all threads are
// finished. Note that setting 'searching' and decreasing splitPointsSize must
// be done under lock protection to avoid a race with Thread::available_to().
- Threads.spinlock.acquire();
- sp.spinlock.acquire();
+ Threads.mutex.lock();
+ sp.mutex.lock();
searching = true;
--splitPointsSize;
*bestMove = sp.bestMove;
*bestValue = sp.bestValue;
- sp.spinlock.release();
- Threads.spinlock.release();
+ sp.mutex.unlock();
+ Threads.mutex.unlock();
}
while (!exit)
{
- std::unique_lock<std::mutex> lk(mutex);
+ std::unique_lock<Mutex> lk(mutex);
if (!exit)
sleepCondition.wait_for(lk, std::chrono::milliseconds(run ? Resolution : INT_MAX));
while (!exit)
{
- std::unique_lock<std::mutex> lk(mutex);
+ std::unique_lock<Mutex> lk(mutex);
thinking = false;
void ThreadPool::wait_for_think_finished() {
- std::unique_lock<std::mutex> lk(main()->mutex);
+ std::unique_lock<Mutex> lk(main()->mutex);
sleepCondition.wait(lk, [&]{ return !main()->thinking; });
}