annotate src/fftw-3.3.8/dft/simd/common/n1fv_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:04:51 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_notw_c.native -fma -simd -compact -variables 4 -pipeline-latency 8 -n 4 -name n1fv_4 -include dft/simd/n1f.h */
Chris@82 29
Chris@82 30 /*
Chris@82 31 * This function contains 8 FP additions, 2 FP multiplications,
Chris@82 32 * (or, 6 additions, 0 multiplications, 2 fused multiply/add),
Chris@82 33 * 11 stack variables, 0 constants, and 8 memory accesses
Chris@82 34 */
Chris@82 35 #include "dft/simd/n1f.h"
Chris@82 36
Chris@82 37 static void n1fv_4(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@82 38 {
Chris@82 39 {
Chris@82 40 INT i;
Chris@82 41 const R *xi;
Chris@82 42 R *xo;
Chris@82 43 xi = ri;
Chris@82 44 xo = ro;
Chris@82 45 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(8, is), MAKE_VOLATILE_STRIDE(8, os)) {
Chris@82 46 V T3, T7, T6, T8;
Chris@82 47 {
Chris@82 48 V T1, T2, T4, T5;
Chris@82 49 T1 = LD(&(xi[0]), ivs, &(xi[0]));
Chris@82 50 T2 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@82 51 T3 = VSUB(T1, T2);
Chris@82 52 T7 = VADD(T1, T2);
Chris@82 53 T4 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@82 54 T5 = LD(&(xi[WS(is, 3)]), ivs, &(xi[WS(is, 1)]));
Chris@82 55 T6 = VSUB(T4, T5);
Chris@82 56 T8 = VADD(T4, T5);
Chris@82 57 }
Chris@82 58 ST(&(xo[WS(os, 1)]), VFNMSI(T6, T3), ovs, &(xo[WS(os, 1)]));
Chris@82 59 ST(&(xo[0]), VADD(T7, T8), ovs, &(xo[0]));
Chris@82 60 ST(&(xo[WS(os, 3)]), VFMAI(T6, T3), ovs, &(xo[WS(os, 1)]));
Chris@82 61 ST(&(xo[WS(os, 2)]), VSUB(T7, T8), ovs, &(xo[0]));
Chris@82 62 }
Chris@82 63 }
Chris@82 64 VLEAVE();
Chris@82 65 }
Chris@82 66
Chris@82 67 static const kdft_desc desc = { 4, XSIMD_STRING("n1fv_4"), {6, 0, 2, 0}, &GENUS, 0, 0, 0, 0 };
Chris@82 68
Chris@82 69 void XSIMD(codelet_n1fv_4) (planner *p) {
Chris@82 70 X(kdft_register) (p, n1fv_4, &desc);
Chris@82 71 }
Chris@82 72
Chris@82 73 #else
Chris@82 74
Chris@82 75 /* Generated by: ../../../genfft/gen_notw_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 4 -name n1fv_4 -include dft/simd/n1f.h */
Chris@82 76
Chris@82 77 /*
Chris@82 78 * This function contains 8 FP additions, 0 FP multiplications,
Chris@82 79 * (or, 8 additions, 0 multiplications, 0 fused multiply/add),
Chris@82 80 * 11 stack variables, 0 constants, and 8 memory accesses
Chris@82 81 */
Chris@82 82 #include "dft/simd/n1f.h"
Chris@82 83
Chris@82 84 static void n1fv_4(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@82 85 {
Chris@82 86 {
Chris@82 87 INT i;
Chris@82 88 const R *xi;
Chris@82 89 R *xo;
Chris@82 90 xi = ri;
Chris@82 91 xo = ro;
Chris@82 92 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(8, is), MAKE_VOLATILE_STRIDE(8, os)) {
Chris@82 93 V T3, T7, T6, T8;
Chris@82 94 {
Chris@82 95 V T1, T2, T4, T5;
Chris@82 96 T1 = LD(&(xi[0]), ivs, &(xi[0]));
Chris@82 97 T2 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@82 98 T3 = VSUB(T1, T2);
Chris@82 99 T7 = VADD(T1, T2);
Chris@82 100 T4 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@82 101 T5 = LD(&(xi[WS(is, 3)]), ivs, &(xi[WS(is, 1)]));
Chris@82 102 T6 = VBYI(VSUB(T4, T5));
Chris@82 103 T8 = VADD(T4, T5);
Chris@82 104 }
Chris@82 105 ST(&(xo[WS(os, 1)]), VSUB(T3, T6), ovs, &(xo[WS(os, 1)]));
Chris@82 106 ST(&(xo[0]), VADD(T7, T8), ovs, &(xo[0]));
Chris@82 107 ST(&(xo[WS(os, 3)]), VADD(T3, T6), ovs, &(xo[WS(os, 1)]));
Chris@82 108 ST(&(xo[WS(os, 2)]), VSUB(T7, T8), ovs, &(xo[0]));
Chris@82 109 }
Chris@82 110 }
Chris@82 111 VLEAVE();
Chris@82 112 }
Chris@82 113
Chris@82 114 static const kdft_desc desc = { 4, XSIMD_STRING("n1fv_4"), {8, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
Chris@82 115
Chris@82 116 void XSIMD(codelet_n1fv_4) (planner *p) {
Chris@82 117 X(kdft_register) (p, n1fv_4, &desc);
Chris@82 118 }
Chris@82 119
Chris@82 120 #endif