Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
- Copyright (C) 2015-2016 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
+ Copyright (C) 2015-2017 Marco Costalba, Joona Kiiski, Gary Linscott, 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 "search.h"
#include "thread.h"
#include "uci.h"
+#include "syzygy/tbprobe.h"
ThreadPool Threads; // Global object
Thread::Thread() {
- resetCalls = exit = false;
- maxPly = callsCnt = 0;
- history.clear();
- counterMoves.clear();
+ exit = false;
+ selDepth = 0;
+ nodes = tbHits = 0;
idx = Threads.size(); // Start from 0
std::unique_lock<Mutex> lk(mutex);
}
-/// Thread::wait() waits on sleep condition until condition is true
-
-void Thread::wait(std::atomic_bool& condition) {
-
- std::unique_lock<Mutex> lk(mutex);
- sleepCondition.wait(lk, [&]{ return bool(condition); });
-}
-
-
/// Thread::start_searching() wakes up the thread that will start the search
-void Thread::start_searching(bool resume) {
+void Thread::start_searching() {
std::unique_lock<Mutex> lk(mutex);
-
- if (!resume)
- searching = true;
-
+ searching = true;
sleepCondition.notify_one();
}
void Thread::idle_loop() {
+ WinProcGroup::bindThisThread(idx);
+
while (!exit)
{
std::unique_lock<Mutex> lk(mutex);
void ThreadPool::init() {
- push_back(new MainThread);
+ push_back(new MainThread());
read_uci_options();
}
assert(requested > 0);
while (size() < requested)
- push_back(new Thread);
+ push_back(new Thread());
while (size() > requested)
delete back(), pop_back();
/// ThreadPool::nodes_searched() returns the number of nodes searched
-int64_t ThreadPool::nodes_searched() {
+uint64_t ThreadPool::nodes_searched() const {
- int64_t nodes = 0;
+ uint64_t nodes = 0;
for (Thread* th : *this)
- nodes += th->rootPos.nodes_searched();
+ nodes += th->nodes.load(std::memory_order_relaxed);
return nodes;
}
+/// ThreadPool::tb_hits() returns the number of TB hits
+
+uint64_t ThreadPool::tb_hits() const {
+
+ uint64_t hits = 0;
+ for (Thread* th : *this)
+ hits += th->tbHits.load(std::memory_order_relaxed);
+ return hits;
+}
+
+
/// ThreadPool::start_thinking() wakes up the main thread sleeping in idle_loop()
/// and starts a new search, then returns immediately.
-void ThreadPool::start_thinking(const Position& pos, StateListPtr& states,
- const Search::LimitsType& limits) {
+void ThreadPool::start_thinking(Position& pos, StateListPtr& states,
+ const Search::LimitsType& limits, bool ponderMode) {
main()->wait_for_search_finished();
- Search::Signals.stopOnPonderhit = Search::Signals.stop = false;
+ stopOnPonderhit = stop = false;
+ ponder = ponderMode;
Search::Limits = limits;
Search::RootMoves rootMoves;
|| std::count(limits.searchmoves.begin(), limits.searchmoves.end(), m))
rootMoves.push_back(Search::RootMove(m));
+ if (!rootMoves.empty())
+ Tablebases::filter_root_moves(pos, rootMoves);
+
// After ownership transfer 'states' becomes empty, so if we stop the search
// and call 'go' again without setting a new position states.get() == NULL.
assert(states.get() || setupStates.get());
for (Thread* th : Threads)
{
- th->maxPly = 0;
+ th->nodes = 0;
+ th->tbHits = 0;
th->rootDepth = DEPTH_ZERO;
th->rootMoves = rootMoves;
th->rootPos.set(pos.fen(), pos.is_chess960(), &setupStates->back(), th);