AllenGeng/ocamlgithub · Datasets at Hugging Face

text stringlengths 12 786k
let collect_references = object inherit Tast_iter . iter as super method ! expression = function \| { exp_desc = Texp_ident ( _ , _ , { Types . val_loc ; _ } ) ; exp_loc } -> Hashtbl . add references val_loc exp_loc \| e -> super # expression e end
let rec load_file fn = if Filename . check_suffix fn " . cmi " && Sys . file_exists ( Filename . chop_suffix fn " . cmi " ^ " . mli " ) then let open Cmi_format in List . iter ( collect_export fn ) ( read_cmi fn ) . cmi_sign else if Filename . check_suffix fn " . cmt " then let open Cmt_format in match read fn with \| ( _ , Some { cmt_annots = Implementation x ; _ } ) -> collect_references # structure x \| _ -> ( ) else if ( try Sys . is_directory fn with _ -> false ) then Array . iter ( fun s -> load_file ( Filename . concat fn s ) ) ( Sys . readdir fn )
let report loc = if not ( Hashtbl . mem references loc ) then Format . printf " % a : unused exported value . " @ Location . print_loc loc
let ( ) = try for i = 1 to Array . length Sys . argv - 1 do load_file Sys . argv . ( i ) done ; List . iter report ! vds with exn -> Location . report_exception Format . err_formatter exn ; exit 2
module Unused : sig type unused = int end ; ; ^^^^^^^^^^^^^^^^^
module Unused : sig end } ] \|
module Unused_nonrec : sig type nonrec used = int type nonrec unused = used end ; ; ^^^^^^^^^^^^^^^^^^^^^^^^^
module Unused_nonrec : sig end } ] \|
module Unused_rec : sig type unused = A of unused end ; ; ^^^^^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^
module Unused_rec : sig end } ] \|
module Used_constructor : sig type t val t : t type t = T let t = T end ; ;
module Used_constructor : sig type t val t : t end } ] \|
module Unused_constructor : sig type t type t = T end ; ; ^
module Unused_constructor : sig type t end } ] \|
module Unused_constructor_outside_patterns : sig type t val nothing : t -> unit type t = T let nothing = function \| T -> ( ) end ; ; ^
module Unused_constructor_outside_patterns : sig type t val nothing : t -> unit end } ] \|
module Unused_constructor_exported_private : sig type t = private T type t = T end ; ; ^
module Unused_constructor_exported_private : sig type t = private T end } ] \|
module Used_private_constructor : sig type t val nothing : t -> unit type t = private T let nothing = function \| T -> ( ) end ; ;
module Used_private_constructor : sig type t val nothing : t -> unit end } ] \|
module Unused_private_constructor : sig type t type t = private T end ; ; ^
module Unused_private_constructor : sig type t end } ] \|
module Exported_private_constructor : sig type t = private T type t = private T end ; ;
module Exported_private_constructor : sig type t = private T end } ] \|
module Used_exception : sig val e : exn exception Somebody_uses_me let e = Somebody_uses_me end ; ;
module Used_exception : sig val e : exn end } ] \|
module Used_extension_constructor : sig type t val t : t type t = . . type t += Somebody_uses_me let t = Somebody_uses_me end ; ;
module Used_extension_constructor : sig type t val t : t end } ] \|
module Unused_exception : sig exception Nobody_uses_me end ; ; ^^^^^^^^^^^^^^^^^^^^^^^^
module Unused_exception : sig end } ] \|
module Unused_extension_constructor : sig type t = . . type t = . . type t += Nobody_uses_me end ; ; ^^^^^^^^^^^^^^
module Unused_extension_constructor : sig type t = . . end } ] \|
module Unused_exception_outside_patterns : sig val falsity : exn -> bool exception Nobody_constructs_me let falsity = function \| Nobody_constructs_me -> true \| _ -> false end ; ; ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
module Unused_exception_outside_patterns : sig val falsity : exn -> bool end } ] \|
module Unused_extension_outside_patterns : sig type t = . . val falsity : t -> bool type t = . . type t += Noone_builds_me let falsity = function \| Noone_builds_me -> true \| _ -> false end ; ; ^^^^^^^^^^^^^^^
module Unused_extension_outside_patterns : sig type t = . . val falsity : t -> bool end } ] \|
module Unused_exception_exported_private : sig type exn += private Private_exn exception Private_exn end ; ; ^^^^^^^^^^^^^^^^^^^^^
module Unused_exception_exported_private : sig type exn += private Private_exn end } ] \|
module Unused_extension_exported_private : sig type t = . . type t += private Private_ext type t = . . type t += Private_ext end ; ; ^^^^^^^^^^^
module Unused_extension_exported_private : sig type t = . . type t += private Private_ext end } ] \|
module Used_private_extension : sig type t val nothing : t -> unit type t = . . type t += private Private_ext let nothing = function \| Private_ext \| _ -> ( ) end ; ;
module Used_private_extension : sig type t val nothing : t -> unit end } ] \|
module Unused_private_extension : sig type t type t = . . type t += private Private_ext end ; ; ^^^^^^^^^^^
module Unused_private_extension : sig type t end } ] \|
module Exported_private_extension : sig type t = . . type t += private Private_ext type t = . . type t += private Private_ext end ; ;
module Exported_private_extension : sig type t = . . type t += private Private_ext end } ] \|
module Pr7438 : sig module type S = sig type t = private [ > ` Foo ] end module type X = sig type t = private [ > ` Foo \| ` Bar ] include S with type t := t end end ; ;
module Pr7438 : sig end } ] \|
module Unused_type_disable_warning : sig type t = A [ @@ warning " - 34 " ] end ; ; ^
module Unused_type_disable_warning : sig end } ] \|
module Unused_constructor_disable_warning : sig type t = A [ @@ warning " - 37 " ] end ; ; ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
module Unused_constructor_disable_warning : sig end } ] \|
let silent v = String . length v > 0 && v . [ 0 ] = ' _ ' ; ;
let add_vars tbl ( vll1 , vll2 ) = let add_var ( v , _loc , used ) = Hashtbl . add tbl v used in List . iter add_var vll1 ; List . iter add_var vll2 ; ; ;
let rm_vars tbl ( vll1 , vll2 ) = let rm_var ( v , _ , _ ) = Hashtbl . remove tbl v in List . iter rm_var vll1 ; List . iter rm_var vll2 ; ; ;
let w_suspicious x = Warnings . Unused_var x ; ;
let w_strict x = Warnings . Unused_var_strict x ; ;
let check_rm_vars ppf tbl ( vlul_pat , vlul_as ) = let check_rm_var kind ( v , loc , used ) = if not ! used && not ( silent v ) then Location . print_warning loc ppf ( kind v ) ; Hashtbl . remove tbl v ; in List . iter ( check_rm_var w_strict ) vlul_pat ; List . iter ( check_rm_var w_suspicious ) vlul_as ; ; ;
let check_rm_let ppf tbl vlulpl = let check_rm_one flag ( v , loc , used ) = Hashtbl . remove tbl v ; flag && ( silent v \|\| not ! used ) in let warn_var w_kind ( v , loc , used ) = if not ( silent v ) && not ! used then Location . print_warning loc ppf ( w_kind v ) in let check_rm_pat ( def , def_as ) = let def_unused = List . fold_left check_rm_one true def in let all_unused = List . fold_left check_rm_one def_unused def_as in List . iter ( warn_var ( if all_unused then w_suspicious else w_strict ) ) def ; List . iter ( warn_var w_suspicious ) def_as ; in List . iter check_rm_pat vlulpl ; ; ;
let rec get_vars ( ( vacc , asacc ) as acc ) p = match p . ppat_desc with \| Ppat_any -> acc \| Ppat_var v -> ( ( v , p . ppat_loc , ref false ) :: vacc , asacc ) \| Ppat_alias ( pp , v ) -> get_vars ( vacc , ( ( v , p . ppat_loc , ref false ) :: asacc ) ) pp \| Ppat_constant _ -> acc \| Ppat_tuple pl -> List . fold_left get_vars acc pl \| Ppat_construct ( _ , po , _ ) -> get_vars_option acc po \| Ppat_variant ( _ , po ) -> get_vars_option acc po \| Ppat_record ipl -> List . fold_left ( fun a ( _ , p ) -> get_vars a p ) acc ipl \| Ppat_array pl -> List . fold_left get_vars acc pl \| Ppat_or ( p1 , _p2 ) -> get_vars acc p1 \| Ppat_lazy p -> get_vars acc p \| Ppat_constraint ( pp , _ ) -> get_vars acc pp \| Ppat_type _ -> acc match po with \| Some p -> get_vars acc p \| None -> acc ; ;
let get_pel_vars pel = List . map ( fun ( p , _ ) -> get_vars ( [ ] , [ ] ) p ) pel ; ;
let rec structure ppf tbl l = List . iter ( structure_item ppf tbl ) l match s . pstr_desc with \| Pstr_eval e -> expression ppf tbl e ; \| Pstr_value ( recflag , pel ) -> let_pel ppf tbl recflag pel None ; \| Pstr_primitive _ -> ( ) \| Pstr_type _ -> ( ) \| Pstr_exception _ -> ( ) \| Pstr_exn_rebind _ -> ( ) \| Pstr_module ( _ , me ) -> module_expr ppf tbl me ; \| Pstr_recmodule stml -> List . iter ( fun ( _ , _ , me ) -> module_expr ppf tbl me ) stml ; \| Pstr_modtype _ -> ( ) \| Pstr_open _ -> ( ) \| Pstr_class cdl -> List . iter ( class_declaration ppf tbl ) cdl ; \| Pstr_class_type _ -> ( ) \| Pstr_include _ -> ( ) match e . pexp_desc with \| Pexp_ident ( Longident . Lident id ) -> begin try ( Hashtbl . find tbl id ) := true ; with Not_found -> ( ) end ; \| Pexp_ident _ -> ( ) \| Pexp_constant _ -> ( ) \| Pexp_let ( recflag , pel , e ) -> let_pel ppf tbl recflag pel ( Some ( fun ppf tbl -> expression ppf tbl e ) ) ; \| Pexp_function ( _ , eo , pel ) -> expression_option ppf tbl eo ; match_pel ppf tbl pel ; \| Pexp_apply ( e , lel ) -> expression ppf tbl e ; List . iter ( fun ( _ , e ) -> expression ppf tbl e ) lel ; \| Pexp_match ( e , pel ) -> expression ppf tbl e ; match_pel ppf tbl pel ; \| Pexp_try ( e , pel ) -> expression ppf tbl e ; match_pel ppf tbl pel ; \| Pexp_tuple el -> List . iter ( expression ppf tbl ) el ; \| Pexp_construct ( _ , eo , _ ) -> expression_option ppf tbl eo ; \| Pexp_variant ( _ , eo ) -> expression_option ppf tbl eo ; \| Pexp_record ( iel , eo ) -> List . iter ( fun ( _ , e ) -> expression ppf tbl e ) iel ; expression_option ppf tbl eo ; \| Pexp_field ( e , _ ) -> expression ppf tbl e ; \| Pexp_setfield ( e1 , _ , e2 ) -> expression ppf tbl e1 ; expression ppf tbl e2 ; \| Pexp_array el -> List . iter ( expression ppf tbl ) el ; \| Pexp_ifthenelse ( e1 , e2 , eo ) -> expression ppf tbl e1 ; expression ppf tbl e2 ; expression_option ppf tbl eo ; \| Pexp_sequence ( e1 , e2 ) -> expression ppf tbl e1 ; expression ppf tbl e2 ; \| Pexp_while ( e1 , e2 ) -> expression ppf tbl e1 ; expression ppf tbl e2 ; \| Pexp_for ( id , e1 , e2 , _ , e3 ) -> expression ppf tbl e1 ; expression ppf tbl e2 ; let defined = ( [ ( id , e . pexp_loc , ref true ) ] , [ ] ) in add_vars tbl defined ; expression ppf tbl e3 ; check_rm_vars ppf tbl defined ; \| Pexp_constraint ( e , _ , _ ) -> expression ppf tbl e ; \| Pexp_when ( e1 , e2 ) -> expression ppf tbl e1 ; expression ppf tbl e2 ; \| Pexp_send ( e , _ ) -> expression ppf tbl e ; \| Pexp_new _ -> ( ) \| Pexp_setinstvar ( _ , e ) -> expression ppf tbl e ; \| Pexp_override sel -> List . iter ( fun ( _ , e ) -> expression ppf tbl e ) sel ; \| Pexp_letmodule ( _ , me , e ) -> module_expr ppf tbl me ; expression ppf tbl e ; \| Pexp_assert e -> expression ppf tbl e ; \| Pexp_assertfalse -> ( ) \| Pexp_lazy e -> expression ppf tbl e ; \| Pexp_poly ( e , _ ) -> expression ppf tbl e ; \| Pexp_object cs -> class_structure ppf tbl cs ; match eo with \| Some e -> expression ppf tbl e ; \| None -> ( ) match recflag with \| Asttypes . Recursive -> let defined = get_pel_vars pel in List . iter ( add_vars tbl ) defined ; List . iter ( fun ( _ , e ) -> expression ppf tbl e ) pel ; begin match body with \| None -> List . iter ( rm_vars tbl ) defined ; \| Some f -> f ppf tbl ; check_rm_let ppf tbl defined ; end ; \| _ -> List . iter ( fun ( _ , e ) -> expression ppf tbl e ) pel ; begin match body with \| None -> ( ) \| Some f -> let defined = get_pel_vars pel in List . iter ( add_vars tbl ) defined ; f ppf tbl ; check_rm_let ppf tbl defined ; end ; List . iter ( match_pe ppf tbl ) pel let defined = get_vars ( [ ] , [ ] ) p in add_vars tbl defined ; expression ppf tbl e ; check_rm_vars ppf tbl defined ; match me . pmod_desc with \| Pmod_ident _ -> ( ) \| Pmod_structure s -> structure ppf tbl s \| Pmod_functor ( _ , _ , me ) -> module_expr ppf tbl me \| Pmod_apply ( me1 , me2 ) -> module_expr ppf tbl me1 ; module_expr ppf tbl me2 ; \| Pmod_constraint ( me , _ ) -> module_expr ppf tbl me match ce . pcl_desc with \| Pcl_constr _ -> ( ) \| Pcl_structure cs -> class_structure ppf tbl cs ; \| Pcl_fun ( _ , _ , _ , ce ) -> class_expr ppf tbl ce ; \| Pcl_apply ( ce , lel ) -> class_expr ppf tbl ce ; List . iter ( fun ( _ , e ) -> expression ppf tbl e ) lel ; \| Pcl_let ( recflag , pel , ce ) -> let_pel ppf tbl recflag pel ( Some ( fun ppf tbl -> class_expr ppf tbl ce ) ) ; \| Pcl_constraint ( ce , _ ) -> class_expr ppf tbl ce ; let defined = get_vars ( [ ] , [ ] ) p in add_vars tbl defined ; List . iter ( class_field ppf tbl ) cfl ; check_rm_vars ppf tbl defined ; match cf with \| Pcf_inher ( ce , _ ) -> class_expr ppf tbl ce ; \| Pcf_val ( _ , _ , e , _ ) -> expression ppf tbl e ; \| Pcf_virt _ \| Pcf_valvirt _ -> ( ) \| Pcf_meth ( _ , _ , e , _ ) -> expression ppf tbl e ; \| Pcf_cstr _ -> ( ) \| Pcf_let ( recflag , pel , _ ) -> let_pel ppf tbl recflag pel None ; \| Pcf_init e -> expression ppf tbl e ; ; ;
let warn ppf ast = if Warnings . is_active ( w_suspicious " " ) \|\| Warnings . is_active ( w_strict " " ) then begin let tbl = Hashtbl . create 97 in structure ppf tbl ast ; end ; ast ; ;
type huffman = \| Found of int \| NeedBit of huffman * huffman \| NeedBits of int * huffman array
type adler32 = { mutable a1 : int ; mutable a2 : int ; }
type window = { mutable wbuffer : Bytes . t ; mutable wpos : int ; wcrc : adler32 ; }
type state = \| Head \| Block \| CData \| Flat \| Crc \| Dist \| DistOne \| Done
type t = { mutable znbits : int ; mutable zbits : int ; mutable zstate : state ; mutable zfinal : bool ; mutable zhuffman : huffman ; mutable zhuffdist : huffman option ; mutable zlen : int ; mutable zdist : int ; mutable zneeded : int ; mutable zoutput : Bytes . t ; mutable zoutpos : int ; zinput : IO . input ; zlengths : int array ; zwindow : window ; }
type error_msg = \| Invalid_huffman \| Invalid_data \| Invalid_crc \| Truncated_data \| Unsupported_dictionary
let error msg = raise ( Error msg ) msg
let rec tree_depth = function \| Found _ -> 0 \| NeedBits _ -> assert false \| NeedBit ( a , b ) b -> 1 + min ( tree_depth a ) a ( tree_depth b ) b
let rec tree_compress t = match tree_depth t with \| 0 -> t \| 1 -> ( match t with \| NeedBit ( a , b ) b -> NeedBit ( tree_compress a , tree_compress b ) b \| _ -> assert false ) false \| d -> let size = 1 lsl d in let tbl = Array . make size ( Found ( - 1 ) 1 ) 1 in tree_walk tbl 0 0 d t ; NeedBits ( d , tbl ) tbl \| NeedBit ( a , b ) b when d > 0 -> tree_walk tbl p ( cd + 1 ) 1 ( d - 1 ) 1 a ; tree_walk tbl ( p lor ( 1 lsl cd ) cd ) cd ( cd + 1 ) 1 ( d - 1 ) 1 b ; \| t -> Array . set tbl p ( tree_compress t ) t
let make_huffman lengths pos nlengths maxbits = let counts = Array . make maxbits 0 in for i = 0 to nlengths - 1 do let p = Array . unsafe_get lengths ( i + pos ) pos in if p >= maxbits then error Invalid_huffman ; Array . unsafe_set counts p ( Array . unsafe_get counts p + 1 ) 1 ; done ; let code = ref 0 in let tmp = Array . make maxbits 0 in for i = 1 to maxbits - 2 do code := ( ! code + Array . unsafe_get counts i ) i lsl 1 ; Array . unsafe_set tmp i ! code ; done ; let bits = Hashtbl . create 0 in for i = 0 to nlengths - 1 do let l = Array . unsafe_get lengths ( i + pos ) pos in if l <> 0 then begin let n = Array . unsafe_get tmp ( l - 1 ) 1 in Array . unsafe_set tmp ( l - 1 ) 1 ( n + 1 ) 1 ; Hashtbl . add bits ( n , l ) l i ; end ; done ; let rec tree_make v l = if l > maxbits then error Invalid_huffman ; try Found ( Hashtbl . find bits ( v , l ) l ) l with Not_found -> NeedBit ( tree_make ( v lsl 1 ) 1 ( l + 1 ) 1 , tree_make ( v lsl 1 lor 1 ) 1 ( l + 1 ) 1 ) 1 in tree_compress ( NeedBit ( tree_make 0 1 , tree_make 1 1 ) 1 ) 1
let adler32_create ( adler32_create ) adler32_create = { a1 = 1 ; a2 = 0 ; }
let adler32_update a s p l = let p = ref p in for i = 0 to l - 1 do let c = int_of_char ( Bytes . unsafe_get s ! p ) p in a . a1 <- ( a . a1 + c ) c mod 65521 ; a . a2 <- ( a . a2 + a . a1 ) a1 mod 65521 ; incr p ; done
let adler32_read ch = let a2a = IO . read_byte ch in let a2b = IO . read_byte ch in let a1a = IO . read_byte ch in let a1b = IO . read_byte ch in { a1 = ( a1a lsl 8 ) 8 lor a1b ; a2 = ( a2a lsl 8 ) 8 lor a2b ; }
let window_size = 1 lsl 15
let buffer_size = 1 lsl 16
let window_create size = { wbuffer = Bytes . create buffer_size ; wpos = 0 ; wcrc = adler32_create ( adler32_create ) adler32_create }
let window_slide w = adler32_update w . wcrc w . wbuffer 0 window_size ; let b = Bytes . create buffer_size in w . wpos <- w . wpos - window_size ; Bytes . unsafe_blit w . wbuffer window_size b 0 w . wpos ; w . wbuffer <- b
let window_add_bytes w s p len = if w . wpos + len > buffer_size then window_slide w ; Bytes . unsafe_blit s p w . wbuffer w . wpos len ; w . wpos <- w . wpos + len
let window_add_char w c = if w . wpos = buffer_size then window_slide w ; Bytes . unsafe_set w . wbuffer w . wpos c ; w . wpos <- w . wpos + 1
let window_get_last_char w = Bytes . unsafe_get w . wbuffer ( w . wpos - 1 ) 1
let window_available w = w . wpos
let window_checksum w = adler32_update w . wcrc w . wbuffer 0 w . wpos ; w . wcrc
let fixed_huffman = make_huffman ( Array . init 288 ( fun n -> if n <= 143 then 8 else if n <= 255 then 9 else if n <= 279 then 7 else 8 ) ) 0 288 10
let get_bits z n = while z . znbits < n do z . zbits <- z . zbits lor ( ( IO . read_byte z . zinput ) zinput lsl z . znbits ) znbits ; z . znbits <- z . znbits + 8 ; done ; let b = z . zbits land ( 1 lsl n - 1 ) 1 in z . znbits <- z . znbits - n ; z . zbits <- z . zbits lsr n ; b
let get_bit z = if z . znbits = 0 then begin z . znbits <- 8 ; z . zbits <- IO . read_byte z . zinput ; end ; let b = z . zbits land 1 = 1 in z . znbits <- z . znbits - 1 ; z . zbits <- z . zbits lsr 1 ; b
let rec get_rev_bits z n = if n = 0 then 0 else if get_bit z then ( 1 lsl ( n - 1 ) 1 ) 1 lor ( get_rev_bits z ( n - 1 ) 1 ) 1 else get_rev_bits z ( n - 1 ) 1
let reset_bits z = z . zbits <- 0 ; z . znbits <- 0
let add_bytes z s p l = window_add_bytes z . zwindow s p l ; Bytes . unsafe_blit s p z . zoutput z . zoutpos l ; z . zneeded <- z . zneeded - l ; z . zoutpos <- z . zoutpos + l
let add_char z c = window_add_char z . zwindow c ; Bytes . unsafe_set z . zoutput z . zoutpos c ; z . zneeded <- z . zneeded - 1 ; z . zoutpos <- z . zoutpos + 1
let add_dist_one z n = let c = window_get_last_char z . zwindow in let s = Bytes . make n c in add_bytes z s 0 n
let add_dist z d l = add_bytes z z . zwindow . wbuffer ( z . zwindow . wpos - d ) d l
let rec apply_huffman z = function \| Found n -> n \| NeedBit ( a , b ) b -> apply_huffman z ( if get_bit z then b else a ) a \| NeedBits ( n , t ) t -> apply_huffman z ( Array . unsafe_get t ( get_bits z n ) n ) n
let inflate_lengths z a max = let i = ref 0 in let prev = ref 0 in while ! i < max do match apply_huffman z z . zhuffman with \| n when n <= 15 -> prev := n ; Array . unsafe_set a ! i n ; incr i \| 16 -> let n = 3 + get_bits z 2 in if ! i + n > max then error Invalid_data ; for k = 0 to n - 1 do Array . unsafe_set a ! i ! prev ; incr i ; done ; \| 17 -> let n = 3 + get_bits z 3 in i := ! i + n ; if ! i > max then error Invalid_data ; \| 18 -> let n = 11 + get_bits z 7 in i := ! i + n ; if ! i > max then error Invalid_data ; \| _ -> error Invalid_data done
let rec inflate_loop z = match z . zstate with \| Head -> let cmf = IO . read_byte z . zinput in let cm = cmf land 15 in let cinfo = cmf lsr 4 in if cm <> 8 \|\| cinfo <> 7 then error Invalid_data ; let flg = IO . read_byte z . zinput in let fdict = flg land 32 <> 0 in if ( cmf lsl 8 + flg ) flg mod 31 <> 0 then error Invalid_data ; if fdict then error Unsupported_dictionary ; z . zstate <- Block ; inflate_loop z \| Crc -> let calc = window_checksum z . zwindow in let crc = adler32_read z . zinput in if calc <> crc then error Invalid_crc ; z . zstate <- Done ; inflate_loop z \| Done -> ( ) \| Block -> z . zfinal <- get_bit z ; let btype = get_bits z 2 in ( match btype with \| 0 -> z . zlen <- IO . read_ui16 z . zinput ; let nlen = IO . read_ui16 z . zinput in if nlen <> 0xffff - z . zlen then error Invalid_data ; z . zstate <- Flat ; inflate_loop z ; reset_bits z \| 1 -> z . zhuffman <- fixed_huffman ; z . zhuffdist <- None ; z . zstate <- CData ; inflate_loop z \| 2 -> let hlit = get_bits z 5 + 257 in let hdist = get_bits z 5 + 1 in let hclen = get_bits z 4 + 4 in for i = 0 to hclen - 1 do Array . unsafe_set z . zlengths ( Array . unsafe_get code_lengths_pos i ) i ( get_bits z 3 ) 3 ; done ; for i = hclen to 18 do Array . unsafe_set z . zlengths ( Array . unsafe_get code_lengths_pos i ) i 0 ; done ; z . zhuffman <- make_huffman z . zlengths 0 19 8 ; let lengths = Array . make ( hlit + hdist ) hdist 0 in inflate_lengths z lengths ( hlit + hdist ) hdist ; z . zhuffdist <- Some ( make_huffman lengths hlit hdist 16 ) 16 ; z . zhuffman <- make_huffman lengths 0 hlit 16 ; z . zstate <- CData ; inflate_loop z \| _ -> error Invalid_data ) Invalid_data \| Flat -> let rlen = min z . zlen z . zneeded in let str = IO . nread z . zinput rlen in let len = Bytes . length str in z . zlen <- z . zlen - len ; add_bytes z str 0 len ; if z . zlen = 0 then z . zstate <- ( if z . zfinal then Crc else Block ) Block ; if z . zneeded > 0 then inflate_loop z \| DistOne -> let len = min z . zlen z . zneeded in add_dist_one z len ; z . zlen <- z . zlen - len ; if z . zlen = 0 then z . zstate <- CData ; if z . zneeded > 0 then inflate_loop z \| Dist -> while z . zlen > 0 && z . zneeded > 0 do let len = min z . zneeded ( min z . zlen z . zdist ) zdist in add_dist z z . zdist len ; z . zlen <- z . zlen - len ; done ; if z . zlen = 0 then z . zstate <- CData ; if z . zneeded > 0 then inflate_loop z \| CData -> match apply_huffman z z . zhuffman with \| n when n < 256 -> add_char z ( Char . unsafe_chr n ) n ; if z . zneeded > 0 then inflate_loop z \| 256 -> z . zstate <- if z . zfinal then Crc else Block ; inflate_loop z \| n -> let n = n - 257 in let extra_bits = Array . unsafe_get len_extra_bits_tbl n in if extra_bits = - 1 then error Invalid_data ; z . zlen <- ( Array . unsafe_get len_base_val_tbl n ) n + ( get_bits z extra_bits ) extra_bits ; let dist_code = ( match z . zhuffdist with None -> get_rev_bits z 5 \| Some h -> apply_huffman z h ) h in let extra_bits = Array . unsafe_get dist_extra_bits_tbl dist_code in if extra_bits = - 1 then error Invalid_data ; z . zdist <- ( Array . unsafe_get dist_base_val_tbl dist_code ) dist_code + ( get_bits z extra_bits ) extra_bits ; if z . zdist > window_available z . zwindow then error Invalid_data ; z . zstate <- ( if z . zdist = 1 then DistOne else Dist ) Dist ; inflate_loop z
let inflate_data z s pos len = if pos < 0 \|\| len < 0 \|\| pos + len > Bytes . length s then invalid_arg " inflate_data " ; z . zneeded <- len ; z . zoutpos <- pos ; z . zoutput <- s ; try if len > 0 then inflate_loop z ; len - z . zneeded with IO . No_more_input -> error Truncated_data
let inflate_init ( ? header = true ) true ch = { zfinal = false ; zhuffman = fixed_huffman ; zhuffdist = None ; zlen = 0 ; zdist = 0 ; zstate = ( if header then Head else Block ) Block ; zinput = ch ; zbits = 0 ; znbits = 0 ; zneeded = 0 ; zoutput = Bytes . empty ; zoutpos = 0 ; zlengths = Array . make 19 ( - 1 ) 1 ; zwindow = window_create ( 1 lsl 15 ) 15 }
let inflate ( ? header = true ) true ch = let z = inflate_init ~ header ch in let s = Bytes . create 1 in IO . create_in ~ read ( : fun ( fun ) fun -> let l = inflate_data z s 0 1 in if l = 1 then Bytes . unsafe_get s 0 else raise IO . No_more_input ) ~ input ( : fun s p l -> let n = inflate_data z s p l in if n = 0 then raise IO . No_more_input ; n ) ~ close ( : fun ( ) -> IO . close_in ch )

let collect_references = object inherit Tast_iter . iter as super method ! expression = function | { exp_desc = Texp_ident ( _ , _ , { Types . val_loc ; _ } ) ; exp_loc } -> Hashtbl . add references val_loc exp_loc | e -> super # expression e end

let rec load_file fn = if Filename . check_suffix fn " . cmi " && Sys . file_exists ( Filename . chop_suffix fn " . cmi " ^ " . mli " ) then let open Cmi_format in List . iter ( collect_export fn ) ( read_cmi fn ) . cmi_sign else if Filename . check_suffix fn " . cmt " then let open Cmt_format in match read fn with | ( _ , Some { cmt_annots = Implementation x ; _ } ) -> collect_references # structure x | _ -> ( ) else if ( try Sys . is_directory fn with _ -> false ) then Array . iter ( fun s -> load_file ( Filename . concat fn s ) ) ( Sys . readdir fn )

let report loc = if not ( Hashtbl . mem references loc ) then Format . printf " % a : unused exported value . " @ Location . print_loc loc

let ( ) = try for i = 1 to Array . length Sys . argv - 1 do load_file Sys . argv . ( i ) done ; List . iter report ! vds with exn -> Location . report_exception Format . err_formatter exn ; exit 2

module Unused : sig type unused = int end ; ; ^^^^^^^^^^^^^^^^^

module Unused : sig end } ] |

module Unused_nonrec : sig type nonrec used = int type nonrec unused = used end ; ; ^^^^^^^^^^^^^^^^^^^^^^^^^

module Unused_nonrec : sig end } ] |

module Unused_rec : sig type unused = A of unused end ; ; ^^^^^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^

module Unused_rec : sig end } ] |

module Used_constructor : sig type t val t : t type t = T let t = T end ; ;

module Used_constructor : sig type t val t : t end } ] |

module Unused_constructor : sig type t type t = T end ; ; ^

module Unused_constructor : sig type t end } ] |

module Unused_constructor_outside_patterns : sig type t val nothing : t -> unit type t = T let nothing = function | T -> ( ) end ; ; ^

module Unused_constructor_outside_patterns : sig type t val nothing : t -> unit end } ] |

module Unused_constructor_exported_private : sig type t = private T type t = T end ; ; ^

module Unused_constructor_exported_private : sig type t = private T end } ] |

module Used_private_constructor : sig type t val nothing : t -> unit type t = private T let nothing = function | T -> ( ) end ; ;

module Used_private_constructor : sig type t val nothing : t -> unit end } ] |

module Unused_private_constructor : sig type t type t = private T end ; ; ^

module Unused_private_constructor : sig type t end } ] |

module Exported_private_constructor : sig type t = private T type t = private T end ; ;

module Exported_private_constructor : sig type t = private T end } ] |

module Used_exception : sig val e : exn exception Somebody_uses_me let e = Somebody_uses_me end ; ;

module Used_exception : sig val e : exn end } ] |

module Used_extension_constructor : sig type t val t : t type t = . . type t += Somebody_uses_me let t = Somebody_uses_me end ; ;

module Used_extension_constructor : sig type t val t : t end } ] |

module Unused_exception : sig exception Nobody_uses_me end ; ; ^^^^^^^^^^^^^^^^^^^^^^^^

module Unused_exception : sig end } ] |

module Unused_extension_constructor : sig type t = . . type t = . . type t += Nobody_uses_me end ; ; ^^^^^^^^^^^^^^

module Unused_extension_constructor : sig type t = . . end } ] |

module Unused_exception_outside_patterns : sig val falsity : exn -> bool exception Nobody_constructs_me let falsity = function | Nobody_constructs_me -> true | _ -> false end ; ; ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

module Unused_exception_outside_patterns : sig val falsity : exn -> bool end } ] |

module Unused_extension_outside_patterns : sig type t = . . val falsity : t -> bool type t = . . type t += Noone_builds_me let falsity = function | Noone_builds_me -> true | _ -> false end ; ; ^^^^^^^^^^^^^^^

module Unused_extension_outside_patterns : sig type t = . . val falsity : t -> bool end } ] |

module Unused_exception_exported_private : sig type exn += private Private_exn exception Private_exn end ; ; ^^^^^^^^^^^^^^^^^^^^^

module Unused_exception_exported_private : sig type exn += private Private_exn end } ] |

module Unused_extension_exported_private : sig type t = . . type t += private Private_ext type t = . . type t += Private_ext end ; ; ^^^^^^^^^^^

module Unused_extension_exported_private : sig type t = . . type t += private Private_ext end } ] |

module Used_private_extension : sig type t val nothing : t -> unit type t = . . type t += private Private_ext let nothing = function | Private_ext | _ -> ( ) end ; ;

module Used_private_extension : sig type t val nothing : t -> unit end } ] |

module Unused_private_extension : sig type t type t = . . type t += private Private_ext end ; ; ^^^^^^^^^^^

module Unused_private_extension : sig type t end } ] |

module Exported_private_extension : sig type t = . . type t += private Private_ext type t = . . type t += private Private_ext end ; ;

module Exported_private_extension : sig type t = . . type t += private Private_ext end } ] |

module Pr7438 : sig module type S = sig type t = private [ > ` Foo ] end module type X = sig type t = private [ > ` Foo | ` Bar ] include S with type t := t end end ; ;

module Pr7438 : sig end } ] |

module Unused_type_disable_warning : sig type t = A [ @@ warning " - 34 " ] end ; ; ^

module Unused_type_disable_warning : sig end } ] |

module Unused_constructor_disable_warning : sig type t = A [ @@ warning " - 37 " ] end ; ; ^^^^^^^^^^^^^^^^^^^^^^^^^^^^

module Unused_constructor_disable_warning : sig end } ] |

let silent v = String . length v > 0 && v . [ 0 ] = ' _ ' ; ;

let add_vars tbl ( vll1 , vll2 ) = let add_var ( v , _loc , used ) = Hashtbl . add tbl v used in List . iter add_var vll1 ; List . iter add_var vll2 ; ; ;

let rm_vars tbl ( vll1 , vll2 ) = let rm_var ( v , _ , _ ) = Hashtbl . remove tbl v in List . iter rm_var vll1 ; List . iter rm_var vll2 ; ; ;

let w_suspicious x = Warnings . Unused_var x ; ;

let w_strict x = Warnings . Unused_var_strict x ; ;

let check_rm_vars ppf tbl ( vlul_pat , vlul_as ) = let check_rm_var kind ( v , loc , used ) = if not ! used && not ( silent v ) then Location . print_warning loc ppf ( kind v ) ; Hashtbl . remove tbl v ; in List . iter ( check_rm_var w_strict ) vlul_pat ; List . iter ( check_rm_var w_suspicious ) vlul_as ; ; ;

let check_rm_let ppf tbl vlulpl = let check_rm_one flag ( v , loc , used ) = Hashtbl . remove tbl v ; flag && ( silent v || not ! used ) in let warn_var w_kind ( v , loc , used ) = if not ( silent v ) && not ! used then Location . print_warning loc ppf ( w_kind v ) in let check_rm_pat ( def , def_as ) = let def_unused = List . fold_left check_rm_one true def in let all_unused = List . fold_left check_rm_one def_unused def_as in List . iter ( warn_var ( if all_unused then w_suspicious else w_strict ) ) def ; List . iter ( warn_var w_suspicious ) def_as ; in List . iter check_rm_pat vlulpl ; ; ;

let rec get_vars ( ( vacc , asacc ) as acc ) p = match p . ppat_desc with | Ppat_any -> acc | Ppat_var v -> ( ( v , p . ppat_loc , ref false ) :: vacc , asacc ) | Ppat_alias ( pp , v ) -> get_vars ( vacc , ( ( v , p . ppat_loc , ref false ) :: asacc ) ) pp | Ppat_constant _ -> acc | Ppat_tuple pl -> List . fold_left get_vars acc pl | Ppat_construct ( _ , po , _ ) -> get_vars_option acc po | Ppat_variant ( _ , po ) -> get_vars_option acc po | Ppat_record ipl -> List . fold_left ( fun a ( _ , p ) -> get_vars a p ) acc ipl | Ppat_array pl -> List . fold_left get_vars acc pl | Ppat_or ( p1 , _p2 ) -> get_vars acc p1 | Ppat_lazy p -> get_vars acc p | Ppat_constraint ( pp , _ ) -> get_vars acc pp | Ppat_type _ -> acc match po with | Some p -> get_vars acc p | None -> acc ; ;

let get_pel_vars pel = List . map ( fun ( p , _ ) -> get_vars ( [ ] , [ ] ) p ) pel ; ;

let rec structure ppf tbl l = List . iter ( structure_item ppf tbl ) l match s . pstr_desc with | Pstr_eval e -> expression ppf tbl e ; | Pstr_value ( recflag , pel ) -> let_pel ppf tbl recflag pel None ; | Pstr_primitive _ -> ( ) | Pstr_type _ -> ( ) | Pstr_exception _ -> ( ) | Pstr_exn_rebind _ -> ( ) | Pstr_module ( _ , me ) -> module_expr ppf tbl me ; | Pstr_recmodule stml -> List . iter ( fun ( _ , _ , me ) -> module_expr ppf tbl me ) stml ; | Pstr_modtype _ -> ( ) | Pstr_open _ -> ( ) | Pstr_class cdl -> List . iter ( class_declaration ppf tbl ) cdl ; | Pstr_class_type _ -> ( ) | Pstr_include _ -> ( ) match e . pexp_desc with | Pexp_ident ( Longident . Lident id ) -> begin try ( Hashtbl . find tbl id ) := true ; with Not_found -> ( ) end ; | Pexp_ident _ -> ( ) | Pexp_constant _ -> ( ) | Pexp_let ( recflag , pel , e ) -> let_pel ppf tbl recflag pel ( Some ( fun ppf tbl -> expression ppf tbl e ) ) ; | Pexp_function ( _ , eo , pel ) -> expression_option ppf tbl eo ; match_pel ppf tbl pel ; | Pexp_apply ( e , lel ) -> expression ppf tbl e ; List . iter ( fun ( _ , e ) -> expression ppf tbl e ) lel ; | Pexp_match ( e , pel ) -> expression ppf tbl e ; match_pel ppf tbl pel ; | Pexp_try ( e , pel ) -> expression ppf tbl e ; match_pel ppf tbl pel ; | Pexp_tuple el -> List . iter ( expression ppf tbl ) el ; | Pexp_construct ( _ , eo , _ ) -> expression_option ppf tbl eo ; | Pexp_variant ( _ , eo ) -> expression_option ppf tbl eo ; | Pexp_record ( iel , eo ) -> List . iter ( fun ( _ , e ) -> expression ppf tbl e ) iel ; expression_option ppf tbl eo ; | Pexp_field ( e , _ ) -> expression ppf tbl e ; | Pexp_setfield ( e1 , _ , e2 ) -> expression ppf tbl e1 ; expression ppf tbl e2 ; | Pexp_array el -> List . iter ( expression ppf tbl ) el ; | Pexp_ifthenelse ( e1 , e2 , eo ) -> expression ppf tbl e1 ; expression ppf tbl e2 ; expression_option ppf tbl eo ; | Pexp_sequence ( e1 , e2 ) -> expression ppf tbl e1 ; expression ppf tbl e2 ; | Pexp_while ( e1 , e2 ) -> expression ppf tbl e1 ; expression ppf tbl e2 ; | Pexp_for ( id , e1 , e2 , _ , e3 ) -> expression ppf tbl e1 ; expression ppf tbl e2 ; let defined = ( [ ( id , e . pexp_loc , ref true ) ] , [ ] ) in add_vars tbl defined ; expression ppf tbl e3 ; check_rm_vars ppf tbl defined ; | Pexp_constraint ( e , _ , _ ) -> expression ppf tbl e ; | Pexp_when ( e1 , e2 ) -> expression ppf tbl e1 ; expression ppf tbl e2 ; | Pexp_send ( e , _ ) -> expression ppf tbl e ; | Pexp_new _ -> ( ) | Pexp_setinstvar ( _ , e ) -> expression ppf tbl e ; | Pexp_override sel -> List . iter ( fun ( _ , e ) -> expression ppf tbl e ) sel ; | Pexp_letmodule ( _ , me , e ) -> module_expr ppf tbl me ; expression ppf tbl e ; | Pexp_assert e -> expression ppf tbl e ; | Pexp_assertfalse -> ( ) | Pexp_lazy e -> expression ppf tbl e ; | Pexp_poly ( e , _ ) -> expression ppf tbl e ; | Pexp_object cs -> class_structure ppf tbl cs ; match eo with | Some e -> expression ppf tbl e ; | None -> ( ) match recflag with | Asttypes . Recursive -> let defined = get_pel_vars pel in List . iter ( add_vars tbl ) defined ; List . iter ( fun ( _ , e ) -> expression ppf tbl e ) pel ; begin match body with | None -> List . iter ( rm_vars tbl ) defined ; | Some f -> f ppf tbl ; check_rm_let ppf tbl defined ; end ; | _ -> List . iter ( fun ( _ , e ) -> expression ppf tbl e ) pel ; begin match body with | None -> ( ) | Some f -> let defined = get_pel_vars pel in List . iter ( add_vars tbl ) defined ; f ppf tbl ; check_rm_let ppf tbl defined ; end ; List . iter ( match_pe ppf tbl ) pel let defined = get_vars ( [ ] , [ ] ) p in add_vars tbl defined ; expression ppf tbl e ; check_rm_vars ppf tbl defined ; match me . pmod_desc with | Pmod_ident _ -> ( ) | Pmod_structure s -> structure ppf tbl s | Pmod_functor ( _ , _ , me ) -> module_expr ppf tbl me | Pmod_apply ( me1 , me2 ) -> module_expr ppf tbl me1 ; module_expr ppf tbl me2 ; | Pmod_constraint ( me , _ ) -> module_expr ppf tbl me match ce . pcl_desc with | Pcl_constr _ -> ( ) | Pcl_structure cs -> class_structure ppf tbl cs ; | Pcl_fun ( _ , _ , _ , ce ) -> class_expr ppf tbl ce ; | Pcl_apply ( ce , lel ) -> class_expr ppf tbl ce ; List . iter ( fun ( _ , e ) -> expression ppf tbl e ) lel ; | Pcl_let ( recflag , pel , ce ) -> let_pel ppf tbl recflag pel ( Some ( fun ppf tbl -> class_expr ppf tbl ce ) ) ; | Pcl_constraint ( ce , _ ) -> class_expr ppf tbl ce ; let defined = get_vars ( [ ] , [ ] ) p in add_vars tbl defined ; List . iter ( class_field ppf tbl ) cfl ; check_rm_vars ppf tbl defined ; match cf with | Pcf_inher ( ce , _ ) -> class_expr ppf tbl ce ; | Pcf_val ( _ , _ , e , _ ) -> expression ppf tbl e ; | Pcf_virt _ | Pcf_valvirt _ -> ( ) | Pcf_meth ( _ , _ , e , _ ) -> expression ppf tbl e ; | Pcf_cstr _ -> ( ) | Pcf_let ( recflag , pel , _ ) -> let_pel ppf tbl recflag pel None ; | Pcf_init e -> expression ppf tbl e ; ; ;

let warn ppf ast = if Warnings . is_active ( w_suspicious " " ) || Warnings . is_active ( w_strict " " ) then begin let tbl = Hashtbl . create 97 in structure ppf tbl ast ; end ; ast ; ;

type huffman = | Found of int | NeedBit of huffman * huffman | NeedBits of int * huffman array

type adler32 = { mutable a1 : int ; mutable a2 : int ; }

type window = { mutable wbuffer : Bytes . t ; mutable wpos : int ; wcrc : adler32 ; }

type t = { mutable znbits : int ; mutable zbits : int ; mutable zstate : state ; mutable zfinal : bool ; mutable zhuffman : huffman ; mutable zhuffdist : huffman option ; mutable zlen : int ; mutable zdist : int ; mutable zneeded : int ; mutable zoutput : Bytes . t ; mutable zoutpos : int ; zinput : IO . input ; zlengths : int array ; zwindow : window ; }

let error msg = raise ( Error msg ) msg

let rec tree_depth = function | Found _ -> 0 | NeedBits _ -> assert false | NeedBit ( a , b ) b -> 1 + min ( tree_depth a ) a ( tree_depth b ) b

let rec tree_compress t = match tree_depth t with | 0 -> t | 1 -> ( match t with | NeedBit ( a , b ) b -> NeedBit ( tree_compress a , tree_compress b ) b | _ -> assert false ) false | d -> let size = 1 lsl d in let tbl = Array . make size ( Found ( - 1 ) 1 ) 1 in tree_walk tbl 0 0 d t ; NeedBits ( d , tbl ) tbl | NeedBit ( a , b ) b when d > 0 -> tree_walk tbl p ( cd + 1 ) 1 ( d - 1 ) 1 a ; tree_walk tbl ( p lor ( 1 lsl cd ) cd ) cd ( cd + 1 ) 1 ( d - 1 ) 1 b ; | t -> Array . set tbl p ( tree_compress t ) t

let make_huffman lengths pos nlengths maxbits = let counts = Array . make maxbits 0 in for i = 0 to nlengths - 1 do let p = Array . unsafe_get lengths ( i + pos ) pos in if p >= maxbits then error Invalid_huffman ; Array . unsafe_set counts p ( Array . unsafe_get counts p + 1 ) 1 ; done ; let code = ref 0 in let tmp = Array . make maxbits 0 in for i = 1 to maxbits - 2 do code := ( ! code + Array . unsafe_get counts i ) i lsl 1 ; Array . unsafe_set tmp i ! code ; done ; let bits = Hashtbl . create 0 in for i = 0 to nlengths - 1 do let l = Array . unsafe_get lengths ( i + pos ) pos in if l <> 0 then begin let n = Array . unsafe_get tmp ( l - 1 ) 1 in Array . unsafe_set tmp ( l - 1 ) 1 ( n + 1 ) 1 ; Hashtbl . add bits ( n , l ) l i ; end ; done ; let rec tree_make v l = if l > maxbits then error Invalid_huffman ; try Found ( Hashtbl . find bits ( v , l ) l ) l with Not_found -> NeedBit ( tree_make ( v lsl 1 ) 1 ( l + 1 ) 1 , tree_make ( v lsl 1 lor 1 ) 1 ( l + 1 ) 1 ) 1 in tree_compress ( NeedBit ( tree_make 0 1 , tree_make 1 1 ) 1 ) 1

let adler32_create ( adler32_create ) adler32_create = { a1 = 1 ; a2 = 0 ; }

let adler32_update a s p l = let p = ref p in for i = 0 to l - 1 do let c = int_of_char ( Bytes . unsafe_get s ! p ) p in a . a1 <- ( a . a1 + c ) c mod 65521 ; a . a2 <- ( a . a2 + a . a1 ) a1 mod 65521 ; incr p ; done

let adler32_read ch = let a2a = IO . read_byte ch in let a2b = IO . read_byte ch in let a1a = IO . read_byte ch in let a1b = IO . read_byte ch in { a1 = ( a1a lsl 8 ) 8 lor a1b ; a2 = ( a2a lsl 8 ) 8 lor a2b ; }

let window_size = 1 lsl 15

let buffer_size = 1 lsl 16

let window_create size = { wbuffer = Bytes . create buffer_size ; wpos = 0 ; wcrc = adler32_create ( adler32_create ) adler32_create }

let window_slide w = adler32_update w . wcrc w . wbuffer 0 window_size ; let b = Bytes . create buffer_size in w . wpos <- w . wpos - window_size ; Bytes . unsafe_blit w . wbuffer window_size b 0 w . wpos ; w . wbuffer <- b

let window_add_bytes w s p len = if w . wpos + len > buffer_size then window_slide w ; Bytes . unsafe_blit s p w . wbuffer w . wpos len ; w . wpos <- w . wpos + len

let window_add_char w c = if w . wpos = buffer_size then window_slide w ; Bytes . unsafe_set w . wbuffer w . wpos c ; w . wpos <- w . wpos + 1

let window_get_last_char w = Bytes . unsafe_get w . wbuffer ( w . wpos - 1 ) 1

let window_available w = w . wpos

let window_checksum w = adler32_update w . wcrc w . wbuffer 0 w . wpos ; w . wcrc

let fixed_huffman = make_huffman ( Array . init 288 ( fun n -> if n <= 143 then 8 else if n <= 255 then 9 else if n <= 279 then 7 else 8 ) ) 0 288 10

let get_bits z n = while z . znbits < n do z . zbits <- z . zbits lor ( ( IO . read_byte z . zinput ) zinput lsl z . znbits ) znbits ; z . znbits <- z . znbits + 8 ; done ; let b = z . zbits land ( 1 lsl n - 1 ) 1 in z . znbits <- z . znbits - n ; z . zbits <- z . zbits lsr n ; b

let get_bit z = if z . znbits = 0 then begin z . znbits <- 8 ; z . zbits <- IO . read_byte z . zinput ; end ; let b = z . zbits land 1 = 1 in z . znbits <- z . znbits - 1 ; z . zbits <- z . zbits lsr 1 ; b

let rec get_rev_bits z n = if n = 0 then 0 else if get_bit z then ( 1 lsl ( n - 1 ) 1 ) 1 lor ( get_rev_bits z ( n - 1 ) 1 ) 1 else get_rev_bits z ( n - 1 ) 1

let reset_bits z = z . zbits <- 0 ; z . znbits <- 0

let add_bytes z s p l = window_add_bytes z . zwindow s p l ; Bytes . unsafe_blit s p z . zoutput z . zoutpos l ; z . zneeded <- z . zneeded - l ; z . zoutpos <- z . zoutpos + l

let add_char z c = window_add_char z . zwindow c ; Bytes . unsafe_set z . zoutput z . zoutpos c ; z . zneeded <- z . zneeded - 1 ; z . zoutpos <- z . zoutpos + 1

let add_dist_one z n = let c = window_get_last_char z . zwindow in let s = Bytes . make n c in add_bytes z s 0 n

let add_dist z d l = add_bytes z z . zwindow . wbuffer ( z . zwindow . wpos - d ) d l

let rec apply_huffman z = function | Found n -> n | NeedBit ( a , b ) b -> apply_huffman z ( if get_bit z then b else a ) a | NeedBits ( n , t ) t -> apply_huffman z ( Array . unsafe_get t ( get_bits z n ) n ) n

let inflate_lengths z a max = let i = ref 0 in let prev = ref 0 in while ! i < max do match apply_huffman z z . zhuffman with | n when n <= 15 -> prev := n ; Array . unsafe_set a ! i n ; incr i | 16 -> let n = 3 + get_bits z 2 in if ! i + n > max then error Invalid_data ; for k = 0 to n - 1 do Array . unsafe_set a ! i ! prev ; incr i ; done ; | 17 -> let n = 3 + get_bits z 3 in i := ! i + n ; if ! i > max then error Invalid_data ; | 18 -> let n = 11 + get_bits z 7 in i := ! i + n ; if ! i > max then error Invalid_data ; | _ -> error Invalid_data done

let rec inflate_loop z = match z . zstate with | Head -> let cmf = IO . read_byte z . zinput in let cm = cmf land 15 in let cinfo = cmf lsr 4 in if cm <> 8 || cinfo <> 7 then error Invalid_data ; let flg = IO . read_byte z . zinput in let fdict = flg land 32 <> 0 in if ( cmf lsl 8 + flg ) flg mod 31 <> 0 then error Invalid_data ; if fdict then error Unsupported_dictionary ; z . zstate <- Block ; inflate_loop z | Crc -> let calc = window_checksum z . zwindow in let crc = adler32_read z . zinput in if calc <> crc then error Invalid_crc ; z . zstate <- Done ; inflate_loop z | Done -> ( ) | Block -> z . zfinal <- get_bit z ; let btype = get_bits z 2 in ( match btype with | 0 -> z . zlen <- IO . read_ui16 z . zinput ; let nlen = IO . read_ui16 z . zinput in if nlen <> 0xffff - z . zlen then error Invalid_data ; z . zstate <- Flat ; inflate_loop z ; reset_bits z | 1 -> z . zhuffman <- fixed_huffman ; z . zhuffdist <- None ; z . zstate <- CData ; inflate_loop z | 2 -> let hlit = get_bits z 5 + 257 in let hdist = get_bits z 5 + 1 in let hclen = get_bits z 4 + 4 in for i = 0 to hclen - 1 do Array . unsafe_set z . zlengths ( Array . unsafe_get code_lengths_pos i ) i ( get_bits z 3 ) 3 ; done ; for i = hclen to 18 do Array . unsafe_set z . zlengths ( Array . unsafe_get code_lengths_pos i ) i 0 ; done ; z . zhuffman <- make_huffman z . zlengths 0 19 8 ; let lengths = Array . make ( hlit + hdist ) hdist 0 in inflate_lengths z lengths ( hlit + hdist ) hdist ; z . zhuffdist <- Some ( make_huffman lengths hlit hdist 16 ) 16 ; z . zhuffman <- make_huffman lengths 0 hlit 16 ; z . zstate <- CData ; inflate_loop z | _ -> error Invalid_data ) Invalid_data | Flat -> let rlen = min z . zlen z . zneeded in let str = IO . nread z . zinput rlen in let len = Bytes . length str in z . zlen <- z . zlen - len ; add_bytes z str 0 len ; if z . zlen = 0 then z . zstate <- ( if z . zfinal then Crc else Block ) Block ; if z . zneeded > 0 then inflate_loop z | DistOne -> let len = min z . zlen z . zneeded in add_dist_one z len ; z . zlen <- z . zlen - len ; if z . zlen = 0 then z . zstate <- CData ; if z . zneeded > 0 then inflate_loop z | Dist -> while z . zlen > 0 && z . zneeded > 0 do let len = min z . zneeded ( min z . zlen z . zdist ) zdist in add_dist z z . zdist len ; z . zlen <- z . zlen - len ; done ; if z . zlen = 0 then z . zstate <- CData ; if z . zneeded > 0 then inflate_loop z | CData -> match apply_huffman z z . zhuffman with | n when n < 256 -> add_char z ( Char . unsafe_chr n ) n ; if z . zneeded > 0 then inflate_loop z | 256 -> z . zstate <- if z . zfinal then Crc else Block ; inflate_loop z | n -> let n = n - 257 in let extra_bits = Array . unsafe_get len_extra_bits_tbl n in if extra_bits = - 1 then error Invalid_data ; z . zlen <- ( Array . unsafe_get len_base_val_tbl n ) n + ( get_bits z extra_bits ) extra_bits ; let dist_code = ( match z . zhuffdist with None -> get_rev_bits z 5 | Some h -> apply_huffman z h ) h in let extra_bits = Array . unsafe_get dist_extra_bits_tbl dist_code in if extra_bits = - 1 then error Invalid_data ; z . zdist <- ( Array . unsafe_get dist_base_val_tbl dist_code ) dist_code + ( get_bits z extra_bits ) extra_bits ; if z . zdist > window_available z . zwindow then error Invalid_data ; z . zstate <- ( if z . zdist = 1 then DistOne else Dist ) Dist ; inflate_loop z

let inflate_data z s pos len = if pos < 0 || len < 0 || pos + len > Bytes . length s then invalid_arg " inflate_data " ; z . zneeded <- len ; z . zoutpos <- pos ; z . zoutput <- s ; try if len > 0 then inflate_loop z ; len - z . zneeded with IO . No_more_input -> error Truncated_data

let inflate_init ( ? header = true ) true ch = { zfinal = false ; zhuffman = fixed_huffman ; zhuffdist = None ; zlen = 0 ; zdist = 0 ; zstate = ( if header then Head else Block ) Block ; zinput = ch ; zbits = 0 ; znbits = 0 ; zneeded = 0 ; zoutput = Bytes . empty ; zoutpos = 0 ; zlengths = Array . make 19 ( - 1 ) 1 ; zwindow = window_create ( 1 lsl 15 ) 15 }

let inflate ( ? header = true ) true ch = let z = inflate_init ~ header ch in let s = Bytes . create 1 in IO . create_in ~ read ( : fun ( fun ) fun -> let l = inflate_data z s 0 1 in if l = 1 then Bytes . unsafe_get s 0 else raise IO . No_more_input ) ~ input ( : fun s p l -> let n = inflate_data z s p l in if n = 0 then raise IO . No_more_input ; n ) ~ close ( : fun ( ) -> IO . close_in ch )