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 (***********************************************************************)
17 Time-stamp: <Last modified on 2013-04-22 15:31:24 CEST by Kim Nguyen>
23 module Make (T : Tree.S) :
25 val eval : Ata.t -> T.t -> T.node -> T.node list
37 let html tree node i config msg =
38 let config = config.Ata.Config.node in
39 Html.trace (T.preorder tree node) i
40 "%s<br/>sat: %a<br/>unsat: %a<br/>todo: %a<br/>"
42 StateSet.print config.Ata.sat
43 StateSet.print config.Ata.unsat
44 (Ata.TransList.print ~sep:"<br/>") config.Ata.todo
47 type cache = StateSet.t Cache.N1.t
48 let get c t n = Cache.N1.find c (T.preorder t n)
50 let set c t n v = Cache.N1.add c (T.preorder t n) v
53 let top_down_run auto tree node cache _i =
54 let redo = ref false in
56 if node != T.nil then begin
57 let parent = T.parent tree node in
58 let fc = T.first_child tree node in
59 let ns = T.next_sibling tree node in
60 let tag = T.tag tree node in
62 let c = get cache tree node in
63 if c == Cache.N1.dummy cache then
65 { c.Ata.Config.node with Ata.todo = Ata.get_trans auto tag auto.Ata.states;
66 summary = Ata.node_summary
67 (node == T.first_child tree parent) (* is_left *)
68 (node == T.next_sibling tree parent) (* is_right *)
69 (fc != T.nil) (* has_left *)
70 (ns != T.nil) (* has_right *)
71 (T.kind tree node) (* kind *)
76 TRACE(html tree node _i config0 "Entering node");
78 let ps = get cache tree parent in
79 let fcs = get cache tree fc in
80 let nss = get cache tree ns in
81 let config1 = Ata.eval_trans auto fcs nss ps config0 in
83 TRACE(html tree node _i config1 "Updating transitions");
85 if config0 != config1 then set cache tree node config1;
87 let fcs1 = get cache tree fc in
88 let config2 = Ata.eval_trans auto fcs1 nss ps config1 in
90 TRACE(html tree node _i config2 "Updating transitions (after first-child)");
92 if config1 != config2 then set cache tree node config2;
94 let config3 = Ata.eval_trans auto fcs1 (get cache tree ns) ps config2 in
96 TRACE(html tree node _i config3 "Updating transitions (after next-sibling)");
98 if config2 != config3 then set cache tree node config3;
99 (* We do set the redo flat if : *)
101 config0 == config3 (* did not gain any new information *)
102 || !redo (* already set *)
103 || Ata.TransList.nil == config3.Ata.Config.node.Ata.todo ) (* no more transition to check *)
110 let get_results auto tree node cache =
111 let rec loop node acc =
112 if node == T.nil then acc
114 let acc0 = loop (T.next_sibling tree node) acc in
115 let acc1 = loop (T.first_child tree node) acc0 in
117 if StateSet.intersect (get cache tree node).Ata.Config.node.Ata.sat auto.Ata.selection_states then
124 let eval auto tree node =
125 let cache = Cache.N1.create
126 (Ata.Config.make { Ata.sat = StateSet.empty;
127 Ata.unsat = StateSet.empty;
128 Ata.todo = Ata.TransList.nil;
129 Ata.summary = Ata.dummy_summary;
132 let redo = ref true in
138 redo := top_down_run auto tree node cache !iter;
141 at_exit (fun () -> eprintf "INFO: %i iterations\n" !iter);
142 let r = get_results auto tree node cache in
143 TRACE(Html.gen_trace (module T : Tree.S with type t = T.t) (tree));