-
Notifications
You must be signed in to change notification settings - Fork 60
Expand file tree
/
Copy pathintersection.cpp
More file actions
1334 lines (1213 loc) · 46.7 KB
/
intersection.cpp
File metadata and controls
1334 lines (1213 loc) · 46.7 KB
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
/**
* This code is released under the
* Apache License Version 2.0 http://www.apache.org/licenses/.
*
*/
#include "intersection.h"
namespace SIMDCompressionLib {
/**
* This is often called galloping or exponential search.
*
* Used by frogintersectioncardinality below
*
* Based on binary search...
* Find the smallest integer larger than pos such
* that array[pos]>= min.
* If none can be found, return array.length.
* From code by O. Kaser.
*/
static size_t __frogadvanceUntil(const uint32_t *array, const size_t pos,
const size_t length, const size_t min) {
size_t lower = pos + 1;
// special handling for a possibly common sequential case
if ((lower >= length) or (array[lower] >= min)) {
return lower;
}
size_t spansize = 1; // could set larger
// bootstrap an upper limit
while ((lower + spansize < length) and (array[lower + spansize] < min))
spansize *= 2;
size_t upper = (lower + spansize < length) ? lower + spansize : length - 1;
if (array[upper] < min) { // means array has no item >= min
return length;
}
// we know that the next-smallest span was too small
lower += (spansize / 2);
// else begin binary search
size_t mid = 0;
while (lower + 1 != upper) {
mid = (lower + upper) / 2;
if (array[mid] == min) {
return mid;
} else if (array[mid] < min)
lower = mid;
else
upper = mid;
}
return upper;
}
size_t onesidedgallopingintersection(const uint32_t *smallset,
const size_t smalllength,
const uint32_t *largeset,
const size_t largelength, uint32_t *out) {
if (largelength < smalllength)
return onesidedgallopingintersection(largeset, largelength, smallset,
smalllength, out);
if (0 == smalllength)
return 0;
const uint32_t *const initout(out);
size_t k1 = 0, k2 = 0;
while (true) {
if (largeset[k1] < smallset[k2]) {
k1 = __frogadvanceUntil(largeset, k1, largelength, smallset[k2]);
if (k1 == largelength)
break;
}
midpoint:
if (smallset[k2] < largeset[k1]) {
++k2;
if (k2 == smalllength)
break;
} else {
*out++ = smallset[k2];
++k2;
if (k2 == smalllength)
break;
k1 = __frogadvanceUntil(largeset, k1, largelength, smallset[k2]);
if (k1 == largelength)
break;
goto midpoint;
}
}
return out - initout;
}
// from: http://didawiki.di.unipi.it/doku.php/magistraleinformaticanetworking/ae/ae2019/start#books_notes_etc
// "The magic of Algorithms! "
// Chap. 6, Algorithm 6.1 Intersection based on Mutual Partitioning
//
size_t mutualPartitioningIntersect(const uint32_t* small_set, size_t small_length,
const uint32_t* large_set, size_t large_length,
uint32_t * result) {
if ((small_length <= 0) || (large_length <= 0)) {
return 0;
}
if (small_length > large_length) {
return mutualPartitioningIntersect(large_set, large_length, small_set, small_length, result);
}
int mid_index = small_length / 2;
const auto mid_val = small_set[mid_index];
auto it = std::lower_bound(large_set, large_set + large_length, mid_val);
size_t out_num = mutualPartitioningIntersect(small_set, mid_index, large_set, it - large_set, result);
if (it == large_set + large_length) {
return out_num;
}
result += out_num;
if (*it == mid_val) {
*result++ = mid_val;
++it;
++out_num;
}
++mid_index;
return out_num + mutualPartitioningIntersect(small_set + mid_index, small_length - mid_index,
it, large_set + large_length - it, result);
}
/**
* Fast scalar scheme designed by N. Kurz.
*/
size_t scalar(const uint32_t *A, const size_t lenA, const uint32_t *B,
const size_t lenB, uint32_t *out) {
const uint32_t *const initout(out);
if (lenA == 0 || lenB == 0)
return 0;
const uint32_t *endA = A + lenA;
const uint32_t *endB = B + lenB;
while (1) {
while (*A < *B) {
SKIP_FIRST_COMPARE:
if (++A == endA)
return (out - initout);
}
while (*A > *B) {
if (++B == endB)
return (out - initout);
}
if (*A == *B) {
*out++ = *A;
if (++A == endA || ++B == endB)
return (out - initout);
} else {
goto SKIP_FIRST_COMPARE;
}
}
return (out - initout); // NOTREACHED
}
size_t match_scalar(const uint32_t *A, const size_t lenA, const uint32_t *B,
const size_t lenB, uint32_t *out) {
const uint32_t *initout = out;
if (lenA == 0 || lenB == 0)
return 0;
const uint32_t *endA = A + lenA;
const uint32_t *endB = B + lenB;
while (1) {
while (*A < *B) {
SKIP_FIRST_COMPARE:
if (++A == endA)
goto FINISH;
}
while (*A > *B) {
if (++B == endB)
goto FINISH;
}
if (*A == *B) {
*out++ = *A;
if (++A == endA || ++B == endB)
goto FINISH;
} else {
goto SKIP_FIRST_COMPARE;
}
}
FINISH:
return (out - initout);
}
#ifdef __GNUC__
#define COMPILER_LIKELY(x) __builtin_expect((x), 1)
#define COMPILER_RARELY(x) __builtin_expect((x), 0)
#else
#define COMPILER_LIKELY(x) x
#define COMPILER_RARELY(x) x
#endif
/**
* Intersections scheme designed by N. Kurz that works very
* well when intersecting an array with another where the density
* differential is small (between 2 to 10).
*
* It assumes that lenRare <= lenFreq.
*
* Note that this is not symmetric: flipping the rare and freq pointers
* as well as lenRare and lenFreq could lead to significant performance
* differences.
*
* The matchOut pointer can safely be equal to the rare pointer.
*
*/
size_t v1(const uint32_t *rare, size_t lenRare, const uint32_t *freq,
size_t lenFreq, uint32_t *matchOut) {
if(matchOut == freq) { throw invalid_argument("matchOut should not be freq, when in doubt, use a distinct output buffer."); }
if(lenRare > lenFreq) { throw invalid_argument("mismatch freq/rare (programming error?)."); }
const uint32_t *matchOrig = matchOut;
if (lenFreq == 0 || lenRare == 0)
return 0;
const uint64_t kFreqSpace = 2 * 4 * (0 + 1) - 1;
const uint64_t kRareSpace = 0;
const uint32_t *stopFreq = &freq[lenFreq] - kFreqSpace;
const uint32_t *stopRare = &rare[lenRare] - kRareSpace;
__m128i Rare;
__m128i F0, F1;
if (COMPILER_RARELY((rare >= stopRare) || (freq >= stopFreq)))
goto FINISH_SCALAR;
uint32_t valRare;
valRare = rare[0];
Rare = _mm_set1_epi32(valRare);
uint64_t maxFreq;
maxFreq = freq[2 * 4 - 1];
F0 = _mm_lddqu_si128(reinterpret_cast<const __m128i *>(freq));
F1 = _mm_lddqu_si128(reinterpret_cast<const __m128i *>(freq + 4));
if (COMPILER_RARELY(maxFreq < valRare))
goto ADVANCE_FREQ;
ADVANCE_RARE:
do {
*matchOut = valRare;
rare += 1;
if (COMPILER_RARELY(rare >= stopRare)) {
rare -= 1;
goto FINISH_SCALAR;
}
valRare = rare[0]; // for next iteration
F0 = _mm_cmpeq_epi32(F0, Rare);
F1 = _mm_cmpeq_epi32(F1, Rare);
Rare = _mm_set1_epi32(valRare);
F0 = _mm_or_si128(F0, F1);
#ifdef __SSE4_1__
if (_mm_testz_si128(F0, F0) == 0)
matchOut++;
#else
if (_mm_movemask_epi8(F0))
matchOut++;
#endif
F0 = _mm_lddqu_si128(reinterpret_cast<const __m128i *>(freq));
F1 = _mm_lddqu_si128(reinterpret_cast<const __m128i *>(freq + 4));
} while (maxFreq >= valRare);
uint64_t maxProbe;
ADVANCE_FREQ:
do {
const uint64_t kProbe = (0 + 1) * 2 * 4;
const uint32_t *probeFreq = freq + kProbe;
if (COMPILER_RARELY(probeFreq >= stopFreq)) {
goto FINISH_SCALAR;
}
maxProbe = freq[(0 + 2) * 2 * 4 - 1];
freq = probeFreq;
} while (maxProbe < valRare);
maxFreq = maxProbe;
F0 = _mm_lddqu_si128(reinterpret_cast<const __m128i *>(freq));
F1 = _mm_lddqu_si128(reinterpret_cast<const __m128i *>(freq + 4));
goto ADVANCE_RARE;
size_t count;
FINISH_SCALAR:
count = matchOut - matchOrig;
lenFreq = stopFreq + kFreqSpace - freq;
lenRare = stopRare + kRareSpace - rare;
size_t tail = match_scalar(freq, lenFreq, rare, lenRare, matchOut);
return count + tail;
}
/**
* This intersection function is similar to v1, but is faster when
* the difference between lenRare and lenFreq is large, but not too large.
* It assumes that lenRare <= lenFreq.
*
* Note that this is not symmetric: flipping the rare and freq pointers
* as well as lenRare and lenFreq could lead to significant performance
* differences.
*
* The out pointer can safely be equal to the rare pointer.
*
* This function DOES NOT use inline assembly instructions. Just intrinsics.
*/
size_t v3(const uint32_t *rare, const size_t lenRare, const uint32_t *freq,
const size_t lenFreq, uint32_t *out) {
if (lenFreq == 0 || lenRare == 0)
return 0;
if(out == freq) { throw invalid_argument("matchOut should not be freq, when in doubt, use a distinct output buffer."); }
if(lenRare > lenFreq) { throw invalid_argument("mismatch freq/rare (programming error?)."); }
const uint32_t *const initout(out);
typedef __m128i vec;
const uint32_t veclen = sizeof(vec) / sizeof(uint32_t);
const size_t vecmax = veclen - 1;
const size_t freqspace = 32 * veclen;
const size_t rarespace = 1;
const uint32_t *stopFreq = freq + lenFreq - freqspace;
const uint32_t *stopRare = rare + lenRare - rarespace;
if (freq > stopFreq) {
return scalar(freq, lenFreq, rare, lenRare, out);
}
while (freq[veclen * 31 + vecmax] < *rare) {
freq += veclen * 32;
if (freq > stopFreq)
goto FINISH_SCALAR;
}
for (; rare < stopRare; ++rare) {
const uint32_t matchRare = *rare; // nextRare;
const vec Match = _mm_set1_epi32(matchRare);
while (freq[veclen * 31 + vecmax] < matchRare) { // if no match possible
freq += veclen * 32; // advance 32 vectors
if (freq > stopFreq)
goto FINISH_SCALAR;
}
vec Q0, Q1, Q2, Q3;
if (freq[veclen * 15 + vecmax] >= matchRare) {
if (freq[veclen * 7 + vecmax] < matchRare) {
Q0 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 8),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 9),
Match));
Q1 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 10),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 11),
Match));
Q2 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 12),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 13),
Match));
Q3 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 14),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 15),
Match));
} else {
Q0 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 4),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 5),
Match));
Q1 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 6),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 7),
Match));
Q2 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 0),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 1),
Match));
Q3 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 2),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 3),
Match));
}
} else {
if (freq[veclen * 23 + vecmax] < matchRare) {
Q0 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 8 + 16),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 9 + 16),
Match));
Q1 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 10 + 16),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 11 + 16),
Match));
Q2 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 12 + 16),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 13 + 16),
Match));
Q3 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 14 + 16),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 15 + 16),
Match));
} else {
Q0 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 4 + 16),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 5 + 16),
Match));
Q1 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 6 + 16),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 7 + 16),
Match));
Q2 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 0 + 16),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 1 + 16),
Match));
Q3 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 2 + 16),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 3 + 16),
Match));
}
}
const vec F0 = _mm_or_si128(_mm_or_si128(Q0, Q1), _mm_or_si128(Q2, Q3));
#ifdef __SSE4_1__
if (_mm_testz_si128(F0, F0)) {
#else
if (!_mm_movemask_epi8(F0)) {
#endif
} else {
*out++ = matchRare;
}
}
FINISH_SCALAR:
return (out - initout) + scalar(freq, stopFreq + freqspace - freq, rare,
stopRare + rarespace - rare, out);
}
/**
* This is the SIMD galloping function. This intersection function works well
* when lenRare and lenFreq have vastly different values.
*
* It assumes that lenRare <= lenFreq.
*
* Note that this is not symmetric: flipping the rare and freq pointers
* as well as lenRare and lenFreq could lead to significant performance
* differences.
*
* The out pointer can safely be equal to the rare pointer.
*
* This function DOES NOT use assembly. It only relies on intrinsics.
*/
size_t SIMDgalloping(const uint32_t *rare, const size_t lenRare,
const uint32_t *freq, const size_t lenFreq,
uint32_t *out) {
if (lenFreq == 0 || lenRare == 0)
return 0;
if(out == freq) { throw invalid_argument("matchOut should not be freq, when in doubt, use a distinct output buffer."); }
if(lenRare > lenFreq) { throw invalid_argument("mismatch freq/rare (programming error?)."); }
const uint32_t *const initout(out);
typedef __m128i vec;
const uint32_t veclen = sizeof(vec) / sizeof(uint32_t);
const size_t vecmax = veclen - 1;
const size_t freqspace = 32 * veclen;
const size_t rarespace = 1;
const uint32_t *stopFreq = freq + lenFreq - freqspace;
const uint32_t *stopRare = rare + lenRare - rarespace;
if (freq > stopFreq) {
return scalar(freq, lenFreq, rare, lenRare, out);
}
for (; rare < stopRare; ++rare) {
const uint32_t matchRare = *rare; // nextRare;
const vec Match = _mm_set1_epi32(matchRare);
if (freq[veclen * 31 + vecmax] < matchRare) { // if no match possible
uint32_t offset = 1;
if (freq + veclen * 32 > stopFreq) {
freq += veclen * 32;
goto FINISH_SCALAR;
}
while (freq[veclen * offset * 32 + veclen * 31 + vecmax] <
matchRare) { // if no match possible
if (freq + veclen * (2 * offset) * 32 <= stopFreq) {
offset *= 2;
} else if (freq + veclen * (offset + 1) * 32 <= stopFreq) {
offset = static_cast<uint32_t>((stopFreq - freq) / (veclen * 32));
// offset += 1;
if (freq[veclen * offset * 32 + veclen * 31 + vecmax] < matchRare) {
freq += veclen * offset * 32;
goto FINISH_SCALAR;
} else {
break;
}
} else {
freq += veclen * offset * 32;
goto FINISH_SCALAR;
}
}
uint32_t lower = offset / 2;
while (lower + 1 != offset) {
const uint32_t mid = (lower + offset) / 2;
if (freq[veclen * mid * 32 + veclen * 31 + vecmax] < matchRare)
lower = mid;
else
offset = mid;
}
freq += veclen * offset * 32;
}
vec Q0, Q1, Q2, Q3;
if (freq[veclen * 15 + vecmax] >= matchRare) {
if (freq[veclen * 7 + vecmax] < matchRare) {
Q0 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 8),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 9),
Match));
Q1 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 10),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 11),
Match));
Q2 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 12),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 13),
Match));
Q3 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 14),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 15),
Match));
} else {
Q0 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 4),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 5),
Match));
Q1 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 6),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 7),
Match));
Q2 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 0),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 1),
Match));
Q3 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 2),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 3),
Match));
}
} else {
if (freq[veclen * 23 + vecmax] < matchRare) {
Q0 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 8 + 16),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 9 + 16),
Match));
Q1 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 10 + 16),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 11 + 16),
Match));
Q2 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 12 + 16),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 13 + 16),
Match));
Q3 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 14 + 16),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 15 + 16),
Match));
} else {
Q0 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 4 + 16),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 5 + 16),
Match));
Q1 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 6 + 16),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 7 + 16),
Match));
Q2 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 0 + 16),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 1 + 16),
Match));
Q3 = _mm_or_si128(
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 2 + 16),
Match),
_mm_cmpeq_epi32(
_mm_loadu_si128(reinterpret_cast<const vec *>(freq) + 3 + 16),
Match));
}
}
const vec F0 = _mm_or_si128(_mm_or_si128(Q0, Q1), _mm_or_si128(Q2, Q3));
#ifdef __SSE4_1__
if (_mm_testz_si128(F0, F0)) {
#else
if (!_mm_movemask_epi8(F0)) {
#endif
} else {
*out++ = matchRare;
}
}
FINISH_SCALAR:
return (out - initout) + scalar(freq, stopFreq + freqspace - freq, rare,
stopRare + rarespace - rare, out);
}
/**
* Our main heuristic.
*
* The out pointer can be set1 if length1<=length2,
* or else it can be set2 if length1>length2.
*/
size_t SIMDintersection(const uint32_t *set1, const size_t length1,
const uint32_t *set2, const size_t length2,
uint32_t *out) {
if (((length1 > length2) && (out == set1)) || ((length2 > length1) && (out == set2))) {
throw invalid_argument("out should not be equal to the largest array.");
}
if ((length1 == 0) or (length2 == 0))
return 0;
if ((1000 * length1 <= length2) or (1000 * length2 <= length1)) {
if (length1 <= length2)
return SIMDgalloping(set1, length1, set2, length2, out);
else
return SIMDgalloping(set2, length2, set1, length1, out);
}
if ((50 * length1 <= length2) or (50 * length2 <= length1)) {
if (length1 <= length2)
return v3(set1, length1, set2, length2, out);
else
return v3(set2, length2, set1, length1, out);
}
if (length1 == length2) {
if(out == set1)
return v1(set1, length1, set2, length2, out);
else
return v1(set2, length2, set1, length1, out);
}
if (length1 <= length2)
return v1(set1, length1, set2, length2, out);
else
return v1(set2, length2, set1, length1, out);
}
#ifdef __AVX2__
size_t v1_avx2
(const uint32_t *rare, size_t lenRare,
const uint32_t *freq, size_t lenFreq,
uint32_t *matchOut) {
assert(lenRare <= lenFreq);
const uint32_t *matchOrig = matchOut;
if (lenFreq == 0 || lenRare == 0) return 0;
const uint64_t kFreqSpace = 2 * 4 * (0 + 1) - 1;
const uint64_t kRareSpace = 0;
const uint32_t *stopFreq = &freq[lenFreq] - kFreqSpace;
const uint32_t *stopRare = &rare[lenRare] - kRareSpace;
__m256i Rare;
__m256i F;
if (COMPILER_RARELY( (rare >= stopRare) || (freq >= stopFreq) )) goto FINISH_SCALAR;
uint32_t valRare;
valRare = rare[0];
Rare = _mm256_set1_epi32(valRare);
uint64_t maxFreq;
maxFreq = freq[2 * 4 - 1];
F = _mm256_loadu_si256(reinterpret_cast<const __m256i *>(freq));
if (COMPILER_RARELY(maxFreq < valRare)) goto ADVANCE_FREQ;
ADVANCE_RARE:
do {
*matchOut = valRare;
valRare = rare[1]; // for next iteration
rare += 1;
if (COMPILER_RARELY(rare >= stopRare)) {
rare -= 1;
goto FINISH_SCALAR;
}
F = _mm256_cmpeq_epi32(F,Rare);
Rare = _mm256_set1_epi32(valRare);
if(_mm256_testz_si256(F,F) == 0)
matchOut ++;
F = _mm256_loadu_si256(reinterpret_cast<const __m256i *>(freq));
} while (maxFreq >= valRare);
uint64_t maxProbe;
ADVANCE_FREQ:
do {
const uint64_t kProbe = (0 + 1) * 2 * 4;
const uint32_t *probeFreq = freq + kProbe;
maxProbe = freq[(0 + 2) * 2 * 4 - 1];
if (COMPILER_RARELY(probeFreq >= stopFreq)) {
goto FINISH_SCALAR;
}
freq = probeFreq;
} while (maxProbe < valRare);
maxFreq = maxProbe;
F = _mm256_loadu_si256(reinterpret_cast<const __m256i *>(freq));
goto ADVANCE_RARE;
size_t count;
FINISH_SCALAR:
count = matchOut - matchOrig;
lenFreq = stopFreq + kFreqSpace - freq;
lenRare = stopRare + kRareSpace - rare;
size_t tail = match_scalar(freq, lenFreq, rare, lenRare, matchOut);
return count + tail;
}
size_t v3_avx2(const uint32_t *rare, const size_t lenRare,
const uint32_t *freq, const size_t lenFreq, uint32_t * out) {
if (lenFreq == 0 || lenRare == 0)
return 0;
assert(lenRare <= lenFreq);
const uint32_t * const initout (out);
typedef __m256i vec;
const uint32_t veclen = sizeof(vec) / sizeof(uint32_t);
const size_t vecmax = veclen - 1;
const size_t freqspace = 32 * veclen;
const size_t rarespace = 1;
const uint32_t *stopFreq = freq + lenFreq - freqspace;
const uint32_t *stopRare = rare + lenRare - rarespace;
if (freq > stopFreq) {
return scalar(freq, lenFreq, rare, lenRare, out);
}
while (freq[veclen * 31 + vecmax] < *rare) {
freq += veclen * 32;
if (freq > stopFreq)
goto FINISH_SCALAR;
}
for (; rare < stopRare; ++rare) {
const uint32_t matchRare = *rare;//nextRare;
const vec Match = _mm256_set1_epi32(matchRare);
while (freq[veclen * 31 + vecmax] < matchRare) { // if no match possible
freq += veclen * 32; // advance 32 vectors
if (freq > stopFreq)
goto FINISH_SCALAR;
}
vec Q0,Q1,Q2,Q3;
if(freq[veclen * 15 + vecmax] >= matchRare ) {
if(freq[veclen * 7 + vecmax] < matchRare ) {
Q0 = _mm256_or_si256(
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 8), Match),
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 9), Match));
Q1 = _mm256_or_si256(
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 10), Match),
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 11), Match));
Q2 = _mm256_or_si256(
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 12), Match),
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 13), Match));
Q3 = _mm256_or_si256(
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 14), Match),
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 15), Match));
} else {
Q0 = _mm256_or_si256(
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 4), Match),
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 5), Match));
Q1 = _mm256_or_si256(
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 6), Match),
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 7), Match));
Q2 = _mm256_or_si256(
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 0), Match),
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 1), Match));
Q3 = _mm256_or_si256(
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 2), Match),
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 3), Match));
}
}
else
{
if(freq[veclen * 23 + vecmax] < matchRare ) {
Q0 = _mm256_or_si256(
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 8 + 16), Match),
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 9 + 16), Match));
Q1 = _mm256_or_si256(
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 10+ 16), Match),
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 11+ 16), Match));
Q2 = _mm256_or_si256(
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 12+ 16), Match),
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 13+ 16), Match));
Q3 = _mm256_or_si256(
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 14+ 16), Match),
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 15+ 16), Match));
} else {
Q0 = _mm256_or_si256(
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 4+ 16), Match),
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 5+ 16), Match));
Q1 = _mm256_or_si256(
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 6+ 16), Match),
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 7+ 16), Match));
Q2 = _mm256_or_si256(
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 0+ 16), Match),
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 1+ 16), Match));
Q3 = _mm256_or_si256(
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 2+ 16), Match),
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 3+ 16), Match));
}
}
const vec F0 = _mm256_or_si256(_mm256_or_si256(Q0, Q1),_mm256_or_si256(Q2, Q3));
if (_mm256_testz_si256(F0, F0)) {
} else {
*out++ = matchRare;
}
}
FINISH_SCALAR: return (out - initout) + scalar(freq,
stopFreq + freqspace - freq, rare, stopRare + rarespace - rare, out);
}
size_t SIMDgalloping_avx2(const uint32_t *rare, const size_t lenRare,
const uint32_t *freq, const size_t lenFreq, uint32_t * out) {
if (lenFreq == 0 || lenRare == 0)
return 0;
assert(lenRare <= lenFreq);
const uint32_t * const initout (out);
typedef __m256i vec;
const uint32_t veclen = sizeof(vec) / sizeof(uint32_t);
const size_t vecmax = veclen - 1;
const size_t freqspace = 32 * veclen;
const size_t rarespace = 1;
const uint32_t *stopFreq = freq + lenFreq - freqspace;
const uint32_t *stopRare = rare + lenRare - rarespace;
if (freq > stopFreq) {
return scalar(freq, lenFreq, rare, lenRare, out);
}
for (; rare < stopRare; ++rare) {
const uint32_t matchRare = *rare;//nextRare;
const vec Match = _mm256_set1_epi32(matchRare);
if (freq[veclen * 31 + vecmax] < matchRare) { // if no match possible
uint32_t offset = 1;
if (freq + veclen * 32 > stopFreq) {
freq += veclen * 32;
goto FINISH_SCALAR;
}
while (freq[veclen * offset * 32 + veclen * 31 + vecmax]
< matchRare) { // if no match possible
if (freq + veclen * (2 * offset ) * 32 <= stopFreq) {
offset *= 2;
} else if (freq + veclen * (offset + 1) * 32 <= stopFreq) {
offset = static_cast<uint32_t>((stopFreq - freq ) / (veclen * 32));
//offset += 1;
if (freq[veclen * offset * 32 + veclen * 31 + vecmax]
< matchRare) {
freq += veclen * offset * 32;
goto FINISH_SCALAR;
} else {
break;
}
} else {
freq += veclen * offset * 32;
goto FINISH_SCALAR;
}
}
uint32_t lower = offset / 2;
while (lower + 1 != offset) {
const uint32_t mid = (lower + offset) / 2;
if (freq[veclen * mid * 32 + veclen * 31 + vecmax]
< matchRare)
lower = mid;
else
offset = mid;
}
freq += veclen * offset * 32;
}
vec Q0,Q1,Q2,Q3;
if (freq[veclen * 15 + vecmax] >= matchRare) {
if (freq[veclen * 7 + vecmax] < matchRare) {
Q0
= _mm256_or_si256(
_mm256_cmpeq_epi32(
_mm256_loadu_si256((vec *) freq + 8), Match),
_mm256_cmpeq_epi32(
_mm256_loadu_si256((vec *) freq + 9), Match));
Q1 = _mm256_or_si256(
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 10),
Match),
_mm256_cmpeq_epi32(_mm256_loadu_si256((vec *) freq + 11),