-
Notifications
You must be signed in to change notification settings - Fork 125
/
Copy pathxxhash_slide.go
4776 lines (4565 loc) · 154 KB
/
xxhash_slide.go
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
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//go:build go1.17
// +build go1.17
package xxhash
import "math/bits"
// Generated by gen/slide.go. DO NOT EDIT.
const slideLength = 127
// Handles length 0-127 bytes using sum slides.
func slide(b []byte) uint64 {
// This function use sum slides, theses are straight unrolled pieces of code which compute hashes, with middle jumps.
// Each do not contain any conditions to make them trivial for the CPU to parse and never cause any pipeline flushes after the first jump table.
// We need 32 different slides to cover each offset into the 32 block size. The trailing 32 bytes are handled by their own slides which are shared and reused by the higher slides.
// The trailing 32 bytes slides are reused for each offset. The CPUs we care about can always correctly read unconditional jumps without causing a pipeline flush.
// This function is written more like an optimized assembly routine, except we trick the compiler into generating good code by generating the slide ourself.
// Using the go compiler make the call overhead cheaper since it will use the unstable ABIInternal passing through registers.
// They are also extremely effective when hashing multiple values of the same size back to back.
// Assumptions of this strategy:
// - All the state except b's array will be correctly register allocated.
// It probably generate unnecessary MOVs but the critical path includes LAT3 multiplies for each block, so there is plenty of time to dispatch renames.
// - The compiler is basic block based and will do a good enough job at layout. This is true for some the go compiler, llvm and some of gcc.
// This means I make very liberal use of goto, they shouldn't be red as JMPs but abstract basic blocks links.
// - The compiler has some SSA passes.
// This is used for all the b_* tricks.
// - We can't trust the compiler to inline anything (except intrinsics).
// Setup variables here since go doesn't want use to do dangerous gotos.
v1 := prime1
v1 += prime2
v2 := prime2
v3 := uint64(0)
v4 := prime1
v4 = -v4
h := prime5
n := uint64(len(b))
// The go compiler has multiple oversight in the propragation of proofs through Phi nodes. Using array pointers is a very unsubtle hint and compiles to nothing.
// Because we assume the compiler has some low level SSA passes this is otherwise free.
var (
b_0 *[0]byte
b_1 *[1]byte
b_2 *[2]byte
b_3 *[3]byte
b_4 *[4]byte
b_5 *[5]byte
b_6 *[6]byte
b_7 *[7]byte
b_8 *[8]byte
b_9 *[9]byte
b_10 *[10]byte
b_11 *[11]byte
b_12 *[12]byte
b_13 *[13]byte
b_14 *[14]byte
b_15 *[15]byte
b_16 *[16]byte
b_17 *[17]byte
b_18 *[18]byte
b_19 *[19]byte
b_20 *[20]byte
b_21 *[21]byte
b_22 *[22]byte
b_23 *[23]byte
b_24 *[24]byte
b_25 *[25]byte
b_26 *[26]byte
b_27 *[27]byte
b_28 *[28]byte
b_29 *[29]byte
b_30 *[30]byte
b_31 *[31]byte
b_32 *[32]byte
b_33 *[33]byte
b_34 *[34]byte
b_35 *[35]byte
b_36 *[36]byte
b_37 *[37]byte
b_38 *[38]byte
b_39 *[39]byte
b_40 *[40]byte
b_41 *[41]byte
b_42 *[42]byte
b_43 *[43]byte
b_44 *[44]byte
b_45 *[45]byte
b_46 *[46]byte
b_47 *[47]byte
b_48 *[48]byte
b_49 *[49]byte
b_50 *[50]byte
b_51 *[51]byte
b_52 *[52]byte
b_53 *[53]byte
b_54 *[54]byte
b_55 *[55]byte
b_56 *[56]byte
b_57 *[57]byte
b_58 *[58]byte
b_59 *[59]byte
b_60 *[60]byte
b_61 *[61]byte
b_62 *[62]byte
b_63 *[63]byte
b_64 *[64]byte
b_65 *[65]byte
b_66 *[66]byte
b_67 *[67]byte
b_68 *[68]byte
b_69 *[69]byte
b_70 *[70]byte
b_71 *[71]byte
b_72 *[72]byte
b_73 *[73]byte
b_74 *[74]byte
b_75 *[75]byte
b_76 *[76]byte
b_77 *[77]byte
b_78 *[78]byte
b_79 *[79]byte
b_80 *[80]byte
b_81 *[81]byte
b_82 *[82]byte
b_83 *[83]byte
b_84 *[84]byte
b_85 *[85]byte
b_86 *[86]byte
b_87 *[87]byte
b_88 *[88]byte
b_89 *[89]byte
b_90 *[90]byte
b_91 *[91]byte
b_92 *[92]byte
b_93 *[93]byte
b_94 *[94]byte
b_95 *[95]byte
b_96 *[96]byte
b_97 *[97]byte
b_98 *[98]byte
b_99 *[99]byte
b_100 *[100]byte
b_101 *[101]byte
b_102 *[102]byte
b_103 *[103]byte
b_104 *[104]byte
b_105 *[105]byte
b_106 *[106]byte
b_107 *[107]byte
b_108 *[108]byte
b_109 *[109]byte
b_110 *[110]byte
b_111 *[111]byte
b_112 *[112]byte
b_113 *[113]byte
b_114 *[114]byte
b_115 *[115]byte
b_116 *[116]byte
b_117 *[117]byte
b_118 *[118]byte
b_119 *[119]byte
b_120 *[120]byte
b_121 *[121]byte
b_122 *[122]byte
b_123 *[123]byte
b_124 *[124]byte
b_125 *[125]byte
b_126 *[126]byte
b_127 *[127]byte
)
// Jump table to various positions in the slide, this setups proofs for bounds checks.
// From then on it need to make sure to maintain constance in the length of b.
switch len(b) {
case 0:
// Handle this appart because it can be completely folded.
h += n
h ^= h >> 33
h *= prime2
h ^= h >> 29
h *= prime3
h ^= h >> 32
return h
case 1:
b_1 = (*[1]byte)(b)
goto sz_1
case 2:
b_2 = (*[2]byte)(b)
goto sz_2
case 3:
b_3 = (*[3]byte)(b)
goto sz_3
case 4:
b_4 = (*[4]byte)(b)
goto sz_4
case 5:
b_5 = (*[5]byte)(b)
goto sz_5
case 6:
b_6 = (*[6]byte)(b)
goto sz_6
case 7:
b_7 = (*[7]byte)(b)
goto sz_7
case 8:
b_8 = (*[8]byte)(b)
goto sz_8
case 9:
b_9 = (*[9]byte)(b)
goto sz_9
case 10:
b_10 = (*[10]byte)(b)
goto sz_10
case 11:
b_11 = (*[11]byte)(b)
goto sz_11
case 12:
b_12 = (*[12]byte)(b)
goto sz_12
case 13:
b_13 = (*[13]byte)(b)
goto sz_13
case 14:
b_14 = (*[14]byte)(b)
goto sz_14
case 15:
b_15 = (*[15]byte)(b)
goto sz_15
case 16:
b_16 = (*[16]byte)(b)
goto sz_16
case 17:
b_17 = (*[17]byte)(b)
goto sz_17
case 18:
b_18 = (*[18]byte)(b)
goto sz_18
case 19:
b_19 = (*[19]byte)(b)
goto sz_19
case 20:
b_20 = (*[20]byte)(b)
goto sz_20
case 21:
b_21 = (*[21]byte)(b)
goto sz_21
case 22:
b_22 = (*[22]byte)(b)
goto sz_22
case 23:
b_23 = (*[23]byte)(b)
goto sz_23
case 24:
b_24 = (*[24]byte)(b)
goto sz_24
case 25:
b_25 = (*[25]byte)(b)
goto sz_25
case 26:
b_26 = (*[26]byte)(b)
goto sz_26
case 27:
b_27 = (*[27]byte)(b)
goto sz_27
case 28:
b_28 = (*[28]byte)(b)
goto sz_28
case 29:
b_29 = (*[29]byte)(b)
goto sz_29
case 30:
b_30 = (*[30]byte)(b)
goto sz_30
case 31:
b_31 = (*[31]byte)(b)
goto sz_31
case 32:
b_32 = (*[32]byte)(b)
goto sz_32
case 33:
b_33 = (*[33]byte)(b)
goto sz_33
case 34:
b_34 = (*[34]byte)(b)
goto sz_34
case 35:
b_35 = (*[35]byte)(b)
goto sz_35
case 36:
b_36 = (*[36]byte)(b)
goto sz_36
case 37:
b_37 = (*[37]byte)(b)
goto sz_37
case 38:
b_38 = (*[38]byte)(b)
goto sz_38
case 39:
b_39 = (*[39]byte)(b)
goto sz_39
case 40:
b_40 = (*[40]byte)(b)
goto sz_40
case 41:
b_41 = (*[41]byte)(b)
goto sz_41
case 42:
b_42 = (*[42]byte)(b)
goto sz_42
case 43:
b_43 = (*[43]byte)(b)
goto sz_43
case 44:
b_44 = (*[44]byte)(b)
goto sz_44
case 45:
b_45 = (*[45]byte)(b)
goto sz_45
case 46:
b_46 = (*[46]byte)(b)
goto sz_46
case 47:
b_47 = (*[47]byte)(b)
goto sz_47
case 48:
b_48 = (*[48]byte)(b)
goto sz_48
case 49:
b_49 = (*[49]byte)(b)
goto sz_49
case 50:
b_50 = (*[50]byte)(b)
goto sz_50
case 51:
b_51 = (*[51]byte)(b)
goto sz_51
case 52:
b_52 = (*[52]byte)(b)
goto sz_52
case 53:
b_53 = (*[53]byte)(b)
goto sz_53
case 54:
b_54 = (*[54]byte)(b)
goto sz_54
case 55:
b_55 = (*[55]byte)(b)
goto sz_55
case 56:
b_56 = (*[56]byte)(b)
goto sz_56
case 57:
b_57 = (*[57]byte)(b)
goto sz_57
case 58:
b_58 = (*[58]byte)(b)
goto sz_58
case 59:
b_59 = (*[59]byte)(b)
goto sz_59
case 60:
b_60 = (*[60]byte)(b)
goto sz_60
case 61:
b_61 = (*[61]byte)(b)
goto sz_61
case 62:
b_62 = (*[62]byte)(b)
goto sz_62
case 63:
b_63 = (*[63]byte)(b)
goto sz_63
case 64:
b_64 = (*[64]byte)(b)
goto sz_64
case 65:
b_65 = (*[65]byte)(b)
goto sz_65
case 66:
b_66 = (*[66]byte)(b)
goto sz_66
case 67:
b_67 = (*[67]byte)(b)
goto sz_67
case 68:
b_68 = (*[68]byte)(b)
goto sz_68
case 69:
b_69 = (*[69]byte)(b)
goto sz_69
case 70:
b_70 = (*[70]byte)(b)
goto sz_70
case 71:
b_71 = (*[71]byte)(b)
goto sz_71
case 72:
b_72 = (*[72]byte)(b)
goto sz_72
case 73:
b_73 = (*[73]byte)(b)
goto sz_73
case 74:
b_74 = (*[74]byte)(b)
goto sz_74
case 75:
b_75 = (*[75]byte)(b)
goto sz_75
case 76:
b_76 = (*[76]byte)(b)
goto sz_76
case 77:
b_77 = (*[77]byte)(b)
goto sz_77
case 78:
b_78 = (*[78]byte)(b)
goto sz_78
case 79:
b_79 = (*[79]byte)(b)
goto sz_79
case 80:
b_80 = (*[80]byte)(b)
goto sz_80
case 81:
b_81 = (*[81]byte)(b)
goto sz_81
case 82:
b_82 = (*[82]byte)(b)
goto sz_82
case 83:
b_83 = (*[83]byte)(b)
goto sz_83
case 84:
b_84 = (*[84]byte)(b)
goto sz_84
case 85:
b_85 = (*[85]byte)(b)
goto sz_85
case 86:
b_86 = (*[86]byte)(b)
goto sz_86
case 87:
b_87 = (*[87]byte)(b)
goto sz_87
case 88:
b_88 = (*[88]byte)(b)
goto sz_88
case 89:
b_89 = (*[89]byte)(b)
goto sz_89
case 90:
b_90 = (*[90]byte)(b)
goto sz_90
case 91:
b_91 = (*[91]byte)(b)
goto sz_91
case 92:
b_92 = (*[92]byte)(b)
goto sz_92
case 93:
b_93 = (*[93]byte)(b)
goto sz_93
case 94:
b_94 = (*[94]byte)(b)
goto sz_94
case 95:
b_95 = (*[95]byte)(b)
goto sz_95
case 96:
b_96 = (*[96]byte)(b)
goto sz_96
case 97:
b_97 = (*[97]byte)(b)
goto sz_97
case 98:
b_98 = (*[98]byte)(b)
goto sz_98
case 99:
b_99 = (*[99]byte)(b)
goto sz_99
case 100:
b_100 = (*[100]byte)(b)
goto sz_100
case 101:
b_101 = (*[101]byte)(b)
goto sz_101
case 102:
b_102 = (*[102]byte)(b)
goto sz_102
case 103:
b_103 = (*[103]byte)(b)
goto sz_103
case 104:
b_104 = (*[104]byte)(b)
goto sz_104
case 105:
b_105 = (*[105]byte)(b)
goto sz_105
case 106:
b_106 = (*[106]byte)(b)
goto sz_106
case 107:
b_107 = (*[107]byte)(b)
goto sz_107
case 108:
b_108 = (*[108]byte)(b)
goto sz_108
case 109:
b_109 = (*[109]byte)(b)
goto sz_109
case 110:
b_110 = (*[110]byte)(b)
goto sz_110
case 111:
b_111 = (*[111]byte)(b)
goto sz_111
case 112:
b_112 = (*[112]byte)(b)
goto sz_112
case 113:
b_113 = (*[113]byte)(b)
goto sz_113
case 114:
b_114 = (*[114]byte)(b)
goto sz_114
case 115:
b_115 = (*[115]byte)(b)
goto sz_115
case 116:
b_116 = (*[116]byte)(b)
goto sz_116
case 117:
b_117 = (*[117]byte)(b)
goto sz_117
case 118:
b_118 = (*[118]byte)(b)
goto sz_118
case 119:
b_119 = (*[119]byte)(b)
goto sz_119
case 120:
b_120 = (*[120]byte)(b)
goto sz_120
case 121:
b_121 = (*[121]byte)(b)
goto sz_121
case 122:
b_122 = (*[122]byte)(b)
goto sz_122
case 123:
b_123 = (*[123]byte)(b)
goto sz_123
case 124:
b_124 = (*[124]byte)(b)
goto sz_124
case 125:
b_125 = (*[125]byte)(b)
goto sz_125
case 126:
b_126 = (*[126]byte)(b)
goto sz_126
case 127:
b_127 = (*[127]byte)(b)
goto sz_127
default:
panic("unreachable; slide overflow")
}
// Theses are the main slides, they handle 32 bytes 4 × 8 bytes at a time using ILP.
sz_127:
{
b := b_127[:]
var load uint64
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v1 += load * prime2
v1 = bits.RotateLeft64(v1, 31)
v1 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v2 += load * prime2
v2 = bits.RotateLeft64(v2, 31)
v2 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v3 += load * prime2
v3 = bits.RotateLeft64(v3, 31)
v3 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v4 += load * prime2
v4 = bits.RotateLeft64(v4, 31)
v4 *= prime1
b_95 = (*[95]byte)(b_127[32:])
}
sz_95:
{
b := b_95[:]
var load uint64
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v1 += load * prime2
v1 = bits.RotateLeft64(v1, 31)
v1 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v2 += load * prime2
v2 = bits.RotateLeft64(v2, 31)
v2 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v3 += load * prime2
v3 = bits.RotateLeft64(v3, 31)
v3 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v4 += load * prime2
v4 = bits.RotateLeft64(v4, 31)
v4 *= prime1
b_63 = (*[63]byte)(b_95[32:])
}
sz_63:
{
b := b_63[:]
var load uint64
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v1 += load * prime2
v1 = bits.RotateLeft64(v1, 31)
v1 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v2 += load * prime2
v2 = bits.RotateLeft64(v2, 31)
v2 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v3 += load * prime2
v3 = bits.RotateLeft64(v3, 31)
v3 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v4 += load * prime2
v4 = bits.RotateLeft64(v4, 31)
v4 *= prime1
b_31 = (*[31]byte)(b_63[32:])
}
h = bits.RotateLeft64(v1, 1) + bits.RotateLeft64(v2, 7) + bits.RotateLeft64(v3, 12) + bits.RotateLeft64(v4, 18)
{
var temp uint64
temp += v1 * prime2
temp = bits.RotateLeft64(temp, 31)
temp *= prime1
h ^= temp
h = h*prime1 + prime4
}
{
var temp uint64
temp += v2 * prime2
temp = bits.RotateLeft64(temp, 31)
temp *= prime1
h ^= temp
h = h*prime1 + prime4
}
{
var temp uint64
temp += v3 * prime2
temp = bits.RotateLeft64(temp, 31)
temp *= prime1
h ^= temp
h = h*prime1 + prime4
}
{
var temp uint64
temp += v4 * prime2
temp = bits.RotateLeft64(temp, 31)
temp *= prime1
h ^= temp
h = h*prime1 + prime4
}
sz_31:
h += n
goto sz_31l
sz_126:
{
b := b_126[:]
var load uint64
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v1 += load * prime2
v1 = bits.RotateLeft64(v1, 31)
v1 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v2 += load * prime2
v2 = bits.RotateLeft64(v2, 31)
v2 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v3 += load * prime2
v3 = bits.RotateLeft64(v3, 31)
v3 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v4 += load * prime2
v4 = bits.RotateLeft64(v4, 31)
v4 *= prime1
b_94 = (*[94]byte)(b_126[32:])
}
sz_94:
{
b := b_94[:]
var load uint64
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v1 += load * prime2
v1 = bits.RotateLeft64(v1, 31)
v1 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v2 += load * prime2
v2 = bits.RotateLeft64(v2, 31)
v2 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v3 += load * prime2
v3 = bits.RotateLeft64(v3, 31)
v3 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v4 += load * prime2
v4 = bits.RotateLeft64(v4, 31)
v4 *= prime1
b_62 = (*[62]byte)(b_94[32:])
}
sz_62:
{
b := b_62[:]
var load uint64
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v1 += load * prime2
v1 = bits.RotateLeft64(v1, 31)
v1 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v2 += load * prime2
v2 = bits.RotateLeft64(v2, 31)
v2 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v3 += load * prime2
v3 = bits.RotateLeft64(v3, 31)
v3 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v4 += load * prime2
v4 = bits.RotateLeft64(v4, 31)
v4 *= prime1
b_30 = (*[30]byte)(b_62[32:])
}
h = bits.RotateLeft64(v1, 1) + bits.RotateLeft64(v2, 7) + bits.RotateLeft64(v3, 12) + bits.RotateLeft64(v4, 18)
{
var temp uint64
temp += v1 * prime2
temp = bits.RotateLeft64(temp, 31)
temp *= prime1
h ^= temp
h = h*prime1 + prime4
}
{
var temp uint64
temp += v2 * prime2
temp = bits.RotateLeft64(temp, 31)
temp *= prime1
h ^= temp
h = h*prime1 + prime4
}
{
var temp uint64
temp += v3 * prime2
temp = bits.RotateLeft64(temp, 31)
temp *= prime1
h ^= temp
h = h*prime1 + prime4
}
{
var temp uint64
temp += v4 * prime2
temp = bits.RotateLeft64(temp, 31)
temp *= prime1
h ^= temp
h = h*prime1 + prime4
}
sz_30:
h += n
goto sz_30l
sz_125:
{
b := b_125[:]
var load uint64
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v1 += load * prime2
v1 = bits.RotateLeft64(v1, 31)
v1 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v2 += load * prime2
v2 = bits.RotateLeft64(v2, 31)
v2 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v3 += load * prime2
v3 = bits.RotateLeft64(v3, 31)
v3 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v4 += load * prime2
v4 = bits.RotateLeft64(v4, 31)
v4 *= prime1
b_93 = (*[93]byte)(b_125[32:])
}
sz_93:
{
b := b_93[:]
var load uint64
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v1 += load * prime2
v1 = bits.RotateLeft64(v1, 31)
v1 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v2 += load * prime2
v2 = bits.RotateLeft64(v2, 31)
v2 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v3 += load * prime2
v3 = bits.RotateLeft64(v3, 31)
v3 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v4 += load * prime2
v4 = bits.RotateLeft64(v4, 31)
v4 *= prime1
b_61 = (*[61]byte)(b_93[32:])
}
sz_61:
{
b := b_61[:]
var load uint64
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v1 += load * prime2
v1 = bits.RotateLeft64(v1, 31)
v1 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v2 += load * prime2
v2 = bits.RotateLeft64(v2, 31)
v2 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v3 += load * prime2
v3 = bits.RotateLeft64(v3, 31)
v3 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v4 += load * prime2
v4 = bits.RotateLeft64(v4, 31)
v4 *= prime1
b_29 = (*[29]byte)(b_61[32:])
}
h = bits.RotateLeft64(v1, 1) + bits.RotateLeft64(v2, 7) + bits.RotateLeft64(v3, 12) + bits.RotateLeft64(v4, 18)
{
var temp uint64
temp += v1 * prime2
temp = bits.RotateLeft64(temp, 31)
temp *= prime1
h ^= temp
h = h*prime1 + prime4
}
{
var temp uint64
temp += v2 * prime2
temp = bits.RotateLeft64(temp, 31)
temp *= prime1
h ^= temp
h = h*prime1 + prime4
}
{
var temp uint64
temp += v3 * prime2
temp = bits.RotateLeft64(temp, 31)
temp *= prime1
h ^= temp
h = h*prime1 + prime4
}
{
var temp uint64
temp += v4 * prime2
temp = bits.RotateLeft64(temp, 31)
temp *= prime1
h ^= temp
h = h*prime1 + prime4
}
sz_29:
h += n
goto sz_29l
sz_124:
{
b := b_124[:]
var load uint64
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v1 += load * prime2
v1 = bits.RotateLeft64(v1, 31)
v1 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v2 += load * prime2
v2 = bits.RotateLeft64(v2, 31)
v2 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v3 += load * prime2
v3 = bits.RotateLeft64(v3, 31)
v3 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v4 += load * prime2
v4 = bits.RotateLeft64(v4, 31)
v4 *= prime1
b_92 = (*[92]byte)(b_124[32:])
}
sz_92:
{
b := b_92[:]
var load uint64
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v1 += load * prime2
v1 = bits.RotateLeft64(v1, 31)
v1 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v2 += load * prime2
v2 = bits.RotateLeft64(v2, 31)
v2 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v3 += load * prime2
v3 = bits.RotateLeft64(v3, 31)
v3 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v4 += load * prime2
v4 = bits.RotateLeft64(v4, 31)
v4 *= prime1
b_60 = (*[60]byte)(b_92[32:])
}
sz_60:
{
b := b_60[:]
var load uint64
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v1 += load * prime2
v1 = bits.RotateLeft64(v1, 31)
v1 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v2 += load * prime2
v2 = bits.RotateLeft64(v2, 31)
v2 *= prime1
load = uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56 // Work around for go.dev/issue/68081.
b = b[8:]
v3 += load * prime2
v3 = bits.RotateLeft64(v3, 31)