1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
/*
* Copyright (c) 2003 Matteo Frigo
* Copyright (c) 2003 Massachusetts Institute of Technology
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
/* This file was automatically generated --- DO NOT EDIT */
/* Generated on Sat Jul 5 21:56:40 EDT 2003 */
#include "codelet-rdft.h"
/* Generated by: /homee/stevenj/cvs/fftw3.0.1/genfft/gen_r2hc -compact -variables 4 -n 2 -name r2hc_2 -include r2hc.h */
/*
* This function contains 2 FP additions, 0 FP multiplications,
* (or, 2 additions, 0 multiplications, 0 fused multiply/add),
* 3 stack variables, and 4 memory accesses
*/
/*
* Generator Id's :
* $Id: r2hc_2.c,v 1.1 2008/10/17 06:12:34 scuri Exp $
* $Id: r2hc_2.c,v 1.1 2008/10/17 06:12:34 scuri Exp $
* $Id: r2hc_2.c,v 1.1 2008/10/17 06:12:34 scuri Exp $
*/
#include "r2hc.h"
static void r2hc_2(const R *I, R *ro, R *io, stride is, stride ros, stride ios, int v, int ivs, int ovs)
{
int i;
for (i = v; i > 0; i = i - 1, I = I + ivs, ro = ro + ovs, io = io + ovs) {
E T1, T2;
T1 = I[0];
T2 = I[WS(is, 1)];
ro[WS(ros, 1)] = T1 - T2;
ro[0] = T1 + T2;
}
}
static const kr2hc_desc desc = { 2, "r2hc_2", {2, 0, 0, 0}, &GENUS, 0, 0, 0, 0, 0 };
void X(codelet_r2hc_2) (planner *p) {
X(kr2hc_register) (p, r2hc_2, &desc);
}
|
