annotate src/fftw-3.3.5/rdft/scalar/r2cb/r2cbIII_6.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:50:35 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_r2cb.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -sign 1 -n 6 -name r2cbIII_6 -dft-III -include r2cbIII.h */
cannam@127 29
cannam@127 30 /*
cannam@127 31 * This function contains 12 FP additions, 8 FP multiplications,
cannam@127 32 * (or, 6 additions, 2 multiplications, 6 fused multiply/add),
cannam@127 33 * 15 stack variables, 2 constants, and 12 memory accesses
cannam@127 34 */
cannam@127 35 #include "r2cbIII.h"
cannam@127 36
cannam@127 37 static void r2cbIII_6(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(KP1_732050807, +1.732050807568877293527446341505872366942805254);
cannam@127 40 DK(KP2_000000000, +2.000000000000000000000000000000000000000000000);
cannam@127 41 {
cannam@127 42 INT i;
cannam@127 43 for (i = v; i > 0; i = i - 1, R0 = R0 + ovs, R1 = R1 + ovs, Cr = Cr + ivs, Ci = Ci + ivs, MAKE_VOLATILE_STRIDE(24, rs), MAKE_VOLATILE_STRIDE(24, csr), MAKE_VOLATILE_STRIDE(24, csi)) {
cannam@127 44 E T1, T8, T2, T3, T5, T6;
cannam@127 45 T1 = Cr[WS(csr, 1)];
cannam@127 46 T8 = Ci[WS(csi, 1)];
cannam@127 47 T2 = Cr[WS(csr, 2)];
cannam@127 48 T3 = Cr[0];
cannam@127 49 T5 = Ci[WS(csi, 2)];
cannam@127 50 T6 = Ci[0];
cannam@127 51 {
cannam@127 52 E T4, Ta, T7, Tc, Tb, T9;
cannam@127 53 T4 = T2 + T3;
cannam@127 54 Ta = T2 - T3;
cannam@127 55 T7 = T5 + T6;
cannam@127 56 Tc = T5 - T6;
cannam@127 57 Tb = FNMS(KP2_000000000, T1, T4);
cannam@127 58 R0[0] = KP2_000000000 * (T1 + T4);
cannam@127 59 T9 = FMA(KP2_000000000, T8, T7);
cannam@127 60 R1[WS(rs, 1)] = KP2_000000000 * (T8 - T7);
cannam@127 61 R0[WS(rs, 2)] = FMS(KP1_732050807, Tc, Tb);
cannam@127 62 R0[WS(rs, 1)] = FMA(KP1_732050807, Tc, Tb);
cannam@127 63 R1[WS(rs, 2)] = FMS(KP1_732050807, Ta, T9);
cannam@127 64 R1[0] = -(FMA(KP1_732050807, Ta, T9));
cannam@127 65 }
cannam@127 66 }
cannam@127 67 }
cannam@127 68 }
cannam@127 69
cannam@127 70 static const kr2c_desc desc = { 6, "r2cbIII_6", {6, 2, 6, 0}, &GENUS };
cannam@127 71
cannam@127 72 void X(codelet_r2cbIII_6) (planner *p) {
cannam@127 73 X(kr2c_register) (p, r2cbIII_6, &desc);
cannam@127 74 }
cannam@127 75
cannam@127 76 #else /* HAVE_FMA */
cannam@127 77
cannam@127 78 /* Generated by: ../../../genfft/gen_r2cb.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 6 -name r2cbIII_6 -dft-III -include r2cbIII.h */
cannam@127 79
cannam@127 80 /*
cannam@127 81 * This function contains 12 FP additions, 6 FP multiplications,
cannam@127 82 * (or, 10 additions, 4 multiplications, 2 fused multiply/add),
cannam@127 83 * 15 stack variables, 2 constants, and 12 memory accesses
cannam@127 84 */
cannam@127 85 #include "r2cbIII.h"
cannam@127 86
cannam@127 87 static void r2cbIII_6(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
cannam@127 88 {
cannam@127 89 DK(KP2_000000000, +2.000000000000000000000000000000000000000000000);
cannam@127 90 DK(KP1_732050807, +1.732050807568877293527446341505872366942805254);
cannam@127 91 {
cannam@127 92 INT i;
cannam@127 93 for (i = v; i > 0; i = i - 1, R0 = R0 + ovs, R1 = R1 + ovs, Cr = Cr + ivs, Ci = Ci + ivs, MAKE_VOLATILE_STRIDE(24, rs), MAKE_VOLATILE_STRIDE(24, csr), MAKE_VOLATILE_STRIDE(24, csi)) {
cannam@127 94 E T1, T6, T4, T5, T9, Tb, Ta, Tc;
cannam@127 95 T1 = Cr[WS(csr, 1)];
cannam@127 96 T6 = Ci[WS(csi, 1)];
cannam@127 97 {
cannam@127 98 E T2, T3, T7, T8;
cannam@127 99 T2 = Cr[WS(csr, 2)];
cannam@127 100 T3 = Cr[0];
cannam@127 101 T4 = T2 + T3;
cannam@127 102 T5 = KP1_732050807 * (T2 - T3);
cannam@127 103 T7 = Ci[WS(csi, 2)];
cannam@127 104 T8 = Ci[0];
cannam@127 105 T9 = T7 + T8;
cannam@127 106 Tb = KP1_732050807 * (T7 - T8);
cannam@127 107 }
cannam@127 108 R0[0] = KP2_000000000 * (T1 + T4);
cannam@127 109 R1[WS(rs, 1)] = KP2_000000000 * (T6 - T9);
cannam@127 110 Ta = FMA(KP2_000000000, T6, T9);
cannam@127 111 R1[0] = -(T5 + Ta);
cannam@127 112 R1[WS(rs, 2)] = T5 - Ta;
cannam@127 113 Tc = FMS(KP2_000000000, T1, T4);
cannam@127 114 R0[WS(rs, 1)] = Tb - Tc;
cannam@127 115 R0[WS(rs, 2)] = Tc + Tb;
cannam@127 116 }
cannam@127 117 }
cannam@127 118 }
cannam@127 119
cannam@127 120 static const kr2c_desc desc = { 6, "r2cbIII_6", {10, 4, 2, 0}, &GENUS };
cannam@127 121
cannam@127 122 void X(codelet_r2cbIII_6) (planner *p) {
cannam@127 123 X(kr2c_register) (p, r2cbIII_6, &desc);
cannam@127 124 }
cannam@127 125
cannam@127 126 #endif /* HAVE_FMA */