Chris@42: /* Chris@42: * Copyright (c) 2003, 2007-14 Matteo Frigo Chris@42: * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology Chris@42: * Chris@42: * This program is free software; you can redistribute it and/or modify Chris@42: * it under the terms of the GNU General Public License as published by Chris@42: * the Free Software Foundation; either version 2 of the License, or Chris@42: * (at your option) any later version. Chris@42: * Chris@42: * This program is distributed in the hope that it will be useful, Chris@42: * but WITHOUT ANY WARRANTY; without even the implied warranty of Chris@42: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the Chris@42: * GNU General Public License for more details. Chris@42: * Chris@42: * You should have received a copy of the GNU General Public License Chris@42: * along with this program; if not, write to the Free Software Chris@42: * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Chris@42: * Chris@42: */ Chris@42: Chris@42: /* This file was automatically generated --- DO NOT EDIT */ Chris@42: /* Generated on Sat Jul 30 16:35:50 EDT 2016 */ Chris@42: Chris@42: #include "codelet-dft.h" Chris@42: Chris@42: #ifdef HAVE_FMA Chris@42: Chris@42: /* Generated by: ../../../genfft/gen_notw.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 8 -name n1_8 -include n.h */ Chris@42: Chris@42: /* Chris@42: * This function contains 52 FP additions, 8 FP multiplications, Chris@42: * (or, 44 additions, 0 multiplications, 8 fused multiply/add), Chris@42: * 36 stack variables, 1 constants, and 32 memory accesses Chris@42: */ Chris@42: #include "n.h" Chris@42: Chris@42: static void n1_8(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs) Chris@42: { Chris@42: DK(KP707106781, +0.707106781186547524400844362104849039284835938); Chris@42: { Chris@42: INT i; Chris@42: for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(32, is), MAKE_VOLATILE_STRIDE(32, os)) { Chris@42: E TF, TE, TD, TI; Chris@42: { Chris@42: E Tn, T3, TC, Ti, TB, T6, To, Tl, Td, TN, Tz, TH, Ta, Tq, Tt; Chris@42: E TM; Chris@42: { Chris@42: E T4, T5, Tj, Tk; Chris@42: { Chris@42: E T1, T2, Tg, Th; Chris@42: T1 = ri[0]; Chris@42: T2 = ri[WS(is, 4)]; Chris@42: Tg = ii[0]; Chris@42: Th = ii[WS(is, 4)]; Chris@42: T4 = ri[WS(is, 2)]; Chris@42: Tn = T1 - T2; Chris@42: T3 = T1 + T2; Chris@42: TC = Tg - Th; Chris@42: Ti = Tg + Th; Chris@42: T5 = ri[WS(is, 6)]; Chris@42: } Chris@42: Tj = ii[WS(is, 2)]; Chris@42: Tk = ii[WS(is, 6)]; Chris@42: { Chris@42: E Tb, Tc, Tw, Tx; Chris@42: Tb = ri[WS(is, 7)]; Chris@42: TB = T4 - T5; Chris@42: T6 = T4 + T5; Chris@42: To = Tj - Tk; Chris@42: Tl = Tj + Tk; Chris@42: Tc = ri[WS(is, 3)]; Chris@42: Tw = ii[WS(is, 7)]; Chris@42: Tx = ii[WS(is, 3)]; Chris@42: { Chris@42: E T8, Tv, Ty, T9, Tr, Ts; Chris@42: T8 = ri[WS(is, 1)]; Chris@42: Td = Tb + Tc; Chris@42: Tv = Tb - Tc; Chris@42: TN = Tw + Tx; Chris@42: Ty = Tw - Tx; Chris@42: T9 = ri[WS(is, 5)]; Chris@42: Tr = ii[WS(is, 1)]; Chris@42: Ts = ii[WS(is, 5)]; Chris@42: Tz = Tv - Ty; Chris@42: TH = Tv + Ty; Chris@42: Ta = T8 + T9; Chris@42: Tq = T8 - T9; Chris@42: Tt = Tr - Ts; Chris@42: TM = Tr + Ts; Chris@42: } Chris@42: } Chris@42: } Chris@42: { Chris@42: E TL, TG, Tu, Tf, Tm, TO; Chris@42: { Chris@42: E T7, Te, TP, TQ; Chris@42: TL = T3 - T6; Chris@42: T7 = T3 + T6; Chris@42: TG = Tt - Tq; Chris@42: Tu = Tq + Tt; Chris@42: Te = Ta + Td; Chris@42: Tf = Td - Ta; Chris@42: Tm = Ti - Tl; Chris@42: TP = Ti + Tl; Chris@42: TQ = TM + TN; Chris@42: TO = TM - TN; Chris@42: ro[0] = T7 + Te; Chris@42: ro[WS(os, 4)] = T7 - Te; Chris@42: io[0] = TP + TQ; Chris@42: io[WS(os, 4)] = TP - TQ; Chris@42: } Chris@42: { Chris@42: E Tp, TA, TJ, TK; Chris@42: TF = Tn - To; Chris@42: Tp = Tn + To; Chris@42: io[WS(os, 6)] = Tm - Tf; Chris@42: io[WS(os, 2)] = Tf + Tm; Chris@42: ro[WS(os, 2)] = TL + TO; Chris@42: ro[WS(os, 6)] = TL - TO; Chris@42: TA = Tu + Tz; Chris@42: TE = Tz - Tu; Chris@42: TD = TB + TC; Chris@42: TJ = TC - TB; Chris@42: TK = TG + TH; Chris@42: TI = TG - TH; Chris@42: ro[WS(os, 1)] = FMA(KP707106781, TA, Tp); Chris@42: ro[WS(os, 5)] = FNMS(KP707106781, TA, Tp); Chris@42: io[WS(os, 1)] = FMA(KP707106781, TK, TJ); Chris@42: io[WS(os, 5)] = FNMS(KP707106781, TK, TJ); Chris@42: } Chris@42: } Chris@42: } Chris@42: io[WS(os, 3)] = FMA(KP707106781, TE, TD); Chris@42: io[WS(os, 7)] = FNMS(KP707106781, TE, TD); Chris@42: ro[WS(os, 3)] = FMA(KP707106781, TI, TF); Chris@42: ro[WS(os, 7)] = FNMS(KP707106781, TI, TF); Chris@42: } Chris@42: } Chris@42: } Chris@42: Chris@42: static const kdft_desc desc = { 8, "n1_8", {44, 0, 8, 0}, &GENUS, 0, 0, 0, 0 }; Chris@42: Chris@42: void X(codelet_n1_8) (planner *p) { Chris@42: X(kdft_register) (p, n1_8, &desc); Chris@42: } Chris@42: Chris@42: #else /* HAVE_FMA */ Chris@42: Chris@42: /* Generated by: ../../../genfft/gen_notw.native -compact -variables 4 -pipeline-latency 4 -n 8 -name n1_8 -include n.h */ Chris@42: Chris@42: /* Chris@42: * This function contains 52 FP additions, 4 FP multiplications, Chris@42: * (or, 52 additions, 4 multiplications, 0 fused multiply/add), Chris@42: * 28 stack variables, 1 constants, and 32 memory accesses Chris@42: */ Chris@42: #include "n.h" Chris@42: Chris@42: static void n1_8(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs) Chris@42: { Chris@42: DK(KP707106781, +0.707106781186547524400844362104849039284835938); Chris@42: { Chris@42: INT i; Chris@42: for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(32, is), MAKE_VOLATILE_STRIDE(32, os)) { Chris@42: E T3, Tn, Ti, TC, T6, TB, Tl, To, Td, TN, Tz, TH, Ta, TM, Tu; Chris@42: E TG; Chris@42: { Chris@42: E T1, T2, Tj, Tk; Chris@42: T1 = ri[0]; Chris@42: T2 = ri[WS(is, 4)]; Chris@42: T3 = T1 + T2; Chris@42: Tn = T1 - T2; Chris@42: { Chris@42: E Tg, Th, T4, T5; Chris@42: Tg = ii[0]; Chris@42: Th = ii[WS(is, 4)]; Chris@42: Ti = Tg + Th; Chris@42: TC = Tg - Th; Chris@42: T4 = ri[WS(is, 2)]; Chris@42: T5 = ri[WS(is, 6)]; Chris@42: T6 = T4 + T5; Chris@42: TB = T4 - T5; Chris@42: } Chris@42: Tj = ii[WS(is, 2)]; Chris@42: Tk = ii[WS(is, 6)]; Chris@42: Tl = Tj + Tk; Chris@42: To = Tj - Tk; Chris@42: { Chris@42: E Tb, Tc, Tv, Tw, Tx, Ty; Chris@42: Tb = ri[WS(is, 7)]; Chris@42: Tc = ri[WS(is, 3)]; Chris@42: Tv = Tb - Tc; Chris@42: Tw = ii[WS(is, 7)]; Chris@42: Tx = ii[WS(is, 3)]; Chris@42: Ty = Tw - Tx; Chris@42: Td = Tb + Tc; Chris@42: TN = Tw + Tx; Chris@42: Tz = Tv - Ty; Chris@42: TH = Tv + Ty; Chris@42: } Chris@42: { Chris@42: E T8, T9, Tq, Tr, Ts, Tt; Chris@42: T8 = ri[WS(is, 1)]; Chris@42: T9 = ri[WS(is, 5)]; Chris@42: Tq = T8 - T9; Chris@42: Tr = ii[WS(is, 1)]; Chris@42: Ts = ii[WS(is, 5)]; Chris@42: Tt = Tr - Ts; Chris@42: Ta = T8 + T9; Chris@42: TM = Tr + Ts; Chris@42: Tu = Tq + Tt; Chris@42: TG = Tt - Tq; Chris@42: } Chris@42: } Chris@42: { Chris@42: E T7, Te, TP, TQ; Chris@42: T7 = T3 + T6; Chris@42: Te = Ta + Td; Chris@42: ro[WS(os, 4)] = T7 - Te; Chris@42: ro[0] = T7 + Te; Chris@42: TP = Ti + Tl; Chris@42: TQ = TM + TN; Chris@42: io[WS(os, 4)] = TP - TQ; Chris@42: io[0] = TP + TQ; Chris@42: } Chris@42: { Chris@42: E Tf, Tm, TL, TO; Chris@42: Tf = Td - Ta; Chris@42: Tm = Ti - Tl; Chris@42: io[WS(os, 2)] = Tf + Tm; Chris@42: io[WS(os, 6)] = Tm - Tf; Chris@42: TL = T3 - T6; Chris@42: TO = TM - TN; Chris@42: ro[WS(os, 6)] = TL - TO; Chris@42: ro[WS(os, 2)] = TL + TO; Chris@42: } Chris@42: { Chris@42: E Tp, TA, TJ, TK; Chris@42: Tp = Tn + To; Chris@42: TA = KP707106781 * (Tu + Tz); Chris@42: ro[WS(os, 5)] = Tp - TA; Chris@42: ro[WS(os, 1)] = Tp + TA; Chris@42: TJ = TC - TB; Chris@42: TK = KP707106781 * (TG + TH); Chris@42: io[WS(os, 5)] = TJ - TK; Chris@42: io[WS(os, 1)] = TJ + TK; Chris@42: } Chris@42: { Chris@42: E TD, TE, TF, TI; Chris@42: TD = TB + TC; Chris@42: TE = KP707106781 * (Tz - Tu); Chris@42: io[WS(os, 7)] = TD - TE; Chris@42: io[WS(os, 3)] = TD + TE; Chris@42: TF = Tn - To; Chris@42: TI = KP707106781 * (TG - TH); Chris@42: ro[WS(os, 7)] = TF - TI; Chris@42: ro[WS(os, 3)] = TF + TI; Chris@42: } Chris@42: } Chris@42: } Chris@42: } Chris@42: Chris@42: static const kdft_desc desc = { 8, "n1_8", {52, 4, 0, 0}, &GENUS, 0, 0, 0, 0 }; Chris@42: Chris@42: void X(codelet_n1_8) (planner *p) { Chris@42: X(kdft_register) (p, n1_8, &desc); Chris@42: } Chris@42: Chris@42: #endif /* HAVE_FMA */