annotate src/fftw-3.3.5/dft/simd/common/t3bv_4.c @ 84:08ae793730bd

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