X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Flambda-delta%2Ftoplevel%2Ftop.ml;h=873d5c590fc1a1b6c5b7e90f0ef150361eb4813c;hb=2b821e608cc1fceebc13e85867a244fe02edf71e;hp=1fd2b718c7ce0674438f802d5c2f3a4065d3e8f6;hpb=cbdccfa38c3e05d697318cfbb9903a451e4e80d6;p=helm.git diff --git a/helm/software/lambda-delta/toplevel/top.ml b/helm/software/lambda-delta/toplevel/top.ml index 1fd2b718c..873d5c590 100644 --- a/helm/software/lambda-delta/toplevel/top.ml +++ b/helm/software/lambda-delta/toplevel/top.ml @@ -1,49 +1,235 @@ -(* Copyright (C) 2000, HELM Team. - * - * This file is part of HELM, an Hypertextual, Electronic - * Library of Mathematics, developed at the Computer Science - * Department, University of Bologna, Italy. - * - * HELM 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. - * - * HELM 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 HELM; if not, write to the Free Software - * Foundation, Inc., 59 Temple Place - Suite 330, Boston, - * MA 02111-1307, USA. - * - * For details, see the HELM World-Wide-Web page, - * http://cs.unibo.it/helm/. - *) - -module AH = AutHelpers +(* + ||M|| This file is part of HELM, an Hypertextual, Electronic + ||A|| Library of Mathematics, developed at the Computer Science + ||T|| Department, University of Bologna, Italy. + ||I|| + ||T|| HELM is free software; you can redistribute it and/or + ||A|| modify it under the terms of the GNU General Public License + \ / version 2 or (at your option) any later version. + \ / This software is distributed as is, NO WARRANTY. + V_______________________________________________________________ *) + +module P = Printf +module U = NUri +module C = Cps +module L = Log +module H = Hierarchy +module O = Output +module AP = AutProcess +module AO = AutOutput +module MA = MetaAut +module MO = MetaOutput +module MBrg = MetaBrg +module BrgO = BrgOutput +module BrgT = BrgType +module BrgU = BrgUntrusted +module MBag = MetaBag +module BagO = BagOutput +module BagR = BagReduction +module BagU = BagUntrusted + +type status = { + ast : AP.status; + mst : MA.status; + ac : AO.counters; + mc : MO.counters; + brgc: BrgO.counters; + bagc: BagO.counters +} + +let initial_status cover = { + ac = AO.initial_counters; + mc = MO.initial_counters; + brgc = BrgO.initial_counters; + bagc = BagO.initial_counters; + mst = MA.initial_status ~cover (); + ast = AP.initial_status +} + +let count count_fun c item = + if !L.level > 2 then count_fun C.start c item else c + +let flush () = L.flush 0; L.flush_err () + +let bag_error s msg = + L.error BagO.specs (L.Warn s :: L.Loc :: msg); flush () + +let brg_error s msg = + L.error BrgO.specs (L.Warn s :: L.Loc :: msg); flush () + +let process_item f st = + let f ast = f {st with ast = ast} in + AP.process_item f st.ast + +(* kernel related ***********************************************************) + +type kernel = Brg | Bag + +type kernel_item = BrgItem of Brg.item + | BagItem of Bag.item + +let kernel = ref Brg + +let print_counters st = match !kernel with + | Brg -> BrgO.print_counters C.start st.brgc + | Bag -> BagO.print_counters C.start st.bagc + +let kernel_of_meta f st item = match !kernel with + | Brg -> + let f item = f st (BrgItem item) in + MBrg.brg_of_meta f item + | Bag -> + let f item = f st (BagItem item) in + MBag.bag_of_meta f item + +let count_item st = function + | BrgItem item -> {st with brgc = count BrgO.count_item st.brgc item} + | BagItem item -> {st with bagc = count BagO.count_item st.bagc item} + +let type_check f st g = function + | BrgItem item -> + let f _ = function + | None -> f st None + | Some (i, u, _) -> f st (Some (i, u)) + in + BrgU.type_check f g item + | BagItem item -> + let f _ = function + | None -> f st None + | Some (i, u, _) -> f st (Some (i, u)) + in + BagU.type_check f g item + +let si () = match !kernel with + | Brg -> BrgT.si := true + | Bag -> BagR.nsi := true + +(****************************************************************************) let main = - let version_string = "Helena Checker 0.8.0 M (June 2008)" in - let summary = ref 0 in - let set_summary i = summary := i in - let print_version () = print_endline version_string; exit 0 in +try + let version_string = "Helena 0.8.0 M - July 2009" in + let stage = ref 3 in + let meta_file = ref None in + let progress = ref false in + let use_cover = ref true in + let set_hierarchy s = + let f = function + | Some g -> H.graph := g + | None -> L.warn (P.sprintf "Unknown type hierarchy: %s" s) + in + H.graph_of_string f s + in + let set_kernel = function + | "brg" -> kernel := Brg + | "bag" -> kernel := Bag + | s -> L.warn (P.sprintf "Unknown kernel version: %s" s) + in + let set_summary i = L.level := i in + let print_version () = L.warn (version_string ^ "\n"); exit 0 in + let set_stage i = stage := i in + let close = function + | None -> () + | Some (och, _) -> close_out och + in + let set_meta_file name = + close !meta_file; + let och = open_out name in + let frm = Format.formatter_of_out_channel och in + Format.pp_set_margin frm max_int; + meta_file := Some (och, frm) + in let read_file name = - if !summary > 0 then - Printf.printf "Processing file: %s\n" name; flush stdout; + if !L.level > 0 then Time.gmtime version_string; + if !L.level > 1 then + L.warn (P.sprintf "Processing file: %s" name); + if !L.level > 0 then Time.utime_stamp "started"; let ich = open_in name in let lexbuf = Lexing.from_channel ich in let book = AutParser.book AutLexer.token lexbuf in close_in ich; - if !summary > 1 then - AH.count (AH.print_counters Cps.id) AH.initial_counters book + if !L.level > 0 then Time.utime_stamp "parsed"; + let rec aux st = function + | [] -> st + | item :: tl -> +(* stage 3 *) + let f st = function + | None -> st + | Some (i, u) -> + if !progress then + Log.warn (P.sprintf "[%u] %s" i (U.string_of_uri u)); + st + in +(* stage 2 *) + let f st item = + let st = count_item st item in + if !stage > 2 then type_check f st !H.graph item else st + in +(* stage 1 *) + let f st mst item = + let st = {st with + mst = mst; mc = count MO.count_item st.mc item + } in + begin match !meta_file with + | None -> () + | Some (_, frm) -> MO.pp_item C.start frm item + end; + if !stage > 1 then kernel_of_meta f st item else st + in +(* stage 0 *) + let st = {st with ac = count AO.count_item st.ac item} in + let f st item = + let st = + if !stage > 0 then MA.meta_of_aut (f st) st.mst item else st + in + aux st tl + in + process_item f st item + in + O.clear_reductions (); + let cover = + if !use_cover then Filename.chop_extension (Filename.basename name) + else "" + in + let st = aux (initial_status cover) book in + if !L.level > 0 then Time.utime_stamp "processed"; + if !L.level > 2 then AO.print_counters C.start st.ac; + if !L.level > 2 then AO.print_process_counters C.start st.ast; + if !L.level > 2 && !stage > 0 then MO.print_counters C.start st.mc; + if !L.level > 2 && !stage > 1 then print_counters st; + if !L.level > 2 && !stage > 1 then O.print_reductions () + in + let help = + "Usage: helena [ -Vcipu | -Ss | -m | -hk ] ...\n\n" ^ + "Summary levels: 0 just errors, 1 time stamps, 2 processed file names, \ + 3 data information, 4 typing information, 5 reduction information\n\n" ^ + "Stages: 0 parsing, 1 to intermediate, 2 to untrusted, 3 to trusted\n" in - let help = "Usage: helena [ -V | -S ] ..." in - let help_S = " Set summary level" in - let help_V = " Show version information" in + let help_S = " set summary level" in + let help_V = " show version information" in + let help_c = " disable initial segment of URI hierarchy" in + let help_h = " set type hierarchy" in + let help_i = " show local references by index" in + let help_k = " set kernel version" in + let help_m = " output intermediate representation" in + let help_p = " activate progress indicator" in + let help_u = " activate sort inclusion" in + let help_s = " Set translation stage" in + L.box 0; L.box_err (); + H.set_new_sorts ignore ["Set"; "Prop"]; Arg.parse [ ("-S", Arg.Int set_summary, help_S); - ("-V", Arg.Unit print_version, help_V) - ] read_file help + ("-V", Arg.Unit print_version, help_V); + ("-c", Arg.Clear use_cover, help_c); + ("-h", Arg.String set_hierarchy, help_h); + ("-i", Arg.Set O.indexes, help_i); + ("-k", Arg.String set_kernel, help_k); + ("-m", Arg.String set_meta_file, help_m); + ("-p", Arg.Set progress, help_p); + ("-u", Arg.Unit si, help_u); + ("-s", Arg.Int set_stage, help_s) + ] read_file help; + if !L.level > 0 then Time.utime_stamp "at exit"; + flush () +with BagType.TypeError msg -> bag_error "Type Error" msg + | BrgT.TypeError msg -> brg_error "Type Error" msg