- // If we already have too many active split points, don't split
- if (masterThread.activeSplitPoints >= MAX_ACTIVE_SPLIT_POINTS)
- return bestValue;
-
- // Pick the next available split point from the split point stack
- SplitPoint* sp = &masterThread.splitPoints[masterThread.activeSplitPoints];
-
- // Initialize the split point
- sp->parent = masterThread.splitPoint;
- sp->master = master;
- sp->is_betaCutoff = false;
- sp->slavesMask = (1ULL << master);
- sp->depth = depth;
- sp->threatMove = threatMove;
- sp->alpha = alpha;
- sp->beta = beta;
- sp->nodeType = nodeType;
- sp->bestValue = bestValue;
- sp->mp = mp;
- sp->moveCount = moveCount;
- sp->pos = &pos;
- sp->nodes = 0;
- sp->ss = ss;
-
- // If we are here it means we are not available
- assert(masterThread.is_searching);
-
- int workersCnt = 1; // At least the master is included
-
- // Try to allocate available threads and ask them to start searching setting
- // is_searching flag. This must be done under lock protection to avoid concurrent
- // allocation of the same slave by another master.
- lock_grab(threadsLock);
- lock_grab(sp->lock); // To protect sp->slaves_mask
-
- for (i = 0; !Fake && i < activeThreads; i++)
- if (threads[i].is_available_to(master))
- {
- sp->slavesMask |= (1ULL << i);
- threads[i].splitPoint = sp;