kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-05-06 03:19:36 +00:00
Code Issues Releases Wiki Activity

Remove dcCandidates data member from SplitPoint

Browse source 
It is no more used now that we have CheckInfo.

No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba 2009-11-12 16:55:31 +01:00
parent bf395c6be1
commit 5e340346db
2 changed files with 6 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

13
src/search.cpp
View file

@ -310,7 +310,7 @@ namespace {
Value *alpha, Value *beta, Value *bestValue, Value *alpha, Value *beta, Value *bestValue,
const Value futilityValue, const Value approximateValue, const Value futilityValue, const Value approximateValue,
Depth depth, int *moves, Depth depth, int *moves,
MovePicker *mp, Bitboard dcCandidates, int master, bool pvNode); MovePicker *mp, int master, bool pvNode);
void wake_sleeping_threads(); void wake_sleeping_threads();
#if !defined(_MSC_VER) #if !defined(_MSC_VER)
@ -1209,8 +1209,8 @@ namespace {
&& idle_thread_exists(threadID) && idle_thread_exists(threadID)
&& !AbortSearch && !AbortSearch
&& !thread_should_stop(threadID) && !thread_should_stop(threadID)
&& split(pos, ss, ply, &alpha, &beta, &bestValue, VALUE_NONE, VALUE_NONE, depth, && split(pos, ss, ply, &alpha, &beta, &bestValue, VALUE_NONE, VALUE_NONE,
&moveCount, &mp, ci.dcCandidates, threadID, true)) depth, &moveCount, &mp, threadID, true))
break; break;
} }
@ -1470,8 +1470,8 @@ namespace {
&& idle_thread_exists(threadID) && idle_thread_exists(threadID)
&& !AbortSearch && !AbortSearch
&& !thread_should_stop(threadID) && !thread_should_stop(threadID)
&& split(pos, ss, ply, &beta, &beta, &bestValue, futilityValue, approximateEval, depth, &moveCount, && split(pos, ss, ply, &beta, &beta, &bestValue, futilityValue, approximateEval,
&mp, ci.dcCandidates, threadID, false)) depth, &moveCount, &mp, threadID, false))
break; break;
} }
@ -2815,7 +2815,7 @@ namespace {
bool split(const Position& p, SearchStack* sstck, int ply, bool split(const Position& p, SearchStack* sstck, int ply,
Value* alpha, Value* beta, Value* bestValue, const Value futilityValue, Value* alpha, Value* beta, Value* bestValue, const Value futilityValue,
const Value approximateEval, Depth depth, int* moves, const Value approximateEval, Depth depth, int* moves,
MovePicker* mp, Bitboard dcCandidates, int master, bool pvNode) { MovePicker* mp, int master, bool pvNode) {
assert(p.is_ok()); assert(p.is_ok());
assert(sstck != NULL); assert(sstck != NULL);
@ -2852,7 +2852,6 @@ namespace {
splitPoint->alpha = pvNode? *alpha : (*beta - 1); splitPoint->alpha = pvNode? *alpha : (*beta - 1);
splitPoint->beta = *beta; splitPoint->beta = *beta;
splitPoint->pvNode = pvNode; splitPoint->pvNode = pvNode;
splitPoint->dcCandidates = dcCandidates;
splitPoint->bestValue = *bestValue; splitPoint->bestValue = *bestValue;
splitPoint->futilityValue = futilityValue; splitPoint->futilityValue = futilityValue;
splitPoint->approximateEval = approximateEval; splitPoint->approximateEval = approximateEval;

1
src/thread.h
View file

@ -53,7 +53,6 @@ struct SplitPoint {
volatile Value alpha, beta, bestValue, futilityValue; volatile Value alpha, beta, bestValue, futilityValue;
Value approximateEval; Value approximateEval;
bool pvNode; bool pvNode;
Bitboard dcCandidates;
int master, slaves[THREAD_MAX]; int master, slaves[THREAD_MAX];
Lock lock; Lock lock;
MovePicker *mp; MovePicker *mp;