text stringlengths 0 601k |
|---|
module OCaml_refs = struct let parse sourcefile = Pparse . parse_implementation ~ tool_name " : manual_cross_reference_check " sourcefile let manual_reference_attribute attr = let open Parsetree in if attr . attr_name . Location . txt <> " manual . ref " then None else begin match attr . attr_payload with | PStr [ { ps... |
let usage = " cross - reference - check - auxfile [ file . aux ] file_1 . . . file_n checks that \ the cross reference annotated with [ @ manual_cross_reference ] are consistent \ with the provided auxiliary TeX file " |
let aux_file = ref None |
let args = [ " - auxfile " , Arg . String ( fun s -> aux_file := Some s ) , " set the reference file " ] |
let ( ) = let m = ref Refs . empty in Arg . parse args ( OCaml_refs . from_file m ) usage ; match ! aux_file with | None -> print_error No_aux_file ; exit 2 | Some aux -> let error = TeX . check_all aux ! m in if error then exit 2 else exit 0 |
match op with | Iconst_float _ | Inegf | Iabsf | Iaddf | Isubf | Imulf | Idivf | Iintoffloat | Ifloatofint | Iload ( ( Single | Double ) , _ , _ ) -> Op_other | Ispecific ( Ilea _ ) -> Op_pure | Ispecific ( Istore_int ( _ , _ , is_asg ) ) -> Op_store is_asg | Ispecific ( Istore_symbol ( _ , _ , is_asg ) ) -> Op_store i... |
let fundecl f = ( new cse ) # fundecl f |
type op_class = | Op_pure | Op_checkbound | Op_load of Asttypes . mutable_flag | Op_store of bool | Op_other |
type rhs = operation * valnum array |
module Equations = struct module Rhs_map = Map . Make ( struct type t = rhs let compare = Stdlib . compare end ) type ' a t = { mutable_load_equations : ' a Rhs_map . t ; other_equations : ' a Rhs_map . t } let empty = { mutable_load_equations = Rhs_map . empty ; other_equations = Rhs_map . empty } let add op_class op ... |
type numbering = { num_next : int ; num_eqs : valnum array Equations . t ; num_reg : valnum Reg . Map . t } |
let empty_numbering = { num_next = 0 ; num_eqs = Equations . empty ; num_reg = Reg . Map . empty } |
let fresh_valnum_reg n r = let v = n . num_next in ( { n with num_next = v + 1 ; num_reg = Reg . Map . add r v n . num_reg } , v ) |
let array_fold_transf ( f : numbering -> ' a -> numbering * ' b ) n ( a : ' a array ) : numbering * ' b array = match Array . length a with | 0 -> ( n , [ ] ) || | 1 -> let ( n ' , b ) = f n a . ( 0 ) in ( n ' , [ | b ] ) | | l -> let b = Array . make l 0 and n = ref n in for i = 0 to l - 1 do let ( n ' , x ) = f ! n a... |
let fresh_valnum_regs n rs = array_fold_transf fresh_valnum_reg n rs |
let valnum_reg n r = try ( n , Reg . Map . find r n . num_reg ) with Not_found -> fresh_valnum_reg n r |
let valnum_regs n rs = array_fold_transf valnum_reg n rs |
let find_equation op_class n rhs = try Some ( Equations . find op_class rhs n . num_eqs ) with Not_found -> None |
let find_reg_containing n v = Reg . Map . fold ( fun r v ' res -> if v ' = v then Some r else res ) n . num_reg None |
let find_regs_containing n vs = match Array . length vs with | 0 -> Some [ ] || | 1 -> begin match find_reg_containing n vs . ( 0 ) with | None -> None | Some r -> Some [ | r ] | end | l -> let rs = Array . make l Reg . dummy in begin try for i = 0 to l - 1 do match find_reg_containing n vs . ( i ) with | None -> raise... |
let set_known_reg n r v = { n with num_reg = Reg . Map . add r v n . num_reg } |
let array_fold2 f n a1 a2 = let l = Array . length a1 in assert ( l = Array . length a2 ) ; let n = ref n in for i = 0 to l - 1 do n := f ! n a1 . ( i ) a2 . ( i ) done ; ! n |
let set_known_regs n rs vs = array_fold2 set_known_reg n rs vs |
let set_move n src dst = let ( n1 , v ) = valnum_reg n src in { n1 with num_reg = Reg . Map . add dst v n1 . num_reg } |
let set_fresh_regs n rs rhs op_class = let ( n1 , vs ) = fresh_valnum_regs n rs in { n1 with num_eqs = Equations . add op_class rhs vs n . num_eqs } |
let set_unknown_regs n rs = { n with num_reg = Array . fold_right Reg . Map . remove rs n . num_reg } |
let remove_mutable_load_numbering n = { n with num_eqs = Equations . remove_mutable_loads n . num_eqs } |
let kill_addr_regs n = { n with num_reg = Reg . Map . filter ( fun r _n -> r . Reg . typ <> Cmm . Addr ) n . num_reg } |
let insert_single_move i src dst = instr_cons ( Iop Imove ) [ | src ] | [ | dst ] | i |
let insert_move srcs dsts i = match Array . length srcs with | 0 -> i | 1 -> instr_cons ( Iop Imove ) srcs dsts i | _ -> let tmps = Reg . createv_like srcs in let i1 = array_fold2 insert_single_move i tmps dsts in array_fold2 insert_single_move i1 srcs tmps match op with | Imove | Ispill | Ireload -> assert false | Ico... |
type t = ( int * int ) list |
let is_empty = function | [ ] -> true | _ -> false |
let singleton c = [ c , c ] |
let interval c1 c2 = if c1 <= c2 then [ c1 , c2 ] else [ c2 , c1 ] |
let rec union s1 s2 = match s1 , s2 with if c1 > c2 then union s2 s1 else begin if d1 + 1 < c2 then p1 :: union r1 s2 else if d1 < d2 then union ( ( c1 , d2 ) :: r2 ) r1 else union s1 r2 end |
let rec inter l l ' = match l , l ' with _ , [ ] -> [ ] | [ ] , _ -> [ ] | ( c1 , c2 ) :: r , ( c1 ' , c2 ' ) :: r ' -> if c2 < c1 ' then inter r l ' else if c2 ' < c1 then inter l r ' else if c2 < c2 ' then ( max c1 c1 ' , c2 ) :: inter r l ' else ( max c1 c1 ' , c2 ' ) :: inter l r ' |
let rec diff l l ' = match l , l ' with _ , [ ] -> l | [ ] , _ -> [ ] | ( c1 , c2 ) :: r , ( c1 ' , c2 ' ) :: r ' -> if c2 < c1 ' then ( c1 , c2 ) :: diff r l ' else if c2 ' < c1 then diff l r ' else let r ' ' = if c2 ' < c2 then ( c2 ' + 1 , c2 ) :: r else r in if c1 < c1 ' then ( c1 , c1 ' - 1 ) :: diff r ' ' r ' els... |
let eof = singleton 256 |
let complement s = diff all_chars s |
let env_to_array env = match env with let res = Array . make 257 x in List . iter ( fun ( c , y ) -> List . iter ( fun ( i , j ) -> for k = i to j do res . ( k ) <- y done ) c ) rem ; res |
let null : json = ` Null |
let set ( ctx : json ) ( lbl : string ) ( v : json ) : json = begin match ctx with | ` Null -> ` Assoc [ lbl , v ] | ` Assoc l -> ` Assoc ( ( lbl , v ) :: ( List . remove_assoc lbl l ) ) | _ -> raise ( Failure " Unable to add a property to a non - object value " ) end |
let take ( ctx : json ) ( lbl : string ) : json * json option = begin match ctx with | ` Assoc l -> begin try let v = List . assoc lbl l in ` Assoc ( List . remove_assoc lbl l ) , Some v with Not_found -> ctx , None end | _ -> ctx , None end |
let get ( ctx : json ) ( lbl : string ) : json option = begin match Yojson . Basic . Util . member lbl ctx with | ` Null -> None | x -> Some x end |
let set_skip_user_input ( ctx : json ) ( b : bool ) : json = set ctx " skip_user_input " ( ` Bool b ) |
let take_skip_user_input ( ctx : json ) : json * bool = begin match take ctx " skip_user_input " with | ctx , Some ( ` Bool b ) -> ctx , b | _ -> ctx , false end |
let set_call ( ctx : json ) ( c : call ) : json = set ctx " call " ( Yojson . Basic . from_string ( Call_j . string_of_call c ) ) |
let take_call ( ctx : json ) : json * call option = begin match take ctx " call " with | ctx ' , Some c -> begin try ctx ' , Some ( Call_j . call_of_string ( Yojson . Basic . to_string c ) ) with _ -> Format . eprintf " [ WARNING ] illed formed call :\ n % s . " @ ( Yojson . Basic . pretty_to_string c ) ; ctx , None en... |
let set_return ( ctx : json ) ( x : json ) : json = set ctx " return " x |
let get_return ( ctx : json ) : json option = get ctx " return " |
let set_rule ( ctx : json ) ( lbl : string ) ( rule : cnl_rule ) : json = set ctx lbl ( json_of_rule rule ) |
let get_rule ( ctx : json ) ( lbl : string ) : cnl_rule option = begin match Yojson . Basic . Util . member lbl ctx with | ` Null -> None | rule -> begin match Cnl_t . cnl_rule_of_yojson ( rule :> Yojson . Safe . json ) with | Deriving_intf . Error _ -> None | Deriving_intf . Ok x -> Some x end end |
let set_expr ( ctx : json ) ( lbl : string ) ( expr : cnl_expr ) : json = set ctx lbl ( json_of_expr expr ) |
let get_expr ( ctx : json ) ( lbl : string ) : cnl_expr option = begin match Yojson . Basic . Util . member lbl ctx with | ` Null -> None | expr -> begin match Cnl_t . cnl_expr_of_yojson ( expr :> Yojson . Safe . json ) with | Deriving_intf . Error _ -> None | Deriving_intf . Ok x -> Some x end end |
let set_evnt_desc ( ctx : json ) ( lbl : string ) ( desc : cnl_evnt_desc ) : json = set ctx lbl ( json_of_evnt_desc desc ) |
let get_evnt_desc ( ctx : json ) ( lbl : string ) : cnl_evnt_desc option = begin match Yojson . Basic . Util . member lbl ctx with | ` Null -> None | desc -> begin match Cnl_t . cnl_evnt_desc_of_yojson ( desc :> Yojson . Safe . json ) with | Deriving_intf . Error _ -> None | Deriving_intf . Ok x -> Some x end end |
let set_cond_desc ( ctx : json ) ( lbl : string ) ( desc : cnl_cond_desc ) : json = set ctx lbl ( json_of_cond_desc desc ) |
let get_cond_desc ( ctx : json ) ( lbl : string ) : cnl_cond_desc option = begin match Yojson . Basic . Util . member lbl ctx with | ` Null -> None | desc -> begin match Cnl_t . cnl_cond_desc_of_yojson ( desc :> Yojson . Safe . json ) with | Deriving_intf . Error _ -> None | Deriving_intf . Ok x -> Some x end end |
let set_actns_desc ( ctx : json ) ( lbl : string ) ( desc : cnl_actns_desc ) : json = set ctx lbl ( json_of_actns_desc desc ) |
let get_actns_desc ( ctx : json ) ( lbl : string ) : cnl_actns_desc option = begin match Yojson . Basic . Util . member lbl ctx with | ` Null -> None | desc -> begin match Cnl_t . cnl_actns_desc_of_yojson ( desc :> Yojson . Safe . json ) with | Deriving_intf . Error _ -> None | Deriving_intf . Ok x -> Some x end end |
let set_actn_desc ( ctx : json ) ( lbl : string ) ( desc : cnl_actn_desc ) : json = set ctx lbl ( json_of_actn_desc desc ) |
let get_actn_desc ( ctx : json ) ( lbl : string ) : cnl_actn_desc option = begin match Yojson . Basic . Util . member lbl ctx with | ` Null -> None | desc -> begin match Cnl_t . cnl_actn_desc_of_yojson ( desc :> Yojson . Safe . json ) with | Deriving_intf . Error _ -> None | Deriving_intf . Ok x -> Some x end end |
let set_bool ( ctx : json ) ( lbl : string ) ( b : bool ) : json = set ctx lbl ( ` Bool b ) |
let get_bool ( ctx : json ) ( lbl : string ) : bool option = begin match Yojson . Basic . Util . member lbl ctx with | ` Bool b -> Some b | _ -> None end |
let set_string ( ctx : json ) ( lbl : string ) ( s : string ) : json = set ctx lbl ( ` String s ) |
let get_string ( ctx : json ) ( lbl : string ) : string option = begin match Yojson . Basic . Util . member lbl ctx with | ` String s -> Some s | _ -> None end |
let take_string ( ctx : json ) ( lbl : string ) : json * string option = begin match take ctx lbl with | ctx , Some ( ` String s ) -> ctx , Some s | ctx , _ -> ctx , None end |
let set_dispatch ( ctx : json ) ( lbl : string ) ( d : string dispatch ) : json = set ctx lbl ( Yojson . Safe . to_basic ( Dialog_util . string_dispatch_to_yojson d ) ) |
let get_dispatch ( ctx : json ) ( lbl : string ) : int dispatch option = begin match Yojson . Basic . Util . member lbl ctx with | ` Null -> None | desc -> begin try begin match Dialog_util . int_dispatch_of_yojson ( desc :> Json_t . safe ) with | Deriving_intf . Ok x -> Some x | Deriving_intf . Error _ -> None end wit... |
let build_cnl kind focus prompt = begin match kind with | K_expr ( Some ( ename , fname ) ) -> ` Assoc [ " kind " , ` String ( Cnl_print . cnl_print_kind kind ) ; " entity " , ` String ename ; " field " , ` String fname ; " n " , ` Int focus ; " prompt " , ` String prompt ; ] | _ -> ` Assoc [ " kind " , ` String ( Cnl_... |
( type_expr * type_expr ) list * ( type_expr * type_expr ) list |
let current_level = ref 0 |
let nongen_level = ref 0 |
let global_level = ref 1 |
let saved_level = ref [ ] |
let init_def level = current_level := level ; nongen_level := level |
let begin_def ( ) = saved_level := ( ! current_level , ! nongen_level ) :: ! saved_level ; incr current_level ; nongen_level := ! current_level |
let begin_class_def ( ) = saved_level := ( ! current_level , ! nongen_level ) :: ! saved_level ; incr current_level |
let raise_nongen_level ( ) = saved_level := ( ! current_level , ! nongen_level ) :: ! saved_level ; nongen_level := ! current_level |
let end_def ( ) = let ( cl , nl ) = List . hd ! saved_level in saved_level := List . tl ! saved_level ; current_level := cl ; nongen_level := nl |
let reset_global_level ( ) = global_level := ! current_level + 1 |
let increase_global_level ( ) = let gl = ! global_level in global_level := ! current_level ; gl |
let restore_global_level gl = global_level := gl |
let is_object_type path = let name = match path with Path . Pident id -> Ident . name id | Path . Pdot ( _ , s , _ ) -> s | Path . Papply _ -> assert false in name . [ 0 ] = ' ' # |
let simple_abbrevs = ref Mnil |
let proper_abbrevs path tl abbrev = if ! Clflags . principal || tl <> [ ] || is_object_type path then abbrev else simple_abbrevs |
let newty desc = newty2 ! current_level desc |
let new_global_ty desc = newty2 ! global_level desc |
let newvar ( ) = newty2 ! current_level Tvar |
let newvar2 level = newty2 level Tvar |
let new_global_var ( ) = newty2 ! global_level Tvar |
let newobj fields = newty ( Tobject ( fields , ref None ) ) |
let newconstr path tyl = newty ( Tconstr ( path , tyl , ref Mnil ) ) |
let none = newty ( Ttuple [ ] ) |
module TypePairs = Hashtbl . Make ( struct type t = type_expr * type_expr let equal ( t1 , t1 ' ) ( t2 , t2 ' ) = ( t1 == t2 ) && ( t1 ' == t2 ' ) let hash ( t , t ' ) = t . id + 93 * t ' . id end ) |
let dummy_method = " * dummy method " * |
let object_fields ty = match ( repr ty ) . desc with Tobject ( fields , _ ) -> fields | _ -> assert false |
let flatten_fields ty = let rec flatten l ty = let ty = repr ty in match ty . desc with Tfield ( s , k , ty1 , ty2 ) -> flatten ( ( s , k , ty1 ) :: l ) ty2 | _ -> ( l , ty ) in let ( l , r ) = flatten [ ] ty in ( Sort . list ( fun ( n , _ , _ ) ( n ' , _ , _ ) -> n < n ' ) l , r ) |
let build_fields level = List . fold_right ( fun ( s , k , ty1 ) ty2 -> newty2 level ( Tfield ( s , k , ty1 , ty2 ) ) ) |
let associate_fields fields1 fields2 = let rec associate p s s ' = function ( l , [ ] ) -> ( List . rev p , ( List . rev s ) @ l , List . rev s ' ) | ( [ ] , l ' ) -> ( List . rev p , List . rev s , ( List . rev s ' ) @ l ' ) | ( ( n , k , t ) :: r , ( n ' , k ' , t ' ) :: r ' ) when n = n ' -> associate ( ( n , k , t ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.