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