-
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathbuild.rs
executable file
·724 lines (655 loc) · 26.1 KB
/
build.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
#![allow(unused_imports)]
use itertools::*;
use std::cmp::Ordering;
use std::fmt;
use std::fs::{self, File};
use std::io::Write;
use std::path::{Path, PathBuf};
type Result<T> = std::result::Result<T, Box<dyn std::error::Error>>;
mod bitboards_generation {
use super::*;
#[derive(Clone, Copy, Default)]
struct BitBoard(u64);
impl fmt::Debug for BitBoard {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "BitBoard::new(0x{:X})", self.0)
}
}
#[inline]
const fn get_ranks_bb(index: usize) -> u64 {
0xFF << (index << 3)
}
#[inline]
const fn get_files_bb(index: usize) -> u64 {
0x0101010101010101 << index
}
#[inline]
const fn shift_up(bb: u64) -> u64 {
(bb & !get_ranks_bb(7)) << 8
}
#[inline]
const fn shift_down(bb: u64) -> u64 {
bb >> 8
}
#[inline]
const fn shift_left(bb: u64) -> u64 {
(bb & !get_files_bb(0)) >> 1
}
#[inline]
const fn shift_right(bb: u64) -> u64 {
(bb & !get_files_bb(7)) << 1
}
#[inline]
const fn get_rank(square: u8) -> u8 {
square >> 3
}
#[inline]
const fn get_file(square: u8) -> u8 {
square & 7
}
#[inline]
const fn wrapping_up(square: u8) -> u8 {
if bb_contains(get_ranks_bb(7), square) {
square
} else {
square + 8
}
}
#[inline]
const fn wrapping_down(square: u8) -> u8 {
if bb_contains(get_ranks_bb(0), square) {
square
} else {
square - 8
}
}
#[inline]
const fn wrapping_left(square: u8) -> u8 {
if bb_contains(get_files_bb(0), square) {
square
} else {
square - 1
}
}
#[inline]
const fn wrapping_right(square: u8) -> u8 {
if bb_contains(get_files_bb(7), square) {
square
} else {
square + 1
}
}
const fn flip_horizontal(mut bb: u64) -> u64 {
bb = ((bb >> 1) & 0x5555_5555_5555_5555) | ((bb & 0x5555_5555_5555_5555) << 1);
bb = ((bb >> 2) & 0x3333_3333_3333_3333) | ((bb & 0x3333_3333_3333_3333) << 2);
bb = ((bb >> 4) & 0x0F0F_0F0F_0F0F_0F0F) | ((bb & 0x0F0F_0F0F_0F0F_0F0F) << 4);
bb
}
#[inline]
const fn bb_contains(bb: u64, square: u8) -> bool {
bb & 1 << square != 0
}
fn generate_moves_bb(sub_mask: u64, square: u8, piece_type: u8) -> u64 {
let direction_offset = match piece_type {
2 => 4,
3 => 0,
_ => unreachable!(),
};
let mut moves_bb = 0;
for direction_index in 0..4 {
let mut current_square_bb = 1 << square;
loop {
current_square_bb = match direction_index + direction_offset {
0 => shift_up(current_square_bb),
1 => shift_down(current_square_bb),
2 => shift_left(current_square_bb),
3 => shift_right(current_square_bb),
4 => shift_left(shift_up(current_square_bb)),
5 => shift_right(shift_up(current_square_bb)),
6 => shift_left(shift_down(current_square_bb)),
7 => shift_right(shift_down(current_square_bb)),
_ => unreachable!(),
};
moves_bb ^= current_square_bb;
if current_square_bb == 0 || current_square_bb & sub_mask != 0 {
break;
}
}
}
moves_bb
}
fn generate_all_sub_masks_and_moves(
mask: u64,
square: u8,
piece_type: u8,
) -> [(u64, u64); 1 << 12] {
let mut array = [(0, 0); 1 << 12];
// Generating Squares from BitBoard
let mut squares = [None; 12];
let mut pointer = 0;
let mut mask_copy = mask;
while mask_copy != 0 {
let mask_square = mask_copy.trailing_zeros() as u8;
squares[pointer] = Some(mask_square);
pointer += 1;
mask_copy ^= 1 << mask_square;
}
// Generate Sub Masks
let mask_popcnt = mask.count_ones() as usize;
for mask_index in 0..1 << mask_popcnt {
squares
.iter()
.enumerate()
.take(mask_popcnt)
.for_each(|(bit_index, square)| {
if bb_contains(mask_index, bit_index as u8) {
array[mask_index as usize].0 ^= 1 << square.unwrap();
}
});
array[mask_index as usize].1 =
generate_moves_bb(array[mask_index as usize].0, square, piece_type);
}
array
}
fn create_pawn_moves(file: &mut File) -> Result<()> {
let mut moves_array = [[BitBoard::default(); 64]; 2];
let mut attacks_array = [[BitBoard::default(); 64]; 2];
for i in 0..2 {
for j in 0..64 {
moves_array[i][j].0 = if i == 0 {
shift_down(1 << j)
} else {
shift_up(1 << j)
};
attacks_array[i][j].0 =
shift_left(moves_array[i][j].0) ^ shift_right(moves_array[i][j].0);
}
}
for i in 0..8 {
moves_array[0][i + 48].0 ^= shift_down(moves_array[0][i + 48].0);
moves_array[1][i + 8].0 ^= shift_up(moves_array[1][i + 8].0);
}
writeln!(
file,
"static PAWN_MOVES_AND_ATTACKS: [[[BitBoard; 64]; 2]; 2] = {:#?};",
[moves_array, attacks_array],
)?;
Ok(())
}
fn create_knight_moves(file: &mut File) -> Result<()> {
writeln!(
file,
"static KNIGHT_MOVES: [BitBoard; 64] = {:#?};",
std::array::from_fn::<_, 64, _>(|index| {
let bb_square = 1 << index;
let two_up_and_down =
shift_up(shift_up(bb_square)) ^ shift_down(shift_down(bb_square));
let two_left_and_right =
shift_left(shift_left(bb_square)) ^ shift_right(shift_right(bb_square));
BitBoard(
shift_left(two_up_and_down)
^ shift_right(two_up_and_down)
^ shift_up(two_left_and_right)
^ shift_down(two_left_and_right),
)
})
)?;
Ok(())
}
fn create_king_moves(file: &mut File) -> Result<()> {
writeln!(
file,
"static KING_MOVES: [BitBoard; 64] = {:#?};",
std::array::from_fn::<_, 64, _>(|index| {
let mut bb = 1 << index;
bb ^= shift_left(bb) ^ shift_right(bb);
bb ^= shift_down(bb) ^ shift_up(bb);
BitBoard(bb ^ 1 << index)
})
)?;
Ok(())
}
fn calculate_between(square1: u8, square2: u8, all_direction_rays: &[BitBoard]) -> u64 {
if !bb_contains(all_direction_rays[square1 as usize].0, square2) {
return 0;
}
let square1_rank = get_rank(square1);
let square1_file = get_file(square1);
let square2_rank = get_rank(square2);
let square2_file = get_file(square2);
let rank_ordering = square1_rank.cmp(&square2_rank);
let file_ordering = square1_file.cmp(&square2_file);
let mut bb = 0;
let mut current_square = square1;
loop {
let mut next_square = match rank_ordering {
Ordering::Less => wrapping_up(current_square),
Ordering::Equal => current_square,
Ordering::Greater => wrapping_down(current_square),
};
next_square = match file_ordering {
Ordering::Less => wrapping_right(next_square),
Ordering::Equal => next_square,
Ordering::Greater => wrapping_left(next_square),
};
if next_square == square2 {
return bb;
}
bb ^= 1 << next_square;
current_square = next_square;
}
}
fn calculate_line(
square1: u8,
square2: u8,
bishop_diagonal_rays: &[BitBoard],
bishop_anti_diagonal_rays: &[BitBoard],
all_direction_rays: &[BitBoard],
) -> u64 {
if !bb_contains(all_direction_rays[square1 as usize].0, square2) {
return 0;
}
let square2_bb = 1 << square2;
let mut possible_line = get_ranks_bb(get_rank(square1) as usize);
if possible_line & square2_bb != 0 {
return possible_line;
}
possible_line = get_files_bb(get_file(square1) as usize);
if possible_line & square2_bb != 0 {
return possible_line;
}
possible_line = bishop_diagonal_rays[square1 as usize].0;
if possible_line & square2_bb != 0 {
return possible_line;
}
possible_line = bishop_anti_diagonal_rays[square1 as usize].0;
if possible_line & square2_bb != 0 {
return possible_line;
}
unreachable!();
}
fn create_rays(file: &mut File) -> Result<(Vec<BitBoard>, Vec<BitBoard>)> {
let bishop_diagonal_rays = (0..64)
.map(|index| {
let square = index as u8;
let square_rank_index = get_rank(square);
let square_file_index = get_file(square);
let mut bb = 0x8040201008040201;
for _ in 0..square_rank_index.abs_diff(square_file_index) {
bb = if square_rank_index < square_file_index {
shift_right(bb)
} else {
shift_left(bb)
};
}
BitBoard(bb)
})
.collect_vec();
// index ^ 7 is vertical mirror of a square
let bishop_anti_diagonal_rays = (0..64)
.map(|index| BitBoard(flip_horizontal(bishop_diagonal_rays[index ^ 7].0)))
.collect_vec();
let bishop_rays = (0..64)
.map(|index| {
BitBoard(bishop_diagonal_rays[index].0 ^ bishop_anti_diagonal_rays[index].0)
})
.collect_vec();
let rook_rays = (0..64)
.map(|index| {
BitBoard(
get_ranks_bb(get_rank(index) as usize) ^ get_files_bb(get_file(index) as usize),
)
})
.collect_vec();
let all_direction_rays = (0..64)
.map(|index| BitBoard(bishop_rays[index].0 ^ rook_rays[index].0))
.collect_vec();
let mut between = [[BitBoard::default(); 64]; 64];
let mut line = [[BitBoard::default(); 64]; 64];
for square1 in 0..64 {
for square2 in 0..square1 {
between[square1][square2] = BitBoard(calculate_between(
square1 as u8,
square2 as u8,
&all_direction_rays,
));
between[square2][square1] = between[square1][square2];
line[square1][square2] = BitBoard(calculate_line(
square1 as u8,
square2 as u8,
&bishop_diagonal_rays,
&bishop_anti_diagonal_rays,
&all_direction_rays,
));
line[square2][square1] = line[square1][square2];
}
}
writeln!(
file,
"static BISHOP_DIAGONAL_RAYS: [BitBoard; 64] = {:#?};",
bishop_diagonal_rays
)?;
writeln!(
file,
"static BISHOP_ANTI_DIAGONAL_RAYS: [BitBoard; 64] = {:#?};",
bishop_anti_diagonal_rays
)?;
writeln!(
file,
"static BISHOP_RAYS: [BitBoard; 64] = {:#?};",
bishop_rays
)?;
writeln!(file, "static ROOK_RAYS: [BitBoard; 64] = {:#?};", rook_rays)?;
writeln!(
file,
"static ALL_DIRECTION_RAYS: [BitBoard; 64] = {:#?};",
all_direction_rays
)?;
writeln!(
file,
"static BETWEEN: [[BitBoard; 64]; 64] = {:#?};",
between
)?;
writeln!(file, "static LINE: [[BitBoard; 64]; 64] = {:#?};", line)?;
Ok((bishop_rays, rook_rays))
}
fn create_all_slider_moves(
file: &mut File,
bishop_rays: &[BitBoard],
rook_rays: &[BitBoard],
) -> Result<()> {
#[derive(Clone, Copy, Debug, Default)]
struct Magic {
magic_number: u64,
mask: BitBoard,
offset: usize,
right_shift: u8,
}
#[cfg(target_feature = "bmi2")]
#[derive(Clone, Copy, Debug, Default)]
struct BmiMagic {
blockers_mask: BitBoard,
offset: usize,
}
#[rustfmt::skip]
const MAGIC_NUMBERS: [u64; 128] = [
0x204022080a222040, 0x0020042400404100, 0x421073004500023a, 0x0008048100401040,
0x8004042100840000, 0x0001040240828006, 0x00818c0520300620, 0x0a10210048200900,
0x2090210202180100, 0x88050c1816004209, 0x88050c1816004209, 0x0040040404840000,
0x0020021210402001, 0x0100110308400104, 0x4c00424208244000, 0x9100012202100c00,
0x881000400c534408, 0x2090210202180100, 0x8010004104108030, 0x2808000082004008,
0x05010108200800a0, 0x0280800101514000, 0x02040101009a9000, 0x1000800100880130,
0x0020081250500100, 0x00082080840400a7, 0xa408880010182122, 0x0a00480004012020,
0x4c40840142802000, 0x4089110002004104, 0x02040101009a9000, 0x0001020813108284,
0x4014100400082001, 0x010802820030a400, 0x0004108802500840, 0x00c0140400080211,
0x24400100b0230040, 0x8020040100022280, 0x210d030100241400, 0x1008010050002601,
0x180404202a080401, 0x9800420231802000, 0x000500148a015002, 0x042044c010402200,
0x00018a020a020c00, 0x3001011001008080, 0x8010844821408180, 0xa004015605200601,
0x00818c0520300620, 0x001442009008a009, 0x800d030080904002, 0x0008000104882182,
0x202000091024040c, 0x2000085010008080, 0x082092100200880a, 0x0020042400404100,
0x0a10210048200900, 0x9100012202100c00, 0x0404242101c11040, 0x4380800404208800,
0x1000000040504100, 0x400c04431c080084, 0x2090210202180100, 0x204022080a222040,
0x2280023020400080, 0x2840200010044000, 0x0880100009a00080, 0x0080100014820800,
0x0100030004080070, 0x420006000130281c, 0x0100008100240600, 0x4080055123000080,
0x600a002102004180, 0x600a002102004180, 0x4000801000200885, 0xc001800802100080,
0x0003001100880114, 0x1282001200100429, 0x01040006c8041011, 0x030a000042188405,
0x001080800040022a, 0x504840c00a201000, 0x00002a0010408200, 0x4200a30010000900,
0x0068010010080500, 0x480080800a000400, 0x40310400210a0810, 0x0000020008810844,
0x0080024040002010, 0x6080200880400180, 0x8000410100200210, 0x1040100100210008,
0x0008001100040900, 0x0204040080800200, 0x4001000100840200, 0x0200c54200008409,
0x0080006000400040, 0x600a002102004180, 0x4000403082002200, 0x0012809000801804,
0x5000800800800400, 0x0204040080800200, 0x20111008040005c2, 0x0020542142000381,
0x7000842040008000, 0x9010004020004000, 0x0002028040220010, 0x1040100100210008,
0x0088040008008080, 0x0002000430420009, 0x0040101881040002, 0x2040240080420001,
0x1802004108802200, 0x6080200880400180, 0x00002a0010408200, 0xc001800802100080,
0x0000180224008080, 0x002e001004080a00, 0x3021006a00040100, 0x2a402d4104108200,
0x0404402010800301, 0x0041001082204001, 0x5000501900422001, 0x0800182005005001,
0x0006001410592006, 0x0001006802140005, 0x1020080210028904, 0xc000192040840102,
];
const NUM_MOVES: usize = 64 * (1 << 12) + 64 * (1 << 9);
#[cfg(target_feature = "bmi2")]
let mut bmi_offset = 0;
#[cfg(target_feature = "bmi2")]
let mut bishop_and_rook_bmi_masks = [[BmiMagic::default(); 64]; 2];
#[cfg(target_feature = "bmi2")]
let mut bmi_moves = vec![0; NUM_MOVES];
let mut offset = 0;
let mut bishop_and_rook_magic_numbers = [[Magic::default(); 64]; 2];
let mut moves = vec![BitBoard::default(); NUM_MOVES];
let mut rays_cache_temp = vec![0; NUM_MOVES];
for piece_index in 0..2 {
for square_index in 0..64 {
let ray = match piece_index {
0 => bishop_rays,
1 => rook_rays,
_ => unreachable!(),
}[square_index];
let magic = &mut bishop_and_rook_magic_numbers[piece_index][square_index];
magic.magic_number = MAGIC_NUMBERS[64 * piece_index + square_index];
magic.mask.0 = ray.0
& match piece_index {
0 => 0x007E7E7E7E7E7E00,
1 => {
let mut restriction = 0x007E7E7E7E7E7E00;
for (corner_rows, allowed) in const {
[
(0x00000000000000FF, 0x000000000000007E),
(0xFF00000000000000, 0x7E00000000000000),
(0x0101010101010101, 0x0001010101010100),
(0x8080808080808080, 0x0080808080808000),
]
} {
if bb_contains(corner_rows, square_index as u8) {
restriction ^= allowed;
}
}
restriction
}
_ => unreachable!(),
};
magic.right_shift = 64 - magic.mask.0.count_ones() as u8;
let sub_masks_and_moves_array = generate_all_sub_masks_and_moves(
magic.mask.0,
square_index as u8,
if piece_index == 0 { 2 } else { 3 },
);
let num_sub_masks = 1 << (64 - magic.right_shift);
magic.offset = (0..offset)
.find(|&i| {
rays_cache_temp[i..i + num_sub_masks]
.iter()
.all(|&bb| bb & ray.0 == 0)
})
.unwrap_or(offset);
offset = offset.max(magic.offset + num_sub_masks);
#[cfg(target_feature = "bmi2")]
let bmi_magic = &mut bishop_and_rook_bmi_masks[piece_index][square_index];
#[cfg(target_feature = "bmi2")]
{
bmi_magic.blockers_mask = magic.mask;
bmi_magic.offset = bmi_offset;
bmi_offset += num_sub_masks;
}
#[allow(clippy::needless_range_loop)]
for sub_masks_and_moves_array_index in 0..num_sub_masks {
let (sub_mask, moves_bb) =
sub_masks_and_moves_array[sub_masks_and_moves_array_index];
let index = (magic.magic_number.wrapping_mul(sub_mask) >> magic.right_shift)
as usize
+ magic.offset;
moves[index].0 |= moves_bb;
rays_cache_temp[index] |= ray.0;
#[cfg(target_feature = "bmi2")]
{
use std::arch::x86_64::_pext_u64;
bmi_moves[bmi_magic.offset
+ unsafe {
_pext_u64(
sub_masks_and_moves_array[sub_masks_and_moves_array_index].0,
bmi_magic.blockers_mask.0,
) as usize
}] = unsafe {
_pext_u64(
sub_masks_and_moves_array[sub_masks_and_moves_array_index].1,
ray.0,
) as u16
};
}
}
}
}
writeln!(file, r##"#[derive(Clone, Copy)]"##)?;
writeln!(file, r##"struct Magic {{"##)?;
writeln!(file, r##" magic_number: u64,"##)?;
writeln!(file, r##" mask: BitBoard,"##)?;
writeln!(file, r##" offset: usize,"##)?;
writeln!(file, r##" right_shift: u8,"##)?;
writeln!(file, r##"}}"##)?;
writeln!(
file,
"static BISHOP_AND_ROOK_MAGIC_NUMBERS: [[Magic; 64]; 2] = {:#?};",
bishop_and_rook_magic_numbers
)?;
writeln!(
file,
"static MOVES: [BitBoard; {}] = {:#?};",
offset,
&moves[0..offset]
)?;
#[cfg(target_feature = "bmi2")]
{
writeln!(file, r##"#[derive(Clone, Copy)]"##)?;
writeln!(file, r##"struct BmiMagic {{"##)?;
writeln!(file, r##" blockers_mask: BitBoard,"##)?;
writeln!(file, r##" offset: usize,"##)?;
writeln!(file, r##"}}"##)?;
writeln!(
file,
"static BISHOP_AND_ROOK_BMI_MASKS: [[BmiMagic; 64]; 2] = {:#?};",
bishop_and_rook_bmi_masks,
)?;
writeln!(
file,
"static BMI_MOVES: [u16; {}] = {:#?};",
bmi_offset,
&bmi_moves[0..bmi_offset]
)?;
}
Ok(())
}
pub fn create_magic_bitboards() -> Result<()> {
let out_dir_string = std::env::var("OUT_DIR")?;
let output_dir = Path::new(&out_dir_string);
let magic_file_path = output_dir.join("magic.rs");
let mut file = File::create(magic_file_path)?;
create_pawn_moves(&mut file)?;
create_knight_moves(&mut file)?;
create_king_moves(&mut file)?;
let (bishop_rays, rook_rays) = create_rays(&mut file)?;
create_all_slider_moves(&mut file, &bishop_rays, &rook_rays)?;
Ok(())
}
}
#[cfg(feature = "inbuilt_nnue")]
mod nnue_features {
use super::*;
const NNUE_FILE_NAME: &str = "nn-62ef826d1a6d.nnue";
// const NNUE_FILE_NAME: &str = "nn-f7d87b7a1789.nnue";
// const NNUE_FILE_NAME: &str = "nn-c3ca321c51c9.nnue";
fn remove_nnue_file(nnue_path: &Path) -> Result<()> {
if nnue_path.is_file() {
let err_msg = format!(
"Could not delete file {}!",
nnue_path.to_str().ok_or("NNUE Path not found")?
);
std::fs::remove_file(nnue_path).map_err(|_| err_msg)?;
}
Ok(())
}
fn nnue_downloaded_correctly(nnue_path: &Path) -> Result<bool> {
if !nnue_path.is_file() {
return Ok(false);
}
let expected_hash_start = NNUE_FILE_NAME
.strip_prefix("nn-")
.unwrap()
.strip_suffix(".nnue")
.unwrap();
let nnue_data = std::fs::read(nnue_path)?;
let hash = sha256::digest(nnue_data.as_slice());
Ok(hash.starts_with(expected_hash_start))
}
fn generate_nnue_file(nnue_file: &mut File) -> Result<()> {
let url = format!("https://tests.stockfishchess.org/api/nn/{}", NNUE_FILE_NAME);
let response = minreq::get(url).send()?;
if response.status_code == 200 {
nnue_file
.write_all(response.as_bytes())
.map_err(|_| "Could not copy NNUE file data to the nnue file!")?;
Ok(())
} else {
Err(format!("Could not download NNUE file! Check your internet connection! Got response status code {}", response.status_code).into())
}
}
fn check_and_download_nnue(nnue_dir: &PathBuf) -> Result<()> {
if !nnue_dir.is_dir() {
std::fs::create_dir_all(nnue_dir.clone())?;
}
let nnue_path = nnue_dir.join("nn.nnue");
if !nnue_downloaded_correctly(&nnue_path)? {
remove_nnue_file(&nnue_path)?;
let mut nnue_file = File::create(nnue_path.clone())
.map_err(|_| format!("Failed to create file at {:#?}", nnue_dir))?;
println!("cargo:rerun-if-env-changed=DOCS_RS");
println!("cargo:rerun-if-env-changed=NNUE_DOWNLOAD");
if std::env::var("DOCS_RS").is_ok()
|| std::env::var("NNUE_DOWNLOAD") == Ok("PAUSE".to_string())
{
return Ok(());
}
match generate_nnue_file(&mut nnue_file) {
Ok(_) => {
println!("cargo:rerun-if-changed={:#?}", nnue_path);
}
Err(err) => {
remove_nnue_file(&nnue_path)?;
return Err(err);
}
}
if !nnue_downloaded_correctly(&nnue_path)? {
return Err("File not downloaded correctly!".into());
}
}
Ok(())
}
pub fn download_nnue() -> Result<()> {
let output_dir = std::env::var("OUT_DIR")?;
let output_nnue_dir = Path::new(&output_dir).join("nnue_dir");
// Backing up nnue file in local cache directory to prevent downloading it multiple times
let nnue_dir = dirs::cache_dir()
.map(|path| path.join("timecat").join("nnue_dir"))
.unwrap_or(output_nnue_dir.clone());
match check_and_download_nnue(&nnue_dir) {
Ok(_) => {
if nnue_dir != output_nnue_dir {
std::fs::create_dir_all(output_nnue_dir.clone())?;
std::fs::copy(nnue_dir.join("nn.nnue"), output_nnue_dir.join("nn.nnue"))?;
}
}
Err(err) => {
if nnue_dir == output_nnue_dir {
return Err(err);
} else {
check_and_download_nnue(&output_nnue_dir)?;
}
}
}
Ok(())
}
}
fn main() -> Result<()> {
bitboards_generation::create_magic_bitboards()?;
#[cfg(feature = "inbuilt_nnue")]
nnue_features::download_nnue()?;
Ok(())
}