Chris@19: /* Chris@19: * Copyright (c) 2003, 2007-14 Matteo Frigo Chris@19: * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology Chris@19: * Chris@19: * This program is free software; you can redistribute it and/or modify Chris@19: * it under the terms of the GNU General Public License as published by Chris@19: * the Free Software Foundation; either version 2 of the License, or Chris@19: * (at your option) any later version. Chris@19: * Chris@19: * This program is distributed in the hope that it will be useful, Chris@19: * but WITHOUT ANY WARRANTY; without even the implied warranty of Chris@19: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the Chris@19: * GNU General Public License for more details. Chris@19: * Chris@19: * You should have received a copy of the GNU General Public License Chris@19: * along with this program; if not, write to the Free Software Chris@19: * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Chris@19: * Chris@19: */ Chris@19: Chris@19: /* This file was automatically generated --- DO NOT EDIT */ Chris@19: /* Generated on Tue Mar 4 13:49:31 EST 2014 */ Chris@19: Chris@19: #include "codelet-rdft.h" Chris@19: Chris@19: #ifdef HAVE_FMA Chris@19: Chris@19: /* Generated by: ../../../genfft/gen_hc2cdft.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -twiddle-log3 -precompute-twiddles -n 4 -dit -name hc2cfdft2_4 -include hc2cf.h */ Chris@19: Chris@19: /* Chris@19: * This function contains 32 FP additions, 24 FP multiplications, Chris@19: * (or, 24 additions, 16 multiplications, 8 fused multiply/add), Chris@19: * 33 stack variables, 1 constants, and 16 memory accesses Chris@19: */ Chris@19: #include "hc2cf.h" Chris@19: Chris@19: static void hc2cfdft2_4(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms) Chris@19: { Chris@19: DK(KP500000000, +0.500000000000000000000000000000000000000000000); Chris@19: { Chris@19: INT m; Chris@19: for (m = mb, W = W + ((mb - 1) * 4); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 4, MAKE_VOLATILE_STRIDE(16, rs)) { Chris@19: E T1, T5, T2, T4; Chris@19: T1 = W[0]; Chris@19: T5 = W[3]; Chris@19: T2 = W[2]; Chris@19: T4 = W[1]; Chris@19: { Chris@19: E Tc, T6, Tp, Tj, Tw, Tt, T9, TE, To, TC, Ta, Tr, Tf, Tl, Tm; Chris@19: { Chris@19: E Th, Tb, T3, Ti; Chris@19: Th = Ip[0]; Chris@19: Tb = T1 * T5; Chris@19: T3 = T1 * T2; Chris@19: Ti = Im[0]; Chris@19: Tl = Rm[0]; Chris@19: Tc = FNMS(T4, T2, Tb); Chris@19: T6 = FMA(T4, T5, T3); Chris@19: Tp = Th + Ti; Chris@19: Tj = Th - Ti; Chris@19: Tm = Rp[0]; Chris@19: } Chris@19: { Chris@19: E T7, T8, Td, Tn, Te; Chris@19: T7 = Ip[WS(rs, 1)]; Chris@19: T8 = Im[WS(rs, 1)]; Chris@19: Td = Rp[WS(rs, 1)]; Chris@19: Tw = Tm + Tl; Chris@19: Tn = Tl - Tm; Chris@19: Tt = T7 + T8; Chris@19: T9 = T7 - T8; Chris@19: Te = Rm[WS(rs, 1)]; Chris@19: TE = T4 * Tn; Chris@19: To = T1 * Tn; Chris@19: TC = T2 * Tt; Chris@19: Ta = T6 * T9; Chris@19: Tr = Td - Te; Chris@19: Tf = Td + Te; Chris@19: } Chris@19: { Chris@19: E Tq, Tk, TB, Ty, Tu, TI, TG, TF; Chris@19: Tq = FNMS(T4, Tp, To); Chris@19: TF = FMA(T1, Tp, TE); Chris@19: { Chris@19: E Tg, Tx, TD, Ts; Chris@19: Tg = FNMS(Tc, Tf, Ta); Chris@19: Tx = T6 * Tf; Chris@19: TD = FNMS(T5, Tr, TC); Chris@19: Ts = T2 * Tr; Chris@19: Tk = Tg + Tj; Chris@19: TB = Tj - Tg; Chris@19: Ty = FMA(Tc, T9, Tx); Chris@19: Tu = FMA(T5, Tt, Ts); Chris@19: TI = TD + TF; Chris@19: TG = TD - TF; Chris@19: } Chris@19: { Chris@19: E Tz, TH, Tv, TA; Chris@19: Tz = Tw - Ty; Chris@19: TH = Tw + Ty; Chris@19: Tv = Tq - Tu; Chris@19: TA = Tu + Tq; Chris@19: Rp[0] = KP500000000 * (TH + TI); Chris@19: Rm[WS(rs, 1)] = KP500000000 * (TH - TI); Chris@19: Rm[0] = KP500000000 * (Tz - TA); Chris@19: Im[WS(rs, 1)] = KP500000000 * (Tv - Tk); Chris@19: Ip[0] = KP500000000 * (Tk + Tv); Chris@19: Im[0] = KP500000000 * (TG - TB); Chris@19: Rp[WS(rs, 1)] = KP500000000 * (Tz + TA); Chris@19: Ip[WS(rs, 1)] = KP500000000 * (TB + TG); Chris@19: } Chris@19: } Chris@19: } Chris@19: } Chris@19: } Chris@19: } Chris@19: Chris@19: static const tw_instr twinstr[] = { Chris@19: {TW_CEXP, 1, 1}, Chris@19: {TW_CEXP, 1, 3}, Chris@19: {TW_NEXT, 1, 0} Chris@19: }; Chris@19: Chris@19: static const hc2c_desc desc = { 4, "hc2cfdft2_4", twinstr, &GENUS, {24, 16, 8, 0} }; Chris@19: Chris@19: void X(codelet_hc2cfdft2_4) (planner *p) { Chris@19: X(khc2c_register) (p, hc2cfdft2_4, &desc, HC2C_VIA_DFT); Chris@19: } Chris@19: #else /* HAVE_FMA */ Chris@19: Chris@19: /* Generated by: ../../../genfft/gen_hc2cdft.native -compact -variables 4 -pipeline-latency 4 -twiddle-log3 -precompute-twiddles -n 4 -dit -name hc2cfdft2_4 -include hc2cf.h */ Chris@19: Chris@19: /* Chris@19: * This function contains 32 FP additions, 24 FP multiplications, Chris@19: * (or, 24 additions, 16 multiplications, 8 fused multiply/add), Chris@19: * 24 stack variables, 1 constants, and 16 memory accesses Chris@19: */ Chris@19: #include "hc2cf.h" Chris@19: Chris@19: static void hc2cfdft2_4(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms) Chris@19: { Chris@19: DK(KP500000000, +0.500000000000000000000000000000000000000000000); Chris@19: { Chris@19: INT m; Chris@19: for (m = mb, W = W + ((mb - 1) * 4); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 4, MAKE_VOLATILE_STRIDE(16, rs)) { Chris@19: E T1, T3, T2, T4, T5, T9; Chris@19: T1 = W[0]; Chris@19: T3 = W[1]; Chris@19: T2 = W[2]; Chris@19: T4 = W[3]; Chris@19: T5 = FMA(T1, T2, T3 * T4); Chris@19: T9 = FNMS(T3, T2, T1 * T4); Chris@19: { Chris@19: E Tg, Tr, Tm, Tx, Td, Tw, Tp, Ts; Chris@19: { Chris@19: E Te, Tf, Tl, Ti, Tj, Tk; Chris@19: Te = Ip[0]; Chris@19: Tf = Im[0]; Chris@19: Tl = Te + Tf; Chris@19: Ti = Rm[0]; Chris@19: Tj = Rp[0]; Chris@19: Tk = Ti - Tj; Chris@19: Tg = Te - Tf; Chris@19: Tr = Tj + Ti; Chris@19: Tm = FNMS(T3, Tl, T1 * Tk); Chris@19: Tx = FMA(T3, Tk, T1 * Tl); Chris@19: } Chris@19: { Chris@19: E T8, To, Tc, Tn; Chris@19: { Chris@19: E T6, T7, Ta, Tb; Chris@19: T6 = Ip[WS(rs, 1)]; Chris@19: T7 = Im[WS(rs, 1)]; Chris@19: T8 = T6 - T7; Chris@19: To = T6 + T7; Chris@19: Ta = Rp[WS(rs, 1)]; Chris@19: Tb = Rm[WS(rs, 1)]; Chris@19: Tc = Ta + Tb; Chris@19: Tn = Ta - Tb; Chris@19: } Chris@19: Td = FNMS(T9, Tc, T5 * T8); Chris@19: Tw = FNMS(T4, Tn, T2 * To); Chris@19: Tp = FMA(T2, Tn, T4 * To); Chris@19: Ts = FMA(T5, Tc, T9 * T8); Chris@19: } Chris@19: { Chris@19: E Th, Tq, Tz, TA; Chris@19: Th = Td + Tg; Chris@19: Tq = Tm - Tp; Chris@19: Ip[0] = KP500000000 * (Th + Tq); Chris@19: Im[WS(rs, 1)] = KP500000000 * (Tq - Th); Chris@19: Tz = Tr + Ts; Chris@19: TA = Tw + Tx; Chris@19: Rm[WS(rs, 1)] = KP500000000 * (Tz - TA); Chris@19: Rp[0] = KP500000000 * (Tz + TA); Chris@19: } Chris@19: { Chris@19: E Tt, Tu, Tv, Ty; Chris@19: Tt = Tr - Ts; Chris@19: Tu = Tp + Tm; Chris@19: Rm[0] = KP500000000 * (Tt - Tu); Chris@19: Rp[WS(rs, 1)] = KP500000000 * (Tt + Tu); Chris@19: Tv = Tg - Td; Chris@19: Ty = Tw - Tx; Chris@19: Ip[WS(rs, 1)] = KP500000000 * (Tv + Ty); Chris@19: Im[0] = KP500000000 * (Ty - Tv); Chris@19: } Chris@19: } Chris@19: } Chris@19: } Chris@19: } Chris@19: Chris@19: static const tw_instr twinstr[] = { Chris@19: {TW_CEXP, 1, 1}, Chris@19: {TW_CEXP, 1, 3}, Chris@19: {TW_NEXT, 1, 0} Chris@19: }; Chris@19: Chris@19: static const hc2c_desc desc = { 4, "hc2cfdft2_4", twinstr, &GENUS, {24, 16, 8, 0} }; Chris@19: Chris@19: void X(codelet_hc2cfdft2_4) (planner *p) { Chris@19: X(khc2c_register) (p, hc2cfdft2_4, &desc, HC2C_VIA_DFT); Chris@19: } Chris@19: #endif /* HAVE_FMA */