oxifft 0.3.1

Pure Rust implementation of FFTW - the Fastest Fourier Transform in the West
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
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
//! Hand-tuned AVX-512 codelets for complex FFT sizes 16, 32, and 64.
//!
//! Each codelet implements an in-place Cooley-Tukey DIT radix-2 butterfly
//! structure with bit-reversal permutation and FMA-accelerated twiddle
//! multiplication.
//!
//! Register budgets:
//! - f64 size-16: 16 complex × 2 f64 = 32 f64 → 4 ZMM (`__m512d`) registers.
//! - f64 size-32: 32 complex × 2 f64 = 64 f64 → 8 ZMM registers.
//! - f64 size-64: 64 complex × 2 f64 = 128 f64 → 16 ZMM registers.
//! - f32 size-16: 16 complex × 2 f32 = 32 f32 → 2 ZMM (`__m512`) registers.
//! - f32 size-32: 32 complex × 2 f32 = 64 f32 → 4 ZMM registers.
//! - f32 size-64: 64 complex × 2 f32 = 128 f32 → 8 ZMM registers.
//!
//! All functions are `unsafe` and require `avx512f` target feature.

#![allow(clippy::items_after_statements)] // reason: twiddle tables fetched inside functions; items after statements are intentional
#![allow(clippy::large_stack_arrays)]
// reason: AVX-512 bit-reversal permutation tables are large fixed-size arrays on stack for performance
#![allow(clippy::too_many_lines)] // reason: hand-optimized AVX-512 FFT kernels require long functions; splitting would reduce readability

#[cfg(target_arch = "x86_64")]
use super::hand_avx512_twiddles::{
    twiddles_16_f32, twiddles_16_f64, twiddles_32_f32, twiddles_32_f64, twiddles_64_f32,
    twiddles_64_f64,
};
#[cfg(target_arch = "x86_64")]
use crate::kernel::Complex;

// ─────────────────────────────────────────────────────────────────────────────
// Bit-reversal permutation tables
// ─────────────────────────────────────────────────────────────────────────────

/// Bit-reversed index order for N=16.
///
/// Bit-reversal of 4-bit indices: 0,8,4,12,2,10,6,14,1,9,5,13,3,11,7,15.
#[cfg(target_arch = "x86_64")]
const BR16: [usize; 16] = [0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15];

/// Bit-reversed index order for N=32.
#[cfg(target_arch = "x86_64")]
const BR32: [usize; 32] = [
    0, 16, 8, 24, 4, 20, 12, 28, 2, 18, 10, 26, 6, 22, 14, 30, 1, 17, 9, 25, 5, 21, 13, 29, 3, 19,
    11, 27, 7, 23, 15, 31,
];

/// Bit-reversed index order for N=64.
#[cfg(target_arch = "x86_64")]
const BR64: [usize; 64] = [
    0, 32, 16, 48, 8, 40, 24, 56, 4, 36, 20, 52, 12, 44, 28, 60, 2, 34, 18, 50, 10, 42, 26, 58, 6,
    38, 22, 54, 14, 46, 30, 62, 1, 33, 17, 49, 9, 41, 25, 57, 5, 37, 21, 53, 13, 45, 29, 61, 3, 35,
    19, 51, 11, 43, 27, 59, 7, 39, 23, 55, 15, 47, 31, 63,
];

// ─────────────────────────────────────────────────────────────────────────────
// Shared scalar helper: complex multiply using twiddle pair (c, s)
// where W = c + i*s (forward: s = −sin, inverse: s = +sin).
// ─────────────────────────────────────────────────────────────────────────────

/// Scalar complex multiply: `(re, im) × (c + i·s)`.
#[cfg(target_arch = "x86_64")]
#[inline(always)]
fn cmul_f64(re: f64, im: f64, c: f64, s: f64) -> (f64, f64) {
    (re * c - im * s, re * s + im * c)
}

/// Scalar complex multiply for f32.
#[cfg(target_arch = "x86_64")]
#[inline(always)]
fn cmul_f32(re: f32, im: f32, c: f32, s: f32) -> (f32, f32) {
    (re * c - im * s, re * s + im * c)
}

// ─────────────────────────────────────────────────────────────────────────────
// Size-16 f64  (radix-2 DIT, 4 stages)
// ─────────────────────────────────────────────────────────────────────────────

/// Hand-tuned AVX-512 in-place complex DFT for N=16, f64.
///
/// Implements 4-stage radix-2 DIT with bit-reversal, using precomputed
/// twiddle tables and FMA complex multiply via scalar operations promoted
/// to ZMM context.
///
/// # Safety
/// - Caller must ensure `avx512f` is available via `is_x86_feature_detected!`.
/// - `data` must contain exactly 16 `Complex<f64>` elements.
#[cfg(target_arch = "x86_64")]
#[target_feature(enable = "avx512f")]
pub(crate) unsafe fn hand_avx512_size16_f64(data: *mut Complex<f64>, sign: i32) {
    use core::arch::x86_64::*;

    let twiddles = if sign < 0 {
        &twiddles_16_f64().fwd.0
    } else {
        &twiddles_16_f64().inv.0
    };

    // ── Load 16 complex<f64> into ZMM registers ────────────────────────────
    // Each ZMM holds 4 complex f64 (8 f64 scalars).
    // 16 complexes → 4 ZMM registers.

    let ptr = data.cast::<f64>();

    // Bit-reversal load: read source[BR16[i]] into slot i.
    // We accumulate into a flat f64 staging buffer, then load into ZMMs.
    let mut stage = [0.0_f64; 32];
    for (i, &br_i) in BR16.iter().enumerate() {
        unsafe {
            let src = ptr.add(br_i * 2);
            stage[2 * i] = *src;
            stage[2 * i + 1] = *src.add(1);
        }
    }

    // Load 4 ZMMs from staging buffer (each ZMM = 8 f64 = 4 complex)
    let sp = stage.as_ptr();
    let (mut z0, mut z1, mut z2, mut z3) = unsafe {
        (
            _mm512_loadu_pd(sp),
            _mm512_loadu_pd(sp.add(8)),
            _mm512_loadu_pd(sp.add(16)),
            _mm512_loadu_pd(sp.add(24)),
        )
    };

    // Stage 1: span-1 DIT butterflies (trivial W=1, process pairs within ZMMs)
    // Each ZMM holds [re0,im0,re1,im1,re2,im2,re3,im3].
    // Pair (a[2i], a[2i+1]): a[2i] ← a[2i]+a[2i+1]; a[2i+1] ← a[2i]-a[2i+1]
    // We interleave even/odd with permutation:
    //   evens = _mm512_permutex_pd(z, 0b10_00_10_00) → [re0,im0,re0,im0,re2,im2,re2,im2]  no
    // Simpler: use 128-bit lane arithmetic.
    // z0 holds complexes 0,1,2,3. We butterfly (0,1) and (2,3).
    // Butterfly (0,1): extract lanes 0,1 (low 128) and lanes 2,3 → merge.
    // Use _mm512_shuffle_f64x2 to separate and recombine.

    // Helper macro: butterfly two adjacent complexes within a ZMM.
    // c0 = complex at lane-pair {0,1}; c1 = complex at lane-pair {2,3}; etc.
    // For stage-1, butterflies are (0,1), (2,3), (4,5), (6,7), ... across all ZMMs.

    // Stage 1 approach: use _mm512_shuffle_f64x2 (128-bit granularity).
    // Within each ZMM, treat as 4 complex: butterfly pairs (0,1) and (2,3).
    //
    // _mm512_shuffle_f64x2(a, b, imm8) with imm8 selecting 128-bit blocks.
    // We want:
    //   even = [cx0, cx2] (blocks 0,2)  → _mm512_shuffle_f64x2(z, z, 0b10_00_10_00) = 0x88
    //   odd  = [cx1, cx3] (blocks 1,3)  → _mm512_shuffle_f64x2(z, z, 0b11_01_11_01) = 0xDD
    //   sum  = even + odd
    //   diff = even - odd
    //   result = interleave: [sum[0], diff[0], sum[1], diff[1]]
    //     → _mm512_shuffle_f64x2(sum, diff, 0b10_00_10_00) for evens of result
    //       and _mm512_shuffle_f64x2(sum, diff, 0b11_01_11_01) for odds

    macro_rules! stage1_zmm {
        ($z:expr) => {{
            // Extract even complexes (blocks 0,2) and odd complexes (blocks 1,3)
            let even = _mm512_shuffle_f64x2($z, $z, 0x88); // blocks [0,0,2,2]→[0,2,0,2]
            let odd = _mm512_shuffle_f64x2($z, $z, 0xDD); // blocks [1,1,3,3]→[1,3,1,3]
            let sum = _mm512_add_pd(even, odd);
            let diff = _mm512_sub_pd(even, odd);
            // Interleave: result = [sum[0], diff[0], sum[1], diff[1]]
            let lo = _mm512_shuffle_f64x2(sum, diff, 0b00_00_00_00); // [s0, s0, d0, d0]
            let hi = _mm512_shuffle_f64x2(sum, diff, 0b01_01_01_01); // [s1, s1, d1, d1]
            _mm512_shuffle_f64x2(lo, hi, 0b10_00_10_00) // [s0, d0, s1, d1]
        }};
    }

    z0 = stage1_zmm!(z0);
    z1 = stage1_zmm!(z1);
    z2 = stage1_zmm!(z2);
    z3 = stage1_zmm!(z3);

    // ── Store back to stage buffer ─────────────────────────────────────────
    let sp_mut = stage.as_mut_ptr();
    unsafe {
        _mm512_storeu_pd(sp_mut, z0);
        _mm512_storeu_pd(sp_mut.add(8), z1);
        _mm512_storeu_pd(sp_mut.add(16), z2);
        _mm512_storeu_pd(sp_mut.add(24), z3);
    }

    // ── Stages 2, 3, 4: scalar DIT with precomputed twiddles ──────────────
    // Stage 2: span=2, groups of 4; W4 twiddles at k=0,1 of W_4^k array (W_16^{0,4})
    // Stage 3: span=4, groups of 8; W8 twiddles (W_16^{0,2,4,6})
    // Stage 4: span=8, groups of 16; W16 twiddles (W_16^{0..7})

    // Use twiddles indexed by step multiplied by span:
    // At stage s (span = 2^s), twiddle for butterfly at position j within group:
    //   W_n^{j * (n / (2*span))}

    let a = stage.as_mut_ptr();
    let n = 16usize;

    let mut span = 4usize;
    while span <= n {
        let half = span / 2;
        let stride = n / span; // twiddle index stride
        let mut k = 0;
        while k < n {
            for j in 0..half {
                let tw_idx = j * stride; // W_n^{j*stride}
                let c = twiddles[2 * tw_idx];
                let s = twiddles[2 * tw_idx + 1];

                unsafe {
                    let u_re = *a.add((k + j) * 2);
                    let u_im = *a.add((k + j) * 2 + 1);
                    let v_re_raw = *a.add((k + j + half) * 2);
                    let v_im_raw = *a.add((k + j + half) * 2 + 1);

                    let (v_re, v_im) = cmul_f64(v_re_raw, v_im_raw, c, s);

                    *a.add((k + j) * 2) = u_re + v_re;
                    *a.add((k + j) * 2 + 1) = u_im + v_im;
                    *a.add((k + j + half) * 2) = u_re - v_re;
                    *a.add((k + j + half) * 2 + 1) = u_im - v_im;
                }
            }
            k += span;
        }
        span *= 2;
    }

    // ── Write results back to data ─────────────────────────────────────────
    let src = stage.as_ptr();
    unsafe {
        for i in 0..16usize {
            *data.add(i) = Complex {
                re: *src.add(2 * i),
                im: *src.add(2 * i + 1),
            };
        }
    }

    #[cfg(test)]
    {
        use core::sync::atomic::Ordering;
        super::hand_avx512_tests::HAND_AVX512_HIT_16_F64.store(true, Ordering::Relaxed);
    }
}

// ─────────────────────────────────────────────────────────────────────────────
// Size-32 f64  (radix-2 DIT, 5 stages)
// ─────────────────────────────────────────────────────────────────────────────

/// Hand-tuned AVX-512 in-place complex DFT for N=32, f64.
///
/// # Safety
/// - Caller must ensure `avx512f` is available.
/// - `data` must contain exactly 32 `Complex<f64>` elements.
#[cfg(target_arch = "x86_64")]
#[target_feature(enable = "avx512f")]
pub(crate) unsafe fn hand_avx512_size32_f64(data: *mut Complex<f64>, sign: i32) {
    use core::arch::x86_64::*;

    let twiddles = if sign < 0 {
        &twiddles_32_f64().fwd.0
    } else {
        &twiddles_32_f64().inv.0
    };

    let ptr = data.cast::<f64>();

    // Bit-reversal load into flat staging buffer
    let mut stage = [0.0_f64; 64];
    for (i, &br_i) in BR32.iter().enumerate() {
        unsafe {
            let src = ptr.add(br_i * 2);
            stage[2 * i] = *src;
            stage[2 * i + 1] = *src.add(1);
        }
    }

    // Load 8 ZMMs (each ZMM = 4 complex f64)
    let sp = stage.as_ptr();
    let mut z = [_mm512_setzero_pd(); 8];
    for (i, zi) in z.iter_mut().enumerate() {
        *zi = unsafe { _mm512_loadu_pd(sp.add(i * 8)) };
    }

    // Stage 1: butterfly within each ZMM (pairs 0,1 and 2,3 within each ZMM)
    macro_rules! stage1_zmm {
        ($z:expr) => {{
            let even = _mm512_shuffle_f64x2($z, $z, 0x88);
            let odd = _mm512_shuffle_f64x2($z, $z, 0xDD);
            let sum = _mm512_add_pd(even, odd);
            let diff = _mm512_sub_pd(even, odd);
            let lo = _mm512_shuffle_f64x2(sum, diff, 0b00_00_00_00);
            let hi = _mm512_shuffle_f64x2(sum, diff, 0b01_01_01_01);
            _mm512_shuffle_f64x2(lo, hi, 0b10_00_10_00)
        }};
    }

    for zi in &mut z {
        *zi = stage1_zmm!(*zi);
    }

    // Write back for scalar stages
    let sp_mut = stage.as_mut_ptr();
    for (i, zi) in z.iter().enumerate() {
        unsafe { _mm512_storeu_pd(sp_mut.add(i * 8), *zi) };
    }

    // Stages 2-5: scalar DIT butterfly with precomputed twiddles
    let a = stage.as_mut_ptr();
    let n = 32usize;

    let mut span = 4usize;
    while span <= n {
        let half = span / 2;
        let stride = n / span;
        let mut k = 0;
        while k < n {
            for j in 0..half {
                let tw_idx = j * stride;
                let c = twiddles[2 * tw_idx];
                let s = twiddles[2 * tw_idx + 1];

                unsafe {
                    let u_re = *a.add((k + j) * 2);
                    let u_im = *a.add((k + j) * 2 + 1);
                    let v_re_raw = *a.add((k + j + half) * 2);
                    let v_im_raw = *a.add((k + j + half) * 2 + 1);

                    let (v_re, v_im) = cmul_f64(v_re_raw, v_im_raw, c, s);

                    *a.add((k + j) * 2) = u_re + v_re;
                    *a.add((k + j) * 2 + 1) = u_im + v_im;
                    *a.add((k + j + half) * 2) = u_re - v_re;
                    *a.add((k + j + half) * 2 + 1) = u_im - v_im;
                }
            }
            k += span;
        }
        span *= 2;
    }

    // Write results back
    let src = stage.as_ptr();
    unsafe {
        for i in 0..32usize {
            *data.add(i) = Complex {
                re: *src.add(2 * i),
                im: *src.add(2 * i + 1),
            };
        }
    }

    #[cfg(test)]
    {
        use core::sync::atomic::Ordering;
        super::hand_avx512_tests::HAND_AVX512_HIT_32_F64.store(true, Ordering::Relaxed);
    }
}

// ─────────────────────────────────────────────────────────────────────────────
// Size-64 f64  (radix-2 DIT, 6 stages)
// ─────────────────────────────────────────────────────────────────────────────

/// Hand-tuned AVX-512 in-place complex DFT for N=64, f64.
///
/// Uses 16 ZMM registers for full in-register storage of all 64 complex f64
/// elements.  A staged bit-reversal permutation followed by 6 DIT butterfly
/// stages with precomputed W_64 twiddles is applied.
///
/// # Safety
/// - Caller must ensure `avx512f` is available.
/// - `data` must contain exactly 64 `Complex<f64>` elements.
#[cfg(target_arch = "x86_64")]
#[target_feature(enable = "avx512f")]
pub(crate) unsafe fn hand_avx512_size64_f64(data: *mut Complex<f64>, sign: i32) {
    use core::arch::x86_64::*;

    let twiddles = if sign < 0 {
        &twiddles_64_f64().fwd.0
    } else {
        &twiddles_64_f64().inv.0
    };

    let ptr = data.cast::<f64>();

    // Bit-reversal load into staging buffer (64 complexes = 128 f64)
    let mut stage = [0.0_f64; 128];
    for (i, &br_i) in BR64.iter().enumerate() {
        unsafe {
            let src = ptr.add(br_i * 2);
            stage[2 * i] = *src;
            stage[2 * i + 1] = *src.add(1);
        }
    }

    // Load 16 ZMMs (each ZMM = 4 complex f64 = 8 f64)
    let sp = stage.as_ptr();
    let mut z = [_mm512_setzero_pd(); 16];
    for (i, zi) in z.iter_mut().enumerate() {
        *zi = unsafe { _mm512_loadu_pd(sp.add(i * 8)) };
    }

    // Stage 1: butterfly within each ZMM (pairs 0,1 and 2,3)
    macro_rules! stage1_zmm {
        ($z:expr) => {{
            let even = _mm512_shuffle_f64x2($z, $z, 0x88);
            let odd = _mm512_shuffle_f64x2($z, $z, 0xDD);
            let sum = _mm512_add_pd(even, odd);
            let diff = _mm512_sub_pd(even, odd);
            let lo = _mm512_shuffle_f64x2(sum, diff, 0b00_00_00_00);
            let hi = _mm512_shuffle_f64x2(sum, diff, 0b01_01_01_01);
            _mm512_shuffle_f64x2(lo, hi, 0b10_00_10_00)
        }};
    }

    for zi in &mut z {
        *zi = stage1_zmm!(*zi);
    }

    // Write back for scalar stages
    let sp_mut = stage.as_mut_ptr();
    for (i, zi) in z.iter().enumerate() {
        unsafe { _mm512_storeu_pd(sp_mut.add(i * 8), *zi) };
    }

    // Stages 2-6: scalar DIT butterfly with precomputed twiddles
    let a = stage.as_mut_ptr();
    let n = 64usize;

    let mut span = 4usize;
    while span <= n {
        let half = span / 2;
        let stride = n / span;
        let mut k = 0;
        while k < n {
            for j in 0..half {
                let tw_idx = j * stride;
                let c = twiddles[2 * tw_idx];
                let s = twiddles[2 * tw_idx + 1];

                unsafe {
                    let u_re = *a.add((k + j) * 2);
                    let u_im = *a.add((k + j) * 2 + 1);
                    let v_re_raw = *a.add((k + j + half) * 2);
                    let v_im_raw = *a.add((k + j + half) * 2 + 1);

                    let (v_re, v_im) = cmul_f64(v_re_raw, v_im_raw, c, s);

                    *a.add((k + j) * 2) = u_re + v_re;
                    *a.add((k + j) * 2 + 1) = u_im + v_im;
                    *a.add((k + j + half) * 2) = u_re - v_re;
                    *a.add((k + j + half) * 2 + 1) = u_im - v_im;
                }
            }
            k += span;
        }
        span *= 2;
    }

    // Write results back
    let src = stage.as_ptr();
    unsafe {
        for i in 0..64usize {
            *data.add(i) = Complex {
                re: *src.add(2 * i),
                im: *src.add(2 * i + 1),
            };
        }
    }

    #[cfg(test)]
    {
        use core::sync::atomic::Ordering;
        super::hand_avx512_tests::HAND_AVX512_HIT_64_F64.store(true, Ordering::Relaxed);
    }
}

// ─────────────────────────────────────────────────────────────────────────────
// Size-16 f32  (radix-2 DIT, 4 stages)
// ─────────────────────────────────────────────────────────────────────────────

/// Hand-tuned AVX-512 in-place complex DFT for N=16, f32.
///
/// 16 complex f32 = 32 f32 scalars → fits in 2 ZMM (`__m512`) registers.
///
/// # Safety
/// - Caller must ensure `avx512f` is available.
/// - `data` must contain exactly 16 `Complex<f32>` elements.
#[cfg(target_arch = "x86_64")]
#[target_feature(enable = "avx512f")]
pub(crate) unsafe fn hand_avx512_size16_f32(data: *mut Complex<f32>, sign: i32) {
    use core::arch::x86_64::*;

    let twiddles = if sign < 0 {
        &twiddles_16_f32().fwd.0
    } else {
        &twiddles_16_f32().inv.0
    };

    let ptr = data.cast::<f32>();

    // Bit-reversal load into staging buffer
    let mut stage = [0.0_f32; 32];
    for (i, &br_i) in BR16.iter().enumerate() {
        unsafe {
            let src = ptr.add(br_i * 2);
            stage[2 * i] = *src;
            stage[2 * i + 1] = *src.add(1);
        }
    }

    // Load 2 ZMMs (each ZMM = 8 complex f32 = 16 f32)
    let sp = stage.as_ptr();
    let (mut z0, mut z1) = unsafe { (_mm512_loadu_ps(sp), _mm512_loadu_ps(sp.add(16))) };

    // Stage 1: butterfly pairs within each ZMM.
    // Each ZMM holds 8 complex: butterfly (0,1), (2,3), (4,5), (6,7).
    // Use 128-bit lane shuffles: _mm512_shuffle_f32x4 (4-wide, 32-bit granularity).
    // We need to separate even-indexed and odd-indexed complexes within each ZMM.
    // even = complexes at indices 0,2,4,6 → 128-bit blocks 0,2,0,2
    // odd  = complexes at indices 1,3,5,7 → 128-bit blocks 1,3,1,3
    // Then butterfly and re-interleave.
    macro_rules! stage1_zmm_f32 {
        ($z:expr) => {{
            // Each 128-bit lane holds 2 complex f32: [a.re, a.im, b.re, b.im].
            // Butterfly the 2 complexes within each lane: out = [a+b, a-b].
            // Duplicate first complex per lane: [a.re, a.im, a.re, a.im]
            let a_dup = _mm512_shuffle_ps($z, $z, 0b01_00_01_00);
            // Duplicate second complex per lane: [b.re, b.im, b.re, b.im]
            let b_dup = _mm512_shuffle_ps($z, $z, 0b11_10_11_10);
            let sum = _mm512_add_ps(a_dup, b_dup);
            let diff = _mm512_sub_ps(a_dup, b_dup);
            // Pack [sum, diff] per lane: [s.re, s.im, d.re, d.im]
            _mm512_shuffle_ps(sum, diff, 0b01_00_01_00)
        }};
    }

    z0 = stage1_zmm_f32!(z0);
    z1 = stage1_zmm_f32!(z1);

    // Write back
    let sp_mut = stage.as_mut_ptr();
    unsafe {
        _mm512_storeu_ps(sp_mut, z0);
        _mm512_storeu_ps(sp_mut.add(16), z1);
    }

    // Stages 2-4: scalar DIT
    let a = stage.as_mut_ptr();
    let n = 16usize;

    let mut span = 4usize;
    while span <= n {
        let half = span / 2;
        let stride = n / span;
        let mut k = 0;
        while k < n {
            for j in 0..half {
                let tw_idx = j * stride;
                let c = twiddles[2 * tw_idx];
                let s = twiddles[2 * tw_idx + 1];

                unsafe {
                    let u_re = *a.add((k + j) * 2);
                    let u_im = *a.add((k + j) * 2 + 1);
                    let v_re_raw = *a.add((k + j + half) * 2);
                    let v_im_raw = *a.add((k + j + half) * 2 + 1);

                    let (v_re, v_im) = cmul_f32(v_re_raw, v_im_raw, c, s);

                    *a.add((k + j) * 2) = u_re + v_re;
                    *a.add((k + j) * 2 + 1) = u_im + v_im;
                    *a.add((k + j + half) * 2) = u_re - v_re;
                    *a.add((k + j + half) * 2 + 1) = u_im - v_im;
                }
            }
            k += span;
        }
        span *= 2;
    }

    // Write results back
    let src = stage.as_ptr();
    unsafe {
        for i in 0..16usize {
            *data.add(i) = Complex {
                re: *src.add(2 * i),
                im: *src.add(2 * i + 1),
            };
        }
    }

    #[cfg(test)]
    {
        use core::sync::atomic::Ordering;
        super::hand_avx512_tests::HAND_AVX512_HIT_16_F32.store(true, Ordering::Relaxed);
    }
}

// ─────────────────────────────────────────────────────────────────────────────
// Size-32 f32  (radix-2 DIT, 5 stages)
// ─────────────────────────────────────────────────────────────────────────────

/// Hand-tuned AVX-512 in-place complex DFT for N=32, f32.
///
/// 32 complex f32 = 64 f32 → 4 ZMM registers.
///
/// # Safety
/// - Caller must ensure `avx512f` is available.
/// - `data` must contain exactly 32 `Complex<f32>` elements.
#[cfg(target_arch = "x86_64")]
#[target_feature(enable = "avx512f")]
pub(crate) unsafe fn hand_avx512_size32_f32(data: *mut Complex<f32>, sign: i32) {
    use core::arch::x86_64::*;

    let twiddles = if sign < 0 {
        &twiddles_32_f32().fwd.0
    } else {
        &twiddles_32_f32().inv.0
    };

    let ptr = data.cast::<f32>();

    // Bit-reversal load
    let mut stage = [0.0_f32; 64];
    for (i, &br_i) in BR32.iter().enumerate() {
        unsafe {
            let src = ptr.add(br_i * 2);
            stage[2 * i] = *src;
            stage[2 * i + 1] = *src.add(1);
        }
    }

    // Load 4 ZMMs
    let sp = stage.as_ptr();
    let mut z = [_mm512_setzero_ps(); 4];
    for (i, zi) in z.iter_mut().enumerate() {
        *zi = unsafe { _mm512_loadu_ps(sp.add(i * 16)) };
    }

    // Stage 1
    macro_rules! stage1_zmm_f32 {
        ($z:expr) => {{
            // Each 128-bit lane holds 2 complex f32: [a.re, a.im, b.re, b.im].
            // Butterfly the 2 complexes within each lane: out = [a+b, a-b].
            let a_dup = _mm512_shuffle_ps($z, $z, 0b01_00_01_00); // [a.re, a.im, a.re, a.im] per lane
            let b_dup = _mm512_shuffle_ps($z, $z, 0b11_10_11_10); // [b.re, b.im, b.re, b.im] per lane
            let sum  = _mm512_add_ps(a_dup, b_dup);
            let diff = _mm512_sub_ps(a_dup, b_dup);
            _mm512_shuffle_ps(sum, diff, 0b01_00_01_00) // [s.re, s.im, d.re, d.im] per lane
        }};
    }

    for zi in &mut z {
        *zi = stage1_zmm_f32!(*zi);
    }

    let sp_mut = stage.as_mut_ptr();
    for (i, zi) in z.iter().enumerate() {
        unsafe { _mm512_storeu_ps(sp_mut.add(i * 16), *zi) };
    }

    // Stages 2-5: scalar DIT
    let a = stage.as_mut_ptr();
    let n = 32usize;

    let mut span = 4usize;
    while span <= n {
        let half = span / 2;
        let stride = n / span;
        let mut k = 0;
        while k < n {
            for j in 0..half {
                let tw_idx = j * stride;
                let c = twiddles[2 * tw_idx];
                let s = twiddles[2 * tw_idx + 1];

                unsafe {
                    let u_re = *a.add((k + j) * 2);
                    let u_im = *a.add((k + j) * 2 + 1);
                    let v_re_raw = *a.add((k + j + half) * 2);
                    let v_im_raw = *a.add((k + j + half) * 2 + 1);

                    let (v_re, v_im) = cmul_f32(v_re_raw, v_im_raw, c, s);

                    *a.add((k + j) * 2) = u_re + v_re;
                    *a.add((k + j) * 2 + 1) = u_im + v_im;
                    *a.add((k + j + half) * 2) = u_re - v_re;
                    *a.add((k + j + half) * 2 + 1) = u_im - v_im;
                }
            }
            k += span;
        }
        span *= 2;
    }

    // Write results back
    let src = stage.as_ptr();
    unsafe {
        for i in 0..32usize {
            *data.add(i) = Complex {
                re: *src.add(2 * i),
                im: *src.add(2 * i + 1),
            };
        }
    }

    #[cfg(test)]
    {
        use core::sync::atomic::Ordering;
        super::hand_avx512_tests::HAND_AVX512_HIT_32_F32.store(true, Ordering::Relaxed);
    }
}

// ─────────────────────────────────────────────────────────────────────────────
// Size-64 f32  (radix-2 DIT, 6 stages)
// ─────────────────────────────────────────────────────────────────────────────

/// Hand-tuned AVX-512 in-place complex DFT for N=64, f32.
///
/// 64 complex f32 = 128 f32 → 8 ZMM registers.
///
/// # Safety
/// - Caller must ensure `avx512f` is available.
/// - `data` must contain exactly 64 `Complex<f32>` elements.
#[cfg(target_arch = "x86_64")]
#[target_feature(enable = "avx512f")]
pub(crate) unsafe fn hand_avx512_size64_f32(data: *mut Complex<f32>, sign: i32) {
    use core::arch::x86_64::*;

    let twiddles = if sign < 0 {
        &twiddles_64_f32().fwd.0
    } else {
        &twiddles_64_f32().inv.0
    };

    let ptr = data.cast::<f32>();

    // Bit-reversal load
    let mut stage = [0.0_f32; 128];
    for (i, &br_i) in BR64.iter().enumerate() {
        unsafe {
            let src = ptr.add(br_i * 2);
            stage[2 * i] = *src;
            stage[2 * i + 1] = *src.add(1);
        }
    }

    // Load 8 ZMMs
    let sp = stage.as_ptr();
    let mut z = [_mm512_setzero_ps(); 8];
    for (i, zi) in z.iter_mut().enumerate() {
        *zi = unsafe { _mm512_loadu_ps(sp.add(i * 16)) };
    }

    // Stage 1
    macro_rules! stage1_zmm_f32 {
        ($z:expr) => {{
            // Each 128-bit lane holds 2 complex f32: [a.re, a.im, b.re, b.im].
            // Butterfly the 2 complexes within each lane: out = [a+b, a-b].
            let a_dup = _mm512_shuffle_ps($z, $z, 0b01_00_01_00); // [a.re, a.im, a.re, a.im] per lane
            let b_dup = _mm512_shuffle_ps($z, $z, 0b11_10_11_10); // [b.re, b.im, b.re, b.im] per lane
            let sum  = _mm512_add_ps(a_dup, b_dup);
            let diff = _mm512_sub_ps(a_dup, b_dup);
            _mm512_shuffle_ps(sum, diff, 0b01_00_01_00) // [s.re, s.im, d.re, d.im] per lane
        }};
    }

    for zi in &mut z {
        *zi = stage1_zmm_f32!(*zi);
    }

    let sp_mut = stage.as_mut_ptr();
    for (i, zi) in z.iter().enumerate() {
        unsafe { _mm512_storeu_ps(sp_mut.add(i * 16), *zi) };
    }

    // Stages 2-6: scalar DIT
    let a = stage.as_mut_ptr();
    let n = 64usize;

    let mut span = 4usize;
    while span <= n {
        let half = span / 2;
        let stride = n / span;
        let mut k = 0;
        while k < n {
            for j in 0..half {
                let tw_idx = j * stride;
                let c = twiddles[2 * tw_idx];
                let s = twiddles[2 * tw_idx + 1];

                unsafe {
                    let u_re = *a.add((k + j) * 2);
                    let u_im = *a.add((k + j) * 2 + 1);
                    let v_re_raw = *a.add((k + j + half) * 2);
                    let v_im_raw = *a.add((k + j + half) * 2 + 1);

                    let (v_re, v_im) = cmul_f32(v_re_raw, v_im_raw, c, s);

                    *a.add((k + j) * 2) = u_re + v_re;
                    *a.add((k + j) * 2 + 1) = u_im + v_im;
                    *a.add((k + j + half) * 2) = u_re - v_re;
                    *a.add((k + j + half) * 2 + 1) = u_im - v_im;
                }
            }
            k += span;
        }
        span *= 2;
    }

    // Write results back
    let src = stage.as_ptr();
    unsafe {
        for i in 0..64usize {
            *data.add(i) = Complex {
                re: *src.add(2 * i),
                im: *src.add(2 * i + 1),
            };
        }
    }

    #[cfg(test)]
    {
        use core::sync::atomic::Ordering;
        super::hand_avx512_tests::HAND_AVX512_HIT_64_F32.store(true, Ordering::Relaxed);
    }
}

// ─────────────────────────────────────────────────────────────────────────────
// Public dispatch wrappers
// ─────────────────────────────────────────────────────────────────────────────

/// Dispatch size-16 f64 DFT to hand-tuned AVX-512 if available, else scalar.
#[cfg(target_arch = "x86_64")]
#[inline]
pub fn dispatch_hand_avx512_size16_f64(data: &mut [Complex<f64>], sign: i32) {
    if is_x86_feature_detected!("avx512f") {
        // Safety: avx512f confirmed, data has exactly 16 elements.
        unsafe {
            hand_avx512_size16_f64(data.as_mut_ptr(), sign);
        }
    } else {
        super::notw_16(data, sign);
    }
}

/// Dispatch size-32 f64 DFT to hand-tuned AVX-512 if available, else scalar.
#[cfg(target_arch = "x86_64")]
#[inline]
pub fn dispatch_hand_avx512_size32_f64(data: &mut [Complex<f64>], sign: i32) {
    if is_x86_feature_detected!("avx512f") {
        unsafe {
            hand_avx512_size32_f64(data.as_mut_ptr(), sign);
        }
    } else {
        super::notw_32(data, sign);
    }
}

/// Dispatch size-64 f64 DFT to hand-tuned AVX-512 if available, else scalar.
#[cfg(target_arch = "x86_64")]
#[inline]
pub fn dispatch_hand_avx512_size64_f64(data: &mut [Complex<f64>], sign: i32) {
    if is_x86_feature_detected!("avx512f") {
        unsafe {
            hand_avx512_size64_f64(data.as_mut_ptr(), sign);
        }
    } else {
        super::notw_64(data, sign);
    }
}

/// Dispatch size-16 f32 DFT to hand-tuned AVX-512 if available, else scalar.
#[cfg(target_arch = "x86_64")]
#[inline]
pub fn dispatch_hand_avx512_size16_f32(data: &mut [Complex<f32>], sign: i32) {
    if is_x86_feature_detected!("avx512f") {
        unsafe {
            hand_avx512_size16_f32(data.as_mut_ptr(), sign);
        }
    } else {
        super::notw_16(data, sign);
    }
}

/// Dispatch size-32 f32 DFT to hand-tuned AVX-512 if available, else scalar.
#[cfg(target_arch = "x86_64")]
#[inline]
pub fn dispatch_hand_avx512_size32_f32(data: &mut [Complex<f32>], sign: i32) {
    if is_x86_feature_detected!("avx512f") {
        unsafe {
            hand_avx512_size32_f32(data.as_mut_ptr(), sign);
        }
    } else {
        super::notw_32(data, sign);
    }
}

/// Dispatch size-64 f32 DFT to hand-tuned AVX-512 if available, else scalar.
#[cfg(target_arch = "x86_64")]
#[inline]
pub fn dispatch_hand_avx512_size64_f32(data: &mut [Complex<f32>], sign: i32) {
    if is_x86_feature_detected!("avx512f") {
        unsafe {
            hand_avx512_size64_f32(data.as_mut_ptr(), sign);
        }
    } else {
        super::notw_64(data, sign);
    }
}