X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fthread.cpp;h=86fce6aa0c20020b6c54666c874a5231793d6c9e;hp=440b8bf0e4f06b5ea6087aa76c2e9aec3ca02cc0;hb=44236f4ed9844598e1cb065937c3770a938964b2;hpb=89723339d93c87f52e148080d5b1dc101ee76685 diff --git a/src/thread.cpp b/src/thread.cpp index 440b8bf0..86fce6aa 100644 --- a/src/thread.cpp +++ b/src/thread.cpp @@ -2,7 +2,7 @@ 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 @@ -25,8 +25,7 @@ #include "search.h" #include "thread.h" #include "uci.h" - -using namespace Search; +#include "syzygy/tbprobe.h" ThreadPool Threads; // Global object @@ -35,10 +34,9 @@ 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 lk(mutex); @@ -96,6 +94,8 @@ void Thread::start_searching(bool resume) { void Thread::idle_loop() { + WinProcGroup::bindThisThread(idx); + while (!exit) { std::unique_lock lk(mutex); @@ -123,7 +123,7 @@ void Thread::idle_loop() { void ThreadPool::init() { - push_back(new MainThread); + push_back(new MainThread()); read_uci_options(); } @@ -150,7 +150,7 @@ void ThreadPool::read_uci_options() { assert(requested > 0); while (size() < requested) - push_back(new Thread); + push_back(new Thread()); while (size() > requested) delete back(), pop_back(); @@ -159,38 +159,65 @@ void ThreadPool::read_uci_options() { /// 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, const LimitsType& limits, - StateStackPtr& states) { +void ThreadPool::start_thinking(Position& pos, StateListPtr& states, + const Search::LimitsType& limits) { main()->wait_for_search_finished(); - Signals.stopOnPonderhit = Signals.stop = false; - - main()->rootMoves.clear(); - main()->rootPos = pos; - Limits = limits; - if (states.get()) // If we don't set a new position, preserve current state - { - SetupStates = std::move(states); // Ownership transfer here - assert(!states.get()); - } + stopOnPonderhit = stop = false; + Search::Limits = limits; + Search::RootMoves rootMoves; for (const auto& m : MoveList(pos)) if ( limits.searchmoves.empty() || std::count(limits.searchmoves.begin(), limits.searchmoves.end(), m)) - main()->rootMoves.push_back(RootMove(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()); + + if (states.get()) + setupStates = std::move(states); // Ownership transfer, states is now empty + + StateInfo tmp = setupStates->back(); + + for (Thread* th : Threads) + { + th->nodes = 0; + th->tbHits = 0; + th->rootDepth = DEPTH_ZERO; + th->rootMoves = rootMoves; + th->rootPos.set(pos.fen(), pos.is_chess960(), &setupStates->back(), th); + } + + setupStates->back() = tmp; // Restore st->previous, cleared by Position::set() main()->start_searching(); }