Chris@42: /*
Chris@42:  * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@42:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@42:  *
Chris@42:  * This program is free software; you can redistribute it and/or modify
Chris@42:  * it under the terms of the GNU General Public License as published by
Chris@42:  * the Free Software Foundation; either version 2 of the License, or
Chris@42:  * (at your option) any later version.
Chris@42:  *
Chris@42:  * This program is distributed in the hope that it will be useful,
Chris@42:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@42:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@42:  * GNU General Public License for more details.
Chris@42:  *
Chris@42:  * You should have received a copy of the GNU General Public License
Chris@42:  * along with this program; if not, write to the Free Software
Chris@42:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@42:  *
Chris@42:  */
Chris@42: 
Chris@42: /* This file was automatically generated --- DO NOT EDIT */
Chris@42: /* Generated on Sat Jul 30 16:51:54 EDT 2016 */
Chris@42: 
Chris@42: #include "codelet-rdft.h"
Chris@42: 
Chris@42: #ifdef HAVE_FMA
Chris@42: 
Chris@42: /* Generated by: ../../../genfft/gen_hc2cdft.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -sign 1 -n 2 -dif -name hc2cbdft_2 -include hc2cb.h */
Chris@42: 
Chris@42: /*
Chris@42:  * This function contains 10 FP additions, 4 FP multiplications,
Chris@42:  * (or, 8 additions, 2 multiplications, 2 fused multiply/add),
Chris@42:  * 11 stack variables, 0 constants, and 8 memory accesses
Chris@42:  */
Chris@42: #include "hc2cb.h"
Chris@42: 
Chris@42: static void hc2cbdft_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@42: {
Chris@42:      {
Chris@42: 	  INT m;
Chris@42: 	  for (m = mb, W = W + ((mb - 1) * 2); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 2, MAKE_VOLATILE_STRIDE(8, rs)) {
Chris@42: 	       E T9, Ta, T3, Tc, T7, T4;
Chris@42: 	       {
Chris@42: 		    E T1, T2, T5, T6;
Chris@42: 		    T1 = Ip[0];
Chris@42: 		    T2 = Im[0];
Chris@42: 		    T5 = Rp[0];
Chris@42: 		    T6 = Rm[0];
Chris@42: 		    T9 = W[1];
Chris@42: 		    Ta = T1 + T2;
Chris@42: 		    T3 = T1 - T2;
Chris@42: 		    Tc = T5 + T6;
Chris@42: 		    T7 = T5 - T6;
Chris@42: 		    T4 = W[0];
Chris@42: 	       }
Chris@42: 	       {
Chris@42: 		    E Td, T8, Te, Tb;
Chris@42: 		    Td = T9 * T7;
Chris@42: 		    T8 = T4 * T7;
Chris@42: 		    Te = FMA(T4, Ta, Td);
Chris@42: 		    Tb = FNMS(T9, Ta, T8);
Chris@42: 		    Rm[0] = Tc + Te;
Chris@42: 		    Rp[0] = Tc - Te;
Chris@42: 		    Im[0] = Tb - T3;
Chris@42: 		    Ip[0] = T3 + Tb;
Chris@42: 	       }
Chris@42: 	  }
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: static const tw_instr twinstr[] = {
Chris@42:      {TW_FULL, 1, 2},
Chris@42:      {TW_NEXT, 1, 0}
Chris@42: };
Chris@42: 
Chris@42: static const hc2c_desc desc = { 2, "hc2cbdft_2", twinstr, &GENUS, {8, 2, 2, 0} };
Chris@42: 
Chris@42: void X(codelet_hc2cbdft_2) (planner *p) {
Chris@42:      X(khc2c_register) (p, hc2cbdft_2, &desc, HC2C_VIA_DFT);
Chris@42: }
Chris@42: #else				/* HAVE_FMA */
Chris@42: 
Chris@42: /* Generated by: ../../../genfft/gen_hc2cdft.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 2 -dif -name hc2cbdft_2 -include hc2cb.h */
Chris@42: 
Chris@42: /*
Chris@42:  * This function contains 10 FP additions, 4 FP multiplications,
Chris@42:  * (or, 8 additions, 2 multiplications, 2 fused multiply/add),
Chris@42:  * 9 stack variables, 0 constants, and 8 memory accesses
Chris@42:  */
Chris@42: #include "hc2cb.h"
Chris@42: 
Chris@42: static void hc2cbdft_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@42: {
Chris@42:      {
Chris@42: 	  INT m;
Chris@42: 	  for (m = mb, W = W + ((mb - 1) * 2); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 2, MAKE_VOLATILE_STRIDE(8, rs)) {
Chris@42: 	       E T3, T9, T7, Tb;
Chris@42: 	       {
Chris@42: 		    E T1, T2, T5, T6;
Chris@42: 		    T1 = Ip[0];
Chris@42: 		    T2 = Im[0];
Chris@42: 		    T3 = T1 - T2;
Chris@42: 		    T9 = T1 + T2;
Chris@42: 		    T5 = Rp[0];
Chris@42: 		    T6 = Rm[0];
Chris@42: 		    T7 = T5 - T6;
Chris@42: 		    Tb = T5 + T6;
Chris@42: 	       }
Chris@42: 	       {
Chris@42: 		    E Ta, Tc, T4, T8;
Chris@42: 		    T4 = W[0];
Chris@42: 		    T8 = W[1];
Chris@42: 		    Ta = FNMS(T8, T9, T4 * T7);
Chris@42: 		    Tc = FMA(T8, T7, T4 * T9);
Chris@42: 		    Ip[0] = T3 + Ta;
Chris@42: 		    Rp[0] = Tb - Tc;
Chris@42: 		    Im[0] = Ta - T3;
Chris@42: 		    Rm[0] = Tb + Tc;
Chris@42: 	       }
Chris@42: 	  }
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: static const tw_instr twinstr[] = {
Chris@42:      {TW_FULL, 1, 2},
Chris@42:      {TW_NEXT, 1, 0}
Chris@42: };
Chris@42: 
Chris@42: static const hc2c_desc desc = { 2, "hc2cbdft_2", twinstr, &GENUS, {8, 2, 2, 0} };
Chris@42: 
Chris@42: void X(codelet_hc2cbdft_2) (planner *p) {
Chris@42:      X(khc2c_register) (p, hc2cbdft_2, &desc, HC2C_VIA_DFT);
Chris@42: }
Chris@42: #endif				/* HAVE_FMA */