/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2014 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
#include "position.h"
#include "search.h"
+struct Thread;
+
const int MAX_THREADS = 128;
const int MAX_SPLITPOINTS_PER_THREAD = 8;
+const size_t MAX_SLAVES_PER_SPLITPOINT = 4;
+
+/// Mutex and ConditionVariable struct are wrappers of the low level locking
+/// machinery and are modeled after the corresponding C++11 classes.
struct Mutex {
Mutex() { lock_init(l); }
WaitCondition c;
};
-struct Thread;
+
+/// 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* masterThread;
Depth depth;
Value beta;
MovePicker* movePicker;
SplitPoint* parentSplitPoint;
- // Shared data
+ // Shared variable data
Mutex mutex;
std::bitset<MAX_THREADS> slavesMask;
+ volatile bool allSlavesSearching;
volatile uint64_t nodes;
volatile Value alpha;
volatile Value bestValue;
bool cutoff_occurred() const;
bool available_to(const Thread* master) const;
- template <bool Fake>
- void split(Position& pos, const Search::Stack* ss, Value alpha, Value beta, Value* bestValue, Move* bestMove,
+ 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];
+ Pawns::Table pawnsTable;
Material::Table materialTable;
Endgames endgames;
- Pawns::Table pawnsTable;
Position* activePosition;
size_t idx;
int maxPly;
};
struct TimerThread : public ThreadBase {
+
+ static const int Resolution = 5; // Millisec between two check_time() calls
+
TimerThread() : run(false) {}
virtual void idle_loop();
+
bool run;
- static const int Resolution = 5; // msec between two check_time() calls
};
struct ThreadPool : public std::vector<Thread*> {
- void init(); // No c'tor and d'tor, threads rely on globals that should
- void exit(); // be initialized and are valid during the whole thread lifetime.
+ 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<MainThread*>((*this)[0]); }
+ MainThread* main() { return static_cast<MainThread*>(at(0)); }
void read_uci_options();
Thread* available_slave(const Thread* master) const;
void wait_for_think_finished();
void start_thinking(const Position&, const Search::LimitsType&, Search::StateStackPtr&);
- bool sleepWhileIdle;
Depth minimumSplitDepth;
Mutex mutex;
ConditionVariable sleepCondition;