21
21
/* This file was automatically generated --- DO NOT EDIT */
22
/* Generated on Sat Jul 5 21:40:06 EDT 2003 */
22
/* Generated on Tue Mar 7 09:46:58 EST 2006 */
24
24
#include "codelet-dft.h"
26
/* Generated by: /homee/stevenj/cvs/fftw3.0.1/genfft/gen_notw_c -simd -compact -variables 4 -n 2 -name n1fv_2 -include n1f.h */
29
* This function contains 2 FP additions, 0 FP multiplications,
30
* (or, 2 additions, 0 multiplications, 0 fused multiply/add),
31
* 5 stack variables, and 4 memory accesses
35
* $Id: algsimp.ml,v 1.7 2003/03/15 20:29:42 stevenj Exp $
36
* $Id: fft.ml,v 1.2 2003/03/15 20:29:42 stevenj Exp $
37
* $Id: gen_notw_c.ml,v 1.9 2003/04/16 21:21:53 athena Exp $
42
static void n1fv_2(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, int v, int ivs, int ovs)
50
for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs)) {
52
T1 = LD(&(xi[0]), ivs, &(xi[0]));
53
T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
54
ST(&(xo[WS(os, 1)]), VSUB(T1, T2), ovs, &(xo[WS(os, 1)]));
55
ST(&(xo[0]), VADD(T1, T2), ovs, &(xo[0]));
60
static const kdft_desc desc = { 2, "n1fv_2", {2, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
61
void X(codelet_n1fv_2) (planner *p) {
62
X(kdft_register) (p, n1fv_2, &desc);
28
/* Generated by: ../../../genfft/gen_notw_c -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 2 -name n1fv_2 -include n1f.h */
31
* This function contains 2 FP additions, 0 FP multiplications,
32
* (or, 2 additions, 0 multiplications, 0 fused multiply/add),
33
* 5 stack variables, and 4 memory accesses
37
* $Id: algsimp.ml,v 1.9 2006-02-12 23:34:12 athena Exp $
38
* $Id: fft.ml,v 1.4 2006-01-05 03:04:27 stevenj Exp $
39
* $Id: gen_notw_c.ml,v 1.17 2006-02-12 23:34:12 athena Exp $
44
static void n1fv_2(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
51
for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(is), MAKE_VOLATILE_STRIDE(os)) {
53
T1 = LD(&(xi[0]), ivs, &(xi[0]));
54
T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
55
ST(&(xo[0]), VADD(T1, T2), ovs, &(xo[0]));
56
ST(&(xo[WS(os, 1)]), VSUB(T1, T2), ovs, &(xo[WS(os, 1)]));
60
static const kdft_desc desc = { 2, "n1fv_2", {2, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
61
void X(codelet_n1fv_2) (planner *p) {
62
X(kdft_register) (p, n1fv_2, &desc);
67
/* Generated by: ../../../genfft/gen_notw_c -simd -compact -variables 4 -pipeline-latency 8 -n 2 -name n1fv_2 -include n1f.h */
70
* This function contains 2 FP additions, 0 FP multiplications,
71
* (or, 2 additions, 0 multiplications, 0 fused multiply/add),
72
* 5 stack variables, and 4 memory accesses
76
* $Id: algsimp.ml,v 1.9 2006-02-12 23:34:12 athena Exp $
77
* $Id: fft.ml,v 1.4 2006-01-05 03:04:27 stevenj Exp $
78
* $Id: gen_notw_c.ml,v 1.17 2006-02-12 23:34:12 athena Exp $
83
static void n1fv_2(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
90
for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(is), MAKE_VOLATILE_STRIDE(os)) {
92
T1 = LD(&(xi[0]), ivs, &(xi[0]));
93
T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
94
ST(&(xo[WS(os, 1)]), VSUB(T1, T2), ovs, &(xo[WS(os, 1)]));
95
ST(&(xo[0]), VADD(T1, T2), ovs, &(xo[0]));
99
static const kdft_desc desc = { 2, "n1fv_2", {2, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
100
void X(codelet_n1fv_2) (planner *p) {
101
X(kdft_register) (p, n1fv_2, &desc);
104
#endif /* HAVE_FMA */