simdsieve 0.1.3

SIMD-accelerated byte pattern pre-filtering with AVX-512, AVX2, NEON, and scalar fallback
Documentation
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
// Each unsafe fn body explicitly wraps its SIMD calls in `unsafe { }`
// to satisfy `forbid(unsafe_op_in_unsafe_fn)` on MSRV-era rustc; on
// newer rustc (1.95+) `target_feature_11` makes the outer block
// redundant. Silence the `unused_unsafe` warning so both compile.
#![allow(unused_unsafe)]

//! NEON intrinsics for multi-pattern prefix matching.
//!
//! This module implements the AArch64 (NEON) backend for ARM processors.
//! It processes 64-byte blocks as two interleaved 32-byte pumps using
//! 128-bit vector registers.
//!
//! # Architecture
//!
//! The NEON backend uses `vceqq_u8` to compare 16 haystack bytes against a
//! broadcast pattern byte. Results are extracted into bitmasks using a
//! pairwise-reduction movemask idiom (`vpaddlq`).
//!
//! ## Dual-Pump Processing
//!
//! Each 64-byte logical block is processed as two 32-byte halves:
//! 1. Load bytes 0-15 and 16-31 (first half)
//! 2. Load bytes 32-47 and 48-63 (second half)
//! 3. Return separate 32-bit bitmasks for each half
//!
//! # Safety
//!
//! All `unsafe` blocks in this module require:
//! 1. NEON target feature is available (guaranteed on `aarch64`).
//! 2. Input blocks have sufficient trailing bytes for multi-byte prefixes.
//! 3. Pointer arithmetic stays within allocated slices.

#![allow(
    clippy::similar_names,
    clippy::cast_possible_wrap,
    clippy::cast_sign_loss
)]
#![cfg(target_arch = "aarch64")]

use crate::fold::fold_ascii_lowercase;
use crate::scalar::{build_mask, pack_word};

use core::arch::aarch64::*;

/// A single pattern's prefix packed for NEON vector comparison.
#[derive(Clone, Copy)]
#[repr(C, align(16))]
struct NeonPattern {
    len: usize,
    word: u32,
    mask: u32,
    bcast: [uint8x16_t; 4],
}

/// NEON multi-pattern filter operating on 64-byte blocks.
#[derive(Clone)]
#[repr(C, align(16))]
pub(crate) struct NeonFilter {
    patterns: [NeonPattern; 16],
    pattern_count: usize,
    max_len: usize,
    case_insensitive: bool,
}

impl core::fmt::Debug for NeonFilter {
    fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
        f.debug_struct("NeonFilter")
            .field("pattern_count", &self.pattern_count)
            .field("max_len", &self.max_len)
            .field("case_insensitive", &self.case_insensitive)
            .finish_non_exhaustive()
    }
}

impl NeonFilter {
    /// Builds the broadcast vectors for a single pattern prefix.
    ///
    /// # Safety
    ///
    /// Caller must ensure NEON is available.
    #[target_feature(enable = "neon")]
    #[inline]
    unsafe fn build_broadcasts(bytes: [u8; 4]) -> [uint8x16_t; 4] {
        unsafe {
            [
                vdupq_n_u8(bytes[0]),
                vdupq_n_u8(bytes[1]),
                vdupq_n_u8(bytes[2]),
                vdupq_n_u8(bytes[3]),
            ]
        }
    }

    /// Builds a NEON filter from up to 16 prefix byte slices.
    ///
    /// Each prefix is truncated to 4 bytes. When `case_insensitive` is
    /// `true`, ASCII `a`–`z` bytes are folded to upper-case.
    ///
    /// # Safety
    ///
    /// Caller must ensure NEON is available before calling this function.
    /// Caller must also ensure `prefixes.len() <= MAX_PATTERNS`.
    #[must_use]
    pub(crate) unsafe fn new(prefixes: &[&[u8]], case_insensitive: bool) -> Self {
        unsafe {
            let mut max_len = 0;
            debug_assert!(
                prefixes.len() <= crate::MAX_PATTERNS,
                "NEON filter given {} prefixes, max is {}",
                prefixes.len(),
                crate::MAX_PATTERNS
            );
            let count = prefixes.len();
            let mut patterns: [NeonPattern; 16] = unsafe { core::mem::zeroed() };

            for (i, &slice) in prefixes.iter().take(crate::MAX_PATTERNS).enumerate() {
                let eval_len = slice.len().min(4);
                let mut arr = [0u8; 4];
                for j in 0..eval_len {
                    arr[j] = if case_insensitive {
                        fold_ascii_lowercase(slice[j])
                    } else {
                        slice[j]
                    };
                }
                if eval_len > max_len {
                    max_len = eval_len;
                }
                let word = pack_word(arr, eval_len);
                let mask = build_mask(eval_len);
                let bcast = unsafe { Self::build_broadcasts(arr) };
                patterns[i] = NeonPattern {
                    len: eval_len,
                    word,
                    mask,
                    bcast,
                };
            }

            Self {
                patterns,
                pattern_count: count,
                max_len,
                case_insensitive,
            }
        }
    }

    /// Folds ASCII lowercase letters to uppercase in a 128-bit vector.
    ///
    /// # Safety
    ///
    /// Caller must ensure NEON is available.
    #[target_feature(enable = "neon")]
    #[inline]
    unsafe fn ascii_fold_vector(v: uint8x16_t) -> uint8x16_t {
        unsafe {
            let lower_bound = vdupq_n_u8(b'a' - 1);
            let upper_limit = vdupq_n_u8(b'z' + 1);
            let fold_val = vdupq_n_u8(0x20);

            let mask1 = vcgtq_u8(v, lower_bound);
            let mask2 = vcltq_u8(v, upper_limit);
            let is_alpha = vandq_u8(mask1, mask2);

            let v_sub = vsubq_u8(v, fold_val);
            vbslq_u8(is_alpha, v_sub, v)
        }
    }

    /// Computes a 16-bit movemask from a NEON vector.
    ///
    /// # Safety
    ///
    /// Caller must ensure NEON is available.
    #[target_feature(enable = "neon")]
    // `#[inline(always)]` with `#[target_feature]` requires the
    // unstable `target_feature_11` feature; on stable rustc we drop
    // to plain `#[inline]` which still hints the optimizer.
    #[inline]
    unsafe fn neon_movemask(v: uint8x16_t) -> u16 {
        unsafe {
            const BIT_WEIGHTS: [u8; 16] =
                [1, 2, 4, 8, 16, 32, 64, 128, 1, 2, 4, 8, 16, 32, 64, 128];
            let weights = vld1q_u8(BIT_WEIGHTS.as_ptr());
            let tmp = vandq_u8(v, weights);

            let tmp16 = vpaddlq_u8(tmp);
            let tmp32 = vpaddlq_u16(tmp16);
            let tmp64 = vpaddlq_u32(tmp32);

            let lo = vgetq_lane_u64(tmp64, 0);
            let hi = vgetq_lane_u64(tmp64, 1);

            #[allow(clippy::cast_possible_truncation)]
            let mask = (lo as u16) | ((hi as u16) << 8);
            mask
        }
    }

    /// Scans a 64-byte block, returning per-half bitmasks.
    ///
    /// Returns `(mask_lo, mask_hi)` where bit `i` of `mask_lo` covers
    /// byte positions 0-31 and bit `i` of `mask_hi` covers 32-63.
    ///
    /// # Safety
    ///
    /// The caller must ensure:
    /// - `block.len() >= 64 + self.max_len.saturating_sub(1)`
    /// - The CPU supports NEON instructions.
    #[target_feature(enable = "neon")]
    #[inline]
    #[must_use]
    pub(crate) unsafe fn check_64byte_block(&self, block: &[u8]) -> (u32, u32) {
        unsafe {
            debug_assert!(
                block.len() >= 64 + self.max_len.saturating_sub(1),
                "block lacks trailing buffer"
            );

            let mut folded_mask_a: u32 = 0;
            let mut folded_mask_b: u32 = 0;

            unsafe {
                let mut v0_a: uint8x16_t = vld1q_u8(block.as_ptr());
                let mut v0_b: uint8x16_t = vld1q_u8(block.as_ptr().add(16));
                let mut v0_c: uint8x16_t = vld1q_u8(block.as_ptr().add(32));
                let mut v0_d: uint8x16_t = vld1q_u8(block.as_ptr().add(48));

                if self.case_insensitive {
                    v0_a = Self::ascii_fold_vector(v0_a);
                    v0_b = Self::ascii_fold_vector(v0_b);
                    v0_c = Self::ascii_fold_vector(v0_c);
                    v0_d = Self::ascii_fold_vector(v0_d);
                }

                let mut v1_a = v0_a;
                let mut v1_b = v0_b;
                let mut v1_c = v0_c;
                let mut v1_d = v0_d;
                let mut v2_a = v0_a;
                let mut v2_b = v0_b;
                let mut v2_c = v0_c;
                let mut v2_d = v0_d;
                let mut v3_a = v0_a;
                let mut v3_b = v0_b;
                let mut v3_c = v0_c;
                let mut v3_d = v0_d;

                if self.max_len > 1 {
                    let mut v_a = vld1q_u8(block.as_ptr().add(1));
                    let mut v_b = vld1q_u8(block.as_ptr().add(17));
                    let mut v_c = vld1q_u8(block.as_ptr().add(33));
                    let mut v_d = vld1q_u8(block.as_ptr().add(49));
                    if self.case_insensitive {
                        v_a = Self::ascii_fold_vector(v_a);
                        v_b = Self::ascii_fold_vector(v_b);
                        v_c = Self::ascii_fold_vector(v_c);
                        v_d = Self::ascii_fold_vector(v_d);
                    }
                    v1_a = v_a;
                    v1_b = v_b;
                    v1_c = v_c;
                    v1_d = v_d;
                }
                if self.max_len > 2 {
                    let mut v_a = vld1q_u8(block.as_ptr().add(2));
                    let mut v_b = vld1q_u8(block.as_ptr().add(18));
                    let mut v_c = vld1q_u8(block.as_ptr().add(34));
                    let mut v_d = vld1q_u8(block.as_ptr().add(50));
                    if self.case_insensitive {
                        v_a = Self::ascii_fold_vector(v_a);
                        v_b = Self::ascii_fold_vector(v_b);
                        v_c = Self::ascii_fold_vector(v_c);
                        v_d = Self::ascii_fold_vector(v_d);
                    }
                    v2_a = v_a;
                    v2_b = v_b;
                    v2_c = v_c;
                    v2_d = v_d;
                }
                if self.max_len > 3 {
                    let mut v_a = vld1q_u8(block.as_ptr().add(3));
                    let mut v_b = vld1q_u8(block.as_ptr().add(19));
                    let mut v_c = vld1q_u8(block.as_ptr().add(35));
                    let mut v_d = vld1q_u8(block.as_ptr().add(51));
                    if self.case_insensitive {
                        v_a = Self::ascii_fold_vector(v_a);
                        v_b = Self::ascii_fold_vector(v_b);
                        v_c = Self::ascii_fold_vector(v_c);
                        v_d = Self::ascii_fold_vector(v_d);
                    }
                    v3_a = v_a;
                    v3_b = v_b;
                    v3_c = v_c;
                    v3_d = v_d;
                }

                for p_idx in 0..self.pattern_count {
                    let p = &self.patterns[p_idx];
                    let mut p_mask_a: u32 = !0;
                    let mut p_mask_b: u32 = !0;

                    if p.len > 0 {
                        p_mask_a &= u32::from(Self::neon_movemask(vceqq_u8(v0_a, p.bcast[0])))
                            | (u32::from(Self::neon_movemask(vceqq_u8(v0_b, p.bcast[0]))) << 16);
                        p_mask_b &= u32::from(Self::neon_movemask(vceqq_u8(v0_c, p.bcast[0])))
                            | (u32::from(Self::neon_movemask(vceqq_u8(v0_d, p.bcast[0]))) << 16);
                    }
                    if p.len > 1 {
                        p_mask_a &= u32::from(Self::neon_movemask(vceqq_u8(v1_a, p.bcast[1])))
                            | (u32::from(Self::neon_movemask(vceqq_u8(v1_b, p.bcast[1]))) << 16);
                        p_mask_b &= u32::from(Self::neon_movemask(vceqq_u8(v1_c, p.bcast[1])))
                            | (u32::from(Self::neon_movemask(vceqq_u8(v1_d, p.bcast[1]))) << 16);
                    }
                    if p.len > 2 {
                        p_mask_a &= u32::from(Self::neon_movemask(vceqq_u8(v2_a, p.bcast[2])))
                            | (u32::from(Self::neon_movemask(vceqq_u8(v2_b, p.bcast[2]))) << 16);
                        p_mask_b &= u32::from(Self::neon_movemask(vceqq_u8(v2_c, p.bcast[2])))
                            | (u32::from(Self::neon_movemask(vceqq_u8(v2_d, p.bcast[2]))) << 16);
                    }
                    if p.len > 3 {
                        p_mask_a &= u32::from(Self::neon_movemask(vceqq_u8(v3_a, p.bcast[3])))
                            | (u32::from(Self::neon_movemask(vceqq_u8(v3_b, p.bcast[3]))) << 16);
                        p_mask_b &= u32::from(Self::neon_movemask(vceqq_u8(v3_c, p.bcast[3])))
                            | (u32::from(Self::neon_movemask(vceqq_u8(v3_d, p.bcast[3]))) << 16);
                    }

                    folded_mask_a |= p_mask_a;
                    folded_mask_b |= p_mask_b;
                }
            }

            (folded_mask_a, folded_mask_b)
        }
    }

    /// Scans a 32-byte block, returning a single bitmask.
    ///
    /// Bit `i` is set if byte position `i` starts with a matching
    /// pattern prefix.
    ///
    /// # Safety
    ///
    /// The caller must ensure:
    /// - `block.len() >= 32 + self.max_len.saturating_sub(1)`
    /// - The CPU supports NEON instructions.
    #[target_feature(enable = "neon")]
    #[inline]
    #[must_use]
    pub(crate) unsafe fn check_32byte_block(&self, block: &[u8]) -> u32 {
        unsafe {
            debug_assert!(
                block.len() >= 32 + self.max_len.saturating_sub(1),
                "block lacks trailing buffer"
            );
            let mut folded_mask: u32 = 0;

            unsafe {
                let mut v0_lo: uint8x16_t = vld1q_u8(block.as_ptr());
                let mut v0_hi: uint8x16_t = vld1q_u8(block.as_ptr().add(16));

                if self.case_insensitive {
                    v0_lo = Self::ascii_fold_vector(v0_lo);
                    v0_hi = Self::ascii_fold_vector(v0_hi);
                }

                let mut v1_lo = v0_lo;
                let mut v1_hi = v0_hi;
                let mut v2_lo = v0_lo;
                let mut v2_hi = v0_hi;
                let mut v3_lo = v0_lo;
                let mut v3_hi = v0_hi;

                if self.max_len > 1 {
                    let mut v_lo = vld1q_u8(block.as_ptr().add(1));
                    let mut v_hi = vld1q_u8(block.as_ptr().add(17));
                    if self.case_insensitive {
                        v_lo = Self::ascii_fold_vector(v_lo);
                        v_hi = Self::ascii_fold_vector(v_hi);
                    }
                    v1_lo = v_lo;
                    v1_hi = v_hi;
                }
                if self.max_len > 2 {
                    let mut v_lo = vld1q_u8(block.as_ptr().add(2));
                    let mut v_hi = vld1q_u8(block.as_ptr().add(18));
                    if self.case_insensitive {
                        v_lo = Self::ascii_fold_vector(v_lo);
                        v_hi = Self::ascii_fold_vector(v_hi);
                    }
                    v2_lo = v_lo;
                    v2_hi = v_hi;
                }
                if self.max_len > 3 {
                    let mut v_lo = vld1q_u8(block.as_ptr().add(3));
                    let mut v_hi = vld1q_u8(block.as_ptr().add(19));
                    if self.case_insensitive {
                        v_lo = Self::ascii_fold_vector(v_lo);
                        v_hi = Self::ascii_fold_vector(v_hi);
                    }
                    v3_lo = v_lo;
                    v3_hi = v_hi;
                }

                for p_idx in 0..self.pattern_count {
                    let p = &self.patterns[p_idx];
                    let mut p_mask_lo: u32 = !0;
                    let mut p_mask_hi: u32 = !0;

                    if p.len > 0 {
                        p_mask_lo &= u32::from(Self::neon_movemask(vceqq_u8(v0_lo, p.bcast[0])));
                        p_mask_hi &= u32::from(Self::neon_movemask(vceqq_u8(v0_hi, p.bcast[0])));
                    }
                    if p.len > 1 {
                        p_mask_lo &= u32::from(Self::neon_movemask(vceqq_u8(v1_lo, p.bcast[1])));
                        p_mask_hi &= u32::from(Self::neon_movemask(vceqq_u8(v1_hi, p.bcast[1])));
                    }
                    if p.len > 2 {
                        p_mask_lo &= u32::from(Self::neon_movemask(vceqq_u8(v2_lo, p.bcast[2])));
                        p_mask_hi &= u32::from(Self::neon_movemask(vceqq_u8(v2_hi, p.bcast[2])));
                    }
                    if p.len > 3 {
                        p_mask_lo &= u32::from(Self::neon_movemask(vceqq_u8(v3_lo, p.bcast[3])));
                        p_mask_hi &= u32::from(Self::neon_movemask(vceqq_u8(v3_hi, p.bcast[3])));
                    }

                    folded_mask |= p_mask_lo | (p_mask_hi << 16);
                }
            }
            folded_mask
        }
    }
}

#[cfg(test)]
mod tests {
    use super::NeonFilter;
    use crate::scalar::ScalarFilter;

    #[test]
    #[cfg(target_arch = "aarch64")]
    fn neon_64byte_block_matches_scalar() {
        let patterns: &[&[u8]] = &[b"ab", b"XY", b"1"];
        let neon = unsafe { NeonFilter::new(patterns, false) };
        let scalar = ScalarFilter::new(patterns, false);

        let mut block = [b'x'; 68];
        block[10] = b'a';
        block[11] = b'b';
        block[35] = b'X';
        block[36] = b'Y';
        block[63] = b'1';

        let (mask_a, mask_b) = unsafe { neon.check_64byte_block(&block) };
        let scalar_mask = scalar.check_64byte_block(&block);
        let neon_mask = u64::from(mask_a) | (u64::from(mask_b) << 32);

        assert_eq!(
            neon_mask, scalar_mask,
            "NEON 64-byte block must match scalar backend"
        );
    }

    #[test]
    #[cfg(target_arch = "aarch64")]
    fn neon_32byte_block_matches_scalar() {
        let patterns: &[&[u8]] = &[b"te", b"ST"];
        let neon = unsafe { NeonFilter::new(patterns, false) };
        let scalar = ScalarFilter::new(patterns, false);

        let mut block = [b'x'; 65];
        block[5] = b't';
        block[6] = b'e';
        block[30] = b'S';
        block[31] = b'T';

        let neon_mask = unsafe { neon.check_32byte_block(&block) };
        let scalar_mask = scalar.check_64byte_block(&block) as u32;

        assert_eq!(
            neon_mask, scalar_mask,
            "NEON 32-byte block must match scalar backend low 32 bits"
        );
    }

    #[test]
    #[cfg(target_arch = "aarch64")]
    fn neon_case_insensitive_matches_scalar() {
        let patterns: &[&[u8]] = &[b"Ab", b"z"];
        let neon = unsafe { NeonFilter::new(patterns, true) };
        let scalar = ScalarFilter::new(patterns, true);

        let mut block = [b'x'; 68];
        block[15] = b'a';
        block[16] = b'B';
        block[47] = b'Z';

        let (mask_a, mask_b) = unsafe { neon.check_64byte_block(&block) };
        let scalar_mask = scalar.check_64byte_block(&block);
        let neon_mask = u64::from(mask_a) | (u64::from(mask_b) << 32);

        assert_eq!(
            neon_mask, scalar_mask,
            "NEON case-insensitive must match scalar backend"
        );
    }

    #[test]
    #[cfg(target_arch = "aarch64")]
    fn neon_boundary_matches_at_half_block_edge() {
        let filter = unsafe { NeonFilter::new(&[b"Z"], true) };
        let mut block = [b'x'; 67];
        block[31] = b'Z';
        block[63] = b'Z';

        let (mask_a, mask_b) = unsafe { filter.check_64byte_block(&block) };

        assert_eq!(mask_a & (1 << 31), 1 << 31);
        assert_eq!(mask_b & (1 << 31), 1 << 31);
    }
}