-INCLUDE "debug.ml"
-
-open Automaton
-let a = ref None
-
-let l = ref [] ;;
-let time f x =
- let t1 = Unix.gettimeofday () in
- let r = f x in
- let t2 = Unix.gettimeofday () in
- let t = (1000. *.(t2 -. t1)) in
- l:= t::!l;
- Printf.eprintf " %fms\n%!" t ;
- r
-;;
-let total_time () = List.fold_left (+.) 0. !l;;
-
-let test filename query output =
- Printf.eprintf "Parsing document : %!";
- let v = time Tree.Binary.parse_xml_uri filename in
-(* Tree.dump v;
- Printf.eprintf "\n\n\n\n\n%!";
- Tree.Binary.print_xml_fast stderr v *)
- Printf.eprintf "Full Traversal\n%!";
- time (Tree.full_traversal) v;
- Printf.eprintf "Traversal\n%!";
- time (Tree.traversal) v;
- Printf.eprintf "CPP Traversal\n%!";
- time (Tree.cpp_traversal) v
-
-
-let main filename query output =
- Printf.eprintf "Parsing document : %!";
- let v = time Tree.Binary.parse_xml_uri filename in
- MM(v,__LOCATION__);
- a := Some (v);
- a := None;
- Printf.eprintf "Parsing query : ";
- let query = try
- time
- XPath.Parser.parse_string query
- with
- Ulexer.Loc.Exc_located ((x,y),e) -> Printf.eprintf "character %i-%i %s\n" x y (Printexc.to_string e);exit 1
- in
+
+open Ata
+INCLUDE "utils.ml"
+let () = init_timer();;
+
+let default_gc = Gc.get()
+let tuned_gc = { Gc.get() with
+ Gc.minor_heap_size = 4*1024*1024;
+ Gc.major_heap_increment = 1024*1024;
+ Gc.max_overhead = 1000000;
+ }
+let hash x = 131*x/(x-1+1)
+
+let test_loop tree tag =
+ let t' = Tree.tagged_descendant tree tag Tree.root in
+ let f = Hashtbl.create 4096
+ in
+ let jump t _ = Tree.tagged_following_below tree tag t Tree.root in
+ let g t ctx =
+ if t == Tree.nil then 0
+ else 1+ ((Hashtbl.find f (hash 101)) (jump t ctx) ctx)
+ in
+ Hashtbl.add f (hash 101) g;
+ (Hashtbl.find f (hash 101)) t' Tree.root
+
+let test_full tree =
+ let root = Tree.root in
+ let fin = Tree.closing tree root in
+ let rec loop t = if t <= fin then
+ let tag = Tree.tag tree t in
+(* let _ = Tag.to_string tag in *)
+ if tag == Tag.pcdata then (ignore (Tree.get_text tree t));
+ let t = (Obj.magic ((Obj.magic t) + 1)) in
+ loop t
+ in
+ loop root
+
+
+let test_loop2 tree tag =
+ let t' = Tree.tagged_descendant tree tag Tree.root in
+ let f = Hashtbl.create 4096
+ in
+ let jump t _ = Tree.tagged_following_below tree tag t Tree.root in
+ let rec g t ctx =
+ if t == Tree.nil then 0
+ else 1+ (match (Hashtbl.find f (hash 101)) with
+ `Foo ->g (jump t ctx) ctx
+ )
+ in
+ Hashtbl.add f (hash 101) `Foo;
+ g t' Tree.root
+
+let test_text doc =
+ let _ = Printf.eprintf "Contains(bree)" in
+ let _ = time (Tree.test_contains doc) "bree" in
+ let _ = Printf.eprintf "Contains(brain)" in
+ let _ = time (Tree.test_contains doc) "brain" in
+ let _ = Printf.eprintf "Contains(brain)" in
+ let i = time (Tree.test_contains doc) "brain" in
+ let _ = Printf.eprintf "%i\nContains(Australia)" i in
+ let i = time (Tree.test_contains doc) "AUSTRALIA" in
+ let _ = Printf.eprintf "%i\n Contains(1930)" i in
+ let i = time (Tree.test_contains doc) "1930" in
+ let _ = Printf.eprintf "%i\n startswith(bar)" i in
+ let i = time (Tree.test_prefix doc) "bar" in
+ let _ = Printf.eprintf "%i\n endswith(LAND)" i in
+ let i = time (Tree.test_suffix doc) "LAND" in
+ let _ = Printf.eprintf "%i\n =(2001)" i in
+ let i = time (Tree.test_equals doc) "2001" in
+ let _ = Printf.eprintf "%i\n =(Nguyen)" i in
+ let i = time (Tree.test_equals doc) "Nguyen" in
+ Printf.eprintf "%i\n" i ;
+ ()
+
+type pointers
+type order = PREORDER | INORDER | POSTORDER
+external build_pointers : Tree.t -> order -> pointers = "caml_build_pointers"
+external iter_pointers : pointers -> int = "caml_iter_pointers"
+external free_pointers : pointers -> unit = "caml_free_pointers"
+
+
+let main v query_string output =
+
+ let _ = Tag.init (Tree.tag_pool v) in
+ Printf.eprintf "Parsing query : ";
+ let query = try
+ time
+ XPath.Parser.parse_string query_string
+ with
+ Ulexer.Loc.Exc_located ((x,y),e) -> Printf.eprintf "character %i-%i %s\n" x y (Printexc.to_string e);exit 1
+ in
+ let _ = Printf.eprintf "Number of nodes %i\n%!" (Tree.size v) in
+(* let _ = test_text v in *)
+(* let _ = Tree.stats v in *)
+ let _ = Printf.eprintf "\nTiming first_child/next_sibling on sxsi %!" in
+ let c = time (Tree.benchmark_fcns) v in
+ let _ = Printf.eprintf "Traversed %i nodes\n" c in
+ let _ = Printf.eprintf "\nTiming first_element/next_element on sxsi %!" in
+ let c = time (Tree.benchmark_fene) v in
+ let _ = Printf.eprintf "Traversed %i nodes\n" c in
+ let _ = Printf.eprintf "\nTiming last_child/prev_sibling on sxsi %!" in
+ let _ = time (Tree.benchmark_lcps) v in
+ let tag = "keyword" in
+ let _ = Printf.eprintf "\nTiming jump to <%s> on sxsi %!" tag in
+ let _ = time (Tree.benchmark_jump v) (Tag.tag tag) in
+ (* let _ = Printf.eprintf "\nTiming pointer allocation (preorder) %!" in
+ let pointers = time (build_pointers v) PREORDER in
+ let _ = Printf.eprintf "\nTiming pointer iteration %!" in
+ let i = time (iter_pointers) pointers in
+ let _ = Printf.eprintf "Traversed %i pointers\nTiming pointer deallocation %!" i in
+ let _ = time (free_pointers) pointers in
+
+
+ let _ = Printf.eprintf "\nTiming pointer allocation (inorder) %!" in
+ let pointers = time (build_pointers v) INORDER in
+ let _ = Printf.eprintf "\nTiming pointer iteration %!" in
+ let i = time (iter_pointers) pointers in
+ let _ = Printf.eprintf "Traversed %i pointers\nTiming pointer deallocation %!" i in
+ let _ = time (free_pointers) pointers in
+
+ let _ = Printf.eprintf "\nTiming pointer allocation (postorder) %!" in
+ let pointers = time (build_pointers v) POSTORDER in
+ let _ = Printf.eprintf "\nTiming pointer iteration %!" in
+ let i = time (iter_pointers) pointers in
+ let _ = Printf.eprintf "Traversed %i pointers\nTiming pointer deallocation %!" i in
+ let _ = time (free_pointers) pointers in *)
+
+ let _ = Printf.eprintf "\nTiming iterative_traversal on sxsi %!" in
+ let c = time (Tree.benchmark_iter) v in
+ let _ = Printf.eprintf "Traversed %i nodes\n" c in
+
+
+
+
+
+
+(* let _ = Printf.eprintf "Timing //keyword :" in
+ let r = time (test_loop v) (Tag.tag "keyword") in
+ let _ = Printf.eprintf "Count is %i\n%!" r in
+ let _ = Printf.eprintf "Timing //keyword 2:" in
+ let r = time (test_loop2 v) (Tag.tag "keyword") in
+ let _ = Printf.eprintf "Count is %i\n%!" r in
+ let _ = Printf.eprintf "Timing //node() :" in
+ let _ = time (test_full) v in *)
+ XPath.Ast.print Format.err_formatter query;
+ Format.fprintf Format.err_formatter "\n%!";