Chris@42: (* Chris@42: * Copyright (c) 1997-1999 Massachusetts Institute of Technology Chris@42: * Copyright (c) 2003, 2007-14 Matteo Frigo Chris@42: * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology Chris@42: * Chris@42: * This program is free software; you can redistribute it and/or modify Chris@42: * it under the terms of the GNU General Public License as published by Chris@42: * the Free Software Foundation; either version 2 of the License, or Chris@42: * (at your option) any later version. Chris@42: * Chris@42: * This program is distributed in the hope that it will be useful, Chris@42: * but WITHOUT ANY WARRANTY; without even the implied warranty of Chris@42: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the Chris@42: * GNU General Public License for more details. Chris@42: * Chris@42: * You should have received a copy of the GNU General Public License Chris@42: * along with this program; if not, write to the Free Software Chris@42: * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Chris@42: * Chris@42: *) Chris@42: Chris@42: open Util Chris@42: open Genutil Chris@42: open C Chris@42: Chris@42: type ditdif = DIT | DIF Chris@42: let ditdif = ref DIT Chris@42: Chris@42: let usage = "Usage: " ^ Sys.argv.(0) ^ " -n [ -dit | -dif ]" Chris@42: Chris@42: let reload_twiddle = ref false Chris@42: Chris@42: let urs = ref Stride_variable Chris@42: let uvs = ref Stride_variable Chris@42: let ums = ref Stride_variable Chris@42: Chris@42: let speclist = [ Chris@42: "-dit", Chris@42: Arg.Unit(fun () -> ditdif := DIT), Chris@42: " generate a DIT codelet"; Chris@42: Chris@42: "-dif", Chris@42: Arg.Unit(fun () -> ditdif := DIF), Chris@42: " generate a DIF codelet"; Chris@42: Chris@42: "-reload-twiddle", Chris@42: Arg.Unit(fun () -> reload_twiddle := true), Chris@42: " do not collect common twiddle factors"; Chris@42: Chris@42: "-with-rs", Chris@42: Arg.String(fun x -> urs := arg_to_stride x), Chris@42: " specialize for given input stride"; Chris@42: Chris@42: "-with-vs", Chris@42: Arg.String(fun x -> uvs := arg_to_stride x), Chris@42: " specialize for given vector stride"; Chris@42: Chris@42: "-with-ms", Chris@42: Arg.String(fun x -> ums := arg_to_stride x), Chris@42: " specialize for given ms" Chris@42: ] Chris@42: Chris@42: let generate n = Chris@42: let rioarray = "rio" Chris@42: and iioarray = "iio" Chris@42: and rs = "rs" and vs = "vs" Chris@42: and twarray = "W" Chris@42: and m = "m" and mb = "mb" and me = "me" and ms = "ms" in Chris@42: Chris@42: let sign = !Genutil.sign Chris@42: and name = !Magic.codelet_name in Chris@42: Chris@42: let (bytwiddle, num_twiddles, twdesc) = Twiddle.twiddle_policy 0 false in Chris@42: let nt = num_twiddles n in Chris@42: Chris@42: let svs = either_stride (!uvs) (C.SVar vs) Chris@42: and srs = either_stride (!urs) (C.SVar rs) in Chris@42: Chris@42: let byw = Chris@42: if !reload_twiddle then Chris@42: array n (fun v -> bytwiddle n sign (twiddle_array nt twarray)) Chris@42: else Chris@42: let a = bytwiddle n sign (twiddle_array nt twarray) Chris@42: in fun v -> a Chris@42: in Chris@42: Chris@42: let locations = unique_v_array_c n n in Chris@42: Chris@42: let ioi = Chris@42: locative_v_array_c n n Chris@42: (C.varray_subscript rioarray svs srs) Chris@42: (C.varray_subscript iioarray svs srs) Chris@42: locations "BUG" Chris@42: and ioo = Chris@42: locative_v_array_c n n Chris@42: (C.varray_subscript rioarray svs srs) Chris@42: (C.varray_subscript iioarray svs srs) Chris@42: locations "BUG" Chris@42: in Chris@42: Chris@42: let lioi = load_v_array_c n n ioi in Chris@42: let output = Chris@42: match !ditdif with Chris@42: | DIT -> array n (fun v -> Fft.dft sign n (byw v (lioi v))) Chris@42: | DIF -> array n (fun v -> byw v (Fft.dft sign n (lioi v))) Chris@42: in Chris@42: Chris@42: let odag = store_v_array_c n n ioo (transpose output) in Chris@42: let annot = standard_optimizer odag in Chris@42: Chris@42: let vm = CVar m and vmb = CVar mb and vme = CVar me in Chris@42: Chris@42: let body = Block ( Chris@42: [Decl ("INT", m)], Chris@42: [For (list_to_comma Chris@42: [Expr_assign (vm, vmb); Chris@42: Expr_assign (CVar twarray, Chris@42: CPlus [CVar twarray; Chris@42: ctimes (vmb, Integer nt)])], Chris@42: Binop (" < ", vm, vme), Chris@42: list_to_comma Chris@42: [Expr_assign (vm, CPlus [vm; Integer 1]); Chris@42: Expr_assign (CVar rioarray, CPlus [CVar rioarray; CVar ms]); Chris@42: Expr_assign (CVar iioarray, CPlus [CVar iioarray; CVar ms]); Chris@42: Expr_assign (CVar twarray, CPlus [CVar twarray; Integer nt]); Chris@42: make_volatile_stride (2*n) (CVar rs); Chris@42: make_volatile_stride (2*0) (CVar vs) Chris@42: ], Chris@42: Asch annot)]) in Chris@42: Chris@42: let tree = Chris@42: Fcn (("static void"), name, Chris@42: [Decl (C.realtypep, rioarray); Chris@42: Decl (C.realtypep, iioarray); Chris@42: Decl (C.constrealtypep, twarray); Chris@42: Decl (C.stridetype, rs); Chris@42: Decl (C.stridetype, vs); Chris@42: Decl ("INT", mb); Chris@42: Decl ("INT", me); Chris@42: Decl ("INT", ms)], Chris@42: finalize_fcn body) Chris@42: in Chris@42: let twinstr = Chris@42: Printf.sprintf "static const tw_instr twinstr[] = %s;\n\n" Chris@42: (Twiddle.twinstr_to_c_string (twdesc n)) Chris@42: Chris@42: and desc = Chris@42: Printf.sprintf Chris@42: "static const ct_desc desc = {%d, \"%s\", twinstr, &GENUS, %s, %s, %s, %s};\n\n" Chris@42: n name (flops_of tree) Chris@42: (stride_to_solverparm !urs) (stride_to_solverparm !uvs) Chris@42: (stride_to_solverparm !ums) Chris@42: Chris@42: and register = Chris@42: match !ditdif with Chris@42: | DIT -> "X(kdft_ditsq_register)" Chris@42: | DIF -> "X(kdft_difsq_register)" Chris@42: in Chris@42: let init = Chris@42: "\n" ^ Chris@42: twinstr ^ Chris@42: desc ^ Chris@42: (declare_register_fcn name) ^ Chris@42: (Printf.sprintf "{\n%s(p, %s, &desc);\n}" register name) Chris@42: in Chris@42: Chris@42: (unparse tree) ^ "\n" ^ init Chris@42: Chris@42: Chris@42: let main () = Chris@42: begin Chris@42: parse (speclist @ Twiddle.speclist) usage; Chris@42: print_string (generate (check_size ())); Chris@42: end Chris@42: Chris@42: let _ = main()