Codying style in accurate PV

[stockfish] / src / search.h

diff --git a/src/search.h b/src/search.h
index 4fe5a5b4f60bfd41a528781f5d0dff74137e607b..a399beba9a6069ebedeccc619a82f8fbc8457fed 100644 (file)
--- a/src/search.h
+++ b/src/search.h
@@ -38,6 +38,7 @@ namespace Search {
 
 struct Stack {
   SplitPoint* splitPoint;
+  Move* pv;
   int ply;
   Move currentMove;
   Move ttMove;
@@ -62,7 +63,6 @@ struct RootMove {
   bool operator<(const RootMove& m) const { return score > m.score; } // Ascending sort
   bool operator==(const Move& m) const { return pv[0] == m; }
 
-  void extract_pv_from_tt(Position& pos);
   void insert_pv_in_tt(Position& pos);
 
   Value score;
@@ -78,13 +78,14 @@ struct RootMove {
 struct LimitsType {
 
   LimitsType() { // Using memset on a std::vector is undefined behavior
-    time[WHITE] = time[BLACK] = inc[WHITE] = inc[BLACK] = movestogo =
-    depth = nodes = movetime = mate = infinite = ponder = 0;
+    nodes = time[WHITE] = time[BLACK] = inc[WHITE] = inc[BLACK] = movestogo =
+    depth = movetime = mate = infinite = ponder = 0;
   }
   bool use_time_management() const { return !(mate | movetime | depth | nodes | infinite); }
 
   std::vector<Move> searchmoves;
-  int time[COLOR_NB], inc[COLOR_NB], movestogo, depth, nodes, movetime, mate, infinite, ponder;
+  int time[COLOR_NB], inc[COLOR_NB], movestogo, depth, movetime, mate, infinite, ponder;
+  int64_t nodes;
 };
 
 
@@ -104,8 +105,8 @@ extern Position RootPos;
 extern Time::point SearchTime;
 extern StateStackPtr SetupStates;
 
-extern void init();
-extern void think();
+void init();
+void think();
 template<bool Root> uint64_t perft(Position& pos, Depth depth);
 
 } // namespace Search