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