kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-05-01 09:13:08 +00:00
Code Issues Releases Wiki Activity

Clarify we don't late join with only 2 threads

Browse source 
Thanks to Gary for pointing this out.

No functional change.
This commit is contained in:
Marco Costalba 2015-02-19 23:12:59 +01:00
parent 950c8436ed
commit 667f350737
1 changed files with 3 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
src/search.cpp
View file

@ -1604,8 +1604,10 @@ void Thread::idle_loop() {
{ {
assert(this != Threads[i]); assert(this != Threads[i]);
assert(!(this_sp && this_sp->slavesMask.none())); assert(!(this_sp && this_sp->slavesMask.none()));
assert(Threads.size() > 2);
// Compute the recursive split points chain size // Prefer to join to SP with few parents to reduce the probability
// that a cut-off occurs above us, and hence we waste our work.
int level = -1; int level = -1;
for (SplitPoint* spp = Threads[i]->activeSplitPoint; spp; spp = spp->parentSplitPoint) for (SplitPoint* spp = Threads[i]->activeSplitPoint; spp; spp = spp->parentSplitPoint)
level++; level++;