annotate src/fftw-3.3.5/dft/simd/common/t2fv_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
children
rev   line source
cannam@127 1 /*
cannam@127 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
cannam@127 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
cannam@127 4 *
cannam@127 5 * This program is free software; you can redistribute it and/or modify
cannam@127 6 * it under the terms of the GNU General Public License as published by
cannam@127 7 * the Free Software Foundation; either version 2 of the License, or
cannam@127 8 * (at your option) any later version.
cannam@127 9 *
cannam@127 10 * This program is distributed in the hope that it will be useful,
cannam@127 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@127 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
cannam@127 13 * GNU General Public License for more details.
cannam@127 14 *
cannam@127 15 * You should have received a copy of the GNU General Public License
cannam@127 16 * along with this program; if not, write to the Free Software
cannam@127 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
cannam@127 18 *
cannam@127 19 */
cannam@127 20
cannam@127 21 /* This file was automatically generated --- DO NOT EDIT */
cannam@127 22 /* Generated on Sat Jul 30 16:43:11 EDT 2016 */
cannam@127 23
cannam@127 24 #include "codelet-dft.h"
cannam@127 25
cannam@127 26 #ifdef HAVE_FMA
cannam@127 27
cannam@127 28 /* Generated by: ../../../genfft/gen_twiddle_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 2 -name t2fv_2 -include t2f.h */
cannam@127 29
cannam@127 30 /*
cannam@127 31 * This function contains 3 FP additions, 2 FP multiplications,
cannam@127 32 * (or, 3 additions, 2 multiplications, 0 fused multiply/add),
cannam@127 33 * 5 stack variables, 0 constants, and 4 memory accesses
cannam@127 34 */
cannam@127 35 #include "t2f.h"
cannam@127 36
cannam@127 37 static void t2fv_2(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
cannam@127 38 {
cannam@127 39 {
cannam@127 40 INT m;
cannam@127 41 R *x;
cannam@127 42 x = ri;
cannam@127 43 for (m = mb, W = W + (mb * ((TWVL / VL) * 2)); m < me; m = m + VL, x = x + (VL * ms), W = W + (TWVL * 2), MAKE_VOLATILE_STRIDE(2, rs)) {
cannam@127 44 V T1, T2, T3;
cannam@127 45 T1 = LD(&(x[0]), ms, &(x[0]));
cannam@127 46 T2 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
cannam@127 47 T3 = BYTWJ(&(W[0]), T2);
cannam@127 48 ST(&(x[0]), VADD(T1, T3), ms, &(x[0]));
cannam@127 49 ST(&(x[WS(rs, 1)]), VSUB(T1, T3), ms, &(x[WS(rs, 1)]));
cannam@127 50 }
cannam@127 51 }
cannam@127 52 VLEAVE();
cannam@127 53 }
cannam@127 54
cannam@127 55 static const tw_instr twinstr[] = {
cannam@127 56 VTW(0, 1),
cannam@127 57 {TW_NEXT, VL, 0}
cannam@127 58 };
cannam@127 59
cannam@127 60 static const ct_desc desc = { 2, XSIMD_STRING("t2fv_2"), twinstr, &GENUS, {3, 2, 0, 0}, 0, 0, 0 };
cannam@127 61
cannam@127 62 void XSIMD(codelet_t2fv_2) (planner *p) {
cannam@127 63 X(kdft_dit_register) (p, t2fv_2, &desc);
cannam@127 64 }
cannam@127 65 #else /* HAVE_FMA */
cannam@127 66
cannam@127 67 /* Generated by: ../../../genfft/gen_twiddle_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 2 -name t2fv_2 -include t2f.h */
cannam@127 68
cannam@127 69 /*
cannam@127 70 * This function contains 3 FP additions, 2 FP multiplications,
cannam@127 71 * (or, 3 additions, 2 multiplications, 0 fused multiply/add),
cannam@127 72 * 5 stack variables, 0 constants, and 4 memory accesses
cannam@127 73 */
cannam@127 74 #include "t2f.h"
cannam@127 75
cannam@127 76 static void t2fv_2(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
cannam@127 77 {
cannam@127 78 {
cannam@127 79 INT m;
cannam@127 80 R *x;
cannam@127 81 x = ri;
cannam@127 82 for (m = mb, W = W + (mb * ((TWVL / VL) * 2)); m < me; m = m + VL, x = x + (VL * ms), W = W + (TWVL * 2), MAKE_VOLATILE_STRIDE(2, rs)) {
cannam@127 83 V T1, T3, T2;
cannam@127 84 T1 = LD(&(x[0]), ms, &(x[0]));
cannam@127 85 T2 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
cannam@127 86 T3 = BYTWJ(&(W[0]), T2);
cannam@127 87 ST(&(x[WS(rs, 1)]), VSUB(T1, T3), ms, &(x[WS(rs, 1)]));
cannam@127 88 ST(&(x[0]), VADD(T1, T3), ms, &(x[0]));
cannam@127 89 }
cannam@127 90 }
cannam@127 91 VLEAVE();
cannam@127 92 }
cannam@127 93
cannam@127 94 static const tw_instr twinstr[] = {
cannam@127 95 VTW(0, 1),
cannam@127 96 {TW_NEXT, VL, 0}
cannam@127 97 };
cannam@127 98
cannam@127 99 static const ct_desc desc = { 2, XSIMD_STRING("t2fv_2"), twinstr, &GENUS, {3, 2, 0, 0}, 0, 0, 0 };
cannam@127 100
cannam@127 101 void XSIMD(codelet_t2fv_2) (planner *p) {
cannam@127 102 X(kdft_dit_register) (p, t2fv_2, &desc);
cannam@127 103 }
cannam@127 104 #endif /* HAVE_FMA */