X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fthread.h;h=cc490639ed4f4c8bb23a400166a840fa10a9ec86;hp=e5a198c88e764902d74ff6f509c4ef4075cefbb5;hb=103b368ab7f5fd696e0c6925917344d15a3c2d9c;hpb=339e1b49f619ceffa75019e196adf4de74b32cce diff --git a/src/thread.h b/src/thread.h index e5a198c8..cc490639 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-2010 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2008-2012 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 @@ -21,12 +21,14 @@ #define THREAD_H_INCLUDED #include +#include #include "lock.h" #include "material.h" #include "movepick.h" #include "pawns.h" #include "position.h" +#include "search.h" const int MAX_THREADS = 32; const int MAX_ACTIVE_SPLIT_POINTS = 8; @@ -37,15 +39,15 @@ struct SplitPoint { SplitPoint* parent; const Position* pos; Depth depth; - bool pvNode; Value beta; + int nodeType; int ply; int master; Move threatMove; // Const pointers to shared data MovePicker* mp; - SearchStack* ss; + Search::Stack* ss; // Shared data Lock lock; @@ -53,48 +55,49 @@ struct SplitPoint { volatile Value alpha; volatile Value bestValue; volatile int moveCount; - volatile bool betaCutoff; - volatile int slaves[MAX_THREADS]; -}; - -// ThreadState type is used to represent thread's current state -enum ThreadState -{ - THREAD_INITIALIZING, // thread is initializing itself - THREAD_SEARCHING, // thread is performing work - THREAD_AVAILABLE, // thread is waiting for work - THREAD_BOOKED, // other thread (master) has booked us as a slave - THREAD_WORKISWAITING, // master has ordered us to start - THREAD_TERMINATED // we are quitting and thread is terminated + volatile bool is_betaCutoff; + volatile bool is_slave[MAX_THREADS]; }; -// 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. +/// 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. struct Thread { + + void wake_up(); + bool cutoff_occurred() const; + bool is_available_to(int master) const; + void idle_loop(SplitPoint* sp); + void main_loop(); + void timer_loop(); + + SplitPoint splitPoints[MAX_ACTIVE_SPLIT_POINTS]; MaterialInfoTable materialTable; PawnInfoTable pawnTable; + int threadID; int maxPly; Lock sleepLock; WaitCondition sleepCond; - volatile ThreadState state; SplitPoint* volatile splitPoint; volatile int activeSplitPoints; - SplitPoint splitPoints[MAX_ACTIVE_SPLIT_POINTS]; - - void wake_up() { - lock_grab(&sleepLock); - cond_signal(&sleepCond); - lock_release(&sleepLock); - } + volatile bool is_searching; + volatile bool do_sleep; + volatile bool do_terminate; + +#if defined(_MSC_VER) + HANDLE handle; +#else + pthread_t handle; +#endif }; -// ThreadsManager class is used to handle 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. +/// ThreadsManager 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. class ThreadsManager { /* As long as the single ThreadsManager object is defined as a global we don't @@ -103,33 +106,38 @@ class ThreadsManager { */ public: Thread& operator[](int threadID) { return threads[threadID]; } - void init_threads(); - void exit_threads(); - void init_hash_tables(); + void init(); + void exit(); + bool use_sleeping_threads() const { return useSleepingThreads; } int min_split_depth() const { return minimumSplitDepth; } - int active_threads() const { return activeThreads; } - void set_active_threads(int cnt) { activeThreads = cnt; } + int size() const { return activeThreads; } + void set_size(int cnt); void read_uci_options(); - bool available_thread_exists(int master) const; - bool thread_is_available(int slave, int master) const; - bool cutoff_at_splitpoint(int threadID) const; - void idle_loop(int threadID, SplitPoint* sp); + bool available_slave_exists(int master) const; + bool split_point_finished(SplitPoint* sp) const; + void set_timer(int msec); + void wait_for_stop_or_ponderhit(); + void stop_thinking(); + void start_thinking(const Position& pos, const Search::LimitsType& limits, + const std::set& = std::set(), bool async = false); template - void split(Position& pos, SearchStack* ss, Value* alpha, const Value beta, Value* bestValue, - Depth depth, Move threatMove, int moveCount, MovePicker* mp, bool pvNode); + Value split(Position& pos, Search::Stack* ss, Value alpha, Value beta, Value bestValue, + Depth depth, Move threatMove, int moveCount, MovePicker* mp, int nodeType); private: - Lock mpLock; + friend struct Thread; + + Thread threads[MAX_THREADS + 1]; // Last one is used as a timer + Lock threadsLock; Depth minimumSplitDepth; int maxThreadsPerSplitPoint; - bool useSleepingThreads; int activeThreads; - volatile bool allThreadsShouldExit; - Thread threads[MAX_THREADS]; + bool useSleepingThreads; + WaitCondition sleepCond; }; -extern ThreadsManager ThreadsMgr; +extern ThreadsManager Threads; #endif // !defined(THREAD_H_INCLUDED)