- && threadID != tsp->master
- && !Threads[tsp->master].is_searching)
- Threads[tsp->master].wake_up();
- }
-
- // If this thread is the master of a split point and all slaves have
- // finished their work at this split point, return from the idle loop.
- if (sp && Threads.split_point_finished(sp))
- {
- // Because sp->is_slave[] is reset under lock protection,
- // be sure sp->lock has been released before to return.
- lock_grab(&(sp->lock));
- lock_release(&(sp->lock));
- return;
+ && this != sp->master
+ && !sp->master->is_searching)
+ sp->master->wake_up();
+
+ // After releasing the lock we cannot access anymore any SplitPoint
+ // related data in a safe way becuase it could have been released under
+ // our feet by the sp master. Also accessing other Thread objects is
+ // unsafe because if we are exiting there is a chance are already freed.
+ lock_release(sp->lock);
+
+ // Try to reparent to another split point
+ for (int i = 0; i < Threads.size(); i++)
+ {
+ Thread* th = &Threads[i];
+ int spCnt = th->splitPointsCnt;
+ SplitPoint* latest = &th->splitPoints[spCnt ? spCnt - 1 : 0];
+
+ // Find the first split point with still all slaves running
+ // where we are available as a possible slave.
+ if ( this->is_available_to(th)
+ && spCnt > 0
+ && !latest->cutoff
+ && latest->slavesMask == latest->allSlavesMask
+ && more_than_one(latest->allSlavesMask))
+ {
+ lock_grab(latest->lock);
+ lock_grab(Threads.splitLock);
+
+ // Retest all under lock protection, we are in the middle
+ // of a race storm here !
+ if ( this->is_available_to(th)
+ && spCnt == th->splitPointsCnt
+ && !latest->cutoff
+ && latest->slavesMask == latest->allSlavesMask
+ && more_than_one(latest->allSlavesMask))
+ {
+ latest->slavesMask |= 1ULL << idx; // allSlavesMask is not updated
+ curSplitPoint = latest;
+ is_searching = true;
+ }
+
+ lock_release(Threads.splitLock);
+ lock_release(latest->lock);
+
+ break; // Exit anyhow, only one try (enough in 99% of cases)
+ }
+ }