#include "position.h"
#include "search.h"
-const int MAX_THREADS = 32;
+const int MAX_THREADS = 64; // Because SplitPoint::slavesMask is a uint64_t
const int MAX_SPLITPOINTS_PER_THREAD = 8;
struct Mutex {
// Shared data
Mutex mutex;
+ Position* activePositions[MAX_THREADS];
volatile uint64_t slavesMask;
volatile int64_t nodes;
volatile Value alpha;
class Thread {
- typedef void (Thread::* Fn) (); // Pointer to member function
-
public:
- Thread(Fn fn);
- ~Thread();
+ Thread();
+ virtual ~Thread();
- void wake_up();
+ virtual void idle_loop();
+ void notify_one();
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();
+ void wait_for(volatile const bool& b);
SplitPoint splitPoints[MAX_SPLITPOINTS_PER_THREAD];
- MaterialTable materialTable;
- PawnTable pawnTable;
+ Material::Table materialTable;
+ Endgames endgames;
+ Pawns::Table pawnsTable;
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;
};
+struct TimerThread : public Thread {
+ TimerThread() : msec(0) {}
+ virtual void idle_loop();
+ int msec;
+};
+
+struct MainThread : public Thread {
+ MainThread() : is_finished(false) {} // Avoid a race with start_searching()
+ virtual void idle_loop();
+ volatile bool is_finished;
+};
+
/// ThreadPool class handles all the threads related stuff like init, starting,
/// parking and, the most important, launching a slave thread at a split point.
class ThreadPool {
public:
- void init(); // No c'tor, Threads object is global and engine shall be fully initialized
- ~ThreadPool();
+ 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]; }
+ MainThread* main_thread() { return static_cast<MainThread*>(threads[0]); }
+ TimerThread* timer_thread() { return timer; }
- 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<Move>&, Search::StateStackPtr&);
template <bool Fake>
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);
+ Depth depth, Move threatMove, int moveCount, MovePicker& mp, int nodeType);
private:
friend class Thread;
+ friend struct MainThread;
+ friend void check_time();
std::vector<Thread*> threads;
- Thread* timer;
+ TimerThread* timer;
Mutex mutex;
ConditionVariable sleepCondition;
Depth minimumSplitDepth;
int maxThreadsPerSplitPoint;
- bool useSleepingThreads;
+public:
+ bool sleepWhileIdle;
};
extern ThreadPool Threads;