annotate fft/fftw/fftw-3.3.4/rdft/scalar/r2cf/hc2cfdft_2.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:27 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_hc2cdft.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 2 -dit -name hc2cfdft_2 -include hc2cf.h */
Chris@19 29
Chris@19 30 /*
Chris@19 31 * This function contains 10 FP additions, 8 FP multiplications,
Chris@19 32 * (or, 8 additions, 6 multiplications, 2 fused multiply/add),
Chris@19 33 * 12 stack variables, 1 constants, and 8 memory accesses
Chris@19 34 */
Chris@19 35 #include "hc2cf.h"
Chris@19 36
Chris@19 37 static void hc2cfdft_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@19 38 {
Chris@19 39 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@19 40 {
Chris@19 41 INT m;
Chris@19 42 for (m = mb, W = W + ((mb - 1) * 2); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 2, MAKE_VOLATILE_STRIDE(8, rs)) {
Chris@19 43 E T9, Ta, T3, Tc, T7, T4;
Chris@19 44 {
Chris@19 45 E T1, T2, T5, T6;
Chris@19 46 T1 = Ip[0];
Chris@19 47 T2 = Im[0];
Chris@19 48 T5 = Rm[0];
Chris@19 49 T6 = Rp[0];
Chris@19 50 T9 = W[1];
Chris@19 51 Ta = T1 + T2;
Chris@19 52 T3 = T1 - T2;
Chris@19 53 Tc = T6 + T5;
Chris@19 54 T7 = T5 - T6;
Chris@19 55 T4 = W[0];
Chris@19 56 }
Chris@19 57 {
Chris@19 58 E Td, T8, Te, Tb;
Chris@19 59 Td = T9 * T7;
Chris@19 60 T8 = T4 * T7;
Chris@19 61 Te = FMA(T4, Ta, Td);
Chris@19 62 Tb = FNMS(T9, Ta, T8);
Chris@19 63 Rp[0] = KP500000000 * (Tc + Te);
Chris@19 64 Rm[0] = KP500000000 * (Tc - Te);
Chris@19 65 Im[0] = KP500000000 * (Tb - T3);
Chris@19 66 Ip[0] = KP500000000 * (T3 + Tb);
Chris@19 67 }
Chris@19 68 }
Chris@19 69 }
Chris@19 70 }
Chris@19 71
Chris@19 72 static const tw_instr twinstr[] = {
Chris@19 73 {TW_FULL, 1, 2},
Chris@19 74 {TW_NEXT, 1, 0}
Chris@19 75 };
Chris@19 76
Chris@19 77 static const hc2c_desc desc = { 2, "hc2cfdft_2", twinstr, &GENUS, {8, 6, 2, 0} };
Chris@19 78
Chris@19 79 void X(codelet_hc2cfdft_2) (planner *p) {
Chris@19 80 X(khc2c_register) (p, hc2cfdft_2, &desc, HC2C_VIA_DFT);
Chris@19 81 }
Chris@19 82 #else /* HAVE_FMA */
Chris@19 83
Chris@19 84 /* Generated by: ../../../genfft/gen_hc2cdft.native -compact -variables 4 -pipeline-latency 4 -n 2 -dit -name hc2cfdft_2 -include hc2cf.h */
Chris@19 85
Chris@19 86 /*
Chris@19 87 * This function contains 10 FP additions, 8 FP multiplications,
Chris@19 88 * (or, 8 additions, 6 multiplications, 2 fused multiply/add),
Chris@19 89 * 10 stack variables, 1 constants, and 8 memory accesses
Chris@19 90 */
Chris@19 91 #include "hc2cf.h"
Chris@19 92
Chris@19 93 static void hc2cfdft_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@19 94 {
Chris@19 95 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@19 96 {
Chris@19 97 INT m;
Chris@19 98 for (m = mb, W = W + ((mb - 1) * 2); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 2, MAKE_VOLATILE_STRIDE(8, rs)) {
Chris@19 99 E T3, T9, T7, Tb;
Chris@19 100 {
Chris@19 101 E T1, T2, T5, T6;
Chris@19 102 T1 = Ip[0];
Chris@19 103 T2 = Im[0];
Chris@19 104 T3 = T1 - T2;
Chris@19 105 T9 = T1 + T2;
Chris@19 106 T5 = Rm[0];
Chris@19 107 T6 = Rp[0];
Chris@19 108 T7 = T5 - T6;
Chris@19 109 Tb = T6 + T5;
Chris@19 110 }
Chris@19 111 {
Chris@19 112 E Ta, Tc, T4, T8;
Chris@19 113 T4 = W[0];
Chris@19 114 T8 = W[1];
Chris@19 115 Ta = FNMS(T8, T9, T4 * T7);
Chris@19 116 Tc = FMA(T8, T7, T4 * T9);
Chris@19 117 Ip[0] = KP500000000 * (T3 + Ta);
Chris@19 118 Rp[0] = KP500000000 * (Tb + Tc);
Chris@19 119 Im[0] = KP500000000 * (Ta - T3);
Chris@19 120 Rm[0] = KP500000000 * (Tb - Tc);
Chris@19 121 }
Chris@19 122 }
Chris@19 123 }
Chris@19 124 }
Chris@19 125
Chris@19 126 static const tw_instr twinstr[] = {
Chris@19 127 {TW_FULL, 1, 2},
Chris@19 128 {TW_NEXT, 1, 0}
Chris@19 129 };
Chris@19 130
Chris@19 131 static const hc2c_desc desc = { 2, "hc2cfdft_2", twinstr, &GENUS, {8, 6, 2, 0} };
Chris@19 132
Chris@19 133 void X(codelet_hc2cfdft_2) (planner *p) {
Chris@19 134 X(khc2c_register) (p, hc2cfdft_2, &desc, HC2C_VIA_DFT);
Chris@19 135 }
Chris@19 136 #endif /* HAVE_FMA */