2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
20 (* nodes count **************************************************************)
41 let initial_counters = {
42 eabsts = 0; eabbrs = 0; evoids = 0;
43 tsorts = 0; tlrefs = 0; tgrefs = 0; tcasts = 0; tappls = 0;
44 tabsts = 0; tabbrs = 0; tvoids = 0;
45 uris = []; nodes = 0; xnodes = 0
48 let rec count_term f c e = function
50 f {c with tsorts = succ c.tsorts; nodes = succ c.nodes}
52 begin match D.get e i with
54 f {c with tlrefs = succ c.tlrefs; xnodes = succ c.xnodes}
56 f {c with tlrefs = succ c.tlrefs; nodes = succ c.nodes}
60 if C.list_mem ~eq:U.eq u c.uris
61 then {c with nodes = succ c.nodes}
62 else {c with xnodes = succ c.xnodes}
64 f {c with tgrefs = succ c.tgrefs}
65 | D.TCast (_, v, t) ->
66 let c = {c with tcasts = succ c.tcasts} in
67 let f c = count_term f c e t in
69 | D.TAppl (_, v, t) ->
70 let c = {c with tappls = succ c.tappls} in
71 let f c = count_term f c e t in
73 | D.TProj (_, d, t) ->
74 D.shift (count_term f c e) d t
75 | D.TBind (a, b, t) ->
76 let f c e = count_term f c e t in
77 count_binder f c e a b
79 and count_binder f c e a b = match b with
81 let c = {c with tabsts = succ c.tabsts; nodes = succ c.nodes} in
82 let f c = D.push_bind (f c) a b e in
85 let c = {c with tabbrs = succ c.tabbrs; xnodes = succ c.xnodes} in
86 let f c = D.push_bind (f c) a b e in
89 let c = {c with tvoids = succ c.tvoids; xnodes = succ c.xnodes} in
90 D.push_bind (f c) a b e
92 let count_entity f c = function
93 | _, u, E.Abst (_, w) ->
95 eabsts = succ c.eabsts; nodes = succ c.nodes; uris = u :: c.uris
97 count_term f c D.ESort w
99 let c = {c with eabbrs = succ c.eabbrs; xnodes = succ c.xnodes} in
100 count_term f c D.ESort v
101 | _, _, E.Void -> assert false
103 let print_counters f c =
105 c.tsorts + c.tgrefs + c.tgrefs + c.tcasts + c.tappls + c.tabsts +
108 let items = c.eabsts + c.eabbrs in
109 let nodes = c.nodes + c.xnodes in
110 L.warn level (P.sprintf "Intermediate representation summary (complete_rg)");
111 L.warn level (P.sprintf " Total entry items: %7u" items);
112 L.warn level (P.sprintf " Declaration items: %7u" c.eabsts);
113 L.warn level (P.sprintf " Definition items: %7u" c.eabbrs);
114 L.warn level (P.sprintf " Total term items: %7u" terms);
115 L.warn level (P.sprintf " Sort items: %7u" c.tsorts);
116 L.warn level (P.sprintf " Local reference items: %7u" c.tlrefs);
117 L.warn level (P.sprintf " Global reference items: %7u" c.tgrefs);
118 L.warn level (P.sprintf " Explicit Cast items: %7u" c.tcasts);
119 L.warn level (P.sprintf " Application items: %7u" c.tappls);
120 L.warn level (P.sprintf " Abstraction items: %7u" c.tabsts);
121 L.warn level (P.sprintf " Abbreviation items: %7u" c.tabbrs);
122 L.warn level (P.sprintf " Global Int. Complexity: %7u" c.nodes);
123 L.warn level (P.sprintf " + Abbreviation nodes: %7u" nodes);
126 (* term/environment pretty printer ******************************************)
130 | E.Name (s, true) -> out (P.sprintf "%s;" s)
131 | E.Name (s, false) -> out (P.sprintf "~%s;" s)
132 | E.Apix i -> out (P.sprintf "+%i;" i)
133 | E.Mark i -> out (P.sprintf "@%i;" i)
139 let rec pp_term out = function
140 | D.TSort (a, l) -> pp_attrs out a; out (P.sprintf "*%u" l)
141 | D.TLRef (a, i ) -> pp_attrs out a; out (P.sprintf "#%u" i)
142 | D.TGRef (a, u) -> pp_attrs out a; out (P.sprintf "$")
143 | D.TCast (a, x, y) -> pp_attrs out a; out "<"; pp_term out x; out ">."; pp_term out y
144 | D.TAppl (a, x, y) -> pp_attrs out a; out "("; pp_term out x; out ")."; pp_term out y
145 | D.TBind (a, x, y) -> pp_attrs out a; pp_bind out x; out "."; pp_term out y
146 | D.TProj (a, x, y) -> pp_attrs out a; out "{"; pp_lenv out x; out "}."; pp_term out y
148 and pp_bind out = function
150 out "[:"; pp_term out x; out "]";
151 if N.is_infinite n then () else out (N.to_string n)
152 | D.Abbr x -> out "[="; pp_term out x; out "]";
155 and pp_lenv out = function
157 | D.EBind (x, a, y) -> pp_lenv out x; pp_attrs out a; pp_bind out y
158 | D.EAppl (x, a, y) -> pp_lenv out x; out "("; pp_term out y; out ")"
159 | D.EProj (x, a, y) -> pp_lenv out x; out "{"; pp_lenv out y; out "}"