struct Thread;
const size_t MAX_THREADS = 128;
-const size_t MAX_SPLITPOINTS_PER_THREAD = 8;
-const size_t MAX_SLAVES_PER_SPLITPOINT = 4;
-
-class Spinlock {
-
- 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)
- for (int cnt = 0; lock.load(std::memory_order_relaxed) <= 0; ++cnt)
- if (cnt >= 10000) std::this_thread::yield(); // Be nice to hyperthreading
- }
- void release() { lock.store(1, std::memory_order_release); }
-};
-
-
-/// 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;
- Search::Stack* ss;
- Thread* master;
- Depth depth;
- Value beta;
- int nodeType;
- bool cutNode;
-
- // Const pointers to shared data
- MovePicker* movePicker;
- SplitPoint* parentSplitPoint;
-
- // Shared variable data
- Spinlock spinlock;
- std::bitset<MAX_THREADS> slavesMask;
- volatile bool allSlavesSearching;
- volatile uint64_t nodes;
- volatile Value alpha;
- volatile Value bestValue;
- volatile Move bestMove;
- volatile int moveCount;
- volatile bool cutoff;
-};
/// ThreadBase struct is the base of the hierarchy from where we derive all the
virtual ~ThreadBase() = default;
virtual void idle_loop() = 0;
void notify_one();
- void wait_for(volatile const bool& b);
+ void wait(volatile const bool& b);
+ void wait_while(volatile const bool& b);
Mutex mutex;
- Spinlock spinlock;
ConditionVariable sleepCondition;
volatile bool exit = false;
};
Thread();
virtual void idle_loop();
- bool cutoff_occurred() const;
- 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);
+ void search(bool isMainThread = false);
- SplitPoint splitPoints[MAX_SPLITPOINTS_PER_THREAD];
Pawns::Table pawnsTable;
Material::Table materialTable;
Endgames endgames;
- Position* activePosition;
- size_t idx;
+ size_t idx, PVIdx;
int maxPly;
- SplitPoint* volatile activeSplitPoint;
- volatile size_t splitPointsSize;
volatile bool searching;
+
+ Position rootPos;
+ Search::RootMoveVector rootMoves;
+ Search::Stack stack[MAX_PLY+4];
+ HistoryStats History;
+ MovesStats Countermoves;
+ Depth depth;
};
struct MainThread : public Thread {
virtual void idle_loop();
void join();
+ void think();
volatile bool thinking = true; // Avoid a race with start_thinking()
};
MainThread* main() { return static_cast<MainThread*>(at(0)); }
void read_uci_options();
- Thread* available_slave(const SplitPoint* sp) const;
void start_thinking(const Position&, const Search::LimitsType&, Search::StateStackPtr&);
-
- Depth minimumSplitDepth;
+ int64_t nodes_searched();
TimerThread* timer;
};