Chris@82: /*
Chris@82:  * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@82:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@82:  *
Chris@82:  * This program is free software; you can redistribute it and/or modify
Chris@82:  * it under the terms of the GNU General Public License as published by
Chris@82:  * the Free Software Foundation; either version 2 of the License, or
Chris@82:  * (at your option) any later version.
Chris@82:  *
Chris@82:  * This program is distributed in the hope that it will be useful,
Chris@82:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@82:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@82:  * GNU General Public License for more details.
Chris@82:  *
Chris@82:  * You should have received a copy of the GNU General Public License
Chris@82:  * along with this program; if not, write to the Free Software
Chris@82:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@82:  *
Chris@82:  */
Chris@82: 
Chris@82: /* This file was automatically generated --- DO NOT EDIT */
Chris@82: /* Generated on Thu May 24 08:06:26 EDT 2018 */
Chris@82: 
Chris@82: #include "rdft/codelet-rdft.h"
Chris@82: 
Chris@82: #if defined(ARCH_PREFERS_FMA) || defined(ISA_EXTENSION_PREFERS_FMA)
Chris@82: 
Chris@82: /* Generated by: ../../../genfft/gen_r2cf.native -fma -compact -variables 4 -pipeline-latency 4 -n 2 -name r2cf_2 -include rdft/scalar/r2cf.h */
Chris@82: 
Chris@82: /*
Chris@82:  * This function contains 2 FP additions, 0 FP multiplications,
Chris@82:  * (or, 2 additions, 0 multiplications, 0 fused multiply/add),
Chris@82:  * 3 stack variables, 0 constants, and 4 memory accesses
Chris@82:  */
Chris@82: #include "rdft/scalar/r2cf.h"
Chris@82: 
Chris@82: static void r2cf_2(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
Chris@82: {
Chris@82:      {
Chris@82: 	  INT i;
Chris@82: 	  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)) {
Chris@82: 	       E T1, T2;
Chris@82: 	       T1 = R0[0];
Chris@82: 	       T2 = R1[0];
Chris@82: 	       Cr[WS(csr, 1)] = T1 - T2;
Chris@82: 	       Cr[0] = T1 + T2;
Chris@82: 	  }
Chris@82:      }
Chris@82: }
Chris@82: 
Chris@82: static const kr2c_desc desc = { 2, "r2cf_2", {2, 0, 0, 0}, &GENUS };
Chris@82: 
Chris@82: void X(codelet_r2cf_2) (planner *p) {
Chris@82:      X(kr2c_register) (p, r2cf_2, &desc);
Chris@82: }
Chris@82: 
Chris@82: #else
Chris@82: 
Chris@82: /* Generated by: ../../../genfft/gen_r2cf.native -compact -variables 4 -pipeline-latency 4 -n 2 -name r2cf_2 -include rdft/scalar/r2cf.h */
Chris@82: 
Chris@82: /*
Chris@82:  * This function contains 2 FP additions, 0 FP multiplications,
Chris@82:  * (or, 2 additions, 0 multiplications, 0 fused multiply/add),
Chris@82:  * 3 stack variables, 0 constants, and 4 memory accesses
Chris@82:  */
Chris@82: #include "rdft/scalar/r2cf.h"
Chris@82: 
Chris@82: static void r2cf_2(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
Chris@82: {
Chris@82:      {
Chris@82: 	  INT i;
Chris@82: 	  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)) {
Chris@82: 	       E T1, T2;
Chris@82: 	       T1 = R0[0];
Chris@82: 	       T2 = R1[0];
Chris@82: 	       Cr[WS(csr, 1)] = T1 - T2;
Chris@82: 	       Cr[0] = T1 + T2;
Chris@82: 	  }
Chris@82:      }
Chris@82: }
Chris@82: 
Chris@82: static const kr2c_desc desc = { 2, "r2cf_2", {2, 0, 0, 0}, &GENUS };
Chris@82: 
Chris@82: void X(codelet_r2cf_2) (planner *p) {
Chris@82:      X(kr2c_register) (p, r2cf_2, &desc);
Chris@82: }
Chris@82: 
Chris@82: #endif