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:46:03 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_r2cf.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 2 -name r2cf_2 -include r2cf.h */
cannam@127: 
cannam@127: /*
cannam@127:  * This function contains 2 FP additions, 0 FP multiplications,
cannam@127:  * (or, 2 additions, 0 multiplications, 0 fused multiply/add),
cannam@127:  * 3 stack variables, 0 constants, and 4 memory accesses
cannam@127:  */
cannam@127: #include "r2cf.h"
cannam@127: 
cannam@127: static void r2cf_2(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
cannam@127: {
cannam@127:      {
cannam@127: 	  INT i;
cannam@127: 	  for (i = v; i > 0; i = i - 1, R0 = R0 + ivs, R1 = R1 + ivs, Cr = Cr + ovs, Ci = Ci + ovs, MAKE_VOLATILE_STRIDE(8, rs), MAKE_VOLATILE_STRIDE(8, csr), MAKE_VOLATILE_STRIDE(8, csi)) {
cannam@127: 	       E T1, T2;
cannam@127: 	       T1 = R0[0];
cannam@127: 	       T2 = R1[0];
cannam@127: 	       Cr[0] = T1 + T2;
cannam@127: 	       Cr[WS(csr, 1)] = T1 - T2;
cannam@127: 	  }
cannam@127:      }
cannam@127: }
cannam@127: 
cannam@127: static const kr2c_desc desc = { 2, "r2cf_2", {2, 0, 0, 0}, &GENUS };
cannam@127: 
cannam@127: void X(codelet_r2cf_2) (planner *p) {
cannam@127:      X(kr2c_register) (p, r2cf_2, &desc);
cannam@127: }
cannam@127: 
cannam@127: #else				/* HAVE_FMA */
cannam@127: 
cannam@127: /* Generated by: ../../../genfft/gen_r2cf.native -compact -variables 4 -pipeline-latency 4 -n 2 -name r2cf_2 -include r2cf.h */
cannam@127: 
cannam@127: /*
cannam@127:  * This function contains 2 FP additions, 0 FP multiplications,
cannam@127:  * (or, 2 additions, 0 multiplications, 0 fused multiply/add),
cannam@127:  * 3 stack variables, 0 constants, and 4 memory accesses
cannam@127:  */
cannam@127: #include "r2cf.h"
cannam@127: 
cannam@127: static void r2cf_2(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
cannam@127: {
cannam@127:      {
cannam@127: 	  INT i;
cannam@127: 	  for (i = v; i > 0; i = i - 1, R0 = R0 + ivs, R1 = R1 + ivs, Cr = Cr + ovs, Ci = Ci + ovs, MAKE_VOLATILE_STRIDE(8, rs), MAKE_VOLATILE_STRIDE(8, csr), MAKE_VOLATILE_STRIDE(8, csi)) {
cannam@127: 	       E T1, T2;
cannam@127: 	       T1 = R0[0];
cannam@127: 	       T2 = R1[0];
cannam@127: 	       Cr[WS(csr, 1)] = T1 - T2;
cannam@127: 	       Cr[0] = T1 + T2;
cannam@127: 	  }
cannam@127:      }
cannam@127: }
cannam@127: 
cannam@127: static const kr2c_desc desc = { 2, "r2cf_2", {2, 0, 0, 0}, &GENUS };
cannam@127: 
cannam@127: void X(codelet_r2cf_2) (planner *p) {
cannam@127:      X(kr2c_register) (p, r2cf_2, &desc);
cannam@127: }
cannam@127: 
cannam@127: #endif				/* HAVE_FMA */