annotate src/fftw-3.3.3/rdft/scalar/r2cf/hf_4.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:50 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 4 -dit -name hf_4 -include hf.h */
Chris@10 29
Chris@10 30 /*
Chris@10 31 * This function contains 22 FP additions, 12 FP multiplications,
Chris@10 32 * (or, 16 additions, 6 multiplications, 6 fused multiply/add),
Chris@10 33 * 31 stack variables, 0 constants, and 16 memory accesses
Chris@10 34 */
Chris@10 35 #include "hf.h"
Chris@10 36
Chris@10 37 static void hf_4(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) * 6); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 6, MAKE_VOLATILE_STRIDE(8, rs)) {
Chris@10 42 E To, Te, Tm, T8, Ty, Tw, Tq, Tk;
Chris@10 43 {
Chris@10 44 E T1, Tv, Tu, T7, Tg, Tj, Tf, Ti, Tp, Th;
Chris@10 45 T1 = cr[0];
Chris@10 46 Tv = ci[0];
Chris@10 47 {
Chris@10 48 E T3, T6, T2, T5;
Chris@10 49 T3 = cr[WS(rs, 2)];
Chris@10 50 T6 = ci[WS(rs, 2)];
Chris@10 51 T2 = W[2];
Chris@10 52 T5 = W[3];
Chris@10 53 {
Chris@10 54 E Ta, Td, Tc, Tn, Tb, Tt, T4, T9;
Chris@10 55 Ta = cr[WS(rs, 1)];
Chris@10 56 Td = ci[WS(rs, 1)];
Chris@10 57 Tt = T2 * T6;
Chris@10 58 T4 = T2 * T3;
Chris@10 59 T9 = W[0];
Chris@10 60 Tc = W[1];
Chris@10 61 Tu = FNMS(T5, T3, Tt);
Chris@10 62 T7 = FMA(T5, T6, T4);
Chris@10 63 Tn = T9 * Td;
Chris@10 64 Tb = T9 * Ta;
Chris@10 65 Tg = cr[WS(rs, 3)];
Chris@10 66 Tj = ci[WS(rs, 3)];
Chris@10 67 To = FNMS(Tc, Ta, Tn);
Chris@10 68 Te = FMA(Tc, Td, Tb);
Chris@10 69 Tf = W[4];
Chris@10 70 Ti = W[5];
Chris@10 71 }
Chris@10 72 }
Chris@10 73 Tm = T1 - T7;
Chris@10 74 T8 = T1 + T7;
Chris@10 75 Tp = Tf * Tj;
Chris@10 76 Th = Tf * Tg;
Chris@10 77 Ty = Tv - Tu;
Chris@10 78 Tw = Tu + Tv;
Chris@10 79 Tq = FNMS(Ti, Tg, Tp);
Chris@10 80 Tk = FMA(Ti, Tj, Th);
Chris@10 81 }
Chris@10 82 {
Chris@10 83 E Tr, Ts, Tl, Tx;
Chris@10 84 Tr = To - Tq;
Chris@10 85 Ts = To + Tq;
Chris@10 86 Tl = Te + Tk;
Chris@10 87 Tx = Tk - Te;
Chris@10 88 ci[WS(rs, 3)] = Ts + Tw;
Chris@10 89 cr[WS(rs, 2)] = Ts - Tw;
Chris@10 90 cr[WS(rs, 1)] = Tm + Tr;
Chris@10 91 ci[0] = Tm - Tr;
Chris@10 92 ci[WS(rs, 2)] = Tx + Ty;
Chris@10 93 cr[WS(rs, 3)] = Tx - Ty;
Chris@10 94 cr[0] = T8 + Tl;
Chris@10 95 ci[WS(rs, 1)] = T8 - Tl;
Chris@10 96 }
Chris@10 97 }
Chris@10 98 }
Chris@10 99 }
Chris@10 100
Chris@10 101 static const tw_instr twinstr[] = {
Chris@10 102 {TW_FULL, 1, 4},
Chris@10 103 {TW_NEXT, 1, 0}
Chris@10 104 };
Chris@10 105
Chris@10 106 static const hc2hc_desc desc = { 4, "hf_4", twinstr, &GENUS, {16, 6, 6, 0} };
Chris@10 107
Chris@10 108 void X(codelet_hf_4) (planner *p) {
Chris@10 109 X(khc2hc_register) (p, hf_4, &desc);
Chris@10 110 }
Chris@10 111 #else /* HAVE_FMA */
Chris@10 112
Chris@10 113 /* Generated by: ../../../genfft/gen_hc2hc.native -compact -variables 4 -pipeline-latency 4 -n 4 -dit -name hf_4 -include hf.h */
Chris@10 114
Chris@10 115 /*
Chris@10 116 * This function contains 22 FP additions, 12 FP multiplications,
Chris@10 117 * (or, 16 additions, 6 multiplications, 6 fused multiply/add),
Chris@10 118 * 13 stack variables, 0 constants, and 16 memory accesses
Chris@10 119 */
Chris@10 120 #include "hf.h"
Chris@10 121
Chris@10 122 static void hf_4(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@10 123 {
Chris@10 124 {
Chris@10 125 INT m;
Chris@10 126 for (m = mb, W = W + ((mb - 1) * 6); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 6, MAKE_VOLATILE_STRIDE(8, rs)) {
Chris@10 127 E T1, Tp, T6, To, Tc, Tk, Th, Tl;
Chris@10 128 T1 = cr[0];
Chris@10 129 Tp = ci[0];
Chris@10 130 {
Chris@10 131 E T3, T5, T2, T4;
Chris@10 132 T3 = cr[WS(rs, 2)];
Chris@10 133 T5 = ci[WS(rs, 2)];
Chris@10 134 T2 = W[2];
Chris@10 135 T4 = W[3];
Chris@10 136 T6 = FMA(T2, T3, T4 * T5);
Chris@10 137 To = FNMS(T4, T3, T2 * T5);
Chris@10 138 }
Chris@10 139 {
Chris@10 140 E T9, Tb, T8, Ta;
Chris@10 141 T9 = cr[WS(rs, 1)];
Chris@10 142 Tb = ci[WS(rs, 1)];
Chris@10 143 T8 = W[0];
Chris@10 144 Ta = W[1];
Chris@10 145 Tc = FMA(T8, T9, Ta * Tb);
Chris@10 146 Tk = FNMS(Ta, T9, T8 * Tb);
Chris@10 147 }
Chris@10 148 {
Chris@10 149 E Te, Tg, Td, Tf;
Chris@10 150 Te = cr[WS(rs, 3)];
Chris@10 151 Tg = ci[WS(rs, 3)];
Chris@10 152 Td = W[4];
Chris@10 153 Tf = W[5];
Chris@10 154 Th = FMA(Td, Te, Tf * Tg);
Chris@10 155 Tl = FNMS(Tf, Te, Td * Tg);
Chris@10 156 }
Chris@10 157 {
Chris@10 158 E T7, Ti, Tj, Tm;
Chris@10 159 T7 = T1 + T6;
Chris@10 160 Ti = Tc + Th;
Chris@10 161 ci[WS(rs, 1)] = T7 - Ti;
Chris@10 162 cr[0] = T7 + Ti;
Chris@10 163 Tj = T1 - T6;
Chris@10 164 Tm = Tk - Tl;
Chris@10 165 ci[0] = Tj - Tm;
Chris@10 166 cr[WS(rs, 1)] = Tj + Tm;
Chris@10 167 }
Chris@10 168 {
Chris@10 169 E Tn, Tq, Tr, Ts;
Chris@10 170 Tn = Tk + Tl;
Chris@10 171 Tq = To + Tp;
Chris@10 172 cr[WS(rs, 2)] = Tn - Tq;
Chris@10 173 ci[WS(rs, 3)] = Tn + Tq;
Chris@10 174 Tr = Th - Tc;
Chris@10 175 Ts = Tp - To;
Chris@10 176 cr[WS(rs, 3)] = Tr - Ts;
Chris@10 177 ci[WS(rs, 2)] = Tr + Ts;
Chris@10 178 }
Chris@10 179 }
Chris@10 180 }
Chris@10 181 }
Chris@10 182
Chris@10 183 static const tw_instr twinstr[] = {
Chris@10 184 {TW_FULL, 1, 4},
Chris@10 185 {TW_NEXT, 1, 0}
Chris@10 186 };
Chris@10 187
Chris@10 188 static const hc2hc_desc desc = { 4, "hf_4", twinstr, &GENUS, {16, 6, 6, 0} };
Chris@10 189
Chris@10 190 void X(codelet_hf_4) (planner *p) {
Chris@10 191 X(khc2hc_register) (p, hf_4, &desc);
Chris@10 192 }
Chris@10 193 #endif /* HAVE_FMA */