annotate src/fftw-3.3.5/dft/simd/common/t1sv_2.c @ 154:4664ac0c1032

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