annotate fft/fftw/fftw-3.3.4/rdft/scalar/r2cb/r2cb_5.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:24 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_r2cb.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -sign 1 -n 5 -name r2cb_5 -include r2cb.h */
Chris@19 29
Chris@19 30 /*
Chris@19 31 * This function contains 12 FP additions, 10 FP multiplications,
Chris@19 32 * (or, 2 additions, 0 multiplications, 10 fused multiply/add),
Chris@19 33 * 18 stack variables, 5 constants, and 10 memory accesses
Chris@19 34 */
Chris@19 35 #include "r2cb.h"
Chris@19 36
Chris@19 37 static void r2cb_5(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
Chris@19 38 {
Chris@19 39 DK(KP1_902113032, +1.902113032590307144232878666758764286811397268);
Chris@19 40 DK(KP1_118033988, +1.118033988749894848204586834365638117720309180);
Chris@19 41 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@19 42 DK(KP2_000000000, +2.000000000000000000000000000000000000000000000);
Chris@19 43 DK(KP618033988, +0.618033988749894848204586834365638117720309180);
Chris@19 44 {
Chris@19 45 INT i;
Chris@19 46 for (i = v; i > 0; i = i - 1, R0 = R0 + ovs, R1 = R1 + ovs, Cr = Cr + ivs, Ci = Ci + ivs, MAKE_VOLATILE_STRIDE(20, rs), MAKE_VOLATILE_STRIDE(20, csr), MAKE_VOLATILE_STRIDE(20, csi)) {
Chris@19 47 E T1, T2, T3, Tc, Ta, T8, T9;
Chris@19 48 T8 = Ci[WS(csi, 1)];
Chris@19 49 T9 = Ci[WS(csi, 2)];
Chris@19 50 T1 = Cr[0];
Chris@19 51 T2 = Cr[WS(csr, 1)];
Chris@19 52 T3 = Cr[WS(csr, 2)];
Chris@19 53 Tc = FMS(KP618033988, T8, T9);
Chris@19 54 Ta = FMA(KP618033988, T9, T8);
Chris@19 55 {
Chris@19 56 E T6, T4, T5, T7, Tb;
Chris@19 57 T6 = T2 - T3;
Chris@19 58 T4 = T2 + T3;
Chris@19 59 R0[0] = FMA(KP2_000000000, T4, T1);
Chris@19 60 T5 = FNMS(KP500000000, T4, T1);
Chris@19 61 T7 = FMA(KP1_118033988, T6, T5);
Chris@19 62 Tb = FNMS(KP1_118033988, T6, T5);
Chris@19 63 R0[WS(rs, 2)] = FMA(KP1_902113032, Ta, T7);
Chris@19 64 R1[0] = FNMS(KP1_902113032, Ta, T7);
Chris@19 65 R1[WS(rs, 1)] = FMA(KP1_902113032, Tc, Tb);
Chris@19 66 R0[WS(rs, 1)] = FNMS(KP1_902113032, Tc, Tb);
Chris@19 67 }
Chris@19 68 }
Chris@19 69 }
Chris@19 70 }
Chris@19 71
Chris@19 72 static const kr2c_desc desc = { 5, "r2cb_5", {2, 0, 10, 0}, &GENUS };
Chris@19 73
Chris@19 74 void X(codelet_r2cb_5) (planner *p) {
Chris@19 75 X(kr2c_register) (p, r2cb_5, &desc);
Chris@19 76 }
Chris@19 77
Chris@19 78 #else /* HAVE_FMA */
Chris@19 79
Chris@19 80 /* Generated by: ../../../genfft/gen_r2cb.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 5 -name r2cb_5 -include r2cb.h */
Chris@19 81
Chris@19 82 /*
Chris@19 83 * This function contains 12 FP additions, 7 FP multiplications,
Chris@19 84 * (or, 8 additions, 3 multiplications, 4 fused multiply/add),
Chris@19 85 * 18 stack variables, 5 constants, and 10 memory accesses
Chris@19 86 */
Chris@19 87 #include "r2cb.h"
Chris@19 88
Chris@19 89 static void r2cb_5(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
Chris@19 90 {
Chris@19 91 DK(KP2_000000000, +2.000000000000000000000000000000000000000000000);
Chris@19 92 DK(KP1_118033988, +1.118033988749894848204586834365638117720309180);
Chris@19 93 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@19 94 DK(KP1_902113032, +1.902113032590307144232878666758764286811397268);
Chris@19 95 DK(KP1_175570504, +1.175570504584946258337411909278145537195304875);
Chris@19 96 {
Chris@19 97 INT i;
Chris@19 98 for (i = v; i > 0; i = i - 1, R0 = R0 + ovs, R1 = R1 + ovs, Cr = Cr + ivs, Ci = Ci + ivs, MAKE_VOLATILE_STRIDE(20, rs), MAKE_VOLATILE_STRIDE(20, csr), MAKE_VOLATILE_STRIDE(20, csi)) {
Chris@19 99 E Ta, Tc, T1, T4, T5, T6, Tb, T7;
Chris@19 100 {
Chris@19 101 E T8, T9, T2, T3;
Chris@19 102 T8 = Ci[WS(csi, 1)];
Chris@19 103 T9 = Ci[WS(csi, 2)];
Chris@19 104 Ta = FNMS(KP1_902113032, T9, KP1_175570504 * T8);
Chris@19 105 Tc = FMA(KP1_902113032, T8, KP1_175570504 * T9);
Chris@19 106 T1 = Cr[0];
Chris@19 107 T2 = Cr[WS(csr, 1)];
Chris@19 108 T3 = Cr[WS(csr, 2)];
Chris@19 109 T4 = T2 + T3;
Chris@19 110 T5 = FNMS(KP500000000, T4, T1);
Chris@19 111 T6 = KP1_118033988 * (T2 - T3);
Chris@19 112 }
Chris@19 113 R0[0] = FMA(KP2_000000000, T4, T1);
Chris@19 114 Tb = T6 + T5;
Chris@19 115 R1[0] = Tb - Tc;
Chris@19 116 R0[WS(rs, 2)] = Tb + Tc;
Chris@19 117 T7 = T5 - T6;
Chris@19 118 R0[WS(rs, 1)] = T7 - Ta;
Chris@19 119 R1[WS(rs, 1)] = T7 + Ta;
Chris@19 120 }
Chris@19 121 }
Chris@19 122 }
Chris@19 123
Chris@19 124 static const kr2c_desc desc = { 5, "r2cb_5", {8, 3, 4, 0}, &GENUS };
Chris@19 125
Chris@19 126 void X(codelet_r2cb_5) (planner *p) {
Chris@19 127 X(kr2c_register) (p, r2cb_5, &desc);
Chris@19 128 }
Chris@19 129
Chris@19 130 #endif /* HAVE_FMA */