annotate src/fftw-3.3.3/rdft/scalar/r2cf/hf_3.c @ 23:619f715526df sv_v2.1

Update Vamp plugin SDK to 2.5
author Chris Cannam
date Thu, 09 May 2013 10:52:46 +0100
parents 37bf6b4a2645
children
rev   line source
Chris@10 1 /*
Chris@10 2 * Copyright (c) 2003, 2007-11 Matteo Frigo
Chris@10 3 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
Chris@10 4 *
Chris@10 5 * This program is free software; you can redistribute it and/or modify
Chris@10 6 * it under the terms of the GNU General Public License as published by
Chris@10 7 * the Free Software Foundation; either version 2 of the License, or
Chris@10 8 * (at your option) any later version.
Chris@10 9 *
Chris@10 10 * This program is distributed in the hope that it will be useful,
Chris@10 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@10 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@10 13 * GNU General Public License for more details.
Chris@10 14 *
Chris@10 15 * You should have received a copy of the GNU General Public License
Chris@10 16 * along with this program; if not, write to the Free Software
Chris@10 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@10 18 *
Chris@10 19 */
Chris@10 20
Chris@10 21 /* This file was automatically generated --- DO NOT EDIT */
Chris@10 22 /* Generated on Sun Nov 25 07:39:49 EST 2012 */
Chris@10 23
Chris@10 24 #include "codelet-rdft.h"
Chris@10 25
Chris@10 26 #ifdef HAVE_FMA
Chris@10 27
Chris@10 28 /* Generated by: ../../../genfft/gen_hc2hc.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 3 -dit -name hf_3 -include hf.h */
Chris@10 29
Chris@10 30 /*
Chris@10 31 * This function contains 16 FP additions, 14 FP multiplications,
Chris@10 32 * (or, 6 additions, 4 multiplications, 10 fused multiply/add),
Chris@10 33 * 21 stack variables, 2 constants, and 12 memory accesses
Chris@10 34 */
Chris@10 35 #include "hf.h"
Chris@10 36
Chris@10 37 static void hf_3(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@10 38 {
Chris@10 39 DK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@10 40 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@10 41 {
Chris@10 42 INT m;
Chris@10 43 for (m = mb, W = W + ((mb - 1) * 4); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 4, MAKE_VOLATILE_STRIDE(6, rs)) {
Chris@10 44 E T1, Tl, T9, Tc, Tb, Th, T7, Ti, Ta, Tj, Td;
Chris@10 45 T1 = cr[0];
Chris@10 46 Tl = ci[0];
Chris@10 47 {
Chris@10 48 E T3, T6, T2, T5, Tg, T4, T8;
Chris@10 49 T3 = cr[WS(rs, 1)];
Chris@10 50 T6 = ci[WS(rs, 1)];
Chris@10 51 T2 = W[0];
Chris@10 52 T5 = W[1];
Chris@10 53 T9 = cr[WS(rs, 2)];
Chris@10 54 Tc = ci[WS(rs, 2)];
Chris@10 55 Tg = T2 * T6;
Chris@10 56 T4 = T2 * T3;
Chris@10 57 T8 = W[2];
Chris@10 58 Tb = W[3];
Chris@10 59 Th = FNMS(T5, T3, Tg);
Chris@10 60 T7 = FMA(T5, T6, T4);
Chris@10 61 Ti = T8 * Tc;
Chris@10 62 Ta = T8 * T9;
Chris@10 63 }
Chris@10 64 Tj = FNMS(Tb, T9, Ti);
Chris@10 65 Td = FMA(Tb, Tc, Ta);
Chris@10 66 {
Chris@10 67 E Tk, Te, To, Tn, Tm, Tf;
Chris@10 68 Tk = Th - Tj;
Chris@10 69 Tm = Th + Tj;
Chris@10 70 Te = T7 + Td;
Chris@10 71 To = Td - T7;
Chris@10 72 ci[WS(rs, 2)] = Tm + Tl;
Chris@10 73 Tn = FNMS(KP500000000, Tm, Tl);
Chris@10 74 cr[0] = T1 + Te;
Chris@10 75 Tf = FNMS(KP500000000, Te, T1);
Chris@10 76 ci[WS(rs, 1)] = FMA(KP866025403, To, Tn);
Chris@10 77 cr[WS(rs, 2)] = FMS(KP866025403, To, Tn);
Chris@10 78 cr[WS(rs, 1)] = FMA(KP866025403, Tk, Tf);
Chris@10 79 ci[0] = FNMS(KP866025403, Tk, Tf);
Chris@10 80 }
Chris@10 81 }
Chris@10 82 }
Chris@10 83 }
Chris@10 84
Chris@10 85 static const tw_instr twinstr[] = {
Chris@10 86 {TW_FULL, 1, 3},
Chris@10 87 {TW_NEXT, 1, 0}
Chris@10 88 };
Chris@10 89
Chris@10 90 static const hc2hc_desc desc = { 3, "hf_3", twinstr, &GENUS, {6, 4, 10, 0} };
Chris@10 91
Chris@10 92 void X(codelet_hf_3) (planner *p) {
Chris@10 93 X(khc2hc_register) (p, hf_3, &desc);
Chris@10 94 }
Chris@10 95 #else /* HAVE_FMA */
Chris@10 96
Chris@10 97 /* Generated by: ../../../genfft/gen_hc2hc.native -compact -variables 4 -pipeline-latency 4 -n 3 -dit -name hf_3 -include hf.h */
Chris@10 98
Chris@10 99 /*
Chris@10 100 * This function contains 16 FP additions, 12 FP multiplications,
Chris@10 101 * (or, 10 additions, 6 multiplications, 6 fused multiply/add),
Chris@10 102 * 15 stack variables, 2 constants, and 12 memory accesses
Chris@10 103 */
Chris@10 104 #include "hf.h"
Chris@10 105
Chris@10 106 static void hf_3(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@10 107 {
Chris@10 108 DK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@10 109 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@10 110 {
Chris@10 111 INT m;
Chris@10 112 for (m = mb, W = W + ((mb - 1) * 4); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 4, MAKE_VOLATILE_STRIDE(6, rs)) {
Chris@10 113 E T1, Ti, T6, Te, Tb, Tf, Tc, Tj;
Chris@10 114 T1 = cr[0];
Chris@10 115 Ti = ci[0];
Chris@10 116 {
Chris@10 117 E T3, T5, T2, T4;
Chris@10 118 T3 = cr[WS(rs, 1)];
Chris@10 119 T5 = ci[WS(rs, 1)];
Chris@10 120 T2 = W[0];
Chris@10 121 T4 = W[1];
Chris@10 122 T6 = FMA(T2, T3, T4 * T5);
Chris@10 123 Te = FNMS(T4, T3, T2 * T5);
Chris@10 124 }
Chris@10 125 {
Chris@10 126 E T8, Ta, T7, T9;
Chris@10 127 T8 = cr[WS(rs, 2)];
Chris@10 128 Ta = ci[WS(rs, 2)];
Chris@10 129 T7 = W[2];
Chris@10 130 T9 = W[3];
Chris@10 131 Tb = FMA(T7, T8, T9 * Ta);
Chris@10 132 Tf = FNMS(T9, T8, T7 * Ta);
Chris@10 133 }
Chris@10 134 Tc = T6 + Tb;
Chris@10 135 Tj = Te + Tf;
Chris@10 136 {
Chris@10 137 E Td, Tg, Th, Tk;
Chris@10 138 cr[0] = T1 + Tc;
Chris@10 139 Td = FNMS(KP500000000, Tc, T1);
Chris@10 140 Tg = KP866025403 * (Te - Tf);
Chris@10 141 ci[0] = Td - Tg;
Chris@10 142 cr[WS(rs, 1)] = Td + Tg;
Chris@10 143 ci[WS(rs, 2)] = Tj + Ti;
Chris@10 144 Th = KP866025403 * (Tb - T6);
Chris@10 145 Tk = FNMS(KP500000000, Tj, Ti);
Chris@10 146 cr[WS(rs, 2)] = Th - Tk;
Chris@10 147 ci[WS(rs, 1)] = Th + Tk;
Chris@10 148 }
Chris@10 149 }
Chris@10 150 }
Chris@10 151 }
Chris@10 152
Chris@10 153 static const tw_instr twinstr[] = {
Chris@10 154 {TW_FULL, 1, 3},
Chris@10 155 {TW_NEXT, 1, 0}
Chris@10 156 };
Chris@10 157
Chris@10 158 static const hc2hc_desc desc = { 3, "hf_3", twinstr, &GENUS, {10, 6, 6, 0} };
Chris@10 159
Chris@10 160 void X(codelet_hf_3) (planner *p) {
Chris@10 161 X(khc2hc_register) (p, hf_3, &desc);
Chris@10 162 }
Chris@10 163 #endif /* HAVE_FMA */