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;
120 let dummy_form = Ata.Formula.stay State.dummy
122 let get_form fetch_trans_cache auto tag q =
124 incr fetch_trans_cache_access;
125 Cache.N2.find fetch_trans_cache (tag.QName.id :> int) (q :> int)
127 if phi == dummy_form then
128 let phi = Ata.get_form auto tag q in
132 (tag.QName.id :> int)
136 incr fetch_trans_cache_hit;
141 let eval_form phi fcs nss ps ss summary =
144 begin match Formula.expr phi with
145 | Boolean.False -> false
146 | Boolean.True -> true
147 | Boolean.Atom (a, b) ->
149 let open NodeSummary in
150 match a.Atom.node with
152 b && StateSet.mem q (
155 | `Next_sibling -> nss
156 | `Parent | `Previous_sibling -> ps
159 | Is_first_child -> b == is_left summary
160 | Is_next_sibling -> b == is_right summary
161 | Is k -> b == (k == kind summary)
162 | Has_first_child -> b == has_left summary
163 | Has_next_sibling -> b == has_right summary
165 | Boolean.And(phi1, phi2) -> loop phi1 && loop phi2
166 | Boolean.Or (phi1, phi2) -> loop phi1 || loop phi2
172 let eval_trans_aux auto trans_cache tag summary fcs nss ps sat todo =
173 StateSet.fold (fun q (a_sat) ->
175 get_form trans_cache auto tag q
177 if eval_form phi fcs nss ps a_sat summary then
183 let rec eval_trans_fix auto trans_cache tag summary fcs nss ps sat todo =
185 eval_trans_aux auto trans_cache tag summary fcs nss ps sat todo
187 if new_sat == sat then sat else
188 eval_trans_fix auto trans_cache tag summary fcs nss ps new_sat todo
191 let eval_trans auto fetch_trans_cache eval_cache tag summary fcs nss ps ss todo =
192 let fcsid = (fcs.StateSet.id :> int) in
193 let nssid = (nss.StateSet.id :> int) in
194 let psid = (ps.StateSet.id :> int) in
195 let ssid = (ss.StateSet.id :> int) in
196 let tagid = (tag.QName.id :> int) in
197 let res = Cache.N6.find eval_cache tagid summary ssid fcsid nssid psid in
198 incr eval_trans_cache_access;
199 if res != dummy_set then begin incr eval_trans_cache_hit; res end
201 eval_trans_fix auto fetch_trans_cache tag summary fcs nss ps ss todo
203 Cache.N6.add eval_cache tagid summary ssid fcsid nssid psid new_sat;
207 module Make (T : Tree.S) (L : Node_list.S with type node = T.node) =
211 let len = T.size tree in
215 sat = (let a = Array.create len StateSet.empty in
218 fetch_trans_cache = Cache.N2.create dummy_form;
219 td_cache = Cache.N6.create dummy_set;
220 bu_cache = Cache.N6.create dummy_set;
221 node_summaries = let ba = Array1.create int16_unsigned c_layout len in
226 let top_down run update_res =
228 let tree = run.tree in
229 let auto = run.auto in
230 let states_by_rank = Ata.get_states_by_rank auto in
231 let td_todo = states_by_rank.(i) in
233 if i == Array.length states_by_rank - 1 then StateSet.empty
237 let last_run = i >= Array.length states_by_rank - 2 in
238 let rec loop_td_and_bu node parent parent_sat =
239 if node == T.nil then StateSet.empty
241 let tag = T.tag tree node in
242 let node_id = T.preorder tree node in
243 let fc = T.first_child tree node in
244 let ns = T.next_sibling tree node in
245 (* We enter the node from its parent *)
247 let s = Array1.unsafe_get run.node_summaries node_id in
248 if s != 0 then s else
251 (node == (T.first_child tree parent)) (*is_left *)
252 (node == (T.next_sibling tree parent))(*is_right *)
253 (fc != T.nil) (* has_left *)
254 (ns != T.nil) (* has_right *)
255 (T.kind tree node) (* kind *)
257 run.node_summaries.{node_id} <- s; s
259 let status0 = unsafe_get run.sat node_id in
260 (* get the node_statuses for the first child, next sibling and parent *)
261 (* evaluate the transitions with all this statuses *)
264 auto run.fetch_trans_cache run.td_cache tag
266 (unsafe_get run.sat (T.preorder tree fc))
267 (unsafe_get run.sat (T.preorder tree ns))
271 if status1 == StateSet.empty && status0 != StateSet.empty
272 then StateSet.empty else
273 (* update the cache if the status of the node changed
274 unsafe_set run.sat node_id status1 status0;*)
275 if bu_todo == StateSet.empty then begin
276 unsafe_set run.sat node_id status1 status0; (* write the td_states *)
277 update_res false status1 node;
278 let _ = loop_td_and_bu fc node status1 in
279 loop_td_and_bu ns node status1 (* tail call *)
283 let nss1 = loop_td_and_bu ns node status1 in
284 let fcs1 = loop_td_and_bu fc node status1 in
287 let fcs1 = loop_td_and_bu fc node status1 in
288 let nss1 = loop_td_and_bu ns node status1 in
292 eval_trans auto run.fetch_trans_cache run.bu_cache tag
298 unsafe_set run.sat node_id status2 status0;
299 if last_run && status2 != StateSet.empty then update_res true status2 node;
303 let _ = loop_td_and_bu (T.root tree) T.nil dummy_set in
304 run.pass <- run.pass + 2
307 let mk_update_result auto =
308 let sel_states = Ata.get_selecting_states auto in
309 let res = L.create () in
310 (fun prepend sat node ->
311 if StateSet.intersect sel_states sat then begin
312 if prepend then L.push_front node res else
318 let mk_update_full_result auto =
319 let dummy = L.create () in
320 let res_mapper = Cache.N1.create dummy in
323 (fun q -> Cache.N1.add res_mapper (q :> int) (L.create()))
324 (Ata.get_selecting_states auto)
326 (fun prepend sat node ->
329 let res = Cache.N1.find res_mapper (q :> int) in
330 if res != dummy then begin
331 if prepend then L.push_front node res
332 else L.push_back node res
337 (fun q acc -> (q, Cache.N1.find res_mapper (q :> int))::acc)
338 (Ata.get_selecting_states auto) [])
340 let prepare_run run list =
341 let tree = run.tree in
342 let auto = run.auto in
343 let sat = IFHTML((List.hd run.sat), run.sat) in
344 let sat0 = Ata.get_starting_states auto in
346 let node_id = T.preorder tree node in
347 sat.(node_id) <- sat0) list
349 let tree_size = ref 0
352 let compute_run auto tree nodes update_res =
354 tree_size := T.size tree;
355 let run = make auto tree in
356 prepare_run run nodes;
357 let rank = Ata.get_max_rank auto in
358 while run.pass <= rank do
359 top_down run update_res;
360 IFHTML((run.sat <- (Array.copy (List.hd run.sat)) :: run.sat), ());
361 run.td_cache <- Cache.N6.create dummy_set;
362 run.bu_cache <- Cache.N6.create dummy_set;
364 IFHTML((run.sat <- List.tl run.sat), ());
365 pass := Ata.get_max_rank auto + 1;
366 IFHTML(Html_trace.gen_trace auto run.sat (module T : Tree.S with type t = T.t) tree ,());
371 let full_eval auto tree nodes =
372 let update_full,get_full = mk_update_full_result auto in
373 let _ = compute_run auto tree nodes update_full in
376 let eval auto tree nodes =
377 let update_res,get_res = mk_update_result auto in
378 let _ = compute_run auto tree nodes update_res in
382 tree_size = !tree_size;
384 fetch_trans_cache_access = !fetch_trans_cache_access;
385 fetch_trans_cache_hit = !fetch_trans_cache_hit;
386 eval_trans_cache_access = !eval_trans_cache_access;
387 eval_trans_cache_hit = !eval_trans_cache_hit;