annotate src/fftw-3.3.5/dft/simd/common/t3fv_4.c @ 129:90a976269628

Updated MSVC
author Chris Cannam <cannam@all-day-breakfast.com>
date Tue, 18 Oct 2016 15:58:42 +0100
parents 7867fa7e1b6b
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:51 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 -twiddle-log3 -precompute-twiddles -no-generate-bytw -n 4 -name t3fv_4 -include t3f.h */
cannam@127 29
cannam@127 30 /*
cannam@127 31 * This function contains 12 FP additions, 10 FP multiplications,
cannam@127 32 * (or, 10 additions, 8 multiplications, 2 fused multiply/add),
cannam@127 33 * 16 stack variables, 0 constants, and 8 memory accesses
cannam@127 34 */
cannam@127 35 #include "t3f.h"
cannam@127 36
cannam@127 37 static void t3fv_4(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) * 4)); m < me; m = m + VL, x = x + (VL * ms), W = W + (TWVL * 4), MAKE_VOLATILE_STRIDE(4, rs)) {
cannam@127 44 V T2, T3, T1, Ta, T5, T8;
cannam@127 45 T2 = LDW(&(W[0]));
cannam@127 46 T3 = LDW(&(W[TWVL * 2]));
cannam@127 47 T1 = LD(&(x[0]), ms, &(x[0]));
cannam@127 48 Ta = LD(&(x[WS(rs, 3)]), ms, &(x[WS(rs, 1)]));
cannam@127 49 T5 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
cannam@127 50 T8 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
cannam@127 51 {
cannam@127 52 V T4, Tb, T9, T6;
cannam@127 53 T4 = VZMULJ(T2, T3);
cannam@127 54 Tb = VZMULJ(T3, Ta);
cannam@127 55 T9 = VZMULJ(T2, T8);
cannam@127 56 T6 = VZMULJ(T4, T5);
cannam@127 57 {
cannam@127 58 V Tc, Te, T7, Td;
cannam@127 59 Tc = VSUB(T9, Tb);
cannam@127 60 Te = VADD(T9, Tb);
cannam@127 61 T7 = VSUB(T1, T6);
cannam@127 62 Td = VADD(T1, T6);
cannam@127 63 ST(&(x[0]), VADD(Td, Te), ms, &(x[0]));
cannam@127 64 ST(&(x[WS(rs, 2)]), VSUB(Td, Te), ms, &(x[0]));
cannam@127 65 ST(&(x[WS(rs, 3)]), VFMAI(Tc, T7), ms, &(x[WS(rs, 1)]));
cannam@127 66 ST(&(x[WS(rs, 1)]), VFNMSI(Tc, T7), ms, &(x[WS(rs, 1)]));
cannam@127 67 }
cannam@127 68 }
cannam@127 69 }
cannam@127 70 }
cannam@127 71 VLEAVE();
cannam@127 72 }
cannam@127 73
cannam@127 74 static const tw_instr twinstr[] = {
cannam@127 75 VTW(0, 1),
cannam@127 76 VTW(0, 3),
cannam@127 77 {TW_NEXT, VL, 0}
cannam@127 78 };
cannam@127 79
cannam@127 80 static const ct_desc desc = { 4, XSIMD_STRING("t3fv_4"), twinstr, &GENUS, {10, 8, 2, 0}, 0, 0, 0 };
cannam@127 81
cannam@127 82 void XSIMD(codelet_t3fv_4) (planner *p) {
cannam@127 83 X(kdft_dit_register) (p, t3fv_4, &desc);
cannam@127 84 }
cannam@127 85 #else /* HAVE_FMA */
cannam@127 86
cannam@127 87 /* Generated by: ../../../genfft/gen_twiddle_c.native -simd -compact -variables 4 -pipeline-latency 8 -twiddle-log3 -precompute-twiddles -no-generate-bytw -n 4 -name t3fv_4 -include t3f.h */
cannam@127 88
cannam@127 89 /*
cannam@127 90 * This function contains 12 FP additions, 8 FP multiplications,
cannam@127 91 * (or, 12 additions, 8 multiplications, 0 fused multiply/add),
cannam@127 92 * 16 stack variables, 0 constants, and 8 memory accesses
cannam@127 93 */
cannam@127 94 #include "t3f.h"
cannam@127 95
cannam@127 96 static void t3fv_4(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
cannam@127 97 {
cannam@127 98 {
cannam@127 99 INT m;
cannam@127 100 R *x;
cannam@127 101 x = ri;
cannam@127 102 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(4, rs)) {
cannam@127 103 V T2, T3, T4;
cannam@127 104 T2 = LDW(&(W[0]));
cannam@127 105 T3 = LDW(&(W[TWVL * 2]));
cannam@127 106 T4 = VZMULJ(T2, T3);
cannam@127 107 {
cannam@127 108 V T1, Tb, T6, T9, Ta, T5, T8;
cannam@127 109 T1 = LD(&(x[0]), ms, &(x[0]));
cannam@127 110 Ta = LD(&(x[WS(rs, 3)]), ms, &(x[WS(rs, 1)]));
cannam@127 111 Tb = VZMULJ(T3, Ta);
cannam@127 112 T5 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
cannam@127 113 T6 = VZMULJ(T4, T5);
cannam@127 114 T8 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
cannam@127 115 T9 = VZMULJ(T2, T8);
cannam@127 116 {
cannam@127 117 V T7, Tc, Td, Te;
cannam@127 118 T7 = VSUB(T1, T6);
cannam@127 119 Tc = VBYI(VSUB(T9, Tb));
cannam@127 120 ST(&(x[WS(rs, 1)]), VSUB(T7, Tc), ms, &(x[WS(rs, 1)]));
cannam@127 121 ST(&(x[WS(rs, 3)]), VADD(T7, Tc), ms, &(x[WS(rs, 1)]));
cannam@127 122 Td = VADD(T1, T6);
cannam@127 123 Te = VADD(T9, Tb);
cannam@127 124 ST(&(x[WS(rs, 2)]), VSUB(Td, Te), ms, &(x[0]));
cannam@127 125 ST(&(x[0]), VADD(Td, Te), ms, &(x[0]));
cannam@127 126 }
cannam@127 127 }
cannam@127 128 }
cannam@127 129 }
cannam@127 130 VLEAVE();
cannam@127 131 }
cannam@127 132
cannam@127 133 static const tw_instr twinstr[] = {
cannam@127 134 VTW(0, 1),
cannam@127 135 VTW(0, 3),
cannam@127 136 {TW_NEXT, VL, 0}
cannam@127 137 };
cannam@127 138
cannam@127 139 static const ct_desc desc = { 4, XSIMD_STRING("t3fv_4"), twinstr, &GENUS, {12, 8, 0, 0}, 0, 0, 0 };
cannam@127 140
cannam@127 141 void XSIMD(codelet_t3fv_4) (planner *p) {
cannam@127 142 X(kdft_dit_register) (p, t3fv_4, &desc);
cannam@127 143 }
cannam@127 144 #endif /* HAVE_FMA */