annotate fft/fftw/fftw-3.3.4/dft/simd/common/n1bv_3.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:46:50 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_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -sign 1 -n 3 -name n1bv_3 -include n1b.h */
Chris@19 29
Chris@19 30 /*
Chris@19 31 * This function contains 6 FP additions, 4 FP multiplications,
Chris@19 32 * (or, 3 additions, 1 multiplications, 3 fused multiply/add),
Chris@19 33 * 11 stack variables, 2 constants, and 6 memory accesses
Chris@19 34 */
Chris@19 35 #include "n1b.h"
Chris@19 36
Chris@19 37 static void n1bv_3(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 DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@19 40 DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@19 41 {
Chris@19 42 INT i;
Chris@19 43 const R *xi;
Chris@19 44 R *xo;
Chris@19 45 xi = ii;
Chris@19 46 xo = io;
Chris@19 47 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(6, is), MAKE_VOLATILE_STRIDE(6, os)) {
Chris@19 48 V T1, T2, T3, T6, T4, T5;
Chris@19 49 T1 = LD(&(xi[0]), ivs, &(xi[0]));
Chris@19 50 T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@19 51 T3 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@19 52 T6 = VMUL(LDK(KP866025403), VSUB(T2, T3));
Chris@19 53 T4 = VADD(T2, T3);
Chris@19 54 T5 = VFNMS(LDK(KP500000000), T4, T1);
Chris@19 55 ST(&(xo[0]), VADD(T1, T4), ovs, &(xo[0]));
Chris@19 56 ST(&(xo[WS(os, 2)]), VFNMSI(T6, T5), ovs, &(xo[0]));
Chris@19 57 ST(&(xo[WS(os, 1)]), VFMAI(T6, T5), ovs, &(xo[WS(os, 1)]));
Chris@19 58 }
Chris@19 59 }
Chris@19 60 VLEAVE();
Chris@19 61 }
Chris@19 62
Chris@19 63 static const kdft_desc desc = { 3, XSIMD_STRING("n1bv_3"), {3, 1, 3, 0}, &GENUS, 0, 0, 0, 0 };
Chris@19 64
Chris@19 65 void XSIMD(codelet_n1bv_3) (planner *p) {
Chris@19 66 X(kdft_register) (p, n1bv_3, &desc);
Chris@19 67 }
Chris@19 68
Chris@19 69 #else /* HAVE_FMA */
Chris@19 70
Chris@19 71 /* Generated by: ../../../genfft/gen_notw_c.native -simd -compact -variables 4 -pipeline-latency 8 -sign 1 -n 3 -name n1bv_3 -include n1b.h */
Chris@19 72
Chris@19 73 /*
Chris@19 74 * This function contains 6 FP additions, 2 FP multiplications,
Chris@19 75 * (or, 5 additions, 1 multiplications, 1 fused multiply/add),
Chris@19 76 * 11 stack variables, 2 constants, and 6 memory accesses
Chris@19 77 */
Chris@19 78 #include "n1b.h"
Chris@19 79
Chris@19 80 static void n1bv_3(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@19 81 {
Chris@19 82 DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@19 83 DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@19 84 {
Chris@19 85 INT i;
Chris@19 86 const R *xi;
Chris@19 87 R *xo;
Chris@19 88 xi = ii;
Chris@19 89 xo = io;
Chris@19 90 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(6, is), MAKE_VOLATILE_STRIDE(6, os)) {
Chris@19 91 V T4, T3, T5, T1, T2, T6;
Chris@19 92 T4 = LD(&(xi[0]), ivs, &(xi[0]));
Chris@19 93 T1 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@19 94 T2 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@19 95 T3 = VBYI(VMUL(LDK(KP866025403), VSUB(T1, T2)));
Chris@19 96 T5 = VADD(T1, T2);
Chris@19 97 ST(&(xo[0]), VADD(T4, T5), ovs, &(xo[0]));
Chris@19 98 T6 = VFNMS(LDK(KP500000000), T5, T4);
Chris@19 99 ST(&(xo[WS(os, 1)]), VADD(T3, T6), ovs, &(xo[WS(os, 1)]));
Chris@19 100 ST(&(xo[WS(os, 2)]), VSUB(T6, T3), ovs, &(xo[0]));
Chris@19 101 }
Chris@19 102 }
Chris@19 103 VLEAVE();
Chris@19 104 }
Chris@19 105
Chris@19 106 static const kdft_desc desc = { 3, XSIMD_STRING("n1bv_3"), {5, 1, 1, 0}, &GENUS, 0, 0, 0, 0 };
Chris@19 107
Chris@19 108 void XSIMD(codelet_n1bv_3) (planner *p) {
Chris@19 109 X(kdft_register) (p, n1bv_3, &desc);
Chris@19 110 }
Chris@19 111
Chris@19 112 #endif /* HAVE_FMA */