annotate fft/fftw/fftw-3.3.4/dft/simd/common/t1buv_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:47:30 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_twiddle_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 3 -name t1buv_3 -include t1bu.h -sign 1 */
Chris@19 29
Chris@19 30 /*
Chris@19 31 * This function contains 8 FP additions, 8 FP multiplications,
Chris@19 32 * (or, 5 additions, 5 multiplications, 3 fused multiply/add),
Chris@19 33 * 12 stack variables, 2 constants, and 6 memory accesses
Chris@19 34 */
Chris@19 35 #include "t1bu.h"
Chris@19 36
Chris@19 37 static void t1buv_3(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@19 38 {
Chris@19 39 DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@19 40 DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@19 41 {
Chris@19 42 INT m;
Chris@19 43 R *x;
Chris@19 44 x = ii;
Chris@19 45 for (m = mb, W = W + (mb * ((TWVL / VL) * 4)); m < me; m = m + VL, x = x + (VL * ms), W = W + (TWVL * 4), MAKE_VOLATILE_STRIDE(3, rs)) {
Chris@19 46 V T1, T2, T4;
Chris@19 47 T1 = LD(&(x[0]), ms, &(x[0]));
Chris@19 48 T2 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
Chris@19 49 T4 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
Chris@19 50 {
Chris@19 51 V T3, T5, T8, T6, T7;
Chris@19 52 T3 = BYTW(&(W[0]), T2);
Chris@19 53 T5 = BYTW(&(W[TWVL * 2]), T4);
Chris@19 54 T8 = VMUL(LDK(KP866025403), VSUB(T3, T5));
Chris@19 55 T6 = VADD(T3, T5);
Chris@19 56 T7 = VFNMS(LDK(KP500000000), T6, T1);
Chris@19 57 ST(&(x[0]), VADD(T1, T6), ms, &(x[0]));
Chris@19 58 ST(&(x[WS(rs, 2)]), VFNMSI(T8, T7), ms, &(x[0]));
Chris@19 59 ST(&(x[WS(rs, 1)]), VFMAI(T8, T7), ms, &(x[WS(rs, 1)]));
Chris@19 60 }
Chris@19 61 }
Chris@19 62 }
Chris@19 63 VLEAVE();
Chris@19 64 }
Chris@19 65
Chris@19 66 static const tw_instr twinstr[] = {
Chris@19 67 VTW(0, 1),
Chris@19 68 VTW(0, 2),
Chris@19 69 {TW_NEXT, VL, 0}
Chris@19 70 };
Chris@19 71
Chris@19 72 static const ct_desc desc = { 3, XSIMD_STRING("t1buv_3"), twinstr, &GENUS, {5, 5, 3, 0}, 0, 0, 0 };
Chris@19 73
Chris@19 74 void XSIMD(codelet_t1buv_3) (planner *p) {
Chris@19 75 X(kdft_dit_register) (p, t1buv_3, &desc);
Chris@19 76 }
Chris@19 77 #else /* HAVE_FMA */
Chris@19 78
Chris@19 79 /* Generated by: ../../../genfft/gen_twiddle_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 3 -name t1buv_3 -include t1bu.h -sign 1 */
Chris@19 80
Chris@19 81 /*
Chris@19 82 * This function contains 8 FP additions, 6 FP multiplications,
Chris@19 83 * (or, 7 additions, 5 multiplications, 1 fused multiply/add),
Chris@19 84 * 12 stack variables, 2 constants, and 6 memory accesses
Chris@19 85 */
Chris@19 86 #include "t1bu.h"
Chris@19 87
Chris@19 88 static void t1buv_3(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@19 89 {
Chris@19 90 DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@19 91 DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@19 92 {
Chris@19 93 INT m;
Chris@19 94 R *x;
Chris@19 95 x = ii;
Chris@19 96 for (m = mb, W = W + (mb * ((TWVL / VL) * 4)); m < me; m = m + VL, x = x + (VL * ms), W = W + (TWVL * 4), MAKE_VOLATILE_STRIDE(3, rs)) {
Chris@19 97 V T6, T2, T4, T7, T1, T3, T5, T8;
Chris@19 98 T6 = LD(&(x[0]), ms, &(x[0]));
Chris@19 99 T1 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
Chris@19 100 T2 = BYTW(&(W[0]), T1);
Chris@19 101 T3 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
Chris@19 102 T4 = BYTW(&(W[TWVL * 2]), T3);
Chris@19 103 T7 = VADD(T2, T4);
Chris@19 104 ST(&(x[0]), VADD(T6, T7), ms, &(x[0]));
Chris@19 105 T5 = VBYI(VMUL(LDK(KP866025403), VSUB(T2, T4)));
Chris@19 106 T8 = VFNMS(LDK(KP500000000), T7, T6);
Chris@19 107 ST(&(x[WS(rs, 1)]), VADD(T5, T8), ms, &(x[WS(rs, 1)]));
Chris@19 108 ST(&(x[WS(rs, 2)]), VSUB(T8, T5), ms, &(x[0]));
Chris@19 109 }
Chris@19 110 }
Chris@19 111 VLEAVE();
Chris@19 112 }
Chris@19 113
Chris@19 114 static const tw_instr twinstr[] = {
Chris@19 115 VTW(0, 1),
Chris@19 116 VTW(0, 2),
Chris@19 117 {TW_NEXT, VL, 0}
Chris@19 118 };
Chris@19 119
Chris@19 120 static const ct_desc desc = { 3, XSIMD_STRING("t1buv_3"), twinstr, &GENUS, {7, 5, 1, 0}, 0, 0, 0 };
Chris@19 121
Chris@19 122 void XSIMD(codelet_t1buv_3) (planner *p) {
Chris@19 123 X(kdft_dit_register) (p, t1buv_3, &desc);
Chris@19 124 }
Chris@19 125 #endif /* HAVE_FMA */