annotate src/fftw-3.3.3/dft/simd/common/t1sv_2.c @ 127:7867fa7e1b6b

Current fftw source
author Chris Cannam <cannam@all-day-breakfast.com>
date Tue, 18 Oct 2016 13:40:26 +0100
parents 89f5e221ed7b
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:39:23 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.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 2 -name t1sv_2 -include ts.h */
cannam@95 29
cannam@95 30 /*
cannam@95 31 * This function contains 6 FP additions, 4 FP multiplications,
cannam@95 32 * (or, 4 additions, 2 multiplications, 2 fused multiply/add),
cannam@95 33 * 11 stack variables, 0 constants, and 8 memory accesses
cannam@95 34 */
cannam@95 35 #include "ts.h"
cannam@95 36
cannam@95 37 static void t1sv_2(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 for (m = mb, W = W + (mb * 2); m < me; m = m + (2 * VL), ri = ri + ((2 * VL) * ms), ii = ii + ((2 * VL) * ms), W = W + ((2 * VL) * 2), MAKE_VOLATILE_STRIDE(4, rs)) {
cannam@95 42 V T1, Ta, T3, T6, T2, T5;
cannam@95 43 T1 = LD(&(ri[0]), ms, &(ri[0]));
cannam@95 44 Ta = LD(&(ii[0]), ms, &(ii[0]));
cannam@95 45 T3 = LD(&(ri[WS(rs, 1)]), ms, &(ri[WS(rs, 1)]));
cannam@95 46 T6 = LD(&(ii[WS(rs, 1)]), ms, &(ii[WS(rs, 1)]));
cannam@95 47 T2 = LDW(&(W[0]));
cannam@95 48 T5 = LDW(&(W[TWVL * 1]));
cannam@95 49 {
cannam@95 50 V T8, T4, T9, T7;
cannam@95 51 T8 = VMUL(T2, T6);
cannam@95 52 T4 = VMUL(T2, T3);
cannam@95 53 T9 = VFNMS(T5, T3, T8);
cannam@95 54 T7 = VFMA(T5, T6, T4);
cannam@95 55 ST(&(ii[0]), VADD(T9, Ta), ms, &(ii[0]));
cannam@95 56 ST(&(ii[WS(rs, 1)]), VSUB(Ta, T9), ms, &(ii[WS(rs, 1)]));
cannam@95 57 ST(&(ri[0]), VADD(T1, T7), ms, &(ri[0]));
cannam@95 58 ST(&(ri[WS(rs, 1)]), VSUB(T1, T7), ms, &(ri[WS(rs, 1)]));
cannam@95 59 }
cannam@95 60 }
cannam@95 61 }
cannam@95 62 VLEAVE();
cannam@95 63 }
cannam@95 64
cannam@95 65 static const tw_instr twinstr[] = {
cannam@95 66 VTW(0, 1),
cannam@95 67 {TW_NEXT, (2 * VL), 0}
cannam@95 68 };
cannam@95 69
cannam@95 70 static const ct_desc desc = { 2, XSIMD_STRING("t1sv_2"), twinstr, &GENUS, {4, 2, 2, 0}, 0, 0, 0 };
cannam@95 71
cannam@95 72 void XSIMD(codelet_t1sv_2) (planner *p) {
cannam@95 73 X(kdft_dit_register) (p, t1sv_2, &desc);
cannam@95 74 }
cannam@95 75 #else /* HAVE_FMA */
cannam@95 76
cannam@95 77 /* Generated by: ../../../genfft/gen_twiddle.native -simd -compact -variables 4 -pipeline-latency 8 -n 2 -name t1sv_2 -include ts.h */
cannam@95 78
cannam@95 79 /*
cannam@95 80 * This function contains 6 FP additions, 4 FP multiplications,
cannam@95 81 * (or, 4 additions, 2 multiplications, 2 fused multiply/add),
cannam@95 82 * 9 stack variables, 0 constants, and 8 memory accesses
cannam@95 83 */
cannam@95 84 #include "ts.h"
cannam@95 85
cannam@95 86 static void t1sv_2(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
cannam@95 87 {
cannam@95 88 {
cannam@95 89 INT m;
cannam@95 90 for (m = mb, W = W + (mb * 2); m < me; m = m + (2 * VL), ri = ri + ((2 * VL) * ms), ii = ii + ((2 * VL) * ms), W = W + ((2 * VL) * 2), MAKE_VOLATILE_STRIDE(4, rs)) {
cannam@95 91 V T1, T8, T6, T7;
cannam@95 92 T1 = LD(&(ri[0]), ms, &(ri[0]));
cannam@95 93 T8 = LD(&(ii[0]), ms, &(ii[0]));
cannam@95 94 {
cannam@95 95 V T3, T5, T2, T4;
cannam@95 96 T3 = LD(&(ri[WS(rs, 1)]), ms, &(ri[WS(rs, 1)]));
cannam@95 97 T5 = LD(&(ii[WS(rs, 1)]), ms, &(ii[WS(rs, 1)]));
cannam@95 98 T2 = LDW(&(W[0]));
cannam@95 99 T4 = LDW(&(W[TWVL * 1]));
cannam@95 100 T6 = VFMA(T2, T3, VMUL(T4, T5));
cannam@95 101 T7 = VFNMS(T4, T3, VMUL(T2, T5));
cannam@95 102 }
cannam@95 103 ST(&(ri[WS(rs, 1)]), VSUB(T1, T6), ms, &(ri[WS(rs, 1)]));
cannam@95 104 ST(&(ii[WS(rs, 1)]), VSUB(T8, T7), ms, &(ii[WS(rs, 1)]));
cannam@95 105 ST(&(ri[0]), VADD(T1, T6), ms, &(ri[0]));
cannam@95 106 ST(&(ii[0]), VADD(T7, T8), ms, &(ii[0]));
cannam@95 107 }
cannam@95 108 }
cannam@95 109 VLEAVE();
cannam@95 110 }
cannam@95 111
cannam@95 112 static const tw_instr twinstr[] = {
cannam@95 113 VTW(0, 1),
cannam@95 114 {TW_NEXT, (2 * VL), 0}
cannam@95 115 };
cannam@95 116
cannam@95 117 static const ct_desc desc = { 2, XSIMD_STRING("t1sv_2"), twinstr, &GENUS, {4, 2, 2, 0}, 0, 0, 0 };
cannam@95 118
cannam@95 119 void XSIMD(codelet_t1sv_2) (planner *p) {
cannam@95 120 X(kdft_dit_register) (p, t1sv_2, &desc);
cannam@95 121 }
cannam@95 122 #endif /* HAVE_FMA */