scivex-core 0.1.1

Scivex — Tensors, linear algebra, FFT, and math primitives
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
//! NEON-accelerated f32 kernels (4-wide `float32x4_t`) for aarch64.

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

/// NEON dot product of two f32 slices.
///
/// # Safety
/// Caller must ensure this runs on aarch64 (NEON always available).
#[inline]
pub(crate) unsafe fn dot_f32_neon(a: &[f32], b: &[f32]) -> f32 {
    let n = a.len();
    let a_ptr = a.as_ptr();
    let b_ptr = b.as_ptr();

    // 4 accumulators × 4 lanes = 16 f32 FMAs per unrolled iteration.
    let mut acc0 = vdupq_n_f32(0.0);
    let mut acc1 = vdupq_n_f32(0.0);
    let mut acc2 = vdupq_n_f32(0.0);
    let mut acc3 = vdupq_n_f32(0.0);

    let chunks16 = n / 16;
    for i in 0..chunks16 {
        let base = i * 16;
        acc0 = vfmaq_f32(acc0, vld1q_f32(a_ptr.add(base)), vld1q_f32(b_ptr.add(base)));
        acc1 = vfmaq_f32(acc1, vld1q_f32(a_ptr.add(base + 4)), vld1q_f32(b_ptr.add(base + 4)));
        acc2 = vfmaq_f32(acc2, vld1q_f32(a_ptr.add(base + 8)), vld1q_f32(b_ptr.add(base + 8)));
        acc3 = vfmaq_f32(acc3, vld1q_f32(a_ptr.add(base + 12)), vld1q_f32(b_ptr.add(base + 12)));
    }

    acc0 = vaddq_f32(acc0, acc1);
    acc2 = vaddq_f32(acc2, acc3);
    acc0 = vaddq_f32(acc0, acc2);
    let mut result = vaddvq_f32(acc0);

    let tail = chunks16 * 16;
    for j in tail..n {
        result += *a.get_unchecked(j) * *b.get_unchecked(j);
    }
    result
}

/// NEON sum of an f32 slice.
///
/// # Safety
/// Caller must ensure this runs on aarch64.
#[inline]
pub(crate) unsafe fn sum_f32_neon(a: &[f32]) -> f32 {
    let n = a.len();
    let ptr = a.as_ptr();

    // 4 accumulators × 4 lanes = 16 f32s per unrolled iteration.
    let mut acc0 = vdupq_n_f32(0.0);
    let mut acc1 = vdupq_n_f32(0.0);
    let mut acc2 = vdupq_n_f32(0.0);
    let mut acc3 = vdupq_n_f32(0.0);

    let chunks16 = n / 16;
    for i in 0..chunks16 {
        let base = i * 16;
        acc0 = vaddq_f32(acc0, vld1q_f32(ptr.add(base)));
        acc1 = vaddq_f32(acc1, vld1q_f32(ptr.add(base + 4)));
        acc2 = vaddq_f32(acc2, vld1q_f32(ptr.add(base + 8)));
        acc3 = vaddq_f32(acc3, vld1q_f32(ptr.add(base + 12)));
    }

    acc0 = vaddq_f32(acc0, acc1);
    acc2 = vaddq_f32(acc2, acc3);
    acc0 = vaddq_f32(acc0, acc2);
    let mut result = vaddvq_f32(acc0);

    let tail = chunks16 * 16;
    for j in tail..n {
        result += *a.get_unchecked(j);
    }
    result
}

/// NEON element-wise add for f32.
///
/// # Safety
/// Caller must ensure this runs on aarch64 and slices have equal length.
#[inline]
pub(crate) unsafe fn add_f32_neon(a: &[f32], b: &[f32], out: &mut [f32]) {
    let n = a.len();
    let a_ptr = a.as_ptr();
    let b_ptr = b.as_ptr();
    let o_ptr = out.as_mut_ptr();

    let chunks16 = n / 16;
    for i in 0..chunks16 {
        let base = i * 16;
        vst1q_f32(o_ptr.add(base), vaddq_f32(vld1q_f32(a_ptr.add(base)), vld1q_f32(b_ptr.add(base))));
        vst1q_f32(o_ptr.add(base + 4), vaddq_f32(vld1q_f32(a_ptr.add(base + 4)), vld1q_f32(b_ptr.add(base + 4))));
        vst1q_f32(o_ptr.add(base + 8), vaddq_f32(vld1q_f32(a_ptr.add(base + 8)), vld1q_f32(b_ptr.add(base + 8))));
        vst1q_f32(o_ptr.add(base + 12), vaddq_f32(vld1q_f32(a_ptr.add(base + 12)), vld1q_f32(b_ptr.add(base + 12))));
    }

    let tail = chunks16 * 16;
    for j in tail..n {
        *out.get_unchecked_mut(j) = *a.get_unchecked(j) + *b.get_unchecked(j);
    }
}

/// NEON element-wise sub for f32.
///
/// # Safety
/// Caller must ensure this runs on aarch64 and slices have equal length.
#[inline]
pub(crate) unsafe fn sub_f32_neon(a: &[f32], b: &[f32], out: &mut [f32]) {
    let n = a.len();
    let a_ptr = a.as_ptr();
    let b_ptr = b.as_ptr();
    let o_ptr = out.as_mut_ptr();

    let chunks16 = n / 16;
    for i in 0..chunks16 {
        let base = i * 16;
        vst1q_f32(o_ptr.add(base), vsubq_f32(vld1q_f32(a_ptr.add(base)), vld1q_f32(b_ptr.add(base))));
        vst1q_f32(o_ptr.add(base + 4), vsubq_f32(vld1q_f32(a_ptr.add(base + 4)), vld1q_f32(b_ptr.add(base + 4))));
        vst1q_f32(o_ptr.add(base + 8), vsubq_f32(vld1q_f32(a_ptr.add(base + 8)), vld1q_f32(b_ptr.add(base + 8))));
        vst1q_f32(o_ptr.add(base + 12), vsubq_f32(vld1q_f32(a_ptr.add(base + 12)), vld1q_f32(b_ptr.add(base + 12))));
    }

    let tail = chunks16 * 16;
    for j in tail..n {
        *out.get_unchecked_mut(j) = *a.get_unchecked(j) - *b.get_unchecked(j);
    }
}

/// NEON element-wise mul for f32.
///
/// # Safety
/// Caller must ensure this runs on aarch64 and slices have equal length.
#[inline]
pub(crate) unsafe fn mul_f32_neon(a: &[f32], b: &[f32], out: &mut [f32]) {
    let n = a.len();
    let a_ptr = a.as_ptr();
    let b_ptr = b.as_ptr();
    let o_ptr = out.as_mut_ptr();

    let chunks16 = n / 16;
    for i in 0..chunks16 {
        let base = i * 16;
        vst1q_f32(o_ptr.add(base), vmulq_f32(vld1q_f32(a_ptr.add(base)), vld1q_f32(b_ptr.add(base))));
        vst1q_f32(o_ptr.add(base + 4), vmulq_f32(vld1q_f32(a_ptr.add(base + 4)), vld1q_f32(b_ptr.add(base + 4))));
        vst1q_f32(o_ptr.add(base + 8), vmulq_f32(vld1q_f32(a_ptr.add(base + 8)), vld1q_f32(b_ptr.add(base + 8))));
        vst1q_f32(o_ptr.add(base + 12), vmulq_f32(vld1q_f32(a_ptr.add(base + 12)), vld1q_f32(b_ptr.add(base + 12))));
    }

    let tail = chunks16 * 16;
    for j in tail..n {
        *out.get_unchecked_mut(j) = *a.get_unchecked(j) * *b.get_unchecked(j);
    }
}

/// NEON element-wise div for f32.
///
/// # Safety
/// Caller must ensure this runs on aarch64 and slices have equal length.
#[inline]
pub(crate) unsafe fn div_f32_neon(a: &[f32], b: &[f32], out: &mut [f32]) {
    let n = a.len();
    let a_ptr = a.as_ptr();
    let b_ptr = b.as_ptr();
    let o_ptr = out.as_mut_ptr();

    let chunks16 = n / 16;
    for i in 0..chunks16 {
        let base = i * 16;
        vst1q_f32(o_ptr.add(base), vdivq_f32(vld1q_f32(a_ptr.add(base)), vld1q_f32(b_ptr.add(base))));
        vst1q_f32(o_ptr.add(base + 4), vdivq_f32(vld1q_f32(a_ptr.add(base + 4)), vld1q_f32(b_ptr.add(base + 4))));
        vst1q_f32(o_ptr.add(base + 8), vdivq_f32(vld1q_f32(a_ptr.add(base + 8)), vld1q_f32(b_ptr.add(base + 8))));
        vst1q_f32(o_ptr.add(base + 12), vdivq_f32(vld1q_f32(a_ptr.add(base + 12)), vld1q_f32(b_ptr.add(base + 12))));
    }

    let tail = chunks16 * 16;
    for j in tail..n {
        *out.get_unchecked_mut(j) = *a.get_unchecked(j) / *b.get_unchecked(j);
    }
}

/// NEON axpy for f32: `y[i] += alpha * x[i]`.
///
/// # Safety
/// Caller must ensure this runs on aarch64 and slices have equal length.
#[inline]
pub(crate) unsafe fn axpy_f32_neon(alpha: f32, x: &[f32], y: &mut [f32]) {
    let n = x.len();
    let valpha = vdupq_n_f32(alpha);
    let x_ptr = x.as_ptr();
    let y_ptr = y.as_mut_ptr();

    let chunks16 = n / 16;
    for i in 0..chunks16 {
        let base = i * 16;
        let vy0 = vld1q_f32(y_ptr.add(base));
        let vy1 = vld1q_f32(y_ptr.add(base + 4));
        let vy2 = vld1q_f32(y_ptr.add(base + 8));
        let vy3 = vld1q_f32(y_ptr.add(base + 12));
        vst1q_f32(y_ptr.add(base), vfmaq_f32(vy0, valpha, vld1q_f32(x_ptr.add(base))));
        vst1q_f32(y_ptr.add(base + 4), vfmaq_f32(vy1, valpha, vld1q_f32(x_ptr.add(base + 4))));
        vst1q_f32(y_ptr.add(base + 8), vfmaq_f32(vy2, valpha, vld1q_f32(x_ptr.add(base + 8))));
        vst1q_f32(y_ptr.add(base + 12), vfmaq_f32(vy3, valpha, vld1q_f32(x_ptr.add(base + 12))));
    }

    let tail = chunks16 * 16;
    for j in tail..n {
        *y.get_unchecked_mut(j) += alpha * *x.get_unchecked(j);
    }
}

/// NEON scal for f32: `x[i] *= alpha`.
///
/// # Safety
/// Caller must ensure this runs on aarch64.
#[inline]
pub(crate) unsafe fn scal_f32_neon(alpha: f32, x: &mut [f32]) {
    let n = x.len();
    let valpha = vdupq_n_f32(alpha);
    let ptr = x.as_mut_ptr();

    let chunks16 = n / 16;
    for i in 0..chunks16 {
        let base = i * 16;
        vst1q_f32(ptr.add(base), vmulq_f32(valpha, vld1q_f32(ptr.add(base))));
        vst1q_f32(ptr.add(base + 4), vmulq_f32(valpha, vld1q_f32(ptr.add(base + 4))));
        vst1q_f32(ptr.add(base + 8), vmulq_f32(valpha, vld1q_f32(ptr.add(base + 8))));
        vst1q_f32(ptr.add(base + 12), vmulq_f32(valpha, vld1q_f32(ptr.add(base + 12))));
    }

    let tail = chunks16 * 16;
    for j in tail..n {
        *x.get_unchecked_mut(j) *= alpha;
    }
}

/// NEON sum of squares for f32.
///
/// # Safety
/// Caller must ensure this runs on aarch64.
#[inline]
pub(crate) unsafe fn sum_sq_f32_neon(a: &[f32]) -> f32 {
    let n = a.len();
    let ptr = a.as_ptr();

    // 4 accumulators × 4 lanes = 16 f32s per unrolled iteration.
    let mut acc0 = vdupq_n_f32(0.0);
    let mut acc1 = vdupq_n_f32(0.0);
    let mut acc2 = vdupq_n_f32(0.0);
    let mut acc3 = vdupq_n_f32(0.0);

    let chunks16 = n / 16;
    for i in 0..chunks16 {
        let base = i * 16;
        let v0 = vld1q_f32(ptr.add(base));
        let v1 = vld1q_f32(ptr.add(base + 4));
        let v2 = vld1q_f32(ptr.add(base + 8));
        let v3 = vld1q_f32(ptr.add(base + 12));
        acc0 = vfmaq_f32(acc0, v0, v0);
        acc1 = vfmaq_f32(acc1, v1, v1);
        acc2 = vfmaq_f32(acc2, v2, v2);
        acc3 = vfmaq_f32(acc3, v3, v3);
    }

    acc0 = vaddq_f32(acc0, acc1);
    acc2 = vaddq_f32(acc2, acc3);
    acc0 = vaddq_f32(acc0, acc2);
    let mut result = vaddvq_f32(acc0);

    let tail = chunks16 * 16;
    for j in tail..n {
        let v = *a.get_unchecked(j);
        result += v * v;
    }
    result
}

/// NEON sum of absolute values for f32.
///
/// # Safety
/// Caller must ensure this runs on aarch64.
#[inline]
pub(crate) unsafe fn asum_f32_neon(a: &[f32]) -> f32 {
    let n = a.len();
    let ptr = a.as_ptr();

    let mut acc0 = vdupq_n_f32(0.0);
    let mut acc1 = vdupq_n_f32(0.0);
    let mut acc2 = vdupq_n_f32(0.0);
    let mut acc3 = vdupq_n_f32(0.0);

    let chunks16 = n / 16;
    for i in 0..chunks16 {
        let base = i * 16;
        acc0 = vaddq_f32(acc0, vabsq_f32(vld1q_f32(ptr.add(base))));
        acc1 = vaddq_f32(acc1, vabsq_f32(vld1q_f32(ptr.add(base + 4))));
        acc2 = vaddq_f32(acc2, vabsq_f32(vld1q_f32(ptr.add(base + 8))));
        acc3 = vaddq_f32(acc3, vabsq_f32(vld1q_f32(ptr.add(base + 12))));
    }

    acc0 = vaddq_f32(acc0, acc1);
    acc2 = vaddq_f32(acc2, acc3);
    acc0 = vaddq_f32(acc0, acc2);
    let mut result = vaddvq_f32(acc0);

    let tail = chunks16 * 16;
    for j in tail..n {
        result += (*a.get_unchecked(j)).abs();
    }
    result
}

/// NEON min of an f32 slice.
///
/// # Safety
/// Caller must ensure this runs on aarch64 and slice is non-empty.
#[inline]
pub(crate) unsafe fn min_f32_neon(a: &[f32]) -> f32 {
    let n = a.len();
    let ptr = a.as_ptr();

    let mut vmin0 = vdupq_n_f32(f32::INFINITY);
    let mut vmin1 = vdupq_n_f32(f32::INFINITY);
    let mut vmin2 = vdupq_n_f32(f32::INFINITY);
    let mut vmin3 = vdupq_n_f32(f32::INFINITY);

    let chunks16 = n / 16;
    for i in 0..chunks16 {
        let base = i * 16;
        vmin0 = vminq_f32(vmin0, vld1q_f32(ptr.add(base)));
        vmin1 = vminq_f32(vmin1, vld1q_f32(ptr.add(base + 4)));
        vmin2 = vminq_f32(vmin2, vld1q_f32(ptr.add(base + 8)));
        vmin3 = vminq_f32(vmin3, vld1q_f32(ptr.add(base + 12)));
    }

    vmin0 = vminq_f32(vmin0, vmin1);
    vmin2 = vminq_f32(vmin2, vmin3);
    vmin0 = vminq_f32(vmin0, vmin2);
    let mut result = vminvq_f32(vmin0);

    let tail = chunks16 * 16;
    for j in tail..n {
        result = result.min(*a.get_unchecked(j));
    }
    result
}

/// NEON max of an f32 slice.
///
/// # Safety
/// Caller must ensure this runs on aarch64 and slice is non-empty.
#[inline]
pub(crate) unsafe fn max_f32_neon(a: &[f32]) -> f32 {
    let n = a.len();
    let ptr = a.as_ptr();

    let mut vmax0 = vdupq_n_f32(f32::NEG_INFINITY);
    let mut vmax1 = vdupq_n_f32(f32::NEG_INFINITY);
    let mut vmax2 = vdupq_n_f32(f32::NEG_INFINITY);
    let mut vmax3 = vdupq_n_f32(f32::NEG_INFINITY);

    let chunks16 = n / 16;
    for i in 0..chunks16 {
        let base = i * 16;
        vmax0 = vmaxq_f32(vmax0, vld1q_f32(ptr.add(base)));
        vmax1 = vmaxq_f32(vmax1, vld1q_f32(ptr.add(base + 4)));
        vmax2 = vmaxq_f32(vmax2, vld1q_f32(ptr.add(base + 8)));
        vmax3 = vmaxq_f32(vmax3, vld1q_f32(ptr.add(base + 12)));
    }

    vmax0 = vmaxq_f32(vmax0, vmax1);
    vmax2 = vmaxq_f32(vmax2, vmax3);
    vmax0 = vmaxq_f32(vmax0, vmax2);
    let mut result = vmaxvq_f32(vmax0);

    let tail = chunks16 * 16;
    for j in tail..n {
        result = result.max(*a.get_unchecked(j));
    }
    result
}

/// NEON ReLU (max(0, x)) for f32.
///
/// # Safety
/// Caller must ensure this runs on aarch64 and slices have equal length.
#[inline]
pub(crate) unsafe fn relu_f32_neon(a: &[f32], out: &mut [f32]) {
    let n = a.len();
    let a_ptr = a.as_ptr();
    let o_ptr = out.as_mut_ptr();
    let vzero = vdupq_n_f32(0.0);

    let chunks16 = n / 16;
    for i in 0..chunks16 {
        let base = i * 16;
        vst1q_f32(o_ptr.add(base), vmaxq_f32(vzero, vld1q_f32(a_ptr.add(base))));
        vst1q_f32(o_ptr.add(base + 4), vmaxq_f32(vzero, vld1q_f32(a_ptr.add(base + 4))));
        vst1q_f32(o_ptr.add(base + 8), vmaxq_f32(vzero, vld1q_f32(a_ptr.add(base + 8))));
        vst1q_f32(o_ptr.add(base + 12), vmaxq_f32(vzero, vld1q_f32(a_ptr.add(base + 12))));
    }

    let tail = chunks16 * 16;
    for j in tail..n {
        let v = *a.get_unchecked(j);
        *out.get_unchecked_mut(j) = if v > 0.0 { v } else { 0.0 };
    }
}

/// NEON mean of an f32 slice.
///
/// # Safety
/// Caller must ensure this runs on aarch64 and slice is non-empty.
#[inline]
pub(crate) unsafe fn mean_f32_neon(a: &[f32]) -> f32 {
    sum_f32_neon(a) / a.len() as f32
}