1 (***********************************************************************)
5 (* Kim Nguyen, 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 (***********************************************************************)
18 type move = [ `Left | `Right | `Self ]
21 | Or of 'hcons * 'hcons
22 | And of 'hcons * 'hcons
23 | Atom of (move * bool * State.t)
28 st : StateSet.t * StateSet.t * StateSet.t;
29 size: int; (* Todo check if this is needed *)
32 external hash_const_variant : [> ] -> int = "%identity"
33 external vb : bool -> int = "%identity"
35 module rec Node : Hcons.S
36 with type data = Data.t = Hcons.Make (Data)
37 and Data : Hashtbl.HashedType with type t = Node.t node =
40 let equal x y = x.size == y.size &&
41 match x.pos, y.pos with
42 | a,b when a == b -> true
43 | Or(xf1, xf2), Or(yf1, yf2)
44 | And(xf1, xf2), And(yf1,yf2) -> (xf1 == yf1) && (xf2 == yf2)
45 | Atom(d1, p1, s1), Atom(d2 ,p2 ,s2) -> d1 == d2 && p1 == p2 && s1 == s2
53 HASHINT3 (PRIME1, Uid.to_int f1.Node.id, Uid.to_int f2.Node.id)
55 HASHINT3(PRIME3, Uid.to_int f1.Node.id, Uid.to_int f2.Node.id)
57 | Atom(d, p, s) -> HASHINT4(PRIME5, hash_const_variant d,vb p,s)
61 let hash x = x.Node.key
63 let equal = Node.equal
64 let expr f = f.Node.node.pos
65 let st f = f.Node.node.st
66 let size f = f.Node.node.size
67 let compare f1 f2 = compare f1.Node.id f2.Node.id
75 (* Begin Lucca Hirschi *)
78 type t = StateSet.t*StateSet.t*StateSet.t*Node.t
79 val equal : t -> t -> bool
83 type dStateS = StateSet.t*StateSet.t
86 type t = dStateS*dStateS*dStateS*Node.t
87 val equal : t -> t -> bool
91 module HcEval : HcEval = struct
93 StateSet.t*StateSet.t*StateSet.t*Node.t
94 let equal (s,l,r,f) (s',l',r',f') = StateSet.equal s s' &&
95 StateSet.equal l l' && StateSet.equal r r' && Node.equal f f'
97 HASHINT4(StateSet.hash s, StateSet.hash l, StateSet.hash r, Node.hash f)
100 let dequal (x,y) (x',y') = StateSet.equal x x' && StateSet.equal y y'
101 let dhash (x,y) = HASHINT2(StateSet.hash x, StateSet.hash y)
102 module HcInfer : HcInfer = struct
103 type t = dStateS*dStateS*dStateS*Node.t
104 let equal (s,l,r,f) (s',l',r',f') = dequal s s' &&
105 dequal l l' && dequal r r' && Node.equal f f'
107 HASHINT4(dhash s, dhash l, dhash r, Node.hash f)
110 module HashEval = Hashtbl.Make(HcEval)
111 module HashInfer = Hashtbl.Make(HcInfer)
112 type hcEval = bool Hashtbl.Make(HcEval).t
113 type hcInfer = bool Hashtbl.Make(HcInfer).t
115 let rec eval_form (q,qf,qn) f hashEval =
116 try HashEval.find hashEval (q,qf,qn,f)
118 let res = match expr f with
121 | And(f1,f2) -> eval_form (q,qf,qn) f1 hashEval &&
122 eval_form (q,qf,qn) f2 hashEval
123 | Or(f1,f2) -> eval_form (q,qf,qn) f1 hashEval ||
124 eval_form (q,qf,qn) f2 hashEval
126 let set = match dir with
127 |`Left -> qf | `Right -> qn | `Self -> q in
128 if b then StateSet.mem s set
129 else not (StateSet.mem s set) in
130 HashEval.add hashEval (q,qf,qn,f) res;
133 let rec infer_form sq sqf sqn f hashInfer =
134 try HashInfer.find hashInfer (sq,sqf,sqn,f)
136 let res = match expr f with
139 | And(f1,f2) -> infer_form sq sqf sqn f1 hashInfer &&
140 infer_form sq sqf sqn f2 hashInfer
141 | Or(f1,f2) -> infer_form sq sqf sqn f1 hashInfer ||
142 infer_form sq sqf sqn f2 hashInfer
144 let setq, setr = match dir with
145 | `Left -> sqf | `Right -> sqn | `Self -> sq in
146 (* WG: WE SUPPOSE THAT Q^r and Q^q are disjoint ! *)
147 let mem = StateSet.mem s setq || StateSet.mem s setr in
148 if b then mem else not mem in
149 HashInfer.add hashInfer (sq,sqf,sqn,f) res;
153 let rec print ?(parent=false) ppf f =
154 if parent then fprintf ppf "(";
155 let _ = match expr f with
156 | True -> fprintf ppf "%s" Pretty.top
157 | False -> fprintf ppf "%s" Pretty.bottom
159 print ~parent:(prio f > prio f1) ppf f1;
160 fprintf ppf " %s " Pretty.wedge;
161 print ~parent:(prio f > prio f2) ppf f2;
164 fprintf ppf " %s " Pretty.vee;
167 let _ = flush_str_formatter() in
168 let fmt = str_formatter in
171 | `Left -> Pretty.down_arrow, Pretty.subscript 1
172 | `Right -> Pretty.down_arrow, Pretty.subscript 2
173 | `Self -> Pretty.down_arrow, Pretty.subscript 0
175 fprintf fmt "%s%s" a_str d_str;
177 let str = flush_str_formatter() in
178 if b then fprintf ppf "%s" str
179 else Pretty.pp_overline ppf str
181 if parent then fprintf ppf ")"
183 let print ppf f = print ~parent:false ppf f
185 let is_true f = (expr f) == True
186 let is_false f = (expr f) == False
189 let cons pos neg s1 s2 size1 size2 =
190 let nnode = Node.make { pos = neg; neg = (Obj.magic 0); st = s2; size = size2 } in
191 let pnode = Node.make { pos = pos; neg = nnode ; st = s1; size = size1 } in
192 (Node.node nnode).neg <- pnode; (* works because the neg field isn't taken into
193 account for hashing ! *)
197 let empty_triple = StateSet.empty, StateSet.empty, StateSet.empty
198 let true_,false_ = cons True False empty_triple empty_triple 0 0
200 let si = StateSet.singleton s in
201 let ss = match d with
202 | `Left -> StateSet.empty, si, StateSet.empty
203 | `Right -> StateSet.empty, StateSet.empty, si
204 | `Self -> si, StateSet.empty, StateSet.empty
205 in fst (cons (Atom(d,p,s)) (Atom(d,not p,s)) ss ss 1 1)
207 let not_ f = f.Node.node.neg
209 let union_triple (s1,l1,r1) (s2,l2, r2) =
210 StateSet.union s1 s2,
211 StateSet.union l1 l2,
214 let merge_states f1 f2 =
216 union_triple (st f1) (st f2)
218 union_triple (st (not_ f1)) (st (not_ f2))
222 let order f1 f2 = if uid f1 < uid f2 then f2,f1 else f1,f2
225 (* Tautologies: x|x, x|not(x) *)
227 if equal f1 f2 then f1
228 else if equal f1 (not_ f2) then true_
231 else if is_true f1 || is_true f2 then true_
232 else if is_false f1 && is_false f2 then false_
233 else if is_false f1 then f2
234 else if is_false f2 then f1
236 (* commutativity of | *)
238 let f1, f2 = order f1 f2 in
239 let psize = (size f1) + (size f2) in
240 let nsize = (size (not_ f1)) + (size (not_ f2)) in
241 let sp, sn = merge_states f1 f2 in
242 fst (cons (Or(f1,f2)) (And(not_ f1, not_ f2)) sp sn psize nsize)
246 not_ (or_ (not_ f1) (not_ f2))
249 let of_bool = function true -> true_ | false -> false_
252 module Infix = struct
253 let ( +| ) f1 f2 = or_ f1 f2
255 let ( *& ) f1 f2 = and_ f1 f2
257 let ( *+ ) d s = atom_ d true s
258 let ( *- ) d s = atom_ d false s