annotate fft/fftw/fftw-3.3.4/rdft/scalar/r2cb/hc2cb2_4.c @ 40:223f770b5341 kissfft-double tip

Try a double-precision kissfft
author Chris Cannam
date Wed, 07 Sep 2016 10:40:32 +0100
parents 26056e866c29
children
rev   line source
Chris@19 1 /*
Chris@19 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@19 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@19 4 *
Chris@19 5 * This program is free software; you can redistribute it and/or modify
Chris@19 6 * it under the terms of the GNU General Public License as published by
Chris@19 7 * the Free Software Foundation; either version 2 of the License, or
Chris@19 8 * (at your option) any later version.
Chris@19 9 *
Chris@19 10 * This program is distributed in the hope that it will be useful,
Chris@19 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@19 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@19 13 * GNU General Public License for more details.
Chris@19 14 *
Chris@19 15 * You should have received a copy of the GNU General Public License
Chris@19 16 * along with this program; if not, write to the Free Software
Chris@19 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@19 18 *
Chris@19 19 */
Chris@19 20
Chris@19 21 /* This file was automatically generated --- DO NOT EDIT */
Chris@19 22 /* Generated on Tue Mar 4 13:50:41 EST 2014 */
Chris@19 23
Chris@19 24 #include "codelet-rdft.h"
Chris@19 25
Chris@19 26 #ifdef HAVE_FMA
Chris@19 27
Chris@19 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 */
Chris@19 29
Chris@19 30 /*
Chris@19 31 * This function contains 24 FP additions, 16 FP multiplications,
Chris@19 32 * (or, 16 additions, 8 multiplications, 8 fused multiply/add),
Chris@19 33 * 30 stack variables, 0 constants, and 16 memory accesses
Chris@19 34 */
Chris@19 35 #include "hc2cb.h"
Chris@19 36
Chris@19 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@19 38 {
Chris@19 39 {
Chris@19 40 INT m;
Chris@19 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@19 42 E Tg, Tc, Te, To, Tn;
Chris@19 43 {
Chris@19 44 E T7, Tb, T8, Ta;
Chris@19 45 T7 = W[0];
Chris@19 46 Tb = W[3];
Chris@19 47 T8 = W[2];
Chris@19 48 Ta = W[1];
Chris@19 49 {
Chris@19 50 E Tu, Tj, T3, Tm, Tx, Tr, T6, Tt;
Chris@19 51 {
Chris@19 52 E T4, Tp, Tq, T5;
Chris@19 53 {
Chris@19 54 E T1, T2, Tk, Tl;
Chris@19 55 {
Chris@19 56 E Th, Tf, T9, Ti;
Chris@19 57 Th = Ip[0];
Chris@19 58 Tf = T7 * Tb;
Chris@19 59 T9 = T7 * T8;
Chris@19 60 Ti = Im[WS(rs, 1)];
Chris@19 61 T1 = Rp[0];
Chris@19 62 Tg = FNMS(Ta, T8, Tf);
Chris@19 63 Tc = FMA(Ta, Tb, T9);
Chris@19 64 Tu = Th + Ti;
Chris@19 65 Tj = Th - Ti;
Chris@19 66 T2 = Rm[WS(rs, 1)];
Chris@19 67 }
Chris@19 68 Tk = Ip[WS(rs, 1)];
Chris@19 69 Tl = Im[0];
Chris@19 70 T4 = Rp[WS(rs, 1)];
Chris@19 71 T3 = T1 + T2;
Chris@19 72 Tp = T1 - T2;
Chris@19 73 Tm = Tk - Tl;
Chris@19 74 Tq = Tk + Tl;
Chris@19 75 T5 = Rm[0];
Chris@19 76 }
Chris@19 77 Tx = Tp + Tq;
Chris@19 78 Tr = Tp - Tq;
Chris@19 79 T6 = T4 + T5;
Chris@19 80 Tt = T4 - T5;
Chris@19 81 }
Chris@19 82 {
Chris@19 83 E Tz, Tv, Td, Ts, Tw, TA, Ty;
Chris@19 84 Rm[0] = Tj + Tm;
Chris@19 85 Ts = T7 * Tr;
Chris@19 86 Tz = Tu - Tt;
Chris@19 87 Tv = Tt + Tu;
Chris@19 88 Rp[0] = T3 + T6;
Chris@19 89 Td = T3 - T6;
Chris@19 90 Ip[0] = FNMS(Ta, Tv, Ts);
Chris@19 91 Tw = T7 * Tv;
Chris@19 92 TA = T8 * Tz;
Chris@19 93 Ty = T8 * Tx;
Chris@19 94 Te = Tc * Td;
Chris@19 95 Im[0] = FMA(Ta, Tr, Tw);
Chris@19 96 Im[WS(rs, 1)] = FMA(Tb, Tx, TA);
Chris@19 97 Ip[WS(rs, 1)] = FNMS(Tb, Tz, Ty);
Chris@19 98 To = Tg * Td;
Chris@19 99 Tn = Tj - Tm;
Chris@19 100 }
Chris@19 101 }
Chris@19 102 }
Chris@19 103 Rm[WS(rs, 1)] = FMA(Tc, Tn, To);
Chris@19 104 Rp[WS(rs, 1)] = FNMS(Tg, Tn, Te);
Chris@19 105 }
Chris@19 106 }
Chris@19 107 }
Chris@19 108
Chris@19 109 static const tw_instr twinstr[] = {
Chris@19 110 {TW_CEXP, 1, 1},
Chris@19 111 {TW_CEXP, 1, 3},
Chris@19 112 {TW_NEXT, 1, 0}
Chris@19 113 };
Chris@19 114
Chris@19 115 static const hc2c_desc desc = { 4, "hc2cb2_4", twinstr, &GENUS, {16, 8, 8, 0} };
Chris@19 116
Chris@19 117 void X(codelet_hc2cb2_4) (planner *p) {
Chris@19 118 X(khc2c_register) (p, hc2cb2_4, &desc, HC2C_VIA_RDFT);
Chris@19 119 }
Chris@19 120 #else /* HAVE_FMA */
Chris@19 121
Chris@19 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 */
Chris@19 123
Chris@19 124 /*
Chris@19 125 * This function contains 24 FP additions, 16 FP multiplications,
Chris@19 126 * (or, 16 additions, 8 multiplications, 8 fused multiply/add),
Chris@19 127 * 21 stack variables, 0 constants, and 16 memory accesses
Chris@19 128 */
Chris@19 129 #include "hc2cb.h"
Chris@19 130
Chris@19 131 static void hc2cb2_4(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@19 132 {
Chris@19 133 {
Chris@19 134 INT m;
Chris@19 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)) {
Chris@19 136 E T7, T9, T8, Ta, Tb, Td;
Chris@19 137 T7 = W[0];
Chris@19 138 T9 = W[1];
Chris@19 139 T8 = W[2];
Chris@19 140 Ta = W[3];
Chris@19 141 Tb = FMA(T7, T8, T9 * Ta);
Chris@19 142 Td = FNMS(T9, T8, T7 * Ta);
Chris@19 143 {
Chris@19 144 E T3, Tl, Tg, Tp, T6, To, Tj, Tm, Tc, Tk;
Chris@19 145 {
Chris@19 146 E T1, T2, Te, Tf;
Chris@19 147 T1 = Rp[0];
Chris@19 148 T2 = Rm[WS(rs, 1)];
Chris@19 149 T3 = T1 + T2;
Chris@19 150 Tl = T1 - T2;
Chris@19 151 Te = Ip[0];
Chris@19 152 Tf = Im[WS(rs, 1)];
Chris@19 153 Tg = Te - Tf;
Chris@19 154 Tp = Te + Tf;
Chris@19 155 }
Chris@19 156 {
Chris@19 157 E T4, T5, Th, Ti;
Chris@19 158 T4 = Rp[WS(rs, 1)];
Chris@19 159 T5 = Rm[0];
Chris@19 160 T6 = T4 + T5;
Chris@19 161 To = T4 - T5;
Chris@19 162 Th = Ip[WS(rs, 1)];
Chris@19 163 Ti = Im[0];
Chris@19 164 Tj = Th - Ti;
Chris@19 165 Tm = Th + Ti;
Chris@19 166 }
Chris@19 167 Rp[0] = T3 + T6;
Chris@19 168 Rm[0] = Tg + Tj;
Chris@19 169 Tc = T3 - T6;
Chris@19 170 Tk = Tg - Tj;
Chris@19 171 Rp[WS(rs, 1)] = FNMS(Td, Tk, Tb * Tc);
Chris@19 172 Rm[WS(rs, 1)] = FMA(Td, Tc, Tb * Tk);
Chris@19 173 {
Chris@19 174 E Tn, Tq, Tr, Ts;
Chris@19 175 Tn = Tl - Tm;
Chris@19 176 Tq = To + Tp;
Chris@19 177 Ip[0] = FNMS(T9, Tq, T7 * Tn);
Chris@19 178 Im[0] = FMA(T7, Tq, T9 * Tn);
Chris@19 179 Tr = Tl + Tm;
Chris@19 180 Ts = Tp - To;
Chris@19 181 Ip[WS(rs, 1)] = FNMS(Ta, Ts, T8 * Tr);
Chris@19 182 Im[WS(rs, 1)] = FMA(T8, Ts, Ta * Tr);
Chris@19 183 }
Chris@19 184 }
Chris@19 185 }
Chris@19 186 }
Chris@19 187 }
Chris@19 188
Chris@19 189 static const tw_instr twinstr[] = {
Chris@19 190 {TW_CEXP, 1, 1},
Chris@19 191 {TW_CEXP, 1, 3},
Chris@19 192 {TW_NEXT, 1, 0}
Chris@19 193 };
Chris@19 194
Chris@19 195 static const hc2c_desc desc = { 4, "hc2cb2_4", twinstr, &GENUS, {16, 8, 8, 0} };
Chris@19 196
Chris@19 197 void X(codelet_hc2cb2_4) (planner *p) {
Chris@19 198 X(khc2c_register) (p, hc2cb2_4, &desc, HC2C_VIA_RDFT);
Chris@19 199 }
Chris@19 200 #endif /* HAVE_FMA */