annotate fft/fftw/fftw-3.3.4/dft/scalar/codelets/n1_8.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:48 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_notw.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 8 -name n1_8 -include n.h */
Chris@19 29
Chris@19 30 /*
Chris@19 31 * This function contains 52 FP additions, 8 FP multiplications,
Chris@19 32 * (or, 44 additions, 0 multiplications, 8 fused multiply/add),
Chris@19 33 * 36 stack variables, 1 constants, and 32 memory accesses
Chris@19 34 */
Chris@19 35 #include "n.h"
Chris@19 36
Chris@19 37 static void n1_8(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@19 38 {
Chris@19 39 DK(KP707106781, +0.707106781186547524400844362104849039284835938);
Chris@19 40 {
Chris@19 41 INT i;
Chris@19 42 for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(32, is), MAKE_VOLATILE_STRIDE(32, os)) {
Chris@19 43 E TF, TE, TD, TI;
Chris@19 44 {
Chris@19 45 E Tn, T3, TC, Ti, TB, T6, To, Tl, Td, TN, Tz, TH, Ta, Tq, Tt;
Chris@19 46 E TM;
Chris@19 47 {
Chris@19 48 E T4, T5, Tj, Tk;
Chris@19 49 {
Chris@19 50 E T1, T2, Tg, Th;
Chris@19 51 T1 = ri[0];
Chris@19 52 T2 = ri[WS(is, 4)];
Chris@19 53 Tg = ii[0];
Chris@19 54 Th = ii[WS(is, 4)];
Chris@19 55 T4 = ri[WS(is, 2)];
Chris@19 56 Tn = T1 - T2;
Chris@19 57 T3 = T1 + T2;
Chris@19 58 TC = Tg - Th;
Chris@19 59 Ti = Tg + Th;
Chris@19 60 T5 = ri[WS(is, 6)];
Chris@19 61 }
Chris@19 62 Tj = ii[WS(is, 2)];
Chris@19 63 Tk = ii[WS(is, 6)];
Chris@19 64 {
Chris@19 65 E Tb, Tc, Tw, Tx;
Chris@19 66 Tb = ri[WS(is, 7)];
Chris@19 67 TB = T4 - T5;
Chris@19 68 T6 = T4 + T5;
Chris@19 69 To = Tj - Tk;
Chris@19 70 Tl = Tj + Tk;
Chris@19 71 Tc = ri[WS(is, 3)];
Chris@19 72 Tw = ii[WS(is, 7)];
Chris@19 73 Tx = ii[WS(is, 3)];
Chris@19 74 {
Chris@19 75 E T8, Tv, Ty, T9, Tr, Ts;
Chris@19 76 T8 = ri[WS(is, 1)];
Chris@19 77 Td = Tb + Tc;
Chris@19 78 Tv = Tb - Tc;
Chris@19 79 TN = Tw + Tx;
Chris@19 80 Ty = Tw - Tx;
Chris@19 81 T9 = ri[WS(is, 5)];
Chris@19 82 Tr = ii[WS(is, 1)];
Chris@19 83 Ts = ii[WS(is, 5)];
Chris@19 84 Tz = Tv - Ty;
Chris@19 85 TH = Tv + Ty;
Chris@19 86 Ta = T8 + T9;
Chris@19 87 Tq = T8 - T9;
Chris@19 88 Tt = Tr - Ts;
Chris@19 89 TM = Tr + Ts;
Chris@19 90 }
Chris@19 91 }
Chris@19 92 }
Chris@19 93 {
Chris@19 94 E TL, TG, Tu, Tf, Tm, TO;
Chris@19 95 {
Chris@19 96 E T7, Te, TP, TQ;
Chris@19 97 TL = T3 - T6;
Chris@19 98 T7 = T3 + T6;
Chris@19 99 TG = Tt - Tq;
Chris@19 100 Tu = Tq + Tt;
Chris@19 101 Te = Ta + Td;
Chris@19 102 Tf = Td - Ta;
Chris@19 103 Tm = Ti - Tl;
Chris@19 104 TP = Ti + Tl;
Chris@19 105 TQ = TM + TN;
Chris@19 106 TO = TM - TN;
Chris@19 107 ro[0] = T7 + Te;
Chris@19 108 ro[WS(os, 4)] = T7 - Te;
Chris@19 109 io[0] = TP + TQ;
Chris@19 110 io[WS(os, 4)] = TP - TQ;
Chris@19 111 }
Chris@19 112 {
Chris@19 113 E Tp, TA, TJ, TK;
Chris@19 114 TF = Tn - To;
Chris@19 115 Tp = Tn + To;
Chris@19 116 io[WS(os, 6)] = Tm - Tf;
Chris@19 117 io[WS(os, 2)] = Tf + Tm;
Chris@19 118 ro[WS(os, 2)] = TL + TO;
Chris@19 119 ro[WS(os, 6)] = TL - TO;
Chris@19 120 TA = Tu + Tz;
Chris@19 121 TE = Tz - Tu;
Chris@19 122 TD = TB + TC;
Chris@19 123 TJ = TC - TB;
Chris@19 124 TK = TG + TH;
Chris@19 125 TI = TG - TH;
Chris@19 126 ro[WS(os, 1)] = FMA(KP707106781, TA, Tp);
Chris@19 127 ro[WS(os, 5)] = FNMS(KP707106781, TA, Tp);
Chris@19 128 io[WS(os, 1)] = FMA(KP707106781, TK, TJ);
Chris@19 129 io[WS(os, 5)] = FNMS(KP707106781, TK, TJ);
Chris@19 130 }
Chris@19 131 }
Chris@19 132 }
Chris@19 133 io[WS(os, 3)] = FMA(KP707106781, TE, TD);
Chris@19 134 io[WS(os, 7)] = FNMS(KP707106781, TE, TD);
Chris@19 135 ro[WS(os, 3)] = FMA(KP707106781, TI, TF);
Chris@19 136 ro[WS(os, 7)] = FNMS(KP707106781, TI, TF);
Chris@19 137 }
Chris@19 138 }
Chris@19 139 }
Chris@19 140
Chris@19 141 static const kdft_desc desc = { 8, "n1_8", {44, 0, 8, 0}, &GENUS, 0, 0, 0, 0 };
Chris@19 142
Chris@19 143 void X(codelet_n1_8) (planner *p) {
Chris@19 144 X(kdft_register) (p, n1_8, &desc);
Chris@19 145 }
Chris@19 146
Chris@19 147 #else /* HAVE_FMA */
Chris@19 148
Chris@19 149 /* Generated by: ../../../genfft/gen_notw.native -compact -variables 4 -pipeline-latency 4 -n 8 -name n1_8 -include n.h */
Chris@19 150
Chris@19 151 /*
Chris@19 152 * This function contains 52 FP additions, 4 FP multiplications,
Chris@19 153 * (or, 52 additions, 4 multiplications, 0 fused multiply/add),
Chris@19 154 * 28 stack variables, 1 constants, and 32 memory accesses
Chris@19 155 */
Chris@19 156 #include "n.h"
Chris@19 157
Chris@19 158 static void n1_8(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@19 159 {
Chris@19 160 DK(KP707106781, +0.707106781186547524400844362104849039284835938);
Chris@19 161 {
Chris@19 162 INT i;
Chris@19 163 for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(32, is), MAKE_VOLATILE_STRIDE(32, os)) {
Chris@19 164 E T3, Tn, Ti, TC, T6, TB, Tl, To, Td, TN, Tz, TH, Ta, TM, Tu;
Chris@19 165 E TG;
Chris@19 166 {
Chris@19 167 E T1, T2, Tj, Tk;
Chris@19 168 T1 = ri[0];
Chris@19 169 T2 = ri[WS(is, 4)];
Chris@19 170 T3 = T1 + T2;
Chris@19 171 Tn = T1 - T2;
Chris@19 172 {
Chris@19 173 E Tg, Th, T4, T5;
Chris@19 174 Tg = ii[0];
Chris@19 175 Th = ii[WS(is, 4)];
Chris@19 176 Ti = Tg + Th;
Chris@19 177 TC = Tg - Th;
Chris@19 178 T4 = ri[WS(is, 2)];
Chris@19 179 T5 = ri[WS(is, 6)];
Chris@19 180 T6 = T4 + T5;
Chris@19 181 TB = T4 - T5;
Chris@19 182 }
Chris@19 183 Tj = ii[WS(is, 2)];
Chris@19 184 Tk = ii[WS(is, 6)];
Chris@19 185 Tl = Tj + Tk;
Chris@19 186 To = Tj - Tk;
Chris@19 187 {
Chris@19 188 E Tb, Tc, Tv, Tw, Tx, Ty;
Chris@19 189 Tb = ri[WS(is, 7)];
Chris@19 190 Tc = ri[WS(is, 3)];
Chris@19 191 Tv = Tb - Tc;
Chris@19 192 Tw = ii[WS(is, 7)];
Chris@19 193 Tx = ii[WS(is, 3)];
Chris@19 194 Ty = Tw - Tx;
Chris@19 195 Td = Tb + Tc;
Chris@19 196 TN = Tw + Tx;
Chris@19 197 Tz = Tv - Ty;
Chris@19 198 TH = Tv + Ty;
Chris@19 199 }
Chris@19 200 {
Chris@19 201 E T8, T9, Tq, Tr, Ts, Tt;
Chris@19 202 T8 = ri[WS(is, 1)];
Chris@19 203 T9 = ri[WS(is, 5)];
Chris@19 204 Tq = T8 - T9;
Chris@19 205 Tr = ii[WS(is, 1)];
Chris@19 206 Ts = ii[WS(is, 5)];
Chris@19 207 Tt = Tr - Ts;
Chris@19 208 Ta = T8 + T9;
Chris@19 209 TM = Tr + Ts;
Chris@19 210 Tu = Tq + Tt;
Chris@19 211 TG = Tt - Tq;
Chris@19 212 }
Chris@19 213 }
Chris@19 214 {
Chris@19 215 E T7, Te, TP, TQ;
Chris@19 216 T7 = T3 + T6;
Chris@19 217 Te = Ta + Td;
Chris@19 218 ro[WS(os, 4)] = T7 - Te;
Chris@19 219 ro[0] = T7 + Te;
Chris@19 220 TP = Ti + Tl;
Chris@19 221 TQ = TM + TN;
Chris@19 222 io[WS(os, 4)] = TP - TQ;
Chris@19 223 io[0] = TP + TQ;
Chris@19 224 }
Chris@19 225 {
Chris@19 226 E Tf, Tm, TL, TO;
Chris@19 227 Tf = Td - Ta;
Chris@19 228 Tm = Ti - Tl;
Chris@19 229 io[WS(os, 2)] = Tf + Tm;
Chris@19 230 io[WS(os, 6)] = Tm - Tf;
Chris@19 231 TL = T3 - T6;
Chris@19 232 TO = TM - TN;
Chris@19 233 ro[WS(os, 6)] = TL - TO;
Chris@19 234 ro[WS(os, 2)] = TL + TO;
Chris@19 235 }
Chris@19 236 {
Chris@19 237 E Tp, TA, TJ, TK;
Chris@19 238 Tp = Tn + To;
Chris@19 239 TA = KP707106781 * (Tu + Tz);
Chris@19 240 ro[WS(os, 5)] = Tp - TA;
Chris@19 241 ro[WS(os, 1)] = Tp + TA;
Chris@19 242 TJ = TC - TB;
Chris@19 243 TK = KP707106781 * (TG + TH);
Chris@19 244 io[WS(os, 5)] = TJ - TK;
Chris@19 245 io[WS(os, 1)] = TJ + TK;
Chris@19 246 }
Chris@19 247 {
Chris@19 248 E TD, TE, TF, TI;
Chris@19 249 TD = TB + TC;
Chris@19 250 TE = KP707106781 * (Tz - Tu);
Chris@19 251 io[WS(os, 7)] = TD - TE;
Chris@19 252 io[WS(os, 3)] = TD + TE;
Chris@19 253 TF = Tn - To;
Chris@19 254 TI = KP707106781 * (TG - TH);
Chris@19 255 ro[WS(os, 7)] = TF - TI;
Chris@19 256 ro[WS(os, 3)] = TF + TI;
Chris@19 257 }
Chris@19 258 }
Chris@19 259 }
Chris@19 260 }
Chris@19 261
Chris@19 262 static const kdft_desc desc = { 8, "n1_8", {52, 4, 0, 0}, &GENUS, 0, 0, 0, 0 };
Chris@19 263
Chris@19 264 void X(codelet_n1_8) (planner *p) {
Chris@19 265 X(kdft_register) (p, n1_8, &desc);
Chris@19 266 }
Chris@19 267
Chris@19 268 #endif /* HAVE_FMA */