Mercurial > hg > js-dsp-test
comparison fft/fftw/fftw-3.3.4/genfft/gen_hc2hc.ml @ 19:26056e866c29
Add FFTW to comparison table
author | Chris Cannam |
---|---|
date | Tue, 06 Oct 2015 13:08:39 +0100 |
parents | |
children |
comparison
equal
deleted
inserted
replaced
18:8db794ca3e0b | 19:26056e866c29 |
---|---|
1 (* | |
2 * Copyright (c) 1997-1999 Massachusetts Institute of Technology | |
3 * Copyright (c) 2003, 2007-14 Matteo Frigo | |
4 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology | |
5 * | |
6 * This program is free software; you can redistribute it and/or modify | |
7 * it under the terms of the GNU General Public License as published by | |
8 * the Free Software Foundation; either version 2 of the License, or | |
9 * (at your option) any later version. | |
10 * | |
11 * This program is distributed in the hope that it will be useful, | |
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 * GNU General Public License for more details. | |
15 * | |
16 * You should have received a copy of the GNU General Public License | |
17 * along with this program; if not, write to the Free Software | |
18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | |
19 * | |
20 *) | |
21 | |
22 open Util | |
23 open Genutil | |
24 open C | |
25 | |
26 | |
27 type ditdif = DIT | DIF | |
28 let ditdif = ref DIT | |
29 let usage = "Usage: " ^ Sys.argv.(0) ^ " -n <number> [ -dit | -dif ]" | |
30 | |
31 let urs = ref Stride_variable | |
32 | |
33 let speclist = [ | |
34 "-dit", | |
35 Arg.Unit(fun () -> ditdif := DIT), | |
36 " generate a DIT codelet"; | |
37 | |
38 "-dif", | |
39 Arg.Unit(fun () -> ditdif := DIF), | |
40 " generate a DIF codelet"; | |
41 | |
42 "-with-rs", | |
43 Arg.String(fun x -> urs := arg_to_stride x), | |
44 " specialize for given R-stride"; | |
45 ] | |
46 | |
47 let rioarray = "cr" | |
48 and iioarray = "ci" | |
49 | |
50 let genone sign n transform load store vrs = | |
51 let locations = unique_array_c n in | |
52 let input = | |
53 locative_array_c n | |
54 (C.array_subscript rioarray vrs) | |
55 (C.array_subscript iioarray vrs) | |
56 locations "BUG" in | |
57 let output = transform sign n (load n input) in | |
58 let ioloc = | |
59 locative_array_c n | |
60 (C.array_subscript rioarray vrs) | |
61 (C.array_subscript iioarray vrs) | |
62 locations "BUG" in | |
63 let odag = store n ioloc output in | |
64 let annot = standard_optimizer odag | |
65 in annot | |
66 | |
67 let byi = Complex.times Complex.i | |
68 let byui = Complex.times (Complex.uminus Complex.i) | |
69 | |
70 let sym1 n f i = | |
71 Complex.plus [Complex.real (f i); byi (Complex.imag (f (n - 1 - i)))] | |
72 | |
73 let sym2 n f i = if (i < n - i) then f i else byi (f i) | |
74 let sym2i n f i = if (i < n - i) then f i else byui (f i) | |
75 | |
76 let generate n = | |
77 let rs = "rs" | |
78 and twarray = "W" | |
79 and m = "m" and mb = "mb" and me = "me" and ms = "ms" in | |
80 | |
81 let sign = !Genutil.sign | |
82 and name = !Magic.codelet_name | |
83 and byvl x = choose_simd x (ctimes (CVar "VL", x)) in | |
84 | |
85 let (bytwiddle, num_twiddles, twdesc) = Twiddle.twiddle_policy 1 false in | |
86 let nt = num_twiddles n in | |
87 | |
88 let byw = bytwiddle n sign (twiddle_array nt twarray) in | |
89 | |
90 let vrs = either_stride (!urs) (C.SVar rs) in | |
91 | |
92 let asch = | |
93 match !ditdif with | |
94 | DIT -> | |
95 genone sign n | |
96 (fun sign n input -> | |
97 ((sym1 n) @@ (sym2 n)) (Fft.dft sign n (byw input))) | |
98 load_array_c store_array_c vrs | |
99 | DIF -> | |
100 genone sign n | |
101 (fun sign n input -> | |
102 byw (Fft.dft sign n (((sym2i n) @@ (sym1 n)) input))) | |
103 load_array_c store_array_c vrs | |
104 in | |
105 | |
106 let vms = CVar "ms" | |
107 and vrioarray = CVar rioarray | |
108 and viioarray = CVar iioarray | |
109 and vm = CVar m and vmb = CVar mb and vme = CVar me | |
110 in | |
111 let body = Block ( | |
112 [Decl ("INT", m)], | |
113 [For (list_to_comma | |
114 [Expr_assign (vm, vmb); | |
115 Expr_assign (CVar twarray, | |
116 CPlus [CVar twarray; | |
117 ctimes (CPlus [vmb; CUminus (Integer 1)], | |
118 Integer nt)])], | |
119 Binop (" < ", vm, vme), | |
120 list_to_comma | |
121 [Expr_assign (vm, CPlus [vm; byvl (Integer 1)]); | |
122 Expr_assign (vrioarray, CPlus [vrioarray; byvl vms]); | |
123 Expr_assign (viioarray, | |
124 CPlus [viioarray; CUminus (byvl vms)]); | |
125 Expr_assign (CVar twarray, CPlus [CVar twarray; | |
126 byvl (Integer nt)]); | |
127 make_volatile_stride (2*n) (CVar rs) | |
128 ], | |
129 Asch asch)]) | |
130 in | |
131 | |
132 let tree = | |
133 Fcn ("static void", name, | |
134 [Decl (C.realtypep, rioarray); | |
135 Decl (C.realtypep, iioarray); | |
136 Decl (C.constrealtypep, twarray); | |
137 Decl (C.stridetype, rs); | |
138 Decl ("INT", mb); | |
139 Decl ("INT", me); | |
140 Decl ("INT", ms)], | |
141 finalize_fcn body) | |
142 in | |
143 let twinstr = | |
144 Printf.sprintf "static const tw_instr twinstr[] = %s;\n\n" | |
145 (twinstr_to_string "VL" (twdesc n)) | |
146 and desc = | |
147 Printf.sprintf | |
148 "static const hc2hc_desc desc = {%d, \"%s\", twinstr, &GENUS, %s};\n\n" | |
149 n name (flops_of tree) | |
150 and register = "X(khc2hc_register)" | |
151 | |
152 in | |
153 let init = | |
154 "\n" ^ | |
155 twinstr ^ | |
156 desc ^ | |
157 (declare_register_fcn name) ^ | |
158 (Printf.sprintf "{\n%s(p, %s, &desc);\n}" register name) | |
159 in | |
160 | |
161 (unparse tree) ^ "\n" ^ init | |
162 | |
163 | |
164 let main () = | |
165 begin | |
166 parse (speclist @ Twiddle.speclist) usage; | |
167 print_string (generate (check_size ())); | |
168 end | |
169 | |
170 let _ = main() |