Rewrite async I/O

[stockfish] / src / search.h

diff --git a/src/search.h b/src/search.h
index 9d3fb4ca355899bb7bcc100aa28b9ce5872c868c..3262c757cbe05aa4ff50e07ad3711ac3ec453aab 100644 (file)
--- a/src/search.h
+++ b/src/search.h
@@ -23,36 +23,49 @@
 #include "move.h"
 #include "types.h"
 
-const int PLY_MAX = 100;
-const int PLY_MAX_PLUS_2 = PLY_MAX + 2;
+#include <vector>
+
+class Position;
+struct SplitPoint;
 
 /// The SearchStack struct keeps track of the information we need to remember
 /// from nodes shallower and deeper in the tree during the search.  Each
 /// search thread has its own array of SearchStack objects, indexed by the
 /// current ply.
-struct EvalInfo;
-struct SplitPoint;
 
 struct SearchStack {
+  SplitPoint* sp;
+  int ply;
   Move currentMove;
-  Move mateKiller;
   Move excludedMove;
   Move bestMove;
   Move killers[2];
   Depth reduction;
   Value eval;
   Value evalMargin;
-  bool skipNullMove;
-  SplitPoint* sp;
+  int skipNullMove;
 };
 
-class Position;
+
+/// The SearchLimits struct stores information sent by GUI about available time
+/// to search the current move, maximum depth/time, if we are in analysis mode
+/// or if we have to ponder while is our opponent's side to move.
+
+struct SearchLimits {
+
+  bool useTimeManagement() const { return !(maxTime | maxDepth | maxNodes | infinite); }
+
+  int time, increment, movesToGo, maxTime, maxDepth, maxNodes, infinite, ponder;
+};
+
+extern SearchLimits Limits;
+extern std::vector<Move> SearchMoves;
+extern Position* RootPosition;
 
 extern void init_search();
-extern void init_threads();
-extern void exit_threads();
 extern int64_t perft(Position& pos, Depth depth);
-extern bool think(Position& pos, bool infinite, bool ponder, int time[], int increment[],
-                  int movesToGo, int maxDepth, int maxNodes, int maxTime, Move searchMoves[]);
+extern void think();
+extern void uci_async_command(const std::string& cmd);
+extern void do_timer_event();
 
 #endif // !defined(SEARCH_H_INCLUDED)