annotate fft/fftw/fftw-3.3.4/dft/simd/common/n2fv_4.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:54 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 -n 4 -name n2fv_4 -with-ostride 2 -include n2f.h -store-multiple 2 */
Chris@19 29
Chris@19 30 /*
Chris@19 31 * This function contains 8 FP additions, 2 FP multiplications,
Chris@19 32 * (or, 6 additions, 0 multiplications, 2 fused multiply/add),
Chris@19 33 * 15 stack variables, 0 constants, and 10 memory accesses
Chris@19 34 */
Chris@19 35 #include "n2f.h"
Chris@19 36
Chris@19 37 static void n2fv_4(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 const R *xi;
Chris@19 42 R *xo;
Chris@19 43 xi = ri;
Chris@19 44 xo = ro;
Chris@19 45 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(8, is), MAKE_VOLATILE_STRIDE(8, os)) {
Chris@19 46 V T1, T2, T4, T5;
Chris@19 47 T1 = LD(&(xi[0]), ivs, &(xi[0]));
Chris@19 48 T2 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@19 49 T4 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@19 50 T5 = LD(&(xi[WS(is, 3)]), ivs, &(xi[WS(is, 1)]));
Chris@19 51 {
Chris@19 52 V T3, T7, T6, T8;
Chris@19 53 T3 = VSUB(T1, T2);
Chris@19 54 T7 = VADD(T1, T2);
Chris@19 55 T6 = VSUB(T4, T5);
Chris@19 56 T8 = VADD(T4, T5);
Chris@19 57 {
Chris@19 58 V T9, Ta, Tb, Tc;
Chris@19 59 T9 = VSUB(T7, T8);
Chris@19 60 STM2(&(xo[4]), T9, ovs, &(xo[0]));
Chris@19 61 Ta = VADD(T7, T8);
Chris@19 62 STM2(&(xo[0]), Ta, ovs, &(xo[0]));
Chris@19 63 Tb = VFMAI(T6, T3);
Chris@19 64 STM2(&(xo[6]), Tb, ovs, &(xo[2]));
Chris@19 65 STN2(&(xo[4]), T9, Tb, ovs);
Chris@19 66 Tc = VFNMSI(T6, T3);
Chris@19 67 STM2(&(xo[2]), Tc, ovs, &(xo[2]));
Chris@19 68 STN2(&(xo[0]), Ta, Tc, ovs);
Chris@19 69 }
Chris@19 70 }
Chris@19 71 }
Chris@19 72 }
Chris@19 73 VLEAVE();
Chris@19 74 }
Chris@19 75
Chris@19 76 static const kdft_desc desc = { 4, XSIMD_STRING("n2fv_4"), {6, 0, 2, 0}, &GENUS, 0, 2, 0, 0 };
Chris@19 77
Chris@19 78 void XSIMD(codelet_n2fv_4) (planner *p) {
Chris@19 79 X(kdft_register) (p, n2fv_4, &desc);
Chris@19 80 }
Chris@19 81
Chris@19 82 #else /* HAVE_FMA */
Chris@19 83
Chris@19 84 /* Generated by: ../../../genfft/gen_notw_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 4 -name n2fv_4 -with-ostride 2 -include n2f.h -store-multiple 2 */
Chris@19 85
Chris@19 86 /*
Chris@19 87 * This function contains 8 FP additions, 0 FP multiplications,
Chris@19 88 * (or, 8 additions, 0 multiplications, 0 fused multiply/add),
Chris@19 89 * 11 stack variables, 0 constants, and 10 memory accesses
Chris@19 90 */
Chris@19 91 #include "n2f.h"
Chris@19 92
Chris@19 93 static void n2fv_4(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@19 94 {
Chris@19 95 {
Chris@19 96 INT i;
Chris@19 97 const R *xi;
Chris@19 98 R *xo;
Chris@19 99 xi = ri;
Chris@19 100 xo = ro;
Chris@19 101 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(8, is), MAKE_VOLATILE_STRIDE(8, os)) {
Chris@19 102 V T3, T7, T6, T8;
Chris@19 103 {
Chris@19 104 V T1, T2, T4, T5;
Chris@19 105 T1 = LD(&(xi[0]), ivs, &(xi[0]));
Chris@19 106 T2 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@19 107 T3 = VSUB(T1, T2);
Chris@19 108 T7 = VADD(T1, T2);
Chris@19 109 T4 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@19 110 T5 = LD(&(xi[WS(is, 3)]), ivs, &(xi[WS(is, 1)]));
Chris@19 111 T6 = VBYI(VSUB(T4, T5));
Chris@19 112 T8 = VADD(T4, T5);
Chris@19 113 }
Chris@19 114 {
Chris@19 115 V T9, Ta, Tb, Tc;
Chris@19 116 T9 = VSUB(T3, T6);
Chris@19 117 STM2(&(xo[2]), T9, ovs, &(xo[2]));
Chris@19 118 Ta = VADD(T7, T8);
Chris@19 119 STM2(&(xo[0]), Ta, ovs, &(xo[0]));
Chris@19 120 STN2(&(xo[0]), Ta, T9, ovs);
Chris@19 121 Tb = VADD(T3, T6);
Chris@19 122 STM2(&(xo[6]), Tb, ovs, &(xo[2]));
Chris@19 123 Tc = VSUB(T7, T8);
Chris@19 124 STM2(&(xo[4]), Tc, ovs, &(xo[0]));
Chris@19 125 STN2(&(xo[4]), Tc, Tb, ovs);
Chris@19 126 }
Chris@19 127 }
Chris@19 128 }
Chris@19 129 VLEAVE();
Chris@19 130 }
Chris@19 131
Chris@19 132 static const kdft_desc desc = { 4, XSIMD_STRING("n2fv_4"), {8, 0, 0, 0}, &GENUS, 0, 2, 0, 0 };
Chris@19 133
Chris@19 134 void XSIMD(codelet_n2fv_4) (planner *p) {
Chris@19 135 X(kdft_register) (p, n2fv_4, &desc);
Chris@19 136 }
Chris@19 137
Chris@19 138 #endif /* HAVE_FMA */