1 (***********************************************************************)
5 (* Lucca Hirschi, LRI UMR8623 *)
6 (* Université Paris-Sud & CNRS *)
8 (* Copyright 2010-2012 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 (***********************************************************************)
26 module NodeHash = Hashtbl.Make (Node)
28 type t = (StateSet.t*StateSet.t) NodeHash.t
29 (** Map from nodes to query and recognizing states *)
30 (* Note that we do not consider nil nodes *)
33 exception Over_max_fail
37 (* Hash Consign modules *)
39 module type Oracle_fixpoint =
41 type t = StateSet.t*StateSet.t*StateSet.t*((StateSet.elt*Formula.t) list)*QName.t
42 val equal : t -> t -> bool
46 type dStateS = StateSet.t*StateSet.t
47 module type Run_fixpoint =
49 type t = dStateS*dStateS*dStateS*(State.t*Formula.t) list*QName.t
50 val equal : t -> t -> bool
54 module Oracle_fixpoint : Oracle_fixpoint = struct
56 StateSet.t*StateSet.t*StateSet.t*((StateSet.elt*Formula.t) list)*QName.t
57 let equal (s,l,r,list,t) (s',l',r',list',t') = StateSet.equal s s' &&
58 StateSet.equal l l' && StateSet.equal r r' && QName.equal t t'
59 let hash (s,l,r,list,t) =
60 HASHINT4(StateSet.hash s, StateSet.hash l, StateSet.hash r, QName.hash t)
63 let dequal (x,y) (x',y') = StateSet.equal x x' && StateSet.equal y y'
64 let dhash (x,y) = HASHINT2(StateSet.hash x, StateSet.hash y)
65 module Run_fixpoint : Run_fixpoint = struct
66 type t = dStateS*dStateS*dStateS*(State.t*Formula.t) list*QName.t
67 let equal (s,l,r,list,t) (s',l',r',list',t') = dequal s s' &&
68 dequal l l' && dequal r r' && QName.equal t t'
69 let hash (s,l,r,list,t) =
70 HASHINT4(dhash s, dhash l, dhash r, QName.hash t)
73 module HashOracle = Hashtbl.Make(Oracle_fixpoint)
74 module HashRun = Hashtbl.Make(Run_fixpoint)
76 (* Mapped sets for leaves *)
77 let map_leaf asta = (Asta.bot_states_s asta, StateSet.empty)
79 (* Build the Oracle *)
80 let rec bu_oracle asta run tree tnode hashOracle=
81 let node = Tree.preorder tree tnode in
82 if Tree.is_leaf tree tnode
86 else NodeHash.add run node (map_leaf asta)
88 let tfnode = Tree.first_child_x tree tnode
89 and tnnode = Tree.next_sibling tree tnode in
90 let fnode,nnode = (* their preorders *)
91 (Tree.preorder tree tfnode, Tree.preorder tree tnnode) in
93 bu_oracle asta run tree tfnode hashOracle;
94 bu_oracle asta run tree tnnode hashOracle;
95 (* add states which satisfy a transition *)
96 let rec result set qfr qnr flag = function
99 if Formula.eval_form (set,qfr,qnr) form (* evaluates the formula*)
101 if StateSet.mem q set
102 then result set qfr qnr 0 tl
103 else result (StateSet.add q set) qfr qnr 1 tl
104 else result set qfr qnr 0 tl in
105 (* compute the fixed point of states of node *)
106 let rec fix_point set_i qfr qnr list_tr t =
107 try HashOracle.find hashOracle (set_i, qfr, qnr, list_tr, t)
109 let set,flag = result set_i qfr qnr 0 list_tr in
110 HashOracle.add hashOracle (set_i,qfr,qnr,list_tr,t) (set); (* todo: Think about this position *)
113 else fix_point set qfr qnr list_tr t in
114 let q_rec n = (* compute the set for child/sibling *)
115 try NodeHash.find run n
116 with Not_found -> map_leaf asta in
117 let (_,qfr),(_,qnr) = q_rec fnode,q_rec nnode (* computed in rec call *)
118 and lab = Tree.tag tree tnode in
119 let _,list_tr = Asta.transitions_lab asta lab in (*only reco. tran.*)
120 NodeHash.add run node (StateSet.empty,
121 fix_point StateSet.empty qfr qnr list_tr lab)
124 (* Build the over-approx. of the maximal run *)
125 let rec bu_over_max asta run tree tnode hashRun =
126 if (Tree.is_leaf tree tnode) (* BU_oracle has already created the map *)
130 let tfnode = Tree.first_child_x tree tnode
131 and tnnode = Tree.next_sibling tree tnode in
133 bu_over_max asta run tree tfnode hashRun;
134 bu_over_max asta run tree tnnode hashRun;
136 (Tree.preorder tree tfnode, Tree.preorder tree tnnode)
137 and node = Tree.preorder tree tnode in
139 try NodeHash.find run n
140 with Not_found -> map_leaf asta in
141 let qf,qn = q_rec fnode,q_rec nnode in
142 let lab = Tree.tag tree tnode in
143 let list_tr,_ = Asta.transitions_lab asta lab (* only take query st. *)
144 and _,resultr = try NodeHash.find run node
145 with _ -> raise Over_max_fail in
146 let rec result set qf qn flag list_tr = function
147 | [] -> if flag = 0 then set else result set qf qn 0 list_tr list_tr
149 if StateSet.mem q set
150 then result set qf qn 0 list_tr tl
151 else if Formula.infer_form (set,resultr) qf qn form
152 then result (StateSet.add q set) qf qn 1 list_tr tl
153 else result set qf qn 0 list_tr tl in
155 try HashRun.find hashRun ((StateSet.empty,resultr),qf,qn,list_tr,lab)
156 with _ -> let res = result StateSet.empty qf qn 0 list_tr list_tr in
158 ((StateSet.empty,resultr), qf,qn,list_tr,lab) res;
160 (* we keep the old recognizing states set *)
161 NodeHash.replace run node (result_set(), resultr)
165 (* Build the maximal run *)
166 let rec tp_max asta run tree tnode hashRun =
167 if (Tree.is_leaf tree tnode) (* BU_oracle has already created the map *)
171 let node = Tree.preorder tree tnode
172 and tfnode = Tree.first_child_x tree tnode
173 and tnnode = Tree.next_sibling tree tnode in
175 (Tree.preorder tree tfnode, Tree.preorder tree tnnode) in
177 if tnode == Tree.root tree (* we must intersect with top states *)
178 then let setq,_ = try NodeHash.find run node
179 with _ -> raise Max_fail in
180 NodeHash.replace run node
181 ((StateSet.inter (Asta.top_states_s asta) setq),StateSet.empty)
184 try NodeHash.find run n
185 with Not_found -> map_leaf asta in
186 let qf,qn = q_rec fnode,q_rec nnode in
187 let lab = Tree.tag tree tnode in
188 let list_tr,_ = Asta.transitions_lab asta lab in (* only take query. *)
189 let (self_q,self_r) = try NodeHash.find run node
190 with Not_found -> raise Max_fail in
192 (* We must compute again accepting states from self transitions since
193 previous calls of tp_max may remove them *)
194 let rec result_q self_q queue = function (* for initializing the queue *)
197 if (StateSet.mem q self_q)
199 let q_cand,_,_ = Formula.st form in
200 StateSet.iter (fun x -> Queue.push x queue) q_cand;
201 result_q (StateSet.add q self_q) queue tl;
203 else result_q self_q queue tl
204 and result_st_q self_q queue flag = function (*for computing the fixed p*)
207 if Formula.infer_form (self_q,self_r) qf qn form
209 let q_cand,_,_ = Formula.st form in
210 StateSet.iter (fun x -> Queue.push x queue) q_cand;
211 result_st_q self_q queue 1 tl;
213 else result_st_q self_q queue flag tl in
214 let rec comp_acc_self self_q_i queue = (* compute the fixed point *)
215 if Queue.is_empty queue
218 let q = Queue.pop queue in
219 let list_q,_ = Asta.transitions_st_lab asta q lab in
220 let flag,queue = result_st_q self_q_i queue 0 list_q in
221 let self_q = if flag = 1 then StateSet.add q self_q_i else self_q_i in
222 comp_acc_self self_q queue in
224 let self,queue_init = result_q self_q (Queue.create()) list_tr in
225 let self_q = comp_acc_self self_q queue_init in
226 NodeHash.replace run node (self_q,self_r);
227 (* From now, the correct set of states is mapped to node! *)
228 let rec result = function
231 if (StateSet.mem q self) && (* infers & trans. can start here *)
232 (Formula.infer_form (self_q,self_r) qf qn form)
233 then form :: (result tl)
235 let list_form = result list_tr in (* tran. candidates *)
236 (* compute states occuring in transition candidates *)
237 let rec add_st (ql,qr) = function
239 | f :: tl -> let sqs,sql,sqr = Formula.st f in
240 let ql' = StateSet.union sql ql
241 and qr' = StateSet.union sqr qr in
242 add_st (ql',qr') tl in
243 let ql,qr = add_st (StateSet.empty, StateSet.empty) list_form in
244 let qfq,qfr = try NodeHash.find run fnode
245 with | _ -> map_leaf asta
246 and qnq,qnr = try NodeHash.find run nnode
247 with | _ -> map_leaf asta in
249 if tfnode == Tree.nil || Tree.is_attribute tree tnode
251 else NodeHash.replace run fnode (StateSet.inter qfq ql,qfr);
252 if tnnode == Tree.nil || Tree.is_attribute tree tnode
254 else NodeHash.replace run nnode (StateSet.inter qnq qr,qnr);
255 (* indeed we delete all states from self transitions! *)
256 tp_max asta run tree tfnode hashRun;
257 tp_max asta run tree tnnode hashRun;
261 let compute tree asta =
262 let flag = 2 in (* debug *)
263 let size_tree = 10000 in (* todo (Tree.size ?) *)
264 let size_hcons_O = 1000 in (* todo size Hashtbl *)
265 let size_hcons_M = 1000 in (* todo size Hashtbl *)
266 let map = NodeHash.create size_tree in
267 let hashOracle = HashOracle.create(size_hcons_O) in
268 bu_oracle asta map tree (Tree.root tree) hashOracle;
269 HashOracle.clear hashOracle;
270 if flag > 0 then begin
271 let hashRun = HashRun.create(size_hcons_M) in
272 bu_over_max asta map tree (Tree.root tree) hashRun;
275 tp_max asta map tree (Tree.root tree) hashRun
277 HashRun.clear hashRun;
282 let selected_nodes tree asta =
283 let run = compute tree asta in
286 if not(StateSet.is_empty
287 (StateSet.inter (fst set) (Asta.selec_states asta)))
293 let print_d_set fmt (s_1,s_2) =
294 Format.fprintf fmt "(%a,%a)"
295 StateSet.print s_1 StateSet.print s_2 in
296 let print_map fmt run =
297 let pp = Format.fprintf fmt in
298 if NodeHash.length run = 0
299 then Format.fprintf fmt "ø"
301 NodeHash.iter (fun cle set -> pp "| %i->%a @ " cle print_d_set set)
303 let print_box fmt run =
304 let pp = Format.fprintf fmt in
305 pp "@[<hov 0>@. # Mapping:@. @[<hov 0>%a@]@]"
308 Format.fprintf fmt "@[<hov 0>##### RUN #####@, %a@]@." print_box run