X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fthread.h;h=1397449733d8f7eebbc303ce879ff1dc7954b7ff;hp=75fa95b2f30270a944fe63f66c1d4021dbad95fb;hb=1b6459195c82395d861cddf3f2056ed1c9a3bd5b;hpb=df6cb446eaf21c5d07bbd15496da0471aff6ab3f diff --git a/src/thread.h b/src/thread.h index 75fa95b2..13974497 100644 --- a/src/thread.h +++ b/src/thread.h @@ -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-2017 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad + Copyright (C) 2015-2018 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 @@ -52,6 +52,7 @@ public: explicit Thread(size_t); virtual ~Thread(); virtual void search(); + void clear(); void idle_loop(); void start_searching(); void wait_for_search_finished(); @@ -60,7 +61,7 @@ public: Material::Table materialTable; Endgames endgames; size_t PVIdx; - int selDepth; + int selDepth, nmp_ply, nmp_odd; std::atomic nodes, tbHits; Position rootPos; @@ -68,6 +69,7 @@ public: Depth rootDepth, completedDepth; CounterMoveHistory counterMoves; ButterflyHistory mainHistory; + CapturePieceToHistory captureHistory; ContinuationHistory contHistory; }; @@ -78,11 +80,11 @@ struct MainThread : public Thread { using Thread::Thread; - virtual void search(); + void search() override; void check_time(); - bool easyMovePlayed, failedLow; - double bestMoveChanges; + bool failedLow; + double bestMoveChanges, previousTimeReduction; Value previousScore; int callsCnt; }; @@ -94,9 +96,8 @@ struct MainThread : public Thread { struct ThreadPool : public std::vector { - void init(size_t); // No constructor and destructor, threads rely on globals that should - void exit(); // be initialized and valid during the whole thread lifetime. void start_thinking(Position&, StateListPtr&, const Search::LimitsType&, bool = false); + void clear(); void set(size_t); MainThread* main() const { return static_cast(front()); }