cannam@95: /* cannam@95: * Copyright (c) 2003, 2007-11 Matteo Frigo cannam@95: * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology cannam@95: * cannam@95: * This program is free software; you can redistribute it and/or modify cannam@95: * it under the terms of the GNU General Public License as published by cannam@95: * the Free Software Foundation; either version 2 of the License, or cannam@95: * (at your option) any later version. cannam@95: * cannam@95: * This program is distributed in the hope that it will be useful, cannam@95: * but WITHOUT ANY WARRANTY; without even the implied warranty of cannam@95: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the cannam@95: * GNU General Public License for more details. cannam@95: * cannam@95: * You should have received a copy of the GNU General Public License cannam@95: * along with this program; if not, write to the Free Software cannam@95: * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA cannam@95: * cannam@95: */ cannam@95: cannam@95: /* This file was automatically generated --- DO NOT EDIT */ cannam@95: /* Generated on Sun Nov 25 07:39:45 EST 2012 */ cannam@95: cannam@95: #include "codelet-rdft.h" cannam@95: cannam@95: #ifdef HAVE_FMA cannam@95: cannam@95: /* Generated by: ../../../genfft/gen_r2cf.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 6 -name r2cf_6 -include r2cf.h */ cannam@95: cannam@95: /* cannam@95: * This function contains 14 FP additions, 4 FP multiplications, cannam@95: * (or, 12 additions, 2 multiplications, 2 fused multiply/add), cannam@95: * 13 stack variables, 2 constants, and 12 memory accesses cannam@95: */ cannam@95: #include "r2cf.h" cannam@95: cannam@95: static void r2cf_6(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs) cannam@95: { cannam@95: DK(KP500000000, +0.500000000000000000000000000000000000000000000); cannam@95: DK(KP866025403, +0.866025403784438646763723170752936183471402627); cannam@95: { cannam@95: INT i; cannam@95: for (i = v; i > 0; i = i - 1, R0 = R0 + ivs, R1 = R1 + ivs, Cr = Cr + ovs, Ci = Ci + ovs, MAKE_VOLATILE_STRIDE(24, rs), MAKE_VOLATILE_STRIDE(24, csr), MAKE_VOLATILE_STRIDE(24, csi)) { cannam@95: E T4, Td, T3, Tc, T9, T5; cannam@95: { cannam@95: E T1, T2, T7, T8; cannam@95: T1 = R0[0]; cannam@95: T2 = R1[WS(rs, 1)]; cannam@95: T7 = R0[WS(rs, 2)]; cannam@95: T8 = R1[0]; cannam@95: T4 = R0[WS(rs, 1)]; cannam@95: Td = T1 + T2; cannam@95: T3 = T1 - T2; cannam@95: Tc = T7 + T8; cannam@95: T9 = T7 - T8; cannam@95: T5 = R1[WS(rs, 2)]; cannam@95: } cannam@95: { cannam@95: E T6, Tb, Te, Ta; cannam@95: T6 = T4 - T5; cannam@95: Tb = T4 + T5; cannam@95: Te = Tb + Tc; cannam@95: Ci[WS(csi, 2)] = KP866025403 * (Tb - Tc); cannam@95: Ta = T6 + T9; cannam@95: Ci[WS(csi, 1)] = KP866025403 * (T9 - T6); cannam@95: Cr[0] = Td + Te; cannam@95: Cr[WS(csr, 2)] = FNMS(KP500000000, Te, Td); cannam@95: Cr[WS(csr, 3)] = T3 + Ta; cannam@95: Cr[WS(csr, 1)] = FNMS(KP500000000, Ta, T3); cannam@95: } cannam@95: } cannam@95: } cannam@95: } cannam@95: cannam@95: static const kr2c_desc desc = { 6, "r2cf_6", {12, 2, 2, 0}, &GENUS }; cannam@95: cannam@95: void X(codelet_r2cf_6) (planner *p) { cannam@95: X(kr2c_register) (p, r2cf_6, &desc); cannam@95: } cannam@95: cannam@95: #else /* HAVE_FMA */ cannam@95: cannam@95: /* Generated by: ../../../genfft/gen_r2cf.native -compact -variables 4 -pipeline-latency 4 -n 6 -name r2cf_6 -include r2cf.h */ cannam@95: cannam@95: /* cannam@95: * This function contains 14 FP additions, 4 FP multiplications, cannam@95: * (or, 12 additions, 2 multiplications, 2 fused multiply/add), cannam@95: * 17 stack variables, 2 constants, and 12 memory accesses cannam@95: */ cannam@95: #include "r2cf.h" cannam@95: cannam@95: static void r2cf_6(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs) cannam@95: { cannam@95: DK(KP500000000, +0.500000000000000000000000000000000000000000000); cannam@95: DK(KP866025403, +0.866025403784438646763723170752936183471402627); cannam@95: { cannam@95: INT i; cannam@95: for (i = v; i > 0; i = i - 1, R0 = R0 + ivs, R1 = R1 + ivs, Cr = Cr + ovs, Ci = Ci + ovs, MAKE_VOLATILE_STRIDE(24, rs), MAKE_VOLATILE_STRIDE(24, csr), MAKE_VOLATILE_STRIDE(24, csi)) { cannam@95: E T3, Td, T9, Tc, T6, Tb, T1, T2, Ta, Te; cannam@95: T1 = R0[0]; cannam@95: T2 = R1[WS(rs, 1)]; cannam@95: T3 = T1 - T2; cannam@95: Td = T1 + T2; cannam@95: { cannam@95: E T7, T8, T4, T5; cannam@95: T7 = R0[WS(rs, 2)]; cannam@95: T8 = R1[0]; cannam@95: T9 = T7 - T8; cannam@95: Tc = T7 + T8; cannam@95: T4 = R0[WS(rs, 1)]; cannam@95: T5 = R1[WS(rs, 2)]; cannam@95: T6 = T4 - T5; cannam@95: Tb = T4 + T5; cannam@95: } cannam@95: Ci[WS(csi, 1)] = KP866025403 * (T9 - T6); cannam@95: Ta = T6 + T9; cannam@95: Cr[WS(csr, 1)] = FNMS(KP500000000, Ta, T3); cannam@95: Cr[WS(csr, 3)] = T3 + Ta; cannam@95: Ci[WS(csi, 2)] = KP866025403 * (Tb - Tc); cannam@95: Te = Tb + Tc; cannam@95: Cr[WS(csr, 2)] = FNMS(KP500000000, Te, Td); cannam@95: Cr[0] = Td + Te; cannam@95: } cannam@95: } cannam@95: } cannam@95: cannam@95: static const kr2c_desc desc = { 6, "r2cf_6", {12, 2, 2, 0}, &GENUS }; cannam@95: cannam@95: void X(codelet_r2cf_6) (planner *p) { cannam@95: X(kr2c_register) (p, r2cf_6, &desc); cannam@95: } cannam@95: cannam@95: #endif /* HAVE_FMA */