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