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 6 -name r2cf_6 -include r2cf.h */
Chris@19: 
Chris@19: /*
Chris@19:  * This function contains 14 FP additions, 4 FP multiplications,
Chris@19:  * (or, 12 additions, 2 multiplications, 2 fused multiply/add),
Chris@19:  * 13 stack variables, 2 constants, and 12 memory accesses
Chris@19:  */
Chris@19: #include "r2cf.h"
Chris@19: 
Chris@19: static void r2cf_6(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(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@19:      DK(KP866025403, +0.866025403784438646763723170752936183471402627);
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(24, rs), MAKE_VOLATILE_STRIDE(24, csr), MAKE_VOLATILE_STRIDE(24, csi)) {
Chris@19: 	       E T4, Td, T3, Tc, T9, T5;
Chris@19: 	       {
Chris@19: 		    E T1, T2, T7, T8;
Chris@19: 		    T1 = R0[0];
Chris@19: 		    T2 = R1[WS(rs, 1)];
Chris@19: 		    T7 = R0[WS(rs, 2)];
Chris@19: 		    T8 = R1[0];
Chris@19: 		    T4 = R0[WS(rs, 1)];
Chris@19: 		    Td = T1 + T2;
Chris@19: 		    T3 = T1 - T2;
Chris@19: 		    Tc = T7 + T8;
Chris@19: 		    T9 = T7 - T8;
Chris@19: 		    T5 = R1[WS(rs, 2)];
Chris@19: 	       }
Chris@19: 	       {
Chris@19: 		    E T6, Tb, Te, Ta;
Chris@19: 		    T6 = T4 - T5;
Chris@19: 		    Tb = T4 + T5;
Chris@19: 		    Te = Tb + Tc;
Chris@19: 		    Ci[WS(csi, 2)] = KP866025403 * (Tb - Tc);
Chris@19: 		    Ta = T6 + T9;
Chris@19: 		    Ci[WS(csi, 1)] = KP866025403 * (T9 - T6);
Chris@19: 		    Cr[0] = Td + Te;
Chris@19: 		    Cr[WS(csr, 2)] = FNMS(KP500000000, Te, Td);
Chris@19: 		    Cr[WS(csr, 3)] = T3 + Ta;
Chris@19: 		    Cr[WS(csr, 1)] = FNMS(KP500000000, Ta, T3);
Chris@19: 	       }
Chris@19: 	  }
Chris@19:      }
Chris@19: }
Chris@19: 
Chris@19: static const kr2c_desc desc = { 6, "r2cf_6", {12, 2, 2, 0}, &GENUS };
Chris@19: 
Chris@19: void X(codelet_r2cf_6) (planner *p) {
Chris@19:      X(kr2c_register) (p, r2cf_6, &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 6 -name r2cf_6 -include r2cf.h */
Chris@19: 
Chris@19: /*
Chris@19:  * This function contains 14 FP additions, 4 FP multiplications,
Chris@19:  * (or, 12 additions, 2 multiplications, 2 fused multiply/add),
Chris@19:  * 17 stack variables, 2 constants, and 12 memory accesses
Chris@19:  */
Chris@19: #include "r2cf.h"
Chris@19: 
Chris@19: static void r2cf_6(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(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@19:      DK(KP866025403, +0.866025403784438646763723170752936183471402627);
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(24, rs), MAKE_VOLATILE_STRIDE(24, csr), MAKE_VOLATILE_STRIDE(24, csi)) {
Chris@19: 	       E T3, Td, T9, Tc, T6, Tb, T1, T2, Ta, Te;
Chris@19: 	       T1 = R0[0];
Chris@19: 	       T2 = R1[WS(rs, 1)];
Chris@19: 	       T3 = T1 - T2;
Chris@19: 	       Td = T1 + T2;
Chris@19: 	       {
Chris@19: 		    E T7, T8, T4, T5;
Chris@19: 		    T7 = R0[WS(rs, 2)];
Chris@19: 		    T8 = R1[0];
Chris@19: 		    T9 = T7 - T8;
Chris@19: 		    Tc = T7 + T8;
Chris@19: 		    T4 = R0[WS(rs, 1)];
Chris@19: 		    T5 = R1[WS(rs, 2)];
Chris@19: 		    T6 = T4 - T5;
Chris@19: 		    Tb = T4 + T5;
Chris@19: 	       }
Chris@19: 	       Ci[WS(csi, 1)] = KP866025403 * (T9 - T6);
Chris@19: 	       Ta = T6 + T9;
Chris@19: 	       Cr[WS(csr, 1)] = FNMS(KP500000000, Ta, T3);
Chris@19: 	       Cr[WS(csr, 3)] = T3 + Ta;
Chris@19: 	       Ci[WS(csi, 2)] = KP866025403 * (Tb - Tc);
Chris@19: 	       Te = Tb + Tc;
Chris@19: 	       Cr[WS(csr, 2)] = FNMS(KP500000000, Te, Td);
Chris@19: 	       Cr[0] = Td + Te;
Chris@19: 	  }
Chris@19:      }
Chris@19: }
Chris@19: 
Chris@19: static const kr2c_desc desc = { 6, "r2cf_6", {12, 2, 2, 0}, &GENUS };
Chris@19: 
Chris@19: void X(codelet_r2cf_6) (planner *p) {
Chris@19:      X(kr2c_register) (p, r2cf_6, &desc);
Chris@19: }
Chris@19: 
Chris@19: #endif				/* HAVE_FMA */