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:07 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_r2cf.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 8 -name r2cf_8 -include r2cf.h */ Chris@19: Chris@19: /* Chris@19: * This function contains 20 FP additions, 4 FP multiplications, Chris@19: * (or, 16 additions, 0 multiplications, 4 fused multiply/add), Chris@19: * 18 stack variables, 1 constants, and 16 memory accesses Chris@19: */ Chris@19: #include "r2cf.h" Chris@19: Chris@19: static void r2cf_8(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs) Chris@19: { Chris@19: DK(KP707106781, +0.707106781186547524400844362104849039284835938); Chris@19: { Chris@19: INT i; Chris@19: for (i = v; i > 0; i = i - 1, R0 = R0 + ivs, R1 = R1 + ivs, Cr = Cr + ovs, Ci = Ci + ovs, MAKE_VOLATILE_STRIDE(32, rs), MAKE_VOLATILE_STRIDE(32, csr), MAKE_VOLATILE_STRIDE(32, csi)) { Chris@19: E T4, T7, T3, Tj, Td, T5, T8, T9; Chris@19: { Chris@19: E T1, T2, Tb, Tc; Chris@19: T1 = R0[0]; Chris@19: T2 = R0[WS(rs, 2)]; Chris@19: Tb = R1[WS(rs, 3)]; Chris@19: Tc = R1[WS(rs, 1)]; Chris@19: T4 = R0[WS(rs, 1)]; Chris@19: T7 = T1 - T2; Chris@19: T3 = T1 + T2; Chris@19: Tj = Tb + Tc; Chris@19: Td = Tb - Tc; Chris@19: T5 = R0[WS(rs, 3)]; Chris@19: T8 = R1[0]; Chris@19: T9 = R1[WS(rs, 2)]; Chris@19: } Chris@19: { Chris@19: E T6, Tf, Ta, Ti; Chris@19: T6 = T4 + T5; Chris@19: Tf = T4 - T5; Chris@19: Ta = T8 - T9; Chris@19: Ti = T8 + T9; Chris@19: { Chris@19: E Th, Tk, Te, Tg; Chris@19: Th = T3 + T6; Chris@19: Cr[WS(csr, 2)] = T3 - T6; Chris@19: Tk = Ti + Tj; Chris@19: Ci[WS(csi, 2)] = Tj - Ti; Chris@19: Te = Ta + Td; Chris@19: Tg = Td - Ta; Chris@19: Cr[0] = Th + Tk; Chris@19: Cr[WS(csr, 4)] = Th - Tk; Chris@19: Ci[WS(csi, 3)] = FMA(KP707106781, Tg, Tf); Chris@19: Ci[WS(csi, 1)] = FMS(KP707106781, Tg, Tf); Chris@19: Cr[WS(csr, 1)] = FMA(KP707106781, Te, T7); Chris@19: Cr[WS(csr, 3)] = FNMS(KP707106781, Te, T7); Chris@19: } Chris@19: } Chris@19: } Chris@19: } Chris@19: } Chris@19: Chris@19: static const kr2c_desc desc = { 8, "r2cf_8", {16, 0, 4, 0}, &GENUS }; Chris@19: Chris@19: void X(codelet_r2cf_8) (planner *p) { Chris@19: X(kr2c_register) (p, r2cf_8, &desc); Chris@19: } Chris@19: Chris@19: #else /* HAVE_FMA */ Chris@19: Chris@19: /* Generated by: ../../../genfft/gen_r2cf.native -compact -variables 4 -pipeline-latency 4 -n 8 -name r2cf_8 -include r2cf.h */ Chris@19: Chris@19: /* Chris@19: * This function contains 20 FP additions, 2 FP multiplications, Chris@19: * (or, 20 additions, 2 multiplications, 0 fused multiply/add), Chris@19: * 14 stack variables, 1 constants, and 16 memory accesses Chris@19: */ Chris@19: #include "r2cf.h" Chris@19: Chris@19: static void r2cf_8(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs) Chris@19: { Chris@19: DK(KP707106781, +0.707106781186547524400844362104849039284835938); Chris@19: { Chris@19: INT i; Chris@19: for (i = v; i > 0; i = i - 1, R0 = R0 + ivs, R1 = R1 + ivs, Cr = Cr + ovs, Ci = Ci + ovs, MAKE_VOLATILE_STRIDE(32, rs), MAKE_VOLATILE_STRIDE(32, csr), MAKE_VOLATILE_STRIDE(32, csi)) { Chris@19: E T3, T7, Td, Tj, T6, Tg, Ta, Ti; Chris@19: { Chris@19: E T1, T2, Tb, Tc; Chris@19: T1 = R0[0]; Chris@19: T2 = R0[WS(rs, 2)]; Chris@19: T3 = T1 + T2; Chris@19: T7 = T1 - T2; Chris@19: Tb = R1[WS(rs, 3)]; Chris@19: Tc = R1[WS(rs, 1)]; Chris@19: Td = Tb - Tc; Chris@19: Tj = Tb + Tc; Chris@19: } Chris@19: { Chris@19: E T4, T5, T8, T9; Chris@19: T4 = R0[WS(rs, 1)]; Chris@19: T5 = R0[WS(rs, 3)]; Chris@19: T6 = T4 + T5; Chris@19: Tg = T4 - T5; Chris@19: T8 = R1[0]; Chris@19: T9 = R1[WS(rs, 2)]; Chris@19: Ta = T8 - T9; Chris@19: Ti = T8 + T9; Chris@19: } Chris@19: Cr[WS(csr, 2)] = T3 - T6; Chris@19: Ci[WS(csi, 2)] = Tj - Ti; Chris@19: { Chris@19: E Te, Tf, Th, Tk; Chris@19: Te = KP707106781 * (Ta + Td); Chris@19: Cr[WS(csr, 3)] = T7 - Te; Chris@19: Cr[WS(csr, 1)] = T7 + Te; Chris@19: Tf = KP707106781 * (Td - Ta); Chris@19: Ci[WS(csi, 1)] = Tf - Tg; Chris@19: Ci[WS(csi, 3)] = Tg + Tf; Chris@19: Th = T3 + T6; Chris@19: Tk = Ti + Tj; Chris@19: Cr[WS(csr, 4)] = Th - Tk; Chris@19: Cr[0] = Th + Tk; Chris@19: } Chris@19: } Chris@19: } Chris@19: } Chris@19: Chris@19: static const kr2c_desc desc = { 8, "r2cf_8", {20, 2, 0, 0}, &GENUS }; Chris@19: Chris@19: void X(codelet_r2cf_8) (planner *p) { Chris@19: X(kr2c_register) (p, r2cf_8, &desc); Chris@19: } Chris@19: Chris@19: #endif /* HAVE_FMA */