/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
- volatile uint64_t slavesMask;
- volatile int64_t nodes;
+ std::bitset<MAX_THREADS> slavesMask;
+ volatile bool allSlavesSearching;
+ volatile uint64_t nodes;
- template <bool Fake>
- void split(Position& pos, const Search::Stack* ss, Value alpha, Value beta, Value* bestValue, Move* bestMove,
+ void split(Position& pos, Search::Stack* ss, Value alpha, Value beta, Value* bestValue, Move* bestMove,
Depth depth, int moveCount, MovePicker* movePicker, int nodeType, bool cutNode);
SplitPoint splitPoints[MAX_SPLITPOINTS_PER_THREAD];
Depth depth, int moveCount, MovePicker* movePicker, int nodeType, bool cutNode);
SplitPoint splitPoints[MAX_SPLITPOINTS_PER_THREAD];
- void init(); // No c'tor and d'tor, threads rely on globals that should
- void exit(); // be initialized and are valid during the whole thread lifetime.
+ void init(); // No c'tor and d'tor, threads rely on globals that should be
+ void exit(); // initialized and are valid during the whole thread lifetime.
- void start_thinking(const Position&, const Search::LimitsType&,
- const std::vector<Move>&, Search::StateStackPtr&);
+ void start_thinking(const Position&, const Search::LimitsType&, Search::StateStackPtr&);