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