2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2012 Marco Costalba, Joona Kiiski, Tord Romstad
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
20 #if !defined(THREAD_H_INCLUDED)
21 #define THREAD_H_INCLUDED
31 const int MAX_THREADS = 32;
32 const int MAX_SPLITPOINTS_PER_THREAD = 8;
38 // Const data after split point has been setup
40 const Search::Stack* ss;
47 // Const pointers to shared data
53 volatile uint64_t slavesMask;
54 volatile int64_t nodes;
56 volatile Value bestValue;
57 volatile Move bestMove;
58 volatile int moveCount;
63 /// Thread struct keeps together all the thread related stuff like locks, state
64 /// and especially split points. We also use per-thread pawn and material hash
65 /// tables so that once we get a pointer to an entry its life time is unlimited
66 /// and we don't have to care about someone changing the entry under our feet.
70 typedef void (Thread::* Fn) (); // Pointer to member function
77 bool cutoff_occurred() const;
78 bool is_available_to(Thread* master) const;
82 void wait_for_stop_or_ponderhit();
84 SplitPoint splitPoints[MAX_SPLITPOINTS_PER_THREAD];
85 MaterialTable materialTable;
90 WaitCondition sleepCond;
93 SplitPoint* volatile curSplitPoint;
94 volatile int splitPointsCnt;
95 volatile bool is_searching;
96 volatile bool do_sleep;
97 volatile bool do_exit;
101 /// ThreadPool class handles all the threads related stuff like init, starting,
102 /// parking and, the most important, launching a slave thread at a split point.
103 /// All the access to shared thread data is done through this class.
108 void init(); // No c'tor, Threads object is global and engine shall be fully initialized
111 Thread& operator[](int id) { return *threads[id]; }
112 bool use_sleeping_threads() const { return useSleepingThreads; }
113 int min_split_depth() const { return minimumSplitDepth; }
114 size_t size() const { return threads.size(); }
115 Thread* main_thread() { return threads[0]; }
117 void wake_up() const;
119 void read_uci_options();
120 bool available_slave_exists(Thread* master) const;
121 void set_timer(int msec);
122 void wait_for_search_finished();
123 void start_searching(const Position& pos, const Search::LimitsType& limits,
124 const std::vector<Move>& searchMoves);
127 Value split(Position& pos, Search::Stack* ss, Value alpha, Value beta, Value bestValue, Move* bestMove,
128 Depth depth, Move threatMove, int moveCount, MovePicker* mp, int nodeType);
132 std::vector<Thread*> threads;
135 WaitCondition sleepCond;
136 Depth minimumSplitDepth;
137 int maxThreadsPerSplitPoint;
138 bool useSleepingThreads;
141 extern ThreadPool Threads;
143 #endif // !defined(THREAD_H_INCLUDED)