annotate fft/fftw/fftw-3.3.4/rdft/scalar/r2cb/r2cb_2.c @ 40:223f770b5341 kissfft-double tip

Try a double-precision kissfft
author Chris Cannam
date Wed, 07 Sep 2016 10:40:32 +0100
parents 26056e866c29
children
rev   line source
Chris@19 1 /*
Chris@19 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@19 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@19 4 *
Chris@19 5 * This program is free software; you can redistribute it and/or modify
Chris@19 6 * it under the terms of the GNU General Public License as published by
Chris@19 7 * the Free Software Foundation; either version 2 of the License, or
Chris@19 8 * (at your option) any later version.
Chris@19 9 *
Chris@19 10 * This program is distributed in the hope that it will be useful,
Chris@19 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@19 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@19 13 * GNU General Public License for more details.
Chris@19 14 *
Chris@19 15 * You should have received a copy of the GNU General Public License
Chris@19 16 * along with this program; if not, write to the Free Software
Chris@19 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@19 18 *
Chris@19 19 */
Chris@19 20
Chris@19 21 /* This file was automatically generated --- DO NOT EDIT */
Chris@19 22 /* Generated on Tue Mar 4 13:50:24 EST 2014 */
Chris@19 23
Chris@19 24 #include "codelet-rdft.h"
Chris@19 25
Chris@19 26 #ifdef HAVE_FMA
Chris@19 27
Chris@19 28 /* Generated by: ../../../genfft/gen_r2cb.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -sign 1 -n 2 -name r2cb_2 -include r2cb.h */
Chris@19 29
Chris@19 30 /*
Chris@19 31 * This function contains 2 FP additions, 0 FP multiplications,
Chris@19 32 * (or, 2 additions, 0 multiplications, 0 fused multiply/add),
Chris@19 33 * 3 stack variables, 0 constants, and 4 memory accesses
Chris@19 34 */
Chris@19 35 #include "r2cb.h"
Chris@19 36
Chris@19 37 static void r2cb_2(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
Chris@19 38 {
Chris@19 39 {
Chris@19 40 INT i;
Chris@19 41 for (i = v; i > 0; i = i - 1, R0 = R0 + ovs, R1 = R1 + ovs, Cr = Cr + ivs, Ci = Ci + ivs, MAKE_VOLATILE_STRIDE(8, rs), MAKE_VOLATILE_STRIDE(8, csr), MAKE_VOLATILE_STRIDE(8, csi)) {
Chris@19 42 E T1, T2;
Chris@19 43 T1 = Cr[0];
Chris@19 44 T2 = Cr[WS(csr, 1)];
Chris@19 45 R0[0] = T1 + T2;
Chris@19 46 R1[0] = T1 - T2;
Chris@19 47 }
Chris@19 48 }
Chris@19 49 }
Chris@19 50
Chris@19 51 static const kr2c_desc desc = { 2, "r2cb_2", {2, 0, 0, 0}, &GENUS };
Chris@19 52
Chris@19 53 void X(codelet_r2cb_2) (planner *p) {
Chris@19 54 X(kr2c_register) (p, r2cb_2, &desc);
Chris@19 55 }
Chris@19 56
Chris@19 57 #else /* HAVE_FMA */
Chris@19 58
Chris@19 59 /* Generated by: ../../../genfft/gen_r2cb.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 2 -name r2cb_2 -include r2cb.h */
Chris@19 60
Chris@19 61 /*
Chris@19 62 * This function contains 2 FP additions, 0 FP multiplications,
Chris@19 63 * (or, 2 additions, 0 multiplications, 0 fused multiply/add),
Chris@19 64 * 3 stack variables, 0 constants, and 4 memory accesses
Chris@19 65 */
Chris@19 66 #include "r2cb.h"
Chris@19 67
Chris@19 68 static void r2cb_2(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
Chris@19 69 {
Chris@19 70 {
Chris@19 71 INT i;
Chris@19 72 for (i = v; i > 0; i = i - 1, R0 = R0 + ovs, R1 = R1 + ovs, Cr = Cr + ivs, Ci = Ci + ivs, MAKE_VOLATILE_STRIDE(8, rs), MAKE_VOLATILE_STRIDE(8, csr), MAKE_VOLATILE_STRIDE(8, csi)) {
Chris@19 73 E T1, T2;
Chris@19 74 T1 = Cr[0];
Chris@19 75 T2 = Cr[WS(csr, 1)];
Chris@19 76 R1[0] = T1 - T2;
Chris@19 77 R0[0] = T1 + T2;
Chris@19 78 }
Chris@19 79 }
Chris@19 80 }
Chris@19 81
Chris@19 82 static const kr2c_desc desc = { 2, "r2cb_2", {2, 0, 0, 0}, &GENUS };
Chris@19 83
Chris@19 84 void X(codelet_r2cb_2) (planner *p) {
Chris@19 85 X(kr2c_register) (p, r2cb_2, &desc);
Chris@19 86 }
Chris@19 87
Chris@19 88 #endif /* HAVE_FMA */