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