else
assert(false);
- spinlock.acquire();
assert(searching);
+ spinlock.acquire();
+
searching = false;
activePosition = nullptr;
+
+ spinlock.release();
+
sp->slavesMask.reset(idx);
sp->allSlavesSearching = false;
sp->nodes += pos.nodes_searched();
// After releasing the lock we can't access any SplitPoint related data
// in a safe way because it could have been released under our feet by
// the sp master.
- spinlock.release();
sp->spinlock.release();
// Try to late join to another split point if none of its slaves has
SplitPoint& sp = splitPoints[splitPointsSize];
sp.spinlock.acquire(); // No contention here until we don't increment splitPointsSize
- spinlock.acquire();
sp.master = this;
sp.parentSplitPoint = activeSplitPoint;
++splitPointsSize;
activeSplitPoint = &sp;
activePosition = nullptr;
- spinlock.release();
// Try to allocate available threads
Thread* slave;
Thread::idle_loop(); // Force a call to base class idle_loop()
- sp.spinlock.acquire();
- spinlock.acquire();
-
// In the helpful master concept, a master can help only a sub-tree of its
// split point and because everything is finished here, it's not possible
// for the master to be booked.
assert(!searching);
assert(!activePosition);
- searching = true;
-
// We have returned from the idle loop, which means that all threads are
// finished. Note that decreasing splitPointsSize must be done under lock
// protection to avoid a race with Thread::can_join().
+ spinlock.acquire();
+
+ searching = true;
--splitPointsSize;
activeSplitPoint = sp.parentSplitPoint;
activePosition = &pos;
+
+ spinlock.release();
+
+ // Split point data cannot be changed now, so no need to lock protect
pos.set_nodes_searched(pos.nodes_searched() + sp.nodes);
*bestMove = sp.bestMove;
*bestValue = sp.bestValue;
-
- spinlock.release();
- sp.spinlock.release();
}