summaryrefslogtreecommitdiff
path: root/src/fftw3/rdft/codelets/hc2r/hb_4.c
blob: ac05b694e635d934cfa853a3bb9011b926f211ce (plain)
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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
/*
 * 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 4 -dif -name hb_4 -include hb.h */

/*
 * This function contains 22 FP additions, 12 FP multiplications,
 * (or, 16 additions, 6 multiplications, 6 fused multiply/add),
 * 13 stack variables, and 16 memory accesses
 */
/*
 * Generator Id's : 
 * $Id: hb_4.c,v 1.1 2008/10/17 06:12:08 scuri Exp $
 * $Id: hb_4.c,v 1.1 2008/10/17 06:12:08 scuri Exp $
 * $Id: hb_4.c,v 1.1 2008/10/17 06:12:08 scuri Exp $
 */

#include "hb.h"

static const R *hb_4(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 + 6) {
	  E T3, Ti, Tc, Tn, T6, Tm, Tf, Tj;
	  {
	       E T1, T2, Ta, Tb;
	       T1 = rio[0];
	       T2 = iio[-WS(ios, 2)];
	       T3 = T1 + T2;
	       Ti = T1 - T2;
	       Ta = iio[0];
	       Tb = rio[WS(ios, 2)];
	       Tc = Ta - Tb;
	       Tn = Ta + Tb;
	  }
	  {
	       E T4, T5, Td, Te;
	       T4 = rio[WS(ios, 1)];
	       T5 = iio[-WS(ios, 3)];
	       T6 = T4 + T5;
	       Tm = T4 - T5;
	       Td = iio[-WS(ios, 1)];
	       Te = rio[WS(ios, 3)];
	       Tf = Td - Te;
	       Tj = Td + Te;
	  }
	  rio[0] = T3 + T6;
	  iio[-WS(ios, 3)] = Tc + Tf;
	  {
	       E Tq, Ts, Tp, Tr;
	       Tq = Tn - Tm;
	       Ts = Ti + Tj;
	       Tp = W[4];
	       Tr = W[5];
	       iio[0] = FMA(Tp, Tq, Tr * Ts);
	       rio[WS(ios, 3)] = FNMS(Tr, Tq, Tp * Ts);
	  }
	  {
	       E T8, Tg, T7, T9;
	       T8 = T3 - T6;
	       Tg = Tc - Tf;
	       T7 = W[2];
	       T9 = W[3];
	       rio[WS(ios, 2)] = FNMS(T9, Tg, T7 * T8);
	       iio[-WS(ios, 1)] = FMA(T9, T8, T7 * Tg);
	  }
	  {
	       E Tk, To, Th, Tl;
	       Tk = Ti - Tj;
	       To = Tm + Tn;
	       Th = W[0];
	       Tl = W[1];
	       rio[WS(ios, 1)] = FNMS(Tl, To, Th * Tk);
	       iio[-WS(ios, 2)] = FMA(Th, To, Tl * Tk);
	  }
     }
     return W;
}

static const tw_instr twinstr[] = {
     {TW_FULL, 0, 4},
     {TW_NEXT, 1, 0}
};

static const hc2hc_desc desc = { 4, "hb_4", twinstr, {16, 6, 6, 0}, &GENUS, 0, 0, 0 };

void X(codelet_hb_4) (planner *p) {
     X(khc2hc_dif_register) (p, hb_4, &desc);
}