4 type jump_kind = [ `TAG of Tag.t | `CONTAINS of string | `NOTHING ]
6 (* Todo : move elsewhere *)
7 external vb : bool -> int = "%identity"
11 include Sigs.T with type t = int
21 external hash : t -> int = "%identity"
22 let print fmt x = Format.fprintf fmt "%i" x
23 let dump fmt x = print fmt x
25 if x < 0 then failwith (Printf.sprintf "State: Assertion %i < 0 failed" x)
28 module StateSet = Ptset.Int
34 | Or of 'hcons * 'hcons
35 | And of 'hcons * 'hcons
36 | Atom of ([ `Left | `Right | `LLeft | `RRight ]*bool*State.t)
40 st : (StateSet.t*StateSet.t*StateSet.t)*(StateSet.t*StateSet.t*StateSet.t);
41 size: int; (* Todo check if this is needed *)
44 external hash_const_variant : [> ] -> int = "%identity"
45 module rec HNode : Hcons.S with type data = Node.t = Hcons.Make (Node)
46 and Node : Hashtbl.HashedType with type t = HNode.t node =
49 let equal x y = x.size == y.size &&
50 match x.pos,y.pos with
53 | Or(xf1,xf2),Or(yf1,yf2)
54 | And(xf1,xf2),And(yf1,yf2) -> (HNode.equal xf1 yf1) && (HNode.equal xf2 yf2)
55 | Atom(d1,p1,s1), Atom(d2,p2,s2) -> d1 == d2 && (p1==p2) && s1 == s2
61 | Or (f1,f2) -> HASHINT3(PRIME2,HNode.uid f1,HNode.uid f2)
62 | And (f1,f2) -> HASHINT3(PRIME3,HNode.uid f1,HNode.uid f2)
63 | Atom(d,p,s) -> HASHINT4(PRIME4,hash_const_variant d,vb p,s)
69 let equal = HNode.equal
70 let expr f = (HNode.node f).pos
71 let st f = (HNode.node f ).st
72 let size f = (HNode.node f).size
81 let rec print ?(parent=false) ppf f =
82 if parent then Format.fprintf ppf "(";
83 let _ = match expr f with
84 | True -> Format.fprintf ppf "T"
85 | False -> Format.fprintf ppf "F"
87 print ~parent:(prio f > prio f1) ppf f1;
88 Format.fprintf ppf " ∧ ";
89 print ~parent:(prio f > prio f2) ppf f2;
92 Format.fprintf ppf " ∨ ";
94 | Atom(dir,b,s) -> Format.fprintf ppf "%s%s[%i]"
95 (if b then "" else "¬")
102 if parent then Format.fprintf ppf ")"
104 let print ppf f = print ~parent:false ppf f
106 let is_true f = (expr f) == True
107 let is_false f = (expr f) == False
110 let cons pos neg s1 s2 size1 size2 =
111 let nnode = HNode.make { pos = neg; neg = (Obj.magic 0); st = s2; size = size2 } in
112 let pnode = HNode.make { pos = pos; neg = nnode ; st = s1; size = size1 }
114 (HNode.node nnode).neg <- pnode; (* works because the neg field isn't taken into
115 account for hashing ! *)
118 let empty_triple = StateSet.empty,StateSet.empty,StateSet.empty
119 let empty_hex = empty_triple,empty_triple
120 let true_,false_ = cons True False empty_hex empty_hex 0 0
122 let si = StateSet.singleton s in
123 let ss = match d with
124 | `Left -> (si,StateSet.empty,si),empty_triple
125 | `Right -> empty_triple,(si,StateSet.empty,si)
126 | `LLeft -> (StateSet.empty,si,si),empty_triple
127 | `RRight -> empty_triple,(StateSet.empty,si,si)
128 in fst (cons (Atom(d,p,s)) (Atom(d,not p,s)) ss ss 1 1)
130 let not_ f = (HNode.node f).neg
131 let union_hex ((l1,ll1,lll1),(r1,rr1,rrr1)) ((l2,ll2,lll2),(r2,rr2,rrr2)) =
132 (StateSet.mem_union l1 l2 ,StateSet.mem_union ll1 ll2,StateSet.mem_union lll1 lll2),
133 (StateSet.mem_union r1 r2 ,StateSet.mem_union rr1 rr2,StateSet.mem_union rrr1 rrr2)
135 let merge_states f1 f2 =
137 union_hex (st f1) (st f2)
139 union_hex (st (not_ f1)) (st (not_ f2))
143 let order f1 f2 = if uid f1 < uid f2 then f2,f1 else f1,f2
146 (* Tautologies: x|x, x|not(x) *)
148 if equal f1 f2 then f1 else
149 if equal f1 (not_ f2) then true_ else
152 if is_true f1 || is_true f2 then true_ else
153 if is_false f1 && is_false f2 then false_ else
154 if is_false f1 then f2 else
155 if is_false f2 then f1 else
157 (* commutativity of | *)
159 let f1,f2 = order f1 f2 in
160 let psize = (size f1) + (size f2) in
161 let nsize = (size (not_ f1)) + (size (not_ f2)) in
162 let sp,sn = merge_states f1 f2 in
163 fst (cons (Or(f1,f2)) (And(not_ f1,not_ f2)) sp sn psize nsize)
168 (* Tautologies: x&x, x¬(x) *)
170 if equal f1 f2 then f1 else
171 if equal f1 (not_ f2) then false_ else
173 (* simplifications *)
175 if is_true f1 && is_true f2 then true_ else
176 if is_false f1 || is_false f2 then false_ else
177 if is_true f1 then f2 else
178 if is_true f2 then f1 else
180 (* commutativity of & *)
182 let f1,f2 = order f1 f2 in
183 let psize = (size f1) + (size f2) in
184 let nsize = (size (not_ f1)) + (size (not_ f2)) in
185 let sp,sn = merge_states f1 f2 in
186 fst (cons (And(f1,f2)) (Or(not_ f1,not_ f2)) sp sn psize nsize)
187 module Infix = struct
188 let ( +| ) f1 f2 = or_ f1 f2
189 let ( *& ) f1 f2 = and_ f1 f2
190 let ( *+ ) d s = atom_ d true s
191 let ( *- ) d s = atom_ d false s
195 module Transition = struct
197 type node = State.t*bool*Formula.t*bool
198 include Hcons.Make(struct
200 let hash (s,m,f,b) = HASHINT4(s,Formula.uid f,vb m,vb b)
201 let equal (s,b,f,m) (s',b',f',m') =
202 s == s' && b==b' && m==m' && Formula.equal f f'
205 let print ppf f = let (st,mark,form,b) = node f in
206 Format.fprintf ppf "%i %s" st (if mark then "⇒" else "→");
207 Formula.print ppf form;
208 Format.fprintf ppf "%s%!" (if b then " (b)" else "")
211 module Infix = struct
213 let ( >< ) state (l,mark) = state,(l,mark,false)
214 let ( ><@ ) state (l,mark) = state,(l,mark,true)
215 let ( >=> ) (state,(label,mark,bur)) form = (state,label,(make (state,mark,form,bur)))
220 module TransTable = Hashtbl
222 module Formlist = struct
223 include Hlist.Make(Transition)
225 let make _ = failwith "make"
227 iter (fun t -> Transition.print ppf t; Format.pp_print_newline ppf ()) fl
233 mutable states : Ptset.Int.t;
235 starstate : Ptset.Int.t option;
236 (* Transitions of the Alternating automaton *)
237 trans : (State.t,(TagSet.t*Transition.t) list) Hashtbl.t;
238 query_string: string;
243 Format.fprintf ppf "Automaton (%i) :\n" a.id;
244 Format.fprintf ppf "States : "; StateSet.print ppf a.states;
245 Format.fprintf ppf "\nInitial states : "; StateSet.print ppf a.init;
246 Format.fprintf ppf "\nAlternating transitions :\n";
247 let l = Hashtbl.fold (fun k t acc ->
248 (List.map (fun (ts,tr) -> (ts,k),Transition.node tr) t) @ acc) a.trans [] in
249 let l = List.sort (fun ((tsx,x),_) ((tsy,y),_) ->
250 if y-x == 0 then TagSet.compare tsy tsx else y-x) l in
251 let maxh,maxt,l_print =
253 fun (maxh,maxt,l) ((ts,q),(_,b,f,_)) ->
255 if TagSet.is_finite ts
256 then "{" ^ (TagSet.fold (fun t a -> a ^ " '" ^ (Tag.to_string t)^"'") ts "") ^" }"
257 else let cts = TagSet.neg ts in
258 if TagSet.is_empty cts then "*" else
259 (TagSet.fold (fun t a -> a ^ " " ^ (Tag.to_string t)) cts "*\\{"
262 let s = Printf.sprintf "(%s,%i)" s q in
264 Formula.print Format.str_formatter f;
265 Format.flush_str_formatter()
267 (max (String.length s) maxh, max (String.length s_frm) maxt,
268 (s,(if b then "⇒" else "→"),s_frm)::l)) (0,0,[]) l
270 Format.fprintf ppf "%s\n%!" (String.make (maxt+maxh+3) '_');
271 List.iter (fun (s,m,f) -> let s = s ^ (String.make (maxh-(String.length s)) ' ') in
272 Format.fprintf ppf "%s %s %s\n" s m f) l_print;
273 Format.fprintf ppf "%s\n%!" (String.make (maxt+maxh+3) '_')
276 module FormTable = Hashtbl.Make(struct
277 type t = Formula.t*StateSet.t*StateSet.t
278 let equal (f1,s1,t1) (f2,s2,t2) =
279 f1 == f2 && s1 == s2 && t1 == t2
281 HASHINT3(Formula.uid f ,StateSet.uid s,StateSet.uid t)
284 module MemoForm = Memoizer.Make(
290 fun eval (f, ((s1,s2) as sets)) ->
292 | F.True -> true,true,true
293 | F.False -> false,false,false
294 | F.Atom((`Left|`LLeft),b,q) ->
295 if b == (StateSet.mem q s1)
296 then (true,true,false)
297 else false,false,false
299 if b == (StateSet.mem q s2)
300 then (true,false,true)
301 else false,false,false
303 let b1,rl1,rr1 = eval (f1,sets)
305 if b1 && rl1 && rr1 then (true,true,true) else
306 let b2,rl2,rr2 = eval (f2,sets) in
307 let rl1,rr1 = if b1 then rl1,rr1 else false,false
308 and rl2,rr2 = if b2 then rl2,rr2 else false,false
309 in (b1 || b2, rl1||rl2,rr1||rr2)
312 let b1,rl1,rr1 = eval (f1,sets) in
313 if b1 && rl1 && rr1 then (true,true,true) else
315 let b2,rl2,rr2 = eval (f2,sets) in
316 if b2 then (true,rl1||rl2,rr1||rr2) else (false,false,false)
317 else (false,false,false)
324 let h_f = FormTable.create BIG_H_SIZE in
328 | F.True -> true,true,true
329 | F.False -> false,false,false
330 | F.Atom((`Left|`LLeft),b,q) ->
331 if b == (StateSet.mem q s1)
332 then (true,true,false)
333 else false,false,false
335 if b == (StateSet.mem q s2)
336 then (true,false,true)
337 else false,false,false
339 try FormTable.find h_f (f,s1,s2)
340 with Not_found -> let r =
343 let b1,rl1,rr1 = loop f1
345 if b1 && rl1 && rr1 then (true,true,true) else
346 let b2,rl2,rr2 = loop f2 in
347 let rl1,rr1 = if b1 then rl1,rr1 else false,false
348 and rl2,rr2 = if b2 then rl2,rr2 else false,false
349 in (b1 || b2, rl1||rl2,rr1||rr2)
352 let b1,rl1,rr1 = loop f1 in
353 if b1 && rl1 && rr1 then (true,true,true) else
355 let b2,rl2,rr2 = loop f2 in
356 if b2 then (true,rl1||rl2,rr1||rr2) else (false,false,false)
357 else (false,false,false)
359 in FormTable.add h_f (f,s1,s2) r;r
363 module FTable = Hashtbl.Make( struct
364 type t = Formlist.t*StateSet.t*StateSet.t
365 let equal (f1,s1,t1) (f2,s2,t2) =
366 f1 == f2 && s1 == s2 && t1 == t2;;
367 let hash (f,s,t) = HASHINT3(Formlist.uid f ,StateSet.uid s,StateSet.uid t);;
371 let h_f = FTable.create BIG_H_SIZE
373 let eval_formlist s1 s2 fl =
376 FTable.find h_f (fl,s1,s2)
379 match Formlist.node fl with
380 | Formlist.Cons(f,fll) ->
381 let q,mark,f,_ = Transition.node f in
382 let b,b1,b2 = eval_form_bool f s1 s2 in
383 let (s,(b',b1',b2',amark)) as res = loop fll in
384 let r = if b then (StateSet.add q s, (b, b1'||b1,b2'||b2,mark||amark))
386 in FTable.add h_f (fl,s1,s2) r;r
387 | Formlist.Nil -> StateSet.empty,(false,false,false,false)
390 let tags_of_state a q =
393 if p == q then List.fold_left
395 let _,_,_,aux = Transition.node t in
397 TagSet.cup ts acc) acc l
399 else acc) a.trans TagSet.empty
404 let ts = Ptset.Int.fold (fun q acc -> TagSet.cup acc (tags_of_state a q)) qs TagSet.empty
406 if TagSet.is_finite ts
407 then `Positive(TagSet.positive ts)
408 else `Negative(TagSet.negative ts)
412 | `Positive s -> let r = Ptset.Int.inter a s in (r,Ptset.Int.mem Tag.pcdata r, true)
413 | `Negative s -> let r = Ptset.Int.diff a s in (r, Ptset.Int.mem Tag.pcdata r, false)
416 module type ResultSet =
419 type elt = [` Tree] Tree.node
421 val cons : elt -> t -> t
422 val concat : t -> t -> t
423 val iter : ( elt -> unit) -> t -> unit
424 val fold : ( elt -> 'a -> 'a) -> t -> 'a -> 'a
425 val map : ( elt -> elt) -> t -> t
426 val length : t -> int
427 val merge : (bool*bool*bool*bool) -> elt -> t -> t -> t
430 module Integer : ResultSet =
433 type elt = [`Tree] Tree.node
436 let concat x y = x + y
437 let iter _ _ = failwith "iter not implemented"
438 let fold _ _ _ = failwith "fold not implemented"
439 let map _ _ = failwith "map not implemented"
441 let merge (rb,rb1,rb2,mark) t res1 res2 =
443 let res1 = if rb1 then res1 else 0
444 and res2 = if rb2 then res2 else 0
446 if mark then 1+res1+res2
451 module IdSet : ResultSet =
453 type elt = [`Tree] Tree.node
456 | Concat of node*node
458 and t = { node : node;
461 let empty = { node = Nil; length = 0 }
463 let cons e t = { node = Cons(e,t.node); length = t.length+1 }
464 let concat t1 t2 = { node = Concat(t1.node,t2.node); length = t1.length+t2.length }
465 let append e t = { node = Concat(t.node,Cons(e,Nil)); length = t.length+1 }
468 let rec loop acc t = match t with
470 | Cons (e,t) -> loop (f e acc) t
471 | Concat (t1,t2) -> loop (loop acc t1) t2
475 let length l = l.length
479 let rec loop = function
481 | Cons (e,t) -> f e; loop t
482 | Concat(t1,t2) -> loop t1;loop t2
486 let rec loop = function
488 | Cons(e,t) -> Cons(f e, loop t)
489 | Concat(t1,t2) -> Concat(loop t1,loop t2)
491 { l with node = loop l.node }
493 let merge (rb,rb1,rb2,mark) t res1 res2 =
495 let res1 = if rb1 then res1 else empty
496 and res2 = if rb2 then res2 else empty
498 if mark then { node = Cons(t,(Concat(res1.node,res2.node)));
499 length = res1.length + res2.length + 1;}
501 { node = (Concat(res1.node,res2.node));
502 length = res1.length + res2.length ;}
508 module Run (RS : ResultSet) =
511 module SList = struct
512 include Hlist.Make (StateSet)
514 let make _ = failwith "make"
521 module IntSet = Set.Make(struct type t = int let compare = (-) end)
522 INCLUDE "html_trace.ml"
525 let mk_fun f s = D_IGNORE_(register_funname f s,f)
526 let mk_app_fun f arg s = let g = f arg in
527 D_IGNORE_(register_funname g ((get_funname f) ^ " " ^ s), g)
529 let string_of_ts tags = (Ptset.Int.fold (fun t a -> a ^ " " ^ (Tag.to_string t) ) tags "{")^ " }"
532 let choose_jump tagset qtags1 qtagsn a f_nil f_t1 f_s1 f_tn f_sn f_notext f_maytext =
533 let tags1,hastext1,fin1 = inter_text tagset (tags a qtags1) in
534 let tagsn,hastextn,finn = inter_text tagset (tags a qtagsn) in
535 (*if (hastext1||hastextn) then (`ANY,f_text) (* jumping to text nodes doesn't work really well *)
537 if (Ptset.Int.is_empty tags1) && (Ptset.Int.is_empty tagsn) then (`NIL,f_nil)
538 else if (Ptset.Int.is_empty tagsn) then
539 if (Ptset.Int.is_singleton tags1)
540 then (* TaggedChild/Sibling *)
541 let tag = (Ptset.Int.choose tags1) in (`TAG(tag),mk_app_fun f_t1 tag (Tag.to_string tag))
542 else (* SelectChild/Sibling *)
543 (`ANY,mk_app_fun f_s1 tags1 (string_of_ts tags1))
544 else if (Ptset.Int.is_empty tags1) then
545 if (Ptset.Int.is_singleton tagsn)
546 then (* TaggedDesc/Following *)
547 let tag = (Ptset.Int.choose tagsn) in (`TAG(tag),mk_app_fun f_tn tag (Tag.to_string tag))
548 else (* SelectDesc/Following *)
549 (`ANY,mk_app_fun f_sn tagsn (string_of_ts tagsn))
550 else if (hastext1||hastextn) then (`ANY,f_maytext)
553 let choose_jump_down tree a b c d =
555 (mk_fun (fun _ -> Tree.nil) "Tree.mk_nil")
556 (mk_fun (Tree.tagged_child tree) "Tree.tagged_child")
557 (mk_fun (Tree.select_child tree) "Tree.select_child")
558 (mk_fun (Tree.tagged_desc tree) "Tree.tagged_desc")
559 (mk_fun (Tree.select_desc tree) "Tree.select_desc")
560 (mk_fun (Tree.first_element tree) "Tree.first_element")
561 (mk_fun (Tree.first_child tree) "Tree.first_child")
563 let choose_jump_next tree a b c d =
565 (mk_fun (fun _ _ -> Tree.nil) "Tree.mk_nil2")
566 (mk_fun (Tree.tagged_sibling_ctx tree) "Tree.tagged_sibling_ctx")
567 (mk_fun (Tree.select_sibling_ctx tree) "Tree.select_sibling_ctx")
568 (mk_fun (Tree.tagged_foll_ctx tree) "Tree.tagged_foll_ctx")
569 (mk_fun (Tree.select_foll_ctx tree) "Tree.select_foll_ctx")
570 (mk_fun (Tree.next_element_ctx tree) "Tree.node_element_ctx")
571 (mk_fun (Tree.next_sibling_ctx tree) "Tree.node_sibling_ctx")
576 type t = Tag.t*SList.t
577 let equal (t1,s1) (t2,s2) = t1 == t2 && s1 == s2
578 let hash (t,s) = HASHINT2(t,SList.uid s)
581 module CachedTransTable = Hashtbl.Make(SetTagKey)
582 let td_trans = CachedTransTable.create 4093
586 let rec loop acc = function 0 -> acc
587 | n -> loop (SList.cons StateSet.empty acc) (n-1)
590 let merge rb rb1 rb2 mark t res1 res2 =
592 let res1 = if rb1 then res1 else RS.empty
593 and res2 = if rb2 then res2 else RS.empty
595 if mark then RS.cons t (RS.concat res1 res2)
596 else RS.concat res1 res2
600 let top_down ?(noright=false) a tree t slist ctx slot_size =
601 let pempty = empty_size slot_size in
602 (* evaluation starts from the right so we put sl1,res1 at the end *)
603 let eval_fold2_slist fll t (sl2,res2) (sl1,res1) =
604 let res = Array.copy res1 in
605 let rec fold l1 l2 fll i aq =
606 match SList.node l1,SList.node l2, fll with
607 | SList.Cons(s1,ll1),
610 let r',flags = eval_formlist s1 s2 fl in
611 let _ = res.(i) <- RS.merge flags t res1.(i) res2.(i)
613 fold ll1 ll2 fll (i+1) (SList.cons r' aq)
615 | SList.Nil, SList.Nil,[] -> aq,res
618 fold sl1 sl2 fll 0 SList.nil
620 let null_result() = (pempty,Array.make slot_size RS.empty) in
622 let rec loop t slist ctx =
623 if t == Tree.nil then null_result() else get_trans t slist (Tree.tag tree t) ctx
625 and loop_tag tag t slist ctx =
626 if t == Tree.nil then null_result() else get_trans t slist tag ctx
627 and loop_no_right t slist ctx =
628 if t == Tree.nil then null_result() else get_trans ~noright:true t slist (Tree.tag tree t) ctx
629 and get_trans ?(noright=false) t slist tag ctx =
632 CachedTransTable.find td_trans (tag,slist)
635 let fl_list,llist,rlist,ca,da,sa,fa =
637 (fun set (fll_acc,lllacc,rllacc,ca,da,sa,fa) -> (* For each set *)
638 let fl,ll,rr,ca,da,sa,fa =
642 (fun ((fl_acc,ll_acc,rl_acc,c_acc,d_acc,s_acc,f_acc) as acc)
644 if (TagSet.mem tag ts)
646 let _,_,f,_ = Transition.node t in
647 let (child,desc,below),(sibl,foll,after) = Formula.st f in
648 (Formlist.cons t fl_acc,
649 StateSet.union ll_acc below,
650 StateSet.union rl_acc after,
651 StateSet.union child c_acc,
652 StateSet.union desc d_acc,
653 StateSet.union sibl s_acc,
654 StateSet.union foll f_acc)
656 try Hashtbl.find a.trans q
658 Not_found -> Printf.eprintf "Looking for state %i, doesn't exist!!!\n%!"
662 ) set (Formlist.nil,StateSet.empty,StateSet.empty,ca,da,sa,fa)
663 in fl::fll_acc, (SList.cons ll lllacc), (SList.cons rr rllacc),ca,da,sa,fa)
664 slist ([],SList.nil,SList.nil,StateSet.empty,StateSet.empty,StateSet.empty,StateSet.empty)
666 (* Logic to chose the first and next function *)
667 let _,tags_below,_,tags_after = Tree.tags tree tag in
668 let f_kind,first = choose_jump_down tree tags_below ca da a
669 and n_kind,next = if noright then (`NIL, fun _ _ -> Tree.nil )
670 else choose_jump_next tree tags_after sa fa a in
671 let empty_res = null_result() in
673 match f_kind,n_kind with
675 (fun _ _ -> eval_fold2_slist fl_list t empty_res empty_res )
679 (fun t _ -> eval_fold2_slist fl_list t empty_res
680 (loop_tag tag (first t) llist t))
682 (fun t _ -> eval_fold2_slist fl_list t empty_res
683 (loop (first t) llist t))
689 (fun t ctx -> eval_fold2_slist fl_list t
690 (loop_tag tag (next t ctx) rlist ctx) empty_res)
693 (fun t ctx -> eval_fold2_slist fl_list t
694 (loop (next t ctx) rlist ctx) empty_res)
698 | `TAG(tag1),`TAG(tag2) ->
699 (fun t ctx -> eval_fold2_slist fl_list t
700 (loop (next t ctx) rlist ctx)
701 (loop (first t) llist t))
705 eval_fold2_slist fl_list t
706 (loop (next t ctx) rlist ctx)
707 (loop_tag tag (first t) llist t))
710 eval_fold2_slist fl_list t
711 (loop_tag tag (next t ctx) rlist ctx)
712 (loop (first t) llist t) )
715 eval_fold2_slist fl_list t
716 (loop (next t ctx) rlist ctx)
717 (loop (first t) llist t) )
720 let cont = D_IF_( (fun t ctx ->
721 let a,b = cont t ctx in
722 register_trace t (slist,a,fl_list,first,next,ctx);
726 (CachedTransTable.add td_trans (tag,slist) cont;cont)
730 (if noright then loop_no_right else loop) t slist ctx
733 let run_top_down a tree =
734 let init = SList.cons a.init SList.nil in
735 let _,res = top_down a tree Tree.root init Tree.root 1
738 output_trace a tree root "trace.html"
739 (RS.fold (fun t a -> IntSet.add (Tree.id t) a) res.(0) IntSet.empty),
743 module Configuration =
745 module Ptss = Set.Make(StateSet)
746 module IMap = Map.Make(StateSet)
747 type t = { hash : int;
749 results : RS.t IMap.t }
750 let empty = { hash = 0;
752 results = IMap.empty;
754 let is_empty c = Ptss.is_empty c.sets
756 if Ptss.mem s c.sets then
757 { c with results = IMap.add s (RS.concat r (IMap.find s c.results)) c.results}
759 { hash = HASHINT2(c.hash,Ptset.Int.uid s);
760 sets = Ptss.add s c.sets;
761 results = IMap.add s r c.results
764 let pr fmt c = Format.fprintf fmt "{";
765 Ptss.iter (fun s -> StateSet.print fmt s;
766 Format.fprintf fmt " ") c.sets;
767 Format.fprintf fmt "}\n%!";
768 IMap.iter (fun k d ->
769 StateSet.print fmt k;
770 Format.fprintf fmt "-> %i\n" (RS.length d)) c.results;
771 Format.fprintf fmt "\n%!"
774 let acc1 = IMap.fold (fun s r acc ->
777 RS.concat r (IMap.find s acc)
779 | Not_found -> r) acc) c1.results IMap.empty
782 IMap.fold (fun s r acc ->
785 RS.concat r (IMap.find s acc)
787 | Not_found -> r) acc) c2.results acc1
791 (fun s (ah,ass) -> (HASHINT2(ah,Ptset.Int.uid s),
793 (Ptss.union c1.sets c2.sets) (0,Ptss.empty)
801 let h_fold = Hashtbl.create 511
803 let fold_f_conf t slist fl_list conf dir=
804 let rec loop sl fl acc =
805 match SList.node sl,fl with
807 |SList.Cons(s,sll), formlist::fll ->
808 let r',(rb,rb1,rb2,mark) =
809 let key = SList.hash sl,Formlist.hash formlist,dir in
811 Hashtbl.find h_fold key
813 Not_found -> let res =
814 if dir then eval_formlist s Ptset.Int.empty formlist
815 else eval_formlist Ptset.Int.empty s formlist
816 in (Hashtbl.add h_fold key res;res)
818 if rb && ((dir&&rb1)|| ((not dir) && rb2))
822 try Configuration.IMap.find s conf.Configuration.results
823 with Not_found -> RS.empty
825 Configuration.add acc r' (if mark then RS.cons t old_r else old_r)
828 else loop sll fll acc
831 loop slist fl_list Configuration.empty
833 let h_trans = Hashtbl.create 4096
835 let get_up_trans slist ptag a tree =
836 let key = (HASHINT2(SList.uid slist,ptag)) in
838 Hashtbl.find h_trans key
842 Hashtbl.fold (fun q l acc ->
843 List.fold_left (fun fl_acc (ts,t) ->
844 if TagSet.mem ptag ts then Formlist.cons t fl_acc
850 let res = SList.fold (fun _ acc -> f_list::acc) slist []
852 (Hashtbl.add h_trans key res;res)
855 let h_tdconf = Hashtbl.create 511
856 let rec bottom_up a tree t conf next jump_fun root dotd init accu =
857 if (not dotd) && (Configuration.is_empty conf ) then
862 let below_right = Tree.is_below_right tree t next in
864 let accu,rightconf,next_of_next =
865 if below_right then (* jump to the next *)
866 bottom_up a tree next conf (jump_fun next) jump_fun (Tree.next_sibling tree t) true init accu
867 else accu,Configuration.empty,next
871 if below_right then prepare_topdown a tree t true
872 else prepare_topdown a tree t false
876 (Configuration.merge rightconf sub, next_of_next)
878 if t == root then accu,conf,next
880 let parent = Tree.binary_parent tree t in
881 let ptag = Tree.tag tree parent in
882 let dir = Tree.is_left tree t in
883 let slist = Configuration.Ptss.fold (fun e a -> SList.cons e a) conf.Configuration.sets SList.nil in
884 let fl_list = get_up_trans slist ptag a parent in
885 let slist = SList.rev (slist) in
886 let newconf = fold_f_conf parent slist fl_list conf dir in
887 let accu,newconf = Configuration.IMap.fold (fun s res (ar,nc) ->
888 if Ptset.Int.intersect s init then
889 ( RS.concat res ar ,nc)
890 else (ar,Configuration.add nc s res))
891 (newconf.Configuration.results) (accu,Configuration.empty)
894 bottom_up a tree parent newconf next jump_fun root false init accu
896 and prepare_topdown a tree t noright =
897 let tag = Tree.tag tree t in
898 (* pr "Going top down on tree with tag %s = %s "
899 (if Tree.is_nil t then "###" else (Tag.to_string(Tree.tag t))) (Tree.dump_node t); *)
902 Hashtbl.find h_tdconf tag
905 let res = Hashtbl.fold (fun q l acc ->
906 if List.exists (fun (ts,_) -> TagSet.mem tag ts) l
907 then Ptset.Int.add q acc
908 else acc) a.trans Ptset.Int.empty
909 in Hashtbl.add h_tdconf tag res;res
911 (* let _ = pr ", among ";
912 StateSet.print fmt (Ptset.Int.elements r);
915 let r = SList.cons r SList.nil in
916 let set,res = top_down (~noright:noright) a tree t r t 1 in
917 let set = match SList.node set with
918 | SList.Cons(x,_) ->x
921 (* pr "Result of topdown run is %!";
922 StateSet.print fmt (Ptset.Int.elements set);
923 pr ", number is %i\n%!" (RS.length res.(0)); *)
924 Configuration.add Configuration.empty set res.(0)
928 let run_bottom_up a tree k =
930 let trlist = Hashtbl.find a.trans (Ptset.Int.choose a.init)
932 let init = List.fold_left
934 let _,_,f,_ = Transition.node t in
935 let _,_,l = fst ( Formula.st f ) in
936 Ptset.Int.union acc l)
937 Ptset.Int.empty trlist
942 (*Tree.tagged_lowest t tag, fun tree -> Tree.tagged_next tree tag*)
943 (Tree.tagged_desc tree tag t, let jump = Tree.tagged_foll_ctx tree tag
944 in fun n -> jump n t )
945 | `CONTAINS(_) -> (Tree.first_child tree t,let jump = Tree.next_sibling_ctx tree
946 in fun n -> jump n t)
949 let tree2 = jump_fun tree1 in
950 let rec loop t next acc =
951 (* let _ = pr "\n_________________________\nNew iteration\n" in
952 let _ = pr "Jumping to %s\n%!" (Tree.dump_node tree) in *)
953 let acc,conf,next_of_next = bottom_up a tree t
954 Configuration.empty next jump_fun (Tree.root) true init acc
956 (* let _ = pr "End of first iteration, conf is:\n%!";
957 Configuration.pr fmt conf
959 let acc = Configuration.IMap.fold
960 ( fun s res acc -> if Ptset.Int.intersect init s
961 then RS.concat res acc else acc) conf.Configuration.results acc
963 if Tree.is_nil next_of_next (*|| Tree.equal next next_of_next *)then
965 else loop next_of_next (jump_fun next_of_next) acc
967 loop tree1 tree2 RS.empty
972 let top_down_count a t = let module RI = Run(Integer) in Integer.length (RI.run_top_down a t)
973 let top_down a t = let module RI = Run(IdSet) in (RI.run_top_down a t)
974 let bottom_up_count a t k = let module RI = Run(Integer) in Integer.length (RI.run_bottom_up a t k)