1 (***********************************************************************)
5 (* Kim Nguyen, LRI UMR8623 *)
6 (* Université Paris-Sud & CNRS *)
8 (* Copyright 2010-2013 Université Paris-Sud and Centre National de la *)
9 (* Recherche Scientifique. All rights reserved. This file is *)
10 (* distributed under the terms of the GNU Lesser General Public *)
11 (* License, with the special exception on linking described in file *)
14 (***********************************************************************)
23 type stats = { run : int;
25 fetch_trans_cache_access : int;
26 fetch_trans_cache_hit : int;
27 eval_trans_cache_access : int;
28 eval_trans_cache_hit : int;
31 let fetch_trans_cache_hit = ref 0
32 let fetch_trans_cache_access = ref 0
33 let eval_trans_cache_hit = ref 0
34 let eval_trans_cache_access = ref 0
35 let reset_stat_counters () =
36 fetch_trans_cache_hit := 0;
37 fetch_trans_cache_access := 0;
38 eval_trans_cache_hit := 0;
39 eval_trans_cache_access := 0
44 (* Pack into an integer the result of the is_* and has_ predicates
56 let is_left (s : t) : bool =
59 let is_right (s : t) : bool =
62 let has_left (s : t) : bool =
65 let has_right (s : t) : bool =
68 let kind (s : t) : Tree.NodeKind.t =
71 let make is_left is_right has_left has_right kind =
72 (int_of_bool is_left) lor
73 ((int_of_bool is_right) lsl 1) lor
74 ((int_of_bool has_left) lsl 2) lor
75 ((int_of_bool has_right) lsl 3) lor
76 ((Obj.magic kind) lsl 4)
79 let dummy_set = StateSet.singleton State.dummy
85 type sat_array = StateSet.t array list
86 DEFINE IFHTML(a,b) = (a)
88 type sat_array = StateSet.t array
89 DEFINE IFHTML(a,b) = (b)
93 if i < 0 then StateSet.empty else
94 Array.unsafe_get (IFHTML(List.hd a, a)) i
96 let unsafe_set a i v old_v =
98 Array.unsafe_set (IFHTML(List.hd a, a)) i v
102 (* The argument of the run *)
104 (* The automaton to be run *)
105 mutable sat: sat_array;
106 (* A mapping from node preorders to states satisfied at that node *)
108 (* Number of run we have performed *)
109 mutable fetch_trans_cache : Ata.Formula.t Cache.N2.t;
110 (* A cache from states * label to list of transitions *)
111 mutable td_cache : StateSet.t Cache.N6.t;
112 mutable bu_cache : StateSet.t Cache.N6.t;
113 (* Two 6-way caches used during the top-down and bottom-up phase
114 label * self-set * fc-set * ns-set * parent-set * node-shape -> self-set
116 node_summaries: (int, int16_unsigned_elt, c_layout) Array1.t;
119 let dummy_form = Ata.Formula.stay State.dummy
121 let get_form fetch_trans_cache auto tag q =
123 incr fetch_trans_cache_access;
124 Cache.N2.find fetch_trans_cache (tag.QName.id :> int) (q :> int)
126 if phi == dummy_form then
127 let phi = Ata.get_form auto tag q in
131 (tag.QName.id :> int)
135 incr fetch_trans_cache_hit;
140 let eval_form phi fcs nss ps ss summary =
143 begin match Formula.expr phi with
144 | Boolean.False -> false
145 | Boolean.True -> true
146 | Boolean.Atom (a, b) ->
148 let open NodeSummary in
149 match a.Atom.node with
151 b && StateSet.mem q (
154 | `Next_sibling -> nss
155 | `Parent | `Previous_sibling -> ps
158 | Is_first_child -> b == is_left summary
159 | Is_next_sibling -> b == is_right summary
160 | Is k -> b == (k == kind summary)
161 | Has_first_child -> b == has_left summary
162 | Has_next_sibling -> b == has_right summary
164 | Boolean.And(phi1, phi2) -> loop phi1 && loop phi2
165 | Boolean.Or (phi1, phi2) -> loop phi1 || loop phi2
171 let eval_trans_aux auto trans_cache tag summary fcs nss ps sat todo =
172 StateSet.fold (fun q (a_sat) ->
174 get_form trans_cache auto tag q
176 if eval_form phi fcs nss ps a_sat summary then
182 let rec eval_trans_fix auto trans_cache tag summary fcs nss ps sat todo =
184 eval_trans_aux auto trans_cache tag summary fcs nss ps sat todo
186 if new_sat == sat then sat else
187 eval_trans_fix auto trans_cache tag summary fcs nss ps new_sat todo
190 let eval_trans auto fetch_trans_cache eval_cache tag summary fcs nss ps ss todo =
191 let fcsid = (fcs.StateSet.id :> int) in
192 let nssid = (nss.StateSet.id :> int) in
193 let psid = (ps.StateSet.id :> int) in
194 let ssid = (ss.StateSet.id :> int) in
195 let tagid = (tag.QName.id :> int) in
196 let res = Cache.N6.find eval_cache tagid summary ssid fcsid nssid psid in
197 incr eval_trans_cache_access;
198 if res != dummy_set then begin incr eval_trans_cache_hit; res end
200 eval_trans_fix auto fetch_trans_cache tag summary fcs nss ps ss todo
202 Cache.N6.add eval_cache tagid summary ssid fcsid nssid psid new_sat;
206 module Make (T : Tree.S) =
210 let len = T.size tree in
214 sat = (let a = Array.create len StateSet.empty in
217 fetch_trans_cache = Cache.N2.create dummy_form;
218 td_cache = Cache.N6.create dummy_set;
219 bu_cache = Cache.N6.create dummy_set;
220 node_summaries = let ba = Array1.create int16_unsigned c_layout len in
227 let tree = run.tree in
228 let auto = run.auto in
229 let states_by_rank = Ata.get_states_by_rank auto in
230 let td_todo = states_by_rank.(i) in
232 if i == Array.length states_by_rank - 1 then StateSet.empty
236 let rec loop_td_and_bu node parent parent_sat =
237 if node == T.nil then StateSet.empty
239 let node_id = T.preorder tree node in
240 let fc = T.first_child tree node in
241 let ns = T.next_sibling tree node in
242 (* We enter the node from its parent *)
244 let s = Array1.unsafe_get run.node_summaries node_id in
245 if s != 0 then s else
248 (node == T.first_child tree parent) (*is_left *)
249 (node == T.next_sibling tree parent)(*is_right *)
250 (fc != T.nil) (* has_left *)
251 (ns != T.nil) (* has_right *)
252 (T.kind tree node) (* kind *)
254 run.node_summaries.{node_id} <- s; s
256 let status0 = unsafe_get run.sat node_id in
257 (* get the node_statuses for the first child, next sibling and parent *)
258 (* evaluate the transitions with all this statuses *)
259 let tag = T.tag tree node in
262 auto run.fetch_trans_cache run.td_cache tag
264 (unsafe_get run.sat (T.preorder tree fc))
265 (unsafe_get run.sat (T.preorder tree ns))
269 (* update the cache if the status of the node changed
270 unsafe_set run.sat node_id status1 status0;*)
271 let fcs1 = loop_td_and_bu fc node status1 in
272 if bu_todo == StateSet.empty then begin
273 unsafe_set run.sat node_id status1 status0; (* write the td_states *)
274 loop_td_and_bu ns node status1 (* tail call *)
276 let nss1 = loop_td_and_bu ns node status1 in
278 eval_trans auto run.fetch_trans_cache run.bu_cache tag
284 unsafe_set run.sat node_id status2 status0;
288 let _ = loop_td_and_bu (T.root tree) T.nil dummy_set in
289 run.pass <- run.pass + 2
292 let get_results run =
293 let cache = IFHTML((List.hd run.sat), run.sat) in
294 let auto = run.auto in
295 let tree = run.tree in
296 let sel_states = Ata.get_selecting_states auto in
297 let rec loop node acc =
298 if node == T.nil then acc
300 let acc0 = loop (T.next_sibling tree node) acc in
301 let acc1 = loop (T.first_child tree node) acc0 in
302 if StateSet.intersect cache.(T.preorder tree node)
303 sel_states then node::acc1
306 loop (T.root tree) []
309 let get_full_results run =
310 let cache = IFHTML((List.hd run.sat), run.sat) in
311 let auto = run.auto in
312 let tree = run.tree in
313 let res_mapper = Hashtbl.create MED_H_SIZE in
316 (fun q -> Hashtbl.add res_mapper q [])
317 (Ata.get_selecting_states auto)
319 let dummy = [ T.nil ] in
320 let res_mapper = Cache.N1.create dummy in
323 (fun q -> Cache.N1.add res_mapper (q :> int) [])
324 (Ata.get_selecting_states auto)
327 if node != T.nil then
328 let () = loop (T.next_sibling tree node) in
329 let () = loop (T.first_child tree node) in
332 let res = Cache.N1.find res_mapper (q :> int) in
334 Cache.N1.add res_mapper (q :> int) (node::res)
336 cache.(T.preorder tree node)
340 (fun q acc -> (q, Cache.N1.find res_mapper (q :> int))::acc)
341 (Ata.get_selecting_states auto) [])
344 let prepare_run run list =
345 let tree = run.tree in
346 let auto = run.auto in
347 let sat = IFHTML((List.hd run.sat), run.sat) in
348 let sat0 = Ata.get_starting_states auto in
349 List.iter (fun node ->
350 let node_id = T.preorder tree node in
351 sat.(node_id) <- sat0) list
353 let tree_size = ref 0
355 let compute_run auto tree nodes =
357 tree_size := T.size tree;
358 let run = make auto tree in
359 prepare_run run nodes;
360 let rank = Ata.get_max_rank auto in
361 while run.pass <= rank do
363 IFHTML((run.sat <- (Array.copy (List.hd run.sat)) :: run.sat), ());
364 run.td_cache <- Cache.N6.create dummy_set;
365 run.bu_cache <- Cache.N6.create dummy_set;
367 IFHTML((run.sat <- List.tl run.sat), ());
368 pass := Ata.get_max_rank auto + 1;
369 IFHTML(Html_trace.gen_trace auto run.sat (module T : Tree.S with type t = T.t) tree ,());
372 let full_eval auto tree nodes =
373 let r = compute_run auto tree nodes in
376 let eval auto tree nodes =
377 let r = compute_run auto tree nodes in
381 tree_size = !tree_size;
383 fetch_trans_cache_access = !fetch_trans_cache_access;
384 fetch_trans_cache_hit = !fetch_trans_cache_hit;
385 eval_trans_cache_access = !eval_trans_cache_access;
386 eval_trans_cache_hit = !eval_trans_cache_hit;