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-24 23:24:11 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 let oldi = config.Ata.round in
40 Html.trace (T.preorder tree node) i oldi
41 "node: %i<br/>%s<br/>sat: %a<br/>unsat: %a<br/>todo: %around: %i<br/>"
42 ((T.preorder tree node):>int)
44 StateSet.print config.Ata.sat
45 StateSet.print config.Ata.unsat
46 (Ata.TransList.print ~sep:"<br/>") config.Ata.todo oldi
48 type cache = StateSet.t Cache.N1.t
49 let get c t n = Cache.N1.find c (T.preorder t n)
52 v.Ata.Config.node.Ata.round <- i;
53 Cache.N1.add c (T.preorder t n) v
56 let top_down_run auto tree node cache _i =
58 if node == T.nil then false else begin
59 let parent = T.parent tree node in
60 let fc = T.first_child tree node in
61 let ns = T.next_sibling tree node in
62 let tag = T.tag tree node in
64 let c = get cache tree node in
65 if c == Cache.N1.dummy cache then
67 { c.Ata.Config.node with
68 Ata.todo = Ata.get_trans auto tag auto.Ata.states;
69 summary = Ata.node_summary
70 (node == T.first_child tree parent) (* is_left *)
71 (node == T.next_sibling tree parent) (* is_right *)
72 (fc != T.nil) (* has_left *)
73 (ns != T.nil) (* has_right *)
74 (T.kind tree node) (* kind *)
79 TRACE(html tree node _i config0 "Entering node");
81 let _, ps = get cache tree parent in
82 let old_unstable_left, fcs = get cache tree fc in
83 let old_unstable_right, nss = get cache tree ns in
84 let config1 = Ata.eval_trans auto fcs nss ps config0 in
86 TRACE(html tree node _i config1 "Updating transitions");
88 if config0 != config1 then set cache tree node (true,config1) _i;
89 let unstable_left = old_unstable_left && loop fc in
90 let _, fcs1 = get cache tree fc in
91 let config2 = Ata.eval_trans auto fcs1 nss ps config1 in
93 TRACE(html tree node _i config2 "Updating transitions (after first-child)");
95 if config1 != config2 then set cache tree node (true, config2) _i;
96 let unstable_right = old_unstable_right && loop ns in
97 let _, nss1 = get cache tree ns in
98 let config3 = Ata.eval_trans auto fcs1 nss1 ps config2 in
100 TRACE(html tree node _i config3 "Updating transitions (after next-sibling)");
102 if config2 != config3 then set cache tree node (true, config3) _i;
106 || Ata.(TransList.nil != config3.Config.node.todo)
108 if Ata.(config3.Config.node.unstable_subtree) && not unstable then
109 Ata.(config3.Config.node.unstable_subtree <- false);
115 let get_results auto tree node cache =
116 let rec loop node acc =
117 if node == T.nil then acc
119 let acc0 = loop (T.next_sibling tree node) acc in
120 let acc1 = loop (T.first_child tree node) acc0 in
122 if StateSet.intersect
123 (get cache tree node).Ata.Config.node.Ata.sat
124 auto.Ata.selection_states then node::acc1
129 let eval auto tree node =
130 let cache = Cache.N1.create
131 true , Ata.(Config.make { sat = StateSet.empty;
132 unsat = StateSet.empty;
133 todo = TransList.nil;
134 summary = dummy_summary;
138 let redo = ref true in
143 Ata.reset auto; (* prevents the .cache2 and .cache4 memoization tables from growing too much *)
144 redo := top_down_run auto tree node cache !iter;
147 at_exit (fun () -> eprintf "@[STATS: %i iterations@]@." !iter);
148 let r = get_results auto tree node cache in
149 TRACE(Html.gen_trace (module T : Tree.S with type t = T.t) (tree));