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:45:48 EST 2014 */ Chris@19: Chris@19: #include "codelet-dft.h" Chris@19: Chris@19: #ifdef HAVE_FMA Chris@19: Chris@19: /* Generated by: ../../../genfft/gen_notw.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 5 -name n1_5 -include n.h */ Chris@19: Chris@19: /* Chris@19: * This function contains 32 FP additions, 18 FP multiplications, Chris@19: * (or, 14 additions, 0 multiplications, 18 fused multiply/add), Chris@19: * 37 stack variables, 4 constants, and 20 memory accesses Chris@19: */ Chris@19: #include "n.h" Chris@19: Chris@19: static void n1_5(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs) Chris@19: { Chris@19: DK(KP951056516, +0.951056516295153572116439333379382143405698634); Chris@19: DK(KP559016994, +0.559016994374947424102293417182819058860154590); Chris@19: DK(KP250000000, +0.250000000000000000000000000000000000000000000); Chris@19: DK(KP618033988, +0.618033988749894848204586834365638117720309180); Chris@19: { Chris@19: INT i; Chris@19: for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(20, is), MAKE_VOLATILE_STRIDE(20, os)) { Chris@19: E Tq, Ti, Tk, Tu, Tw, Tp, Tb, Tj, Tr, Tv; Chris@19: { Chris@19: E T1, Tl, Ts, Tt, T8, Ta, Te, Tm, Tn, Th, To, T9; Chris@19: T1 = ri[0]; Chris@19: Tl = ii[0]; Chris@19: { Chris@19: E T2, T3, T5, T6; Chris@19: T2 = ri[WS(is, 1)]; Chris@19: T3 = ri[WS(is, 4)]; Chris@19: T5 = ri[WS(is, 2)]; Chris@19: T6 = ri[WS(is, 3)]; Chris@19: { Chris@19: E Tc, T4, T7, Td, Tf, Tg; Chris@19: Tc = ii[WS(is, 1)]; Chris@19: Ts = T2 - T3; Chris@19: T4 = T2 + T3; Chris@19: Tt = T5 - T6; Chris@19: T7 = T5 + T6; Chris@19: Td = ii[WS(is, 4)]; Chris@19: Tf = ii[WS(is, 2)]; Chris@19: Tg = ii[WS(is, 3)]; Chris@19: T8 = T4 + T7; Chris@19: Ta = T4 - T7; Chris@19: Te = Tc - Td; Chris@19: Tm = Tc + Td; Chris@19: Tn = Tf + Tg; Chris@19: Th = Tf - Tg; Chris@19: } Chris@19: } Chris@19: ro[0] = T1 + T8; Chris@19: To = Tm + Tn; Chris@19: Tq = Tm - Tn; Chris@19: Ti = FMA(KP618033988, Th, Te); Chris@19: Tk = FNMS(KP618033988, Te, Th); Chris@19: io[0] = Tl + To; Chris@19: T9 = FNMS(KP250000000, T8, T1); Chris@19: Tu = FMA(KP618033988, Tt, Ts); Chris@19: Tw = FNMS(KP618033988, Ts, Tt); Chris@19: Tp = FNMS(KP250000000, To, Tl); Chris@19: Tb = FMA(KP559016994, Ta, T9); Chris@19: Tj = FNMS(KP559016994, Ta, T9); Chris@19: } Chris@19: Tr = FMA(KP559016994, Tq, Tp); Chris@19: Tv = FNMS(KP559016994, Tq, Tp); Chris@19: ro[WS(os, 2)] = FNMS(KP951056516, Tk, Tj); Chris@19: ro[WS(os, 3)] = FMA(KP951056516, Tk, Tj); Chris@19: ro[WS(os, 1)] = FMA(KP951056516, Ti, Tb); Chris@19: ro[WS(os, 4)] = FNMS(KP951056516, Ti, Tb); Chris@19: io[WS(os, 2)] = FMA(KP951056516, Tw, Tv); Chris@19: io[WS(os, 3)] = FNMS(KP951056516, Tw, Tv); Chris@19: io[WS(os, 4)] = FMA(KP951056516, Tu, Tr); Chris@19: io[WS(os, 1)] = FNMS(KP951056516, Tu, Tr); Chris@19: } Chris@19: } Chris@19: } Chris@19: Chris@19: static const kdft_desc desc = { 5, "n1_5", {14, 0, 18, 0}, &GENUS, 0, 0, 0, 0 }; Chris@19: Chris@19: void X(codelet_n1_5) (planner *p) { Chris@19: X(kdft_register) (p, n1_5, &desc); Chris@19: } Chris@19: Chris@19: #else /* HAVE_FMA */ Chris@19: Chris@19: /* Generated by: ../../../genfft/gen_notw.native -compact -variables 4 -pipeline-latency 4 -n 5 -name n1_5 -include n.h */ Chris@19: Chris@19: /* Chris@19: * This function contains 32 FP additions, 12 FP multiplications, Chris@19: * (or, 26 additions, 6 multiplications, 6 fused multiply/add), Chris@19: * 21 stack variables, 4 constants, and 20 memory accesses Chris@19: */ Chris@19: #include "n.h" Chris@19: Chris@19: static void n1_5(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs) Chris@19: { Chris@19: DK(KP250000000, +0.250000000000000000000000000000000000000000000); Chris@19: DK(KP587785252, +0.587785252292473129168705954639072768597652438); Chris@19: DK(KP951056516, +0.951056516295153572116439333379382143405698634); Chris@19: DK(KP559016994, +0.559016994374947424102293417182819058860154590); Chris@19: { Chris@19: INT i; Chris@19: for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(20, is), MAKE_VOLATILE_STRIDE(20, os)) { Chris@19: E T1, To, T8, Tt, T9, Ts, Te, Tp, Th, Tn; Chris@19: T1 = ri[0]; Chris@19: To = ii[0]; Chris@19: { Chris@19: E T2, T3, T4, T5, T6, T7; Chris@19: T2 = ri[WS(is, 1)]; Chris@19: T3 = ri[WS(is, 4)]; Chris@19: T4 = T2 + T3; Chris@19: T5 = ri[WS(is, 2)]; Chris@19: T6 = ri[WS(is, 3)]; Chris@19: T7 = T5 + T6; Chris@19: T8 = T4 + T7; Chris@19: Tt = T5 - T6; Chris@19: T9 = KP559016994 * (T4 - T7); Chris@19: Ts = T2 - T3; Chris@19: } Chris@19: { Chris@19: E Tc, Td, Tl, Tf, Tg, Tm; Chris@19: Tc = ii[WS(is, 1)]; Chris@19: Td = ii[WS(is, 4)]; Chris@19: Tl = Tc + Td; Chris@19: Tf = ii[WS(is, 2)]; Chris@19: Tg = ii[WS(is, 3)]; Chris@19: Tm = Tf + Tg; Chris@19: Te = Tc - Td; Chris@19: Tp = Tl + Tm; Chris@19: Th = Tf - Tg; Chris@19: Tn = KP559016994 * (Tl - Tm); Chris@19: } Chris@19: ro[0] = T1 + T8; Chris@19: io[0] = To + Tp; Chris@19: { Chris@19: E Ti, Tk, Tb, Tj, Ta; Chris@19: Ti = FMA(KP951056516, Te, KP587785252 * Th); Chris@19: Tk = FNMS(KP587785252, Te, KP951056516 * Th); Chris@19: Ta = FNMS(KP250000000, T8, T1); Chris@19: Tb = T9 + Ta; Chris@19: Tj = Ta - T9; Chris@19: ro[WS(os, 4)] = Tb - Ti; Chris@19: ro[WS(os, 3)] = Tj + Tk; Chris@19: ro[WS(os, 1)] = Tb + Ti; Chris@19: ro[WS(os, 2)] = Tj - Tk; Chris@19: } Chris@19: { Chris@19: E Tu, Tv, Tr, Tw, Tq; Chris@19: Tu = FMA(KP951056516, Ts, KP587785252 * Tt); Chris@19: Tv = FNMS(KP587785252, Ts, KP951056516 * Tt); Chris@19: Tq = FNMS(KP250000000, Tp, To); Chris@19: Tr = Tn + Tq; Chris@19: Tw = Tq - Tn; Chris@19: io[WS(os, 1)] = Tr - Tu; Chris@19: io[WS(os, 3)] = Tw - Tv; Chris@19: io[WS(os, 4)] = Tu + Tr; Chris@19: io[WS(os, 2)] = Tv + Tw; Chris@19: } Chris@19: } Chris@19: } Chris@19: } Chris@19: Chris@19: static const kdft_desc desc = { 5, "n1_5", {26, 6, 6, 0}, &GENUS, 0, 0, 0, 0 }; Chris@19: Chris@19: void X(codelet_n1_5) (planner *p) { Chris@19: X(kdft_register) (p, n1_5, &desc); Chris@19: } Chris@19: Chris@19: #endif /* HAVE_FMA */