X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fthread.cpp;h=1f01537ffd2845ca311b509300eddedb5c9f899e;hp=5c10eee0635e8ddbf531d3e84577629aa74b0c01;hb=e5ffe9959c40a5ec6c4bca83a5a48070cae7fa5b;hpb=ba85c59d96d962dddaa0f1a2608ebea2e8ae694b diff --git a/src/thread.cpp b/src/thread.cpp index 5c10eee0..1f01537f 100644 --- a/src/thread.cpp +++ b/src/thread.cpp @@ -27,7 +27,7 @@ ThreadsManager Threads; // Global object definition namespace { extern "C" { // start_routine() is the C function which is called when a new thread - // is launched. It simply calls idle_loop() with the supplied threadID. + // is launched. It simply calls idle_loop() of the supplied threadID. // There are two versions of this function; one for POSIX threads and // one for Windows threads. @@ -126,7 +126,20 @@ void ThreadsManager::set_size(int cnt) { activeThreads = cnt; for (int i = 0; i < MAX_THREADS; i++) - threads[i].do_sleep = !(i < activeThreads); + 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 as, for instance, on mobile + // devices where memory is scarce and allocating for MAX_THREADS could + // even result in a crash. + threads[i].pawnTable.init(); + threads[i].materialTable.init(); + + threads[i].do_sleep = false; + } + else + threads[i].do_sleep = true; } @@ -135,14 +148,11 @@ void ThreadsManager::set_size(int cnt) { void ThreadsManager::init() { - // Threads will sent to sleep as soon as created, only main thread is kept alive + // Threads will go to sleep as soon as created, only main thread is kept alive set_size(1); threads[0].state = Thread::SEARCHING; threads[0].threadID = 0; - // Allocate pawn and material hash tables for main thread - init_hash_tables(); - // Initialize threads lock, used when allocating slaves during splitting lock_init(&threadsLock); @@ -159,24 +169,21 @@ void ThreadsManager::init() { // Create and startup all the threads but the main that is already running for (int i = 1; i < MAX_THREADS; i++) { - threads[i].state = Thread::INITIALIZING; + threads[i].state = Thread::AVAILABLE; threads[i].threadID = i; #if defined(_MSC_VER) - bool ok = (CreateThread(NULL, 0, start_routine, (LPVOID)&threads[i].threadID , 0, NULL) != NULL); + threads[i].handle = CreateThread(NULL, 0, start_routine, (LPVOID)&threads[i].threadID, 0, NULL); + bool ok = (threads[i].handle != NULL); #else - pthread_t pthreadID; - bool ok = (pthread_create(&pthreadID, NULL, start_routine, (void*)&threads[i].threadID) == 0); - pthread_detach(pthreadID); + bool ok = (pthread_create(&threads[i].handle, NULL, start_routine, (void*)&threads[i].threadID) == 0); #endif + if (!ok) { std::cout << "Failed to create thread number " << i << std::endl; ::exit(EXIT_FAILURE); } - - // Wait until the thread has finished launching and is gone to sleep - while (threads[i].state == Thread::INITIALIZING) {} } } @@ -192,7 +199,14 @@ void ThreadsManager::exit() { { threads[i].do_terminate = true; threads[i].wake_up(); - while (threads[i].state != Thread::TERMINATED) {} + +#if defined(_MSC_VER) + WaitForSingleObject(threads[i].handle, 0); + CloseHandle(threads[i].handle); +#else + pthread_join(threads[i].handle, NULL); + pthread_detach(threads[i].handle); +#endif } // Now we can safely destroy locks and wait conditions @@ -207,22 +221,6 @@ void ThreadsManager::exit() { } -// init_hash_tables() dynamically allocates 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 as, for instance, -// on mobile devices where memory is scarce and allocating for MAX_THREADS -// threads could even result in a crash. - -void ThreadsManager::init_hash_tables() { - - for (int i = 0; i < activeThreads; i++) - { - threads[i].pawnTable.init(); - threads[i].materialTable.init(); - } -} - - // available_slave_exists() tries to find an idle thread which is available as // a slave for the thread with threadID "master".