X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fthread.cpp;h=031ee848e6343ea44c33835198a9411320b10a32;hp=4fa081482ffab4144de201a4fd56014e25c1be19;hb=41561c9bb80a176f9fce169975fcb553340499fc;hpb=3441e0075decb1acd8d3b4020b7822f743613124 diff --git a/src/thread.cpp b/src/thread.cpp index 4fa08148..031ee848 100644 --- a/src/thread.cpp +++ b/src/thread.cpp @@ -36,13 +36,7 @@ namespace { extern "C" { // and last thread are special. First one is the main search thread while the // last one mimics a timer, they run in main_loop() and timer_loop(). -#if defined(_WIN32) || defined(_WIN64) - DWORD WINAPI start_routine(LPVOID thread) { -#else - void* start_routine(void* thread) { -#endif - - Thread* th = (Thread*)thread; + long start_routine(Thread* th) { if (th->threadID == 0) th->main_loop(); @@ -59,6 +53,50 @@ namespace { extern "C" { } } +// Thread c'tor creates and launches the OS thread, that will go immediately to +// sleep. + +Thread::Thread(int id) { + + is_searching = do_exit = false; + maxPly = splitPointsCnt = 0; + curSplitPoint = NULL; + threadID = id; + do_sleep = (id != 0); // Avoid a race with start_thinking() + + lock_init(sleepLock); + cond_init(sleepCond); + + for (int j = 0; j < MAX_SPLITPOINTS_PER_THREAD; j++) + lock_init(splitPoints[j].lock); + + if (!thread_create(handle, start_routine, this)) + { + std::cerr << "Failed to create thread number " << id << std::endl; + ::exit(EXIT_FAILURE); + } +} + + +// Thread d'tor will wait for thread termination before to return. + +Thread::~Thread() { + + assert(do_sleep); + + do_exit = true; // Search must be already finished + wake_up(); + + thread_join(handle); // Wait for thread termination + + lock_destroy(sleepLock); + cond_destroy(sleepCond); + + for (int j = 0; j < MAX_SPLITPOINTS_PER_THREAD; j++) + lock_destroy(splitPoints[j].lock); +} + + // Thread::timer_loop() is where the timer thread waits maxPly milliseconds and // then calls do_timer_event(). If maxPly is 0 thread sleeps until is woken up. extern void check_time(); @@ -172,42 +210,50 @@ bool Thread::is_available_to(int master) const { // read_uci_options() updates internal threads parameters from the corresponding -// UCI options. It is called before to start a new search. +// UCI options and creates/destroys threads to match the requested number. Thread +// objects are dynamically allocated to avoid creating in advance all possible +// threads, with included pawns and material tables, if only few are used. void ThreadsManager::read_uci_options() { maxThreadsPerSplitPoint = Options["Max Threads per Split Point"]; minimumSplitDepth = Options["Min Split Depth"] * ONE_PLY; useSleepingThreads = Options["Use Sleeping Threads"]; + int requested = Options["Threads"]; + + while (size() < requested) + threads.push_back(new Thread(size())); + + while (size() > requested) + { + delete threads.back(); + threads.pop_back(); + } } -// set_size() changes the number of active threads and raises do_sleep flag for -// all the unused threads that will go immediately to sleep. +// wake_up() is called before a new search to start the threads that are waiting +// on the sleep condition. If useSleepingThreads is set threads will be woken up +// at split time. -void ThreadsManager::set_size(int cnt) { +void ThreadsManager::wake_up() { - assert(cnt > 0 && cnt < MAX_THREADS); + for (int i = 0; i < size(); i++) + { + threads[i]->do_sleep = false; - activeThreads = cnt; + if (!useSleepingThreads) + threads[i]->wake_up(); + } +} - for (int i = 0; i < MAX_THREADS; i++) - if (i < activeThreads) - { - // Dynamically allocate pawn and material hash tables according to the - // number of active threads. This avoids preallocating memory for all - // possible threads if only few are used. - threads[i].pawnTable.init(); - threads[i].materialTable.init(); - threads[i].maxPly = 0; - threads[i].do_sleep = false; +// sleep() is called after the search to ask threads to wait on sleep condition - if (!useSleepingThreads) - threads[i].wake_up(); - } - else - threads[i].do_sleep = true; +void ThreadsManager::sleep() { + + for (int i = 0; i < size(); i++) + threads[i]->do_sleep = true; } @@ -216,58 +262,21 @@ void ThreadsManager::set_size(int cnt) { void ThreadsManager::init() { - cond_init(sleepCond); - lock_init(splitLock); - - for (int i = 0; i <= MAX_THREADS; i++) - { - lock_init(threads[i].sleepLock); - cond_init(threads[i].sleepCond); - - for (int j = 0; j < MAX_SPLITPOINTS_PER_THREAD; j++) - lock_init(threads[i].splitPoints[j].lock); - } - - // Allocate main thread tables to call evaluate() also when not searching - threads[0].pawnTable.init(); - threads[0].materialTable.init(); - - // Create and launch all the threads, threads will go immediately to sleep - for (int i = 0; i <= MAX_THREADS; i++) - { - threads[i].is_searching = false; - threads[i].do_sleep = (i != 0); // Avoid a race with start_thinking() - threads[i].threadID = i; - - if (!thread_create(threads[i].handle, start_routine, threads[i])) - { - std::cerr << "Failed to create thread number " << i << std::endl; - ::exit(EXIT_FAILURE); - } - } + cond_init(sleepCond); + lock_init(splitLock); + timer = new Thread(MAX_THREADS); + read_uci_options(); // Creates at least the main thread } -// exit() is called to cleanly terminate the threads when the program finishes +// exit() is called to cleanly terminate the threads before the program finishes void ThreadsManager::exit() { - for (int i = 0; i <= MAX_THREADS; i++) - { - assert(threads[i].do_sleep); - - threads[i].do_exit = true; // Search must be already finished - threads[i].wake_up(); - - thread_join(threads[i].handle); // Wait for thread termination - - lock_destroy(threads[i].sleepLock); - cond_destroy(threads[i].sleepCond); - - for (int j = 0; j < MAX_SPLITPOINTS_PER_THREAD; j++) - lock_destroy(threads[i].splitPoints[j].lock); - } + for (int i = 0; i < size(); i++) + delete threads[i]; + delete timer; lock_destroy(splitLock); cond_destroy(sleepCond); } @@ -278,10 +287,10 @@ void ThreadsManager::exit() { bool ThreadsManager::available_slave_exists(int master) const { - assert(master >= 0 && master < activeThreads); + assert(master >= 0 && master < size()); - for (int i = 0; i < activeThreads; i++) - if (threads[i].is_available_to(master)) + for (int i = 0; i < size(); i++) + if (threads[i]->is_available_to(master)) return true; return false; @@ -299,19 +308,17 @@ bool ThreadsManager::available_slave_exists(int master) const { template Value ThreadsManager::split(Position& pos, Stack* ss, Value alpha, Value beta, - Value bestValue, Depth depth, Move threatMove, - int moveCount, MovePicker* mp, int nodeType) { + Value bestValue, Move* bestMove, Depth depth, + Move threatMove, int moveCount, MovePicker* mp, int nodeType) { assert(pos.pos_is_ok()); assert(bestValue > -VALUE_INFINITE); assert(bestValue <= alpha); assert(alpha < beta); assert(beta <= VALUE_INFINITE); assert(depth > DEPTH_ZERO); - assert(pos.thread() >= 0 && pos.thread() < activeThreads); - assert(activeThreads > 1); int master = pos.thread(); - Thread& masterThread = threads[master]; + Thread& masterThread = *threads[master]; if (masterThread.splitPointsCnt >= MAX_SPLITPOINTS_PER_THREAD) return bestValue; @@ -324,6 +331,7 @@ Value ThreadsManager::split(Position& pos, Stack* ss, Value alpha, Value beta, sp->cutoff = false; sp->slavesMask = 1ULL << master; sp->depth = depth; + sp->bestMove = *bestMove; sp->threatMove = threatMove; sp->alpha = alpha; sp->beta = beta; @@ -346,15 +354,15 @@ Value ThreadsManager::split(Position& pos, Stack* ss, Value alpha, Value beta, lock_grab(sp->lock); lock_grab(splitLock); - for (int i = 0; i < activeThreads && !Fake; i++) - if (threads[i].is_available_to(master)) + for (int i = 0; i < size() && !Fake; ++i) + if (threads[i]->is_available_to(master)) { sp->slavesMask |= 1ULL << i; - threads[i].curSplitPoint = sp; - threads[i].is_searching = true; // Slave leaves idle_loop() + threads[i]->curSplitPoint = sp; + threads[i]->is_searching = true; // Slave leaves idle_loop() if (useSleepingThreads) - threads[i].wake_up(); + threads[i]->wake_up(); if (++slavesCnt + 1 >= maxThreadsPerSplitPoint) // Master is always included break; @@ -387,6 +395,7 @@ Value ThreadsManager::split(Position& pos, Stack* ss, Value alpha, Value beta, masterThread.splitPointsCnt--; masterThread.curSplitPoint = sp->parent; pos.set_nodes_searched(pos.nodes_searched() + sp->nodes); + *bestMove = sp->bestMove; lock_release(splitLock); lock_release(sp->lock); @@ -395,8 +404,8 @@ Value ThreadsManager::split(Position& pos, Stack* ss, Value alpha, Value beta, } // Explicit template instantiations -template Value ThreadsManager::split(Position&, Stack*, Value, Value, Value, Depth, Move, int, MovePicker*, int); -template Value ThreadsManager::split(Position&, Stack*, Value, Value, Value, Depth, Move, int, MovePicker*, int); +template Value ThreadsManager::split(Position&, Stack*, Value, Value, Value, Move*, Depth, Move, int, MovePicker*, int); +template Value ThreadsManager::split(Position&, Stack*, Value, Value, Value, Move*, Depth, Move, int, MovePicker*, int); // ThreadsManager::set_timer() is used to set the timer to trigger after msec @@ -404,12 +413,10 @@ template Value ThreadsManager::split(Position&, Stack*, Value, Value, Valu void ThreadsManager::set_timer(int msec) { - Thread& timer = threads[MAX_THREADS]; - - lock_grab(timer.sleepLock); - timer.maxPly = msec; - cond_signal(timer.sleepCond); // Wake up and restart the timer - lock_release(timer.sleepLock); + lock_grab(timer->sleepLock); + timer->maxPly = msec; + cond_signal(timer->sleepCond); // Wake up and restart the timer + lock_release(timer->sleepLock); } @@ -420,7 +427,7 @@ void ThreadsManager::set_timer(int msec) { void ThreadsManager::start_thinking(const Position& pos, const LimitsType& limits, const std::set& searchMoves, bool async) { - Thread& main = threads[0]; + Thread& main = *threads.front(); lock_grab(main.sleepLock); @@ -460,7 +467,7 @@ void ThreadsManager::start_thinking(const Position& pos, const LimitsType& limit void ThreadsManager::stop_thinking() { - Thread& main = threads[0]; + Thread& main = *threads.front(); Search::Signals.stop = true;