forked from tensorchord/pgvecto.rs
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsvecf32.rs
842 lines (791 loc) · 28 KB
/
svecf32.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
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
use crate::scalar::F32;
use crate::vector::{VectorBorrowed, VectorKind, VectorOwned};
use num_traits::{Float, Zero};
use serde::{Deserialize, Serialize};
use std::ops::{Bound, RangeBounds};
#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct SVecf32Owned {
dims: u32,
indexes: Vec<u32>,
values: Vec<F32>,
}
impl SVecf32Owned {
#[inline(always)]
pub fn new(dims: u32, indexes: Vec<u32>, values: Vec<F32>) -> Self {
Self::new_checked(dims, indexes, values).expect("invalid data")
}
#[inline(always)]
pub fn new_checked(dims: u32, indexes: Vec<u32>, values: Vec<F32>) -> Option<Self> {
if !(1..=1_048_575).contains(&dims) {
return None;
}
if indexes.len() != values.len() {
return None;
}
let len = indexes.len();
for i in 1..len {
if !(indexes[i - 1] < indexes[i]) {
return None;
}
}
if len != 0 && !(indexes[len - 1] < dims) {
return None;
}
for i in 0..len {
if values[i].is_zero() {
return None;
}
}
unsafe { Some(Self::new_unchecked(dims, indexes, values)) }
}
/// # Safety
///
/// * `dims` must be in `1..=1_048_575`.
/// * `indexes.len()` must be equal to `values.len()`.
/// * `indexes` must be a strictly increasing sequence and the last in the sequence must be less than `dims`.
/// * A floating number in `values` must not be positive zero or negative zero.
#[inline(always)]
pub unsafe fn new_unchecked(dims: u32, indexes: Vec<u32>, values: Vec<F32>) -> Self {
Self {
dims,
indexes,
values,
}
}
#[inline(always)]
pub fn indexes(&self) -> &[u32] {
&self.indexes
}
#[inline(always)]
pub fn values(&self) -> &[F32] {
&self.values
}
}
impl VectorOwned for SVecf32Owned {
type Scalar = F32;
type Borrowed<'a> = SVecf32Borrowed<'a>;
const VECTOR_KIND: VectorKind = VectorKind::SVecf32;
#[inline(always)]
fn as_borrowed(&self) -> SVecf32Borrowed<'_> {
SVecf32Borrowed {
dims: self.dims,
indexes: &self.indexes,
values: &self.values,
}
}
}
#[derive(Debug, Clone, Copy)]
pub struct SVecf32Borrowed<'a> {
dims: u32,
indexes: &'a [u32],
values: &'a [F32],
}
impl<'a> SVecf32Borrowed<'a> {
#[inline(always)]
pub fn new(dims: u32, indexes: &'a [u32], values: &'a [F32]) -> Self {
Self::new_checked(dims, indexes, values).expect("invalid data")
}
#[inline(always)]
pub fn new_checked(dims: u32, indexes: &'a [u32], values: &'a [F32]) -> Option<Self> {
if !(1..=1_048_575).contains(&dims) {
return None;
}
if indexes.len() != values.len() {
return None;
}
let len = indexes.len();
for i in 1..len {
if !(indexes[i - 1] < indexes[i]) {
return None;
}
}
if len != 0 && !(indexes[len - 1] < dims) {
return None;
}
for i in 0..len {
if values[i].is_zero() {
return None;
}
}
unsafe { Some(Self::new_unchecked(dims, indexes, values)) }
}
/// # Safety
///
/// * `dims` must be in `1..=1_048_575`.
/// * `indexes.len()` must be equal to `values.len()`.
/// * `indexes` must be a strictly increasing sequence and the last in the sequence must be less than `dims`.
/// * A floating number in `values` must not be positive zero or negative zero.
#[inline(always)]
pub unsafe fn new_unchecked(dims: u32, indexes: &'a [u32], values: &'a [F32]) -> Self {
Self {
dims,
indexes,
values,
}
}
#[inline(always)]
pub fn indexes(&self) -> &'a [u32] {
self.indexes
}
#[inline(always)]
pub fn values(&self) -> &'a [F32] {
self.values
}
#[inline(always)]
pub fn len(&self) -> u32 {
self.indexes.len() as u32
}
}
impl<'a> VectorBorrowed for SVecf32Borrowed<'a> {
type Scalar = F32;
type Owned = SVecf32Owned;
#[inline(always)]
fn dims(&self) -> u32 {
self.dims
}
#[inline(always)]
fn own(&self) -> SVecf32Owned {
SVecf32Owned {
dims: self.dims,
indexes: self.indexes.to_vec(),
values: self.values.to_vec(),
}
}
#[inline(always)]
fn to_vec(&self) -> Vec<F32> {
let mut dense = vec![F32::zero(); self.dims as usize];
for (&index, &value) in self.indexes.iter().zip(self.values.iter()) {
dense[index as usize] = value;
}
dense
}
#[inline(always)]
fn norm(&self) -> F32 {
length(*self)
}
#[inline(always)]
fn operator_dot(self, rhs: Self) -> F32 {
dot(self, rhs) * (-1.0)
}
#[inline(always)]
fn operator_l2(self, rhs: Self) -> F32 {
sl2(self, rhs)
}
#[inline(always)]
fn operator_cos(self, rhs: Self) -> F32 {
F32(1.0) - dot(self, rhs) / (self.norm() * rhs.norm())
}
#[inline(always)]
fn operator_hamming(self, _: Self) -> F32 {
unimplemented!()
}
#[inline(always)]
fn operator_jaccard(self, _: Self) -> F32 {
unimplemented!()
}
#[inline(always)]
fn function_normalize(&self) -> SVecf32Owned {
let mut own = self.own();
l2_normalize(&mut own);
own
}
fn operator_add(&self, rhs: Self) -> Self::Owned {
assert_eq!(self.dims, rhs.dims);
let size1 = self.len();
let size2 = rhs.len();
let mut pos1 = 0;
let mut pos2 = 0;
let mut pos = 0;
let mut indexes = vec![0; (size1 + size2) as _];
let mut values = vec![F32::zero(); (size1 + size2) as _];
while pos1 < size1 && pos2 < size2 {
let lhs_index = self.indexes[pos1 as usize];
let rhs_index = rhs.indexes[pos2 as usize];
let lhs_value = self.values[pos1 as usize];
let rhs_value = rhs.values[pos2 as usize];
indexes[pos] = lhs_index.min(rhs_index);
values[pos] = F32((lhs_index <= rhs_index) as u32 as f32) * lhs_value
+ F32((lhs_index >= rhs_index) as u32 as f32) * rhs_value;
pos1 += (lhs_index <= rhs_index) as u32;
pos2 += (lhs_index >= rhs_index) as u32;
pos += (!values[pos].is_zero()) as usize;
}
for i in pos1..size1 {
indexes[pos] = self.indexes[i as usize];
values[pos] = self.values[i as usize];
pos += 1;
}
for i in pos2..size2 {
indexes[pos] = rhs.indexes[i as usize];
values[pos] = rhs.values[i as usize];
pos += 1;
}
indexes.truncate(pos);
values.truncate(pos);
SVecf32Owned::new(self.dims, indexes, values)
}
fn operator_minus(&self, rhs: Self) -> Self::Owned {
assert_eq!(self.dims, rhs.dims);
let size1 = self.len();
let size2 = rhs.len();
let mut pos1 = 0;
let mut pos2 = 0;
let mut pos = 0;
let mut indexes = vec![0; (size1 + size2) as _];
let mut values = vec![F32::zero(); (size1 + size2) as _];
while pos1 < size1 && pos2 < size2 {
let lhs_index = self.indexes[pos1 as usize];
let rhs_index = rhs.indexes[pos2 as usize];
let lhs_value = self.values[pos1 as usize];
let rhs_value = rhs.values[pos2 as usize];
indexes[pos] = lhs_index.min(rhs_index);
values[pos] = F32((lhs_index <= rhs_index) as u32 as f32) * lhs_value
- F32((lhs_index >= rhs_index) as u32 as f32) * rhs_value;
pos1 += (lhs_index <= rhs_index) as u32;
pos2 += (lhs_index >= rhs_index) as u32;
pos += (!values[pos].is_zero()) as usize;
}
for i in pos1..size1 {
indexes[pos] = self.indexes[i as usize];
values[pos] = self.values[i as usize];
pos += 1;
}
for i in pos2..size2 {
indexes[pos] = rhs.indexes[i as usize];
values[pos] = -rhs.values[i as usize];
pos += 1;
}
indexes.truncate(pos);
values.truncate(pos);
SVecf32Owned::new(self.dims, indexes, values)
}
fn operator_mul(&self, rhs: Self) -> Self::Owned {
assert_eq!(self.dims, rhs.dims);
let size1 = self.len();
let size2 = rhs.len();
let mut pos1 = 0;
let mut pos2 = 0;
let mut pos = 0;
let mut indexes = vec![0; std::cmp::min(size1, size2) as _];
let mut values = vec![F32::zero(); std::cmp::min(size1, size2) as _];
while pos1 < size1 && pos2 < size2 {
let lhs_index = self.indexes[pos1 as usize];
let rhs_index = rhs.indexes[pos2 as usize];
match lhs_index.cmp(&rhs_index) {
std::cmp::Ordering::Less => {
pos1 += 1;
}
std::cmp::Ordering::Equal => {
// only both indexes are not zero, values are multiplied
let lhs_value = self.values[pos1 as usize];
let rhs_value = rhs.values[pos2 as usize];
indexes[pos] = lhs_index;
values[pos] = lhs_value * rhs_value;
pos1 += 1;
pos2 += 1;
// only increment pos if the value is not zero
pos += (!values[pos].is_zero()) as usize;
}
std::cmp::Ordering::Greater => {
pos2 += 1;
}
}
}
indexes.truncate(pos);
values.truncate(pos);
SVecf32Owned::new(self.dims, indexes, values)
}
fn operator_and(&self, _: Self) -> Self::Owned {
unimplemented!()
}
fn operator_or(&self, _: Self) -> Self::Owned {
unimplemented!()
}
fn operator_xor(&self, _: Self) -> Self::Owned {
unimplemented!()
}
#[inline(always)]
fn subvector(&self, bounds: impl RangeBounds<u32>) -> Option<Self::Owned> {
let start = match bounds.start_bound().cloned() {
Bound::Included(x) => x,
Bound::Excluded(u32::MAX) => return None,
Bound::Excluded(x) => x + 1,
Bound::Unbounded => 0,
};
let end = match bounds.end_bound().cloned() {
Bound::Included(u32::MAX) => return None,
Bound::Included(x) => x + 1,
Bound::Excluded(x) => x,
Bound::Unbounded => self.dims,
};
if start >= end || end > self.dims {
return None;
}
let dims = end - start;
let s = self.indexes.partition_point(|&x| x < start);
let e = self.indexes.partition_point(|&x| x < end);
let indexes = self.indexes[s..e]
.iter()
.map(|x| x - start)
.collect::<Vec<_>>();
let values = self.values[s..e].to_vec();
Self::Owned::new_checked(dims, indexes, values)
}
}
impl<'a> PartialEq for SVecf32Borrowed<'a> {
fn eq(&self, other: &Self) -> bool {
if self.dims != other.dims {
return false;
}
if self.indexes.len() != other.indexes.len() {
return false;
}
for (&l, &r) in self.indexes.iter().zip(other.indexes.iter()) {
if l != r {
return false;
}
}
for (&l, &r) in self.values.iter().zip(other.values.iter()) {
if l != r {
return false;
}
}
true
}
}
impl<'a> PartialOrd for SVecf32Borrowed<'a> {
fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
use std::cmp::Ordering;
if self.dims != other.dims {
return None;
}
let mut lhs = self
.indexes
.iter()
.copied()
.zip(self.values.iter().copied());
let mut rhs = other
.indexes
.iter()
.copied()
.zip(other.values.iter().copied());
loop {
return match (lhs.next(), rhs.next()) {
(Some(lh), Some(rh)) => match lh.0.cmp(&rh.0) {
Ordering::Equal => match lh.1.cmp(&rh.1) {
Ordering::Equal => continue,
x => Some(x),
},
Ordering::Less => Some(if lh.1 < F32(0.0) {
Ordering::Less
} else {
Ordering::Greater
}),
Ordering::Greater => Some(if F32(0.0) < rh.1 {
Ordering::Less
} else {
Ordering::Greater
}),
},
(Some((_, x)), None) => Some(x.cmp(&F32(0.0))),
(None, Some((_, y))) => Some(F32(0.0).cmp(&y)),
(None, None) => Some(Ordering::Equal),
};
}
}
}
#[inline]
#[cfg(target_arch = "x86_64")]
#[detect::target_cpu(enable = "v4")]
unsafe fn dot_v4(lhs: SVecf32Borrowed<'_>, rhs: SVecf32Borrowed<'_>) -> F32 {
use std::arch::x86_64::*;
use std::cmp::min;
unsafe {
const W: usize = 16;
let mut lhs_pos = 0;
let mut rhs_pos = 0;
let size1 = lhs.len() as usize;
let size2 = rhs.len() as usize;
let lhs_size = size1 / W * W;
let rhs_size = size2 / W * W;
let lhs_idx = lhs.indexes().as_ptr() as *const i32;
let rhs_idx = rhs.indexes().as_ptr() as *const i32;
let lhs_val = lhs.values().as_ptr() as *const f32;
let rhs_val = rhs.values().as_ptr() as *const f32;
let mut xy = _mm512_setzero_ps();
while lhs_pos < lhs_size && rhs_pos < rhs_size {
let i_l = _mm512_loadu_epi32(lhs_idx.add(lhs_pos));
let i_r = _mm512_loadu_epi32(rhs_idx.add(rhs_pos));
let (m_l, m_r) = emulate_mm512_2intersect_epi32(i_l, i_r);
let v_l = _mm512_loadu_ps(lhs_val.add(lhs_pos));
let v_r = _mm512_loadu_ps(rhs_val.add(rhs_pos));
let v_l = _mm512_maskz_compress_ps(m_l, v_l);
let v_r = _mm512_maskz_compress_ps(m_r, v_r);
xy = _mm512_fmadd_ps(v_l, v_r, xy);
let l_max = lhs.indexes().get_unchecked(lhs_pos + W - 1);
let r_max = rhs.indexes().get_unchecked(rhs_pos + W - 1);
match l_max.cmp(r_max) {
std::cmp::Ordering::Less => {
lhs_pos += W;
}
std::cmp::Ordering::Greater => {
rhs_pos += W;
}
std::cmp::Ordering::Equal => {
lhs_pos += W;
rhs_pos += W;
}
}
}
while lhs_pos < size1 && rhs_pos < size2 {
let len_l = min(W, size1 - lhs_pos);
let len_r = min(W, size2 - rhs_pos);
let mask_l = _bzhi_u32(0xFFFF, len_l as u32) as u16;
let mask_r = _bzhi_u32(0xFFFF, len_r as u32) as u16;
let i_l = _mm512_maskz_loadu_epi32(mask_l, lhs_idx.add(lhs_pos));
let i_r = _mm512_maskz_loadu_epi32(mask_r, rhs_idx.add(rhs_pos));
let (m_l, m_r) = emulate_mm512_2intersect_epi32(i_l, i_r);
let v_l = _mm512_maskz_loadu_ps(mask_l, lhs_val.add(lhs_pos));
let v_r = _mm512_maskz_loadu_ps(mask_r, rhs_val.add(rhs_pos));
let v_l = _mm512_maskz_compress_ps(m_l, v_l);
let v_r = _mm512_maskz_compress_ps(m_r, v_r);
xy = _mm512_fmadd_ps(v_l, v_r, xy);
let l_max = lhs.indexes().get_unchecked(lhs_pos + len_l - 1);
let r_max = rhs.indexes().get_unchecked(rhs_pos + len_r - 1);
match l_max.cmp(r_max) {
std::cmp::Ordering::Less => {
lhs_pos += W;
}
std::cmp::Ordering::Greater => {
rhs_pos += W;
}
std::cmp::Ordering::Equal => {
lhs_pos += W;
rhs_pos += W;
}
}
}
F32(_mm512_reduce_add_ps(xy))
}
}
#[cfg(all(target_arch = "x86_64", test))]
#[test]
fn dot_v4_test() {
const EPSILON: F32 = F32(1e-6);
detect::init();
if !detect::v4::detect() {
println!("test {} ... skipped (v4)", module_path!());
return;
}
for _ in 0..300 {
let lhs = random_svector(300);
let rhs = random_svector(350);
let specialized = unsafe { dot_v4(lhs.as_borrowed(), rhs.as_borrowed()) };
let fallback = unsafe { dot_fallback(lhs.as_borrowed(), rhs.as_borrowed()) };
assert!(
(specialized - fallback).abs() < EPSILON,
"specialized = {specialized}, fallback = {fallback}."
);
}
}
#[detect::multiversion(v4 = import, v3, v2, neon, fallback = export)]
pub fn dot(lhs: SVecf32Borrowed<'_>, rhs: SVecf32Borrowed<'_>) -> F32 {
assert_eq!(lhs.dims(), rhs.dims());
let mut lhs_pos = 0;
let mut rhs_pos = 0;
let size1 = lhs.len() as usize;
let size2 = rhs.len() as usize;
let mut xy = F32::zero();
while lhs_pos < size1 && rhs_pos < size2 {
let lhs_index = lhs.indexes()[lhs_pos];
let rhs_index = rhs.indexes()[rhs_pos];
match lhs_index.cmp(&rhs_index) {
std::cmp::Ordering::Less => {
lhs_pos += 1;
}
std::cmp::Ordering::Greater => {
rhs_pos += 1;
}
std::cmp::Ordering::Equal => {
xy += lhs.values()[lhs_pos] * rhs.values()[rhs_pos];
lhs_pos += 1;
rhs_pos += 1;
}
}
}
xy
}
#[detect::multiversion(v4, v3, v2, neon, fallback)]
pub fn dot_2(lhs: SVecf32Borrowed<'_>, rhs: &[F32]) -> F32 {
let mut xy = F32::zero();
for i in 0..lhs.len() as usize {
xy += lhs.values()[i] * rhs[lhs.indexes()[i] as usize];
}
xy
}
#[inline]
#[cfg(target_arch = "x86_64")]
#[detect::target_cpu(enable = "v4")]
unsafe fn sl2_v4(lhs: SVecf32Borrowed<'_>, rhs: SVecf32Borrowed<'_>) -> F32 {
use std::arch::x86_64::*;
use std::cmp::min;
assert_eq!(lhs.dims(), rhs.dims());
unsafe {
const W: usize = 16;
let mut lhs_pos = 0;
let mut rhs_pos = 0;
let size1 = lhs.len() as usize;
let size2 = rhs.len() as usize;
let lhs_size = size1 / W * W;
let rhs_size = size2 / W * W;
let lhs_idx = lhs.indexes().as_ptr() as *const i32;
let rhs_idx = rhs.indexes().as_ptr() as *const i32;
let lhs_val = lhs.values().as_ptr() as *const f32;
let rhs_val = rhs.values().as_ptr() as *const f32;
let mut dd = _mm512_setzero_ps();
while lhs_pos < lhs_size && rhs_pos < rhs_size {
let i_l = _mm512_loadu_epi32(lhs_idx.add(lhs_pos));
let i_r = _mm512_loadu_epi32(rhs_idx.add(rhs_pos));
let (m_l, m_r) = emulate_mm512_2intersect_epi32(i_l, i_r);
let v_l = _mm512_loadu_ps(lhs_val.add(lhs_pos));
let v_r = _mm512_loadu_ps(rhs_val.add(rhs_pos));
let v_l = _mm512_maskz_compress_ps(m_l, v_l);
let v_r = _mm512_maskz_compress_ps(m_r, v_r);
let d = _mm512_sub_ps(v_l, v_r);
dd = _mm512_fmadd_ps(d, d, dd);
dd = _mm512_sub_ps(dd, _mm512_mul_ps(v_l, v_l));
dd = _mm512_sub_ps(dd, _mm512_mul_ps(v_r, v_r));
let l_max = lhs.indexes().get_unchecked(lhs_pos + W - 1);
let r_max = rhs.indexes().get_unchecked(rhs_pos + W - 1);
match l_max.cmp(r_max) {
std::cmp::Ordering::Less => {
lhs_pos += W;
}
std::cmp::Ordering::Greater => {
rhs_pos += W;
}
std::cmp::Ordering::Equal => {
lhs_pos += W;
rhs_pos += W;
}
}
}
while lhs_pos < size1 && rhs_pos < size2 {
let len_l = min(W, size1 - lhs_pos);
let len_r = min(W, size2 - rhs_pos);
let mask_l = _bzhi_u32(0xFFFF, len_l as u32) as u16;
let mask_r = _bzhi_u32(0xFFFF, len_r as u32) as u16;
let i_l = _mm512_maskz_loadu_epi32(mask_l, lhs_idx.add(lhs_pos));
let i_r = _mm512_maskz_loadu_epi32(mask_r, rhs_idx.add(rhs_pos));
let (m_l, m_r) = emulate_mm512_2intersect_epi32(i_l, i_r);
let v_l = _mm512_maskz_loadu_ps(mask_l, lhs_val.add(lhs_pos));
let v_r = _mm512_maskz_loadu_ps(mask_r, rhs_val.add(rhs_pos));
let v_l = _mm512_maskz_compress_ps(m_l, v_l);
let v_r = _mm512_maskz_compress_ps(m_r, v_r);
let d = _mm512_sub_ps(v_l, v_r);
dd = _mm512_fmadd_ps(d, d, dd);
dd = _mm512_sub_ps(dd, _mm512_mul_ps(v_l, v_l));
dd = _mm512_sub_ps(dd, _mm512_mul_ps(v_r, v_r));
let l_max = lhs.indexes().get_unchecked(lhs_pos + len_l - 1);
let r_max = rhs.indexes().get_unchecked(rhs_pos + len_r - 1);
match l_max.cmp(r_max) {
std::cmp::Ordering::Less => {
lhs_pos += W;
}
std::cmp::Ordering::Greater => {
rhs_pos += W;
}
std::cmp::Ordering::Equal => {
lhs_pos += W;
rhs_pos += W;
}
}
}
let mut lhs_pos = 0;
while lhs_pos < lhs_size {
let v = _mm512_loadu_ps(lhs_val.add(lhs_pos));
dd = _mm512_fmadd_ps(v, v, dd);
lhs_pos += W;
}
let v = _mm512_maskz_loadu_ps(
_bzhi_u32(0xFFFF, (size1 - lhs_pos) as u32) as u16,
lhs_val.add(lhs_pos),
);
dd = _mm512_fmadd_ps(v, v, dd);
let mut rhs_pos = 0;
while rhs_pos < rhs_size {
let v = _mm512_loadu_ps(rhs_val.add(rhs_pos));
dd = _mm512_fmadd_ps(v, v, dd);
rhs_pos += W;
}
let v = _mm512_maskz_loadu_ps(
_bzhi_u32(0xFFFF, (size2 - rhs_pos) as u32) as u16,
rhs_val.add(rhs_pos),
);
dd = _mm512_fmadd_ps(v, v, dd);
F32(_mm512_reduce_add_ps(dd))
}
}
#[cfg(all(target_arch = "x86_64", test))]
#[test]
fn sl2_v4_test() {
const EPSILON: F32 = F32(5e-4);
detect::init();
if !detect::v4::detect() {
println!("test {} ... skipped (v4)", module_path!());
return;
}
for _ in 0..300 {
let lhs = random_svector(300);
let rhs = random_svector(350);
let specialized = unsafe { sl2_v4(lhs.as_borrowed(), rhs.as_borrowed()) };
let fallback = unsafe { sl2_fallback(lhs.as_borrowed(), rhs.as_borrowed()) };
assert!(
(specialized - fallback).abs() < EPSILON,
"specialized = {specialized}, fallback = {fallback}."
);
}
}
#[detect::multiversion(v4 = import, v3, v2, neon, fallback = export)]
pub fn sl2(lhs: SVecf32Borrowed<'_>, rhs: SVecf32Borrowed<'_>) -> F32 {
assert_eq!(lhs.dims(), rhs.dims());
let mut lhs_pos = 0;
let mut rhs_pos = 0;
let size1 = lhs.len() as usize;
let size2 = rhs.len() as usize;
let mut d2 = F32::zero();
while lhs_pos < size1 && rhs_pos < size2 {
let lhs_index = lhs.indexes()[lhs_pos];
let rhs_index = rhs.indexes()[rhs_pos];
match lhs_index.cmp(&rhs_index) {
std::cmp::Ordering::Equal => {
let d = lhs.values()[lhs_pos] - rhs.values()[rhs_pos];
d2 += d * d;
lhs_pos += 1;
rhs_pos += 1;
}
std::cmp::Ordering::Less => {
d2 += lhs.values()[lhs_pos] * lhs.values()[lhs_pos];
lhs_pos += 1;
}
std::cmp::Ordering::Greater => {
d2 += rhs.values()[rhs_pos] * rhs.values()[rhs_pos];
rhs_pos += 1;
}
}
}
for i in lhs_pos..size1 {
d2 += lhs.values()[i] * lhs.values()[i];
}
for i in rhs_pos..size2 {
d2 += rhs.values()[i] * rhs.values()[i];
}
d2
}
#[detect::multiversion(v4, v3, v2, neon, fallback)]
pub fn sl2_2(lhs: SVecf32Borrowed<'_>, rhs: &[F32]) -> F32 {
let mut d2 = F32::zero();
let mut lhs_pos = 0;
let mut rhs_pos = 0;
while lhs_pos < lhs.len() {
let index_eq = lhs.indexes()[lhs_pos as usize] == rhs_pos;
let d =
F32(index_eq as u32 as f32) * lhs.values()[lhs_pos as usize] - rhs[rhs_pos as usize];
d2 += d * d;
lhs_pos += index_eq as u32;
rhs_pos += 1;
}
for i in rhs_pos..rhs.len() as u32 {
d2 += rhs[i as usize] * rhs[i as usize];
}
d2
}
#[detect::multiversion(v4, v3, v2, neon, fallback)]
pub fn length(vector: SVecf32Borrowed<'_>) -> F32 {
let mut dot = F32::zero();
for &i in vector.values() {
dot += i * i;
}
dot.sqrt()
}
#[detect::multiversion(v4, v3, v2, neon, fallback)]
pub fn l2_normalize(vector: &mut SVecf32Owned) {
let l = length(vector.as_borrowed());
let dims = vector.dims;
let indexes = vector.indexes().to_vec();
let mut values = vector.values().to_vec();
for i in values.iter_mut() {
*i /= l;
}
*vector = SVecf32Owned::new(dims, indexes, values);
}
// VP2INTERSECT emulation.
// Díez-Cañas, G. (2021). Faster-Than-Native Alternatives for x86 VP2INTERSECT
// Instructions. arXiv preprint arXiv:2112.06342.
#[inline]
#[cfg(target_arch = "x86_64")]
#[detect::target_cpu(enable = "v4")]
unsafe fn emulate_mm512_2intersect_epi32(
a: std::arch::x86_64::__m512i,
b: std::arch::x86_64::__m512i,
) -> (std::arch::x86_64::__mmask16, std::arch::x86_64::__mmask16) {
use std::arch::x86_64::*;
unsafe {
let a1 = _mm512_alignr_epi32(a, a, 4);
let a2 = _mm512_alignr_epi32(a, a, 8);
let a3 = _mm512_alignr_epi32(a, a, 12);
let b1 = _mm512_shuffle_epi32(b, _MM_PERM_ADCB);
let b2 = _mm512_shuffle_epi32(b, _MM_PERM_BADC);
let b3 = _mm512_shuffle_epi32(b, _MM_PERM_CBAD);
let m00 = _mm512_cmpeq_epi32_mask(a, b);
let m01 = _mm512_cmpeq_epi32_mask(a, b1);
let m02 = _mm512_cmpeq_epi32_mask(a, b2);
let m03 = _mm512_cmpeq_epi32_mask(a, b3);
let m10 = _mm512_cmpeq_epi32_mask(a1, b);
let m11 = _mm512_cmpeq_epi32_mask(a1, b1);
let m12 = _mm512_cmpeq_epi32_mask(a1, b2);
let m13 = _mm512_cmpeq_epi32_mask(a1, b3);
let m20 = _mm512_cmpeq_epi32_mask(a2, b);
let m21 = _mm512_cmpeq_epi32_mask(a2, b1);
let m22 = _mm512_cmpeq_epi32_mask(a2, b2);
let m23 = _mm512_cmpeq_epi32_mask(a2, b3);
let m30 = _mm512_cmpeq_epi32_mask(a3, b);
let m31 = _mm512_cmpeq_epi32_mask(a3, b1);
let m32 = _mm512_cmpeq_epi32_mask(a3, b2);
let m33 = _mm512_cmpeq_epi32_mask(a3, b3);
let m0 = m00 | m10 | m20 | m30;
let m1 = m01 | m11 | m21 | m31;
let m2 = m02 | m12 | m22 | m32;
let m3 = m03 | m13 | m23 | m33;
let res_a = m00
| m01
| m02
| m03
| (m10 | m11 | m12 | m13).rotate_left(4)
| (m20 | m21 | m22 | m23).rotate_left(8)
| (m30 | m31 | m32 | m33).rotate_right(4);
let res_b = m0
| ((0x7777 & m1) << 1)
| ((m1 >> 3) & 0x1111)
| ((0x3333 & m2) << 2)
| ((m2 >> 2) & 0x3333)
| ((0x1111 & m3) << 3)
| ((m3 >> 1) & 0x7777);
(res_a, res_b)
}
}
#[cfg(all(target_arch = "x86_64", test))]
fn random_svector(len: usize) -> SVecf32Owned {
use rand::Rng;
let mut rng = rand::thread_rng();
let mut indexes = rand::seq::index::sample(&mut rand::thread_rng(), 30000, len)
.into_iter()
.map(|x| x as _)
.collect::<Vec<u32>>();
indexes.sort();
let values: Vec<F32> = std::iter::from_fn(|| Some(F32(rng.gen_range(-1.0..1.0))))
.filter(|x| !x.is_zero())
.take(indexes.len())
.collect::<Vec<F32>>();
SVecf32Owned::new(30000, indexes, values)
}