/src/fftw3/rdft/scalar/r2cb/r2cb_2.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | * Copyright (c) 2003, 2007-14 Matteo Frigo |
3 | | * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology |
4 | | * |
5 | | * This program is free software; you can redistribute it and/or modify |
6 | | * it under the terms of the GNU General Public License as published by |
7 | | * the Free Software Foundation; either version 2 of the License, or |
8 | | * (at your option) any later version. |
9 | | * |
10 | | * This program is distributed in the hope that it will be useful, |
11 | | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
13 | | * GNU General Public License for more details. |
14 | | * |
15 | | * You should have received a copy of the GNU General Public License |
16 | | * along with this program; if not, write to the Free Software |
17 | | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
18 | | * |
19 | | */ |
20 | | |
21 | | /* This file was automatically generated --- DO NOT EDIT */ |
22 | | /* Generated on Sun Sep 8 06:42:07 UTC 2024 */ |
23 | | |
24 | | #include "rdft/codelet-rdft.h" |
25 | | |
26 | | #if defined(ARCH_PREFERS_FMA) || defined(ISA_EXTENSION_PREFERS_FMA) |
27 | | |
28 | | /* Generated by: ../../../genfft/gen_r2cb.native -fma -compact -variables 4 -pipeline-latency 4 -sign 1 -n 2 -name r2cb_2 -include rdft/scalar/r2cb.h */ |
29 | | |
30 | | /* |
31 | | * This function contains 2 FP additions, 0 FP multiplications, |
32 | | * (or, 2 additions, 0 multiplications, 0 fused multiply/add), |
33 | | * 3 stack variables, 0 constants, and 4 memory accesses |
34 | | */ |
35 | | #include "rdft/scalar/r2cb.h" |
36 | | |
37 | | static void r2cb_2(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs) |
38 | | { |
39 | | { |
40 | | INT i; |
41 | | for (i = v; i > 0; i = i - 1, R0 = R0 + ovs, R1 = R1 + ovs, Cr = Cr + ivs, Ci = Ci + ivs, MAKE_VOLATILE_STRIDE(8, rs), MAKE_VOLATILE_STRIDE(8, csr), MAKE_VOLATILE_STRIDE(8, csi)) { |
42 | | E T1, T2; |
43 | | T1 = Cr[0]; |
44 | | T2 = Cr[WS(csr, 1)]; |
45 | | R1[0] = T1 - T2; |
46 | | R0[0] = T1 + T2; |
47 | | } |
48 | | } |
49 | | } |
50 | | |
51 | | static const kr2c_desc desc = { 2, "r2cb_2", { 2, 0, 0, 0 }, &GENUS }; |
52 | | |
53 | | void X(codelet_r2cb_2) (planner *p) { X(kr2c_register) (p, r2cb_2, &desc); |
54 | | } |
55 | | |
56 | | #else |
57 | | |
58 | | /* Generated by: ../../../genfft/gen_r2cb.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 2 -name r2cb_2 -include rdft/scalar/r2cb.h */ |
59 | | |
60 | | /* |
61 | | * This function contains 2 FP additions, 0 FP multiplications, |
62 | | * (or, 2 additions, 0 multiplications, 0 fused multiply/add), |
63 | | * 3 stack variables, 0 constants, and 4 memory accesses |
64 | | */ |
65 | | #include "rdft/scalar/r2cb.h" |
66 | | |
67 | | static void r2cb_2(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs) |
68 | 0 | { |
69 | 0 | { |
70 | 0 | INT i; |
71 | 0 | for (i = v; i > 0; i = i - 1, R0 = R0 + ovs, R1 = R1 + ovs, Cr = Cr + ivs, Ci = Ci + ivs, MAKE_VOLATILE_STRIDE(8, rs), MAKE_VOLATILE_STRIDE(8, csr), MAKE_VOLATILE_STRIDE(8, csi)) { |
72 | 0 | E T1, T2; |
73 | 0 | T1 = Cr[0]; |
74 | 0 | T2 = Cr[WS(csr, 1)]; |
75 | 0 | R1[0] = T1 - T2; |
76 | 0 | R0[0] = T1 + T2; |
77 | 0 | } |
78 | 0 | } |
79 | 0 | } |
80 | | |
81 | | static const kr2c_desc desc = { 2, "r2cb_2", { 2, 0, 0, 0 }, &GENUS }; |
82 | | |
83 | 1 | void X(codelet_r2cb_2) (planner *p) { X(kr2c_register) (p, r2cb_2, &desc); |
84 | 1 | } |
85 | | |
86 | | #endif |