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_______________________________________________________________ *)
25 (* nodes count **************************************************************)
46 let initial_counters = {
47 eabsts = 0; eabbrs = 0; evoids = 0;
48 tsorts = 0; tlrefs = 0; tgrefs = 0; tcasts = 0; tappls = 0;
49 tabsts = 0; tabbrs = 0; tvoids = 0;
50 uris = []; nodes = 0; xnodes = 0
53 let rec count_term_binder f c e = function
55 let c = {c with tabsts = succ c.tabsts; nodes = succ c.nodes} in
58 let c = {c with tabbrs = succ c.tabbrs; xnodes = succ c.xnodes} in
61 let c = {c with tvoids = succ c.tvoids; xnodes = succ c.xnodes} in
64 and count_term f c e = function
66 f {c with tsorts = succ c.tsorts; nodes = succ c.nodes}
68 begin match B.get e i with
71 f {c with tlrefs = succ c.tlrefs; nodes = succ c.nodes}
72 | _, _, _, B.Abbr _ ->
73 f {c with tlrefs = succ c.tlrefs; xnodes = succ c.xnodes}
77 if Cps.list_mem ~eq:U.eq u c.uris
78 then {c with nodes = succ c.nodes}
79 else {c with xnodes = succ c.xnodes}
81 f {c with tgrefs = succ c.tgrefs}
83 let c = {c with tcasts = succ c.tcasts} in
84 let f c = count_term f c e t in
87 let c = {c with tappls = succ c.tappls; nodes = succ c.nodes} in
88 let f c = count_term f c e t in
91 let f c = count_term f c (B.push e B.empty a b) t in
92 count_term_binder f c e b
94 let count_entity f c = function
95 | _, _, u, E.Abst w ->
97 eabsts = succ c.eabsts; nodes = succ c.nodes; uris = u :: c.uris
99 count_term f c B.empty w
100 | _, _, _, E.Abbr v ->
101 let c = {c with eabbrs = succ c.eabbrs; xnodes = succ c.xnodes} in
102 count_term f c B.empty v
103 | _, _, _, E.Void -> assert false
105 let print_counters f c =
107 c.tsorts + c.tgrefs + c.tgrefs + c.tcasts + c.tappls + c.tabsts +
110 let items = c.eabsts + c.eabbrs in
111 let nodes = c.nodes + c.xnodes in
112 L.warn level (P.sprintf "Kernel representation summary (basic_rg)");
113 L.warn level (P.sprintf " Total entry items: %7u" items);
114 L.warn level (P.sprintf " Declaration items: %7u" c.eabsts);
115 L.warn level (P.sprintf " Definition items: %7u" c.eabbrs);
116 L.warn level (P.sprintf " Total term items: %7u" terms);
117 L.warn level (P.sprintf " Sort items: %7u" c.tsorts);
118 L.warn level (P.sprintf " Local reference items: %7u" c.tlrefs);
119 L.warn level (P.sprintf " Global reference items: %7u" c.tgrefs);
120 L.warn level (P.sprintf " Explicit Cast items: %7u" c.tcasts);
121 L.warn level (P.sprintf " Application items: %7u" c.tappls);
122 L.warn level (P.sprintf " Abstraction items: %7u" c.tabsts);
123 L.warn level (P.sprintf " Abbreviation items: %7u" c.tabbrs);
124 L.warn level (P.sprintf " Global Int. Complexity: %7u" c.nodes);
125 L.warn level (P.sprintf " + Abbreviation nodes: %7u" nodes);
128 (* supplementary annotation *************************************************)
130 let rec does_not_occur f n r = function
132 | B.Cons (e, _, a, _) ->
134 if n1 = n && r1 = r then f false else does_not_occur f n r e
139 let rec aux f e n r =
142 | false -> aux f e (n ^ "_") r
144 does_not_occur f n r e
147 let f n r = if n = n0 && r = r0 then f a else f {a with E.n_name = Some (n, r)} in
152 (* lenv/term pretty printing ************************************************)
156 | true -> P.fprintf och "%s" n
157 | false -> P.fprintf och "-%s" n
161 let pp_level st och n =
162 P.fprintf och "%s" (N.to_string st n)
164 let rec pp_term st e och = function
166 let err _ = P.fprintf och "*%u" h in
167 let f s = P.fprintf och "%s" s in
168 H.string_of_sort err f h
170 let err _ = P.fprintf och "#%u" i in
171 if !G.indexes then err () else
172 let _, _, a, b = B.get e i in
173 P.fprintf och "%a" (name err) a
175 P.fprintf och "$%s" (U.string_of_uri s)
176 | B.Cast (_, u, t) ->
177 P.fprintf och "{%a}.%a" (pp_term st e) u (pp_term st e) t
178 | B.Appl (_, v, t) ->
179 P.fprintf och "(%a).%a" (pp_term st e) v (pp_term st e) t
180 | B.Bind (a, B.Abst (n, w), t) ->
182 let ee = B.push e B.empty a (B.abst n w) in
183 P.fprintf och "%a[%a:%a].%a" (pp_level st) n (name C.err) a (pp_term st e) w (pp_term st ee) t
186 | B.Bind (a, B.Abbr v, t) ->
188 let ee = B.push e B.empty a (B.abbr v) in
189 P.fprintf och "[%a=%a].%a" (name C.err) a (pp_term st e) v (pp_term st ee) t
192 | B.Bind (a, B.Void, t) ->
194 let ee = B.push e B.empty a B.Void in
195 P.fprintf och "[%a].%a" (name C.err) a (pp_term st ee) t
199 let pp_lenv st och e =
200 let pp_entry f e c a b x = f x (* match b with
202 let f a = P.fprintf och "%a : %a\n" (name C.err) a (pp_term st e) w; f a in
205 let f a = P.fprintf och "%a = %a\n" (name C.err) a (pp_term st e) v; f a in
208 let f a = P.fprintf och "%a\n" (name C.err) a; f a in
212 if e = B.empty then P.fprintf och "%s\n" "not shown" else
213 B.fold_right ignore pp_entry e B.empty
216 L.pp_term = pp_term; L.pp_lenv = pp_lenv
219 (* term xml printing ********************************************************)
222 BD.crg_of_brg (XD.export_term st)