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:41:12 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_hc2hc.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -sign 1 -n 4 -dif -name hb_4 -include hb.h */ cannam@95: cannam@95: /* cannam@95: * This function contains 22 FP additions, 12 FP multiplications, cannam@95: * (or, 16 additions, 6 multiplications, 6 fused multiply/add), cannam@95: * 27 stack variables, 0 constants, and 16 memory accesses cannam@95: */ cannam@95: #include "hb.h" cannam@95: cannam@95: static void hb_4(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms) cannam@95: { cannam@95: { cannam@95: INT m; cannam@95: for (m = mb, W = W + ((mb - 1) * 6); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 6, MAKE_VOLATILE_STRIDE(8, rs)) { cannam@95: E T8, Th, Ta, T7, Ti, T9; cannam@95: { cannam@95: E Td, Tg, T3, T6, Tu, Tm, Tx, Tr; cannam@95: { cannam@95: E Tq, Tl, T4, T5, Tk, Tp; cannam@95: { cannam@95: E Tb, Tc, Te, Tf, T1, T2; cannam@95: Tb = ci[WS(rs, 3)]; cannam@95: Tc = cr[WS(rs, 2)]; cannam@95: Te = ci[WS(rs, 2)]; cannam@95: Tf = cr[WS(rs, 3)]; cannam@95: T1 = cr[0]; cannam@95: Tq = Tb + Tc; cannam@95: Td = Tb - Tc; cannam@95: T2 = ci[WS(rs, 1)]; cannam@95: Tl = Te + Tf; cannam@95: Tg = Te - Tf; cannam@95: T4 = cr[WS(rs, 1)]; cannam@95: T5 = ci[0]; cannam@95: T3 = T1 + T2; cannam@95: Tk = T1 - T2; cannam@95: } cannam@95: Tp = T4 - T5; cannam@95: T6 = T4 + T5; cannam@95: Tu = Tk + Tl; cannam@95: Tm = Tk - Tl; cannam@95: Tx = Tq - Tp; cannam@95: Tr = Tp + Tq; cannam@95: T8 = T3 - T6; cannam@95: } cannam@95: cr[0] = T3 + T6; cannam@95: { cannam@95: E Tj, To, Tw, Tv; cannam@95: Tj = W[0]; cannam@95: ci[0] = Td + Tg; cannam@95: To = W[1]; cannam@95: { cannam@95: E Tt, Ts, Tn, Ty; cannam@95: Tt = W[4]; cannam@95: Ts = Tj * Tr; cannam@95: Tn = Tj * Tm; cannam@95: Tw = W[5]; cannam@95: Ty = Tt * Tx; cannam@95: Tv = Tt * Tu; cannam@95: ci[WS(rs, 1)] = FMA(To, Tm, Ts); cannam@95: cr[WS(rs, 1)] = FNMS(To, Tr, Tn); cannam@95: ci[WS(rs, 3)] = FMA(Tw, Tu, Ty); cannam@95: } cannam@95: cr[WS(rs, 3)] = FNMS(Tw, Tx, Tv); cannam@95: Th = Td - Tg; cannam@95: Ta = W[3]; cannam@95: T7 = W[2]; cannam@95: } cannam@95: } cannam@95: Ti = Ta * T8; cannam@95: T9 = T7 * T8; cannam@95: ci[WS(rs, 2)] = FMA(T7, Th, Ti); cannam@95: cr[WS(rs, 2)] = FNMS(Ta, Th, T9); cannam@95: } cannam@95: } cannam@95: } cannam@95: cannam@95: static const tw_instr twinstr[] = { cannam@95: {TW_FULL, 1, 4}, cannam@95: {TW_NEXT, 1, 0} cannam@95: }; cannam@95: cannam@95: static const hc2hc_desc desc = { 4, "hb_4", twinstr, &GENUS, {16, 6, 6, 0} }; cannam@95: cannam@95: void X(codelet_hb_4) (planner *p) { cannam@95: X(khc2hc_register) (p, hb_4, &desc); cannam@95: } cannam@95: #else /* HAVE_FMA */ cannam@95: cannam@95: /* Generated by: ../../../genfft/gen_hc2hc.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 4 -dif -name hb_4 -include hb.h */ cannam@95: cannam@95: /* cannam@95: * This function contains 22 FP additions, 12 FP multiplications, cannam@95: * (or, 16 additions, 6 multiplications, 6 fused multiply/add), cannam@95: * 13 stack variables, 0 constants, and 16 memory accesses cannam@95: */ cannam@95: #include "hb.h" cannam@95: cannam@95: static void hb_4(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms) cannam@95: { cannam@95: { cannam@95: INT m; cannam@95: for (m = mb, W = W + ((mb - 1) * 6); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 6, MAKE_VOLATILE_STRIDE(8, rs)) { cannam@95: E T3, Ti, T6, Tm, Tc, Tn, Tf, Tj; cannam@95: { cannam@95: E T1, T2, T4, T5; cannam@95: T1 = cr[0]; cannam@95: T2 = ci[WS(rs, 1)]; cannam@95: T3 = T1 + T2; cannam@95: Ti = T1 - T2; cannam@95: T4 = cr[WS(rs, 1)]; cannam@95: T5 = ci[0]; cannam@95: T6 = T4 + T5; cannam@95: Tm = T4 - T5; cannam@95: } cannam@95: { cannam@95: E Ta, Tb, Td, Te; cannam@95: Ta = ci[WS(rs, 3)]; cannam@95: Tb = cr[WS(rs, 2)]; cannam@95: Tc = Ta - Tb; cannam@95: Tn = Ta + Tb; cannam@95: Td = ci[WS(rs, 2)]; cannam@95: Te = cr[WS(rs, 3)]; cannam@95: Tf = Td - Te; cannam@95: Tj = Td + Te; cannam@95: } cannam@95: cr[0] = T3 + T6; cannam@95: ci[0] = Tc + Tf; cannam@95: { cannam@95: E T8, Tg, T7, T9; cannam@95: T8 = T3 - T6; cannam@95: Tg = Tc - Tf; cannam@95: T7 = W[2]; cannam@95: T9 = W[3]; cannam@95: cr[WS(rs, 2)] = FNMS(T9, Tg, T7 * T8); cannam@95: ci[WS(rs, 2)] = FMA(T9, T8, T7 * Tg); cannam@95: } cannam@95: { cannam@95: E Tk, To, Th, Tl; cannam@95: Tk = Ti - Tj; cannam@95: To = Tm + Tn; cannam@95: Th = W[0]; cannam@95: Tl = W[1]; cannam@95: cr[WS(rs, 1)] = FNMS(Tl, To, Th * Tk); cannam@95: ci[WS(rs, 1)] = FMA(Th, To, Tl * Tk); cannam@95: } cannam@95: { cannam@95: E Tq, Ts, Tp, Tr; cannam@95: Tq = Ti + Tj; cannam@95: Ts = Tn - Tm; cannam@95: Tp = W[4]; cannam@95: Tr = W[5]; cannam@95: cr[WS(rs, 3)] = FNMS(Tr, Ts, Tp * Tq); cannam@95: ci[WS(rs, 3)] = FMA(Tp, Ts, Tr * Tq); cannam@95: } cannam@95: } cannam@95: } cannam@95: } cannam@95: cannam@95: static const tw_instr twinstr[] = { cannam@95: {TW_FULL, 1, 4}, cannam@95: {TW_NEXT, 1, 0} cannam@95: }; cannam@95: cannam@95: static const hc2hc_desc desc = { 4, "hb_4", twinstr, &GENUS, {16, 6, 6, 0} }; cannam@95: cannam@95: void X(codelet_hb_4) (planner *p) { cannam@95: X(khc2hc_register) (p, hb_4, &desc); cannam@95: } cannam@95: #endif /* HAVE_FMA */