annotate src/fftw-3.3.3/dft/simd/common/n2bv_4.c @ 23:619f715526df sv_v2.1

Update Vamp plugin SDK to 2.5
author Chris Cannam
date Thu, 09 May 2013 10:52:46 +0100
parents 37bf6b4a2645
children
rev   line source
Chris@10 1 /*
Chris@10 2 * Copyright (c) 2003, 2007-11 Matteo Frigo
Chris@10 3 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
Chris@10 4 *
Chris@10 5 * This program is free software; you can redistribute it and/or modify
Chris@10 6 * it under the terms of the GNU General Public License as published by
Chris@10 7 * the Free Software Foundation; either version 2 of the License, or
Chris@10 8 * (at your option) any later version.
Chris@10 9 *
Chris@10 10 * This program is distributed in the hope that it will be useful,
Chris@10 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@10 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@10 13 * GNU General Public License for more details.
Chris@10 14 *
Chris@10 15 * You should have received a copy of the GNU General Public License
Chris@10 16 * along with this program; if not, write to the Free Software
Chris@10 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@10 18 *
Chris@10 19 */
Chris@10 20
Chris@10 21 /* This file was automatically generated --- DO NOT EDIT */
Chris@10 22 /* Generated on Sun Nov 25 07:37:29 EST 2012 */
Chris@10 23
Chris@10 24 #include "codelet-dft.h"
Chris@10 25
Chris@10 26 #ifdef HAVE_FMA
Chris@10 27
Chris@10 28 /* Generated by: ../../../genfft/gen_notw_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -sign 1 -n 4 -name n2bv_4 -with-ostride 2 -include n2b.h -store-multiple 2 */
Chris@10 29
Chris@10 30 /*
Chris@10 31 * This function contains 8 FP additions, 2 FP multiplications,
Chris@10 32 * (or, 6 additions, 0 multiplications, 2 fused multiply/add),
Chris@10 33 * 15 stack variables, 0 constants, and 10 memory accesses
Chris@10 34 */
Chris@10 35 #include "n2b.h"
Chris@10 36
Chris@10 37 static void n2bv_4(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@10 38 {
Chris@10 39 {
Chris@10 40 INT i;
Chris@10 41 const R *xi;
Chris@10 42 R *xo;
Chris@10 43 xi = ii;
Chris@10 44 xo = io;
Chris@10 45 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(8, is), MAKE_VOLATILE_STRIDE(8, os)) {
Chris@10 46 V T1, T2, T4, T5;
Chris@10 47 T1 = LD(&(xi[0]), ivs, &(xi[0]));
Chris@10 48 T2 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@10 49 T4 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@10 50 T5 = LD(&(xi[WS(is, 3)]), ivs, &(xi[WS(is, 1)]));
Chris@10 51 {
Chris@10 52 V T3, T7, T6, T8;
Chris@10 53 T3 = VSUB(T1, T2);
Chris@10 54 T7 = VADD(T1, T2);
Chris@10 55 T6 = VSUB(T4, T5);
Chris@10 56 T8 = VADD(T4, T5);
Chris@10 57 {
Chris@10 58 V T9, Ta, Tb, Tc;
Chris@10 59 T9 = VSUB(T7, T8);
Chris@10 60 STM2(&(xo[4]), T9, ovs, &(xo[0]));
Chris@10 61 Ta = VADD(T7, T8);
Chris@10 62 STM2(&(xo[0]), Ta, ovs, &(xo[0]));
Chris@10 63 Tb = VFMAI(T6, T3);
Chris@10 64 STM2(&(xo[2]), Tb, ovs, &(xo[2]));
Chris@10 65 STN2(&(xo[0]), Ta, Tb, ovs);
Chris@10 66 Tc = VFNMSI(T6, T3);
Chris@10 67 STM2(&(xo[6]), Tc, ovs, &(xo[2]));
Chris@10 68 STN2(&(xo[4]), T9, Tc, ovs);
Chris@10 69 }
Chris@10 70 }
Chris@10 71 }
Chris@10 72 }
Chris@10 73 VLEAVE();
Chris@10 74 }
Chris@10 75
Chris@10 76 static const kdft_desc desc = { 4, XSIMD_STRING("n2bv_4"), {6, 0, 2, 0}, &GENUS, 0, 2, 0, 0 };
Chris@10 77
Chris@10 78 void XSIMD(codelet_n2bv_4) (planner *p) {
Chris@10 79 X(kdft_register) (p, n2bv_4, &desc);
Chris@10 80 }
Chris@10 81
Chris@10 82 #else /* HAVE_FMA */
Chris@10 83
Chris@10 84 /* Generated by: ../../../genfft/gen_notw_c.native -simd -compact -variables 4 -pipeline-latency 8 -sign 1 -n 4 -name n2bv_4 -with-ostride 2 -include n2b.h -store-multiple 2 */
Chris@10 85
Chris@10 86 /*
Chris@10 87 * This function contains 8 FP additions, 0 FP multiplications,
Chris@10 88 * (or, 8 additions, 0 multiplications, 0 fused multiply/add),
Chris@10 89 * 11 stack variables, 0 constants, and 10 memory accesses
Chris@10 90 */
Chris@10 91 #include "n2b.h"
Chris@10 92
Chris@10 93 static void n2bv_4(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@10 94 {
Chris@10 95 {
Chris@10 96 INT i;
Chris@10 97 const R *xi;
Chris@10 98 R *xo;
Chris@10 99 xi = ii;
Chris@10 100 xo = io;
Chris@10 101 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(8, is), MAKE_VOLATILE_STRIDE(8, os)) {
Chris@10 102 V T3, T7, T6, T8;
Chris@10 103 {
Chris@10 104 V T1, T2, T4, T5;
Chris@10 105 T1 = LD(&(xi[0]), ivs, &(xi[0]));
Chris@10 106 T2 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@10 107 T3 = VSUB(T1, T2);
Chris@10 108 T7 = VADD(T1, T2);
Chris@10 109 T4 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@10 110 T5 = LD(&(xi[WS(is, 3)]), ivs, &(xi[WS(is, 1)]));
Chris@10 111 T6 = VBYI(VSUB(T4, T5));
Chris@10 112 T8 = VADD(T4, T5);
Chris@10 113 }
Chris@10 114 {
Chris@10 115 V T9, Ta, Tb, Tc;
Chris@10 116 T9 = VSUB(T3, T6);
Chris@10 117 STM2(&(xo[6]), T9, ovs, &(xo[2]));
Chris@10 118 Ta = VADD(T7, T8);
Chris@10 119 STM2(&(xo[0]), Ta, ovs, &(xo[0]));
Chris@10 120 Tb = VADD(T3, T6);
Chris@10 121 STM2(&(xo[2]), Tb, ovs, &(xo[2]));
Chris@10 122 STN2(&(xo[0]), Ta, Tb, ovs);
Chris@10 123 Tc = VSUB(T7, T8);
Chris@10 124 STM2(&(xo[4]), Tc, ovs, &(xo[0]));
Chris@10 125 STN2(&(xo[4]), Tc, T9, ovs);
Chris@10 126 }
Chris@10 127 }
Chris@10 128 }
Chris@10 129 VLEAVE();
Chris@10 130 }
Chris@10 131
Chris@10 132 static const kdft_desc desc = { 4, XSIMD_STRING("n2bv_4"), {8, 0, 0, 0}, &GENUS, 0, 2, 0, 0 };
Chris@10 133
Chris@10 134 void XSIMD(codelet_n2bv_4) (planner *p) {
Chris@10 135 X(kdft_register) (p, n2bv_4, &desc);
Chris@10 136 }
Chris@10 137
Chris@10 138 #endif /* HAVE_FMA */