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