2
* Copyright (c) 2003, 2006 Matteo Frigo
3
* Copyright (c) 2003, 2006 Massachusetts Institute of Technology
5
* This program is free software; you can redistribute it and/or modify
6
* it under the terms of the GNU General Public License as published by
7
* the Free Software Foundation; either version 2 of the License, or
8
* (at your option) any later version.
10
* This program is distributed in the hope that it will be useful,
11
* but WITHOUT ANY WARRANTY; without even the implied warranty of
12
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13
* GNU General Public License for more details.
15
* You should have received a copy of the GNU General Public License
16
* along with this program; if not, write to the Free Software
17
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
21
/* This file was automatically generated --- DO NOT EDIT */
22
/* Generated on Sat Jul 1 14:32:30 EDT 2006 */
24
#include "codelet-dft.h"
28
/* Generated by: ../../../genfft/gen_notw_c -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 2 -name n2fv_2 -with-ostride 2 -include n2f.h -store-multiple 2 */
31
* This function contains 2 FP additions, 0 FP multiplications,
32
* (or, 2 additions, 0 multiplications, 0 fused multiply/add),
33
* 7 stack variables, and 5 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 n2fv_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)]));
56
STM2(&(xo[0]), T3, ovs, &(xo[0]));
58
STM2(&(xo[2]), T4, ovs, &(xo[2]));
59
STN2(&(xo[0]), T3, T4, ovs);
63
static const kdft_desc desc = { 2, "n2fv_2", {2, 0, 0, 0}, &GENUS, 0, 2, 0, 0 };
64
void X(codelet_n2fv_2) (planner *p) {
65
X(kdft_register) (p, n2fv_2, &desc);
70
/* Generated by: ../../../genfft/gen_notw_c -simd -compact -variables 4 -pipeline-latency 8 -n 2 -name n2fv_2 -with-ostride 2 -include n2f.h -store-multiple 2 */
73
* This function contains 2 FP additions, 0 FP multiplications,
74
* (or, 2 additions, 0 multiplications, 0 fused multiply/add),
75
* 7 stack variables, and 5 memory accesses
79
* $Id: algsimp.ml,v 1.9 2006-02-12 23:34:12 athena Exp $
80
* $Id: fft.ml,v 1.4 2006-01-05 03:04:27 stevenj Exp $
81
* $Id: gen_notw_c.ml,v 1.17 2006-02-12 23:34:12 athena Exp $
86
static void n2fv_2(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
93
for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(is), MAKE_VOLATILE_STRIDE(os)) {
95
T1 = LD(&(xi[0]), ivs, &(xi[0]));
96
T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
98
STM2(&(xo[2]), T3, ovs, &(xo[2]));
100
STM2(&(xo[0]), T4, ovs, &(xo[0]));
101
STN2(&(xo[0]), T4, T3, ovs);
105
static const kdft_desc desc = { 2, "n2fv_2", {2, 0, 0, 0}, &GENUS, 0, 2, 0, 0 };
106
void X(codelet_n2fv_2) (planner *p) {
107
X(kdft_register) (p, n2fv_2, &desc);
110
#endif /* HAVE_FMA */