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