annotate src/fftw-3.3.5/rdft/scalar/r2cf/hc2cfdft_4.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:48:40 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_hc2cdft.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 4 -dit -name hc2cfdft_4 -include hc2cf.h */
Chris@42 29
Chris@42 30 /*
Chris@42 31 * This function contains 30 FP additions, 20 FP multiplications,
Chris@42 32 * (or, 24 additions, 14 multiplications, 6 fused multiply/add),
Chris@42 33 * 32 stack variables, 1 constants, and 16 memory accesses
Chris@42 34 */
Chris@42 35 #include "hc2cf.h"
Chris@42 36
Chris@42 37 static void hc2cfdft_4(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@42 38 {
Chris@42 39 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@42 40 {
Chris@42 41 INT m;
Chris@42 42 for (m = mb, W = W + ((mb - 1) * 6); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 6, MAKE_VOLATILE_STRIDE(16, rs)) {
Chris@42 43 E Td, Tu, Tr, T4, Tm, To, T9, T5, TA, Tp, Tv, TD, T6, Tq;
Chris@42 44 {
Chris@42 45 E Tk, Tl, Tf, TC, Tj, T7, T8, T1, Tn, Tb, Tc;
Chris@42 46 Tb = Ip[0];
Chris@42 47 Tc = Im[0];
Chris@42 48 {
Chris@42 49 E Ti, Tg, Th, T2, T3;
Chris@42 50 Tg = Rm[0];
Chris@42 51 Th = Rp[0];
Chris@42 52 Tk = W[1];
Chris@42 53 Tl = Tb + Tc;
Chris@42 54 Td = Tb - Tc;
Chris@42 55 Tu = Th + Tg;
Chris@42 56 Ti = Tg - Th;
Chris@42 57 Tf = W[0];
Chris@42 58 T2 = Ip[WS(rs, 1)];
Chris@42 59 T3 = Im[WS(rs, 1)];
Chris@42 60 TC = Tk * Ti;
Chris@42 61 Tj = Tf * Ti;
Chris@42 62 T7 = Rp[WS(rs, 1)];
Chris@42 63 Tr = T2 + T3;
Chris@42 64 T4 = T2 - T3;
Chris@42 65 T8 = Rm[WS(rs, 1)];
Chris@42 66 T1 = W[2];
Chris@42 67 Tn = W[4];
Chris@42 68 }
Chris@42 69 Tm = FNMS(Tk, Tl, Tj);
Chris@42 70 To = T7 - T8;
Chris@42 71 T9 = T7 + T8;
Chris@42 72 T5 = T1 * T4;
Chris@42 73 TA = Tn * Tr;
Chris@42 74 Tp = Tn * To;
Chris@42 75 Tv = T1 * T9;
Chris@42 76 TD = FMA(Tf, Tl, TC);
Chris@42 77 T6 = W[3];
Chris@42 78 Tq = W[5];
Chris@42 79 }
Chris@42 80 {
Chris@42 81 E Tw, Ta, TB, Ts;
Chris@42 82 Tw = FMA(T6, T4, Tv);
Chris@42 83 Ta = FNMS(T6, T9, T5);
Chris@42 84 TB = FNMS(Tq, To, TA);
Chris@42 85 Ts = FMA(Tq, Tr, Tp);
Chris@42 86 {
Chris@42 87 E TF, Tx, Te, Tz;
Chris@42 88 TF = Tu + Tw;
Chris@42 89 Tx = Tu - Tw;
Chris@42 90 Te = Ta + Td;
Chris@42 91 Tz = Td - Ta;
Chris@42 92 {
Chris@42 93 E TG, TE, Tt, Ty;
Chris@42 94 TG = TB + TD;
Chris@42 95 TE = TB - TD;
Chris@42 96 Tt = Tm - Ts;
Chris@42 97 Ty = Ts + Tm;
Chris@42 98 Im[0] = KP500000000 * (TE - Tz);
Chris@42 99 Ip[WS(rs, 1)] = KP500000000 * (Tz + TE);
Chris@42 100 Rp[0] = KP500000000 * (TF + TG);
Chris@42 101 Rm[WS(rs, 1)] = KP500000000 * (TF - TG);
Chris@42 102 Rp[WS(rs, 1)] = KP500000000 * (Tx + Ty);
Chris@42 103 Rm[0] = KP500000000 * (Tx - Ty);
Chris@42 104 Im[WS(rs, 1)] = KP500000000 * (Tt - Te);
Chris@42 105 Ip[0] = KP500000000 * (Te + Tt);
Chris@42 106 }
Chris@42 107 }
Chris@42 108 }
Chris@42 109 }
Chris@42 110 }
Chris@42 111 }
Chris@42 112
Chris@42 113 static const tw_instr twinstr[] = {
Chris@42 114 {TW_FULL, 1, 4},
Chris@42 115 {TW_NEXT, 1, 0}
Chris@42 116 };
Chris@42 117
Chris@42 118 static const hc2c_desc desc = { 4, "hc2cfdft_4", twinstr, &GENUS, {24, 14, 6, 0} };
Chris@42 119
Chris@42 120 void X(codelet_hc2cfdft_4) (planner *p) {
Chris@42 121 X(khc2c_register) (p, hc2cfdft_4, &desc, HC2C_VIA_DFT);
Chris@42 122 }
Chris@42 123 #else /* HAVE_FMA */
Chris@42 124
Chris@42 125 /* Generated by: ../../../genfft/gen_hc2cdft.native -compact -variables 4 -pipeline-latency 4 -n 4 -dit -name hc2cfdft_4 -include hc2cf.h */
Chris@42 126
Chris@42 127 /*
Chris@42 128 * This function contains 30 FP additions, 20 FP multiplications,
Chris@42 129 * (or, 24 additions, 14 multiplications, 6 fused multiply/add),
Chris@42 130 * 18 stack variables, 1 constants, and 16 memory accesses
Chris@42 131 */
Chris@42 132 #include "hc2cf.h"
Chris@42 133
Chris@42 134 static void hc2cfdft_4(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@42 135 {
Chris@42 136 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@42 137 {
Chris@42 138 INT m;
Chris@42 139 for (m = mb, W = W + ((mb - 1) * 6); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 6, MAKE_VOLATILE_STRIDE(16, rs)) {
Chris@42 140 E Tc, Tr, Tk, Tx, T9, Ts, Tp, Tw;
Chris@42 141 {
Chris@42 142 E Ta, Tb, Tj, Tf, Tg, Th, Te, Ti;
Chris@42 143 Ta = Ip[0];
Chris@42 144 Tb = Im[0];
Chris@42 145 Tj = Ta + Tb;
Chris@42 146 Tf = Rm[0];
Chris@42 147 Tg = Rp[0];
Chris@42 148 Th = Tf - Tg;
Chris@42 149 Tc = Ta - Tb;
Chris@42 150 Tr = Tg + Tf;
Chris@42 151 Te = W[0];
Chris@42 152 Ti = W[1];
Chris@42 153 Tk = FNMS(Ti, Tj, Te * Th);
Chris@42 154 Tx = FMA(Ti, Th, Te * Tj);
Chris@42 155 }
Chris@42 156 {
Chris@42 157 E T4, To, T8, Tm;
Chris@42 158 {
Chris@42 159 E T2, T3, T6, T7;
Chris@42 160 T2 = Ip[WS(rs, 1)];
Chris@42 161 T3 = Im[WS(rs, 1)];
Chris@42 162 T4 = T2 - T3;
Chris@42 163 To = T2 + T3;
Chris@42 164 T6 = Rp[WS(rs, 1)];
Chris@42 165 T7 = Rm[WS(rs, 1)];
Chris@42 166 T8 = T6 + T7;
Chris@42 167 Tm = T6 - T7;
Chris@42 168 }
Chris@42 169 {
Chris@42 170 E T1, T5, Tl, Tn;
Chris@42 171 T1 = W[2];
Chris@42 172 T5 = W[3];
Chris@42 173 T9 = FNMS(T5, T8, T1 * T4);
Chris@42 174 Ts = FMA(T1, T8, T5 * T4);
Chris@42 175 Tl = W[4];
Chris@42 176 Tn = W[5];
Chris@42 177 Tp = FMA(Tl, Tm, Tn * To);
Chris@42 178 Tw = FNMS(Tn, Tm, Tl * To);
Chris@42 179 }
Chris@42 180 }
Chris@42 181 {
Chris@42 182 E Td, Tq, Tz, TA;
Chris@42 183 Td = T9 + Tc;
Chris@42 184 Tq = Tk - Tp;
Chris@42 185 Ip[0] = KP500000000 * (Td + Tq);
Chris@42 186 Im[WS(rs, 1)] = KP500000000 * (Tq - Td);
Chris@42 187 Tz = Tr + Ts;
Chris@42 188 TA = Tw + Tx;
Chris@42 189 Rm[WS(rs, 1)] = KP500000000 * (Tz - TA);
Chris@42 190 Rp[0] = KP500000000 * (Tz + TA);
Chris@42 191 }
Chris@42 192 {
Chris@42 193 E Tt, Tu, Tv, Ty;
Chris@42 194 Tt = Tr - Ts;
Chris@42 195 Tu = Tp + Tk;
Chris@42 196 Rm[0] = KP500000000 * (Tt - Tu);
Chris@42 197 Rp[WS(rs, 1)] = KP500000000 * (Tt + Tu);
Chris@42 198 Tv = Tc - T9;
Chris@42 199 Ty = Tw - Tx;
Chris@42 200 Ip[WS(rs, 1)] = KP500000000 * (Tv + Ty);
Chris@42 201 Im[0] = KP500000000 * (Ty - Tv);
Chris@42 202 }
Chris@42 203 }
Chris@42 204 }
Chris@42 205 }
Chris@42 206
Chris@42 207 static const tw_instr twinstr[] = {
Chris@42 208 {TW_FULL, 1, 4},
Chris@42 209 {TW_NEXT, 1, 0}
Chris@42 210 };
Chris@42 211
Chris@42 212 static const hc2c_desc desc = { 4, "hc2cfdft_4", twinstr, &GENUS, {24, 14, 6, 0} };
Chris@42 213
Chris@42 214 void X(codelet_hc2cfdft_4) (planner *p) {
Chris@42 215 X(khc2c_register) (p, hc2cfdft_4, &desc, HC2C_VIA_DFT);
Chris@42 216 }
Chris@42 217 #endif /* HAVE_FMA */