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