annotate src/fftw-3.3.3/dft/simd/common/t1fv_3.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: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 3 -name t1fv_3 -include t1f.h */
cannam@95 29
cannam@95 30 /*
cannam@95 31 * This function contains 8 FP additions, 8 FP multiplications,
cannam@95 32 * (or, 5 additions, 5 multiplications, 3 fused multiply/add),
cannam@95 33 * 12 stack variables, 2 constants, and 6 memory accesses
cannam@95 34 */
cannam@95 35 #include "t1f.h"
cannam@95 36
cannam@95 37 static void t1fv_3(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
cannam@95 38 {
cannam@95 39 DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
cannam@95 40 DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
cannam@95 41 {
cannam@95 42 INT m;
cannam@95 43 R *x;
cannam@95 44 x = ri;
cannam@95 45 for (m = mb, W = W + (mb * ((TWVL / VL) * 4)); m < me; m = m + VL, x = x + (VL * ms), W = W + (TWVL * 4), MAKE_VOLATILE_STRIDE(3, rs)) {
cannam@95 46 V T1, T2, T4;
cannam@95 47 T1 = LD(&(x[0]), ms, &(x[0]));
cannam@95 48 T2 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
cannam@95 49 T4 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
cannam@95 50 {
cannam@95 51 V T3, T5, T8, T6, T7;
cannam@95 52 T3 = BYTWJ(&(W[0]), T2);
cannam@95 53 T5 = BYTWJ(&(W[TWVL * 2]), T4);
cannam@95 54 T8 = VMUL(LDK(KP866025403), VSUB(T5, T3));
cannam@95 55 T6 = VADD(T3, T5);
cannam@95 56 T7 = VFNMS(LDK(KP500000000), T6, T1);
cannam@95 57 ST(&(x[0]), VADD(T1, T6), ms, &(x[0]));
cannam@95 58 ST(&(x[WS(rs, 1)]), VFMAI(T8, T7), ms, &(x[WS(rs, 1)]));
cannam@95 59 ST(&(x[WS(rs, 2)]), VFNMSI(T8, T7), ms, &(x[0]));
cannam@95 60 }
cannam@95 61 }
cannam@95 62 }
cannam@95 63 VLEAVE();
cannam@95 64 }
cannam@95 65
cannam@95 66 static const tw_instr twinstr[] = {
cannam@95 67 VTW(0, 1),
cannam@95 68 VTW(0, 2),
cannam@95 69 {TW_NEXT, VL, 0}
cannam@95 70 };
cannam@95 71
cannam@95 72 static const ct_desc desc = { 3, XSIMD_STRING("t1fv_3"), twinstr, &GENUS, {5, 5, 3, 0}, 0, 0, 0 };
cannam@95 73
cannam@95 74 void XSIMD(codelet_t1fv_3) (planner *p) {
cannam@95 75 X(kdft_dit_register) (p, t1fv_3, &desc);
cannam@95 76 }
cannam@95 77 #else /* HAVE_FMA */
cannam@95 78
cannam@95 79 /* Generated by: ../../../genfft/gen_twiddle_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 3 -name t1fv_3 -include t1f.h */
cannam@95 80
cannam@95 81 /*
cannam@95 82 * This function contains 8 FP additions, 6 FP multiplications,
cannam@95 83 * (or, 7 additions, 5 multiplications, 1 fused multiply/add),
cannam@95 84 * 12 stack variables, 2 constants, and 6 memory accesses
cannam@95 85 */
cannam@95 86 #include "t1f.h"
cannam@95 87
cannam@95 88 static void t1fv_3(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
cannam@95 89 {
cannam@95 90 DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
cannam@95 91 DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
cannam@95 92 {
cannam@95 93 INT m;
cannam@95 94 R *x;
cannam@95 95 x = ri;
cannam@95 96 for (m = mb, W = W + (mb * ((TWVL / VL) * 4)); m < me; m = m + VL, x = x + (VL * ms), W = W + (TWVL * 4), MAKE_VOLATILE_STRIDE(3, rs)) {
cannam@95 97 V T1, T3, T5, T6, T2, T4, T7, T8;
cannam@95 98 T1 = LD(&(x[0]), ms, &(x[0]));
cannam@95 99 T2 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
cannam@95 100 T3 = BYTWJ(&(W[0]), T2);
cannam@95 101 T4 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
cannam@95 102 T5 = BYTWJ(&(W[TWVL * 2]), T4);
cannam@95 103 T6 = VADD(T3, T5);
cannam@95 104 ST(&(x[0]), VADD(T1, T6), ms, &(x[0]));
cannam@95 105 T7 = VFNMS(LDK(KP500000000), T6, T1);
cannam@95 106 T8 = VBYI(VMUL(LDK(KP866025403), VSUB(T5, T3)));
cannam@95 107 ST(&(x[WS(rs, 2)]), VSUB(T7, T8), ms, &(x[0]));
cannam@95 108 ST(&(x[WS(rs, 1)]), VADD(T7, T8), ms, &(x[WS(rs, 1)]));
cannam@95 109 }
cannam@95 110 }
cannam@95 111 VLEAVE();
cannam@95 112 }
cannam@95 113
cannam@95 114 static const tw_instr twinstr[] = {
cannam@95 115 VTW(0, 1),
cannam@95 116 VTW(0, 2),
cannam@95 117 {TW_NEXT, VL, 0}
cannam@95 118 };
cannam@95 119
cannam@95 120 static const ct_desc desc = { 3, XSIMD_STRING("t1fv_3"), twinstr, &GENUS, {7, 5, 1, 0}, 0, 0, 0 };
cannam@95 121
cannam@95 122 void XSIMD(codelet_t1fv_3) (planner *p) {
cannam@95 123 X(kdft_dit_register) (p, t1fv_3, &desc);
cannam@95 124 }
cannam@95 125 #endif /* HAVE_FMA */