sp.mutex.unlock();
Threads.mutex.unlock();
- // Calling idle_loop with sp.mutex locked
Thread::idle_loop(); // Force a call to base class idle_loop()
// In helpful master concept a master can help only a sub-tree of its split
// We have returned from the idle loop, which means that all threads are
// finished. Note that setting 'searching' and decreasing splitPointsSize is
// done under lock protection to avoid a race with Thread::is_available_to().
- // idle_loop returns with sp.mutex locked but we must unlock it inorder to
- // lock Threads.mutex without conflicting with check_time() (threads holding
- // multiple locks must always acquired them in the same order to avoid deadlocks)
- sp.mutex.unlock();
Threads.mutex.lock();
sp.mutex.lock();
}
// start_thinking() wakes up the main thread sleeping in MainThread::idle_loop()
// so to start a new search, then returns immediately.
-void ThreadPool::start_thinking(const Position& pos, const LimitsType& limits, const std::vector<Move>& searchMoves,
- StateStackPtr& setupStates, MovesVectPtr& setupMoves) {
+void ThreadPool::start_thinking(const Position& pos, const LimitsType& limits,
+ const std::vector<Move>& searchMoves, StateStackPtr& states) {
wait_for_think_finished();
SearchTime = Time::now(); // As early as possible
RootPos = pos;
Limits = limits;
- SetupStates = setupStates; // Ownership transfer here
- SetupMoves = setupMoves; // Ownership transfer here
+ SetupStates = states; // Ownership transfer here
RootMoves.clear();
for (MoveList<LEGAL> ml(pos); !ml.end(); ++ml)