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:36:58 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 2 -name n1bv_2 -include n1b.h */
|
Chris@10
|
29
|
Chris@10
|
30 /*
|
Chris@10
|
31 * This function contains 2 FP additions, 0 FP multiplications,
|
Chris@10
|
32 * (or, 2 additions, 0 multiplications, 0 fused multiply/add),
|
Chris@10
|
33 * 5 stack variables, 0 constants, and 4 memory accesses
|
Chris@10
|
34 */
|
Chris@10
|
35 #include "n1b.h"
|
Chris@10
|
36
|
Chris@10
|
37 static void n1bv_2(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(4, is), MAKE_VOLATILE_STRIDE(4, os)) {
|
Chris@10
|
46 V T1, T2;
|
Chris@10
|
47 T1 = LD(&(xi[0]), ivs, &(xi[0]));
|
Chris@10
|
48 T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
|
Chris@10
|
49 ST(&(xo[0]), VADD(T1, T2), ovs, &(xo[0]));
|
Chris@10
|
50 ST(&(xo[WS(os, 1)]), VSUB(T1, T2), ovs, &(xo[WS(os, 1)]));
|
Chris@10
|
51 }
|
Chris@10
|
52 }
|
Chris@10
|
53 VLEAVE();
|
Chris@10
|
54 }
|
Chris@10
|
55
|
Chris@10
|
56 static const kdft_desc desc = { 2, XSIMD_STRING("n1bv_2"), {2, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
|
Chris@10
|
57
|
Chris@10
|
58 void XSIMD(codelet_n1bv_2) (planner *p) {
|
Chris@10
|
59 X(kdft_register) (p, n1bv_2, &desc);
|
Chris@10
|
60 }
|
Chris@10
|
61
|
Chris@10
|
62 #else /* HAVE_FMA */
|
Chris@10
|
63
|
Chris@10
|
64 /* Generated by: ../../../genfft/gen_notw_c.native -simd -compact -variables 4 -pipeline-latency 8 -sign 1 -n 2 -name n1bv_2 -include n1b.h */
|
Chris@10
|
65
|
Chris@10
|
66 /*
|
Chris@10
|
67 * This function contains 2 FP additions, 0 FP multiplications,
|
Chris@10
|
68 * (or, 2 additions, 0 multiplications, 0 fused multiply/add),
|
Chris@10
|
69 * 5 stack variables, 0 constants, and 4 memory accesses
|
Chris@10
|
70 */
|
Chris@10
|
71 #include "n1b.h"
|
Chris@10
|
72
|
Chris@10
|
73 static void n1bv_2(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
|
Chris@10
|
74 {
|
Chris@10
|
75 {
|
Chris@10
|
76 INT i;
|
Chris@10
|
77 const R *xi;
|
Chris@10
|
78 R *xo;
|
Chris@10
|
79 xi = ii;
|
Chris@10
|
80 xo = io;
|
Chris@10
|
81 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(4, is), MAKE_VOLATILE_STRIDE(4, os)) {
|
Chris@10
|
82 V T1, T2;
|
Chris@10
|
83 T1 = LD(&(xi[0]), ivs, &(xi[0]));
|
Chris@10
|
84 T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
|
Chris@10
|
85 ST(&(xo[WS(os, 1)]), VSUB(T1, T2), ovs, &(xo[WS(os, 1)]));
|
Chris@10
|
86 ST(&(xo[0]), VADD(T1, T2), ovs, &(xo[0]));
|
Chris@10
|
87 }
|
Chris@10
|
88 }
|
Chris@10
|
89 VLEAVE();
|
Chris@10
|
90 }
|
Chris@10
|
91
|
Chris@10
|
92 static const kdft_desc desc = { 2, XSIMD_STRING("n1bv_2"), {2, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
|
Chris@10
|
93
|
Chris@10
|
94 void XSIMD(codelet_n1bv_2) (planner *p) {
|
Chris@10
|
95 X(kdft_register) (p, n1bv_2, &desc);
|
Chris@10
|
96 }
|
Chris@10
|
97
|
Chris@10
|
98 #endif /* HAVE_FMA */
|