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