annotate src/fftw-3.3.3/dft/simd/common/t1fv_4.c @ 95:89f5e221ed7b

Add FFTW3
author Chris Cannam <cannam@all-day-breakfast.com>
date Wed, 20 Mar 2013 15:35:50 +0000
parents
children
rev   line source
cannam@95 1 /*
cannam@95 2 * Copyright (c) 2003, 2007-11 Matteo Frigo
cannam@95 3 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
cannam@95 4 *
cannam@95 5 * This program is free software; you can redistribute it and/or modify
cannam@95 6 * it under the terms of the GNU General Public License as published by
cannam@95 7 * the Free Software Foundation; either version 2 of the License, or
cannam@95 8 * (at your option) any later version.
cannam@95 9 *
cannam@95 10 * This program is distributed in the hope that it will be useful,
cannam@95 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@95 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
cannam@95 13 * GNU General Public License for more details.
cannam@95 14 *
cannam@95 15 * You should have received a copy of the GNU General Public License
cannam@95 16 * along with this program; if not, write to the Free Software
cannam@95 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
cannam@95 18 *
cannam@95 19 */
cannam@95 20
cannam@95 21 /* This file was automatically generated --- DO NOT EDIT */
cannam@95 22 /* Generated on Sun Nov 25 07:38:01 EST 2012 */
cannam@95 23
cannam@95 24 #include "codelet-dft.h"
cannam@95 25
cannam@95 26 #ifdef HAVE_FMA
cannam@95 27
cannam@95 28 /* Generated by: ../../../genfft/gen_twiddle_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 4 -name t1fv_4 -include t1f.h */
cannam@95 29
cannam@95 30 /*
cannam@95 31 * This function contains 11 FP additions, 8 FP multiplications,
cannam@95 32 * (or, 9 additions, 6 multiplications, 2 fused multiply/add),
cannam@95 33 * 13 stack variables, 0 constants, and 8 memory accesses
cannam@95 34 */
cannam@95 35 #include "t1f.h"
cannam@95 36
cannam@95 37 static void t1fv_4(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
cannam@95 38 {
cannam@95 39 {
cannam@95 40 INT m;
cannam@95 41 R *x;
cannam@95 42 x = ri;
cannam@95 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)) {
cannam@95 44 V T1, T7, T2, T5, T8, T3, T6;
cannam@95 45 T1 = LD(&(x[0]), ms, &(x[0]));
cannam@95 46 T7 = LD(&(x[WS(rs, 3)]), ms, &(x[WS(rs, 1)]));
cannam@95 47 T2 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
cannam@95 48 T5 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
cannam@95 49 T8 = BYTWJ(&(W[TWVL * 4]), T7);
cannam@95 50 T3 = BYTWJ(&(W[TWVL * 2]), T2);
cannam@95 51 T6 = BYTWJ(&(W[0]), T5);
cannam@95 52 {
cannam@95 53 V Ta, T4, Tb, T9;
cannam@95 54 Ta = VADD(T1, T3);
cannam@95 55 T4 = VSUB(T1, T3);
cannam@95 56 Tb = VADD(T6, T8);
cannam@95 57 T9 = VSUB(T6, T8);
cannam@95 58 ST(&(x[0]), VADD(Ta, Tb), ms, &(x[0]));
cannam@95 59 ST(&(x[WS(rs, 2)]), VSUB(Ta, Tb), ms, &(x[0]));
cannam@95 60 ST(&(x[WS(rs, 3)]), VFMAI(T9, T4), ms, &(x[WS(rs, 1)]));
cannam@95 61 ST(&(x[WS(rs, 1)]), VFNMSI(T9, T4), ms, &(x[WS(rs, 1)]));
cannam@95 62 }
cannam@95 63 }
cannam@95 64 }
cannam@95 65 VLEAVE();
cannam@95 66 }
cannam@95 67
cannam@95 68 static const tw_instr twinstr[] = {
cannam@95 69 VTW(0, 1),
cannam@95 70 VTW(0, 2),
cannam@95 71 VTW(0, 3),
cannam@95 72 {TW_NEXT, VL, 0}
cannam@95 73 };
cannam@95 74
cannam@95 75 static const ct_desc desc = { 4, XSIMD_STRING("t1fv_4"), twinstr, &GENUS, {9, 6, 2, 0}, 0, 0, 0 };
cannam@95 76
cannam@95 77 void XSIMD(codelet_t1fv_4) (planner *p) {
cannam@95 78 X(kdft_dit_register) (p, t1fv_4, &desc);
cannam@95 79 }
cannam@95 80 #else /* HAVE_FMA */
cannam@95 81
cannam@95 82 /* Generated by: ../../../genfft/gen_twiddle_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 4 -name t1fv_4 -include t1f.h */
cannam@95 83
cannam@95 84 /*
cannam@95 85 * This function contains 11 FP additions, 6 FP multiplications,
cannam@95 86 * (or, 11 additions, 6 multiplications, 0 fused multiply/add),
cannam@95 87 * 13 stack variables, 0 constants, and 8 memory accesses
cannam@95 88 */
cannam@95 89 #include "t1f.h"
cannam@95 90
cannam@95 91 static void t1fv_4(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
cannam@95 92 {
cannam@95 93 {
cannam@95 94 INT m;
cannam@95 95 R *x;
cannam@95 96 x = ri;
cannam@95 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)) {
cannam@95 98 V T1, T8, T3, T6, T7, T2, T5;
cannam@95 99 T1 = LD(&(x[0]), ms, &(x[0]));
cannam@95 100 T7 = LD(&(x[WS(rs, 3)]), ms, &(x[WS(rs, 1)]));
cannam@95 101 T8 = BYTWJ(&(W[TWVL * 4]), T7);
cannam@95 102 T2 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
cannam@95 103 T3 = BYTWJ(&(W[TWVL * 2]), T2);
cannam@95 104 T5 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
cannam@95 105 T6 = BYTWJ(&(W[0]), T5);
cannam@95 106 {
cannam@95 107 V T4, T9, Ta, Tb;
cannam@95 108 T4 = VSUB(T1, T3);
cannam@95 109 T9 = VBYI(VSUB(T6, T8));
cannam@95 110 ST(&(x[WS(rs, 1)]), VSUB(T4, T9), ms, &(x[WS(rs, 1)]));
cannam@95 111 ST(&(x[WS(rs, 3)]), VADD(T4, T9), ms, &(x[WS(rs, 1)]));
cannam@95 112 Ta = VADD(T1, T3);
cannam@95 113 Tb = VADD(T6, T8);
cannam@95 114 ST(&(x[WS(rs, 2)]), VSUB(Ta, Tb), ms, &(x[0]));
cannam@95 115 ST(&(x[0]), VADD(Ta, Tb), ms, &(x[0]));
cannam@95 116 }
cannam@95 117 }
cannam@95 118 }
cannam@95 119 VLEAVE();
cannam@95 120 }
cannam@95 121
cannam@95 122 static const tw_instr twinstr[] = {
cannam@95 123 VTW(0, 1),
cannam@95 124 VTW(0, 2),
cannam@95 125 VTW(0, 3),
cannam@95 126 {TW_NEXT, VL, 0}
cannam@95 127 };
cannam@95 128
cannam@95 129 static const ct_desc desc = { 4, XSIMD_STRING("t1fv_4"), twinstr, &GENUS, {11, 6, 0, 0}, 0, 0, 0 };
cannam@95 130
cannam@95 131 void XSIMD(codelet_t1fv_4) (planner *p) {
cannam@95 132 X(kdft_dit_register) (p, t1fv_4, &desc);
cannam@95 133 }
cannam@95 134 #endif /* HAVE_FMA */