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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
/*
* 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 22:11:22 EDT 2003 */
#include "codelet-rdft.h"
/* Generated by: /homee/stevenj/cvs/fftw3.0.1/genfft/gen_hc2hc -compact -variables 4 -sign 1 -n 2 -dif -name hb_2 -include hb.h */
/*
* This function contains 6 FP additions, 4 FP multiplications,
* (or, 4 additions, 2 multiplications, 2 fused multiply/add),
* 9 stack variables, and 8 memory accesses
*/
/*
* Generator Id's :
* $Id: hb_2.c,v 1.1 2008/10/17 06:12:08 scuri Exp $
* $Id: hb_2.c,v 1.1 2008/10/17 06:12:08 scuri Exp $
* $Id: hb_2.c,v 1.1 2008/10/17 06:12:08 scuri Exp $
*/
#include "hb.h"
static const R *hb_2(R *rio, R *iio, const R *W, stride ios, int m, int dist)
{
int i;
for (i = m - 2; i > 0; i = i - 2, rio = rio + dist, iio = iio - dist, W = W + 2) {
E T1, T2, T6, T3, T4, T8, T5, T7;
T1 = rio[0];
T2 = iio[-WS(ios, 1)];
T6 = T1 - T2;
T3 = iio[0];
T4 = rio[WS(ios, 1)];
T8 = T3 + T4;
rio[0] = T1 + T2;
iio[-WS(ios, 1)] = T3 - T4;
T5 = W[0];
T7 = W[1];
rio[WS(ios, 1)] = FNMS(T7, T8, T5 * T6);
iio[0] = FMA(T7, T6, T5 * T8);
}
return W;
}
static const tw_instr twinstr[] = {
{TW_FULL, 0, 2},
{TW_NEXT, 1, 0}
};
static const hc2hc_desc desc = { 2, "hb_2", twinstr, {4, 2, 2, 0}, &GENUS, 0, 0, 0 };
void X(codelet_hb_2) (planner *p) {
X(khc2hc_dif_register) (p, hb_2, &desc);
}
|
