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