annotate src/fftw-3.3.5/rdft/scalar/r2cf/r2cf_7.c @ 168:ceec0dd9ec9c

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 <cannam@all-day-breakfast.com>
date Fri, 07 Feb 2020 11:51:13 +0000
parents 7867fa7e1b6b
children
rev   line source
cannam@127 1 /*
cannam@127 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
cannam@127 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
cannam@127 4 *
cannam@127 5 * This program is free software; you can redistribute it and/or modify
cannam@127 6 * it under the terms of the GNU General Public License as published by
cannam@127 7 * the Free Software Foundation; either version 2 of the License, or
cannam@127 8 * (at your option) any later version.
cannam@127 9 *
cannam@127 10 * This program is distributed in the hope that it will be useful,
cannam@127 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@127 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
cannam@127 13 * GNU General Public License for more details.
cannam@127 14 *
cannam@127 15 * You should have received a copy of the GNU General Public License
cannam@127 16 * along with this program; if not, write to the Free Software
cannam@127 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
cannam@127 18 *
cannam@127 19 */
cannam@127 20
cannam@127 21 /* This file was automatically generated --- DO NOT EDIT */
cannam@127 22 /* Generated on Sat Jul 30 16:46:03 EDT 2016 */
cannam@127 23
cannam@127 24 #include "codelet-rdft.h"
cannam@127 25
cannam@127 26 #ifdef HAVE_FMA
cannam@127 27
cannam@127 28 /* Generated by: ../../../genfft/gen_r2cf.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 7 -name r2cf_7 -include r2cf.h */
cannam@127 29
cannam@127 30 /*
cannam@127 31 * This function contains 24 FP additions, 18 FP multiplications,
cannam@127 32 * (or, 9 additions, 3 multiplications, 15 fused multiply/add),
cannam@127 33 * 25 stack variables, 6 constants, and 14 memory accesses
cannam@127 34 */
cannam@127 35 #include "r2cf.h"
cannam@127 36
cannam@127 37 static void r2cf_7(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
cannam@127 38 {
cannam@127 39 DK(KP900968867, +0.900968867902419126236102319507445051165919162);
cannam@127 40 DK(KP801937735, +0.801937735804838252472204639014890102331838324);
cannam@127 41 DK(KP974927912, +0.974927912181823607018131682993931217232785801);
cannam@127 42 DK(KP692021471, +0.692021471630095869627814897002069140197260599);
cannam@127 43 DK(KP554958132, +0.554958132087371191422194871006410481067288862);
cannam@127 44 DK(KP356895867, +0.356895867892209443894399510021300583399127187);
cannam@127 45 {
cannam@127 46 INT i;
cannam@127 47 for (i = v; i > 0; i = i - 1, R0 = R0 + ivs, R1 = R1 + ivs, Cr = Cr + ovs, Ci = Ci + ovs, MAKE_VOLATILE_STRIDE(28, rs), MAKE_VOLATILE_STRIDE(28, csr), MAKE_VOLATILE_STRIDE(28, csi)) {
cannam@127 48 E T1, Tg, Tc;
cannam@127 49 {
cannam@127 50 E Th, T4, Ti, Ta, Tj, T7, Td, T5, T6, Tl, Tk;
cannam@127 51 T1 = R0[0];
cannam@127 52 {
cannam@127 53 E T2, T3, T8, T9;
cannam@127 54 T2 = R1[0];
cannam@127 55 T3 = R0[WS(rs, 3)];
cannam@127 56 T8 = R1[WS(rs, 1)];
cannam@127 57 T9 = R0[WS(rs, 2)];
cannam@127 58 T5 = R0[WS(rs, 1)];
cannam@127 59 Th = T3 - T2;
cannam@127 60 T4 = T2 + T3;
cannam@127 61 T6 = R1[WS(rs, 2)];
cannam@127 62 Ti = T9 - T8;
cannam@127 63 Ta = T8 + T9;
cannam@127 64 }
cannam@127 65 Tj = T6 - T5;
cannam@127 66 T7 = T5 + T6;
cannam@127 67 Td = FNMS(KP356895867, T4, Ta);
cannam@127 68 Tl = FMA(KP554958132, Ti, Th);
cannam@127 69 Tk = FMA(KP554958132, Tj, Ti);
cannam@127 70 {
cannam@127 71 E Tm, Tf, Tb, Te;
cannam@127 72 Tm = FNMS(KP554958132, Th, Tj);
cannam@127 73 Cr[0] = T1 + T4 + T7 + Ta;
cannam@127 74 Tf = FNMS(KP356895867, T7, T4);
cannam@127 75 Tb = FNMS(KP356895867, Ta, T7);
cannam@127 76 Te = FNMS(KP692021471, Td, T7);
cannam@127 77 Ci[WS(csi, 2)] = KP974927912 * (FNMS(KP801937735, Tk, Th));
cannam@127 78 Ci[WS(csi, 3)] = KP974927912 * (FNMS(KP801937735, Tm, Ti));
cannam@127 79 Tg = FNMS(KP692021471, Tf, Ta);
cannam@127 80 Tc = FNMS(KP692021471, Tb, T4);
cannam@127 81 Cr[WS(csr, 2)] = FNMS(KP900968867, Te, T1);
cannam@127 82 Ci[WS(csi, 1)] = KP974927912 * (FMA(KP801937735, Tl, Tj));
cannam@127 83 }
cannam@127 84 }
cannam@127 85 Cr[WS(csr, 1)] = FNMS(KP900968867, Tg, T1);
cannam@127 86 Cr[WS(csr, 3)] = FNMS(KP900968867, Tc, T1);
cannam@127 87 }
cannam@127 88 }
cannam@127 89 }
cannam@127 90
cannam@127 91 static const kr2c_desc desc = { 7, "r2cf_7", {9, 3, 15, 0}, &GENUS };
cannam@127 92
cannam@127 93 void X(codelet_r2cf_7) (planner *p) {
cannam@127 94 X(kr2c_register) (p, r2cf_7, &desc);
cannam@127 95 }
cannam@127 96
cannam@127 97 #else /* HAVE_FMA */
cannam@127 98
cannam@127 99 /* Generated by: ../../../genfft/gen_r2cf.native -compact -variables 4 -pipeline-latency 4 -n 7 -name r2cf_7 -include r2cf.h */
cannam@127 100
cannam@127 101 /*
cannam@127 102 * This function contains 24 FP additions, 18 FP multiplications,
cannam@127 103 * (or, 12 additions, 6 multiplications, 12 fused multiply/add),
cannam@127 104 * 20 stack variables, 6 constants, and 14 memory accesses
cannam@127 105 */
cannam@127 106 #include "r2cf.h"
cannam@127 107
cannam@127 108 static void r2cf_7(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
cannam@127 109 {
cannam@127 110 DK(KP222520933, +0.222520933956314404288902564496794759466355569);
cannam@127 111 DK(KP900968867, +0.900968867902419126236102319507445051165919162);
cannam@127 112 DK(KP623489801, +0.623489801858733530525004884004239810632274731);
cannam@127 113 DK(KP433883739, +0.433883739117558120475768332848358754609990728);
cannam@127 114 DK(KP781831482, +0.781831482468029808708444526674057750232334519);
cannam@127 115 DK(KP974927912, +0.974927912181823607018131682993931217232785801);
cannam@127 116 {
cannam@127 117 INT i;
cannam@127 118 for (i = v; i > 0; i = i - 1, R0 = R0 + ivs, R1 = R1 + ivs, Cr = Cr + ovs, Ci = Ci + ovs, MAKE_VOLATILE_STRIDE(28, rs), MAKE_VOLATILE_STRIDE(28, csr), MAKE_VOLATILE_STRIDE(28, csi)) {
cannam@127 119 E T1, Ta, Tb, T4, Td, T7, Tc, T8, T9;
cannam@127 120 T1 = R0[0];
cannam@127 121 T8 = R1[0];
cannam@127 122 T9 = R0[WS(rs, 3)];
cannam@127 123 Ta = T8 + T9;
cannam@127 124 Tb = T9 - T8;
cannam@127 125 {
cannam@127 126 E T2, T3, T5, T6;
cannam@127 127 T2 = R0[WS(rs, 1)];
cannam@127 128 T3 = R1[WS(rs, 2)];
cannam@127 129 T4 = T2 + T3;
cannam@127 130 Td = T3 - T2;
cannam@127 131 T5 = R1[WS(rs, 1)];
cannam@127 132 T6 = R0[WS(rs, 2)];
cannam@127 133 T7 = T5 + T6;
cannam@127 134 Tc = T6 - T5;
cannam@127 135 }
cannam@127 136 Ci[WS(csi, 2)] = FNMS(KP781831482, Tc, KP974927912 * Tb) - (KP433883739 * Td);
cannam@127 137 Ci[WS(csi, 1)] = FMA(KP781831482, Tb, KP974927912 * Td) + (KP433883739 * Tc);
cannam@127 138 Cr[WS(csr, 2)] = FMA(KP623489801, T7, T1) + FNMA(KP900968867, T4, KP222520933 * Ta);
cannam@127 139 Ci[WS(csi, 3)] = FMA(KP433883739, Tb, KP974927912 * Tc) - (KP781831482 * Td);
cannam@127 140 Cr[WS(csr, 3)] = FMA(KP623489801, T4, T1) + FNMA(KP222520933, T7, KP900968867 * Ta);
cannam@127 141 Cr[WS(csr, 1)] = FMA(KP623489801, Ta, T1) + FNMA(KP900968867, T7, KP222520933 * T4);
cannam@127 142 Cr[0] = T1 + Ta + T4 + T7;
cannam@127 143 }
cannam@127 144 }
cannam@127 145 }
cannam@127 146
cannam@127 147 static const kr2c_desc desc = { 7, "r2cf_7", {12, 6, 12, 0}, &GENUS };
cannam@127 148
cannam@127 149 void X(codelet_r2cf_7) (planner *p) {
cannam@127 150 X(kr2c_register) (p, r2cf_7, &desc);
cannam@127 151 }
cannam@127 152
cannam@127 153 #endif /* HAVE_FMA */