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-03-13 19:02:13 CET by Kim Nguyen>
24 module Make (T : Tree.Sig.S) :
26 val eval : Ata.t -> T.t -> T.node -> T.node list
30 type cache = StateSet.t Cache.N1.t
31 let get c t n = Cache.N1.find c (T.preorder t n)
33 let set c t n v = Cache.N1.add c (T.preorder t n) v
36 type t = { is_left : bool;
40 kind : Tree.Common.NodeKind.t;
43 let hash a = Hashtbl.hash a
46 module NodeInfo = Hcons.Make(Info)
48 let eval_form phi node_info fcs nss ps ss =
52 begin match Ata.SFormula.expr phi with
54 | Formula.False -> false
56 let p, b, q = Ata.Atom.node a in
60 | First_child -> StateSet.mem q fcs
61 | Next_sibling -> StateSet.mem q nss
62 | Parent | Previous_sibling -> StateSet.mem q ps
63 | Stay -> StateSet.mem q ss
64 | Is_first_child -> node_info.node.is_left
65 | Is_next_sibling -> node_info.node.is_right
66 | Is k -> k == node_info.node.kind
67 | Has_first_child -> node_info.node.has_left
68 | Has_next_sibling -> node_info.node.has_right
70 if Ata.is_move p && (not b) then
71 eprintf "Warning: Invalid negative atom %a" Ata.Atom.print a;
73 | Formula.And(phi1, phi2) -> loop phi1 && loop phi2
74 | Formula.Or (phi1, phi2) -> loop phi1 || loop phi2
79 let eval_trans cache ltrs node_info fcs nss ps ss =
80 let j = (node_info.NodeInfo.id :> int)
81 and k = (fcs.StateSet.id :> int)
82 and l = (nss.StateSet.id :> int)
83 and m = (ps.StateSet.id :> int) in
84 let rec loop ltrs ss =
85 let i = (ltrs.Ata.TransList.id :> int)
86 and n = (ss.StateSet.id :> int) in
87 let (new_ltrs, new_ss) as res =
88 let res = Cache.N6.find cache i j k l m n in
89 if res == Cache.N6.dummy cache then
91 Ata.TransList.fold (fun trs (acct, accs) ->
92 let q, _, phi = Ata.Transition.node trs in
93 if StateSet.mem q accs then (acct, accs) else
94 if eval_form phi node_info fcs nss ps accs then
95 (acct, StateSet.add q accs)
97 (Ata.TransList.cons trs acct, accs)
98 ) ltrs (Ata.TransList.nil, ss)
100 Cache.N6.add cache i j k l m n res; res
104 if new_ss == ss then res else
109 let top_down_run auto tree node cache _i =
110 let redo = ref false in
111 let dummy2 = Ata.TransList.cons
112 (Ata.Transition.make (State.dummy,QNameSet.empty, Ata.SFormula.false_))
115 let dummy6 = (dummy2, StateSet.empty) in
116 let trans_cache6 = Cache.N6.create 17 dummy6 in
117 let trans_cache2 = Cache.N2.create 17 dummy2 in
119 if node != T.nil then begin
120 let parent = T.parent tree node in
121 let fc = T.first_child tree node in
122 let ns = T.next_sibling tree node in
123 let tag = T.tag tree node in
124 let states0 = get cache tree node in
127 Cache.N2.find trans_cache2
128 (tag.QName.id :> int) (auto.Ata.states.StateSet.id :> int)
130 if trs == dummy2 then
131 let trs = Ata.get_trans auto auto.Ata.states tag in
134 (tag.QName.id :> int)
135 (auto.Ata.states.StateSet.id :> int) trs; trs)
138 let ps = get cache tree parent in
139 let fcs = get cache tree fc in
140 let nss = get cache tree ns in
141 let node_info = NodeInfo.make
142 (Info.({ is_left = node == T.first_child tree parent;
143 is_right = node == T.next_sibling tree parent;
144 has_left = fc != T.nil;
145 has_right = ns != T.nil;
146 kind = T.kind tree node }))
148 let trans1, states1 =
149 eval_trans trans_cache6 trans0 node_info fcs nss ps states0
151 if states1 != states0 then set cache tree node states1;
153 let fcs1 = get cache tree fc in
154 let trans2, states2 =
155 eval_trans trans_cache6 trans1 node_info fcs1 nss ps states1
157 if states2 != states1 then set cache tree node states2;
160 eval_trans trans_cache6 trans2 node_info fcs1 (get cache tree ns) ps states2
162 if states3 != states2 then set cache tree node states3;
163 if states0 != states3 && (not !redo) then redo := true
169 let get_results auto tree node cache =
170 let rec loop node acc =
171 if node == T.nil then acc
173 let acc0 = loop (T.next_sibling tree node) acc in
174 let acc1 = loop (T.first_child tree node) acc0 in
176 if StateSet.intersect (get cache tree node) auto.Ata.selection_states then
183 let eval auto tree node =
184 let cache = Cache.N1.create (T.size tree) StateSet.empty in
185 let redo = ref true in
188 redo := top_down_run auto tree node cache !iter;
191 get_results auto tree node cache