const size_t MAX_SPLITPOINTS_PER_THREAD = 8;
const size_t MAX_SLAVES_PER_SPLITPOINT = 4;
+class Spinlock {
+
+ std::atomic_int lock;
+
+public:
+ Spinlock() { lock = 1; } // Init here to workaround a bug with MSVC 2013
+ void acquire() {
+ while (lock.fetch_sub(1, std::memory_order_acquire) != 1)
+ while (lock.load(std::memory_order_relaxed) <= 0)
+ std::this_thread::yield(); // Be nice to hyperthreading
+ }
+ void release() { lock.store(1, std::memory_order_release); }
+};
+
/// SplitPoint struct stores information shared by the threads searching in
/// parallel below the same split point. It is populated at splitting time.
SplitPoint* parentSplitPoint;
// Shared variable data
- Mutex mutex;
+ Spinlock spinlock;
std::bitset<MAX_THREADS> slavesMask;
volatile bool allSlavesSearching;
volatile uint64_t nodes;
/// ThreadBase struct is the base of the hierarchy from where we derive all the
/// specialized thread classes.
-struct ThreadBase {
+struct ThreadBase : public std::thread {
virtual ~ThreadBase() = default;
virtual void idle_loop() = 0;
void notify_one();
void wait_for(volatile const bool& b);
- std::thread nativeThread;
Mutex mutex;
+ Spinlock spinlock;
ConditionVariable sleepCondition;
volatile bool exit = false;
};
struct MainThread : public Thread {
virtual void idle_loop();
+ void join();
volatile bool thinking = true; // Avoid a race with start_thinking()
};
MainThread* main() { return static_cast<MainThread*>(at(0)); }
void read_uci_options();
Thread* available_slave(const SplitPoint* sp) const;
- void wait_for_think_finished();
void start_thinking(const Position&, const Search::LimitsType&, Search::StateStackPtr&);
Depth minimumSplitDepth;
- Mutex mutex;
- ConditionVariable sleepCondition;
TimerThread* timer;
};