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