annotate fft/fftw/fftw-3.3.4/dft/scalar/codelets/n1_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:45:48 EST 2014 */
Chris@19 23
Chris@19 24 #include "codelet-dft.h"
Chris@19 25
Chris@19 26 #ifdef HAVE_FMA
Chris@19 27
Chris@19 28 /* Generated by: ../../../genfft/gen_notw.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 2 -name n1_2 -include n.h */
Chris@19 29
Chris@19 30 /*
Chris@19 31 * This function contains 4 FP additions, 0 FP multiplications,
Chris@19 32 * (or, 4 additions, 0 multiplications, 0 fused multiply/add),
Chris@19 33 * 5 stack variables, 0 constants, and 8 memory accesses
Chris@19 34 */
Chris@19 35 #include "n.h"
Chris@19 36
Chris@19 37 static void n1_2(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, 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, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(8, is), MAKE_VOLATILE_STRIDE(8, os)) {
Chris@19 42 E T1, T2, T3, T4;
Chris@19 43 T1 = ri[0];
Chris@19 44 T2 = ri[WS(is, 1)];
Chris@19 45 T3 = ii[0];
Chris@19 46 T4 = ii[WS(is, 1)];
Chris@19 47 ro[0] = T1 + T2;
Chris@19 48 ro[WS(os, 1)] = T1 - T2;
Chris@19 49 io[0] = T3 + T4;
Chris@19 50 io[WS(os, 1)] = T3 - T4;
Chris@19 51 }
Chris@19 52 }
Chris@19 53 }
Chris@19 54
Chris@19 55 static const kdft_desc desc = { 2, "n1_2", {4, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
Chris@19 56
Chris@19 57 void X(codelet_n1_2) (planner *p) {
Chris@19 58 X(kdft_register) (p, n1_2, &desc);
Chris@19 59 }
Chris@19 60
Chris@19 61 #else /* HAVE_FMA */
Chris@19 62
Chris@19 63 /* Generated by: ../../../genfft/gen_notw.native -compact -variables 4 -pipeline-latency 4 -n 2 -name n1_2 -include n.h */
Chris@19 64
Chris@19 65 /*
Chris@19 66 * This function contains 4 FP additions, 0 FP multiplications,
Chris@19 67 * (or, 4 additions, 0 multiplications, 0 fused multiply/add),
Chris@19 68 * 5 stack variables, 0 constants, and 8 memory accesses
Chris@19 69 */
Chris@19 70 #include "n.h"
Chris@19 71
Chris@19 72 static void n1_2(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@19 73 {
Chris@19 74 {
Chris@19 75 INT i;
Chris@19 76 for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(8, is), MAKE_VOLATILE_STRIDE(8, os)) {
Chris@19 77 E T1, T2, T3, T4;
Chris@19 78 T1 = ri[0];
Chris@19 79 T2 = ri[WS(is, 1)];
Chris@19 80 ro[WS(os, 1)] = T1 - T2;
Chris@19 81 ro[0] = T1 + T2;
Chris@19 82 T3 = ii[0];
Chris@19 83 T4 = ii[WS(is, 1)];
Chris@19 84 io[WS(os, 1)] = T3 - T4;
Chris@19 85 io[0] = T3 + T4;
Chris@19 86 }
Chris@19 87 }
Chris@19 88 }
Chris@19 89
Chris@19 90 static const kdft_desc desc = { 2, "n1_2", {4, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
Chris@19 91
Chris@19 92 void X(codelet_n1_2) (planner *p) {
Chris@19 93 X(kdft_register) (p, n1_2, &desc);
Chris@19 94 }
Chris@19 95
Chris@19 96 #endif /* HAVE_FMA */