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