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
16 let make = let id = ref ~-1 in
17 fun () -> incr id; !id
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,Uid.to_int f1.Node.id, Uid.to_int f2.Node.id)
62 | And (f1,f2) -> HASHINT3(PRIME3,Uid.to_int f1.Node.id, Uid.to_int 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,Uid.to_int (TagSet.uid ts),
201 Uid.to_int (Formula.uid f),
203 let equal (s,ts,b,f,m) (s',ts',b',f',m') =
204 s == s' && ts == ts' && b==b' && m==m' && f == f'
207 let print ppf f = let (st,ts,mark,form,b) = node f in
208 Format.fprintf ppf "(%i, " st;
210 Format.fprintf ppf ") %s" (if mark then "⇒" else "→");
211 Formula.print ppf form;
212 Format.fprintf ppf "%s%!" (if b then " (b)" else "")
215 module Infix = struct
217 let ( >< ) state (l,mark) = state,(l,mark,false)
218 let ( ><@ ) state (l,mark) = state,(l,mark,true)
219 let ( >=> ) (state,(label,mark,bur)) form = (state,label,(make (state,label,mark,form,bur)))
224 module TransTable = Hashtbl
226 module Formlist = struct
227 include Hlist.Make(Transition)
229 iter (fun t -> Transition.print ppf t; Format.pp_print_newline ppf ()) fl
232 module Formlistlist =
234 include Hlist.Make(Formlist)
236 iter (fun fl -> Formlist.print ppf fl; Format.pp_print_newline ppf ())fll
241 mutable states : Ptset.Int.t;
243 starstate : Ptset.Int.t option;
244 (* Transitions of the Alternating automaton *)
245 trans : (State.t,(TagSet.t*Transition.t) list) Hashtbl.t;
246 query_string: string;
251 Format.fprintf ppf "Automaton (%i) :\n" a.id;
252 Format.fprintf ppf "States : "; StateSet.print ppf a.states;
253 Format.fprintf ppf "\nInitial states : "; StateSet.print ppf a.init;
254 Format.fprintf ppf "\nAlternating transitions :\n";
255 let l = Hashtbl.fold (fun k t acc ->
256 (List.map (fun (ts,tr) -> (ts,k),Transition.node tr) t) @ acc) a.trans [] in
257 let l = List.sort (fun ((tsx,x),_) ((tsy,y),_) ->
258 if y-x == 0 then TagSet.compare tsy tsx else y-x) l in
259 let maxh,maxt,l_print =
261 fun (maxh,maxt,l) ((ts,q),(_,_,b,f,_)) ->
263 if TagSet.is_finite ts
264 then "{" ^ (TagSet.fold (fun t a -> a ^ " '" ^ (Tag.to_string t)^"'") ts "") ^" }"
265 else let cts = TagSet.neg ts in
266 if TagSet.is_empty cts then "*" else
267 (TagSet.fold (fun t a -> a ^ " " ^ (Tag.to_string t)) cts "*\\{"
270 let s = Printf.sprintf "(%s,%i)" s q in
272 Formula.print Format.str_formatter f;
273 Format.flush_str_formatter()
275 (max (String.length s) maxh, max (String.length s_frm) maxt,
276 (s,(if b then "⇒" else "→"),s_frm)::l)) (0,0,[]) l
278 Format.fprintf ppf "%s\n%!" (String.make (maxt+maxh+3) '_');
279 List.iter (fun (s,m,f) -> let s = s ^ (String.make (maxh-(String.length s)) ' ') in
280 Format.fprintf ppf "%s %s %s\n" s m f) l_print;
281 Format.fprintf ppf "%s\n%!" (String.make (maxt+maxh+3) '_')
284 module FormTable = Hashtbl.Make(struct
285 type t = Formula.t*StateSet.t*StateSet.t
286 let equal (f1,s1,t1) (f2,s2,t2) =
287 f1 == f2 && s1 == s2 && t1 == t2
289 HASHINT3(Uid.to_int (Formula.uid f),
290 Uid.to_int (StateSet.uid s),
291 Uid.to_int (StateSet.uid t))
296 let h_f = FormTable.create BIG_H_SIZE in
300 | F.True -> true,true,true
301 | F.False -> false,false,false
302 | F.Atom((`Left|`LLeft),b,q) ->
303 if b == (StateSet.mem q s1)
304 then (true,true,false)
305 else false,false,false
307 if b == (StateSet.mem q s2)
308 then (true,false,true)
309 else false,false,false
311 try FormTable.find h_f (f,s1,s2)
312 with Not_found -> let r =
315 let b1,rl1,rr1 = loop f1
317 if b1 && rl1 && rr1 then (true,true,true) else
318 let b2,rl2,rr2 = loop f2 in
319 let rl1,rr1 = if b1 then rl1,rr1 else false,false
320 and rl2,rr2 = if b2 then rl2,rr2 else false,false
321 in (b1 || b2, rl1||rl2,rr1||rr2)
324 let b1,rl1,rr1 = loop f1 in
325 if b1 && rl1 && rr1 then (true,true,true) else
327 let b2,rl2,rr2 = loop f2 in
328 if b2 then (true,rl1||rl2,rr1||rr2) else (false,false,false)
329 else (false,false,false)
331 in FormTable.add h_f (f,s1,s2) r;r
335 module FTable = Hashtbl.Make(struct
336 type t = Tag.t*Formlist.t*StateSet.t*StateSet.t
337 let equal (tg1,f1,s1,t1) (tg2,f2,s2,t2) =
338 tg1 == tg2 && f1 == f2 && s1 == s2 && t1 == t2;;
339 let hash (tg,f,s,t) =
340 HASHINT4(tg, Uid.to_int (Formlist.uid f),
341 Uid.to_int (StateSet.uid s),
342 Uid.to_int (StateSet.uid t))
346 let h_f = FTable.create BIG_H_SIZE
347 type merge_conf = NO | ONLY1 | ONLY2 | ONLY12 | MARK | MARK1 | MARK2 | MARK12
348 (* 000 001 010 011 100 101 110 111 *)
349 let eval_formlist tag s1 s2 fl =
352 FTable.find h_f (tag,fl,s1,s2)
355 match Formlist.node fl with
356 | Formlist.Cons(f,fll) ->
357 let q,ts,mark,f,_ = Transition.node f in
359 if TagSet.mem tag ts then eval_form_bool f s1 s2 else (false,false,false)
361 let (s,(b',b1',b2',amark)) as res = loop fll in
362 let r = if b then (StateSet.add q s, (b, b1'||b1,b2'||b2,mark||amark))
364 in FTable.add h_f (tag,fl,s1,s2) r;r
365 | Formlist.Nil -> StateSet.empty,(false,false,false,false)
370 | (false,_,_,_) -> NO
371 | (_,false,false,false) -> NO
372 | (_,true,false,false) -> ONLY1
373 | (_,false,true,false) -> ONLY2
374 | (_,true,true,false) -> ONLY12
375 | (_,false,false,true) -> MARK
376 | (_,true,false,true) -> MARK1
377 | (_,false,true,true) -> MARK2
380 let bool_of_merge conf =
382 | NO -> false,false,false,false
383 | ONLY1 -> true,true,false,false
384 | ONLY2 -> true,false,true,false
385 | ONLY12 -> true,true,true,false
386 | MARK -> true,false,false,true
387 | MARK1 -> true,true,false,true
388 | MARK2 -> true,false,true,true
389 | MARK12 -> true,true,true,true
392 let tags_of_state a q =
395 if p == q then List.fold_left
397 let _,_,_,_,aux = Transition.node t in
399 TagSet.cup ts acc) acc l
401 else acc) a.trans TagSet.empty
406 let ts = Ptset.Int.fold (fun q acc -> TagSet.cup acc (tags_of_state a q)) qs TagSet.empty
408 if TagSet.is_finite ts
409 then `Positive(TagSet.positive ts)
410 else `Negative(TagSet.negative ts)
414 | `Positive s -> let r = Ptset.Int.inter a s in (r,Ptset.Int.mem Tag.pcdata r, true)
415 | `Negative s -> let r = Ptset.Int.diff a s in (r, Ptset.Int.mem Tag.pcdata r, false)
418 module type ResultSet =
421 type elt = [` Tree ] Tree.node
423 val cons : elt -> t -> t
424 val concat : t -> t -> t
425 val iter : ( elt -> unit) -> t -> unit
426 val fold : ( elt -> 'a -> 'a) -> t -> 'a -> 'a
427 val map : ( elt -> elt) -> t -> t
428 val length : t -> int
429 val merge : merge_conf -> elt -> t -> t -> t
430 val mk_quick_tag_loop : (elt -> elt -> 'a*t array) -> 'a -> int -> Tree.t -> Tag.t -> (elt -> elt -> 'a*t array)
431 val mk_quick_star_loop : (elt -> elt -> 'a*t array) -> 'a -> int -> Tree.t -> (elt -> elt -> 'a*t array)
434 module Integer : ResultSet =
437 type elt = [`Tree] Tree.node
441 let concat x y = x + y
442 let iter _ _ = failwith "iter not implemented"
443 let fold _ _ _ = failwith "fold not implemented"
444 let map _ _ = failwith "map not implemented"
446 let merge2 conf t res1 res2 =
447 let rb,rb1,rb2,mark = conf in
449 let res1 = if rb1 then res1 else 0
450 and res2 = if rb2 then res2 else 0
452 if mark then 1+res1+res2
455 let merge conf t res1 res2 =
460 | ONLY12 -> res1+res2
464 | MARK12 -> res1+res2+1
466 let mk_quick_tag_loop _ sl ss tree tag = ();
468 (sl, Array.make ss (Tree.subtree_tags tree tag t))
469 let mk_quick_star_loop _ sl ss tree = ();
471 (sl, Array.make ss (Tree.subtree_elements tree t))
475 module IdSet : ResultSet=
477 type elt = [`Tree] Tree.node
480 | Concat of node*node
482 and t = { node : node;
485 let empty = { node = Nil; length = 0 }
487 let cons e t = { node = Cons(e,t.node); length = t.length+1 }
488 let concat t1 t2 = { node = Concat(t1.node,t2.node); length = t1.length+t2.length }
489 let append e t = { node = Concat(t.node,Cons(e,Nil)); length = t.length+1 }
492 let rec loop acc t = match t with
494 | Cons (e,t) -> loop (f e acc) t
495 | Concat (t1,t2) -> loop (loop acc t1) t2
499 let length l = l.length
503 let rec loop = function
505 | Cons (e,t) -> f e; loop t
506 | Concat(t1,t2) -> loop t1;loop t2
510 let rec loop = function
512 | Cons(e,t) -> Cons(f e, loop t)
513 | Concat(t1,t2) -> Concat(loop t1,loop t2)
515 { l with node = loop l.node }
517 let merge conf t res1 res2 =
520 | MARK -> cons t empty
523 | ONLY12 -> { node = (Concat(res1.node,res2.node));
524 length = res1.length + res2.length ;}
525 | MARK12 -> { node = Cons(t,(Concat(res1.node,res2.node)));
526 length = res1.length + res2.length + 1;}
527 | MARK1 -> { node = Cons(t,res1.node);
528 length = res1.length + 1;}
529 | MARK2 -> { node = Cons(t,res2.node);
530 length = res2.length + 1;}
532 let mk_quick_tag_loop f _ _ _ _ = f
533 let mk_quick_star_loop f _ _ _ = f
535 module GResult(Doc : sig val doc : Tree.t end) = struct
537 type elt = [` Tree] Tree.node
538 external create_empty : int -> bits = "caml_result_set_create" "noalloc"
539 external set : bits -> int -> unit = "caml_result_set_set" "noalloc"
540 external next : bits -> int -> int = "caml_result_set_next" "noalloc"
541 external count : bits -> int = "caml_result_set_count" "noalloc"
542 external clear : bits -> elt -> elt -> unit = "caml_result_set_clear" "noalloc"
544 external set_tag_bits : bits -> Tag.t -> Tree.t -> elt -> elt = "caml_set_tag_bits" "noalloc"
546 { segments : elt list;
551 let size = (Tree.subtree_size Doc.doc Tree.root) in
552 create_empty (size*2+1)
554 let empty = { segments = [];
558 let rec loop l = match l with
559 | [] -> { bits = (set t.bits (Obj.magic e);t.bits);
562 if Tree.is_binary_ancestor Doc.doc e p then
565 { bits = (set t.bits (Obj.magic e);t.bits);
571 if t2.segments == [] then t1
573 if t1.segments == [] then t2
575 let h2 = List.hd t2.segments in
576 let rec loop l = match l with
579 if Tree.is_binary_ancestor Doc.doc p h2 then
585 segments = loop t1.segments
591 else (f ((Obj.magic i):elt);loop (next t.bits i))
592 in loop (next t.bits 0)
597 else loop (next t.bits i) (f ((Obj.magic i):elt) acc)
598 in loop (next t.bits 0) acc
600 let map _ _ = failwith "noop"
601 (*let length t = let cpt = ref 0 in
602 iter (fun _ -> incr cpt) t; !cpt *)
603 let length t = count t.bits
606 let rec loop l = match l with
609 clear t.bits idx (Tree.closing Doc.doc idx); loop ll
611 loop t.segments;empty
613 let merge (rb,rb1,rb2,mark) elt t1 t2 =
615 (* let _ = Printf.eprintf "Lenght before merging is %i %i\n"
616 (List.length t1.segments) (List.length t2.segments)
618 match t1.segments,t2.segments with
619 [],[] -> if mark then cons elt empty else empty
620 | [_],[] when rb1 -> if mark then cons elt t1 else t1
621 | [], [_] when rb2 -> if mark then cons elt t2 else t2
622 | [_],[_] when rb1 && rb2 -> if mark then cons elt empty else
625 let t1 = if rb1 then t1 else clear_bits t1
626 and t2 = if rb2 then t2 else clear_bits t2
628 (if mark then cons elt (concat t1 t2)
631 let _ = clear_bits t1 in
634 let merge conf t t1 t2 =
635 match t1.segments,t2.segments,conf with
636 | _,_,NO -> let _ = clear_bits t1 in clear_bits t2
637 | [],[],(MARK1|MARK2|MARK12|MARK) -> cons t empty
639 | [_],[],(ONLY1|ONLY12) -> t1
640 | [_],[],(MARK1|MARK12) -> cons t t1
641 | [],[_],(ONLY2|ONLY12) -> t2
642 | [],[_],(MARK2|MARK12) -> cons t t2
643 | [_],[_],ONLY12 -> concat t1 t2
644 | [_],[_],MARK12 -> cons t empty
645 | _,_,MARK -> let _ = clear_bits t2 in cons t (clear_bits t1)
646 | _,_,ONLY1 -> let _ = clear_bits t2 in t1
647 | _,_,ONLY2 -> let _ = clear_bits t1 in t2
648 | _,_,ONLY12 -> concat t1 t2
649 | _,_,MARK1 -> let _ = clear_bits t2 in cons t t1
650 | _,_,MARK2 -> let _ = clear_bits t1 in cons t t2
651 | _,_,MARK12 -> cons t (concat t1 t2)
653 let mk_quick_tag_loop _ sl ss tree tag = ();
656 let first = set_tag_bits empty.bits tag tree t in
658 if first == Tree.nil then res else
661 (sl, Array.make ss res)
663 let mk_quick_star_loop f _ _ _ = f
665 module Run (RS : ResultSet) =
668 module SList = struct
669 include Hlist.Make (StateSet)
671 Format.fprintf ppf "[ ";
673 match l.Node.node with
676 StateSet.print ppf s;
677 iter (fun s -> Format.fprintf ppf "; ";
678 StateSet.print ppf s) ll
680 Format.fprintf ppf "]%!"
688 module IntSet = Set.Make(struct type t = int let compare = (-) end)
689 INCLUDE "html_trace.ml"
692 let mk_fun f s = D_IGNORE_(register_funname f s,f)
693 let mk_app_fun f arg s = let g = f arg in
694 D_IGNORE_(register_funname g ((get_funname f) ^ " " ^ s), g)
695 let mk_app_fun f arg _ = f arg
696 let mk_app_fun2 f arg1 arg2 s = let g = f arg1 arg2 in
697 D_IGNORE_(register_funname g ((get_funname f) ^ " " ^ s), g)
698 (* let mk_app_fun2 f arg1 arg2 s = Printf.eprintf "Building f2 %s\n%!" s; f arg1 arg2 *)
700 let string_of_ts tags = (Ptset.Int.fold (fun t a -> a ^ " " ^ (Tag.to_string t) ) tags "{")^ " }"
705 type jump = [ `NIL | `ANY |`ANYNOTEXT | `JUMP ]
706 type t = jump*Ptset.Int.t*Ptset.Int.t
711 | `ANYNOTEXT -> "ANYNOTEXT"
712 let merge_jump (j1,c1,l1) (j2,c2,l2) =
714 | _,`NIL -> (j1,c1,l1)
715 | `NIL,_ -> (j2,c2,l2)
716 | `ANY,_ -> (`ANY,Ptset.Int.empty,Ptset.Int.empty)
717 | _,`ANY -> (`ANY,Ptset.Int.empty,Ptset.Int.empty)
719 if Ptset.Int.mem Tag.pcdata (Ptset.Int.union c2 l2) then
720 (`ANY,Ptset.Int.empty,Ptset.Int.empty)
722 (`ANYNOTEXT,Ptset.Int.empty,Ptset.Int.empty)
724 if Ptset.Int.mem Tag.pcdata (Ptset.Int.union c1 l1) then
725 (`ANY,Ptset.Int.empty,Ptset.Int.empty)
727 (`ANYNOTEXT,Ptset.Int.empty,Ptset.Int.empty)
728 | `JUMP,`JUMP -> (`JUMP, Ptset.Int.union c1 c2,Ptset.Int.union l1 l2)
730 let merge_jump_list = function
731 | [] -> `NIL,Ptset.Int.empty,Ptset.Int.empty
733 List.fold_left (merge_jump) p r
744 let _,_,_,_,bur = Transition.node f in
745 if bur then acc else TagSet.cup acc ts)
747 else acc ) a.trans TagSet.empty
750 let is_rec a s access =
752 (fun (_,t) -> let _,_,_,f,_ = Transition.node t in
753 StateSet.mem s ((fun (_,_,x) -> x) (access (Formula.st f)))) (Hashtbl.find a.trans s)
755 let is_final_marking a s =
756 List.exists (fun (_,t) -> let _,_,m,f,_ = Transition.node t in m&& (Formula.is_true f))
757 (Hashtbl.find a.trans s)
760 let decide a c_label l_label dir_states dir =
762 let l = StateSet.fold
764 let s_rec = is_rec a s (if dir then fst else snd) in
765 let s_rec = if dir then s_rec else
769 let s_lab = labels a s in
771 if (not (TagSet.is_finite s_lab)) then
772 if TagSet.mem Tag.pcdata s_lab then (`ANY,Ptset.Int.empty,Ptset.Int.empty)
773 else (`ANYNOTEXT,Ptset.Int.empty,Ptset.Int.empty)
776 then (`JUMP,Ptset.Int.empty, TagSet.positive
777 (TagSet.cap (TagSet.inj_positive l_label) s_lab))
778 else (`JUMP,TagSet.positive
779 (TagSet.cap (TagSet.inj_positive c_label) s_lab),
784 && Ptset.Int.is_empty cc
785 && Ptset.Int.is_empty ll
786 then (`NIL,Ptset.Int.empty,Ptset.Int.empty)
787 else (jmp,cc,ll))::l) dir_states []
795 let choose_jump (d,cl,ll) f_nil f_t1 f_s1 f_tn f_sn f_s1n f_notext f_maytext =
797 | `NIL -> (`NIL,f_nil)
798 | `ANYNOTEXT -> `ANY,f_notext
799 | `ANY -> `ANY,f_maytext
801 if Ptset.Int.is_empty cl then
802 if Ptset.Int.is_singleton ll then
803 let tag = Ptset.Int.choose ll in
804 (`TAG(tag),mk_app_fun f_tn tag (Tag.to_string tag))
806 (`MANY(ll),mk_app_fun f_sn ll (string_of_ts ll))
807 else if Ptset.Int.is_empty ll then
808 if Ptset.Int.is_singleton cl then
809 let tag = Ptset.Int.choose cl in
810 (`TAG(tag),mk_app_fun f_t1 tag (Tag.to_string tag))
812 (`MANY(cl),mk_app_fun f_s1 cl (string_of_ts cl))
814 (`ANY,mk_app_fun2 f_s1n cl ll ((string_of_ts cl) ^ " " ^ (string_of_ts ll)))
818 let choose_jump_down tree d =
820 (mk_fun (fun _ -> Tree.nil) "Tree.mk_nil")
821 (mk_fun (Tree.tagged_child tree) "Tree.tagged_child")
822 (mk_fun (Tree.select_child tree) "Tree.select_child")
823 (mk_fun (Tree.tagged_descendant tree) "Tree.tagged_desc")
824 (mk_fun (Tree.select_descendant tree) "Tree.select_desc")
825 (mk_fun (fun _ _ -> Tree.first_child tree) "[FIRSTCHILD]Tree.select_child_desc")
826 (mk_fun (Tree.first_element tree) "Tree.first_element")
827 (mk_fun (Tree.first_child tree) "Tree.first_child")
829 let choose_jump_next tree d =
831 (mk_fun (fun _ _ -> Tree.nil) "Tree.mk_nil2")
832 (mk_fun (Tree.tagged_following_sibling_below tree) "Tree.tagged_sibling_ctx")
833 (mk_fun (Tree.select_following_sibling_below tree) "Tree.select_sibling_ctx")
834 (mk_fun (Tree.tagged_following_below tree) "Tree.tagged_foll_ctx")
835 (mk_fun (Tree.select_following_below tree) "Tree.select_foll_ctx")
836 (mk_fun (fun _ _ -> Tree.next_sibling_below tree) "[NEXTSIBLING]Tree.select_sibling_foll_ctx")
837 (mk_fun (Tree.next_element_below tree) "Tree.next_element_ctx")
838 (mk_fun (Tree.next_sibling_below tree) "Tree.node_sibling_ctx")
845 let get = Array.unsafe_get
848 type fun_tree = [`Tree] Tree.node -> [`Tree] Tree.node -> SList.t -> Tag.t -> bool -> SList.t*RS.t array
849 type t = fun_tree array array
851 let dummy = fun _ _ _ _ _ -> failwith "Uninitializd CodeCache"
852 let default_line = Array.create 256 dummy (* 256 = max_tag *)
853 let create n = Array.create n default_line
855 for i = 0 to (Array.length default_line) - 1
857 default_line.(i) <- f
860 let get_fun h slist tag =
861 get (get h (Uid.to_int slist.SList.Node.id)) tag
863 let set_fun (h : t) slist tag (data : fun_tree) =
864 let tab = get h (Uid.to_int slist.SList.Node.id) in
865 let line = if tab == default_line then
866 let x = Array.copy tab in
867 (set h (Uid.to_int slist.SList.Node.id) x;x)
874 let td_trans = CodeCache.create 10000 (* should be number of tags *number of states^2
878 let rec loop acc = function 0 -> acc
879 | n -> loop (SList.cons StateSet.empty acc) (n-1)
883 module Fold2Res = struct
884 let get = Array.unsafe_get
886 external field1 : Obj.t -> int = "%field1"
887 type t = Obj.t array array array array
888 let dummy_val = Obj.repr ((),2,())
890 let default_line3 = Array.create 10000 dummy_val
891 let default_line2 = Array.create 10000 default_line3
892 let default_line1 = Array.create 10000 default_line2
894 let create n = Array.create n default_line1
896 let find h tag fl s1 s2 : SList.t*bool*(merge_conf array) =
897 let l1 = get h tag in
898 let l2 = get l1 (Uid.to_int fl.Formlistlist.Node.id) in
899 let l3 = get l2 (Uid.to_int s1.SList.Node.id) in
900 Obj.magic (get l3 (Uid.to_int s2.SList.Node.id))
902 let is_valid b = (Obj.magic b) != 2
903 let get_replace tab idx default =
904 let e = get tab idx in
906 let ne = Array.copy e in (set tab idx ne;ne)
909 let add h tag fl s1 s2 (data: SList.t*bool*(merge_conf array)) =
910 let l1 = get_replace h tag default_line1 in
911 let l2 = get_replace l1 (Uid.to_int fl.Formlistlist.Node.id) default_line2 in
912 let l3 = get_replace l2 (Uid.to_int s1.SList.Node.id) default_line3 in
913 set l3 (Uid.to_int s2.SList.Node.id) (Obj.repr data)
917 let h_fold2 = Fold2Res.create 256
919 let top_down ?(noright=false) a tree t slist ctx slot_size =
920 let pempty = empty_size slot_size in
921 let rempty = Array.make slot_size RS.empty in
922 (* evaluation starts from the right so we put sl1,res1 at the end *)
923 let eval_fold2_slist fll t tag (sl2,res2) (sl1,res1) =
924 let res = Array.copy rempty in
925 let r,b,btab = Fold2Res.find h_fold2 tag fll sl1 sl2 in
926 if Fold2Res.is_valid b then
928 if b then for i=0 to slot_size - 1 do
929 res.(0) <- RS.merge btab.(0) t res1.(0) res2.(0);
935 let btab = Array.make slot_size NO in
936 let rec fold l1 l2 fll i aq ab =
937 match fll.Formlistlist.Node.node,
941 | Formlistlist.Cons(fl,fll),
943 SList.Cons(s2,ll2) ->
944 let r',conf = eval_formlist tag s1 s2 fl in
945 let _ = btab.(i) <- conf
947 fold ll1 ll2 fll (i+1) (SList.cons r' aq) ((conf!=NO)||ab)
950 let r,b = fold sl1 sl2 fll 0 SList.nil false in
951 Fold2Res.add h_fold2 tag fll sl1 sl2 (r,b,btab);
952 if b then for i=0 to slot_size - 1 do
953 res.(i) <- RS.merge btab.(i) t res1.(i) res2.(i);
959 let null_result = (pempty,Array.copy rempty) in
960 let empty_res = null_result in
962 let rec loop t ctx slist _ =
963 if t == Tree.nil then null_result else
964 let tag = Tree.tag tree t in
965 (CodeCache.get_fun td_trans slist tag) t ctx slist tag false
966 (* get_trans t ctx slist tag false
967 (CodeCache.get_opcode td_trans slist tag)
969 and loop_tag t ctx slist tag =
970 if t == Tree.nil then null_result else
971 (CodeCache.get_fun td_trans slist tag) t ctx slist tag false
972 (* get_trans t ctx slist tag false
973 (CodeCache.get_opcode td_trans slist tag) *)
975 and loop_no_right t ctx slist _ =
976 if t == Tree.nil then null_result else
977 let tag = Tree.tag tree t in
978 (CodeCache.get_fun td_trans slist tag) t ctx slist tag true
979 (* get_trans t ctx slist tag true
980 (CodeCache.get_opcode td_trans slist tag) *)
982 and get_trans t ctx slist tag noright opcode =
985 eval_fold2_slist fll t tag empty_res empty_res
987 | OpCode.K1 (fll,first,llist,tag1) ->
988 eval_fold2_slist fll t tag empty_res
989 (loop_tag (first t) t llist tag1)
991 | OpCode.K2 (fll,first,llist) ->
992 eval_fold2_slist fll t tag empty_res
993 (loop (first t) t llist)
995 | OpCode.K3 (fll,next,rlist,tag2) ->
996 eval_fold2_slist fll t tag
997 (loop_tag (next t ctx) ctx rlist tag2)
999 | OpCode.K4 (fll,next,rlist) ->
1000 eval_fold2_slist fll t tag
1001 (loop (next t ctx) ctx rlist)
1004 | OpCode.K5 (fll,next,rlist,tag2,first,llist,tag1) ->
1005 eval_fold2_slist fll t tag
1006 (loop_tag (next t ctx) ctx rlist tag2)
1007 (loop_tag (first t) t llist tag1)
1009 | OpCode.K6 (fll,next,rlist,first,llist,tag1) ->
1010 eval_fold2_slist fll t tag
1011 (loop (next t ctx) ctx rlist)
1012 (loop_tag (first t) t llist tag1)
1014 | OpCode.K7 (fll,next,rlist,tag2,first,llist) ->
1015 eval_fold2_slist fll t tag
1016 (loop_tag (next t ctx) ctx rlist tag2)
1017 (loop (first t) t llist)
1019 | OpCode.K8 (fll,next,rlist,first,llist) ->
1020 eval_fold2_slist fll t tag
1021 (loop (next t ctx) ctx rlist)
1022 (loop (first t) t llist)
1024 | OpCode.KDefault _ ->
1025 mk_trans t ctx tag slist noright
1027 and mk_trans t ctx slist tag noright =
1028 let fl_list,llist,rlist,ca,da,sa,fa =
1030 (fun set (fll_acc,lllacc,rllacc,ca,da,sa,fa) -> (* For each set *)
1031 let fl,ll,rr,ca,da,sa,fa =
1035 (fun ((fl_acc,ll_acc,rl_acc,c_acc,d_acc,s_acc,f_acc) as acc)
1037 if (TagSet.mem tag ts)
1039 let _,_,_,f,_ = t.Transition.node in
1040 let (child,desc,below),(sibl,foll,after) = Formula.st f in
1041 (Formlist.cons t fl_acc,
1042 StateSet.union ll_acc below,
1043 StateSet.union rl_acc after,
1044 StateSet.union child c_acc,
1045 StateSet.union desc d_acc,
1046 StateSet.union sibl s_acc,
1047 StateSet.union foll f_acc)
1049 try Hashtbl.find a.trans q
1051 Not_found -> Printf.eprintf "Looking for state %i, doesn't exist!!!\n%!"
1055 ) set (Formlist.nil,StateSet.empty,StateSet.empty,ca,da,sa,fa)
1056 in (Formlistlist.cons fl fll_acc), (SList.cons ll lllacc), (SList.cons rr rllacc),ca,da,sa,fa)
1057 slist (Formlistlist.nil,SList.nil,SList.nil,StateSet.empty,StateSet.empty,StateSet.empty,StateSet.empty)
1059 (* Logic to chose the first and next function *)
1060 let tags_child,tags_below,tags_siblings,tags_after = Tree.tags tree tag in
1061 let d_f = Algebra.decide a tags_child tags_below (StateSet.union ca da) true in
1062 let d_n = Algebra.decide a tags_siblings tags_after (StateSet.union sa fa) false in
1063 let f_kind,first = choose_jump_down tree d_f
1064 and n_kind,next = if noright then (`NIL, fun _ _ -> Tree.nil )
1065 else choose_jump_next tree d_n in
1066 let empty_res = null_result in
1067 let fll = fl_list in
1069 match f_kind,n_kind with
1070 | `NIL,`NIL -> (*OpCode.K0(fl_list) *)
1071 fun t _ _ tag _ -> eval_fold2_slist fll t tag empty_res empty_res
1075 |`TAG(tag1) -> (*OpCode.K1(fl_list,first,llist,tag1) *)
1076 fun t _ _ tag _ -> eval_fold2_slist fll t tag empty_res
1077 (loop_tag (first t) t llist tag1)
1078 | _ -> (* OpCode.K2(fl_list,first,llist) *)
1079 fun t _ _ tag _ -> eval_fold2_slist fll t tag empty_res
1080 (loop (first t) t llist tag)
1084 |`TAG(tag2) -> (*OpCode.K3(fl_list,next,rlist,tag2) *)
1085 fun t ctx _ tag _ ->
1086 eval_fold2_slist fll t tag
1087 (loop_tag (next t ctx) ctx rlist tag2)
1090 | _ -> (*OpCode.K4(fl_list,next,rlist) *)
1091 fun t ctx _ tag _ ->
1092 eval_fold2_slist fll t tag
1093 (loop (next t ctx) ctx rlist tag)
1098 | `TAG(tag1),`TAG(tag2) -> (*OpCode.K5(fl_list,next,rlist,tag2,first,llist,tag1) *)
1099 fun t ctx _ tag _ ->
1100 eval_fold2_slist fll t tag
1101 (loop_tag (next t ctx) ctx rlist tag2)
1102 (loop_tag (first t) t llist tag1)
1104 | `TAG(tag1),`ANY -> (* OpCode.K6(fl_list,next,rlist,first,llist,tag1) *)
1105 fun t ctx _ tag _ ->
1106 eval_fold2_slist fll t tag
1107 (loop (next t ctx) ctx rlist tag)
1108 (loop_tag (first t) t llist tag1)
1110 | `ANY,`TAG(tag2) -> (* OpCode.K7(fl_list,next,rlist,tag2,first,llist) *)
1111 fun t ctx _ tag _ ->
1112 eval_fold2_slist fll t tag
1113 (loop_tag (next t ctx) ctx rlist tag2)
1114 (loop (first t) t llist tag)
1117 | _,_ -> (*OpCode.K8(fl_list,next,rlist,first,llist) *)
1118 (*if SList.equal slist rlist && SList.equal slist llist
1120 let rec loop t ctx =
1121 if t == Tree.nil then empty_res else
1122 let r1 = loop (first t) t
1123 and r2 = loop (next t ctx) ctx
1125 eval_fold2_slist fl_list t (Tree.tag tree t) r2 r1
1128 fun t ctx _ tag _ ->
1129 eval_fold2_slist fll t tag
1130 (loop (next t ctx) ctx rlist tag)
1131 (loop (first t) t llist tag)
1136 CodeCache.set_fun td_trans slist tag cont;
1137 cont t ctx slist tag noright
1139 let _ = CodeCache.init mk_trans in
1140 (if noright then loop_no_right else loop) t ctx slist Tag.dummy
1142 let run_top_down a tree =
1143 let init = SList.cons a.init SList.nil in
1144 let _,res = top_down a tree Tree.root init Tree.root 1
1147 output_trace a tree "trace.html"
1148 (RS.fold (fun t a -> IntSet.add (Tree.id tree t) a) res.(0) IntSet.empty),
1152 module Configuration =
1154 module Ptss = Set.Make(StateSet)
1155 module IMap = Map.Make(StateSet)
1156 type t = { hash : int;
1158 results : RS.t IMap.t }
1159 let empty = { hash = 0;
1161 results = IMap.empty;
1163 let is_empty c = Ptss.is_empty c.sets
1165 if Ptss.mem s c.sets then
1166 { c with results = IMap.add s (RS.concat r (IMap.find s c.results)) c.results}
1168 { hash = HASHINT2(c.hash,Uid.to_int (Ptset.Int.uid s));
1169 sets = Ptss.add s c.sets;
1170 results = IMap.add s r c.results
1173 let pr fmt c = Format.fprintf fmt "{";
1174 Ptss.iter (fun s -> StateSet.print fmt s;
1175 Format.fprintf fmt " ") c.sets;
1176 Format.fprintf fmt "}\n%!";
1177 IMap.iter (fun k d ->
1178 StateSet.print fmt k;
1179 Format.fprintf fmt "-> %i\n" (RS.length d)) c.results;
1180 Format.fprintf fmt "\n%!"
1188 RS.concat r (IMap.find s acc)
1190 | Not_found -> r) acc) c1.results IMap.empty
1193 IMap.fold (fun s r acc ->
1196 RS.concat r (IMap.find s acc)
1198 | Not_found -> r) acc) c2.results acc1
1202 (fun s (ah,ass) -> (HASHINT2(ah, Uid.to_int (Ptset.Int.uid s)),
1204 (Ptss.union c1.sets c2.sets) (0,Ptss.empty)
1212 let h_fold = Hashtbl.create 511
1214 let fold_f_conf tree t slist fl_list conf dir=
1215 let tag = Tree.tag tree t in
1216 let rec loop sl fl acc =
1217 match SList.node sl,fl with
1218 |SList.Nil,[] -> acc
1219 |SList.Cons(s,sll), formlist::fll ->
1221 let key = SList.hash sl,Formlist.hash formlist,dir in
1223 Hashtbl.find h_fold key
1225 Not_found -> let res =
1226 if dir then eval_formlist tag s Ptset.Int.empty formlist
1227 else eval_formlist tag Ptset.Int.empty s formlist
1228 in (Hashtbl.add h_fold key res;res)
1230 let (rb,rb1,rb2,mark) = bool_of_merge mcnf in
1231 if rb && ((dir&&rb1)|| ((not dir) && rb2))
1235 try Configuration.IMap.find s conf.Configuration.results
1236 with Not_found -> RS.empty
1238 Configuration.add acc r' (if mark then RS.cons t old_r else old_r)
1241 else loop sll fll acc
1244 loop slist fl_list Configuration.empty
1246 let h_trans = Hashtbl.create 4096
1248 let get_up_trans slist ptag a tree =
1249 let key = (HASHINT2(Uid.to_int slist.SList.Node.id ,ptag)) in
1251 Hashtbl.find h_trans key
1255 Hashtbl.fold (fun q l acc ->
1256 List.fold_left (fun fl_acc (ts,t) ->
1257 if TagSet.mem ptag ts then Formlist.cons t fl_acc
1261 a.trans Formlist.nil
1263 let res = SList.fold (fun _ acc -> f_list::acc) slist []
1265 (Hashtbl.add h_trans key res;res)
1269 let h_tdconf = Hashtbl.create 511
1270 let rec bottom_up a tree t conf next jump_fun root dotd init accu =
1271 if (not dotd) && (Configuration.is_empty conf ) then
1275 let below_right = Tree.is_below_right tree t next in
1277 let accu,rightconf,next_of_next =
1278 if below_right then (* jump to the next *)
1279 bottom_up a tree next conf (jump_fun next) jump_fun (Tree.next_sibling tree t) true init accu
1280 else accu,Configuration.empty,next
1284 if below_right then prepare_topdown a tree t true
1285 else prepare_topdown a tree t false
1289 (Configuration.merge rightconf sub, next_of_next)
1291 if t == root then accu,conf,next else
1292 let parent = Tree.binary_parent tree t in
1293 let ptag = Tree.tag tree parent in
1294 let dir = Tree.is_left tree t in
1295 let slist = Configuration.Ptss.fold (fun e a -> SList.cons e a) conf.Configuration.sets SList.nil in
1296 let fl_list = get_up_trans slist ptag a parent in
1297 let slist = SList.rev (slist) in
1298 let newconf = fold_f_conf tree parent slist fl_list conf dir in
1299 let accu,newconf = Configuration.IMap.fold (fun s res (ar,nc) ->
1300 if Ptset.Int.intersect s init then
1301 ( RS.concat res ar ,nc)
1302 else (ar,Configuration.add nc s res))
1303 (newconf.Configuration.results) (accu,Configuration.empty)
1306 bottom_up a tree parent newconf next jump_fun root false init accu
1308 and prepare_topdown a tree t noright =
1309 let tag = Tree.tag tree t in
1312 Hashtbl.find h_tdconf tag
1315 let res = Hashtbl.fold (fun q l acc ->
1316 if List.exists (fun (ts,_) -> TagSet.mem tag ts) l
1317 then Ptset.Int.add q acc
1318 else acc) a.trans Ptset.Int.empty
1319 in Hashtbl.add h_tdconf tag res;res
1321 (* let _ = pr ", among ";
1322 StateSet.print fmt (Ptset.Int.elements r);
1325 let r = SList.cons r SList.nil in
1326 let set,res = top_down (~noright:noright) a tree t r t 1 in
1327 let set = match SList.node set with
1328 | SList.Cons(x,_) ->x
1331 Configuration.add Configuration.empty set res.(0)
1335 let run_bottom_up a tree k =
1336 let t = Tree.root in
1337 let trlist = Hashtbl.find a.trans (StateSet.choose a.init)
1339 let init = List.fold_left
1341 let _,_,_,f,_ = Transition.node t in
1342 let _,_,l = fst ( Formula.st f ) in
1343 StateSet.union acc l)
1344 StateSet.empty trlist
1346 let tree1,jump_fun =
1349 (*Tree.tagged_lowest t tag, fun tree -> Tree.tagged_next tree tag*)
1350 (Tree.tagged_descendant tree tag t, let jump = Tree.tagged_following_below tree tag
1351 in fun n -> jump n t )
1352 | `CONTAINS(_) -> (Tree.text_below tree t,let jump = Tree.text_next tree
1353 in fun n -> jump n t)
1356 let tree2 = jump_fun tree1 in
1357 let rec loop t next acc =
1358 let acc,conf,next_of_next = bottom_up a tree t
1359 Configuration.empty next jump_fun (Tree.root) true init acc
1361 let acc = Configuration.IMap.fold
1362 ( fun s res acc -> if StateSet.intersect init s
1363 then RS.concat res acc else acc) conf.Configuration.results acc
1365 if Tree.is_nil next_of_next (*|| Tree.equal next next_of_next *)then
1367 else loop next_of_next (jump_fun next_of_next) acc
1369 loop tree1 tree2 RS.empty
1374 let top_down_count a t = let module RI = Run(Integer) in let r = Integer.length (RI.run_top_down a t)
1375 in (*RI.TransCache.dump RI.td_trans; *)r
1376 let top_down a t = let module RI = Run(IdSet) in (RI.run_top_down a t)
1377 let bottom_up_count a t k = let module RI = Run(Integer) in Integer.length (RI.run_bottom_up a t k)
1378 let bottom_up a t k = let module RI = Run(IdSet) in (RI.run_bottom_up a t k)
1380 module Test (Doc : sig val doc : Tree.t end) =
1382 module Results = GResult(Doc)
1383 let top_down a t = let module R = Run(Results) in (R.run_top_down a t)