10 | FIRST_CHILD of StateSet.t
11 | NEXT_SIBLING of StateSet.t
12 | FIRST_ELEMENT of StateSet.t
13 | NEXT_ELEMENT of StateSet.t
14 | TAGGED_DESCENDANT of StateSet.t * Tag.t
15 | TAGGED_FOLLOWING of StateSet.t * Tag.t
16 | SELECT_DESCENDANT of StateSet.t * Ptset.Int.t * Tree.unordered_set
17 | SELECT_FOLLOWING of StateSet.t * Ptset.Int.t * Tree.unordered_set
18 | TAGGED_CHILD of StateSet.t * Tag.t
19 | TAGGED_FOLLOWING_SIBLING of StateSet.t * Tag.t
20 | SELECT_CHILD of StateSet.t * Ptset.Int.t * Tree.unordered_set
21 | SELECT_FOLLOWING_SIBLING of StateSet.t * Ptset.Int.t * Tree.unordered_set
22 | TAGGED_SUBTREE of StateSet.t * Tag.t
23 | ELEMENT_SUBTREE of StateSet.t
25 type dir = DIR_LEFT | DIR_RIGHT
28 let _first_child s = FIRST_CHILD s
29 let _next_sibling s = NEXT_SIBLING s
30 let _first_element s = FIRST_ELEMENT s
31 let _next_element s = NEXT_ELEMENT s
32 let _tagged_descendant s t = TAGGED_DESCENDANT(s,t)
33 let _tagged_following s t = TAGGED_FOLLOWING(s,t)
34 let _select_descendant s t = SELECT_DESCENDANT(s,t, Tree.unordered_set_of_set t)
35 let _select_following s t = SELECT_FOLLOWING(s,t, Tree.unordered_set_of_set t)
36 let _tagged_child s t = TAGGED_CHILD(s,t)
37 let _tagged_following_sibling s t = TAGGED_FOLLOWING_SIBLING(s,t)
38 let _select_child s t = SELECT_CHILD(s,t, Tree.unordered_set_of_set t)
39 let _select_following_sibling s t = SELECT_FOLLOWING_SIBLING(s,t, Tree.unordered_set_of_set t)
40 let _tagged_subtree s t = TAGGED_SUBTREE (s, t)
41 let _element_subtree s = ELEMENT_SUBTREE s
44 let jump_stat_table = Hashtbl.create 17
45 let jump_stat_init () = Hashtbl.clear jump_stat_table
47 let i = try Hashtbl.find jump_stat_table j with Not_found -> 0 in
48 Hashtbl.replace jump_stat_table j (i+1)
50 let print_jump fmt j =
52 | NOP _ -> fprintf fmt "nop"
53 | FIRST_CHILD _ -> fprintf fmt "first_child"
54 | NEXT_SIBLING _ -> fprintf fmt "next_sibling"
55 | FIRST_ELEMENT _ -> fprintf fmt "first_element"
56 | NEXT_ELEMENT _ -> fprintf fmt "next_element"
58 | TAGGED_DESCENDANT (_, tag) -> fprintf fmt "tagged_descendant(%s)" (Tag.to_string tag)
60 | TAGGED_FOLLOWING (_, tag) -> fprintf fmt "tagged_following(%s)" (Tag.to_string tag)
62 | SELECT_DESCENDANT (_, tags, _) -> fprintf fmt "select_descendant(%a)"
63 TagSet.print (TagSet.inj_positive tags)
65 | SELECT_FOLLOWING (_, tags, _) -> fprintf fmt "select_following(%a)"
66 TagSet.print (TagSet.inj_positive tags)
68 | TAGGED_CHILD (_, tag) -> fprintf fmt "tagged_child(%s)" (Tag.to_string tag)
70 | TAGGED_FOLLOWING_SIBLING (_, tag) ->
71 fprintf fmt "tagged_following_sibling(%s)" (Tag.to_string tag)
73 | SELECT_CHILD (_, tags, _) -> fprintf fmt "select_child(%a)"
74 TagSet.print (TagSet.inj_positive tags)
76 | SELECT_FOLLOWING_SIBLING (_, tags, _) -> fprintf fmt "select_following_sibling(%a)"
77 TagSet.print (TagSet.inj_positive tags)
79 | TAGGED_SUBTREE (_, tag) -> fprintf fmt "tagged_subtree(%s)" (Tag.to_string tag)
80 | ELEMENT_SUBTREE (_) -> fprintf fmt "element_subtree"
82 let jump_stat_summary fmt =
83 fprintf fmt "Jump function summary:\n%!";
84 Hashtbl.iter (fun k v -> fprintf fmt "%i calls to %a\n" v print_jump k) jump_stat_table;
91 | LEFT of Translist.t * jump
92 | RIGHT of Translist.t * jump
93 | BOTH of Translist.t * jump * jump
95 type t = opcode Cache.Lvl2.t
97 let print_opcode fmt o = match o with
98 | CACHE _ -> fprintf fmt "CACHE()"
99 | RETURN _ -> fprintf fmt "RETURN ()"
100 | LEFT (tl, j) -> fprintf fmt "LEFT(\n[%a], %a)" Translist.print tl print_jump j
101 | RIGHT (tl, j) -> fprintf fmt "RIGHT(\n[%a], %a)" Translist.print tl print_jump j
102 | BOTH (tl, j1, j2) -> fprintf fmt "BOTH(\n[%a], %a, %a)" Translist.print tl print_jump j1 print_jump j2
104 let print_cache fmt d =
105 let c = Cache.Lvl2.to_array d in
106 Array.iteri begin fun tag a ->
107 let tagstr = Tag.to_string tag in
108 if a != Cache.Lvl2.dummy_line d && tagstr <> "<INVALID TAG>"
110 fprintf fmt "Entry %s: \n" tagstr;
111 Array.iter (fun o -> if o != dummy then begin
113 fprintf fmt "\n%!" end) a;
114 fprintf fmt "---------------------------\n%!"
118 let create () = Cache.Lvl2.create 1024 dummy
121 let d = Cache.Lvl2.to_array c in
122 let len = Array.fold_left (fun acc a -> Array.length a + acc) 0 d in
123 let lvl1 = Array.fold_left (fun acc a -> if Array.length a == 0 then acc else acc+1) 0 d in
124 let lvl2 = Array.fold_left (fun acc a ->
125 Array.fold_left (fun acc2 a2 -> if a2 == dummy then acc2 else acc2+1)
128 fprintf fmt "L2JIT Statistics:
132 \ttable size: %ikb\n"
133 len lvl1 lvl2 (Ocaml.size_kb d);
134 fprintf fmt "%s" "L2JIT Content:\n";
137 let find t tag set = Cache.Lvl2.find t tag (Uid.to_int set.StateSet.Node.id)
139 let add t tag set v = Cache.Lvl2.add t tag (Uid.to_int set.StateSet.Node.id) v
141 let collect_trans tag ((a_t, a_s1, a_s2) as acc) (labels, tr) =
142 if TagSet.mem tag labels
144 let _, _, _, f = Transition.node tr in
145 let (_, _, s1), (_, _, s2) = Formula.st f in
146 (Translist.cons tr a_t,
147 StateSet.union s1 a_s1,
148 StateSet.union s2 a_s2)
151 let has_text l = Ptset.Int.mem Tag.pcdata l
153 let rec translate_jump tree tag (jkind:Ata.jump_kind) dir s =
154 let child, desc, sib, fol = Tree.tags tree tag in
155 match jkind, dir with
157 | NODE, DIR_LEFT -> FIRST_CHILD s
158 | STAR, DIR_LEFT -> FIRST_ELEMENT s
159 | NODE, DIR_RIGHT -> NEXT_SIBLING s
160 | STAR, DIR_RIGHT -> NEXT_ELEMENT s
162 let l_one, l_many, tagged_one, select_one, any, any_notext =
163 if dir = DIR_LEFT then
164 child, desc, _tagged_child, _select_child,_first_child, _first_element
166 sib, fol, _tagged_following_sibling, _select_following_sibling,
167 _next_sibling, _next_element
169 let labels = Ptset.Int.inter l_one t in
170 let c = Ptset.Int.cardinal labels in
172 else if Ptset.Int.for_all (fun lab -> not (Ptset.Int.mem lab l_many)) labels then
173 translate_jump tree tag (JUMP_MANY(labels)) dir s
174 else if c == 1 then tagged_one s (Ptset.Int.choose labels)
175 else if c > 5 then if has_text labels then any s else any_notext s
176 else select_one s labels
179 let l_many, tagged_many, select_many, any, any_notext =
180 if dir == DIR_LEFT then
181 desc, _tagged_descendant, _select_descendant,_first_child, _first_element
183 fol, _tagged_following, _select_following, _next_sibling, _next_element
185 let labels = Ptset.Int.inter l_many t in
186 let c = Ptset.Int.cardinal labels in
188 else if c == 1 then tagged_many s (Ptset.Int.choose labels)
189 else if c > 5 then if has_text labels then any s else any_notext s
190 else select_many s labels
192 | CAPTURE_MANY (t), DIR_LEFT ->
193 if Ptset.Int.is_singleton t then TAGGED_SUBTREE(s, Ptset.Int.choose t)
194 else if t == Tree.element_tags tree then ELEMENT_SUBTREE s
198 let compute_jump auto tree tag states dir =
199 if !Options.no_jump then
200 if dir == DIR_LEFT then FIRST_CHILD states
201 else NEXT_SIBLING states
203 let jkind = Ata.top_down_approx auto states tree in
204 let jump = translate_jump tree tag jkind dir states in
205 TRACE("level2-jit", 2,
206 __ "Computed jumps for %s %a %s: %a\n%!"
208 StateSet.print states
209 (if dir == DIR_LEFT then "left" else "right")
214 let compile cache2 auto tree tag states =
215 let tr_list, states1, states2 =
218 List.fold_left (collect_trans tag)
220 (Hashtbl.find auto.trans q))
222 (Translist.nil, StateSet.empty, StateSet.empty)
225 let empty_s1 = StateSet.is_empty states1 in
226 let empty_s2 = StateSet.is_empty states2 in
227 if empty_s1 && empty_s2 then RETURN ()
228 else if empty_s1 then
230 compute_jump auto tree tag states2 DIR_RIGHT)
231 else if empty_s2 then
233 compute_jump auto tree tag states1 DIR_LEFT)
235 let j1 = compute_jump auto tree tag states1 DIR_LEFT in
236 let j2 = compute_jump auto tree tag states2 DIR_RIGHT in
237 BOTH (tr_list, j1, j2);
239 let op = match op with
240 (*BOTH(_, NOP _, NOP _) | LEFT(_, NOP _) | RIGHT(_, NOP _) -> RETURN() *)
241 | BOTH(tr, ((NOP _) as l) , NOP _) -> LEFT (tr, l)
242 | BOTH(tr, l, NOP _) -> LEFT (tr, l)
243 | BOTH(tr, NOP _, r) -> RIGHT (tr, r)
246 add cache2 tag states op;
249 let get_transitions = function
250 | CACHE _ | RETURN _ -> failwith "get_transitions"
253 | BOTH (tr, _, _) -> tr