annotate src/fftw-3.3.8/dft/simd/common/t1fv_3.c @ 168:ceec0dd9ec9c

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