annotate fft/fftw/fftw-3.3.4/rdft/scalar/r2cf/r2cf_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:49:07 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 8 -name r2cf_8 -include r2cf.h */
Chris@19 29
Chris@19 30 /*
Chris@19 31 * This function contains 20 FP additions, 4 FP multiplications,
Chris@19 32 * (or, 16 additions, 0 multiplications, 4 fused multiply/add),
Chris@19 33 * 18 stack variables, 1 constants, and 16 memory accesses
Chris@19 34 */
Chris@19 35 #include "r2cf.h"
Chris@19 36
Chris@19 37 static void r2cf_8(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(KP707106781, +0.707106781186547524400844362104849039284835938);
Chris@19 40 {
Chris@19 41 INT i;
Chris@19 42 for (i = v; i > 0; i = i - 1, R0 = R0 + ivs, R1 = R1 + ivs, Cr = Cr + ovs, Ci = Ci + ovs, MAKE_VOLATILE_STRIDE(32, rs), MAKE_VOLATILE_STRIDE(32, csr), MAKE_VOLATILE_STRIDE(32, csi)) {
Chris@19 43 E T4, T7, T3, Tj, Td, T5, T8, T9;
Chris@19 44 {
Chris@19 45 E T1, T2, Tb, Tc;
Chris@19 46 T1 = R0[0];
Chris@19 47 T2 = R0[WS(rs, 2)];
Chris@19 48 Tb = R1[WS(rs, 3)];
Chris@19 49 Tc = R1[WS(rs, 1)];
Chris@19 50 T4 = R0[WS(rs, 1)];
Chris@19 51 T7 = T1 - T2;
Chris@19 52 T3 = T1 + T2;
Chris@19 53 Tj = Tb + Tc;
Chris@19 54 Td = Tb - Tc;
Chris@19 55 T5 = R0[WS(rs, 3)];
Chris@19 56 T8 = R1[0];
Chris@19 57 T9 = R1[WS(rs, 2)];
Chris@19 58 }
Chris@19 59 {
Chris@19 60 E T6, Tf, Ta, Ti;
Chris@19 61 T6 = T4 + T5;
Chris@19 62 Tf = T4 - T5;
Chris@19 63 Ta = T8 - T9;
Chris@19 64 Ti = T8 + T9;
Chris@19 65 {
Chris@19 66 E Th, Tk, Te, Tg;
Chris@19 67 Th = T3 + T6;
Chris@19 68 Cr[WS(csr, 2)] = T3 - T6;
Chris@19 69 Tk = Ti + Tj;
Chris@19 70 Ci[WS(csi, 2)] = Tj - Ti;
Chris@19 71 Te = Ta + Td;
Chris@19 72 Tg = Td - Ta;
Chris@19 73 Cr[0] = Th + Tk;
Chris@19 74 Cr[WS(csr, 4)] = Th - Tk;
Chris@19 75 Ci[WS(csi, 3)] = FMA(KP707106781, Tg, Tf);
Chris@19 76 Ci[WS(csi, 1)] = FMS(KP707106781, Tg, Tf);
Chris@19 77 Cr[WS(csr, 1)] = FMA(KP707106781, Te, T7);
Chris@19 78 Cr[WS(csr, 3)] = FNMS(KP707106781, Te, T7);
Chris@19 79 }
Chris@19 80 }
Chris@19 81 }
Chris@19 82 }
Chris@19 83 }
Chris@19 84
Chris@19 85 static const kr2c_desc desc = { 8, "r2cf_8", {16, 0, 4, 0}, &GENUS };
Chris@19 86
Chris@19 87 void X(codelet_r2cf_8) (planner *p) {
Chris@19 88 X(kr2c_register) (p, r2cf_8, &desc);
Chris@19 89 }
Chris@19 90
Chris@19 91 #else /* HAVE_FMA */
Chris@19 92
Chris@19 93 /* Generated by: ../../../genfft/gen_r2cf.native -compact -variables 4 -pipeline-latency 4 -n 8 -name r2cf_8 -include r2cf.h */
Chris@19 94
Chris@19 95 /*
Chris@19 96 * This function contains 20 FP additions, 2 FP multiplications,
Chris@19 97 * (or, 20 additions, 2 multiplications, 0 fused multiply/add),
Chris@19 98 * 14 stack variables, 1 constants, and 16 memory accesses
Chris@19 99 */
Chris@19 100 #include "r2cf.h"
Chris@19 101
Chris@19 102 static void r2cf_8(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
Chris@19 103 {
Chris@19 104 DK(KP707106781, +0.707106781186547524400844362104849039284835938);
Chris@19 105 {
Chris@19 106 INT i;
Chris@19 107 for (i = v; i > 0; i = i - 1, R0 = R0 + ivs, R1 = R1 + ivs, Cr = Cr + ovs, Ci = Ci + ovs, MAKE_VOLATILE_STRIDE(32, rs), MAKE_VOLATILE_STRIDE(32, csr), MAKE_VOLATILE_STRIDE(32, csi)) {
Chris@19 108 E T3, T7, Td, Tj, T6, Tg, Ta, Ti;
Chris@19 109 {
Chris@19 110 E T1, T2, Tb, Tc;
Chris@19 111 T1 = R0[0];
Chris@19 112 T2 = R0[WS(rs, 2)];
Chris@19 113 T3 = T1 + T2;
Chris@19 114 T7 = T1 - T2;
Chris@19 115 Tb = R1[WS(rs, 3)];
Chris@19 116 Tc = R1[WS(rs, 1)];
Chris@19 117 Td = Tb - Tc;
Chris@19 118 Tj = Tb + Tc;
Chris@19 119 }
Chris@19 120 {
Chris@19 121 E T4, T5, T8, T9;
Chris@19 122 T4 = R0[WS(rs, 1)];
Chris@19 123 T5 = R0[WS(rs, 3)];
Chris@19 124 T6 = T4 + T5;
Chris@19 125 Tg = T4 - T5;
Chris@19 126 T8 = R1[0];
Chris@19 127 T9 = R1[WS(rs, 2)];
Chris@19 128 Ta = T8 - T9;
Chris@19 129 Ti = T8 + T9;
Chris@19 130 }
Chris@19 131 Cr[WS(csr, 2)] = T3 - T6;
Chris@19 132 Ci[WS(csi, 2)] = Tj - Ti;
Chris@19 133 {
Chris@19 134 E Te, Tf, Th, Tk;
Chris@19 135 Te = KP707106781 * (Ta + Td);
Chris@19 136 Cr[WS(csr, 3)] = T7 - Te;
Chris@19 137 Cr[WS(csr, 1)] = T7 + Te;
Chris@19 138 Tf = KP707106781 * (Td - Ta);
Chris@19 139 Ci[WS(csi, 1)] = Tf - Tg;
Chris@19 140 Ci[WS(csi, 3)] = Tg + Tf;
Chris@19 141 Th = T3 + T6;
Chris@19 142 Tk = Ti + Tj;
Chris@19 143 Cr[WS(csr, 4)] = Th - Tk;
Chris@19 144 Cr[0] = Th + Tk;
Chris@19 145 }
Chris@19 146 }
Chris@19 147 }
Chris@19 148 }
Chris@19 149
Chris@19 150 static const kr2c_desc desc = { 8, "r2cf_8", {20, 2, 0, 0}, &GENUS };
Chris@19 151
Chris@19 152 void X(codelet_r2cf_8) (planner *p) {
Chris@19 153 X(kr2c_register) (p, r2cf_8, &desc);
Chris@19 154 }
Chris@19 155
Chris@19 156 #endif /* HAVE_FMA */