annotate src/fftw-3.3.5/dft/simd/common/q1bv_2.c @ 165:7e6e71a29886

Update build for AUDIO_COMPONENT_FIX
author Chris Cannam <cannam@all-day-breakfast.com>
date Wed, 30 Oct 2019 12:40:34 +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:28 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_twidsq_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 2 -dif -name q1bv_2 -include q1b.h -sign 1 */
cannam@127 29
cannam@127 30 /*
cannam@127 31 * This function contains 6 FP additions, 4 FP multiplications,
cannam@127 32 * (or, 6 additions, 4 multiplications, 0 fused multiply/add),
cannam@127 33 * 8 stack variables, 0 constants, and 8 memory accesses
cannam@127 34 */
cannam@127 35 #include "q1b.h"
cannam@127 36
cannam@127 37 static void q1bv_2(R *ri, R *ii, const R *W, stride rs, stride vs, 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 = ii;
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(4, rs), MAKE_VOLATILE_STRIDE(4, vs)) {
cannam@127 44 V T1, T2, T4, T5, T3, T6;
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 T4 = LD(&(x[WS(vs, 1)]), ms, &(x[WS(vs, 1)]));
cannam@127 48 T5 = LD(&(x[WS(vs, 1) + WS(rs, 1)]), ms, &(x[WS(vs, 1) + WS(rs, 1)]));
cannam@127 49 ST(&(x[0]), VADD(T1, T2), ms, &(x[0]));
cannam@127 50 T3 = BYTW(&(W[0]), VSUB(T1, T2));
cannam@127 51 ST(&(x[WS(rs, 1)]), VADD(T4, T5), ms, &(x[WS(rs, 1)]));
cannam@127 52 T6 = BYTW(&(W[0]), VSUB(T4, T5));
cannam@127 53 ST(&(x[WS(vs, 1)]), T3, ms, &(x[WS(vs, 1)]));
cannam@127 54 ST(&(x[WS(vs, 1) + WS(rs, 1)]), T6, ms, &(x[WS(vs, 1) + WS(rs, 1)]));
cannam@127 55 }
cannam@127 56 }
cannam@127 57 VLEAVE();
cannam@127 58 }
cannam@127 59
cannam@127 60 static const tw_instr twinstr[] = {
cannam@127 61 VTW(0, 1),
cannam@127 62 {TW_NEXT, VL, 0}
cannam@127 63 };
cannam@127 64
cannam@127 65 static const ct_desc desc = { 2, XSIMD_STRING("q1bv_2"), twinstr, &GENUS, {6, 4, 0, 0}, 0, 0, 0 };
cannam@127 66
cannam@127 67 void XSIMD(codelet_q1bv_2) (planner *p) {
cannam@127 68 X(kdft_difsq_register) (p, q1bv_2, &desc);
cannam@127 69 }
cannam@127 70 #else /* HAVE_FMA */
cannam@127 71
cannam@127 72 /* Generated by: ../../../genfft/gen_twidsq_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 2 -dif -name q1bv_2 -include q1b.h -sign 1 */
cannam@127 73
cannam@127 74 /*
cannam@127 75 * This function contains 6 FP additions, 4 FP multiplications,
cannam@127 76 * (or, 6 additions, 4 multiplications, 0 fused multiply/add),
cannam@127 77 * 8 stack variables, 0 constants, and 8 memory accesses
cannam@127 78 */
cannam@127 79 #include "q1b.h"
cannam@127 80
cannam@127 81 static void q1bv_2(R *ri, R *ii, const R *W, stride rs, stride vs, INT mb, INT me, INT ms)
cannam@127 82 {
cannam@127 83 {
cannam@127 84 INT m;
cannam@127 85 R *x;
cannam@127 86 x = ii;
cannam@127 87 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(4, rs), MAKE_VOLATILE_STRIDE(4, vs)) {
cannam@127 88 V T1, T2, T3, T4, T5, T6;
cannam@127 89 T1 = LD(&(x[0]), ms, &(x[0]));
cannam@127 90 T2 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
cannam@127 91 T3 = BYTW(&(W[0]), VSUB(T1, T2));
cannam@127 92 T4 = LD(&(x[WS(vs, 1)]), ms, &(x[WS(vs, 1)]));
cannam@127 93 T5 = LD(&(x[WS(vs, 1) + WS(rs, 1)]), ms, &(x[WS(vs, 1) + WS(rs, 1)]));
cannam@127 94 T6 = BYTW(&(W[0]), VSUB(T4, T5));
cannam@127 95 ST(&(x[WS(vs, 1)]), T3, ms, &(x[WS(vs, 1)]));
cannam@127 96 ST(&(x[WS(vs, 1) + WS(rs, 1)]), T6, ms, &(x[WS(vs, 1) + WS(rs, 1)]));
cannam@127 97 ST(&(x[0]), VADD(T1, T2), ms, &(x[0]));
cannam@127 98 ST(&(x[WS(rs, 1)]), VADD(T4, T5), ms, &(x[WS(rs, 1)]));
cannam@127 99 }
cannam@127 100 }
cannam@127 101 VLEAVE();
cannam@127 102 }
cannam@127 103
cannam@127 104 static const tw_instr twinstr[] = {
cannam@127 105 VTW(0, 1),
cannam@127 106 {TW_NEXT, VL, 0}
cannam@127 107 };
cannam@127 108
cannam@127 109 static const ct_desc desc = { 2, XSIMD_STRING("q1bv_2"), twinstr, &GENUS, {6, 4, 0, 0}, 0, 0, 0 };
cannam@127 110
cannam@127 111 void XSIMD(codelet_q1bv_2) (planner *p) {
cannam@127 112 X(kdft_difsq_register) (p, q1bv_2, &desc);
cannam@127 113 }
cannam@127 114 #endif /* HAVE_FMA */