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