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:36:17 EST 2012 */ cannam@95: cannam@95: #include "codelet-dft.h" cannam@95: cannam@95: #ifdef HAVE_FMA cannam@95: cannam@95: /* Generated by: ../../../genfft/gen_twidsq.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -reload-twiddle -dif -n 2 -name q1_2 -include q.h */ cannam@95: cannam@95: /* cannam@95: * This function contains 12 FP additions, 8 FP multiplications, cannam@95: * (or, 8 additions, 4 multiplications, 4 fused multiply/add), cannam@95: * 21 stack variables, 0 constants, and 16 memory accesses cannam@95: */ cannam@95: #include "q.h" cannam@95: cannam@95: static void q1_2(R *rio, R *iio, const R *W, stride rs, stride vs, INT mb, INT me, INT ms) cannam@95: { cannam@95: { cannam@95: INT m; cannam@95: for (m = mb, W = W + (mb * 2); m < me; m = m + 1, rio = rio + ms, iio = iio + ms, W = W + 2, MAKE_VOLATILE_STRIDE(4, rs), MAKE_VOLATILE_STRIDE(0, vs)) { cannam@95: E T9, T6, T5; cannam@95: { cannam@95: E T1, T2, T7, T8, Tb, T4, Tc, Th, Ti, Te, Tj, Td, Tg; cannam@95: T1 = rio[0]; cannam@95: T2 = rio[WS(rs, 1)]; cannam@95: T7 = iio[0]; cannam@95: T8 = iio[WS(rs, 1)]; cannam@95: Tb = rio[WS(vs, 1)]; cannam@95: T4 = T1 - T2; cannam@95: Tc = rio[WS(vs, 1) + WS(rs, 1)]; cannam@95: T9 = T7 - T8; cannam@95: Th = iio[WS(vs, 1)]; cannam@95: Ti = iio[WS(vs, 1) + WS(rs, 1)]; cannam@95: Te = Tb - Tc; cannam@95: rio[0] = T1 + T2; cannam@95: iio[0] = T7 + T8; cannam@95: Tj = Th - Ti; cannam@95: rio[WS(rs, 1)] = Tb + Tc; cannam@95: iio[WS(rs, 1)] = Th + Ti; cannam@95: Td = W[0]; cannam@95: Tg = W[1]; cannam@95: { cannam@95: E T3, Tk, Tf, Ta; cannam@95: T3 = W[0]; cannam@95: T6 = W[1]; cannam@95: Tk = Td * Tj; cannam@95: Tf = Td * Te; cannam@95: Ta = T3 * T9; cannam@95: T5 = T3 * T4; cannam@95: iio[WS(vs, 1) + WS(rs, 1)] = FNMS(Tg, Te, Tk); cannam@95: rio[WS(vs, 1) + WS(rs, 1)] = FMA(Tg, Tj, Tf); cannam@95: iio[WS(vs, 1)] = FNMS(T6, T4, Ta); cannam@95: } cannam@95: } cannam@95: rio[WS(vs, 1)] = FMA(T6, T9, T5); cannam@95: } cannam@95: } cannam@95: } cannam@95: cannam@95: static const tw_instr twinstr[] = { cannam@95: {TW_FULL, 0, 2}, cannam@95: {TW_NEXT, 1, 0} cannam@95: }; cannam@95: cannam@95: static const ct_desc desc = { 2, "q1_2", twinstr, &GENUS, {8, 4, 4, 0}, 0, 0, 0 }; cannam@95: cannam@95: void X(codelet_q1_2) (planner *p) { cannam@95: X(kdft_difsq_register) (p, q1_2, &desc); cannam@95: } cannam@95: #else /* HAVE_FMA */ cannam@95: cannam@95: /* Generated by: ../../../genfft/gen_twidsq.native -compact -variables 4 -pipeline-latency 4 -reload-twiddle -dif -n 2 -name q1_2 -include q.h */ cannam@95: cannam@95: /* cannam@95: * This function contains 12 FP additions, 8 FP multiplications, cannam@95: * (or, 8 additions, 4 multiplications, 4 fused multiply/add), cannam@95: * 17 stack variables, 0 constants, and 16 memory accesses cannam@95: */ cannam@95: #include "q.h" cannam@95: cannam@95: static void q1_2(R *rio, R *iio, const R *W, stride rs, stride vs, INT mb, INT me, INT ms) cannam@95: { cannam@95: { cannam@95: INT m; cannam@95: for (m = mb, W = W + (mb * 2); m < me; m = m + 1, rio = rio + ms, iio = iio + ms, W = W + 2, MAKE_VOLATILE_STRIDE(4, rs), MAKE_VOLATILE_STRIDE(0, vs)) { cannam@95: E T1, T2, T4, T6, T7, T8, T9, Ta, Tc, Te, Tf, Tg; cannam@95: T1 = rio[0]; cannam@95: T2 = rio[WS(rs, 1)]; cannam@95: T4 = T1 - T2; cannam@95: T6 = iio[0]; cannam@95: T7 = iio[WS(rs, 1)]; cannam@95: T8 = T6 - T7; cannam@95: T9 = rio[WS(vs, 1)]; cannam@95: Ta = rio[WS(vs, 1) + WS(rs, 1)]; cannam@95: Tc = T9 - Ta; cannam@95: Te = iio[WS(vs, 1)]; cannam@95: Tf = iio[WS(vs, 1) + WS(rs, 1)]; cannam@95: Tg = Te - Tf; cannam@95: rio[0] = T1 + T2; cannam@95: iio[0] = T6 + T7; cannam@95: rio[WS(rs, 1)] = T9 + Ta; cannam@95: iio[WS(rs, 1)] = Te + Tf; cannam@95: { cannam@95: E Tb, Td, T3, T5; cannam@95: Tb = W[0]; cannam@95: Td = W[1]; cannam@95: rio[WS(vs, 1) + WS(rs, 1)] = FMA(Tb, Tc, Td * Tg); cannam@95: iio[WS(vs, 1) + WS(rs, 1)] = FNMS(Td, Tc, Tb * Tg); cannam@95: T3 = W[0]; cannam@95: T5 = W[1]; cannam@95: rio[WS(vs, 1)] = FMA(T3, T4, T5 * T8); cannam@95: iio[WS(vs, 1)] = FNMS(T5, T4, T3 * T8); cannam@95: } cannam@95: } cannam@95: } cannam@95: } cannam@95: cannam@95: static const tw_instr twinstr[] = { cannam@95: {TW_FULL, 0, 2}, cannam@95: {TW_NEXT, 1, 0} cannam@95: }; cannam@95: cannam@95: static const ct_desc desc = { 2, "q1_2", twinstr, &GENUS, {8, 4, 4, 0}, 0, 0, 0 }; cannam@95: cannam@95: void X(codelet_q1_2) (planner *p) { cannam@95: X(kdft_difsq_register) (p, q1_2, &desc); cannam@95: } cannam@95: #endif /* HAVE_FMA */