text stringlengths 12 786k |
|---|
let dump_selection = ref false |
let dump_live = ref false |
let dump_spill = ref false |
let dump_split = ref false |
let dump_interf = ref false |
let dump_prefer = ref false |
let dump_regalloc = ref false |
let dump_reload = ref false |
let dump_linear = ref false |
let use_llvm = ref false |
let rec regalloc fd = if ! dump_live then Printmach . phase " Liveness analysis " fd ; Interf . build_graph fd ; if ! dump_interf then Printmach . interferences ( ) ; if ! dump_prefer then Printmach . preferences ( ) ; Coloring . allocate_registers ( ) ; if ! dump_regalloc then ... |
let fundecl ppf fd_cmm = if ! dump_cmm then begin fprintf ppf " *** C -- code . " ; @ fprintf ppf " % a . " @ Printcmm . fundecl fd_cmm end ; Reg . reset ( ) ; let fd_sel = Sequence . fundecl fd_cmm in if ! dump_selection then Printmach . phase " After instruction selection " ... |
let phrase = function Cfunction fd -> fundecl fd | Cdata dl -> Emit . data dl |
let file filename = let ic = open_in filename in let lb = Lexing . from_channel ic in try while true do phrase ( Parsecmm . phrase Lexcmm . token lb ) done with End_of_file -> close_in ic | Lexcmm . Error msg -> close_in ic ; Lexcmm . report_error lb msg | Parsing . Parse_error -> close_in ic ... |
type t = Code_id . t Code_id . Map . t |
let [ @ ocamlformat " disable " ] print ppf t = Code_id . Map . print Code_id . print ppf t |
let get_older_version_of t code_id = Code_id . Map . find_opt code_id t |
let add t ~ newer ~ older = Code_id . Map . add newer older t |
let rec all_ids_up_to_root t ~ resolver id = match Code_id . Map . find id t with | exception Not_found -> ( let comp_unit = Code_id . get_compilation_unit id in if Compilation_unit . equal comp_unit ( Compilation_unit . get_current_exn ( ) ) then Code_id . Set . singleton id else match res... |
let num_ids_up_to_root t ~ resolver id = Code_id . Set . cardinal ( all_ids_up_to_root t ~ resolver id ) |
let meet t ~ resolver id1 id2 : _ Or_bottom . t = if Code_id . equal id1 id2 then Ok id1 else let id1_to_root = all_ids_up_to_root t ~ resolver id1 in let id2_to_root = all_ids_up_to_root t ~ resolver id2 in if Code_id . Set . mem id1 id2_to_root then Ok id2 else if Code_id . Set . mem id2 id1_to_ro... |
let join ~ target_t ~ resolver t1 t2 id1 id2 : _ Or_unknown . t = if Code_id . equal id1 id2 then Known id1 else let id1_to_root = all_ids_up_to_root ~ resolver t1 id1 in let id2_to_root = all_ids_up_to_root ~ resolver t2 id2 in let shared_ids = Code_id . Set . inter id1_to_root id2_to_root in let sha... |
let union t1 t2 = Code_id . Map . disjoint_union ~ eq : Code_id . equal t1 t2 |
let all_code_ids_for_export t = Code_id . Map . fold ( fun key v acc -> Code_id . Set . add key ( Code_id . Set . add v acc ) ) t Code_id . Set . empty |
let apply_renaming t renaming = let rename_code_id = Renaming . apply_code_id renaming in Code_id . Map . fold ( fun key v acc -> Code_id . Map . add ( rename_code_id key ) ( rename_code_id v ) acc ) t Code_id . Map . empty |
let clean_for_export t ~ reachable_names = Code_id . Map . filter ( fun newer_code_id _older_code_id -> Name_occurrences . mem_code_id reachable_names newer_code_id ) t |
type t = { code_id : Code_id . t ; newer_version_of : Code_id . t option ; params_arity : Flambda_arity . With_subkinds . t ; num_trailing_local_params : int ; result_arity : Flambda_arity . With_subkinds . t ; result_types : Result_types . t ; contains_no_escaping_local_allocs : boo... |
let code_id { code_id ; _ } = code_id |
let newer_version_of { newer_version_of ; _ } = newer_version_of |
let params_arity { params_arity ; _ } = params_arity |
let num_leading_heap_params { params_arity ; num_trailing_local_params ; _ } = let n = Flambda_arity . With_subkinds . cardinal params_arity - num_trailing_local_params in assert ( n >= 0 ) ; n |
let num_trailing_local_params { num_trailing_local_params ; _ } = num_trailing_local_params |
let result_arity { result_arity ; _ } = result_arity |
let result_types { result_types ; _ } = result_types |
let stub { stub ; _ } = stub |
let inline { inline ; _ } = inline |
let is_a_functor { is_a_functor ; _ } = is_a_functor |
let recursive { recursive ; _ } = recursive |
let cost_metrics { cost_metrics ; _ } = cost_metrics |
let inlining_arguments { inlining_arguments ; _ } = inlining_arguments |
let dbg { dbg ; _ } = dbg |
let is_tupled { is_tupled ; _ } = is_tupled |
let is_my_closure_used { is_my_closure_used ; _ } = is_my_closure_used |
let inlining_decision { inlining_decision ; _ } = inlining_decision |
let contains_no_escaping_local_allocs { contains_no_escaping_local_allocs ; _ } = contains_no_escaping_local_allocs |
let absolute_history { absolute_history ; _ } = absolute_history |
let relative_history { relative_history ; _ } = relative_history |
let create code_id ~ newer_version_of ~ params_arity ~ num_trailing_local_params ~ result_arity ~ result_types ~ contains_no_escaping_local_allocs ~ stub ( ~ inline : Inline_attribute . t ) ~ is_a_functor ~ recursive ~ cost_metrics ~ inlining_arguments ~ dbg ~ is_tupled ~ is_my_closure_used ~ inl... |
let with_code_id code_id t = { t with code_id } |
let with_newer_version_of newer_version_of t = { t with newer_version_of } |
let with_cost_metrics cost_metrics t = { t with cost_metrics } |
module Option = struct include Option let print_compact print_contents ppf t = match t with | None -> Format . pp_print_string ppf " ( ) " | Some contents -> Format . fprintf ppf " % a " print_contents contents end |
let [ @ ocamlformat " disable " ] print_inlining_paths ppf ( relative_history , absolute_history ) = if ! Flambda_backend_flags . dump_inlining_paths then Format . fprintf ppf " [ @< hov 1 ( > relative_history @ % a ) ] @@ \ [ @< hov 1 ( > absolute_history @ % a ) ] @... |
let [ @ ocamlformat " disable " ] print ppf { code_id = _ ; newer_version_of ; stub ; inline ; is_a_functor ; params_arity ; num_trailing_local_params ; result_arity ; result_types ; contains_no_escaping_local_allocs ; recursive ; cost_metrics ; inlining_arguments ; dbg ; is_tup... |
let free_names { code_id = _ ; newer_version_of ; params_arity = _ ; num_trailing_local_params = _ ; result_arity = _ ; result_types ; contains_no_escaping_local_allocs = _ ; stub = _ ; inline = _ ; is_a_functor = _ ; recursive = _ ; cost_metrics = _ ; inlining_arguments =... |
let apply_renaming ( { code_id ; newer_version_of ; params_arity = _ ; num_trailing_local_params = _ ; result_arity = _ ; result_types ; contains_no_escaping_local_allocs = _ ; stub = _ ; inline = _ ; is_a_functor = _ ; recursive = _ ; cost_metrics = _ ; inlining_arguments ... |
let all_ids_for_export { code_id ; newer_version_of ; params_arity = _ ; num_trailing_local_params = _ ; result_arity = _ ; result_types ; contains_no_escaping_local_allocs = _ ; stub = _ ; inline = _ ; is_a_functor = _ ; recursive = _ ; cost_metrics = _ ; inlining_arguments ... |
let approx_equal { code_id = code_id1 ; newer_version_of = newer_version_of1 ; params_arity = params_arity1 ; num_trailing_local_params = num_trailing_local_params1 ; result_arity = result_arity1 ; result_types = _ ; contains_no_escaping_local_allocs = contains_no_escaping_local_allocs1 ; stub ... |
let map_result_types ( { result_types ; _ } as t ) ~ f = { t with result_types = Result_types . map_result_types result_types ~ f } |
type t = | Code_present of Code . t | Metadata_only of Code_metadata . t |
let print ppf t = match t with | Code_present code -> Format . fprintf ppf " [ @< hov 1 ( > Code_present @ ( [ @< hov 1 ( > code @ % a ) ] ) ) ] " @@ Code . print code | Metadata_only code_metadata -> Format . fprintf ppf " [ @< hov 1 ( > Metadata_only @ ( code_m... |
let create code = Code_present code |
let merge code_id t1 t2 = match t1 , t2 with | Metadata_only cm1 , Metadata_only cm2 -> if Code_metadata . approx_equal cm1 cm2 then Some t1 else Misc . fatal_errorf " Code id % a is imported with different code metadata ( % a and % a ) " Code_id . print code_id Code_metadata . print cm1 Code_... |
let free_names t = match t with | Code_present code -> Code . free_names code | Metadata_only code_metadata -> Code_metadata . free_names code_metadata |
let apply_renaming t renaming = match t with | Code_present code -> let code = Code . apply_renaming code renaming in Code_present code | Metadata_only code_metadata -> let code_metadata = Code_metadata . apply_renaming code_metadata renaming in Metadata_only code_metadata |
let all_ids_for_export t = match t with | Code_present code -> Code . all_ids_for_export code | Metadata_only code_metadata -> Code_metadata . all_ids_for_export code_metadata |
let remember_only_metadata t = match t with | Code_present code -> Metadata_only ( Code . code_metadata code ) | Metadata_only _ -> t |
let code_metadata t = match t with | Code_present code -> Code . code_metadata code | Metadata_only code_metadata -> code_metadata |
let iter_code t ~ f = match t with Code_present code -> f code | Metadata_only _ -> ( ) |
let map_result_types t ~ f = match t with | Code_present code -> Code_present ( Code . map_result_types code ~ f ) | Metadata_only code_metadata -> Metadata_only ( Code_metadata . map_result_types code_metadata ~ f ) |
let code_present t = match t with Code_present _ -> true | Metadata_only _ -> false |
let equal a b = a = b |
let ( + ) ( a : t ) ( b : t ) : t = a + b |
let ( <= ) a b = a <= b |
let arch32 = Targetint_32_64 . size = 32 |
let arch64 = Targetint_32_64 . size = 64 |
let unary_int_prim_size kind op = match ( ( kind : Flambda_kind . Standard_int . t ) , ( op : Flambda_primitive . unary_int_arith_op ) ) with | Tagged_immediate , Neg -> 1 | Tagged_immediate , Swap_byte_endianness -> 2 + nonalloc_extcall_size + 1 | Naked_immediate , Neg -> 1 | ... |
let arith_conversion_size src dst = match ( ( src : Flambda_kind . Standard_int_or_float . t ) , ( dst : Flambda_kind . Standard_int_or_float . t ) ) with | Naked_int64 , Tagged_immediate | Naked_int64 , Naked_int32 | Naked_int64 , ( Naked_nativeint | Naked_immediate ) | Naked_in... |
let unbox_number kind = match ( kind : Flambda_kind . Boxable_number . t ) with | Naked_float -> 1 | Naked_int64 when arch32 -> 4 | Naked_int32 | Naked_int64 | Naked_nativeint -> 2 |
let box_number kind = match ( kind : Flambda_kind . Boxable_number . t ) with | Naked_float -> alloc_size | Naked_int32 when not arch32 -> 1 + alloc_size | Naked_int32 | Naked_int64 | Naked_nativeint -> alloc_size |
let block_load ( kind : Flambda_primitive . Block_access_kind . t ) = match kind with Values _ | Naked_floats _ -> 1 |
let array_load ( kind : Flambda_primitive . Array_kind . t ) = match kind with | Immediates -> 1 | Naked_floats -> 1 | Values -> 1 |
let block_set ( kind : Flambda_primitive . Block_access_kind . t ) ( init : Flambda_primitive . Init_or_assign . t ) = match kind , init with | Values _ , ( Assignment _ | Initialization ) -> 1 | Naked_floats _ , ( Assignment _ | Initialization ) -> 1 |
let array_set ( kind : Flambda_primitive . Array_kind . t ) ( _init : Flambda_primitive . Init_or_assign . t ) = match kind with | Immediates -> 1 | Naked_floats -> 1 | Values -> 1 |
let string_or_bigstring_load kind width = let start_address_load = match ( kind : Flambda_primitive . string_like_value ) with | String | Bytes -> 0 | Bigstring -> 2 in let elt_load = match ( width : Flambda_primitive . string_accessor_width ) with | Eight -> 3 | Sixteen -> 2 | Thirty_two... |
let bytes_like_set kind width = match ( kind : Flambda_primitive . bytes_like_value ) with | Bytes -> string_or_bigstring_load Bytes width | Bigstring -> string_or_bigstring_load Bigstring width |
let binary_phys_comparison kind op = match ( kind : Flambda_kind . t ) , ( op : Flambda_primitive . equality_comparison ) with | ( Naked_number Naked_int64 , Eq | Naked_number Naked_int64 , Neq ) when arch32 -> 1 + alloc_extcall_size + 2 + ( 2 * box_number Naked_int64 ) | _ , ... |
let divmod_bi_check else_branch_size bi = if arch32 || bi <> Flambda_kind . Standard_int . Naked_int32 then 2 + else_branch_size else 0 |
let binary_int_arith_primitive kind op = match ( ( kind : Flambda_kind . Standard_int . t ) , ( op : Flambda_primitive . binary_int_arith_op ) ) with | ( Naked_int64 , Add | Naked_int64 , Sub | Naked_int64 , Mul ) when arch32 -> nonalloc_extcall_size + 2 | ( Naked_int64 , Div... |
let binary_int_shift_primitive kind op = match ( kind : Flambda_kind . Standard_int . t ) , ( op : Flambda_primitive . int_shift_op ) with | ( Naked_int64 , Lsl | Naked_int64 , Lsr | Naked_int64 , Asr ) when arch32 -> nonalloc_extcall_size + 2 | Naked_int32 , Lsr when arch64 -> 2 ... |
let binary_int_comp_primitive kind signed cmp = match ( ( kind : Flambda_kind . Standard_int . t ) , ( signed : Flambda_primitive . signed_or_unsigned ) , ( cmp : Flambda_primitive . ordered_comparison ) ) with | Naked_int64 , Signed , Lt | Naked_int64 , Signed , Le | Naked_in... |
let int_comparison_like_compare_functions ( kind : Flambda_kind . Standard_int . t ) = match kind with | Tagged_immediate | Naked_immediate | Naked_int32 | Naked_int64 | Naked_nativeint -> 4 |
let binary_float_arith_primitive _op = 2 |
let binary_float_comp_primitive _op = 2 |
let nullary_prim_size prim = match ( prim : Flambda_primitive . nullary_primitive ) with | Optimised_out _ -> 0 | Probe_is_enabled { name = _ } -> 4 | Begin_region -> 1 |
let unary_prim_size prim = match ( prim : Flambda_primitive . unary_primitive ) with | Duplicate_array _ | Duplicate_block _ -> alloc_extcall_size + 1 | Is_int -> 1 | Get_tag -> 2 | Array_length -> array_length_size | Bigarray_length _ -> 2 | String_length _ -> 5 | Int_as_pointer -> 1 ... |
let binary_prim_size prim = match ( prim : Flambda_primitive . binary_primitive ) with | Block_load ( kind , _ ) -> block_load kind | Array_load ( kind , _mut ) -> array_load kind | String_or_bigstring_load ( kind , width ) -> string_or_bigstring_load kind width | Bigarray_load ( _d... |
let ternary_prim_size prim = match ( prim : Flambda_primitive . ternary_primitive ) with | Block_set ( block_access , init ) -> block_set block_access init | Array_set ( kind , init ) -> array_set kind init | Bytes_or_bigstring_set ( kind , width ) -> bytes_like_set kind width | Bigarra... |
let variadic_prim_size prim args = match ( prim : Flambda_primitive . variadic_primitive ) with | Make_block ( _ , _mut , _alloc_mode ) | Make_array ( _ , _mut , _alloc_mode ) -> alloc_size + List . length args |
let prim ( prim : Flambda_primitive . t ) = match prim with | Nullary p -> nullary_prim_size p | Unary ( p , _ ) -> unary_prim_size p | Binary ( p , _ , _ ) -> binary_prim_size p | Ternary ( p , _ , _ , _ ) -> ternary_prim_size p | Variadic ( p , args ) -> variadic_... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.