annotate src/fftw-3.3.8/dft/simd/common/n1bv_5.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: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 5 -name n1bv_5 -include dft/simd/n1b.h */
Chris@82 29
Chris@82 30 /*
Chris@82 31 * This function contains 16 FP additions, 11 FP multiplications,
Chris@82 32 * (or, 7 additions, 2 multiplications, 9 fused multiply/add),
Chris@82 33 * 18 stack variables, 4 constants, and 10 memory accesses
Chris@82 34 */
Chris@82 35 #include "dft/simd/n1b.h"
Chris@82 36
Chris@82 37 static void n1bv_5(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(KP559016994, +0.559016994374947424102293417182819058860154590);
Chris@82 40 DVK(KP250000000, +0.250000000000000000000000000000000000000000000);
Chris@82 41 DVK(KP618033988, +0.618033988749894848204586834365638117720309180);
Chris@82 42 DVK(KP951056516, +0.951056516295153572116439333379382143405698634);
Chris@82 43 {
Chris@82 44 INT i;
Chris@82 45 const R *xi;
Chris@82 46 R *xo;
Chris@82 47 xi = ii;
Chris@82 48 xo = io;
Chris@82 49 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(10, is), MAKE_VOLATILE_STRIDE(10, os)) {
Chris@82 50 V T1, T8, Td, Ta, Tc;
Chris@82 51 T1 = LD(&(xi[0]), ivs, &(xi[0]));
Chris@82 52 {
Chris@82 53 V T2, T3, T4, T5, T6, T7;
Chris@82 54 T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@82 55 T3 = LD(&(xi[WS(is, 4)]), ivs, &(xi[0]));
Chris@82 56 T4 = VADD(T2, T3);
Chris@82 57 T5 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@82 58 T6 = LD(&(xi[WS(is, 3)]), ivs, &(xi[WS(is, 1)]));
Chris@82 59 T7 = VADD(T5, T6);
Chris@82 60 T8 = VADD(T4, T7);
Chris@82 61 Td = VSUB(T5, T6);
Chris@82 62 Ta = VSUB(T4, T7);
Chris@82 63 Tc = VSUB(T2, T3);
Chris@82 64 }
Chris@82 65 ST(&(xo[0]), VADD(T1, T8), ovs, &(xo[0]));
Chris@82 66 {
Chris@82 67 V Te, Tg, Tb, Tf, T9;
Chris@82 68 Te = VMUL(LDK(KP951056516), VFMA(LDK(KP618033988), Td, Tc));
Chris@82 69 Tg = VMUL(LDK(KP951056516), VFNMS(LDK(KP618033988), Tc, Td));
Chris@82 70 T9 = VFNMS(LDK(KP250000000), T8, T1);
Chris@82 71 Tb = VFMA(LDK(KP559016994), Ta, T9);
Chris@82 72 Tf = VFNMS(LDK(KP559016994), Ta, T9);
Chris@82 73 ST(&(xo[WS(os, 1)]), VFMAI(Te, Tb), ovs, &(xo[WS(os, 1)]));
Chris@82 74 ST(&(xo[WS(os, 3)]), VFMAI(Tg, Tf), ovs, &(xo[WS(os, 1)]));
Chris@82 75 ST(&(xo[WS(os, 4)]), VFNMSI(Te, Tb), ovs, &(xo[0]));
Chris@82 76 ST(&(xo[WS(os, 2)]), VFNMSI(Tg, Tf), ovs, &(xo[0]));
Chris@82 77 }
Chris@82 78 }
Chris@82 79 }
Chris@82 80 VLEAVE();
Chris@82 81 }
Chris@82 82
Chris@82 83 static const kdft_desc desc = { 5, XSIMD_STRING("n1bv_5"), {7, 2, 9, 0}, &GENUS, 0, 0, 0, 0 };
Chris@82 84
Chris@82 85 void XSIMD(codelet_n1bv_5) (planner *p) {
Chris@82 86 X(kdft_register) (p, n1bv_5, &desc);
Chris@82 87 }
Chris@82 88
Chris@82 89 #else
Chris@82 90
Chris@82 91 /* Generated by: ../../../genfft/gen_notw_c.native -simd -compact -variables 4 -pipeline-latency 8 -sign 1 -n 5 -name n1bv_5 -include dft/simd/n1b.h */
Chris@82 92
Chris@82 93 /*
Chris@82 94 * This function contains 16 FP additions, 6 FP multiplications,
Chris@82 95 * (or, 13 additions, 3 multiplications, 3 fused multiply/add),
Chris@82 96 * 18 stack variables, 4 constants, and 10 memory accesses
Chris@82 97 */
Chris@82 98 #include "dft/simd/n1b.h"
Chris@82 99
Chris@82 100 static void n1bv_5(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@82 101 {
Chris@82 102 DVK(KP250000000, +0.250000000000000000000000000000000000000000000);
Chris@82 103 DVK(KP587785252, +0.587785252292473129168705954639072768597652438);
Chris@82 104 DVK(KP951056516, +0.951056516295153572116439333379382143405698634);
Chris@82 105 DVK(KP559016994, +0.559016994374947424102293417182819058860154590);
Chris@82 106 {
Chris@82 107 INT i;
Chris@82 108 const R *xi;
Chris@82 109 R *xo;
Chris@82 110 xi = ii;
Chris@82 111 xo = io;
Chris@82 112 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(10, is), MAKE_VOLATILE_STRIDE(10, os)) {
Chris@82 113 V Tb, T3, Tc, T6, Ta;
Chris@82 114 Tb = LD(&(xi[0]), ivs, &(xi[0]));
Chris@82 115 {
Chris@82 116 V T1, T2, T8, T4, T5, T9;
Chris@82 117 T1 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@82 118 T2 = LD(&(xi[WS(is, 4)]), ivs, &(xi[0]));
Chris@82 119 T8 = VADD(T1, T2);
Chris@82 120 T4 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@82 121 T5 = LD(&(xi[WS(is, 3)]), ivs, &(xi[WS(is, 1)]));
Chris@82 122 T9 = VADD(T4, T5);
Chris@82 123 T3 = VSUB(T1, T2);
Chris@82 124 Tc = VADD(T8, T9);
Chris@82 125 T6 = VSUB(T4, T5);
Chris@82 126 Ta = VMUL(LDK(KP559016994), VSUB(T8, T9));
Chris@82 127 }
Chris@82 128 ST(&(xo[0]), VADD(Tb, Tc), ovs, &(xo[0]));
Chris@82 129 {
Chris@82 130 V T7, Tf, Te, Tg, Td;
Chris@82 131 T7 = VBYI(VFMA(LDK(KP951056516), T3, VMUL(LDK(KP587785252), T6)));
Chris@82 132 Tf = VBYI(VFNMS(LDK(KP951056516), T6, VMUL(LDK(KP587785252), T3)));
Chris@82 133 Td = VFNMS(LDK(KP250000000), Tc, Tb);
Chris@82 134 Te = VADD(Ta, Td);
Chris@82 135 Tg = VSUB(Td, Ta);
Chris@82 136 ST(&(xo[WS(os, 1)]), VADD(T7, Te), ovs, &(xo[WS(os, 1)]));
Chris@82 137 ST(&(xo[WS(os, 3)]), VSUB(Tg, Tf), ovs, &(xo[WS(os, 1)]));
Chris@82 138 ST(&(xo[WS(os, 4)]), VSUB(Te, T7), ovs, &(xo[0]));
Chris@82 139 ST(&(xo[WS(os, 2)]), VADD(Tf, Tg), ovs, &(xo[0]));
Chris@82 140 }
Chris@82 141 }
Chris@82 142 }
Chris@82 143 VLEAVE();
Chris@82 144 }
Chris@82 145
Chris@82 146 static const kdft_desc desc = { 5, XSIMD_STRING("n1bv_5"), {13, 3, 3, 0}, &GENUS, 0, 0, 0, 0 };
Chris@82 147
Chris@82 148 void XSIMD(codelet_n1bv_5) (planner *p) {
Chris@82 149 X(kdft_register) (p, n1bv_5, &desc);
Chris@82 150 }
Chris@82 151
Chris@82 152 #endif