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
//! `OxiFFT` Codelet Generator
//!
//! This proc-macro crate generates optimized FFT codelets at compile time.
//! It replaces FFTW's OCaml-based genfft with Rust procedural macros.
//!
//! # Overview
//!
//! Codelets are highly optimized kernels for small FFT sizes (2-64).
//! They are generated at compile time with:
//! - Common subexpression elimination
//! - Strength reduction
//! - Optimal instruction ordering
//! - SIMD-aware code patterns
//!
//! # Usage
//!
//! ```ignore
//! use oxifft_codegen::gen_dft_codelet;
//!
//! // Generate size-8 DFT codelet
//! gen_dft_codelet!(8);
//! ```
extern crate proc_macro;
use TokenStream;
/// Generate a non-twiddle (base case) DFT codelet.
///
/// # Arguments
/// * `size` - The FFT size (must be 2, 4, 8, 16, 32, or 64)
///
/// # Example
/// ```ignore
/// gen_notw_codelet!(8);
/// ```
/// Generate a twiddle-factor DFT codelet.
/// Generate a split-radix twiddle codelet.
///
/// The split-radix FFT decomposes an N-point DFT into one N/2-point DFT
/// (even-indexed elements) and two N/4-point DFTs (odd-indexed elements)
/// with twiddle factors `W_N^k` and `W_N^{3k`}, reducing the total multiply count.
///
/// # Usage
/// ```ignore
/// // Generate generic runtime-parameterized split-radix twiddle codelet
/// gen_split_radix_twiddle_codelet!();
///
/// // Generate specialized unrolled version for N=8
/// gen_split_radix_twiddle_codelet!(8);
///
/// // Generate specialized unrolled version for N=16
/// gen_split_radix_twiddle_codelet!(16);
/// ```
/// Generate a SIMD-optimized codelet.
/// Convenience macro to generate all codelets for a size.
/// Generate an odd-size (3, 5, 7) DFT codelet using Winograd minimum-multiply factorization.
///
/// The generated function is an in-place `&mut [Complex<T>]` codelet with `sign: i32`
/// for runtime forward/inverse dispatch (matching `gen_notw_codelet!` conventions).
///
/// # Arguments
/// * The size literal — must be 3, 5, or 7.
///
/// # Example
/// ```ignore
/// gen_odd_codelet!(3); // emits `codelet_notw_3`
/// gen_odd_codelet!(5); // emits `codelet_notw_5`
/// gen_odd_codelet!(7); // emits `codelet_notw_7`
/// ```
/// Generate a Rader prime DFT codelet for primes 11 and 13.
///
/// The generated function uses the Rader algorithm to reduce the prime-size DFT
/// to a cyclic convolution, computed as straight-line code with hardcoded twiddle
/// factors. Generator g = 2 for both supported primes.
///
/// # Arguments
/// * The prime literal — must be 11 or 13.
///
/// # Example
/// ```ignore
/// gen_rader_codelet!(11); // emits `codelet_notw_11`
/// gen_rader_codelet!(13); // emits `codelet_notw_13`
/// ```
/// Generate a vectorized multi-transform codelet.
///
/// Emits a function that processes V DFT transforms of size N simultaneously,
/// where V is the SIMD lane count for the chosen ISA and precision.
///
/// The generated function name follows `notw_{size}_v{v}_{isa}_{ty}`.
///
/// # Arguments
/// * `size` — DFT size: 2, 4, or 8
/// * `v` — number of simultaneous transforms (lane count)
/// * `isa` — target ISA: `sse2`, `avx2`, or `scalar`
/// * `ty` — float type: `f32` or `f64`
///
/// # Example
/// ```ignore
/// gen_multi_transform_codelet!(size = 4, v = 8, isa = avx2, ty = f32);
/// // emits: pub unsafe fn notw_4_v8_avx2_f32(...)
/// ```
/// Generate a cached ISA runtime dispatcher for a SIMD codelet.
///
/// Emits a function `codelet_simd_{size}_cached_{ty}(data, sign)` that caches
/// the best ISA level in an `AtomicU8` static, avoiding repeated
/// `is_x86_feature_detected!` / `is_aarch64_feature_detected!` calls on hot
/// paths. The cached dispatcher delegates to the same arch-specific inner
/// functions as the uncached `codelet_simd_{size}<T>` dispatcher.
///
/// # Arguments
/// * `size` — DFT size: 2, 4, 8, or 16
/// * `ty` — float type: `f32` or `f64`
///
/// # Priority order (high → low)
/// - `x86_64`: AVX-512F > AVX2+FMA > AVX > SSE2 > scalar
/// - `aarch64`: NEON > scalar
/// - other: scalar
///
/// # Example
/// ```ignore
/// gen_dispatcher_codelet!(size = 4, ty = f32);
/// // emits: pub fn codelet_simd_4_cached_f32(data: &mut [Complex<f32>], sign: i32)
/// ```
/// Generate a complete FFT codelet for any user-specified size N.
///
/// Routes to the most appropriate emitter based on the size:
/// - **Direct set** {2, 4, 8, 16, 32, 64}: optimised non-twiddle codelet.
/// - **Winograd odd** {3, 5, 7}: Winograd minimum-multiply codelet.
/// - **Rader hardcoded** {11, 13}: straight-line Rader cyclic-convolution codelet.
/// - **Smooth-7 composites** (all prime factors in {2, 3, 5, 7}):
/// runtime-delegating wrapper using `Plan::dft_1d` (mixed-radix path).
/// - **Primes p ≤ 1021**: runtime-delegating wrapper (runtime Rader/Generic).
/// - **All other sizes**: runtime-delegating Bluestein wrapper via `Plan::dft_1d`.
///
/// # Syntax
/// ```ignore
/// gen_any_codelet!(8); // emits codelet_any_8 (direct notw codelet)
/// gen_any_codelet!(15); // emits codelet_any_15 (runtime mixed-radix wrapper)
/// gen_any_codelet!(2003); // emits codelet_any_2003 (Bluestein wrapper)
/// ```
///
/// The emitted function signature is:
/// ```ignore
/// pub fn codelet_any_{N}<T: crate::kernel::Float>(
/// x: &mut [crate::kernel::Complex<T>],
/// sign: i32,
/// )
/// ```
/// Generate a real-to-half-complex (R2HC) or half-complex-to-real (HC2R) codelet.
///
/// The generated function has the same signature and produces numerically equivalent
/// results to the hand-written codelets in `oxifft/src/rdft/codelets/mod.rs`.
///
/// # Usage
/// ```ignore
/// use oxifft_codegen::gen_rdft_codelet;
///
/// // Generates `pub fn r2hc_4_gen<T: crate::kernel::Float>(x: &[T], y: &mut [Complex<T>])`
/// gen_rdft_codelet!(size = 4, kind = R2hc);
///
/// // Generates `pub fn hc2r_4_gen<T: crate::kernel::Float>(y: &[Complex<T>], x: &mut [T])`
/// gen_rdft_codelet!(size = 4, kind = Hc2r);
/// ```
///
/// Supported sizes: 2, 4, 8.