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