X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fthread.h;h=79be197bf27ba794fa163299322421cf50946769;hb=6596f0eac0c1d25a12bfd923907bfc78beedbc90;hp=6817e20e53e78fb0d9be02d2031ab3439d10d13d;hpb=1b6b711c444362d442f8362d356f668f676ec5cb;p=stockfish
diff --git a/src/thread.h b/src/thread.h
index 6817e20e..79be197b 100644
--- a/src/thread.h
+++ b/src/thread.h
@@ -1,7 +1,8 @@
/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2012 Marco Costalba, Joona Kiiski, Tord Romstad
+ Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
+ Copyright (C) 2015-2020 Marco Costalba, Joona Kiiski, Gary Linscott, 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
@@ -17,9 +18,13 @@
along with this program. If not, see .
*/
-#if !defined(THREAD_H_INCLUDED)
+#ifndef THREAD_H_INCLUDED
#define THREAD_H_INCLUDED
+#include
+#include
+#include
+#include
#include
#include "material.h"
@@ -27,144 +32,98 @@
#include "pawns.h"
#include "position.h"
#include "search.h"
+#include "thread_win32_osx.h"
-const int MAX_THREADS = 32;
-const int MAX_SPLITPOINTS_PER_THREAD = 8;
-struct Mutex {
- Mutex() { lock_init(l); }
- ~Mutex() { lock_destroy(l); }
+/// Thread class keeps together all the thread-related stuff. We use
+/// per-thread pawn and material hash tables so that once we get a
+/// pointer to an entry its life time is unlimited and we don't have
+/// to care about someone changing the entry under our feet.
- void lock() { lock_grab(l); }
- void unlock() { lock_release(l); }
+class Thread {
-private:
- friend struct ConditionVariable;
+ std::mutex mutex;
+ std::condition_variable cv;
+ size_t idx;
+ bool exit = false, searching = true; // Set before starting std::thread
+ NativeThread stdThread;
- Lock l;
+public:
+ explicit Thread(size_t);
+ virtual ~Thread();
+ virtual void search();
+ void clear();
+ void idle_loop();
+ void start_searching();
+ void wait_for_search_finished();
+ int best_move_count(Move move) const;
+
+ Pawns::Table pawnsTable;
+ Material::Table materialTable;
+ size_t pvIdx, pvLast;
+ uint64_t ttHitAverage;
+ int selDepth, nmpMinPly;
+ Color nmpColor;
+ std::atomic nodes, tbHits, bestMoveChanges;
+
+ Position rootPos;
+ Search::RootMoves rootMoves;
+ Depth rootDepth, completedDepth;
+ CounterMoveHistory counterMoves;
+ ButterflyHistory mainHistory;
+ LowPlyHistory lowPlyHistory;
+ CapturePieceToHistory captureHistory;
+ ContinuationHistory continuationHistory[2][2];
+ Score contempt;
};
-struct ConditionVariable {
- ConditionVariable() { cond_init(c); }
- ~ConditionVariable() { cond_destroy(c); }
- 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); }
+/// MainThread is a derived class specific for main thread
-private:
- WaitCondition c;
-};
-
-class Thread;
-
-struct SplitPoint {
-
- // Const data after split point has been setup
- const Position* pos;
- const Search::Stack* ss;
- Depth depth;
- Value beta;
- int nodeType;
- Thread* master;
- Move threatMove;
-
- // Const pointers to shared data
- MovePicker* mp;
- SplitPoint* parent;
-
- // Shared data
- Mutex mutex;
- Position* activePositions[MAX_THREADS];
- volatile uint64_t slavesMask;
- volatile int64_t nodes;
- volatile Value alpha;
- volatile Value bestValue;
- volatile Move bestMove;
- volatile int moveCount;
- volatile bool cutoff;
-};
+struct MainThread : public Thread {
+ using Thread::Thread;
-/// Thread struct keeps together all the thread related stuff like locks, state
-/// and especially split points. We also use per-thread pawn and material hash
-/// tables so that once we get a pointer to an entry its life time is unlimited
-/// and we don't have to care about someone changing the entry under our feet.
+ void search() override;
+ void check_time();
-class Thread {
+ double previousTimeReduction;
+ Value bestPreviousScore;
+ Value iterValue[4];
+ int callsCnt;
+ bool stopOnPonderhit;
+ std::atomic_bool ponder;
+};
- typedef void (Thread::* Fn) (); // Pointer to member function
-public:
- Thread(Fn fn);
- ~Thread();
+/// ThreadPool struct handles all the threads-related stuff like init, starting,
+/// parking and, most importantly, launching a thread. All the access to threads
+/// is done through this class.
- void wake_up();
- bool cutoff_occurred() const;
- bool is_available_to(Thread* master) const;
- void idle_loop();
- void main_loop();
- void timer_loop();
- void wait_for_stop_or_ponderhit();
+struct ThreadPool : public std::vector {
- SplitPoint splitPoints[MAX_SPLITPOINTS_PER_THREAD];
- MaterialTable materialTable;
- PawnTable pawnTable;
- size_t idx;
- int maxPly;
- Mutex mutex;
- ConditionVariable sleepCondition;
- NativeHandle handle;
- Fn start_fn;
- SplitPoint* volatile curSplitPoint;
- volatile int splitPointsCnt;
- volatile bool is_searching;
- volatile bool do_sleep;
- volatile bool do_exit;
-};
+ void start_thinking(Position&, StateListPtr&, const Search::LimitsType&, bool = false);
+ void clear();
+ void set(size_t);
+ MainThread* main() const { return static_cast(front()); }
+ uint64_t nodes_searched() const { return accumulate(&Thread::nodes); }
+ uint64_t tb_hits() const { return accumulate(&Thread::tbHits); }
-/// ThreadPool class handles all the threads related stuff like init, starting,
-/// parking and, the most important, launching a slave thread at a split point.
-/// All the access to shared thread data is done through this class.
+ std::atomic_bool stop, increaseDepth;
-class ThreadPool {
+private:
+ StateListPtr setupStates;
-public:
- void init(); // No c'tor and d'tor, threads rely on globals that should
- void exit(); // be initialized and valid during the whole thread lifetime.
-
- Thread& operator[](size_t id) { return *threads[id]; }
- bool use_sleeping_threads() const { return useSleepingThreads; }
- int min_split_depth() const { return minimumSplitDepth; }
- size_t size() const { return threads.size(); }
- Thread* main_thread() { return threads[0]; }
-
- void wake_up() const;
- void sleep() const;
- void read_uci_options();
- bool available_slave_exists(Thread* master) const;
- void set_timer(int msec);
- void wait_for_search_finished();
- void start_searching(const Position&, const Search::LimitsType&,
- const std::vector&, Search::StateStackPtr&);
+ uint64_t accumulate(std::atomic Thread::* member) const {
- template
- Value split(Position& pos, Search::Stack* ss, Value alpha, Value beta, Value bestValue, Move* bestMove,
- Depth depth, Move threatMove, int moveCount, MovePicker& mp, int nodeType);
-private:
- friend class Thread;
- friend void check_time();
-
- std::vector threads;
- Thread* timer;
- Mutex mutex;
- ConditionVariable sleepCondition;
- Depth minimumSplitDepth;
- int maxThreadsPerSplitPoint;
- bool useSleepingThreads;
+ uint64_t sum = 0;
+ for (Thread* th : *this)
+ sum += (th->*member).load(std::memory_order_relaxed);
+ return sum;
+ }
};
extern ThreadPool Threads;
-#endif // !defined(THREAD_H_INCLUDED)
+#endif // #ifndef THREAD_H_INCLUDED