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