annotate src/fftw-3.3.8/dft/simd/common/t1fuv_4.c @ 82:d0c2a83c1364

Add FFTW 3.3.8 source, and a Linux build
author Chris Cannam
date Tue, 19 Nov 2019 14:52:55 +0000
parents
children
rev   line source
Chris@82 1 /*
Chris@82 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@82 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@82 4 *
Chris@82 5 * This program is free software; you can redistribute it and/or modify
Chris@82 6 * it under the terms of the GNU General Public License as published by
Chris@82 7 * the Free Software Foundation; either version 2 of the License, or
Chris@82 8 * (at your option) any later version.
Chris@82 9 *
Chris@82 10 * This program is distributed in the hope that it will be useful,
Chris@82 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@82 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@82 13 * GNU General Public License for more details.
Chris@82 14 *
Chris@82 15 * You should have received a copy of the GNU General Public License
Chris@82 16 * along with this program; if not, write to the Free Software
Chris@82 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@82 18 *
Chris@82 19 */
Chris@82 20
Chris@82 21 /* This file was automatically generated --- DO NOT EDIT */
Chris@82 22 /* Generated on Thu May 24 08:05:25 EDT 2018 */
Chris@82 23
Chris@82 24 #include "dft/codelet-dft.h"
Chris@82 25
Chris@82 26 #if defined(ARCH_PREFERS_FMA) || defined(ISA_EXTENSION_PREFERS_FMA)
Chris@82 27
Chris@82 28 /* Generated by: ../../../genfft/gen_twiddle_c.native -fma -simd -compact -variables 4 -pipeline-latency 8 -n 4 -name t1fuv_4 -include dft/simd/t1fu.h */
Chris@82 29
Chris@82 30 /*
Chris@82 31 * This function contains 11 FP additions, 8 FP multiplications,
Chris@82 32 * (or, 9 additions, 6 multiplications, 2 fused multiply/add),
Chris@82 33 * 13 stack variables, 0 constants, and 8 memory accesses
Chris@82 34 */
Chris@82 35 #include "dft/simd/t1fu.h"
Chris@82 36
Chris@82 37 static void t1fuv_4(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@82 38 {
Chris@82 39 {
Chris@82 40 INT m;
Chris@82 41 R *x;
Chris@82 42 x = ri;
Chris@82 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@82 44 V T1, T8, T3, T6, T7, T2, T5;
Chris@82 45 T1 = LD(&(x[0]), ms, &(x[0]));
Chris@82 46 T7 = LD(&(x[WS(rs, 3)]), ms, &(x[WS(rs, 1)]));
Chris@82 47 T8 = BYTWJ(&(W[TWVL * 4]), T7);
Chris@82 48 T2 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
Chris@82 49 T3 = BYTWJ(&(W[TWVL * 2]), T2);
Chris@82 50 T5 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
Chris@82 51 T6 = BYTWJ(&(W[0]), T5);
Chris@82 52 {
Chris@82 53 V T4, T9, Ta, Tb;
Chris@82 54 T4 = VSUB(T1, T3);
Chris@82 55 T9 = VSUB(T6, T8);
Chris@82 56 ST(&(x[WS(rs, 1)]), VFNMSI(T9, T4), ms, &(x[WS(rs, 1)]));
Chris@82 57 ST(&(x[WS(rs, 3)]), VFMAI(T9, T4), ms, &(x[WS(rs, 1)]));
Chris@82 58 Ta = VADD(T1, T3);
Chris@82 59 Tb = VADD(T6, T8);
Chris@82 60 ST(&(x[WS(rs, 2)]), VSUB(Ta, Tb), ms, &(x[0]));
Chris@82 61 ST(&(x[0]), VADD(Ta, Tb), ms, &(x[0]));
Chris@82 62 }
Chris@82 63 }
Chris@82 64 }
Chris@82 65 VLEAVE();
Chris@82 66 }
Chris@82 67
Chris@82 68 static const tw_instr twinstr[] = {
Chris@82 69 VTW(0, 1),
Chris@82 70 VTW(0, 2),
Chris@82 71 VTW(0, 3),
Chris@82 72 {TW_NEXT, VL, 0}
Chris@82 73 };
Chris@82 74
Chris@82 75 static const ct_desc desc = { 4, XSIMD_STRING("t1fuv_4"), twinstr, &GENUS, {9, 6, 2, 0}, 0, 0, 0 };
Chris@82 76
Chris@82 77 void XSIMD(codelet_t1fuv_4) (planner *p) {
Chris@82 78 X(kdft_dit_register) (p, t1fuv_4, &desc);
Chris@82 79 }
Chris@82 80 #else
Chris@82 81
Chris@82 82 /* Generated by: ../../../genfft/gen_twiddle_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 4 -name t1fuv_4 -include dft/simd/t1fu.h */
Chris@82 83
Chris@82 84 /*
Chris@82 85 * This function contains 11 FP additions, 6 FP multiplications,
Chris@82 86 * (or, 11 additions, 6 multiplications, 0 fused multiply/add),
Chris@82 87 * 13 stack variables, 0 constants, and 8 memory accesses
Chris@82 88 */
Chris@82 89 #include "dft/simd/t1fu.h"
Chris@82 90
Chris@82 91 static void t1fuv_4(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@82 92 {
Chris@82 93 {
Chris@82 94 INT m;
Chris@82 95 R *x;
Chris@82 96 x = ri;
Chris@82 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@82 98 V T1, T8, T3, T6, T7, T2, T5;
Chris@82 99 T1 = LD(&(x[0]), ms, &(x[0]));
Chris@82 100 T7 = LD(&(x[WS(rs, 3)]), ms, &(x[WS(rs, 1)]));
Chris@82 101 T8 = BYTWJ(&(W[TWVL * 4]), T7);
Chris@82 102 T2 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
Chris@82 103 T3 = BYTWJ(&(W[TWVL * 2]), T2);
Chris@82 104 T5 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
Chris@82 105 T6 = BYTWJ(&(W[0]), T5);
Chris@82 106 {
Chris@82 107 V T4, T9, Ta, Tb;
Chris@82 108 T4 = VSUB(T1, T3);
Chris@82 109 T9 = VBYI(VSUB(T6, T8));
Chris@82 110 ST(&(x[WS(rs, 1)]), VSUB(T4, T9), ms, &(x[WS(rs, 1)]));
Chris@82 111 ST(&(x[WS(rs, 3)]), VADD(T4, T9), ms, &(x[WS(rs, 1)]));
Chris@82 112 Ta = VADD(T1, T3);
Chris@82 113 Tb = VADD(T6, T8);
Chris@82 114 ST(&(x[WS(rs, 2)]), VSUB(Ta, Tb), ms, &(x[0]));
Chris@82 115 ST(&(x[0]), VADD(Ta, Tb), ms, &(x[0]));
Chris@82 116 }
Chris@82 117 }
Chris@82 118 }
Chris@82 119 VLEAVE();
Chris@82 120 }
Chris@82 121
Chris@82 122 static const tw_instr twinstr[] = {
Chris@82 123 VTW(0, 1),
Chris@82 124 VTW(0, 2),
Chris@82 125 VTW(0, 3),
Chris@82 126 {TW_NEXT, VL, 0}
Chris@82 127 };
Chris@82 128
Chris@82 129 static const ct_desc desc = { 4, XSIMD_STRING("t1fuv_4"), twinstr, &GENUS, {11, 6, 0, 0}, 0, 0, 0 };
Chris@82 130
Chris@82 131 void XSIMD(codelet_t1fuv_4) (planner *p) {
Chris@82 132 X(kdft_dit_register) (p, t1fuv_4, &desc);
Chris@82 133 }
Chris@82 134 #endif