mirror of
https://github.com/sockspls/badfish
synced 2025-04-30 16:53:09 +00:00
Rename SplitPoint parentSstack
Now that we don't have anymore a search stack array in SplitPoint we can rename this data member to somthing more usual. No functional change. Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
parent
823a5918e7
commit
706b44a966
2 changed files with 5 additions and 5 deletions
|
@ -1218,7 +1218,7 @@ split_point_start: // At split points actual search starts from here
|
||||||
ss->bestMove = move;
|
ss->bestMove = move;
|
||||||
|
|
||||||
if (SpNode)
|
if (SpNode)
|
||||||
sp->parentSstack->bestMove = move;
|
sp->ss->bestMove = move;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -2116,7 +2116,7 @@ split_point_start: // At split points actual search starts from here
|
||||||
SplitPoint* tsp = threads[threadID].splitPoint;
|
SplitPoint* tsp = threads[threadID].splitPoint;
|
||||||
Position pos(*tsp->pos, threadID);
|
Position pos(*tsp->pos, threadID);
|
||||||
|
|
||||||
memcpy(ss, tsp->parentSstack - 1, 4 * sizeof(SearchStack));
|
memcpy(ss, tsp->ss - 1, 4 * sizeof(SearchStack));
|
||||||
(ss+1)->sp = tsp;
|
(ss+1)->sp = tsp;
|
||||||
|
|
||||||
if (tsp->pvNode)
|
if (tsp->pvNode)
|
||||||
|
@ -2367,7 +2367,7 @@ split_point_start: // At split points actual search starts from here
|
||||||
splitPoint.moveCount = moveCount;
|
splitPoint.moveCount = moveCount;
|
||||||
splitPoint.pos = &pos;
|
splitPoint.pos = &pos;
|
||||||
splitPoint.nodes = 0;
|
splitPoint.nodes = 0;
|
||||||
splitPoint.parentSstack = ss;
|
splitPoint.ss = ss;
|
||||||
for (i = 0; i < activeThreads; i++)
|
for (i = 0; i < activeThreads; i++)
|
||||||
splitPoint.slaves[i] = 0;
|
splitPoint.slaves[i] = 0;
|
||||||
|
|
||||||
|
@ -2394,7 +2394,7 @@ split_point_start: // At split points actual search starts from here
|
||||||
lock_release(&mpLock);
|
lock_release(&mpLock);
|
||||||
|
|
||||||
// Tell the threads that they have work to do. This will make them leave
|
// Tell the threads that they have work to do. This will make them leave
|
||||||
// their idle loop. But before copy search stack tail for each thread.
|
// their idle loop.
|
||||||
for (i = 0; i < activeThreads; i++)
|
for (i = 0; i < activeThreads; i++)
|
||||||
if (i == master || splitPoint.slaves[i])
|
if (i == master || splitPoint.slaves[i])
|
||||||
{
|
{
|
||||||
|
|
|
@ -60,7 +60,7 @@ struct SplitPoint {
|
||||||
|
|
||||||
// Const pointers to shared data
|
// Const pointers to shared data
|
||||||
MovePicker* mp;
|
MovePicker* mp;
|
||||||
SearchStack* parentSstack;
|
SearchStack* ss;
|
||||||
|
|
||||||
// Shared data
|
// Shared data
|
||||||
Lock lock;
|
Lock lock;
|
||||||
|
|
Loading…
Add table
Reference in a new issue