annotate src/fftw-3.3.8/dft/simd/common/n1bv_3.c @ 84:08ae793730bd

Add null config files
author Chris Cannam
date Mon, 02 Mar 2020 14:03:47 +0000
parents d0c2a83c1364
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:54 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 -sign 1 -n 3 -name n1bv_3 -include dft/simd/n1b.h */
Chris@82 29
Chris@82 30 /*
Chris@82 31 * This function contains 6 FP additions, 4 FP multiplications,
Chris@82 32 * (or, 3 additions, 1 multiplications, 3 fused multiply/add),
Chris@82 33 * 11 stack variables, 2 constants, and 6 memory accesses
Chris@82 34 */
Chris@82 35 #include "dft/simd/n1b.h"
Chris@82 36
Chris@82 37 static void n1bv_3(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 DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@82 40 DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@82 41 {
Chris@82 42 INT i;
Chris@82 43 const R *xi;
Chris@82 44 R *xo;
Chris@82 45 xi = ii;
Chris@82 46 xo = io;
Chris@82 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@82 48 V T1, T4, T6, T2, T3, T5;
Chris@82 49 T1 = LD(&(xi[0]), ivs, &(xi[0]));
Chris@82 50 T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@82 51 T3 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@82 52 T4 = VADD(T2, T3);
Chris@82 53 T6 = VMUL(LDK(KP866025403), VSUB(T2, T3));
Chris@82 54 ST(&(xo[0]), VADD(T1, T4), ovs, &(xo[0]));
Chris@82 55 T5 = VFNMS(LDK(KP500000000), T4, T1);
Chris@82 56 ST(&(xo[WS(os, 1)]), VFMAI(T6, T5), ovs, &(xo[WS(os, 1)]));
Chris@82 57 ST(&(xo[WS(os, 2)]), VFNMSI(T6, T5), ovs, &(xo[0]));
Chris@82 58 }
Chris@82 59 }
Chris@82 60 VLEAVE();
Chris@82 61 }
Chris@82 62
Chris@82 63 static const kdft_desc desc = { 3, XSIMD_STRING("n1bv_3"), {3, 1, 3, 0}, &GENUS, 0, 0, 0, 0 };
Chris@82 64
Chris@82 65 void XSIMD(codelet_n1bv_3) (planner *p) {
Chris@82 66 X(kdft_register) (p, n1bv_3, &desc);
Chris@82 67 }
Chris@82 68
Chris@82 69 #else
Chris@82 70
Chris@82 71 /* Generated by: ../../../genfft/gen_notw_c.native -simd -compact -variables 4 -pipeline-latency 8 -sign 1 -n 3 -name n1bv_3 -include dft/simd/n1b.h */
Chris@82 72
Chris@82 73 /*
Chris@82 74 * This function contains 6 FP additions, 2 FP multiplications,
Chris@82 75 * (or, 5 additions, 1 multiplications, 1 fused multiply/add),
Chris@82 76 * 11 stack variables, 2 constants, and 6 memory accesses
Chris@82 77 */
Chris@82 78 #include "dft/simd/n1b.h"
Chris@82 79
Chris@82 80 static void n1bv_3(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@82 81 {
Chris@82 82 DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@82 83 DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@82 84 {
Chris@82 85 INT i;
Chris@82 86 const R *xi;
Chris@82 87 R *xo;
Chris@82 88 xi = ii;
Chris@82 89 xo = io;
Chris@82 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@82 91 V T4, T3, T5, T1, T2, T6;
Chris@82 92 T4 = LD(&(xi[0]), ivs, &(xi[0]));
Chris@82 93 T1 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@82 94 T2 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@82 95 T3 = VBYI(VMUL(LDK(KP866025403), VSUB(T1, T2)));
Chris@82 96 T5 = VADD(T1, T2);
Chris@82 97 ST(&(xo[0]), VADD(T4, T5), ovs, &(xo[0]));
Chris@82 98 T6 = VFNMS(LDK(KP500000000), T5, T4);
Chris@82 99 ST(&(xo[WS(os, 1)]), VADD(T3, T6), ovs, &(xo[WS(os, 1)]));
Chris@82 100 ST(&(xo[WS(os, 2)]), VSUB(T6, T3), ovs, &(xo[0]));
Chris@82 101 }
Chris@82 102 }
Chris@82 103 VLEAVE();
Chris@82 104 }
Chris@82 105
Chris@82 106 static const kdft_desc desc = { 3, XSIMD_STRING("n1bv_3"), {5, 1, 1, 0}, &GENUS, 0, 0, 0, 0 };
Chris@82 107
Chris@82 108 void XSIMD(codelet_n1bv_3) (planner *p) {
Chris@82 109 X(kdft_register) (p, n1bv_3, &desc);
Chris@82 110 }
Chris@82 111
Chris@82 112 #endif