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:42:29 EST 2012 */
|
Chris@10
|
23
|
Chris@10
|
24 #include "codelet-rdft.h"
|
Chris@10
|
25
|
Chris@10
|
26 #ifdef HAVE_FMA
|
Chris@10
|
27
|
Chris@10
|
28 /* Generated by: ../../../genfft/gen_hc2cdft_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -trivial-stores -variables 32 -no-generate-bytw -n 2 -dif -sign 1 -name hc2cbdftv_2 -include hc2cbv.h */
|
Chris@10
|
29
|
Chris@10
|
30 /*
|
Chris@10
|
31 * This function contains 5 FP additions, 4 FP multiplications,
|
Chris@10
|
32 * (or, 3 additions, 2 multiplications, 2 fused multiply/add),
|
Chris@10
|
33 * 8 stack variables, 0 constants, and 4 memory accesses
|
Chris@10
|
34 */
|
Chris@10
|
35 #include "hc2cbv.h"
|
Chris@10
|
36
|
Chris@10
|
37 static void hc2cbdftv_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
|
Chris@10
|
38 {
|
Chris@10
|
39 {
|
Chris@10
|
40 INT m;
|
Chris@10
|
41 for (m = mb, W = W + ((mb - 1) * ((TWVL / VL) * 2)); m < me; m = m + VL, Rp = Rp + (VL * ms), Ip = Ip + (VL * ms), Rm = Rm - (VL * ms), Im = Im - (VL * ms), W = W + (TWVL * 2), MAKE_VOLATILE_STRIDE(8, rs)) {
|
Chris@10
|
42 V T2, T3, T1, T5, T4, T7, T6;
|
Chris@10
|
43 T2 = LD(&(Rp[0]), ms, &(Rp[0]));
|
Chris@10
|
44 T3 = LD(&(Rm[0]), -ms, &(Rm[0]));
|
Chris@10
|
45 T1 = LDW(&(W[0]));
|
Chris@10
|
46 T5 = VFMACONJ(T3, T2);
|
Chris@10
|
47 T4 = VZMULI(T1, VFNMSCONJ(T3, T2));
|
Chris@10
|
48 T7 = VCONJ(VSUB(T5, T4));
|
Chris@10
|
49 T6 = VADD(T4, T5);
|
Chris@10
|
50 ST(&(Rm[0]), T7, -ms, &(Rm[0]));
|
Chris@10
|
51 ST(&(Rp[0]), T6, ms, &(Rp[0]));
|
Chris@10
|
52 }
|
Chris@10
|
53 }
|
Chris@10
|
54 VLEAVE();
|
Chris@10
|
55 }
|
Chris@10
|
56
|
Chris@10
|
57 static const tw_instr twinstr[] = {
|
Chris@10
|
58 VTW(1, 1),
|
Chris@10
|
59 {TW_NEXT, VL, 0}
|
Chris@10
|
60 };
|
Chris@10
|
61
|
Chris@10
|
62 static const hc2c_desc desc = { 2, XSIMD_STRING("hc2cbdftv_2"), twinstr, &GENUS, {3, 2, 2, 0} };
|
Chris@10
|
63
|
Chris@10
|
64 void XSIMD(codelet_hc2cbdftv_2) (planner *p) {
|
Chris@10
|
65 X(khc2c_register) (p, hc2cbdftv_2, &desc, HC2C_VIA_DFT);
|
Chris@10
|
66 }
|
Chris@10
|
67 #else /* HAVE_FMA */
|
Chris@10
|
68
|
Chris@10
|
69 /* Generated by: ../../../genfft/gen_hc2cdft_c.native -simd -compact -variables 4 -pipeline-latency 8 -trivial-stores -variables 32 -no-generate-bytw -n 2 -dif -sign 1 -name hc2cbdftv_2 -include hc2cbv.h */
|
Chris@10
|
70
|
Chris@10
|
71 /*
|
Chris@10
|
72 * This function contains 5 FP additions, 2 FP multiplications,
|
Chris@10
|
73 * (or, 5 additions, 2 multiplications, 0 fused multiply/add),
|
Chris@10
|
74 * 9 stack variables, 0 constants, and 4 memory accesses
|
Chris@10
|
75 */
|
Chris@10
|
76 #include "hc2cbv.h"
|
Chris@10
|
77
|
Chris@10
|
78 static void hc2cbdftv_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
|
Chris@10
|
79 {
|
Chris@10
|
80 {
|
Chris@10
|
81 INT m;
|
Chris@10
|
82 for (m = mb, W = W + ((mb - 1) * ((TWVL / VL) * 2)); m < me; m = m + VL, Rp = Rp + (VL * ms), Ip = Ip + (VL * ms), Rm = Rm - (VL * ms), Im = Im - (VL * ms), W = W + (TWVL * 2), MAKE_VOLATILE_STRIDE(8, rs)) {
|
Chris@10
|
83 V T6, T5, T2, T4, T3, T1, T7, T8;
|
Chris@10
|
84 T2 = LD(&(Rp[0]), ms, &(Rp[0]));
|
Chris@10
|
85 T3 = LD(&(Rm[0]), -ms, &(Rm[0]));
|
Chris@10
|
86 T4 = VCONJ(T3);
|
Chris@10
|
87 T6 = VADD(T2, T4);
|
Chris@10
|
88 T1 = LDW(&(W[0]));
|
Chris@10
|
89 T5 = VZMULI(T1, VSUB(T2, T4));
|
Chris@10
|
90 T7 = VADD(T5, T6);
|
Chris@10
|
91 ST(&(Rp[0]), T7, ms, &(Rp[0]));
|
Chris@10
|
92 T8 = VCONJ(VSUB(T6, T5));
|
Chris@10
|
93 ST(&(Rm[0]), T8, -ms, &(Rm[0]));
|
Chris@10
|
94 }
|
Chris@10
|
95 }
|
Chris@10
|
96 VLEAVE();
|
Chris@10
|
97 }
|
Chris@10
|
98
|
Chris@10
|
99 static const tw_instr twinstr[] = {
|
Chris@10
|
100 VTW(1, 1),
|
Chris@10
|
101 {TW_NEXT, VL, 0}
|
Chris@10
|
102 };
|
Chris@10
|
103
|
Chris@10
|
104 static const hc2c_desc desc = { 2, XSIMD_STRING("hc2cbdftv_2"), twinstr, &GENUS, {5, 2, 0, 0} };
|
Chris@10
|
105
|
Chris@10
|
106 void XSIMD(codelet_hc2cbdftv_2) (planner *p) {
|
Chris@10
|
107 X(khc2c_register) (p, hc2cbdftv_2, &desc, HC2C_VIA_DFT);
|
Chris@10
|
108 }
|
Chris@10
|
109 #endif /* HAVE_FMA */
|