X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fthread.h;h=34307297dead0fa04a8c21b30f3045d588076f5c;hp=6817e20e53e78fb0d9be02d2031ab3439d10d13d;hb=6fa6da3ee13d2b7bdbec3cd24ff8ca43233c74fb;hpb=1b6b711c444362d442f8362d356f668f676ec5cb
diff --git a/src/thread.h b/src/thread.h
index 6817e20e..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-2012 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
@@ -17,9 +17,14 @@
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
#include "material.h"
@@ -28,56 +33,64 @@
#include "position.h"
#include "search.h"
-const int MAX_THREADS = 32;
-const int MAX_SPLITPOINTS_PER_THREAD = 8;
+struct Thread;
-struct Mutex {
- Mutex() { lock_init(l); }
- ~Mutex() { lock_destroy(l); }
+const size_t MAX_THREADS = 128;
+const size_t MAX_SPLITPOINTS_PER_THREAD = 8;
+const size_t MAX_SLAVES_PER_SPLITPOINT = 4;
- void lock() { lock_grab(l); }
- void unlock() { lock_release(l); }
+#if 0
+/// Spinlock class wraps low level atomic operations to provide a spin lock
-private:
- friend struct ConditionVariable;
+class Spinlock {
- Lock l;
+ std::atomic_int lock;
+
+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
- 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); }
+class Spinlock {
-private:
- WaitCondition c;
+ std::mutex mutex;
+
+public:
+ void acquire() { mutex.lock(); }
+ void release() { mutex.unlock(); }
};
-class 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;
+ Search::Stack* ss;
+ Thread* master;
Depth depth;
Value beta;
int nodeType;
- Thread* master;
- Move threatMove;
+ bool cutNode;
// 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;
+ MovePicker* movePicker;
+ SplitPoint* parentSplitPoint;
+
+ // Shared variable data
+ Spinlock spinlock;
+ std::bitset slavesMask;
+ volatile bool allSlavesSearching;
+ volatile uint64_t nodes;
volatile Value alpha;
volatile Value bestValue;
volatile Move bestMove;
@@ -86,85 +99,90 @@ struct SplitPoint {
};
+/// ThreadBase struct is the base of the hierarchy from where we derive all the
+/// specialized thread classes.
+
+struct ThreadBase {
+
+ virtual ~ThreadBase() = default;
+ virtual void idle_loop() = 0;
+ void notify_one();
+ void wait_for(volatile const bool& b);
+
+ std::thread nativeThread;
+ std::mutex mutex;
+ std::condition_variable sleepCondition;
+ volatile bool exit = false;
+};
+
+
/// 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.
-class Thread {
-
- typedef void (Thread::* Fn) (); // Pointer to member function
+struct Thread : public ThreadBase {
-public:
- Thread(Fn fn);
- ~Thread();
-
- void wake_up();
+ Thread();
+ virtual void idle_loop();
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();
+ bool can_join(const SplitPoint* sp) const;
+
+ 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];
- MaterialTable materialTable;
- PawnTable pawnTable;
+ Pawns::Table pawnsTable;
+ Material::Table materialTable;
+ Endgames endgames;
+ Position* activePosition;
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;
+ SplitPoint* volatile activeSplitPoint;
+ volatile size_t splitPointsSize;
+ volatile bool searching;
};
-/// 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.
+/// MainThread and TimerThread are derived classes used to characterize the two
+/// special threads: the main one and the recurring timer.
-class ThreadPool {
+struct MainThread : public Thread {
+ virtual void idle_loop();
+ volatile bool thinking = true; // Avoid a race with start_thinking()
+};
-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.
+struct TimerThread : public ThreadBase {
+
+ static const int Resolution = 5; // Millisec between two check_time() calls
+
+ virtual void idle_loop();
- 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]; }
+ bool run = false;
+};
+
+
+/// ThreadPool struct handles all the threads related stuff like init, starting,
+/// parking and, most importantly, launching a slave thread at a split point.
+/// All the access to shared thread data is done through this class.
- void wake_up() const;
- void sleep() const;
+struct ThreadPool : public std::vector {
+
+ 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(at(0)); }
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&);
-
- 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;
+ Thread* available_slave(const SplitPoint* sp) const;
+ void wait_for_think_finished();
+ void start_thinking(const Position&, const Search::LimitsType&, Search::StateStackPtr&);
+
Depth minimumSplitDepth;
- int maxThreadsPerSplitPoint;
- bool useSleepingThreads;
+ Spinlock spinlock;
+ std::condition_variable sleepCondition;
+ TimerThread* timer;
};
extern ThreadPool Threads;
-#endif // !defined(THREAD_H_INCLUDED)
+#endif // #ifndef THREAD_H_INCLUDED