Coverage Report

Created: 2025-06-22 06:45

/src/fftw3/rdft/scalar/r2cb/hb2_4.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 Jun 22 06:44:39 UTC 2025 */
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_hc2hc.native -fma -compact -variables 4 -pipeline-latency 4 -sign 1 -twiddle-log3 -precompute-twiddles -n 4 -dif -name hb2_4 -include rdft/scalar/hb.h */
29
30
/*
31
 * This function contains 24 FP additions, 16 FP multiplications,
32
 * (or, 16 additions, 8 multiplications, 8 fused multiply/add),
33
 * 33 stack variables, 0 constants, and 16 memory accesses
34
 */
35
#include "rdft/scalar/hb.h"
36
37
static void hb2_4(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
38
{
39
     {
40
    INT m;
41
    for (m = mb, W = W + ((mb - 1) * 4); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 4, MAKE_VOLATILE_STRIDE(8, rs)) {
42
         E T7, Tb, T8, Ta, Tc, Tg, T9, Tf;
43
         T7 = W[0];
44
         Tb = W[3];
45
         T8 = W[2];
46
         T9 = T7 * T8;
47
         Tf = T7 * Tb;
48
         Ta = W[1];
49
         Tc = FMA(Ta, Tb, T9);
50
         Tg = FNMS(Ta, T8, Tf);
51
         {
52
        E T3, T6, Td, Tj, Tz, Tx, Tr, Tm, Tv, Ts, Tw, TA;
53
        {
54
       E Th, Ti, Tu, Tk, Tl, Tq, Tp, Tt;
55
       Th = ci[WS(rs, 3)];
56
       Ti = cr[WS(rs, 2)];
57
       Tu = Th + Ti;
58
       Tk = ci[WS(rs, 2)];
59
       Tl = cr[WS(rs, 3)];
60
       Tq = Tk + Tl;
61
       {
62
            E T1, T2, T4, T5;
63
            T1 = cr[0];
64
            T2 = ci[WS(rs, 1)];
65
            T3 = T1 + T2;
66
            Tp = T1 - T2;
67
            T4 = cr[WS(rs, 1)];
68
            T5 = ci[0];
69
            T6 = T4 + T5;
70
            Tt = T4 - T5;
71
       }
72
       Td = T3 - T6;
73
       Tj = Th - Ti;
74
       Tz = Tu - Tt;
75
       Tx = Tp + Tq;
76
       Tr = Tp - Tq;
77
       Tm = Tk - Tl;
78
       Tv = Tt + Tu;
79
        }
80
        cr[0] = T3 + T6;
81
        ci[0] = Tj + Tm;
82
        Ts = T7 * Tr;
83
        cr[WS(rs, 1)] = FNMS(Ta, Tv, Ts);
84
        Tw = T7 * Tv;
85
        ci[WS(rs, 1)] = FMA(Ta, Tr, Tw);
86
        TA = T8 * Tz;
87
        ci[WS(rs, 3)] = FMA(Tb, Tx, TA);
88
        {
89
       E Ty, Te, To, Tn;
90
       Ty = T8 * Tx;
91
       cr[WS(rs, 3)] = FNMS(Tb, Tz, Ty);
92
       Te = Tc * Td;
93
       To = Tg * Td;
94
       Tn = Tj - Tm;
95
       cr[WS(rs, 2)] = FNMS(Tg, Tn, Te);
96
       ci[WS(rs, 2)] = FMA(Tc, Tn, To);
97
        }
98
         }
99
    }
100
     }
101
}
102
103
static const tw_instr twinstr[] = {
104
     { TW_CEXP, 1, 1 },
105
     { TW_CEXP, 1, 3 },
106
     { TW_NEXT, 1, 0 }
107
};
108
109
static const hc2hc_desc desc = { 4, "hb2_4", twinstr, &GENUS, { 16, 8, 8, 0 } };
110
111
void X(codelet_hb2_4) (planner *p) {
112
     X(khc2hc_register) (p, hb2_4, &desc);
113
}
114
#else
115
116
/* Generated by: ../../../genfft/gen_hc2hc.native -compact -variables 4 -pipeline-latency 4 -sign 1 -twiddle-log3 -precompute-twiddles -n 4 -dif -name hb2_4 -include rdft/scalar/hb.h */
117
118
/*
119
 * This function contains 24 FP additions, 16 FP multiplications,
120
 * (or, 16 additions, 8 multiplications, 8 fused multiply/add),
121
 * 21 stack variables, 0 constants, and 16 memory accesses
122
 */
123
#include "rdft/scalar/hb.h"
124
125
static void hb2_4(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
126
0
{
127
0
     {
128
0
    INT m;
129
0
    for (m = mb, W = W + ((mb - 1) * 4); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 4, MAKE_VOLATILE_STRIDE(8, rs)) {
130
0
         E T7, T9, T8, Ta, Tb, Td;
131
0
         T7 = W[0];
132
0
         T9 = W[1];
133
0
         T8 = W[2];
134
0
         Ta = W[3];
135
0
         Tb = FMA(T7, T8, T9 * Ta);
136
0
         Td = FNMS(T9, T8, T7 * Ta);
137
0
         {
138
0
        E T3, Tl, T6, To, Tg, Tp, Tj, Tm, Tc, Tk;
139
0
        {
140
0
       E T1, T2, T4, T5;
141
0
       T1 = cr[0];
142
0
       T2 = ci[WS(rs, 1)];
143
0
       T3 = T1 + T2;
144
0
       Tl = T1 - T2;
145
0
       T4 = cr[WS(rs, 1)];
146
0
       T5 = ci[0];
147
0
       T6 = T4 + T5;
148
0
       To = T4 - T5;
149
0
        }
150
0
        {
151
0
       E Te, Tf, Th, Ti;
152
0
       Te = ci[WS(rs, 3)];
153
0
       Tf = cr[WS(rs, 2)];
154
0
       Tg = Te - Tf;
155
0
       Tp = Te + Tf;
156
0
       Th = ci[WS(rs, 2)];
157
0
       Ti = cr[WS(rs, 3)];
158
0
       Tj = Th - Ti;
159
0
       Tm = Th + Ti;
160
0
        }
161
0
        cr[0] = T3 + T6;
162
0
        ci[0] = Tg + Tj;
163
0
        Tc = T3 - T6;
164
0
        Tk = Tg - Tj;
165
0
        cr[WS(rs, 2)] = FNMS(Td, Tk, Tb * Tc);
166
0
        ci[WS(rs, 2)] = FMA(Td, Tc, Tb * Tk);
167
0
        {
168
0
       E Tn, Tq, Tr, Ts;
169
0
       Tn = Tl - Tm;
170
0
       Tq = To + Tp;
171
0
       cr[WS(rs, 1)] = FNMS(T9, Tq, T7 * Tn);
172
0
       ci[WS(rs, 1)] = FMA(T7, Tq, T9 * Tn);
173
0
       Tr = Tl + Tm;
174
0
       Ts = Tp - To;
175
0
       cr[WS(rs, 3)] = FNMS(Ta, Ts, T8 * Tr);
176
0
       ci[WS(rs, 3)] = FMA(T8, Ts, Ta * Tr);
177
0
        }
178
0
         }
179
0
    }
180
0
     }
181
0
}
182
183
static const tw_instr twinstr[] = {
184
     { TW_CEXP, 1, 1 },
185
     { TW_CEXP, 1, 3 },
186
     { TW_NEXT, 1, 0 }
187
};
188
189
static const hc2hc_desc desc = { 4, "hb2_4", twinstr, &GENUS, { 16, 8, 8, 0 } };
190
191
1
void X(codelet_hb2_4) (planner *p) {
192
1
     X(khc2hc_register) (p, hb2_4, &desc);
193
1
}
194
#endif