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