X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fthread.h;h=f530913cf22017f21fa49a2ca812dc6861b5439c;hp=44aa68835f892a56113f58de9a2a4f1d6ba6d2bd;hb=5fd5453e594ee6cadf4a3c502bc53d28cfe5aa8b;hpb=55604f156b2293e870984c6bb57c1954ad5a9517 diff --git a/src/thread.h b/src/thread.h index 44aa6883..f530913c 100644 --- a/src/thread.h +++ b/src/thread.h @@ -1,7 +1,7 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2014 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -29,8 +29,14 @@ #include "position.h" #include "search.h" -const int MAX_THREADS = 128; -const int MAX_SPLITPOINTS_PER_THREAD = 8; +struct Thread; + +const size_t MAX_THREADS = 128; +const size_t MAX_SPLITPOINTS_PER_THREAD = 8; +const size_t MAX_SLAVES_PER_SPLITPOINT = 4; + +/// Mutex and ConditionVariable struct are wrappers of the low level locking +/// machinery and are modeled after the corresponding C++11 classes. struct Mutex { Mutex() { lock_init(l); } @@ -57,14 +63,16 @@ private: WaitCondition c; }; -struct Thread; + +/// SplitPoint struct stores information shared by the threads searching in +/// parallel below the same split point. It is populated at splitting time. struct SplitPoint { // Const data after split point has been setup const Position* pos; - const Search::Stack* ss; - Thread* masterThread; + Search::Stack* ss; + Thread* master; Depth depth; Value beta; int nodeType; @@ -74,9 +82,10 @@ struct SplitPoint { MovePicker* movePicker; SplitPoint* parentSplitPoint; - // Shared data + // Shared variable data Mutex mutex; std::bitset slavesMask; + volatile bool allSlavesSearching; volatile uint64_t nodes; volatile Value alpha; volatile Value bestValue; @@ -116,19 +125,18 @@ struct Thread : public ThreadBase { bool cutoff_occurred() const; bool available_to(const Thread* master) const; - template - void split(Position& pos, const Search::Stack* ss, Value alpha, Value beta, Value* bestValue, Move* bestMove, + void split(Position& pos, Search::Stack* ss, Value alpha, Value beta, Value* bestValue, Move* bestMove, Depth depth, int moveCount, MovePicker* movePicker, int nodeType, bool cutNode); SplitPoint splitPoints[MAX_SPLITPOINTS_PER_THREAD]; + Pawns::Table pawnsTable; Material::Table materialTable; Endgames endgames; - Pawns::Table pawnsTable; Position* activePosition; size_t idx; int maxPly; SplitPoint* volatile activeSplitPoint; - volatile int splitPointsSize; + volatile size_t splitPointsSize; volatile bool searching; }; @@ -143,10 +151,13 @@ struct MainThread : public Thread { }; struct TimerThread : public ThreadBase { + + static const int Resolution = 5; // Millisec between two check_time() calls + TimerThread() : run(false) {} virtual void idle_loop(); + bool run; - static const int Resolution = 5; // msec between two check_time() calls }; @@ -156,16 +167,15 @@ struct TimerThread : public ThreadBase { struct ThreadPool : public std::vector { - void init(); // No c'tor and d'tor, threads rely on globals that should - void exit(); // be initialized and are valid during the whole thread lifetime. + void init(); // No c'tor and d'tor, threads rely on globals that should be + void exit(); // initialized and are valid during the whole thread lifetime. - MainThread* main() { return static_cast((*this)[0]); } + MainThread* main() { return static_cast(at(0)); } void read_uci_options(); Thread* available_slave(const Thread* master) const; void wait_for_think_finished(); void start_thinking(const Position&, const Search::LimitsType&, Search::StateStackPtr&); - bool sleepWhileIdle; Depth minimumSplitDepth; Mutex mutex; ConditionVariable sleepCondition;