furnace/extern/fftw/rdft/scalar/r2cf/hf_4.c

197 lines
5.1 KiB
C
Raw Normal View History

/*
* Copyright (c) 2003, 2007-14 Matteo Frigo
* Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
*/
/* This file was automatically generated --- DO NOT EDIT */
/* Generated on Tue Sep 14 10:46:12 EDT 2021 */
#include "rdft/codelet-rdft.h"
#if defined(ARCH_PREFERS_FMA) || defined(ISA_EXTENSION_PREFERS_FMA)
/* Generated by: ../../../genfft/gen_hc2hc.native -fma -compact -variables 4 -pipeline-latency 4 -n 4 -dit -name hf_4 -include rdft/scalar/hf.h */
/*
* This function contains 22 FP additions, 12 FP multiplications,
* (or, 16 additions, 6 multiplications, 6 fused multiply/add),
* 15 stack variables, 0 constants, and 16 memory accesses
*/
#include "rdft/scalar/hf.h"
static void hf_4(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
{
{
INT m;
for (m = mb, W = W + ((mb - 1) * 6); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 6, MAKE_VOLATILE_STRIDE(8, rs)) {
E T1, Tv, T7, Tu, Te, To, Tk, Tq;
T1 = cr[0];
Tv = ci[0];
{
E T3, T6, T4, Tt, T2, T5;
T3 = cr[WS(rs, 2)];
T6 = ci[WS(rs, 2)];
T2 = W[2];
T4 = T2 * T3;
Tt = T2 * T6;
T5 = W[3];
T7 = FMA(T5, T6, T4);
Tu = FNMS(T5, T3, Tt);
}
{
E Ta, Td, Tb, Tn, T9, Tc;
Ta = cr[WS(rs, 1)];
Td = ci[WS(rs, 1)];
T9 = W[0];
Tb = T9 * Ta;
Tn = T9 * Td;
Tc = W[1];
Te = FMA(Tc, Td, Tb);
To = FNMS(Tc, Ta, Tn);
}
{
E Tg, Tj, Th, Tp, Tf, Ti;
Tg = cr[WS(rs, 3)];
Tj = ci[WS(rs, 3)];
Tf = W[4];
Th = Tf * Tg;
Tp = Tf * Tj;
Ti = W[5];
Tk = FMA(Ti, Tj, Th);
Tq = FNMS(Ti, Tg, Tp);
}
{
E T8, Tl, Tm, Tr;
T8 = T1 + T7;
Tl = Te + Tk;
ci[WS(rs, 1)] = T8 - Tl;
cr[0] = T8 + Tl;
Tm = T1 - T7;
Tr = To - Tq;
ci[0] = Tm - Tr;
cr[WS(rs, 1)] = Tm + Tr;
}
{
E Ts, Tw, Tx, Ty;
Ts = To + Tq;
Tw = Tu + Tv;
cr[WS(rs, 2)] = Ts - Tw;
ci[WS(rs, 3)] = Ts + Tw;
Tx = Tk - Te;
Ty = Tv - Tu;
cr[WS(rs, 3)] = Tx - Ty;
ci[WS(rs, 2)] = Tx + Ty;
}
}
}
}
static const tw_instr twinstr[] = {
{ TW_FULL, 1, 4 },
{ TW_NEXT, 1, 0 }
};
static const hc2hc_desc desc = { 4, "hf_4", twinstr, &GENUS, { 16, 6, 6, 0 } };
void X(codelet_hf_4) (planner *p) {
X(khc2hc_register) (p, hf_4, &desc);
}
#else
/* Generated by: ../../../genfft/gen_hc2hc.native -compact -variables 4 -pipeline-latency 4 -n 4 -dit -name hf_4 -include rdft/scalar/hf.h */
/*
* This function contains 22 FP additions, 12 FP multiplications,
* (or, 16 additions, 6 multiplications, 6 fused multiply/add),
* 13 stack variables, 0 constants, and 16 memory accesses
*/
#include "rdft/scalar/hf.h"
static void hf_4(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
{
{
INT m;
for (m = mb, W = W + ((mb - 1) * 6); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 6, MAKE_VOLATILE_STRIDE(8, rs)) {
E T1, Tp, T6, To, Tc, Tk, Th, Tl;
T1 = cr[0];
Tp = ci[0];
{
E T3, T5, T2, T4;
T3 = cr[WS(rs, 2)];
T5 = ci[WS(rs, 2)];
T2 = W[2];
T4 = W[3];
T6 = FMA(T2, T3, T4 * T5);
To = FNMS(T4, T3, T2 * T5);
}
{
E T9, Tb, T8, Ta;
T9 = cr[WS(rs, 1)];
Tb = ci[WS(rs, 1)];
T8 = W[0];
Ta = W[1];
Tc = FMA(T8, T9, Ta * Tb);
Tk = FNMS(Ta, T9, T8 * Tb);
}
{
E Te, Tg, Td, Tf;
Te = cr[WS(rs, 3)];
Tg = ci[WS(rs, 3)];
Td = W[4];
Tf = W[5];
Th = FMA(Td, Te, Tf * Tg);
Tl = FNMS(Tf, Te, Td * Tg);
}
{
E T7, Ti, Tj, Tm;
T7 = T1 + T6;
Ti = Tc + Th;
ci[WS(rs, 1)] = T7 - Ti;
cr[0] = T7 + Ti;
Tj = T1 - T6;
Tm = Tk - Tl;
ci[0] = Tj - Tm;
cr[WS(rs, 1)] = Tj + Tm;
}
{
E Tn, Tq, Tr, Ts;
Tn = Tk + Tl;
Tq = To + Tp;
cr[WS(rs, 2)] = Tn - Tq;
ci[WS(rs, 3)] = Tn + Tq;
Tr = Th - Tc;
Ts = Tp - To;
cr[WS(rs, 3)] = Tr - Ts;
ci[WS(rs, 2)] = Tr + Ts;
}
}
}
}
static const tw_instr twinstr[] = {
{ TW_FULL, 1, 4 },
{ TW_NEXT, 1, 0 }
};
static const hc2hc_desc desc = { 4, "hf_4", twinstr, &GENUS, { 16, 6, 6, 0 } };
void X(codelet_hf_4) (planner *p) {
X(khc2hc_register) (p, hf_4, &desc);
}
#endif