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