annotate src/fftw-3.3.3/dft/simd/common/t1bv_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:03 EST 2012 */
Chris@10 23
Chris@10 24 #include "codelet-dft.h"
Chris@10 25
Chris@10 26 #ifdef HAVE_FMA
Chris@10 27
Chris@10 28 /* Generated by: ../../../genfft/gen_twiddle_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 4 -name t1bv_4 -include t1b.h -sign 1 */
Chris@10 29
Chris@10 30 /*
Chris@10 31 * This function contains 11 FP additions, 8 FP multiplications,
Chris@10 32 * (or, 9 additions, 6 multiplications, 2 fused multiply/add),
Chris@10 33 * 13 stack variables, 0 constants, and 8 memory accesses
Chris@10 34 */
Chris@10 35 #include "t1b.h"
Chris@10 36
Chris@10 37 static void t1bv_4(R *ri, R *ii, 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 R *x;
Chris@10 42 x = ii;
Chris@10 43 for (m = mb, W = W + (mb * ((TWVL / VL) * 6)); m < me; m = m + VL, x = x + (VL * ms), W = W + (TWVL * 6), MAKE_VOLATILE_STRIDE(4, rs)) {
Chris@10 44 V T1, T7, T2, T5, T8, T3, T6;
Chris@10 45 T1 = LD(&(x[0]), ms, &(x[0]));
Chris@10 46 T7 = LD(&(x[WS(rs, 3)]), ms, &(x[WS(rs, 1)]));
Chris@10 47 T2 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
Chris@10 48 T5 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
Chris@10 49 T8 = BYTW(&(W[TWVL * 4]), T7);
Chris@10 50 T3 = BYTW(&(W[TWVL * 2]), T2);
Chris@10 51 T6 = BYTW(&(W[0]), T5);
Chris@10 52 {
Chris@10 53 V Ta, T4, Tb, T9;
Chris@10 54 Ta = VADD(T1, T3);
Chris@10 55 T4 = VSUB(T1, T3);
Chris@10 56 Tb = VADD(T6, T8);
Chris@10 57 T9 = VSUB(T6, T8);
Chris@10 58 ST(&(x[0]), VADD(Ta, Tb), ms, &(x[0]));
Chris@10 59 ST(&(x[WS(rs, 2)]), VSUB(Ta, Tb), ms, &(x[0]));
Chris@10 60 ST(&(x[WS(rs, 1)]), VFMAI(T9, T4), ms, &(x[WS(rs, 1)]));
Chris@10 61 ST(&(x[WS(rs, 3)]), VFNMSI(T9, T4), ms, &(x[WS(rs, 1)]));
Chris@10 62 }
Chris@10 63 }
Chris@10 64 }
Chris@10 65 VLEAVE();
Chris@10 66 }
Chris@10 67
Chris@10 68 static const tw_instr twinstr[] = {
Chris@10 69 VTW(0, 1),
Chris@10 70 VTW(0, 2),
Chris@10 71 VTW(0, 3),
Chris@10 72 {TW_NEXT, VL, 0}
Chris@10 73 };
Chris@10 74
Chris@10 75 static const ct_desc desc = { 4, XSIMD_STRING("t1bv_4"), twinstr, &GENUS, {9, 6, 2, 0}, 0, 0, 0 };
Chris@10 76
Chris@10 77 void XSIMD(codelet_t1bv_4) (planner *p) {
Chris@10 78 X(kdft_dit_register) (p, t1bv_4, &desc);
Chris@10 79 }
Chris@10 80 #else /* HAVE_FMA */
Chris@10 81
Chris@10 82 /* Generated by: ../../../genfft/gen_twiddle_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 4 -name t1bv_4 -include t1b.h -sign 1 */
Chris@10 83
Chris@10 84 /*
Chris@10 85 * This function contains 11 FP additions, 6 FP multiplications,
Chris@10 86 * (or, 11 additions, 6 multiplications, 0 fused multiply/add),
Chris@10 87 * 13 stack variables, 0 constants, and 8 memory accesses
Chris@10 88 */
Chris@10 89 #include "t1b.h"
Chris@10 90
Chris@10 91 static void t1bv_4(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@10 92 {
Chris@10 93 {
Chris@10 94 INT m;
Chris@10 95 R *x;
Chris@10 96 x = ii;
Chris@10 97 for (m = mb, W = W + (mb * ((TWVL / VL) * 6)); m < me; m = m + VL, x = x + (VL * ms), W = W + (TWVL * 6), MAKE_VOLATILE_STRIDE(4, rs)) {
Chris@10 98 V T1, T8, T3, T6, T7, T2, T5;
Chris@10 99 T1 = LD(&(x[0]), ms, &(x[0]));
Chris@10 100 T7 = LD(&(x[WS(rs, 3)]), ms, &(x[WS(rs, 1)]));
Chris@10 101 T8 = BYTW(&(W[TWVL * 4]), T7);
Chris@10 102 T2 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
Chris@10 103 T3 = BYTW(&(W[TWVL * 2]), T2);
Chris@10 104 T5 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
Chris@10 105 T6 = BYTW(&(W[0]), T5);
Chris@10 106 {
Chris@10 107 V T4, T9, Ta, Tb;
Chris@10 108 T4 = VSUB(T1, T3);
Chris@10 109 T9 = VBYI(VSUB(T6, T8));
Chris@10 110 ST(&(x[WS(rs, 3)]), VSUB(T4, T9), ms, &(x[WS(rs, 1)]));
Chris@10 111 ST(&(x[WS(rs, 1)]), VADD(T4, T9), ms, &(x[WS(rs, 1)]));
Chris@10 112 Ta = VADD(T1, T3);
Chris@10 113 Tb = VADD(T6, T8);
Chris@10 114 ST(&(x[WS(rs, 2)]), VSUB(Ta, Tb), ms, &(x[0]));
Chris@10 115 ST(&(x[0]), VADD(Ta, Tb), ms, &(x[0]));
Chris@10 116 }
Chris@10 117 }
Chris@10 118 }
Chris@10 119 VLEAVE();
Chris@10 120 }
Chris@10 121
Chris@10 122 static const tw_instr twinstr[] = {
Chris@10 123 VTW(0, 1),
Chris@10 124 VTW(0, 2),
Chris@10 125 VTW(0, 3),
Chris@10 126 {TW_NEXT, VL, 0}
Chris@10 127 };
Chris@10 128
Chris@10 129 static const ct_desc desc = { 4, XSIMD_STRING("t1bv_4"), twinstr, &GENUS, {11, 6, 0, 0}, 0, 0, 0 };
Chris@10 130
Chris@10 131 void XSIMD(codelet_t1bv_4) (planner *p) {
Chris@10 132 X(kdft_dit_register) (p, t1bv_4, &desc);
Chris@10 133 }
Chris@10 134 #endif /* HAVE_FMA */