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)
41 st : (StateSet.t*StateSet.t*StateSet.t)*(StateSet.t*StateSet.t*StateSet.t);
42 size: int; (* Todo check if this is needed *)
45 external hash_const_variant : [> ] -> int = "%identity"
46 module rec Node : Hcons.S with type data = Data.t = Hcons.Make (Data)
47 and Data : Hashtbl.HashedType with type t = Node.t node =
50 let equal x y = x.size == y.size &&
51 match x.pos,y.pos with
52 | a,b when a == b -> true
53 | Or(xf1,xf2),Or(yf1,yf2)
54 | And(xf1,xf2),And(yf1,yf2) -> (xf1 == yf1) && (xf2 == yf2)
55 | Atom(d1,p1,s1), Atom(d2,p2,s2) -> d1 == d2 && (p1==p2) && s1 == s2
61 | Or (f1,f2) -> HASHINT3(PRIME2,f1.Node.id, f2.Node.id)
62 | And (f1,f2) -> HASHINT3(PRIME3,f1.Node.id,f2.Node.id)
63 | Atom(d,p,s) -> HASHINT4(PRIME4,hash_const_variant d,vb p,s)
67 let hash x = x.Node.key
69 let equal = Node.equal
70 let expr f = f.Node.node.pos
71 let st f = f.Node.node.st
72 let size f = f.Node.node.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 = Node.make { pos = neg; neg = (Obj.magic 0); st = s2; size = size2 } in
112 let pnode = Node.make { pos = pos; neg = nnode ; st = s1; size = size1 }
114 (Node.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 = f.Node.node.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*TagSet.t*bool*Formula.t*bool
198 include Hcons.Make(struct
200 let hash (s,ts,m,f,b) = HASHINT5(s,TagSet.uid ts,Formula.uid f,vb m,vb b)
201 let equal (s,ts,b,f,m) (s',ts',b',f',m') =
202 s == s' && ts == ts' && b==b' && m==m' && f == f'
205 let print ppf f = let (st,ts,mark,form,b) = node f in
206 Format.fprintf ppf "(%i, " st;
208 Format.fprintf ppf ") %s" (if mark then "⇒" else "→");
209 Formula.print ppf form;
210 Format.fprintf ppf "%s%!" (if b then " (b)" else "")
213 module Infix = struct
215 let ( >< ) state (l,mark) = state,(l,mark,false)
216 let ( ><@ ) state (l,mark) = state,(l,mark,true)
217 let ( >=> ) (state,(label,mark,bur)) form = (state,label,(make (state,label,mark,form,bur)))
222 module TransTable = Hashtbl
224 module Formlist = struct
225 include Hlist.Make(Transition)
227 iter (fun t -> Transition.print ppf t; Format.pp_print_newline ppf ()) fl
230 module Formlistlist =
232 include Hlist.Make(Formlist)
234 iter (fun fl -> Formlist.print ppf fl; Format.pp_print_newline ppf ())fll
239 mutable states : Ptset.Int.t;
241 starstate : Ptset.Int.t option;
242 (* Transitions of the Alternating automaton *)
243 trans : (State.t,(TagSet.t*Transition.t) list) Hashtbl.t;
244 query_string: string;
249 Format.fprintf ppf "Automaton (%i) :\n" a.id;
250 Format.fprintf ppf "States : "; StateSet.print ppf a.states;
251 Format.fprintf ppf "\nInitial states : "; StateSet.print ppf a.init;
252 Format.fprintf ppf "\nAlternating transitions :\n";
253 let l = Hashtbl.fold (fun k t acc ->
254 (List.map (fun (ts,tr) -> (ts,k),Transition.node tr) t) @ acc) a.trans [] in
255 let l = List.sort (fun ((tsx,x),_) ((tsy,y),_) ->
256 if y-x == 0 then TagSet.compare tsy tsx else y-x) l in
257 let maxh,maxt,l_print =
259 fun (maxh,maxt,l) ((ts,q),(_,_,b,f,_)) ->
261 if TagSet.is_finite ts
262 then "{" ^ (TagSet.fold (fun t a -> a ^ " '" ^ (Tag.to_string t)^"'") ts "") ^" }"
263 else let cts = TagSet.neg ts in
264 if TagSet.is_empty cts then "*" else
265 (TagSet.fold (fun t a -> a ^ " " ^ (Tag.to_string t)) cts "*\\{"
268 let s = Printf.sprintf "(%s,%i)" s q in
270 Formula.print Format.str_formatter f;
271 Format.flush_str_formatter()
273 (max (String.length s) maxh, max (String.length s_frm) maxt,
274 (s,(if b then "⇒" else "→"),s_frm)::l)) (0,0,[]) l
276 Format.fprintf ppf "%s\n%!" (String.make (maxt+maxh+3) '_');
277 List.iter (fun (s,m,f) -> let s = s ^ (String.make (maxh-(String.length s)) ' ') in
278 Format.fprintf ppf "%s %s %s\n" s m f) l_print;
279 Format.fprintf ppf "%s\n%!" (String.make (maxt+maxh+3) '_')
282 module FormTable = Hashtbl.Make(struct
283 type t = Formula.t*StateSet.t*StateSet.t
284 let equal (f1,s1,t1) (f2,s2,t2) =
285 f1 == f2 && s1 == s2 && t1 == t2
287 HASHINT3(Formula.uid f ,StateSet.uid s,StateSet.uid t)
292 let h_f = FormTable.create BIG_H_SIZE in
296 | F.True -> true,true,true
297 | F.False -> false,false,false
298 | F.Atom((`Left|`LLeft),b,q) ->
299 if b == (StateSet.mem q s1)
300 then (true,true,false)
301 else false,false,false
303 if b == (StateSet.mem q s2)
304 then (true,false,true)
305 else false,false,false
307 try FormTable.find h_f (f,s1,s2)
308 with Not_found -> let r =
311 let b1,rl1,rr1 = loop f1
313 if b1 && rl1 && rr1 then (true,true,true) else
314 let b2,rl2,rr2 = loop f2 in
315 let rl1,rr1 = if b1 then rl1,rr1 else false,false
316 and rl2,rr2 = if b2 then rl2,rr2 else false,false
317 in (b1 || b2, rl1||rl2,rr1||rr2)
320 let b1,rl1,rr1 = loop f1 in
321 if b1 && rl1 && rr1 then (true,true,true) else
323 let b2,rl2,rr2 = loop f2 in
324 if b2 then (true,rl1||rl2,rr1||rr2) else (false,false,false)
325 else (false,false,false)
327 in FormTable.add h_f (f,s1,s2) r;r
331 module FTable = Hashtbl.Make( struct
332 type t = Tag.t*Formlist.t*StateSet.t*StateSet.t
333 let equal (tg1,f1,s1,t1) (tg2,f2,s2,t2) =
334 tg1 == tg2 && f1 == f2 && s1 == s2 && t1 == t2;;
335 let hash (tg,f,s,t) = HASHINT4(tg,Formlist.uid f ,StateSet.uid s,StateSet.uid t);;
339 let h_f = FTable.create BIG_H_SIZE
341 let eval_formlist tag s1 s2 fl =
344 FTable.find h_f (tag,fl,s1,s2)
347 match Formlist.node fl with
348 | Formlist.Cons(f,fll) ->
349 let q,ts,mark,f,_ = Transition.node f in
351 if TagSet.mem tag ts then eval_form_bool f s1 s2 else (false,false,false)
353 let (s,(b',b1',b2',amark)) as res = loop fll in
354 let r = if b then (StateSet.add q s, (b, b1'||b1,b2'||b2,mark||amark))
356 in FTable.add h_f (tag,fl,s1,s2) r;r
357 | Formlist.Nil -> StateSet.empty,(false,false,false,false)
360 let tags_of_state a q =
363 if p == q then List.fold_left
365 let _,_,_,_,aux = Transition.node t in
367 TagSet.cup ts acc) acc l
369 else acc) a.trans TagSet.empty
374 let ts = Ptset.Int.fold (fun q acc -> TagSet.cup acc (tags_of_state a q)) qs TagSet.empty
376 if TagSet.is_finite ts
377 then `Positive(TagSet.positive ts)
378 else `Negative(TagSet.negative ts)
382 | `Positive s -> let r = Ptset.Int.inter a s in (r,Ptset.Int.mem Tag.pcdata r, true)
383 | `Negative s -> let r = Ptset.Int.diff a s in (r, Ptset.Int.mem Tag.pcdata r, false)
386 module type ResultSet =
389 type elt = [` Tree ] Tree.node
391 val cons : elt -> t -> t
392 val concat : t -> t -> t
393 val iter : ( elt -> unit) -> t -> unit
394 val fold : ( elt -> 'a -> 'a) -> t -> 'a -> 'a
395 val map : ( elt -> elt) -> t -> t
396 val length : t -> int
397 val merge : (bool*bool*bool*bool) -> elt -> t -> t -> t
400 module Integer : ResultSet =
403 type elt = [`Tree] Tree.node
406 let concat x y = x + y
407 let iter _ _ = failwith "iter not implemented"
408 let fold _ _ _ = failwith "fold not implemented"
409 let map _ _ = failwith "map not implemented"
411 let merge (rb,rb1,rb2,mark) t res1 res2 =
413 let res1 = if rb1 then res1 else 0
414 and res2 = if rb2 then res2 else 0
416 if mark then 1+res1+res2
421 module IdSet : ResultSet =
423 type elt = [`Tree] Tree.node
426 | Concat of node*node
428 and t = { node : node;
431 let empty = { node = Nil; length = 0 }
433 let cons e t = { node = Cons(e,t.node); length = t.length+1 }
434 let concat t1 t2 = { node = Concat(t1.node,t2.node); length = t1.length+t2.length }
435 let append e t = { node = Concat(t.node,Cons(e,Nil)); length = t.length+1 }
438 let rec loop acc t = match t with
440 | Cons (e,t) -> loop (f e acc) t
441 | Concat (t1,t2) -> loop (loop acc t1) t2
445 let length l = l.length
449 let rec loop = function
451 | Cons (e,t) -> f e; loop t
452 | Concat(t1,t2) -> loop t1;loop t2
456 let rec loop = function
458 | Cons(e,t) -> Cons(f e, loop t)
459 | Concat(t1,t2) -> Concat(loop t1,loop t2)
461 { l with node = loop l.node }
463 let merge (rb,rb1,rb2,mark) t res1 res2 =
465 let res1 = if rb1 then res1 else empty
466 and res2 = if rb2 then res2 else empty
468 if mark then { node = Cons(t,(Concat(res1.node,res2.node)));
469 length = res1.length + res2.length + 1;}
471 { node = (Concat(res1.node,res2.node));
472 length = res1.length + res2.length ;}
477 module GResult = struct
479 type elt = [` Tree] Tree.node
480 external create_empty : int -> t = "caml_result_set_create"
481 external set : t -> int -> t = "caml_result_set_set"
482 external next : t -> int -> int = "caml_result_set_next"
483 external clear : t -> int -> int -> unit = "caml_result_set_clear"
484 let empty = create_empty 100000000
486 let cons e t = set t (Obj.magic e)
491 else (f (Obj.magic i);loop (next t i))
494 let fold _ _ _ = failwith "noop"
495 let map _ _ = failwith "noop"
496 let length t = let cpt = ref ~-1 in
497 iter (fun _ -> incr cpt) t; !cpt
499 let merge (rb,rb1,rb2,mark) elt t1 t2 =
500 if mark then (set t1 (Obj.magic elt) ; t1) else t1
503 module Run (RS : ResultSet) =
506 module SList = Hlist.Make (StateSet)
512 module IntSet = Set.Make(struct type t = int let compare = (-) end)
513 INCLUDE "html_trace.ml"
516 let mk_fun f s = D_IGNORE_(register_funname f s,f)
517 let mk_app_fun f arg s = let g = f arg in
518 D_IGNORE_(register_funname g ((get_funname f) ^ " " ^ s), g)
519 let mk_app_fun2 f arg1 arg2 s = let g = f arg1 arg2 in
520 D_IGNORE_(register_funname g ((get_funname f) ^ " " ^ s), g)
522 let string_of_ts tags = (Ptset.Int.fold (fun t a -> a ^ " " ^ (Tag.to_string t) ) tags "{")^ " }"
527 type jump = [ `NIL | `ANY |`ANYNOTEXT | `JUMP ]
528 type t = jump*Ptset.Int.t*Ptset.Int.t
533 | `ANYNOTEXT -> "ANYNOTEXT"
534 let merge_jump (j1,c1,l1) (j2,c2,l2) =
536 | _,`NIL -> (j1,c1,l1)
537 | `NIL,_ -> (j2,c2,l2)
538 | `ANY,_ -> (`ANY,Ptset.Int.empty,Ptset.Int.empty)
539 | _,`ANY -> (`ANY,Ptset.Int.empty,Ptset.Int.empty)
541 if Ptset.Int.mem Tag.pcdata (Ptset.Int.union c2 l2) then
542 (`ANY,Ptset.Int.empty,Ptset.Int.empty)
544 (`ANYNOTEXT,Ptset.Int.empty,Ptset.Int.empty)
546 if Ptset.Int.mem Tag.pcdata (Ptset.Int.union c1 l1) then
547 (`ANY,Ptset.Int.empty,Ptset.Int.empty)
549 (`ANYNOTEXT,Ptset.Int.empty,Ptset.Int.empty)
550 | `JUMP,`JUMP -> (`JUMP, Ptset.Int.union c1 c2,Ptset.Int.union l1 l2)
552 let merge_jump_list = function
553 | [] -> `NIL,Ptset.Int.empty,Ptset.Int.empty
555 List.fold_left (merge_jump) p r
566 let _,_,_,_,bur = Transition.node f in
567 if bur then acc else TagSet.cup acc ts)
569 else acc ) a.trans TagSet.empty
572 let is_rec a s access =
574 (fun (_,t) -> let _,_,_,f,_ = Transition.node t in
575 StateSet.mem s ((fun (_,_,x) -> x) (access (Formula.st f)))) (Hashtbl.find a.trans s)
578 let decide a c_label l_label dir_states dir =
580 let l = StateSet.fold
582 let s_rec = is_rec a s (if dir then fst else snd) in
583 let s_rec = if dir then s_rec else
587 let s_lab = labels a s in
589 if (not (TagSet.is_finite s_lab)) then
590 if TagSet.mem Tag.pcdata s_lab then (`ANY,Ptset.Int.empty,Ptset.Int.empty)
591 else (`ANYNOTEXT,Ptset.Int.empty,Ptset.Int.empty)
594 then (`JUMP,Ptset.Int.empty, TagSet.positive
595 (TagSet.cap (TagSet.inj_positive l_label) s_lab))
596 else (`JUMP,TagSet.positive
597 (TagSet.cap (TagSet.inj_positive c_label) s_lab),
602 && Ptset.Int.is_empty cc
603 && Ptset.Int.is_empty ll
604 then (`NIL,Ptset.Int.empty,Ptset.Int.empty)
605 else (jmp,cc,ll))::l) dir_states []
613 let choose_jump (d,cl,ll) f_nil f_t1 f_s1 f_tn f_sn f_s1n f_notext f_maytext =
615 | `NIL -> (`NIL,f_nil)
616 | `ANYNOTEXT -> `ANY,f_notext
617 | `ANY -> `ANY,f_maytext
619 if Ptset.Int.is_empty cl then
620 if Ptset.Int.is_singleton ll then
621 let tag = Ptset.Int.choose ll in
622 (`TAG(tag),mk_app_fun f_tn tag (Tag.to_string tag))
624 (`MANY(ll),mk_app_fun f_sn ll (string_of_ts ll))
625 else if Ptset.Int.is_empty ll then
626 if Ptset.Int.is_singleton cl then
627 let tag = Ptset.Int.choose cl in
628 (`TAG(tag),mk_app_fun f_t1 tag (Tag.to_string tag))
630 (`MANY(cl),mk_app_fun f_s1 cl (string_of_ts cl))
632 (`ANY,mk_app_fun2 f_s1n cl ll ((string_of_ts cl) ^ " " ^ (string_of_ts ll)))
636 let choose_jump_down tree d =
638 (mk_fun (fun _ -> Tree.nil) "Tree.mk_nil")
639 (mk_fun (Tree.tagged_child tree) "Tree.tagged_child")
640 (mk_fun (Tree.select_child tree) "Tree.select_child")
641 (mk_fun (Tree.tagged_desc tree) "Tree.tagged_desc")
642 (mk_fun (Tree.select_desc tree) "Tree.select_desc")
643 (mk_fun (fun _ _ -> Tree.first_child tree) "[FIRSTCHILD]Tree.select_child_desc")
644 (mk_fun (Tree.first_element tree) "Tree.first_element")
645 (mk_fun (Tree.first_child tree) "Tree.first_child")
647 let choose_jump_next tree d =
649 (mk_fun (fun _ _ -> Tree.nil) "Tree.mk_nil2")
650 (mk_fun (Tree.tagged_sibling_ctx tree) "Tree.tagged_sibling_ctx")
651 (mk_fun (Tree.select_sibling_ctx tree) "Tree.select_sibling_ctx")
652 (mk_fun (Tree.tagged_foll_ctx tree) "Tree.tagged_foll_ctx")
653 (mk_fun (Tree.select_foll_ctx tree) "Tree.select_foll_ctx")
654 (mk_fun (fun _ _ -> Tree.next_sibling_ctx tree) "[NEXTSIBLING]Tree.select_sibling_foll_ctx")
655 (mk_fun (Tree.next_element_ctx tree) "Tree.next_element_ctx")
656 (mk_fun (Tree.next_sibling_ctx tree) "Tree.node_sibling_ctx")
659 module SListTable = Hashtbl.Make(struct type t = SList.t
661 let hash t = t.SList.Node.id
665 type 'a t = Obj.t array SListTable.t
666 let create n = SListTable.create n
667 let dummy = Obj.repr (fun _ -> assert false)
668 let find (h :'a t) tag slist : 'a =
671 SListTable.find h slist
674 SListTable.add h slist (Array.create 10000 dummy);
677 let res = tab.(tag) in
678 if res == dummy then raise Not_found else (Obj.magic res)
680 let add (h : 'a t) tag slist (data : 'a) =
683 SListTable.find h slist
686 let arr = Array.create 10000 dummy in
687 SListTable.add h slist arr;
690 tab.(tag) <- (Obj.repr data)
695 let td_trans = TransCache.create 10000 (* should be number of tags *number of states^2
699 let rec loop acc = function 0 -> acc
700 | n -> loop (SList.cons StateSet.empty acc) (n-1)
704 module Fold2ResOld = Hashtbl.Make(struct
705 type t = Formlistlist.t*SList.t*SList.t
706 let hash (f,s,t) = HASHINT3(f.Formlistlist.Node.id,
709 let equal (a,b,c) (d,e,f) = a==d && b == e && c == f
712 module FllTable = Hashtbl.Make (struct type t = Formlistlist.t
714 let hash t = t.Formlistlist.Node.id
719 type 'a t = 'a SListTable.t SListTable.t FllTable.t
720 let create n = Array.init 10000 (fun _ -> FllTable.create n)
722 let find h tag fl s1 s2 =
724 let hs1 = FllTable.find hf fl in
725 let hs2 = SListTable.find hs1 s1 in
726 SListTable.find hs2 s2
728 let add h tag fl s1 s2 data =
731 try FllTable.find hf fl with
733 let hs1 = SListTable.create SMALL_H_SIZE
734 in FllTable.add hf fl hs1;hs1
737 try SListTable.find hs1 s1
740 let hs2 = SListTable.create SMALL_H_SIZE
741 in SListTable.add hs1 s1 hs2;hs2
743 SListTable.add hs2 s2 data
746 let h_fold2 = Fold2Res.create SMALL_H_SIZE
748 let top_down ?(noright=false) a tree t slist ctx slot_size =
749 let pempty = empty_size slot_size in
750 let rempty = Array.make slot_size RS.empty in
751 (* evaluation starts from the right so we put sl1,res1 at the end *)
752 let eval_fold2_slist fll t tag (sl2,res2) (sl1,res1) =
753 let res = Array.copy rempty in
755 let r,b,btab = Fold2Res.find h_fold2 tag fll sl1 sl2 in
756 if b then for i=0 to slot_size - 1 do
757 res.(i) <- RS.merge btab.(i) t res1.(i) res2.(i);
762 let btab = Array.make slot_size (false,false,false,false) in
763 let rec fold l1 l2 fll i aq ab =
764 match fll.Formlistlist.Node.node,
768 | Formlistlist.Cons(fl,fll),
770 SList.Cons(s2,ll2) ->
771 let r',((b,_,_,_) as flags) = eval_formlist tag s1 s2 fl in
772 let _ = btab.(i) <- flags
774 fold ll1 ll2 fll (i+1) (SList.cons r' aq) (b||ab)
777 let r,b = fold sl1 sl2 fll 0 SList.nil false in
778 Fold2Res.add h_fold2 tag fll sl1 sl2 (r,b,btab);
779 if b then for i=0 to slot_size - 1 do
780 res.(i) <- RS.merge btab.(i) t res1.(i) res2.(i);
785 let null_result = (pempty,Array.copy rempty) in
786 let rec loop t slist ctx =
787 if t == Tree.nil then null_result else get_trans t slist (Tree.tag tree t) ctx
788 and loop_tag tag t slist ctx =
789 if t == Tree.nil then null_result else get_trans t slist tag ctx
790 and loop_no_right t slist ctx =
791 if t == Tree.nil then null_result else get_trans ~noright:true t slist (Tree.tag tree t) ctx
792 and get_trans ?(noright=false) t slist tag ctx =
795 TransCache.find td_trans tag slist
798 let fl_list,llist,rlist,ca,da,sa,fa =
800 (fun set (fll_acc,lllacc,rllacc,ca,da,sa,fa) -> (* For each set *)
801 let fl,ll,rr,ca,da,sa,fa =
805 (fun ((fl_acc,ll_acc,rl_acc,c_acc,d_acc,s_acc,f_acc) as acc)
807 if (TagSet.mem tag ts)
809 let _,_,_,f,_ = Transition.node t in
810 let (child,desc,below),(sibl,foll,after) = Formula.st f in
811 (Formlist.cons t fl_acc,
812 StateSet.union ll_acc below,
813 StateSet.union rl_acc after,
814 StateSet.union child c_acc,
815 StateSet.union desc d_acc,
816 StateSet.union sibl s_acc,
817 StateSet.union foll f_acc)
819 try Hashtbl.find a.trans q
821 Not_found -> Printf.eprintf "Looking for state %i, doesn't exist!!!\n%!"
825 ) set (Formlist.nil,StateSet.empty,StateSet.empty,ca,da,sa,fa)
826 in (Formlistlist.cons fl fll_acc), (SList.cons ll lllacc), (SList.cons rr rllacc),ca,da,sa,fa)
827 slist (Formlistlist.nil,SList.nil,SList.nil,StateSet.empty,StateSet.empty,StateSet.empty,StateSet.empty)
829 (* Logic to chose the first and next function *)
830 let tags_child,tags_below,tags_siblings,tags_after = Tree.tags tree tag in
831 let d_f = Algebra.decide a tags_child tags_below (StateSet.union ca da) true in
832 let d_n = Algebra.decide a tags_siblings tags_after (StateSet.union sa fa) false in
833 let f_kind,first = choose_jump_down tree d_f
834 and n_kind,next = if noright then (`NIL, fun _ _ -> Tree.nil )
835 else choose_jump_next tree d_n in
836 let empty_res = null_result in
838 match f_kind,n_kind with
840 (fun t _ -> eval_fold2_slist fl_list t (Tree.tag tree t) empty_res empty_res)
844 (fun t _ -> eval_fold2_slist fl_list t (Tree.tag tree t) empty_res
845 (loop_tag tag' (first t) llist t ))
847 (fun t _ -> eval_fold2_slist fl_list t (Tree.tag tree t) empty_res
848 (loop (first t) llist t ))
853 if SList.equal rlist slist && tag == tag' then
855 if t == Tree.nil then empty_res else
856 let res2 = loop (next t ctx) ctx in
857 eval_fold2_slist fl_list t tag res2 empty_res
860 (fun t ctx -> eval_fold2_slist fl_list t (Tree.tag tree t)
861 (loop_tag tag' (next t ctx) rlist ctx ) empty_res)
864 (fun t ctx -> eval_fold2_slist fl_list t (Tree.tag tree t)
865 (loop (next t ctx) rlist ctx ) empty_res)
869 | `TAG(tag1),`TAG(tag2) ->
871 eval_fold2_slist fl_list t (Tree.tag tree t)
872 (loop_tag tag2 (next t ctx) rlist ctx )
873 (loop_tag tag1 (first t) llist t ))
877 eval_fold2_slist fl_list t (Tree.tag tree t)
878 (loop (next t ctx) rlist ctx )
879 (loop_tag tag' (first t) llist t ))
883 eval_fold2_slist fl_list t (Tree.tag tree t)
884 (loop_tag tag' (next t ctx) rlist ctx )
885 (loop (first t) llist t ))
888 if SList.equal slist rlist && SList.equal slist llist
891 if t == Tree.nil then empty_res else
892 let r1 = loop (first t) t
893 and r2 = loop (next t ctx) ctx
895 eval_fold2_slist fl_list t (Tree.tag tree t) r2 r1
899 eval_fold2_slist fl_list t (Tree.tag tree t)
900 (loop (next t ctx) rlist ctx )
901 (loop (first t) llist t ))
904 eval_fold2_slist fl_list t (Tree.tag tree t)
905 (loop (next t ctx) rlist ctx )
906 (loop (first t) llist t ))
909 let cont = D_IF_( (fun t ctx ->
910 let a,b = cont t ctx in
911 register_trace tree t (slist,a,fl_list,first,next,ctx);
915 (TransCache.add td_trans tag slist (Obj.repr cont) ;cont)
916 in (Obj.magic cont) t ctx
919 (if noright then loop_no_right else loop) t slist ctx
921 let run_top_down a tree =
922 let init = SList.cons a.init SList.nil in
923 let _,res = top_down a tree Tree.root init Tree.root 1
926 output_trace a tree "trace.html"
927 (RS.fold (fun t a -> IntSet.add (Tree.id tree t) a) res.(0) IntSet.empty),
931 module Configuration =
933 module Ptss = Set.Make(StateSet)
934 module IMap = Map.Make(StateSet)
935 type t = { hash : int;
937 results : RS.t IMap.t }
938 let empty = { hash = 0;
940 results = IMap.empty;
942 let is_empty c = Ptss.is_empty c.sets
944 if Ptss.mem s c.sets then
945 { c with results = IMap.add s (RS.concat r (IMap.find s c.results)) c.results}
947 { hash = HASHINT2(c.hash,Ptset.Int.uid s);
948 sets = Ptss.add s c.sets;
949 results = IMap.add s r c.results
952 let pr fmt c = Format.fprintf fmt "{";
953 Ptss.iter (fun s -> StateSet.print fmt s;
954 Format.fprintf fmt " ") c.sets;
955 Format.fprintf fmt "}\n%!";
956 IMap.iter (fun k d ->
957 StateSet.print fmt k;
958 Format.fprintf fmt "-> %i\n" (RS.length d)) c.results;
959 Format.fprintf fmt "\n%!"
967 RS.concat r (IMap.find s acc)
969 | Not_found -> r) acc) c1.results IMap.empty
972 IMap.fold (fun s r acc ->
975 RS.concat r (IMap.find s acc)
977 | Not_found -> r) acc) c2.results acc1
981 (fun s (ah,ass) -> (HASHINT2(ah,Ptset.Int.uid s),
983 (Ptss.union c1.sets c2.sets) (0,Ptss.empty)
991 let h_fold = Hashtbl.create 511
993 let fold_f_conf tree t slist fl_list conf dir=
994 let tag = Tree.tag tree t in
995 let rec loop sl fl acc =
996 match SList.node sl,fl with
998 |SList.Cons(s,sll), formlist::fll ->
999 let r',(rb,rb1,rb2,mark) =
1000 let key = SList.hash sl,Formlist.hash formlist,dir in
1002 Hashtbl.find h_fold key
1004 Not_found -> let res =
1005 if dir then eval_formlist tag s Ptset.Int.empty formlist
1006 else eval_formlist tag Ptset.Int.empty s formlist
1007 in (Hashtbl.add h_fold key res;res)
1009 if rb && ((dir&&rb1)|| ((not dir) && rb2))
1013 try Configuration.IMap.find s conf.Configuration.results
1014 with Not_found -> RS.empty
1016 Configuration.add acc r' (if mark then RS.cons t old_r else old_r)
1019 else loop sll fll acc
1022 loop slist fl_list Configuration.empty
1024 let h_trans = Hashtbl.create 4096
1026 let get_up_trans slist ptag a tree =
1027 let key = (HASHINT2(SList.uid slist,ptag)) in
1029 Hashtbl.find h_trans key
1033 Hashtbl.fold (fun q l acc ->
1034 List.fold_left (fun fl_acc (ts,t) ->
1035 if TagSet.mem ptag ts then Formlist.cons t fl_acc
1039 a.trans Formlist.nil
1041 let res = SList.fold (fun _ acc -> f_list::acc) slist []
1043 (Hashtbl.add h_trans key res;res)
1047 let h_tdconf = Hashtbl.create 511
1048 let rec bottom_up a tree t conf next jump_fun root dotd init accu =
1049 if (not dotd) && (Configuration.is_empty conf ) then
1053 let below_right = Tree.is_below_right tree t next in
1055 let accu,rightconf,next_of_next =
1056 if below_right then (* jump to the next *)
1057 bottom_up a tree next conf (jump_fun next) jump_fun (Tree.next_sibling tree t) true init accu
1058 else accu,Configuration.empty,next
1062 if below_right then prepare_topdown a tree t true
1063 else prepare_topdown a tree t false
1067 (Configuration.merge rightconf sub, next_of_next)
1069 if t == root then accu,conf,next else
1070 let parent = Tree.binary_parent tree t in
1071 let ptag = Tree.tag tree parent in
1072 let dir = Tree.is_left tree t in
1073 let slist = Configuration.Ptss.fold (fun e a -> SList.cons e a) conf.Configuration.sets SList.nil in
1074 let fl_list = get_up_trans slist ptag a parent in
1075 let slist = SList.rev (slist) in
1076 let newconf = fold_f_conf tree parent slist fl_list conf dir in
1077 let accu,newconf = Configuration.IMap.fold (fun s res (ar,nc) ->
1078 if Ptset.Int.intersect s init then
1079 ( RS.concat res ar ,nc)
1080 else (ar,Configuration.add nc s res))
1081 (newconf.Configuration.results) (accu,Configuration.empty)
1084 bottom_up a tree parent newconf next jump_fun root false init accu
1086 and prepare_topdown a tree t noright =
1087 let tag = Tree.tag tree t in
1090 Hashtbl.find h_tdconf tag
1093 let res = Hashtbl.fold (fun q l acc ->
1094 if List.exists (fun (ts,_) -> TagSet.mem tag ts) l
1095 then Ptset.Int.add q acc
1096 else acc) a.trans Ptset.Int.empty
1097 in Hashtbl.add h_tdconf tag res;res
1099 (* let _ = pr ", among ";
1100 StateSet.print fmt (Ptset.Int.elements r);
1103 let r = SList.cons r SList.nil in
1104 let set,res = top_down (~noright:noright) a tree t r t 1 in
1105 let set = match SList.node set with
1106 | SList.Cons(x,_) ->x
1109 Configuration.add Configuration.empty set res.(0)
1113 let run_bottom_up a tree k =
1114 let t = Tree.root in
1115 let trlist = Hashtbl.find a.trans (StateSet.choose a.init)
1117 let init = List.fold_left
1119 let _,_,_,f,_ = Transition.node t in
1120 let _,_,l = fst ( Formula.st f ) in
1121 StateSet.union acc l)
1122 StateSet.empty trlist
1124 let tree1,jump_fun =
1127 (*Tree.tagged_lowest t tag, fun tree -> Tree.tagged_next tree tag*)
1128 (Tree.tagged_desc tree tag t, let jump = Tree.tagged_foll_ctx tree tag
1129 in fun n -> jump n t )
1130 | `CONTAINS(_) -> (Tree.text_below tree t,let jump = Tree.text_next tree
1131 in fun n -> jump n t)
1134 let tree2 = jump_fun tree1 in
1135 let rec loop t next acc =
1136 let acc,conf,next_of_next = bottom_up a tree t
1137 Configuration.empty next jump_fun (Tree.root) true init acc
1139 let acc = Configuration.IMap.fold
1140 ( fun s res acc -> if StateSet.intersect init s
1141 then RS.concat res acc else acc) conf.Configuration.results acc
1143 if Tree.is_nil next_of_next (*|| Tree.equal next next_of_next *)then
1145 else loop next_of_next (jump_fun next_of_next) acc
1147 loop tree1 tree2 RS.empty
1152 let top_down_count a t = let module RI = Run(Integer) in Integer.length (RI.run_top_down a t)
1153 let top_down a t = let module RI = Run(IdSet) in (RI.run_top_down a t)
1154 let bottom_up_count a t k = let module RI = Run(Integer) in Integer.length (RI.run_bottom_up a t k)