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