annotate fft/fftw/fftw-3.3.4/rdft/scalar/r2cb/hb_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:50:25 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_hc2hc.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -sign 1 -n 2 -dif -name hb_2 -include hb.h */
Chris@19 29
Chris@19 30 /*
Chris@19 31 * This function contains 6 FP additions, 4 FP multiplications,
Chris@19 32 * (or, 4 additions, 2 multiplications, 2 fused multiply/add),
Chris@19 33 * 11 stack variables, 0 constants, and 8 memory accesses
Chris@19 34 */
Chris@19 35 #include "hb.h"
Chris@19 36
Chris@19 37 static void hb_2(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@19 38 {
Chris@19 39 {
Chris@19 40 INT m;
Chris@19 41 for (m = mb, W = W + ((mb - 1) * 2); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 2, MAKE_VOLATILE_STRIDE(4, rs)) {
Chris@19 42 E T5, T6, T9, T8, T7, Ta;
Chris@19 43 {
Chris@19 44 E T1, T2, T3, T4;
Chris@19 45 T1 = cr[0];
Chris@19 46 T2 = ci[0];
Chris@19 47 T3 = ci[WS(rs, 1)];
Chris@19 48 T4 = cr[WS(rs, 1)];
Chris@19 49 T5 = W[0];
Chris@19 50 cr[0] = T1 + T2;
Chris@19 51 T6 = T1 - T2;
Chris@19 52 ci[0] = T3 - T4;
Chris@19 53 T9 = T3 + T4;
Chris@19 54 T8 = W[1];
Chris@19 55 T7 = T5 * T6;
Chris@19 56 }
Chris@19 57 Ta = T8 * T6;
Chris@19 58 cr[WS(rs, 1)] = FNMS(T8, T9, T7);
Chris@19 59 ci[WS(rs, 1)] = FMA(T5, T9, Ta);
Chris@19 60 }
Chris@19 61 }
Chris@19 62 }
Chris@19 63
Chris@19 64 static const tw_instr twinstr[] = {
Chris@19 65 {TW_FULL, 1, 2},
Chris@19 66 {TW_NEXT, 1, 0}
Chris@19 67 };
Chris@19 68
Chris@19 69 static const hc2hc_desc desc = { 2, "hb_2", twinstr, &GENUS, {4, 2, 2, 0} };
Chris@19 70
Chris@19 71 void X(codelet_hb_2) (planner *p) {
Chris@19 72 X(khc2hc_register) (p, hb_2, &desc);
Chris@19 73 }
Chris@19 74 #else /* HAVE_FMA */
Chris@19 75
Chris@19 76 /* Generated by: ../../../genfft/gen_hc2hc.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 2 -dif -name hb_2 -include hb.h */
Chris@19 77
Chris@19 78 /*
Chris@19 79 * This function contains 6 FP additions, 4 FP multiplications,
Chris@19 80 * (or, 4 additions, 2 multiplications, 2 fused multiply/add),
Chris@19 81 * 9 stack variables, 0 constants, and 8 memory accesses
Chris@19 82 */
Chris@19 83 #include "hb.h"
Chris@19 84
Chris@19 85 static void hb_2(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@19 86 {
Chris@19 87 {
Chris@19 88 INT m;
Chris@19 89 for (m = mb, W = W + ((mb - 1) * 2); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 2, MAKE_VOLATILE_STRIDE(4, rs)) {
Chris@19 90 E T1, T2, T6, T3, T4, T8, T5, T7;
Chris@19 91 T1 = cr[0];
Chris@19 92 T2 = ci[0];
Chris@19 93 T6 = T1 - T2;
Chris@19 94 T3 = ci[WS(rs, 1)];
Chris@19 95 T4 = cr[WS(rs, 1)];
Chris@19 96 T8 = T3 + T4;
Chris@19 97 cr[0] = T1 + T2;
Chris@19 98 ci[0] = T3 - T4;
Chris@19 99 T5 = W[0];
Chris@19 100 T7 = W[1];
Chris@19 101 cr[WS(rs, 1)] = FNMS(T7, T8, T5 * T6);
Chris@19 102 ci[WS(rs, 1)] = FMA(T7, T6, T5 * T8);
Chris@19 103 }
Chris@19 104 }
Chris@19 105 }
Chris@19 106
Chris@19 107 static const tw_instr twinstr[] = {
Chris@19 108 {TW_FULL, 1, 2},
Chris@19 109 {TW_NEXT, 1, 0}
Chris@19 110 };
Chris@19 111
Chris@19 112 static const hc2hc_desc desc = { 2, "hb_2", twinstr, &GENUS, {4, 2, 2, 0} };
Chris@19 113
Chris@19 114 void X(codelet_hb_2) (planner *p) {
Chris@19 115 X(khc2hc_register) (p, hb_2, &desc);
Chris@19 116 }
Chris@19 117 #endif /* HAVE_FMA */