annotate src/fftw-3.3.8/rdft/scalar/r2cf/hf2_4.c @ 82:d0c2a83c1364

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