2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2023 The Stockfish developers (see AUTHORS file)
5 Stockfish is free software: you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation, either version 3 of the License, or
8 (at your option) any later version.
10 Stockfish is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <http://www.gnu.org/licenses/>.
19 // A class that converts the input features of the NNUE evaluation function
21 #ifndef NNUE_FEATURE_TRANSFORMER_H_INCLUDED
22 #define NNUE_FEATURE_TRANSFORMER_H_INCLUDED
31 #include "../position.h"
33 #include "nnue_accumulator.h"
34 #include "nnue_architecture.h"
35 #include "nnue_common.h"
37 namespace Stockfish::Eval::NNUE {
39 using BiasType = std::int16_t;
40 using WeightType = std::int16_t;
41 using PSQTWeightType = std::int32_t;
43 // If vector instructions are enabled, we update and refresh the
44 // accumulator tile by tile such that each tile fits in the CPU's
48 static_assert(PSQTBuckets % 8 == 0,
49 "Per feature PSQT values cannot be processed at granularity lower than 8 at a time.");
52 using vec_t = __m512i;
53 using psqt_vec_t = __m256i;
54 #define vec_load(a) _mm512_load_si512(a)
55 #define vec_store(a,b) _mm512_store_si512(a,b)
56 #define vec_add_16(a,b) _mm512_add_epi16(a,b)
57 #define vec_sub_16(a,b) _mm512_sub_epi16(a,b)
58 #define vec_mul_16(a,b) _mm512_mullo_epi16(a,b)
59 #define vec_zero() _mm512_setzero_epi32()
60 #define vec_set_16(a) _mm512_set1_epi16(a)
61 #define vec_max_16(a,b) _mm512_max_epi16(a,b)
62 #define vec_min_16(a,b) _mm512_min_epi16(a,b)
63 inline vec_t vec_msb_pack_16(vec_t a, vec_t b){
64 vec_t compacted = _mm512_packs_epi16(_mm512_srli_epi16(a,7),_mm512_srli_epi16(b,7));
65 return _mm512_permutexvar_epi64(_mm512_setr_epi64(0, 2, 4, 6, 1, 3, 5, 7), compacted);
67 #define vec_load_psqt(a) _mm256_load_si256(a)
68 #define vec_store_psqt(a,b) _mm256_store_si256(a,b)
69 #define vec_add_psqt_32(a,b) _mm256_add_epi32(a,b)
70 #define vec_sub_psqt_32(a,b) _mm256_sub_epi32(a,b)
71 #define vec_zero_psqt() _mm256_setzero_si256()
72 #define NumRegistersSIMD 16
73 #define MaxChunkSize 64
76 using vec_t = __m256i;
77 using psqt_vec_t = __m256i;
78 #define vec_load(a) _mm256_load_si256(a)
79 #define vec_store(a,b) _mm256_store_si256(a,b)
80 #define vec_add_16(a,b) _mm256_add_epi16(a,b)
81 #define vec_sub_16(a,b) _mm256_sub_epi16(a,b)
82 #define vec_mul_16(a,b) _mm256_mullo_epi16(a,b)
83 #define vec_zero() _mm256_setzero_si256()
84 #define vec_set_16(a) _mm256_set1_epi16(a)
85 #define vec_max_16(a,b) _mm256_max_epi16(a,b)
86 #define vec_min_16(a,b) _mm256_min_epi16(a,b)
87 inline vec_t vec_msb_pack_16(vec_t a, vec_t b){
88 vec_t compacted = _mm256_packs_epi16(_mm256_srli_epi16(a,7), _mm256_srli_epi16(b,7));
89 return _mm256_permute4x64_epi64(compacted, 0b11011000);
91 #define vec_load_psqt(a) _mm256_load_si256(a)
92 #define vec_store_psqt(a,b) _mm256_store_si256(a,b)
93 #define vec_add_psqt_32(a,b) _mm256_add_epi32(a,b)
94 #define vec_sub_psqt_32(a,b) _mm256_sub_epi32(a,b)
95 #define vec_zero_psqt() _mm256_setzero_si256()
96 #define NumRegistersSIMD 16
97 #define MaxChunkSize 32
100 using vec_t = __m128i;
101 using psqt_vec_t = __m128i;
102 #define vec_load(a) (*(a))
103 #define vec_store(a,b) *(a)=(b)
104 #define vec_add_16(a,b) _mm_add_epi16(a,b)
105 #define vec_sub_16(a,b) _mm_sub_epi16(a,b)
106 #define vec_mul_16(a,b) _mm_mullo_epi16(a,b)
107 #define vec_zero() _mm_setzero_si128()
108 #define vec_set_16(a) _mm_set1_epi16(a)
109 #define vec_max_16(a,b) _mm_max_epi16(a,b)
110 #define vec_min_16(a,b) _mm_min_epi16(a,b)
111 #define vec_msb_pack_16(a,b) _mm_packs_epi16(_mm_srli_epi16(a,7),_mm_srli_epi16(b,7))
112 #define vec_load_psqt(a) (*(a))
113 #define vec_store_psqt(a,b) *(a)=(b)
114 #define vec_add_psqt_32(a,b) _mm_add_epi32(a,b)
115 #define vec_sub_psqt_32(a,b) _mm_sub_epi32(a,b)
116 #define vec_zero_psqt() _mm_setzero_si128()
117 #define NumRegistersSIMD (Is64Bit ? 16 : 8)
118 #define MaxChunkSize 16
121 using vec_t = int16x8_t;
122 using psqt_vec_t = int32x4_t;
123 #define vec_load(a) (*(a))
124 #define vec_store(a,b) *(a)=(b)
125 #define vec_add_16(a,b) vaddq_s16(a,b)
126 #define vec_sub_16(a,b) vsubq_s16(a,b)
127 #define vec_mul_16(a,b) vmulq_s16(a,b)
128 #define vec_zero() vec_t{0}
129 #define vec_set_16(a) vdupq_n_s16(a)
130 #define vec_max_16(a,b) vmaxq_s16(a,b)
131 #define vec_min_16(a,b) vminq_s16(a,b)
132 inline vec_t vec_msb_pack_16(vec_t a, vec_t b){
133 const int8x8_t shifta = vshrn_n_s16(a, 7);
134 const int8x8_t shiftb = vshrn_n_s16(b, 7);
135 const int8x16_t compacted = vcombine_s8(shifta,shiftb);
136 return *reinterpret_cast<const vec_t*> (&compacted);
138 #define vec_load_psqt(a) (*(a))
139 #define vec_store_psqt(a,b) *(a)=(b)
140 #define vec_add_psqt_32(a,b) vaddq_s32(a,b)
141 #define vec_sub_psqt_32(a,b) vsubq_s32(a,b)
142 #define vec_zero_psqt() psqt_vec_t{0}
143 #define NumRegistersSIMD 16
144 #define MaxChunkSize 16
154 // Compute optimal SIMD register count for feature transformer accumulation.
156 // We use __m* types as template arguments, which causes GCC to emit warnings
157 // about losing some attribute information. This is irrelevant to us as we
158 // only take their size, so the following pragma are harmless.
159 #if defined(__GNUC__)
160 #pragma GCC diagnostic push
161 #pragma GCC diagnostic ignored "-Wignored-attributes"
164 template <typename SIMDRegisterType,
168 static constexpr int BestRegisterCount()
170 #define RegisterSize sizeof(SIMDRegisterType)
171 #define LaneSize sizeof(LaneType)
173 static_assert(RegisterSize >= LaneSize);
174 static_assert(MaxRegisters <= NumRegistersSIMD);
175 static_assert(MaxRegisters > 0);
176 static_assert(NumRegistersSIMD > 0);
177 static_assert(RegisterSize % LaneSize == 0);
178 static_assert((NumLanes * LaneSize) % RegisterSize == 0);
180 const int ideal = (NumLanes * LaneSize) / RegisterSize;
181 if (ideal <= MaxRegisters)
184 // Look for the largest divisor of the ideal register count that is smaller than MaxRegisters
185 for (int divisor = MaxRegisters; divisor > 1; --divisor)
186 if (ideal % divisor == 0)
192 static constexpr int NumRegs = BestRegisterCount<vec_t, WeightType, TransformedFeatureDimensions, NumRegistersSIMD>();
193 static constexpr int NumPsqtRegs = BestRegisterCount<psqt_vec_t, PSQTWeightType, PSQTBuckets, NumRegistersSIMD>();
194 #if defined(__GNUC__)
195 #pragma GCC diagnostic pop
201 // Input feature converter
202 class FeatureTransformer {
205 // Number of output dimensions for one side
206 static constexpr IndexType HalfDimensions = TransformedFeatureDimensions;
209 static constexpr IndexType TileHeight = NumRegs * sizeof(vec_t) / 2;
210 static constexpr IndexType PsqtTileHeight = NumPsqtRegs * sizeof(psqt_vec_t) / 4;
211 static_assert(HalfDimensions % TileHeight == 0, "TileHeight must divide HalfDimensions");
212 static_assert(PSQTBuckets % PsqtTileHeight == 0, "PsqtTileHeight must divide PSQTBuckets");
217 using OutputType = TransformedFeatureType;
219 // Number of input/output dimensions
220 static constexpr IndexType InputDimensions = FeatureSet::Dimensions;
221 static constexpr IndexType OutputDimensions = HalfDimensions;
223 // Size of forward propagation buffer
224 static constexpr std::size_t BufferSize =
225 OutputDimensions * sizeof(OutputType);
227 // Hash value embedded in the evaluation file
228 static constexpr std::uint32_t get_hash_value() {
229 return FeatureSet::HashValue ^ (OutputDimensions * 2);
232 // Read network parameters
233 bool read_parameters(std::istream& stream) {
235 read_leb_128<BiasType >(stream, biases , HalfDimensions );
236 read_leb_128<WeightType >(stream, weights , HalfDimensions * InputDimensions);
237 read_leb_128<PSQTWeightType>(stream, psqtWeights, PSQTBuckets * InputDimensions);
239 return !stream.fail();
242 // Write network parameters
243 bool write_parameters(std::ostream& stream) const {
245 write_leb_128<BiasType >(stream, biases , HalfDimensions );
246 write_leb_128<WeightType >(stream, weights , HalfDimensions * InputDimensions);
247 write_leb_128<PSQTWeightType>(stream, psqtWeights, PSQTBuckets * InputDimensions);
249 return !stream.fail();
252 // Convert input features
253 std::int32_t transform(const Position& pos, OutputType* output, int bucket) const {
254 update_accumulator<WHITE>(pos);
255 update_accumulator<BLACK>(pos);
257 const Color perspectives[2] = {pos.side_to_move(), ~pos.side_to_move()};
258 const auto& accumulation = pos.state()->accumulator.accumulation;
259 const auto& psqtAccumulation = pos.state()->accumulator.psqtAccumulation;
262 psqtAccumulation[perspectives[0]][bucket]
263 - psqtAccumulation[perspectives[1]][bucket]
267 for (IndexType p = 0; p < 2; ++p)
269 const IndexType offset = (HalfDimensions / 2) * p;
273 constexpr IndexType OutputChunkSize = MaxChunkSize;
274 static_assert((HalfDimensions / 2) % OutputChunkSize == 0);
275 constexpr IndexType NumOutputChunks = HalfDimensions / 2 / OutputChunkSize;
277 vec_t Zero = vec_zero();
278 vec_t One = vec_set_16(127);
280 const vec_t* in0 = reinterpret_cast<const vec_t*>(&(accumulation[perspectives[p]][0]));
281 const vec_t* in1 = reinterpret_cast<const vec_t*>(&(accumulation[perspectives[p]][HalfDimensions / 2]));
282 vec_t* out = reinterpret_cast< vec_t*>(output + offset);
284 for (IndexType j = 0; j < NumOutputChunks; j += 1)
286 const vec_t sum0a = vec_max_16(vec_min_16(in0[j * 2 + 0], One), Zero);
287 const vec_t sum0b = vec_max_16(vec_min_16(in0[j * 2 + 1], One), Zero);
288 const vec_t sum1a = vec_max_16(vec_min_16(in1[j * 2 + 0], One), Zero);
289 const vec_t sum1b = vec_max_16(vec_min_16(in1[j * 2 + 1], One), Zero);
291 const vec_t pa = vec_mul_16(sum0a, sum1a);
292 const vec_t pb = vec_mul_16(sum0b, sum1b);
294 out[j] = vec_msb_pack_16(pa, pb);
299 for (IndexType j = 0; j < HalfDimensions / 2; ++j) {
300 BiasType sum0 = accumulation[static_cast<int>(perspectives[p])][j + 0];
301 BiasType sum1 = accumulation[static_cast<int>(perspectives[p])][j + HalfDimensions / 2];
302 sum0 = std::clamp<BiasType>(sum0, 0, 127);
303 sum1 = std::clamp<BiasType>(sum1, 0, 127);
304 output[offset + j] = static_cast<OutputType>(unsigned(sum0 * sum1) / 128);
311 } // end of function transform()
313 void hint_common_access(const Position& pos) const {
314 hint_common_access_for_perspective<WHITE>(pos);
315 hint_common_access_for_perspective<BLACK>(pos);
319 template<Color Perspective>
320 [[nodiscard]] std::pair<StateInfo*, StateInfo*> try_find_computed_accumulator(const Position& pos) const {
321 // Look for a usable accumulator of an earlier position. We keep track
322 // of the estimated gain in terms of features to be added/subtracted.
323 StateInfo *st = pos.state(), *next = nullptr;
324 int gain = FeatureSet::refresh_cost(pos);
325 while (st->previous && !st->accumulator.computed[Perspective])
327 // This governs when a full feature refresh is needed and how many
328 // updates are better than just one full refresh.
329 if ( FeatureSet::requires_refresh(st, Perspective)
330 || (gain -= FeatureSet::update_cost(st) + 1) < 0)
338 // NOTE: The parameter states_to_update is an array of position states, ending with nullptr.
339 // All states must be sequential, that is states_to_update[i] must either be reachable
340 // by repeatedly applying ->previous from states_to_update[i+1] or states_to_update[i] == nullptr.
341 // computed_st must be reachable by repeatedly applying ->previous on states_to_update[0], if not nullptr.
342 template<Color Perspective, size_t N>
343 void update_accumulator_incremental(const Position& pos, StateInfo* computed_st, StateInfo* states_to_update[N]) const {
344 static_assert(N > 0);
345 assert(states_to_update[N-1] == nullptr);
348 // Gcc-10.2 unnecessarily spills AVX2 registers if this array
349 // is defined in the VECTOR code below, once in each branch
351 psqt_vec_t psqt[NumPsqtRegs];
354 if (states_to_update[0] == nullptr)
357 // Update incrementally going back through states_to_update.
359 // Gather all features to be updated.
360 const Square ksq = pos.square<KING>(Perspective);
362 // The size must be enough to contain the largest possible update.
363 // That might depend on the feature set and generally relies on the
364 // feature set's update cost calculation to be correct and never
365 // allow updates with more added/removed features than MaxActiveDimensions.
366 FeatureSet::IndexList removed[N-1], added[N-1];
369 int i = N-2; // last potential state to update. Skip last element because it must be nullptr.
370 while (states_to_update[i] == nullptr)
373 StateInfo *st2 = states_to_update[i];
377 states_to_update[i]->accumulator.computed[Perspective] = true;
379 StateInfo* end_state = i == 0 ? computed_st : states_to_update[i - 1];
381 for (; st2 != end_state; st2 = st2->previous)
382 FeatureSet::append_changed_indices<Perspective>(
383 ksq, st2->dirtyPiece, removed[i], added[i]);
387 StateInfo* st = computed_st;
389 // Now update the accumulators listed in states_to_update[], where the last element is a sentinel.
391 for (IndexType j = 0; j < HalfDimensions / TileHeight; ++j)
394 auto accTile = reinterpret_cast<vec_t*>(
395 &st->accumulator.accumulation[Perspective][j * TileHeight]);
396 for (IndexType k = 0; k < NumRegs; ++k)
397 acc[k] = vec_load(&accTile[k]);
399 for (IndexType i = 0; states_to_update[i]; ++i)
401 // Difference calculation for the deactivated features
402 for (const auto index : removed[i])
404 const IndexType offset = HalfDimensions * index + j * TileHeight;
405 auto column = reinterpret_cast<const vec_t*>(&weights[offset]);
406 for (IndexType k = 0; k < NumRegs; ++k)
407 acc[k] = vec_sub_16(acc[k], column[k]);
410 // Difference calculation for the activated features
411 for (const auto index : added[i])
413 const IndexType offset = HalfDimensions * index + j * TileHeight;
414 auto column = reinterpret_cast<const vec_t*>(&weights[offset]);
415 for (IndexType k = 0; k < NumRegs; ++k)
416 acc[k] = vec_add_16(acc[k], column[k]);
420 accTile = reinterpret_cast<vec_t*>(
421 &states_to_update[i]->accumulator.accumulation[Perspective][j * TileHeight]);
422 for (IndexType k = 0; k < NumRegs; ++k)
423 vec_store(&accTile[k], acc[k]);
427 for (IndexType j = 0; j < PSQTBuckets / PsqtTileHeight; ++j)
430 auto accTilePsqt = reinterpret_cast<psqt_vec_t*>(
431 &st->accumulator.psqtAccumulation[Perspective][j * PsqtTileHeight]);
432 for (std::size_t k = 0; k < NumPsqtRegs; ++k)
433 psqt[k] = vec_load_psqt(&accTilePsqt[k]);
435 for (IndexType i = 0; states_to_update[i]; ++i)
437 // Difference calculation for the deactivated features
438 for (const auto index : removed[i])
440 const IndexType offset = PSQTBuckets * index + j * PsqtTileHeight;
441 auto columnPsqt = reinterpret_cast<const psqt_vec_t*>(&psqtWeights[offset]);
442 for (std::size_t k = 0; k < NumPsqtRegs; ++k)
443 psqt[k] = vec_sub_psqt_32(psqt[k], columnPsqt[k]);
446 // Difference calculation for the activated features
447 for (const auto index : added[i])
449 const IndexType offset = PSQTBuckets * index + j * PsqtTileHeight;
450 auto columnPsqt = reinterpret_cast<const psqt_vec_t*>(&psqtWeights[offset]);
451 for (std::size_t k = 0; k < NumPsqtRegs; ++k)
452 psqt[k] = vec_add_psqt_32(psqt[k], columnPsqt[k]);
456 accTilePsqt = reinterpret_cast<psqt_vec_t*>(
457 &states_to_update[i]->accumulator.psqtAccumulation[Perspective][j * PsqtTileHeight]);
458 for (std::size_t k = 0; k < NumPsqtRegs; ++k)
459 vec_store_psqt(&accTilePsqt[k], psqt[k]);
464 for (IndexType i = 0; states_to_update[i]; ++i)
466 std::memcpy(states_to_update[i]->accumulator.accumulation[Perspective],
467 st->accumulator.accumulation[Perspective],
468 HalfDimensions * sizeof(BiasType));
470 for (std::size_t k = 0; k < PSQTBuckets; ++k)
471 states_to_update[i]->accumulator.psqtAccumulation[Perspective][k] = st->accumulator.psqtAccumulation[Perspective][k];
473 st = states_to_update[i];
475 // Difference calculation for the deactivated features
476 for (const auto index : removed[i])
478 const IndexType offset = HalfDimensions * index;
480 for (IndexType j = 0; j < HalfDimensions; ++j)
481 st->accumulator.accumulation[Perspective][j] -= weights[offset + j];
483 for (std::size_t k = 0; k < PSQTBuckets; ++k)
484 st->accumulator.psqtAccumulation[Perspective][k] -= psqtWeights[index * PSQTBuckets + k];
487 // Difference calculation for the activated features
488 for (const auto index : added[i])
490 const IndexType offset = HalfDimensions * index;
492 for (IndexType j = 0; j < HalfDimensions; ++j)
493 st->accumulator.accumulation[Perspective][j] += weights[offset + j];
495 for (std::size_t k = 0; k < PSQTBuckets; ++k)
496 st->accumulator.psqtAccumulation[Perspective][k] += psqtWeights[index * PSQTBuckets + k];
502 template<Color Perspective>
503 void update_accumulator_refresh(const Position& pos) const {
505 // Gcc-10.2 unnecessarily spills AVX2 registers if this array
506 // is defined in the VECTOR code below, once in each branch
508 psqt_vec_t psqt[NumPsqtRegs];
511 // Refresh the accumulator
512 // Could be extracted to a separate function because it's done in 2 places,
513 // but it's unclear if compilers would correctly handle register allocation.
514 auto& accumulator = pos.state()->accumulator;
515 accumulator.computed[Perspective] = true;
516 FeatureSet::IndexList active;
517 FeatureSet::append_active_indices<Perspective>(pos, active);
520 for (IndexType j = 0; j < HalfDimensions / TileHeight; ++j)
522 auto biasesTile = reinterpret_cast<const vec_t*>(
523 &biases[j * TileHeight]);
524 for (IndexType k = 0; k < NumRegs; ++k)
525 acc[k] = biasesTile[k];
527 for (const auto index : active)
529 const IndexType offset = HalfDimensions * index + j * TileHeight;
530 auto column = reinterpret_cast<const vec_t*>(&weights[offset]);
532 for (unsigned k = 0; k < NumRegs; ++k)
533 acc[k] = vec_add_16(acc[k], column[k]);
536 auto accTile = reinterpret_cast<vec_t*>(
537 &accumulator.accumulation[Perspective][j * TileHeight]);
538 for (unsigned k = 0; k < NumRegs; k++)
539 vec_store(&accTile[k], acc[k]);
542 for (IndexType j = 0; j < PSQTBuckets / PsqtTileHeight; ++j)
544 for (std::size_t k = 0; k < NumPsqtRegs; ++k)
545 psqt[k] = vec_zero_psqt();
547 for (const auto index : active)
549 const IndexType offset = PSQTBuckets * index + j * PsqtTileHeight;
550 auto columnPsqt = reinterpret_cast<const psqt_vec_t*>(&psqtWeights[offset]);
552 for (std::size_t k = 0; k < NumPsqtRegs; ++k)
553 psqt[k] = vec_add_psqt_32(psqt[k], columnPsqt[k]);
556 auto accTilePsqt = reinterpret_cast<psqt_vec_t*>(
557 &accumulator.psqtAccumulation[Perspective][j * PsqtTileHeight]);
558 for (std::size_t k = 0; k < NumPsqtRegs; ++k)
559 vec_store_psqt(&accTilePsqt[k], psqt[k]);
563 std::memcpy(accumulator.accumulation[Perspective], biases,
564 HalfDimensions * sizeof(BiasType));
566 for (std::size_t k = 0; k < PSQTBuckets; ++k)
567 accumulator.psqtAccumulation[Perspective][k] = 0;
569 for (const auto index : active)
571 const IndexType offset = HalfDimensions * index;
573 for (IndexType j = 0; j < HalfDimensions; ++j)
574 accumulator.accumulation[Perspective][j] += weights[offset + j];
576 for (std::size_t k = 0; k < PSQTBuckets; ++k)
577 accumulator.psqtAccumulation[Perspective][k] += psqtWeights[index * PSQTBuckets + k];
582 template<Color Perspective>
583 void hint_common_access_for_perspective(const Position& pos) const {
585 // Works like update_accumulator, but performs less work.
586 // Updates ONLY the accumulator for pos.
588 // Look for a usable accumulator of an earlier position. We keep track
589 // of the estimated gain in terms of features to be added/subtracted.
591 if (pos.state()->accumulator.computed[Perspective])
594 auto [oldest_st, _] = try_find_computed_accumulator<Perspective>(pos);
596 if (oldest_st->accumulator.computed[Perspective])
598 // Only update current position accumulator to minimize work.
599 StateInfo* states_to_update[2] = { pos.state(), nullptr };
600 update_accumulator_incremental<Perspective, 2>(pos, oldest_st, states_to_update);
604 update_accumulator_refresh<Perspective>(pos);
608 template<Color Perspective>
609 void update_accumulator(const Position& pos) const {
611 auto [oldest_st, next] = try_find_computed_accumulator<Perspective>(pos);
613 if (oldest_st->accumulator.computed[Perspective])
618 // Now update the accumulators listed in states_to_update[], where the last element is a sentinel.
619 // Currently we update 2 accumulators.
620 // 1. for the current position
621 // 2. the next accumulator after the computed one
622 // The heuristic may change in the future.
623 StateInfo *states_to_update[3] =
624 { next, next == pos.state() ? nullptr : pos.state(), nullptr };
626 update_accumulator_incremental<Perspective, 3>(pos, oldest_st, states_to_update);
630 update_accumulator_refresh<Perspective>(pos);
634 alignas(CacheLineSize) BiasType biases[HalfDimensions];
635 alignas(CacheLineSize) WeightType weights[HalfDimensions * InputDimensions];
636 alignas(CacheLineSize) PSQTWeightType psqtWeights[InputDimensions * PSQTBuckets];
639 } // namespace Stockfish::Eval::NNUE
641 #endif // #ifndef NNUE_FEATURE_TRANSFORMER_H_INCLUDED