annotate src/fftw-3.3.3/dft/simd/common/n2fv_4.c @ 129:90a976269628

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