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 = struct
31 Format.pp_print_string ppf "{ ";
32 iter (fun i -> Format.fprintf ppf "%i " i) s;
33 Format.pp_print_string ppf "}";
34 Format.pp_print_flush ppf ()
41 | Or of 'hcons * 'hcons
42 | And of 'hcons * 'hcons
43 | Atom of ([ `Left | `Right | `LLeft | `RRight ]*bool*State.t)
47 st : (StateSet.t*StateSet.t*StateSet.t)*(StateSet.t*StateSet.t*StateSet.t);
48 size: int; (* Todo check if this is needed *)
51 external hash_const_variant : [> ] -> int = "%identity"
52 module rec HNode : Hcons.S with type data = Node.t = Hcons.Make (Node)
53 and Node : Hashtbl.HashedType with type t = HNode.t node =
56 let equal x y = x.size == y.size &&
57 match x.pos,y.pos with
60 | Or(xf1,xf2),Or(yf1,yf2)
61 | And(xf1,xf2),And(yf1,yf2) -> (HNode.equal xf1 yf1) && (HNode.equal xf2 yf2)
62 | Atom(d1,p1,s1), Atom(d2,p2,s2) -> d1 == d2 && (p1==p2) && s1 == s2
68 | Or (f1,f2) -> HASHINT3(PRIME2,HNode.uid f1,HNode.uid f2)
69 | And (f1,f2) -> HASHINT3(PRIME3,HNode.uid f1,HNode.uid f2)
70 | Atom(d,p,s) -> HASHINT4(PRIME4,hash_const_variant d,vb p,s)
76 let equal = HNode.equal
77 let expr f = (HNode.node f).pos
78 let st f = (HNode.node f ).st
79 let size f = (HNode.node f).size
88 let rec print ?(parent=false) ppf f =
89 if parent then Format.fprintf ppf "(";
90 let _ = match expr f with
91 | True -> Format.fprintf ppf "T"
92 | False -> Format.fprintf ppf "F"
94 print ~parent:(prio f > prio f1) ppf f1;
95 Format.fprintf ppf " ∧ ";
96 print ~parent:(prio f > prio f2) ppf f2;
99 Format.fprintf ppf " ∨ ";
101 | Atom(dir,b,s) -> Format.fprintf ppf "%s%s[%i]"
102 (if b then "" else "¬")
109 if parent then Format.fprintf ppf ")"
111 let print ppf f = print ~parent:false ppf f
113 let is_true f = (expr f) == True
114 let is_false f = (expr f) == False
117 let cons pos neg s1 s2 size1 size2 =
118 let nnode = HNode.make { pos = neg; neg = (Obj.magic 0); st = s2; size = size2 } in
119 let pnode = HNode.make { pos = pos; neg = nnode ; st = s1; size = size1 }
121 (HNode.node nnode).neg <- pnode; (* works because the neg field isn't taken into
122 account for hashing ! *)
125 let empty_triple = StateSet.empty,StateSet.empty,StateSet.empty
126 let empty_hex = empty_triple,empty_triple
127 let true_,false_ = cons True False empty_hex empty_hex 0 0
129 let si = StateSet.singleton s in
130 let ss = match d with
131 | `Left -> (si,StateSet.empty,si),empty_triple
132 | `Right -> empty_triple,(si,StateSet.empty,si)
133 | `LLeft -> (StateSet.empty,si,si),empty_triple
134 | `RRight -> empty_triple,(StateSet.empty,si,si)
135 in fst (cons (Atom(d,p,s)) (Atom(d,not p,s)) ss ss 1 1)
137 let not_ f = (HNode.node f).neg
138 let union_hex ((l1,ll1,lll1),(r1,rr1,rrr1)) ((l2,ll2,lll2),(r2,rr2,rrr2)) =
139 (StateSet.mem_union l1 l2 ,StateSet.mem_union ll1 ll2,StateSet.mem_union lll1 lll2),
140 (StateSet.mem_union r1 r2 ,StateSet.mem_union rr1 rr2,StateSet.mem_union rrr1 rrr2)
142 let merge_states f1 f2 =
144 union_hex (st f1) (st f2)
146 union_hex (st (not_ f1)) (st (not_ f2))
150 let order f1 f2 = if uid f1 < uid f2 then f2,f1 else f1,f2
153 (* Tautologies: x|x, x|not(x) *)
155 if equal f1 f2 then f1 else
156 if equal f1 (not_ f2) then true_ else
159 if is_true f1 || is_true f2 then true_ else
160 if is_false f1 && is_false f2 then false_ else
161 if is_false f1 then f2 else
162 if is_false f2 then f1 else
164 (* commutativity of | *)
166 let f1,f2 = order f1 f2 in
167 let psize = (size f1) + (size f2) in
168 let nsize = (size (not_ f1)) + (size (not_ f2)) in
169 let sp,sn = merge_states f1 f2 in
170 fst (cons (Or(f1,f2)) (And(not_ f1,not_ f2)) sp sn psize nsize)
175 (* Tautologies: x&x, x¬(x) *)
177 if equal f1 f2 then f1 else
178 if equal f1 (not_ f2) then false_ else
180 (* simplifications *)
182 if is_true f1 && is_true f2 then true_ else
183 if is_false f1 || is_false f2 then false_ else
184 if is_true f1 then f2 else
185 if is_true f2 then f1 else
187 (* commutativity of & *)
189 let f1,f2 = order f1 f2 in
190 let psize = (size f1) + (size f2) in
191 let nsize = (size (not_ f1)) + (size (not_ f2)) in
192 let sp,sn = merge_states f1 f2 in
193 fst (cons (And(f1,f2)) (Or(not_ f1,not_ f2)) sp sn psize nsize)
194 module Infix = struct
195 let ( +| ) f1 f2 = or_ f1 f2
196 let ( *& ) f1 f2 = and_ f1 f2
197 let ( *+ ) d s = atom_ d true s
198 let ( *- ) d s = atom_ d false s
202 module Transition = struct
204 type node = State.t*bool*Formula.t*bool
205 include Hcons.Make(struct
207 let hash (s,m,f,b) = HASHINT4(s,Formula.uid f,vb m,vb b)
208 let equal (s,b,f,m) (s',b',f',m') =
209 s == s' && b==b' && m==m' && Formula.equal f f'
212 let print ppf f = let (st,mark,form,b) = node f in
213 Format.fprintf ppf "%i %s" st (if mark then "⇒" else "→");
214 Formula.print ppf form;
215 Format.fprintf ppf "%s%!" (if b then " (b)" else "")
218 module Infix = struct
220 let ( >< ) state (l,mark) = state,(l,mark,false)
221 let ( ><@ ) state (l,mark) = state,(l,mark,true)
222 let ( >=> ) (state,(label,mark,bur)) form = (state,label,(make (state,mark,form,bur)))
227 module TransTable = Hashtbl
229 module Formlist = struct
230 include Hlist.Make(Transition)
232 let make _ = failwith "make"
234 iter (fun t -> Transition.print ppf t; Format.pp_print_newline ppf ()) fl
240 mutable states : Ptset.Int.t;
242 starstate : Ptset.Int.t option;
243 (* Transitions of the Alternating automaton *)
244 trans : (State.t,(TagSet.t*Transition.t) list) Hashtbl.t;
245 query_string: string;
250 Format.fprintf ppf "Automaton (%i) :\n" a.id;
251 Format.fprintf ppf "States : "; StateSet.print ppf a.states;
252 Format.fprintf ppf "\nInitial states : "; StateSet.print ppf a.init;
253 Format.fprintf ppf "\nAlternating transitions :\n";
254 let l = Hashtbl.fold (fun k t acc ->
255 (List.map (fun (ts,tr) -> (ts,k),Transition.node tr) t) @ acc) a.trans [] in
256 let l = List.sort (fun ((tsx,x),_) ((tsy,y),_) ->
257 if y-x == 0 then TagSet.compare tsy tsx else y-x) l in
258 let maxh,maxt,l_print =
260 fun (maxh,maxt,l) ((ts,q),(_,b,f,_)) ->
262 if TagSet.is_finite ts
263 then "{" ^ (TagSet.fold (fun t a -> a ^ " '" ^ (Tag.to_string t)^"'") ts "") ^" }"
264 else let cts = TagSet.neg ts in
265 if TagSet.is_empty cts then "*" else
266 (TagSet.fold (fun t a -> a ^ " " ^ (Tag.to_string t)) cts "*\\{"
269 let s = Printf.sprintf "(%s,%i)" s q in
271 Formula.print Format.str_formatter f;
272 Format.flush_str_formatter()
274 (max (String.length s) maxh, max (String.length s_frm) maxt,
275 (s,(if b then "⇒" else "→"),s_frm)::l)) (0,0,[]) l
277 Format.fprintf ppf "%s\n%!" (String.make (maxt+maxh+3) '_');
278 List.iter (fun (s,m,f) -> let s = s ^ (String.make (maxh-(String.length s)) ' ') in
279 Format.fprintf ppf "%s %s %s\n" s m f) l_print;
280 Format.fprintf ppf "%s\n%!" (String.make (maxt+maxh+3) '_')
283 module FormTable = Hashtbl.Make(struct
284 type t = Formula.t*StateSet.t*StateSet.t
285 let equal (f1,s1,t1) (f2,s2,t2) =
286 f1 == f2 && s1 == s2 && t1 == t2
288 HASHINT3(Formula.uid f ,StateSet.uid s,StateSet.uid t)
291 module MemoForm = Memoizer.Make(
297 fun eval (f, ((s1,s2) as sets)) ->
299 | F.True -> true,true,true
300 | F.False -> false,false,false
301 | F.Atom((`Left|`LLeft),b,q) ->
302 if b == (StateSet.mem q s1)
303 then (true,true,false)
304 else false,false,false
306 if b == (StateSet.mem q s2)
307 then (true,false,true)
308 else false,false,false
310 let b1,rl1,rr1 = eval (f1,sets)
312 if b1 && rl1 && rr1 then (true,true,true) else
313 let b2,rl2,rr2 = eval (f2,sets) in
314 let rl1,rr1 = if b1 then rl1,rr1 else false,false
315 and rl2,rr2 = if b2 then rl2,rr2 else false,false
316 in (b1 || b2, rl1||rl2,rr1||rr2)
319 let b1,rl1,rr1 = eval (f1,sets) in
320 if b1 && rl1 && rr1 then (true,true,true) else
322 let b2,rl2,rr2 = eval (f2,sets) in
323 if b2 then (true,rl1||rl2,rr1||rr2) else (false,false,false)
324 else (false,false,false)
331 let h_f = FormTable.create BIG_H_SIZE in
335 | F.True -> true,true,true
336 | F.False -> false,false,false
337 | F.Atom((`Left|`LLeft),b,q) ->
338 if b == (StateSet.mem q s1)
339 then (true,true,false)
340 else false,false,false
342 if b == (StateSet.mem q s2)
343 then (true,false,true)
344 else false,false,false
346 try FormTable.find h_f (f,s1,s2)
347 with Not_found -> let r =
350 let b1,rl1,rr1 = loop f1
352 if b1 && rl1 && rr1 then (true,true,true) else
353 let b2,rl2,rr2 = loop f2 in
354 let rl1,rr1 = if b1 then rl1,rr1 else false,false
355 and rl2,rr2 = if b2 then rl2,rr2 else false,false
356 in (b1 || b2, rl1||rl2,rr1||rr2)
359 let b1,rl1,rr1 = loop f1 in
360 if b1 && rl1 && rr1 then (true,true,true) else
362 let b2,rl2,rr2 = loop f2 in
363 if b2 then (true,rl1||rl2,rr1||rr2) else (false,false,false)
364 else (false,false,false)
366 in FormTable.add h_f (f,s1,s2) r;r
370 module FTable = Hashtbl.Make( struct
371 type t = Formlist.t*StateSet.t*StateSet.t
372 let equal (f1,s1,t1) (f2,s2,t2) =
373 f1 == f2 && s1 == s2 && t1 == t2;;
374 let hash (f,s,t) = HASHINT3(Formlist.uid f ,StateSet.uid s,StateSet.uid t);;
378 module MemoFormlist = Memoizer.Make(FTable)
381 let eval_formlist = MemoFormlist.make_rec (
382 fun eval (fl,((s1,s2)as sets)) ->
383 match Formlist.node fl with
384 | Formlist.Nil -> StateSet.empty,false,false,false,false
385 | Formlist.Cons(f,fll) ->
386 let q,mark,f,_ = Transition.node f in
387 let b,b1,b2 = eval_form_bool f s1 s2 in
388 let s,b',b1',b2',amark = eval (fll,sets) in
389 if b then (StateSet.add q s, b, b1'||b1,b2'||b2,mark||amark)
390 else s,b',b1',b2',amark )
394 let h_f = FTable.create BIG_H_SIZE
396 let eval_formlist s1 s2 fl =
399 FTable.find h_f (fl,s1,s2)
402 match Formlist.node fl with
403 | Formlist.Cons(f,fll) ->
404 let q,mark,f,_ = Transition.node f in
405 let b,b1,b2 = eval_form_bool f s1 s2 in
406 let s,b',b1',b2',amark = loop fll in
407 let r = if b then (StateSet.add q s, b, b1'||b1,b2'||b2,mark||amark)
408 else s,b',b1',b2',amark
409 in FTable.add h_f (fl,s1,s2) r;r
410 | Formlist.Nil -> StateSet.empty,false,false,false,false
413 let tags_of_state a q =
416 if p == q then List.fold_left
418 let _,_,_,aux = Transition.node t in
420 TagSet.cup ts acc) acc l
422 else acc) a.trans TagSet.empty
427 let ts = Ptset.Int.fold (fun q acc -> TagSet.cup acc (tags_of_state a q)) qs TagSet.empty
429 if TagSet.is_finite ts
430 then `Positive(TagSet.positive ts)
431 else `Negative(TagSet.negative ts)
435 | `Positive s -> let r = Ptset.Int.inter a s in (r,Ptset.Int.mem Tag.pcdata r, true)
436 | `Negative s -> let r = Ptset.Int.diff a s in (r, Ptset.Int.mem Tag.pcdata r, false)
439 module type ResultSet =
442 type elt = [` Tree] Tree.node
444 val cons : elt -> t -> t
445 val concat : t -> t -> t
446 val iter : ( elt -> unit) -> t -> unit
447 val fold : ( elt -> 'a -> 'a) -> t -> 'a -> 'a
448 val map : ( elt -> elt) -> t -> t
449 val length : t -> int
450 val merge : bool -> bool -> bool -> bool -> elt -> t -> t -> t
453 module Integer : ResultSet =
456 type elt = [`Tree] Tree.node
459 let concat x y = x + y
460 let iter _ _ = failwith "iter not implemented"
461 let fold _ _ _ = failwith "fold not implemented"
462 let map _ _ = failwith "map not implemented"
464 let merge rb rb1 rb2 mark t res1 res2 =
466 let res1 = if rb1 then res1 else 0
467 and res2 = if rb2 then res2 else 0
469 if mark then 1+res1+res2
474 module IdSet : ResultSet =
476 type elt = [`Tree] Tree.node
479 | Concat of node*node
481 and t = { node : node;
484 let empty = { node = Nil; length = 0 }
486 let cons e t = { node = Cons(e,t.node); length = t.length+1 }
487 let concat t1 t2 = { node = Concat(t1.node,t2.node); length = t1.length+t2.length }
488 let append e t = { node = Concat(t.node,Cons(e,Nil)); length = t.length+1 }
491 let rec loop acc t = match t with
493 | Cons (e,t) -> loop (f e acc) t
494 | Concat (t1,t2) -> loop (loop acc t1) t2
498 let length l = l.length
502 let rec loop = function
504 | Cons (e,t) -> f e; loop t
505 | Concat(t1,t2) -> loop t1;loop t2
509 let rec loop = function
511 | Cons(e,t) -> Cons(f e, loop t)
512 | Concat(t1,t2) -> Concat(loop t1,loop t2)
514 { l with node = loop l.node }
516 let merge rb rb1 rb2 mark t res1 res2 =
518 let res1 = if rb1 then res1 else empty
519 and res2 = if rb2 then res2 else empty
521 if mark then { node = Cons(t,(Concat(res1.node,res2.node)));
522 length = res1.length + res2.length + 1;}
524 { node = (Concat(res1.node,res2.node));
525 length = res1.length + res2.length ;}
531 module Run (RS : ResultSet) =
534 module SList = struct
535 include Hlist.Make (StateSet)
537 let make _ = failwith "make"
544 module IntSet = Set.Make(struct type t = int let compare = (-) end)
545 INCLUDE "html_trace.ml"
548 let mk_fun f s = D_IGNORE_(register_funname f s,f)
549 let mk_app_fun f arg s = let g = f arg in
550 D_IGNORE_(register_funname g ((get_funname f) ^ " " ^ s), g)
552 let string_of_ts tags = (Ptset.Int.fold (fun t a -> a ^ " " ^ (Tag.to_string t) ) tags "{")^ " }"
555 let choose_jump tagset qtags1 qtagsn a f_nil f_t1 f_s1 f_tn f_sn f_notext =
556 let tags1,hastext1,fin1 = inter_text tagset (tags a qtags1) in
557 let tagsn,hastextn,finn = inter_text tagset (tags a qtagsn) in
558 (*if (hastext1||hastextn) then (`ANY,f_text) (* jumping to text nodes doesn't work really well *)
560 if (Ptset.Int.is_empty tags1) && (Ptset.Int.is_empty tagsn) then (`NIL,f_nil)
561 else if (Ptset.Int.is_empty tagsn) then
562 if (Ptset.Int.is_singleton tags1)
563 then (* TaggedChild/Sibling *)
564 let tag = (Ptset.Int.choose tags1) in (`TAG(tag),mk_app_fun f_t1 tag (Tag.to_string tag))
565 else (* SelectChild/Sibling *)
566 (`ANY,mk_app_fun f_s1 tags1 (string_of_ts tags1))
567 else if (Ptset.Int.is_empty tags1) then
568 if (Ptset.Int.is_singleton tagsn)
569 then (* TaggedDesc/Following *)
570 let tag = (Ptset.Int.choose tagsn) in (`TAG(tag),mk_app_fun f_tn tag (Tag.to_string tag))
571 else (* SelectDesc/Following *)
572 (`ANY,mk_app_fun f_sn tagsn (string_of_ts tagsn))
575 let choose_jump_down tree a b c d =
577 (mk_fun (fun _ -> Tree.nil) "Tree.mk_nil")
578 (mk_fun (Tree.tagged_child tree) "Tree.tagged_child")
579 (mk_fun (Tree.select_child tree) "Tree.select_child") (* !! no select_child in Tree.ml *)
580 (mk_fun (Tree.tagged_desc tree) "Tree.tagged_desc")
581 (mk_fun (Tree.select_desc tree) "Tree.select_desc") (* !! no select_desc *)
582 (mk_fun (Tree.first_child tree) "Tree.first_child")
584 let choose_jump_next tree a b c d =
586 (mk_fun (fun _ _ -> Tree.nil) "Tree.mk_nil2")
587 (mk_fun (Tree.tagged_sibling_ctx tree) "Tree.tagged_sibling_ctx")(* !! no tagged_sibling in Tree.ml *)
588 (mk_fun (Tree.select_sibling_ctx tree) "Tree.select_sibling_ctx")(* !! no select_sibling in Tree.ml *)
589 (mk_fun (Tree.tagged_foll_ctx tree) "Tree.tagged_foll_ctx")
590 (mk_fun (Tree.select_foll_ctx tree) "Tree.select_foll_ctx")(* !! no select_foll *)
591 (mk_fun (Tree.next_sibling_ctx tree) "Tree.node_sibling_ctx")
596 type t = Tag.t*SList.t
597 let equal (t1,s1) (t2,s2) = t1 == t2 && s1 == s2
598 let hash (t,s) = HASHINT2(t,SList.uid s)
601 module CachedTransTable = Hashtbl.Make(SetTagKey)
602 let td_trans = CachedTransTable.create 4093
606 let rec loop acc = function 0 -> acc
607 | n -> loop (SList.cons StateSet.empty acc) (n-1)
610 let merge rb rb1 rb2 mark t res1 res2 =
612 let res1 = if rb1 then res1 else RS.empty
613 and res2 = if rb2 then res2 else RS.empty
615 if mark then RS.cons t (RS.concat res1 res2)
616 else RS.concat res1 res2
619 let top_down ?(noright=false) a tree t slist ctx slot_size =
620 let pempty = empty_size slot_size in
621 (* evaluation starts from the right so we put sl1,res1 at the end *)
622 let eval_fold2_slist fll t (sl2,res2) (sl1,res1) =
623 let res = Array.copy res1 in
624 let rec fold l1 l2 fll i aq =
625 match SList.node l1,SList.node l2, fll with
626 | SList.Cons(s1,ll1),
629 let r',rb,rb1,rb2,mark = eval_formlist s1 s2 fl in
630 let _ = res.(i) <- RS.merge rb rb1 rb2 mark t res1.(i) res2.(i)
632 fold ll1 ll2 fll (i+1) (SList.cons r' aq)
634 | SList.Nil, SList.Nil,[] -> aq,res
637 fold sl1 sl2 fll 0 SList.nil
639 let null_result() = (pempty,Array.make slot_size RS.empty) in
641 let rec loop t slist ctx =
642 if t == Tree.nil then null_result() else get_trans t slist (Tree.tag tree t) ctx
644 and loop_tag tag t slist ctx =
645 if t == Tree.nil then null_result() else get_trans t slist tag ctx
646 and loop_no_right t slist ctx =
647 if t == Tree.nil then null_result() else get_trans ~noright:true t slist (Tree.tag tree t) ctx
648 and get_trans ?(noright=false) t slist tag ctx =
651 CachedTransTable.find td_trans (tag,slist)
654 let fl_list,llist,rlist,ca,da,sa,fa =
656 (fun set (fll_acc,lllacc,rllacc,ca,da,sa,fa) -> (* For each set *)
657 let fl,ll,rr,ca,da,sa,fa =
661 (fun ((fl_acc,ll_acc,rl_acc,c_acc,d_acc,s_acc,f_acc) as acc)
663 if (TagSet.mem tag ts)
665 let _,_,f,_ = Transition.node t in
666 let (child,desc,below),(sibl,foll,after) = Formula.st f in
667 (Formlist.cons t fl_acc,
668 StateSet.union ll_acc below,
669 StateSet.union rl_acc after,
670 StateSet.union child c_acc,
671 StateSet.union desc d_acc,
672 StateSet.union sibl s_acc,
673 StateSet.union foll f_acc)
675 try Hashtbl.find a.trans q
677 Not_found -> Printf.eprintf "Looking for state %i, doesn't exist!!!\n%!"
681 ) set (Formlist.nil,StateSet.empty,StateSet.empty,ca,da,sa,fa)
682 in fl::fll_acc, (SList.cons ll lllacc), (SList.cons rr rllacc),ca,da,sa,fa)
683 slist ([],SList.nil,SList.nil,StateSet.empty,StateSet.empty,StateSet.empty,StateSet.empty)
685 (* Logic to chose the first and next function *)
686 let tags_below,tags_after = Tree.tags tree tag in
687 let f_kind,first = choose_jump_down tree tags_below ca da a
688 and n_kind,next = if noright then (`NIL, fun _ _ -> Tree.nil )
689 else choose_jump_next tree tags_after sa fa a in
690 let empty_res = null_result() in
692 match f_kind,n_kind with
694 (fun _ _ -> eval_fold2_slist fl_list t empty_res empty_res )
698 (fun t _ -> eval_fold2_slist fl_list t empty_res
699 (loop_tag tag (first t) llist t))
701 (fun t _ -> eval_fold2_slist fl_list t empty_res
702 (loop (first t) llist t))
708 (fun t ctx -> eval_fold2_slist fl_list t
709 (loop_tag tag (next t ctx) rlist ctx) empty_res)
712 (fun t ctx -> eval_fold2_slist fl_list t
713 (loop (next t ctx) rlist ctx) empty_res)
717 | `TAG(tag1),`TAG(tag2) ->
718 (fun t ctx -> eval_fold2_slist fl_list t
719 (loop (next t ctx) rlist ctx)
720 (loop (first t) llist t))
724 eval_fold2_slist fl_list t
725 (loop (next t ctx) rlist ctx)
726 (loop_tag tag (first t) llist t))
729 eval_fold2_slist fl_list t
730 (loop_tag tag (next t ctx) rlist ctx)
731 (loop (first t) llist t) )
734 eval_fold2_slist fl_list t
735 (loop (next t ctx) rlist ctx)
736 (loop (first t) llist t) )
739 let cont = D_IF_( (fun t ctx ->
740 let a,b = cont t ctx in
741 register_trace t (slist,a,fl_list,first,next,ctx);
745 (CachedTransTable.add td_trans (tag,slist) cont;cont)
748 (if noright then loop_no_right else loop) t slist ctx
751 let run_top_down a tree =
752 let init = SList.cons a.init SList.nil in
753 let _,res = top_down a tree Tree.root init Tree.root 1
756 output_trace a tree root "trace.html"
757 (RS.fold (fun t a -> IntSet.add (Tree.id t) a) res.(0) IntSet.empty),
761 module Configuration =
763 module Ptss = Set.Make(StateSet)
764 module IMap = Map.Make(StateSet)
765 type t = { hash : int;
767 results : RS.t IMap.t }
768 let empty = { hash = 0;
770 results = IMap.empty;
772 let is_empty c = Ptss.is_empty c.sets
774 if Ptss.mem s c.sets then
775 { c with results = IMap.add s (RS.concat r (IMap.find s c.results)) c.results}
777 { hash = HASHINT2(c.hash,Ptset.Int.uid s);
778 sets = Ptss.add s c.sets;
779 results = IMap.add s r c.results
782 let pr fmt c = Format.fprintf fmt "{";
783 Ptss.iter (fun s -> StateSet.print fmt s;
784 Format.fprintf fmt " ") c.sets;
785 Format.fprintf fmt "}\n%!";
786 IMap.iter (fun k d ->
787 StateSet.print fmt k;
788 Format.fprintf fmt "-> %i\n" (RS.length d)) c.results;
789 Format.fprintf fmt "\n%!"
792 let acc1 = IMap.fold (fun s r acc ->
795 RS.concat r (IMap.find s acc)
797 | Not_found -> r) acc) c1.results IMap.empty
800 IMap.fold (fun s r acc ->
803 RS.concat r (IMap.find s acc)
805 | Not_found -> r) acc) c2.results acc1
809 (fun s (ah,ass) -> (HASHINT2(ah,Ptset.Int.uid s),
811 (Ptss.union c1.sets c2.sets) (0,Ptss.empty)
819 let h_fold = Hashtbl.create 511
821 let fold_f_conf t slist fl_list conf dir=
822 let rec loop sl fl acc =
823 match SList.node sl,fl with
825 |SList.Cons(s,sll), formlist::fll ->
826 let r',rb,rb1,rb2,mark =
827 let key = SList.hash sl,Formlist.hash formlist,dir in
829 Hashtbl.find h_fold key
831 Not_found -> let res =
832 if dir then eval_formlist s Ptset.Int.empty formlist
833 else eval_formlist Ptset.Int.empty s formlist
834 in (Hashtbl.add h_fold key res;res)
836 if rb && ((dir&&rb1)|| ((not dir) && rb2))
840 try Configuration.IMap.find s conf.Configuration.results
841 with Not_found -> RS.empty
843 Configuration.add acc r' (if mark then RS.cons t old_r else old_r)
846 else loop sll fll acc
849 loop slist fl_list Configuration.empty
851 let h_trans = Hashtbl.create 4096
853 let get_up_trans slist ptag a tree =
854 let key = (HASHINT2(SList.uid slist,ptag)) in
856 Hashtbl.find h_trans key
860 Hashtbl.fold (fun q l acc ->
861 List.fold_left (fun fl_acc (ts,t) ->
862 if TagSet.mem ptag ts then Formlist.cons t fl_acc
868 let res = SList.fold (fun _ acc -> f_list::acc) slist []
870 (Hashtbl.add h_trans key res;res)
873 let h_tdconf = Hashtbl.create 511
874 let rec bottom_up a tree t conf next jump_fun root dotd init accu =
875 if (not dotd) && (Configuration.is_empty conf ) then
880 let below_right = Tree.is_below_right tree t next in
882 let accu,rightconf,next_of_next =
883 if below_right then (* jump to the next *)
884 bottom_up a tree next conf (jump_fun next) jump_fun (Tree.next_sibling tree t) true init accu
885 else accu,Configuration.empty,next
889 if below_right then prepare_topdown a tree t true
890 else prepare_topdown a tree t false
894 (Configuration.merge rightconf sub, next_of_next)
896 if t == root then accu,conf,next
898 let parent = Tree.binary_parent tree t in
899 let ptag = Tree.tag tree parent in
900 let dir = Tree.is_left tree t in
901 let slist = Configuration.Ptss.fold (fun e a -> SList.cons e a) conf.Configuration.sets SList.nil in
902 let fl_list = get_up_trans slist ptag a parent in
903 let slist = SList.rev (slist) in
904 let newconf = fold_f_conf parent slist fl_list conf dir in
905 let accu,newconf = Configuration.IMap.fold (fun s res (ar,nc) ->
906 if Ptset.Int.intersect s init then
907 ( RS.concat res ar ,nc)
908 else (ar,Configuration.add nc s res))
909 (newconf.Configuration.results) (accu,Configuration.empty)
912 bottom_up a tree parent newconf next jump_fun root false init accu
914 and prepare_topdown a tree t noright =
915 let tag = Tree.tag tree t in
916 (* pr "Going top down on tree with tag %s = %s "
917 (if Tree.is_nil t then "###" else (Tag.to_string(Tree.tag t))) (Tree.dump_node t); *)
920 Hashtbl.find h_tdconf tag
923 let res = Hashtbl.fold (fun q l acc ->
924 if List.exists (fun (ts,_) -> TagSet.mem tag ts) l
925 then Ptset.Int.add q acc
926 else acc) a.trans Ptset.Int.empty
927 in Hashtbl.add h_tdconf tag res;res
929 (* let _ = pr ", among ";
930 StateSet.print fmt (Ptset.Int.elements r);
933 let r = SList.cons r SList.nil in
934 let set,res = top_down (~noright:noright) a tree t r t 1 in
935 let set = match SList.node set with
936 | SList.Cons(x,_) ->x
939 (* pr "Result of topdown run is %!";
940 StateSet.print fmt (Ptset.Int.elements set);
941 pr ", number is %i\n%!" (RS.length res.(0)); *)
942 Configuration.add Configuration.empty set res.(0)
946 let run_bottom_up a tree k =
948 let trlist = Hashtbl.find a.trans (Ptset.Int.choose a.init)
950 let init = List.fold_left
952 let _,_,f,_ = Transition.node t in
953 let _,_,l = fst ( Formula.st f ) in
954 Ptset.Int.union acc l)
955 Ptset.Int.empty trlist
960 (*Tree.tagged_lowest t tag, fun tree -> Tree.tagged_next tree tag*)
961 (Tree.tagged_desc tree tag t, let jump = Tree.tagged_foll_ctx tree tag
962 in fun n -> jump n t )
963 | `CONTAINS(_) -> (Tree.first_child tree t,let jump = Tree.next_sibling_ctx tree
964 in fun n -> jump n t)
967 let tree2 = jump_fun tree1 in
968 let rec loop t next acc =
969 (* let _ = pr "\n_________________________\nNew iteration\n" in
970 let _ = pr "Jumping to %s\n%!" (Tree.dump_node tree) in *)
971 let acc,conf,next_of_next = bottom_up a tree t
972 Configuration.empty next jump_fun (Tree.root) true init acc
974 (* let _ = pr "End of first iteration, conf is:\n%!";
975 Configuration.pr fmt conf
977 let acc = Configuration.IMap.fold
978 ( fun s res acc -> if Ptset.Int.intersect init s
979 then RS.concat res acc else acc) conf.Configuration.results acc
981 if Tree.is_nil next_of_next (*|| Tree.equal next next_of_next *)then
983 else loop next_of_next (jump_fun next_of_next) acc
985 loop tree1 tree2 RS.empty
990 let top_down_count a t = let module RI = Run(Integer) in Integer.length (RI.run_top_down a t)
991 let top_down a t = let module RI = Run(IdSet) in (RI.run_top_down a t)
992 let bottom_up_count a t k = let module RI = Run(Integer) in Integer.length (RI.run_bottom_up a t k)