X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.h;h=c081d527e02f61a992ff2b8261fd34db1167f1ef;hp=db9bef3c69fec6bed8d21a0386a08972321b7160;hb=a4551c59e063dfb5dc429fd70dee1ae51ea50fdd;hpb=007285be2da7b77916d74f092e07de73bd1655ed

diff --git a/src/search.h b/src/search.h
index db9bef3c..c081d527 100644
--- a/src/search.h
+++ b/src/search.h
@@ -47,6 +47,7 @@ const int KILLER_MAX = 2;
 /// 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 SearchStack {
   Move pv[PLY_MAX_PLUS_2];
@@ -66,8 +67,9 @@ struct SearchStack {
 //// Prototypes
 ////
 
+extern void init_search();
 extern void init_threads();
-extern void stop_threads();
+extern void exit_threads();
 extern bool think(const Position &pos, bool infinite, bool ponder, int side_to_move,
                   int time[], int increment[], int movesToGo, int maxDepth,
                   int maxNodes, int maxTime, Move searchMoves[]);