- struct
-
- module NodeSummary =
- struct
- (* Pack into an integer the result of the is_* and has_ predicates
- for a given node *)
- type t = int
- let dummy = -1
- (*
- 4444444444443210
- 4 -> kind
- 3 -> is_left
- 2 -> is_right
- 1 -> has_left
- 0 -> has_right
- *)
-
- let has_right (s : t) : bool =
- Obj.magic (s land 1)
-
- let has_left (s : t) : bool =
- Obj.magic ((s lsr 1) land 1)
-
- let is_right (s : t) : bool =
- Obj.magic ((s lsr 2) land 1)
-
- let is_left (s : t) : bool =
- Obj.magic ((s lsr 3) land 1)
-
- let kind (s : t) : Tree.NodeKind.t =
- Obj.magic (s lsr 4)
-
- let make is_left is_right has_left has_right kind =
- ((Obj.magic kind) lsl 4) lor
- ((int_of_bool is_left) lsl 3) lor
- ((int_of_bool is_right) lsl 2) lor
- ((int_of_bool has_left) lsl 1) lor
- (int_of_bool has_right)
-
- end
-
- type node_status = {
- sat : StateSet.t; (* States that are satisfied at the current node *)
- todo : StateSet.t; (* States that remain to be proven *)
- (* For every node_status and automaton a:
- a.states - (sat U todo) = unsat *)
- summary : NodeSummary.t; (* Summary of the shape of the node *)
- }
-(* Describe what is kept at each node for a run *)
-
- module NodeStatus =
- struct
- include Hcons.Make(struct
- type t = node_status
- let equal c d =
- c == d ||
- c.sat == d.sat &&
- c.todo == d.todo &&
- c.summary == d.summary
-
- let hash c =
- HASHINT3((c.sat.StateSet.id :> int),
- (c.todo.StateSet.id :> int),
- c.summary)
- end
- )
- let print ppf s =
- fprintf ppf
- "{ sat: %a; todo: %a; summary: _ }"
- StateSet.print s.node.sat
- StateSet.print s.node.todo
- end
-
- let dummy_status =
- NodeStatus.make { sat = StateSet.empty;
- todo = StateSet.empty;
- summary = NodeSummary.dummy;
- }
-
-
- type run = {
- tree : T.t ;
- (* The argument of the run *)
- auto : Ata.t;
- (* The automaton to be run *)
- status : NodeStatus.t array;
- (* A mapping from node preorders to NodeStatus *)
- unstable : Bitvector.t;
- (* A bitvector remembering whether a subtree is stable *)
- mutable redo : bool;
- (* A boolean indicating whether the run is incomplete *)
- mutable pass : int;
- (* The number of times this run was updated *)
- mutable cache2 : Ata.Formula.t Cache.N2.t;
- (* A cache from states * label to list of transitions *)
- mutable cache5 : NodeStatus.t Cache.N5.t;
- }
-
- let pass r = r.pass
- let stable r = not r.redo
- let auto r = r.auto
- let tree r = r.tree
-
-
- let dummy_form = Ata.Formula.stay State.dummy
-
- let make auto tree =
- let len = T.size tree in
- {
- tree = tree;
- auto = auto;
- status = Array.create len dummy_status;
- unstable = Bitvector.create ~init:true len;
- redo = true;
- pass = 0;
- cache2 = Cache.N2.create dummy_form;
- cache5 = Cache.N5.create dummy_status;
- }
-
- let get_status a i =
- if i < 0 then dummy_status else Array.get a i
-
- let unsafe_get_status a i =
- if i < 0 then dummy_status else Array.unsafe_get a i
-
-IFDEF HTMLTRACE
- THEN
-DEFINE IFTRACE(e) = (e)
- ELSE
-DEFINE IFTRACE(e) = ()
-END
-
- let html tree node i config msg =
- let config = config.NodeStatus.node in
- Html.trace ~msg:msg
- (T.preorder tree node) i
- config.todo
- config.sat
-
-
-
- let debug msg tree node i config =
- let config = config.NodeStatus.node in
- eprintf
- "DEBUG:%s node: %i\nsat: %a\ntodo: %a\nround: %i\n"
- msg
- (T.preorder tree node)
- StateSet.print config.sat
- StateSet.print config.todo
- i
-
- let get_form cache2 auto tag q =
- let phi =
- incr cache2_access;
- Cache.N2.find cache2 (tag.QName.id :> int) (q :> int)
- in
- if phi == dummy_form then
- let phi = Ata.get_form auto tag q in
- let () =
- Cache.N2.add
- cache2
- (tag.QName.id :> int)
- (q :> int) phi
- in phi
- else begin
- incr cache2_hit;
- phi
- end
-
- type trivalent = False | True | Unknown
- let of_bool = function false -> False | true -> True
- let or_ t1 t2 =
- match t1 with
- False -> t2
- | True -> True
- | Unknown -> if t2 == True then True else Unknown
-
- let and_ t1 t2 =
- match t1 with
- False -> False
- | True -> t2
- | Unknown -> if t2 == False then False else Unknown
-
- (* Define as macros to get lazyness *)
-DEFINE OR_(t1,t2) =
- match t1 with
- False -> (t2)
- | True -> True
- | Unknown -> if (t2) == True then True else Unknown
-
-DEFINE AND_(t1,t2) =
- match t1 with
- False -> False
- | True -> (t2)
- | Unknown -> if (t2) == False then False else Unknown
-
-
- let eval_form phi fcs nss ps ss summary =
- let open Ata in
- let rec loop phi =
- begin match Formula.expr phi with
- | Boolean.False -> False
- | Boolean.True -> True
- | Boolean.Atom (a, b) ->
- begin
- let open NodeSummary in
- match a.Atom.node with
- | Move (m, q) ->
- let { NodeStatus.node = n_sum; _ } as sum =
- match m with
- `First_child -> fcs
- | `Next_sibling -> nss
- | `Parent | `Previous_sibling -> ps
- | `Stay -> ss
- in
- if sum == dummy_status || StateSet.mem q n_sum.todo then
- Unknown
- else
- of_bool (b == StateSet.mem q n_sum.sat)
- | Is_first_child -> of_bool (b == is_left summary)
- | Is_next_sibling -> of_bool (b == is_right summary)
- | Is k -> of_bool (b == (k == kind summary))
- | Has_first_child -> of_bool (b == has_left summary)
- | Has_next_sibling -> of_bool (b == has_right summary)
- end
- | Boolean.And(phi1, phi2) -> AND_ (loop phi1, loop phi2)
- | Boolean.Or (phi1, phi2) -> OR_ (loop phi1, loop phi2)
- end
- in
- loop phi
-
-
- let eval_trans_aux auto cache2 tag fcs nss ps old_status =
- let { sat = old_sat;
- todo = old_todo;
- summary = old_summary } as os_node = old_status.NodeStatus.node
- in
- let sat, todo =
- StateSet.fold (fun q ((a_sat, a_todo) as acc) ->
- let phi =
- get_form cache2 auto tag q
- in
- let v = eval_form phi fcs nss ps old_status old_summary in
- match v with
- True -> StateSet.add q a_sat, a_todo
- | False -> acc
- | Unknown -> a_sat, StateSet.add q a_todo
- ) old_todo (old_sat, StateSet.empty)
- in
- if old_sat != sat || old_todo != todo then
- NodeStatus.make { os_node with sat; todo }
- else old_status
-
+struct
+
+ let int (x : bool) : int = Obj.magic x
+ let kint (x : Tree.NodeKind.t) : int = Obj.magic x
+ let summary tree node parent fc ns =
+ (int (ns != T.nil)) lor
+ ((int (fc != T.nil)) lsl 1) lor
+ ((int (node == T.next_sibling tree parent)) lsl 2) lor
+ ((int (node == T.first_child tree parent)) lsl 3) lor
+ ((kint (T.kind tree node)) lsl 4)
+
+ let has_next_sibling summary : bool = Obj.magic (summary land 1)
+ let has_first_child summary : bool = Obj.magic ((summary lsr 1) land 1)
+ let is_next_sibling summary : bool = Obj.magic ((summary lsr 2) land 1)
+ let is_first_child summary : bool = Obj.magic ((summary lsr 3) land 1)
+ let kind summary : Tree.NodeKind.t = Obj.magic (summary lsr 4)
+
+
+ let eval_form phi node_summary f_set n_set p_set s_set =
+ let rec loop phi =
+ let open Boolean in
+ match Ata.Formula.expr phi with
+ False -> false
+ | True -> true
+ | Or (phi1, phi2) -> loop phi1 || loop phi2
+ | And (phi1, phi2) -> loop phi1 && loop phi2
+ | Atom (a, b) -> b == Ata.(
+ match Atom.node a with
+ Is_first_child -> is_first_child node_summary
+ | Is_next_sibling -> is_next_sibling node_summary
+ | Is k -> k == kind node_summary
+ | Has_first_child -> has_first_child node_summary
+ | Has_next_sibling -> has_next_sibling node_summary
+ | Move (m, q) ->
+ let set =
+ match m with
+ `First_child -> f_set
+ | `Next_sibling -> n_set
+ | `Parent
+ | `Previous_sibling -> p_set
+ | `Stay -> s_set
+ in
+ StateSet.mem q set
+ )
+ in
+ loop phi