annotate src/fftw-3.3.8/dft/simd/common/q1fv_2.c @ 167:bd3cc4d1df30

Add FFTW 3.3.8 source, and a Linux build
author Chris Cannam <cannam@all-day-breakfast.com>
date Tue, 19 Nov 2019 14:52:55 +0000
parents
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:06:13 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_twidsq_c.native -fma -simd -compact -variables 4 -pipeline-latency 8 -n 2 -dif -name q1fv_2 -include dft/simd/q1f.h */
cannam@167 29
cannam@167 30 /*
cannam@167 31 * This function contains 6 FP additions, 4 FP multiplications,
cannam@167 32 * (or, 6 additions, 4 multiplications, 0 fused multiply/add),
cannam@167 33 * 8 stack variables, 0 constants, and 8 memory accesses
cannam@167 34 */
cannam@167 35 #include "dft/simd/q1f.h"
cannam@167 36
cannam@167 37 static void q1fv_2(R *ri, R *ii, const R *W, stride rs, stride vs, INT mb, INT me, INT ms)
cannam@167 38 {
cannam@167 39 {
cannam@167 40 INT m;
cannam@167 41 R *x;
cannam@167 42 x = ri;
cannam@167 43 for (m = mb, W = W + (mb * ((TWVL / VL) * 2)); m < me; m = m + VL, x = x + (VL * ms), W = W + (TWVL * 2), MAKE_VOLATILE_STRIDE(4, rs), MAKE_VOLATILE_STRIDE(4, vs)) {
cannam@167 44 V T1, T2, T3, T4, T5, T6;
cannam@167 45 T1 = LD(&(x[0]), ms, &(x[0]));
cannam@167 46 T2 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
cannam@167 47 T3 = BYTWJ(&(W[0]), VSUB(T1, T2));
cannam@167 48 T4 = LD(&(x[WS(vs, 1)]), ms, &(x[WS(vs, 1)]));
cannam@167 49 T5 = LD(&(x[WS(vs, 1) + WS(rs, 1)]), ms, &(x[WS(vs, 1) + WS(rs, 1)]));
cannam@167 50 T6 = BYTWJ(&(W[0]), VSUB(T4, T5));
cannam@167 51 ST(&(x[WS(vs, 1)]), T3, ms, &(x[WS(vs, 1)]));
cannam@167 52 ST(&(x[WS(vs, 1) + WS(rs, 1)]), T6, ms, &(x[WS(vs, 1) + WS(rs, 1)]));
cannam@167 53 ST(&(x[0]), VADD(T1, T2), ms, &(x[0]));
cannam@167 54 ST(&(x[WS(rs, 1)]), VADD(T4, T5), ms, &(x[WS(rs, 1)]));
cannam@167 55 }
cannam@167 56 }
cannam@167 57 VLEAVE();
cannam@167 58 }
cannam@167 59
cannam@167 60 static const tw_instr twinstr[] = {
cannam@167 61 VTW(0, 1),
cannam@167 62 {TW_NEXT, VL, 0}
cannam@167 63 };
cannam@167 64
cannam@167 65 static const ct_desc desc = { 2, XSIMD_STRING("q1fv_2"), twinstr, &GENUS, {6, 4, 0, 0}, 0, 0, 0 };
cannam@167 66
cannam@167 67 void XSIMD(codelet_q1fv_2) (planner *p) {
cannam@167 68 X(kdft_difsq_register) (p, q1fv_2, &desc);
cannam@167 69 }
cannam@167 70 #else
cannam@167 71
cannam@167 72 /* Generated by: ../../../genfft/gen_twidsq_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 2 -dif -name q1fv_2 -include dft/simd/q1f.h */
cannam@167 73
cannam@167 74 /*
cannam@167 75 * This function contains 6 FP additions, 4 FP multiplications,
cannam@167 76 * (or, 6 additions, 4 multiplications, 0 fused multiply/add),
cannam@167 77 * 8 stack variables, 0 constants, and 8 memory accesses
cannam@167 78 */
cannam@167 79 #include "dft/simd/q1f.h"
cannam@167 80
cannam@167 81 static void q1fv_2(R *ri, R *ii, const R *W, stride rs, stride vs, INT mb, INT me, INT ms)
cannam@167 82 {
cannam@167 83 {
cannam@167 84 INT m;
cannam@167 85 R *x;
cannam@167 86 x = ri;
cannam@167 87 for (m = mb, W = W + (mb * ((TWVL / VL) * 2)); m < me; m = m + VL, x = x + (VL * ms), W = W + (TWVL * 2), MAKE_VOLATILE_STRIDE(4, rs), MAKE_VOLATILE_STRIDE(4, vs)) {
cannam@167 88 V T1, T2, T3, T4, T5, T6;
cannam@167 89 T1 = LD(&(x[0]), ms, &(x[0]));
cannam@167 90 T2 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
cannam@167 91 T3 = BYTWJ(&(W[0]), VSUB(T1, T2));
cannam@167 92 T4 = LD(&(x[WS(vs, 1)]), ms, &(x[WS(vs, 1)]));
cannam@167 93 T5 = LD(&(x[WS(vs, 1) + WS(rs, 1)]), ms, &(x[WS(vs, 1) + WS(rs, 1)]));
cannam@167 94 T6 = BYTWJ(&(W[0]), VSUB(T4, T5));
cannam@167 95 ST(&(x[WS(vs, 1)]), T3, ms, &(x[WS(vs, 1)]));
cannam@167 96 ST(&(x[WS(vs, 1) + WS(rs, 1)]), T6, ms, &(x[WS(vs, 1) + WS(rs, 1)]));
cannam@167 97 ST(&(x[0]), VADD(T1, T2), ms, &(x[0]));
cannam@167 98 ST(&(x[WS(rs, 1)]), VADD(T4, T5), ms, &(x[WS(rs, 1)]));
cannam@167 99 }
cannam@167 100 }
cannam@167 101 VLEAVE();
cannam@167 102 }
cannam@167 103
cannam@167 104 static const tw_instr twinstr[] = {
cannam@167 105 VTW(0, 1),
cannam@167 106 {TW_NEXT, VL, 0}
cannam@167 107 };
cannam@167 108
cannam@167 109 static const ct_desc desc = { 2, XSIMD_STRING("q1fv_2"), twinstr, &GENUS, {6, 4, 0, 0}, 0, 0, 0 };
cannam@167 110
cannam@167 111 void XSIMD(codelet_q1fv_2) (planner *p) {
cannam@167 112 X(kdft_difsq_register) (p, q1fv_2, &desc);
cannam@167 113 }
cannam@167 114 #endif