comparison fft/fftw/fftw-3.3.4/genfft/gen_twidsq_c.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 type ditdif = DIT | DIF
27 let ditdif = ref DIT
28
29 let usage = "Usage: " ^ Sys.argv.(0) ^ " -n <number> [ -dit | -dif ]"
30
31 let reload_twiddle = ref false
32
33 let urs = ref Stride_variable
34 let uvs = ref Stride_variable
35 let ums = ref Stride_variable
36
37 let speclist = [
38 "-dit",
39 Arg.Unit(fun () -> ditdif := DIT),
40 " generate a DIT codelet";
41
42 "-dif",
43 Arg.Unit(fun () -> ditdif := DIF),
44 " generate a DIF codelet";
45
46 "-reload-twiddle",
47 Arg.Unit(fun () -> reload_twiddle := true),
48 " do not collect common twiddle factors";
49
50 "-with-rs",
51 Arg.String(fun x -> urs := arg_to_stride x),
52 " specialize for given input stride";
53
54 "-with-vs",
55 Arg.String(fun x -> uvs := arg_to_stride x),
56 " specialize for given vector stride";
57
58 "-with-ms",
59 Arg.String(fun x -> ums := arg_to_stride x),
60 " specialize for given ms"
61 ]
62
63 let generate n =
64 let rioarray = "x"
65 and rs = "rs" and vs = "vs"
66 and twarray = "W"
67 and m = "m" and mb = "mb" and me = "me" and ms = "ms" in
68
69 let sign = !Genutil.sign
70 and name = !Magic.codelet_name
71 and byvl x = choose_simd x (ctimes (CVar "VL", x))
72 and bytwvl x = choose_simd x (ctimes (CVar "TWVL", x))
73 and bytwvl_vl x = choose_simd x (ctimes (CVar "(TWVL/VL)", x)) in
74 let ename = expand_name name in
75
76 let (bytwiddle, num_twiddles, twdesc) = Twiddle.twiddle_policy 0 true in
77 let nt = num_twiddles n in
78
79 let svs = either_stride (!uvs) (C.SVar vs)
80 and srs = either_stride (!urs) (C.SVar rs) in
81 let sms = stride_to_string "ms" !ums in
82
83 let byw =
84 if !reload_twiddle then
85 array n (fun v -> bytwiddle n sign (twiddle_array nt twarray))
86 else
87 let a = bytwiddle n sign (twiddle_array nt twarray)
88 in fun v -> a
89 in
90
91 let locations = unique_v_array_c n n in
92
93 let ioi =
94 locative_v_array_c n n
95 (C.varray_subscript rioarray svs srs)
96 (C.varray_subscript "BUG" svs srs)
97 locations sms
98 and ioo =
99 locative_v_array_c n n
100 (C.varray_subscript rioarray svs srs)
101 (C.varray_subscript "BUG" svs srs)
102 locations sms
103 in
104
105 let lioi = load_v_array_c n n ioi in
106 let fft = Trig.dft_via_rdft in
107 let output =
108 match !ditdif with
109 | DIT -> array n (fun v -> fft sign n (byw v (lioi v)))
110 | DIF -> array n (fun v -> byw v (fft sign n (lioi v)))
111 in
112
113 let odag = store_v_array_c n n ioo (transpose output) in
114 let annot = standard_optimizer odag in
115
116 let vm = CVar m and vmb = CVar mb and vme = CVar me in
117
118 let body = Block (
119 [Decl ("INT", m);
120 Decl (C.realtypep, rioarray)],
121 [Stmt_assign (CVar rioarray,
122 CVar (if (sign < 0) then "ri" else "ii"));
123 For (list_to_comma
124 [Expr_assign (vm, vmb);
125 Expr_assign (CVar twarray,
126 CPlus [CVar twarray;
127 ctimes (vmb,
128 bytwvl_vl (Integer nt))])],
129 Binop (" < ", vm, vme),
130 list_to_comma
131 [Expr_assign (vm, CPlus [vm; byvl (Integer 1)]);
132 Expr_assign (CVar rioarray, CPlus [CVar rioarray;
133 byvl (CVar sms)]);
134 Expr_assign (CVar twarray, CPlus [CVar twarray;
135 bytwvl (Integer nt)]);
136 make_volatile_stride (2*n) (CVar rs);
137 make_volatile_stride (2*n) (CVar vs)
138 ],
139 Asch annot)]) in
140
141 let tree =
142 Fcn (("static void"), ename,
143 [Decl (C.realtypep, "ri");
144 Decl (C.realtypep, "ii");
145 Decl (C.constrealtypep, twarray);
146 Decl (C.stridetype, rs);
147 Decl (C.stridetype, vs);
148 Decl ("INT", mb);
149 Decl ("INT", me);
150 Decl ("INT", ms)],
151 finalize_fcn body)
152 in
153 let twinstr =
154 Printf.sprintf "static const tw_instr twinstr[] = %s;\n\n"
155 (twinstr_to_string "VL" (twdesc n))
156
157 and desc =
158 Printf.sprintf
159 "static const ct_desc desc = {%d, %s, twinstr, &GENUS, %s, %s, %s, %s};\n\n"
160 n (stringify name) (flops_of tree)
161 (stride_to_solverparm !urs)
162 (stride_to_solverparm !uvs)
163 (stride_to_solverparm !ums)
164
165 and register =
166 match !ditdif with
167 | DIT -> "X(kdft_ditsq_register)"
168 | DIF -> "X(kdft_difsq_register)"
169 in
170 let init =
171 "\n" ^
172 twinstr ^
173 desc ^
174 (declare_register_fcn name) ^
175 (Printf.sprintf "{\n%s(p, %s, &desc);\n}" register ename)
176 in
177
178 (unparse tree) ^ "\n" ^ init
179
180
181 let main () =
182 begin
183 parse (speclist @ Twiddle.speclist) usage;
184 print_string (generate (check_size ()));
185 end
186
187 let _ = main()