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