annotate src/fftw-3.3.5/dft/simd/common/n1fv_3.c @ 83:ae30d91d2ffe

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
date Fri, 07 Feb 2020 11:51:13 +0000
parents 2cd0e3b3e1fd
children
rev   line source
Chris@42 1 /*
Chris@42 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@42 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@42 4 *
Chris@42 5 * This program is free software; you can redistribute it and/or modify
Chris@42 6 * it under the terms of the GNU General Public License as published by
Chris@42 7 * the Free Software Foundation; either version 2 of the License, or
Chris@42 8 * (at your option) any later version.
Chris@42 9 *
Chris@42 10 * This program is distributed in the hope that it will be useful,
Chris@42 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@42 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@42 13 * GNU General Public License for more details.
Chris@42 14 *
Chris@42 15 * You should have received a copy of the GNU General Public License
Chris@42 16 * along with this program; if not, write to the Free Software
Chris@42 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@42 18 *
Chris@42 19 */
Chris@42 20
Chris@42 21 /* This file was automatically generated --- DO NOT EDIT */
Chris@42 22 /* Generated on Sat Jul 30 16:38:39 EDT 2016 */
Chris@42 23
Chris@42 24 #include "codelet-dft.h"
Chris@42 25
Chris@42 26 #ifdef HAVE_FMA
Chris@42 27
Chris@42 28 /* Generated by: ../../../genfft/gen_notw_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 3 -name n1fv_3 -include n1f.h */
Chris@42 29
Chris@42 30 /*
Chris@42 31 * This function contains 6 FP additions, 4 FP multiplications,
Chris@42 32 * (or, 3 additions, 1 multiplications, 3 fused multiply/add),
Chris@42 33 * 11 stack variables, 2 constants, and 6 memory accesses
Chris@42 34 */
Chris@42 35 #include "n1f.h"
Chris@42 36
Chris@42 37 static void n1fv_3(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@42 38 {
Chris@42 39 DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@42 40 DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@42 41 {
Chris@42 42 INT i;
Chris@42 43 const R *xi;
Chris@42 44 R *xo;
Chris@42 45 xi = ri;
Chris@42 46 xo = ro;
Chris@42 47 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(6, is), MAKE_VOLATILE_STRIDE(6, os)) {
Chris@42 48 V T1, T2, T3, T6, T4, T5;
Chris@42 49 T1 = LD(&(xi[0]), ivs, &(xi[0]));
Chris@42 50 T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@42 51 T3 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@42 52 T6 = VMUL(LDK(KP866025403), VSUB(T3, T2));
Chris@42 53 T4 = VADD(T2, T3);
Chris@42 54 T5 = VFNMS(LDK(KP500000000), T4, T1);
Chris@42 55 ST(&(xo[0]), VADD(T1, T4), ovs, &(xo[0]));
Chris@42 56 ST(&(xo[WS(os, 1)]), VFMAI(T6, T5), ovs, &(xo[WS(os, 1)]));
Chris@42 57 ST(&(xo[WS(os, 2)]), VFNMSI(T6, T5), ovs, &(xo[0]));
Chris@42 58 }
Chris@42 59 }
Chris@42 60 VLEAVE();
Chris@42 61 }
Chris@42 62
Chris@42 63 static const kdft_desc desc = { 3, XSIMD_STRING("n1fv_3"), {3, 1, 3, 0}, &GENUS, 0, 0, 0, 0 };
Chris@42 64
Chris@42 65 void XSIMD(codelet_n1fv_3) (planner *p) {
Chris@42 66 X(kdft_register) (p, n1fv_3, &desc);
Chris@42 67 }
Chris@42 68
Chris@42 69 #else /* HAVE_FMA */
Chris@42 70
Chris@42 71 /* Generated by: ../../../genfft/gen_notw_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 3 -name n1fv_3 -include n1f.h */
Chris@42 72
Chris@42 73 /*
Chris@42 74 * This function contains 6 FP additions, 2 FP multiplications,
Chris@42 75 * (or, 5 additions, 1 multiplications, 1 fused multiply/add),
Chris@42 76 * 11 stack variables, 2 constants, and 6 memory accesses
Chris@42 77 */
Chris@42 78 #include "n1f.h"
Chris@42 79
Chris@42 80 static void n1fv_3(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@42 81 {
Chris@42 82 DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@42 83 DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@42 84 {
Chris@42 85 INT i;
Chris@42 86 const R *xi;
Chris@42 87 R *xo;
Chris@42 88 xi = ri;
Chris@42 89 xo = ro;
Chris@42 90 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(6, is), MAKE_VOLATILE_STRIDE(6, os)) {
Chris@42 91 V T1, T4, T6, T2, T3, T5;
Chris@42 92 T1 = LD(&(xi[0]), ivs, &(xi[0]));
Chris@42 93 T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@42 94 T3 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@42 95 T4 = VADD(T2, T3);
Chris@42 96 T6 = VBYI(VMUL(LDK(KP866025403), VSUB(T3, T2)));
Chris@42 97 ST(&(xo[0]), VADD(T1, T4), ovs, &(xo[0]));
Chris@42 98 T5 = VFNMS(LDK(KP500000000), T4, T1);
Chris@42 99 ST(&(xo[WS(os, 2)]), VSUB(T5, T6), ovs, &(xo[0]));
Chris@42 100 ST(&(xo[WS(os, 1)]), VADD(T5, T6), ovs, &(xo[WS(os, 1)]));
Chris@42 101 }
Chris@42 102 }
Chris@42 103 VLEAVE();
Chris@42 104 }
Chris@42 105
Chris@42 106 static const kdft_desc desc = { 3, XSIMD_STRING("n1fv_3"), {5, 1, 1, 0}, &GENUS, 0, 0, 0, 0 };
Chris@42 107
Chris@42 108 void XSIMD(codelet_n1fv_3) (planner *p) {
Chris@42 109 X(kdft_register) (p, n1fv_3, &desc);
Chris@42 110 }
Chris@42 111
Chris@42 112 #endif /* HAVE_FMA */