X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fthread.h;h=34307297dead0fa04a8c21b30f3045d588076f5c;hp=44aa68835f892a56113f58de9a2a4f1d6ba6d2bd;hb=cb2111f0b62afec5fd977e1dd4ca5843bd006956;hpb=55604f156b2293e870984c6bb57c1954ad5a9517 diff --git a/src/thread.h b/src/thread.h index 44aa6883..34307297 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 @@ -20,7 +20,11 @@ #ifndef THREAD_H_INCLUDED #define THREAD_H_INCLUDED +#include #include +#include +#include +#include #include #include "material.h" @@ -29,42 +33,50 @@ #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; -struct Mutex { - Mutex() { lock_init(l); } - ~Mutex() { lock_destroy(l); } +#if 0 +/// Spinlock class wraps low level atomic operations to provide a spin lock - void lock() { lock_grab(l); } - void unlock() { lock_release(l); } +class Spinlock { -private: - friend struct ConditionVariable; + std::atomic_int lock; - Lock l; +public: + Spinlock() { lock = 1; } // Init here to workaround a bug with MSVC 2013 + void acquire() { + while (lock.fetch_sub(1, std::memory_order_acquire) != 1) + while (lock.load(std::memory_order_relaxed) <= 0) {} + } + void release() { lock.store(1, std::memory_order_release); } }; -struct ConditionVariable { - ConditionVariable() { cond_init(c); } - ~ConditionVariable() { cond_destroy(c); } +#else + +class Spinlock { - void wait(Mutex& m) { cond_wait(c, m.l); } - void wait_for(Mutex& m, int ms) { timed_wait(c, m.l, ms); } - void notify_one() { cond_signal(c); } + std::mutex mutex; -private: - WaitCondition c; +public: + void acquire() { mutex.lock(); } + void release() { mutex.unlock(); } }; -struct Thread; +#endif + +/// 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 +86,10 @@ struct SplitPoint { MovePicker* movePicker; SplitPoint* parentSplitPoint; - // Shared data - Mutex mutex; + // Shared variable data + Spinlock spinlock; std::bitset slavesMask; + volatile bool allSlavesSearching; volatile uint64_t nodes; volatile Value alpha; volatile Value bestValue; @@ -91,16 +104,15 @@ struct SplitPoint { struct ThreadBase { - ThreadBase() : handle(NativeHandle()), exit(false) {} - virtual ~ThreadBase() {} + virtual ~ThreadBase() = default; virtual void idle_loop() = 0; void notify_one(); void wait_for(volatile const bool& b); - Mutex mutex; - ConditionVariable sleepCondition; - NativeHandle handle; - volatile bool exit; + std::thread nativeThread; + std::mutex mutex; + std::condition_variable sleepCondition; + volatile bool exit = false; }; @@ -114,21 +126,20 @@ struct Thread : public ThreadBase { Thread(); virtual void idle_loop(); bool cutoff_occurred() const; - bool available_to(const Thread* master) const; + bool can_join(const SplitPoint* sp) 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; }; @@ -137,16 +148,17 @@ struct Thread : public ThreadBase { /// special threads: the main one and the recurring timer. struct MainThread : public Thread { - MainThread() : thinking(true) {} // Avoid a race with start_thinking() virtual void idle_loop(); - volatile bool thinking; + volatile bool thinking = true; // Avoid a race with start_thinking() }; struct TimerThread : public ThreadBase { - TimerThread() : run(false) {} + + static const int Resolution = 5; // Millisec between two check_time() calls + virtual void idle_loop(); - bool run; - static const int Resolution = 5; // msec between two check_time() calls + + bool run = false; }; @@ -156,19 +168,18 @@ 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; + Thread* available_slave(const SplitPoint* sp) const; void wait_for_think_finished(); void start_thinking(const Position&, const Search::LimitsType&, Search::StateStackPtr&); - bool sleepWhileIdle; Depth minimumSplitDepth; - Mutex mutex; - ConditionVariable sleepCondition; + Spinlock spinlock; + std::condition_variable sleepCondition; TimerThread* timer; };