annotate src/fftw-3.3.8/dft/scalar/codelets/n1_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 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:10 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.native -fma -compact -variables 4 -pipeline-latency 4 -n 3 -name n1_3 -include dft/scalar/n.h */
Chris@82 29
Chris@82 30 /*
Chris@82 31 * This function contains 12 FP additions, 6 FP multiplications,
Chris@82 32 * (or, 6 additions, 0 multiplications, 6 fused multiply/add),
Chris@82 33 * 15 stack variables, 2 constants, and 12 memory accesses
Chris@82 34 */
Chris@82 35 #include "dft/scalar/n.h"
Chris@82 36
Chris@82 37 static void n1_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 DK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@82 40 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@82 41 {
Chris@82 42 INT i;
Chris@82 43 for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(12, is), MAKE_VOLATILE_STRIDE(12, os)) {
Chris@82 44 E T1, T9, T4, Tc, T8, Ta, T5, Tb;
Chris@82 45 T1 = ri[0];
Chris@82 46 T9 = ii[0];
Chris@82 47 {
Chris@82 48 E T2, T3, T6, T7;
Chris@82 49 T2 = ri[WS(is, 1)];
Chris@82 50 T3 = ri[WS(is, 2)];
Chris@82 51 T4 = T2 + T3;
Chris@82 52 Tc = T3 - T2;
Chris@82 53 T6 = ii[WS(is, 1)];
Chris@82 54 T7 = ii[WS(is, 2)];
Chris@82 55 T8 = T6 - T7;
Chris@82 56 Ta = T6 + T7;
Chris@82 57 }
Chris@82 58 ro[0] = T1 + T4;
Chris@82 59 io[0] = T9 + Ta;
Chris@82 60 T5 = FNMS(KP500000000, T4, T1);
Chris@82 61 ro[WS(os, 2)] = FNMS(KP866025403, T8, T5);
Chris@82 62 ro[WS(os, 1)] = FMA(KP866025403, T8, T5);
Chris@82 63 Tb = FNMS(KP500000000, Ta, T9);
Chris@82 64 io[WS(os, 1)] = FMA(KP866025403, Tc, Tb);
Chris@82 65 io[WS(os, 2)] = FNMS(KP866025403, Tc, Tb);
Chris@82 66 }
Chris@82 67 }
Chris@82 68 }
Chris@82 69
Chris@82 70 static const kdft_desc desc = { 3, "n1_3", {6, 0, 6, 0}, &GENUS, 0, 0, 0, 0 };
Chris@82 71
Chris@82 72 void X(codelet_n1_3) (planner *p) {
Chris@82 73 X(kdft_register) (p, n1_3, &desc);
Chris@82 74 }
Chris@82 75
Chris@82 76 #else
Chris@82 77
Chris@82 78 /* Generated by: ../../../genfft/gen_notw.native -compact -variables 4 -pipeline-latency 4 -n 3 -name n1_3 -include dft/scalar/n.h */
Chris@82 79
Chris@82 80 /*
Chris@82 81 * This function contains 12 FP additions, 4 FP multiplications,
Chris@82 82 * (or, 10 additions, 2 multiplications, 2 fused multiply/add),
Chris@82 83 * 15 stack variables, 2 constants, and 12 memory accesses
Chris@82 84 */
Chris@82 85 #include "dft/scalar/n.h"
Chris@82 86
Chris@82 87 static void n1_3(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@82 88 {
Chris@82 89 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@82 90 DK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@82 91 {
Chris@82 92 INT i;
Chris@82 93 for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(12, is), MAKE_VOLATILE_STRIDE(12, os)) {
Chris@82 94 E T1, Ta, T4, T9, T8, Tb, T5, Tc;
Chris@82 95 T1 = ri[0];
Chris@82 96 Ta = ii[0];
Chris@82 97 {
Chris@82 98 E T2, T3, T6, T7;
Chris@82 99 T2 = ri[WS(is, 1)];
Chris@82 100 T3 = ri[WS(is, 2)];
Chris@82 101 T4 = T2 + T3;
Chris@82 102 T9 = KP866025403 * (T3 - T2);
Chris@82 103 T6 = ii[WS(is, 1)];
Chris@82 104 T7 = ii[WS(is, 2)];
Chris@82 105 T8 = KP866025403 * (T6 - T7);
Chris@82 106 Tb = T6 + T7;
Chris@82 107 }
Chris@82 108 ro[0] = T1 + T4;
Chris@82 109 io[0] = Ta + Tb;
Chris@82 110 T5 = FNMS(KP500000000, T4, T1);
Chris@82 111 ro[WS(os, 2)] = T5 - T8;
Chris@82 112 ro[WS(os, 1)] = T5 + T8;
Chris@82 113 Tc = FNMS(KP500000000, Tb, Ta);
Chris@82 114 io[WS(os, 1)] = T9 + Tc;
Chris@82 115 io[WS(os, 2)] = Tc - T9;
Chris@82 116 }
Chris@82 117 }
Chris@82 118 }
Chris@82 119
Chris@82 120 static const kdft_desc desc = { 3, "n1_3", {10, 2, 2, 0}, &GENUS, 0, 0, 0, 0 };
Chris@82 121
Chris@82 122 void X(codelet_n1_3) (planner *p) {
Chris@82 123 X(kdft_register) (p, n1_3, &desc);
Chris@82 124 }
Chris@82 125
Chris@82 126 #endif