is_searching = true;
Search::think();
+
+ assert(is_searching);
}
}
}
-// d'tor cleanly terminates the threads when the program exits.
+// exit() cleanly terminates the threads before the program exits.
-ThreadPool::~ThreadPool() {
+void ThreadPool::exit() {
- for (size_t i = 0; i < size(); i++)
+ for (size_t i = 0; i < threads.size(); i++)
delete threads[i];
delete timer;
assert(requested > 0);
- while (size() < requested)
+ while (threads.size() < requested)
threads.push_back(new Thread(&Thread::idle_loop));
- while (size() > requested)
+ while (threads.size() > requested)
{
delete threads.back();
threads.pop_back();
void ThreadPool::wake_up() const {
- for (size_t i = 0; i < size(); i++)
+ for (size_t i = 0; i < threads.size(); i++)
{
threads[i]->maxPly = 0;
threads[i]->do_sleep = false;
void ThreadPool::sleep() const {
- for (size_t i = 1; i < size(); i++) // Main thread will go to sleep by itself
- threads[i]->do_sleep = true; // to avoid a race with start_searching()
+ // 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;
}
bool ThreadPool::available_slave_exists(Thread* master) const {
- for (size_t i = 0; i < size(); i++)
+ for (size_t i = 0; i < threads.size(); i++)
if (threads[i]->is_available_to(master))
return true;
sp.mutex.lock();
mutex.lock();
- for (size_t i = 0; i < size() && !Fake; ++i)
+ for (size_t i = 0; i < threads.size() && !Fake; ++i)
if (threads[i]->is_available_to(master))
{
sp.slavesMask |= 1ULL << i;
// a new search, then returns immediately.
void ThreadPool::start_searching(const Position& pos, const LimitsType& limits,
- const std::vector<Move>& searchMoves) {
+ const std::vector<Move>& searchMoves, StateStackPtr& states) {
wait_for_search_finished();
SearchTime.restart(); // As early as possible
RootPosition = pos;
Limits = limits;
+ SetupStates = states; // Ownership transfer here
RootMoves.clear();
for (MoveList<LEGAL> ml(pos); !ml.end(); ++ml)