annotate src/fftw-3.3.5/dft/simd/common/n2fv_6.c @ 148:b4bfdf10c4b3

Update Win64 capnp builds to v0.6
author Chris Cannam <cannam@all-day-breakfast.com>
date Mon, 22 May 2017 18:56:49 +0100
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:40:07 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_notw_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 6 -name n2fv_6 -with-ostride 2 -include n2f.h -store-multiple 2 */
cannam@127 29
cannam@127 30 /*
cannam@127 31 * This function contains 18 FP additions, 8 FP multiplications,
cannam@127 32 * (or, 12 additions, 2 multiplications, 6 fused multiply/add),
cannam@127 33 * 29 stack variables, 2 constants, and 15 memory accesses
cannam@127 34 */
cannam@127 35 #include "n2f.h"
cannam@127 36
cannam@127 37 static void n2fv_6(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
cannam@127 38 {
cannam@127 39 DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
cannam@127 40 DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
cannam@127 41 {
cannam@127 42 INT i;
cannam@127 43 const R *xi;
cannam@127 44 R *xo;
cannam@127 45 xi = ri;
cannam@127 46 xo = ro;
cannam@127 47 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(12, is), MAKE_VOLATILE_STRIDE(12, os)) {
cannam@127 48 V T1, T2, T4, T5, T7, T8;
cannam@127 49 T1 = LD(&(xi[0]), ivs, &(xi[0]));
cannam@127 50 T2 = LD(&(xi[WS(is, 3)]), ivs, &(xi[WS(is, 1)]));
cannam@127 51 T4 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
cannam@127 52 T5 = LD(&(xi[WS(is, 5)]), ivs, &(xi[WS(is, 1)]));
cannam@127 53 T7 = LD(&(xi[WS(is, 4)]), ivs, &(xi[0]));
cannam@127 54 T8 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
cannam@127 55 {
cannam@127 56 V T3, Td, T6, Te, T9, Tf;
cannam@127 57 T3 = VSUB(T1, T2);
cannam@127 58 Td = VADD(T1, T2);
cannam@127 59 T6 = VSUB(T4, T5);
cannam@127 60 Te = VADD(T4, T5);
cannam@127 61 T9 = VSUB(T7, T8);
cannam@127 62 Tf = VADD(T7, T8);
cannam@127 63 {
cannam@127 64 V Tg, Ti, Ta, Tc;
cannam@127 65 Tg = VADD(Te, Tf);
cannam@127 66 Ti = VMUL(LDK(KP866025403), VSUB(Tf, Te));
cannam@127 67 Ta = VADD(T6, T9);
cannam@127 68 Tc = VMUL(LDK(KP866025403), VSUB(T9, T6));
cannam@127 69 {
cannam@127 70 V Th, Tj, Tb, Tk;
cannam@127 71 Th = VFNMS(LDK(KP500000000), Tg, Td);
cannam@127 72 Tj = VADD(Td, Tg);
cannam@127 73 STM2(&(xo[0]), Tj, ovs, &(xo[0]));
cannam@127 74 Tb = VFNMS(LDK(KP500000000), Ta, T3);
cannam@127 75 Tk = VADD(T3, Ta);
cannam@127 76 STM2(&(xo[6]), Tk, ovs, &(xo[2]));
cannam@127 77 {
cannam@127 78 V Tl, Tm, Tn, To;
cannam@127 79 Tl = VFMAI(Ti, Th);
cannam@127 80 STM2(&(xo[8]), Tl, ovs, &(xo[0]));
cannam@127 81 Tm = VFNMSI(Ti, Th);
cannam@127 82 STM2(&(xo[4]), Tm, ovs, &(xo[0]));
cannam@127 83 STN2(&(xo[4]), Tm, Tk, ovs);
cannam@127 84 Tn = VFMAI(Tc, Tb);
cannam@127 85 STM2(&(xo[2]), Tn, ovs, &(xo[2]));
cannam@127 86 STN2(&(xo[0]), Tj, Tn, ovs);
cannam@127 87 To = VFNMSI(Tc, Tb);
cannam@127 88 STM2(&(xo[10]), To, ovs, &(xo[2]));
cannam@127 89 STN2(&(xo[8]), Tl, To, ovs);
cannam@127 90 }
cannam@127 91 }
cannam@127 92 }
cannam@127 93 }
cannam@127 94 }
cannam@127 95 }
cannam@127 96 VLEAVE();
cannam@127 97 }
cannam@127 98
cannam@127 99 static const kdft_desc desc = { 6, XSIMD_STRING("n2fv_6"), {12, 2, 6, 0}, &GENUS, 0, 2, 0, 0 };
cannam@127 100
cannam@127 101 void XSIMD(codelet_n2fv_6) (planner *p) {
cannam@127 102 X(kdft_register) (p, n2fv_6, &desc);
cannam@127 103 }
cannam@127 104
cannam@127 105 #else /* HAVE_FMA */
cannam@127 106
cannam@127 107 /* Generated by: ../../../genfft/gen_notw_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 6 -name n2fv_6 -with-ostride 2 -include n2f.h -store-multiple 2 */
cannam@127 108
cannam@127 109 /*
cannam@127 110 * This function contains 18 FP additions, 4 FP multiplications,
cannam@127 111 * (or, 16 additions, 2 multiplications, 2 fused multiply/add),
cannam@127 112 * 25 stack variables, 2 constants, and 15 memory accesses
cannam@127 113 */
cannam@127 114 #include "n2f.h"
cannam@127 115
cannam@127 116 static void n2fv_6(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
cannam@127 117 {
cannam@127 118 DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
cannam@127 119 DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
cannam@127 120 {
cannam@127 121 INT i;
cannam@127 122 const R *xi;
cannam@127 123 R *xo;
cannam@127 124 xi = ri;
cannam@127 125 xo = ro;
cannam@127 126 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(12, is), MAKE_VOLATILE_STRIDE(12, os)) {
cannam@127 127 V T3, Td, T6, Te, T9, Tf, Ta, Tg, T1, T2, Tj, Tk;
cannam@127 128 T1 = LD(&(xi[0]), ivs, &(xi[0]));
cannam@127 129 T2 = LD(&(xi[WS(is, 3)]), ivs, &(xi[WS(is, 1)]));
cannam@127 130 T3 = VSUB(T1, T2);
cannam@127 131 Td = VADD(T1, T2);
cannam@127 132 {
cannam@127 133 V T4, T5, T7, T8;
cannam@127 134 T4 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
cannam@127 135 T5 = LD(&(xi[WS(is, 5)]), ivs, &(xi[WS(is, 1)]));
cannam@127 136 T6 = VSUB(T4, T5);
cannam@127 137 Te = VADD(T4, T5);
cannam@127 138 T7 = LD(&(xi[WS(is, 4)]), ivs, &(xi[0]));
cannam@127 139 T8 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
cannam@127 140 T9 = VSUB(T7, T8);
cannam@127 141 Tf = VADD(T7, T8);
cannam@127 142 }
cannam@127 143 Ta = VADD(T6, T9);
cannam@127 144 Tg = VADD(Te, Tf);
cannam@127 145 Tj = VADD(T3, Ta);
cannam@127 146 STM2(&(xo[6]), Tj, ovs, &(xo[2]));
cannam@127 147 Tk = VADD(Td, Tg);
cannam@127 148 STM2(&(xo[0]), Tk, ovs, &(xo[0]));
cannam@127 149 {
cannam@127 150 V Tl, Tb, Tc, Tm;
cannam@127 151 Tb = VFNMS(LDK(KP500000000), Ta, T3);
cannam@127 152 Tc = VBYI(VMUL(LDK(KP866025403), VSUB(T9, T6)));
cannam@127 153 Tl = VSUB(Tb, Tc);
cannam@127 154 STM2(&(xo[10]), Tl, ovs, &(xo[2]));
cannam@127 155 Tm = VADD(Tb, Tc);
cannam@127 156 STM2(&(xo[2]), Tm, ovs, &(xo[2]));
cannam@127 157 STN2(&(xo[0]), Tk, Tm, ovs);
cannam@127 158 {
cannam@127 159 V Th, Ti, Tn, To;
cannam@127 160 Th = VFNMS(LDK(KP500000000), Tg, Td);
cannam@127 161 Ti = VBYI(VMUL(LDK(KP866025403), VSUB(Tf, Te)));
cannam@127 162 Tn = VSUB(Th, Ti);
cannam@127 163 STM2(&(xo[4]), Tn, ovs, &(xo[0]));
cannam@127 164 STN2(&(xo[4]), Tn, Tj, ovs);
cannam@127 165 To = VADD(Th, Ti);
cannam@127 166 STM2(&(xo[8]), To, ovs, &(xo[0]));
cannam@127 167 STN2(&(xo[8]), To, Tl, ovs);
cannam@127 168 }
cannam@127 169 }
cannam@127 170 }
cannam@127 171 }
cannam@127 172 VLEAVE();
cannam@127 173 }
cannam@127 174
cannam@127 175 static const kdft_desc desc = { 6, XSIMD_STRING("n2fv_6"), {16, 2, 2, 0}, &GENUS, 0, 2, 0, 0 };
cannam@127 176
cannam@127 177 void XSIMD(codelet_n2fv_6) (planner *p) {
cannam@127 178 X(kdft_register) (p, n2fv_6, &desc);
cannam@127 179 }
cannam@127 180
cannam@127 181 #endif /* HAVE_FMA */