text stringlengths 0 601k |
|---|
let tot_time = ref 0 . |
let measure_time f s = let t0 = Unix . gettimeofday ( ) in let a = f ( ) in let t1 = Unix . gettimeofday ( ) in Printf . printf " % s time % d : % Fs \ n " %! s ! cpt ( ( t1 . - t0 ) . / 10 . ) ; tot_time := ! tot_time . + ( t1 . - t0 ) ; incr cpt ; a ; ; |
let devices = measure_time ( Spoc . Devices . init ) " init " ktype node = { mutable starting : int32 ; mutable no_of_edges : int32 ; } |
let max_threads_per_block = ref 512l |
let bfs_kern1 = kern g_graph_nodes g_graph_edges g_graph_mask g_updating_graph_mask g_graph_visited g_cost no_of_nodes -> let open Std in let tid = ( block_idx_x * @ max_threads_per_block ) + thread_idx_x in if ( tid < no_of_nodes && ( 1 = g_graph_mask . [ < tid ] ) > ) then ( g_graph_mask . [ < tid ] > <- 0 ; for i = ... |
let bfs_kern2 = kern g_graph_mask g_updating_graph_mask g_graph_visited g_over no_of_nodes -> let open Std in let tid = ( block_idx_x * @ max_threads_per_block ) + thread_idx_x in if ( tid < no_of_nodes && ( g_updating_graph_mask . [ < tid ] > = 1 ) ) then ( g_graph_mask . [ < tid ] > <- 1 ; g_graph_visited . [ < tid ]... |
let usage ( ) = Printf . eprintf " Usage : % s < input_file > [ ? device_id ] \ n " %! ( Sys . argv . ( 0 ) ) |
let bfs_graph ( ) = if ( Array . length Sys . argv ) != 2 && ( Array . length Sys . argv ) != 3 then ( usage ( ) ; exit 0 ; ) ; let dev = if ( Array . length Sys . argv ) = 3 then devices . ( int_of_string Sys . argv . ( 2 ) ) else devices . ( 0 ) in let fs = try Scanf . Scanning . open_in Sys . argv . ( 1 ) with | Sys... |
let _ = bfs_graph ( ) |
type ( ' a , ' b ) kind = Float32 : ( float , float32_elt ) kind | Float64 : ( float , float64_elt ) kind | Int8_signed : ( int , int8_signed_elt ) kind | Int8_unsigned : ( int , int8_unsigned_elt ) kind | Int16_signed : ( int , int16_signed_elt ) kind | Int16_unsigned : ( int , int16_unsigned_elt ) kind | Int32 : ( in... |
type ' a layout = C_layout : c_layout layout | Fortran_layout : fortran_layout layout |
let kind_size_in_bytes : type a b . ( a , b ) kind -> int = function | Float32 -> 4 | Float64 -> 8 | Int8_signed -> 1 | Int8_unsigned -> 1 | Int16_signed -> 2 | Int16_unsigned -> 2 | Int32 -> 4 | Int64 -> 8 | Int -> Sys . word_size / 8 | Nativeint -> Sys . word_size / 8 | Complex32 -> 8 | Complex64 -> 16 | Char -> 1 |
module Genarray = struct type ( ' ! a , ' ! b , ' ! c ) t external create : ( ' a , ' b ) kind -> ' c layout -> int array -> ( ' a , ' b , ' c ) t = " caml_ba_create " external get : ( ' a , ' b , ' c ) t -> int array -> ' a = " caml_ba_get_generic " external set : ( ' a , ' b , ' c ) t -> int array -> ' a -> unit = " ... |
module Array0 = struct type ( ' ! a , ' ! b , ' ! c ) t = ( ' a , ' b , ' c ) Genarray . t let create kind layout = Genarray . create kind layout [ ] || let get arr = Genarray . get arr [ ] || let set arr = Genarray . set arr [ ] || external kind : ( ' a , ' b , ' c ) t -> ( ' a , ' b ) kind = " caml_ba_kind " external... |
module Array1 = struct type ( ' ! a , ' ! b , ' ! c ) t = ( ' a , ' b , ' c ) Genarray . t let create kind layout dim = Genarray . create kind layout [ | dim ] | external get : ( ' a , ' b , ' c ) t -> int -> ' a = " % caml_ba_ref_1 " external set : ( ' a , ' b , ' c ) t -> int -> ' a -> unit = " % caml_ba_set_1 " exte... |
module Array2 = struct type ( ' ! a , ' ! b , ' ! c ) t = ( ' a , ' b , ' c ) Genarray . t let create kind layout dim1 dim2 = Genarray . create kind layout [ | dim1 ; dim2 ] | external get : ( ' a , ' b , ' c ) t -> int -> int -> ' a = " % caml_ba_ref_2 " external set : ( ' a , ' b , ' c ) t -> int -> int -> ' a -> uni... |
module Array3 = struct type ( ' ! a , ' ! b , ' ! c ) t = ( ' a , ' b , ' c ) Genarray . t let create kind layout dim1 dim2 dim3 = Genarray . create kind layout [ | dim1 ; dim2 ; dim3 ] | external get : ( ' a , ' b , ' c ) t -> int -> int -> int -> ' a = " % caml_ba_ref_3 " external set : ( ' a , ' b , ' c ) t -> int -... |
let array0_of_genarray a = if Genarray . num_dims a = 0 then a else invalid_arg " Bigarray . array0_of_genarray " |
let array1_of_genarray a = if Genarray . num_dims a = 1 then a else invalid_arg " Bigarray . array1_of_genarray " |
let array2_of_genarray a = if Genarray . num_dims a = 2 then a else invalid_arg " Bigarray . array2_of_genarray " |
let array3_of_genarray a = if Genarray . num_dims a = 3 then a else invalid_arg " Bigarray . array3_of_genarray " ( ' a , ' b , ' c ) Genarray . t -> int array -> ( ' a , ' b , ' c ) Genarray . t = " caml_ba_reshape " |
let reshape_0 a = reshape a [ ] || |
let reshape_1 a dim1 = reshape a [ | dim1 ] | |
let reshape_2 a dim1 dim2 = reshape a [ | dim1 ; dim2 ] | |
let reshape_3 a dim1 dim2 dim3 = reshape a [ | dim1 ; dim2 ; dim3 ] | |
let _ = let _ = Genarray . get in let _ = Array1 . get in let _ = Array2 . get in let _ = Array3 . get in ( ) |
let error_occurred = ref false |
let function_tested = ref " " |
let testing_function s = function_tested := s ; print_newline ( ) ; print_string s ; print_newline ( ) |
let test test_number answer correct_answer = flush stdout ; flush stderr ; if answer <> correct_answer then begin eprintf " *** Bad result ( % s , test % d ) \ n " ! function_tested test_number ; flush stderr ; error_occurred := true end else begin printf " % d . . . " test_number end |
let _ = testing_function " ------ Array1 " ; -------- testing_function " create / set / get " ; let test_setget kind vals = let rec set a i = function [ ] -> ( ) | ( v1 , v2 ) :: tl -> a . { i } <- v1 ; set a ( i + 1 ) tl in let rec test a i = function [ ] -> true | ( v1 , v2 ) :: tl -> a . { i } = v2 && test a ( i + 1... |
let _ = print_newline ( ) ; if ! error_occurred then begin prerr_endline " ************* TEST FAILED " ; **************** exit 2 end else exit 0 |
let error_occurred = ref false |
let function_tested = ref " " |
let testing_function s = function_tested := s ; print_newline ( ) ; print_string s ; print_newline ( ) |
let test test_number answer correct_answer = flush stdout ; flush stderr ; if answer <> correct_answer then begin eprintf " *** Bad result ( % s , test % d ) \ n " ! function_tested test_number ; flush stderr ; error_occurred := true end else begin printf " % d . . . " test_number end |
let _ = let make_array2 kind layout ind0 dim1 dim2 fromint = let a = Array2 . create kind layout dim1 dim2 in for i = ind0 to dim1 - 1 + ind0 do for j = ind0 to dim2 - 1 + ind0 do a . { i , j } <- ( fromint ( i * 1000 + j ) ) done done ; a in print_newline ( ) ; testing_function " ------ Foreign function interface " ; ... |
type big_int = { sign : int ; abs_value : nat } |
let create_big_int sign nat = if sign = 1 || sign = - 1 || ( sign = 0 && is_zero_nat nat 0 ( num_digits_nat nat 0 ( length_nat nat ) ) ) then { sign = sign ; abs_value = nat } else invalid_arg " create_big_int " |
let sign_big_int bi = bi . sign |
let zero_big_int = { sign = 0 ; abs_value = make_nat 1 } |
let unit_big_int = { sign = 1 ; abs_value = nat_of_int 1 } |
let num_digits_big_int bi = num_digits_nat ( bi . abs_value ) 0 ( length_nat bi . abs_value ) |
let minus_big_int bi = { sign = - bi . sign ; abs_value = copy_nat ( bi . abs_value ) 0 ( num_digits_big_int bi ) } |
let abs_big_int bi = { sign = if bi . sign = 0 then 0 else 1 ; abs_value = copy_nat ( bi . abs_value ) 0 ( num_digits_big_int bi ) } |
let compare_big_int bi1 bi2 = if bi1 . sign = 0 && bi2 . sign = 0 then 0 else if bi1 . sign < bi2 . sign then - 1 else if bi1 . sign > bi2 . sign then 1 else if bi1 . sign = 1 then compare_nat ( bi1 . abs_value ) 0 ( num_digits_big_int bi1 ) ( bi2 . abs_value ) 0 ( num_digits_big_int bi2 ) else compare_nat ( bi2 . abs_... |
let eq_big_int bi1 bi2 = compare_big_int bi1 bi2 = 0 |
let max_big_int bi1 bi2 = if lt_big_int bi1 bi2 then bi2 else bi1 |
let pred_big_int bi = match bi . sign with 0 -> { sign = - 1 ; abs_value = nat_of_int 1 } | 1 -> let size_bi = num_digits_big_int bi in let copy_bi = copy_nat ( bi . abs_value ) 0 size_bi in ignore ( decr_nat copy_bi 0 size_bi 0 ) ; { sign = if is_zero_nat copy_bi 0 size_bi then 0 else 1 ; abs_value = copy_bi } | _ -> ... |
let succ_big_int bi = match bi . sign with 0 -> { sign = 1 ; abs_value = nat_of_int 1 } | - 1 -> let size_bi = num_digits_big_int bi in let copy_bi = copy_nat ( bi . abs_value ) 0 size_bi in ignore ( decr_nat copy_bi 0 size_bi 0 ) ; { sign = if is_zero_nat copy_bi 0 size_bi then 0 else - 1 ; abs_value = copy_bi } | _ -... |
let add_big_int bi1 bi2 = let size_bi1 = num_digits_big_int bi1 and size_bi2 = num_digits_big_int bi2 in if bi1 . sign = bi2 . sign then { sign = bi1 . sign ; abs_value = match compare_nat ( bi1 . abs_value ) 0 size_bi1 ( bi2 . abs_value ) 0 size_bi2 with - 1 -> let res = create_nat ( succ size_bi2 ) in ( blit_nat res ... |
let big_int_of_int i = { sign = sign_int i ; abs_value = let res = ( create_nat 1 ) in ( if i = monster_int then ( set_digit_nat res 0 biggest_int ; ignore ( incr_nat res 0 1 1 ) ) else set_digit_nat res 0 ( abs i ) ) ; res } |
let add_int_big_int i bi = add_big_int ( big_int_of_int i ) bi |
let sub_big_int bi1 bi2 = add_big_int bi1 ( minus_big_int bi2 ) |
let mult_int_big_int i bi = let size_bi = num_digits_big_int bi in let size_res = succ size_bi in if i = monster_int then let res = create_nat size_res in blit_nat res 0 ( bi . abs_value ) 0 size_bi ; set_digit_nat res size_bi 0 ; ignore ( mult_digit_nat res 0 size_res ( bi . abs_value ) 0 size_bi ( nat_of_int biggest_... |
let mult_big_int bi1 bi2 = let size_bi1 = num_digits_big_int bi1 and size_bi2 = num_digits_big_int bi2 in let size_res = size_bi1 + size_bi2 in let res = make_nat ( size_res ) in { sign = bi1 . sign * bi2 . sign ; abs_value = if size_bi2 > size_bi1 then ( ignore ( mult_nat res 0 size_res ( bi2 . abs_value ) 0 size_bi2 ... |
let quomod_big_int bi1 bi2 = if bi2 . sign = 0 then raise Division_by_zero else let size_bi1 = num_digits_big_int bi1 and size_bi2 = num_digits_big_int bi2 in match compare_nat ( bi1 . abs_value ) 0 size_bi1 ( bi2 . abs_value ) 0 size_bi2 with - 1 -> if bi1 . sign >= 0 then ( big_int_of_int 0 , bi1 ) else if bi2 . sign... |
let div_big_int bi1 bi2 = fst ( quomod_big_int bi1 bi2 ) |
let gcd_big_int bi1 bi2 = let size_bi1 = num_digits_big_int bi1 and size_bi2 = num_digits_big_int bi2 in if is_zero_nat ( bi1 . abs_value ) 0 size_bi1 then abs_big_int bi2 else if is_zero_nat ( bi2 . abs_value ) 0 size_bi2 then { sign = 1 ; abs_value = bi1 . abs_value } else { sign = 1 ; abs_value = match compare_nat (... |
let monster_big_int = big_int_of_int monster_int ; ; |
let is_int_big_int bi = num_digits_big_int bi == 1 && match compare_nat bi . abs_value 0 1 monster_nat 0 1 with | 0 -> bi . sign == - 1 | - 1 -> true | _ -> false ; ; |
let int_of_big_int bi = try let n = int_of_nat bi . abs_value in if bi . sign = - 1 then - n else n with Failure _ -> if eq_big_int bi monster_big_int then monster_int else failwith " int_of_big_int " ; ; |
let big_int_of_nativeint i = if i = 0n then zero_big_int else if i > 0n then begin let res = create_nat 1 in set_digit_nat_native res 0 i ; { sign = 1 ; abs_value = res } end else begin let res = create_nat 1 in set_digit_nat_native res 0 ( Nativeint . neg i ) ; { sign = - 1 ; abs_value = res } end |
let nativeint_of_big_int bi = if num_digits_big_int bi > 1 then failwith " nativeint_of_big_int " ; let i = nth_digit_nat_native bi . abs_value 0 in if bi . sign >= 0 then if i >= 0n then i else failwith " nativeint_of_big_int " else if i >= 0n || i = Nativeint . min_int then Nativeint . neg i else failwith " nativeint... |
let big_int_of_int32 i = big_int_of_nativeint ( Nativeint . of_int32 i ) |
let int32_of_big_int bi = let i = nativeint_of_big_int bi in if i <= 0x7FFF_FFFFn && i >= - 0x8000_0000n then Nativeint . to_int32 i else failwith " int32_of_big_int " |
let big_int_of_int64 i = if Sys . word_size = 64 then big_int_of_nativeint ( Int64 . to_nativeint i ) else begin let ( sg , absi ) = if i = 0L then ( 0 , 0L ) else if i > 0L then ( 1 , i ) else ( - 1 , Int64 . neg i ) in let res = create_nat 2 in set_digit_nat_native res 0 ( Int64 . to_nativeint absi ) ; set_digit_nat_... |
let int64_of_big_int bi = if Sys . word_size = 64 then Int64 . of_nativeint ( nativeint_of_big_int bi ) else begin let i = match num_digits_big_int bi with | 1 -> Int64 . logand ( Int64 . of_nativeint ( nth_digit_nat_native bi . abs_value 0 ) ) 0xFFFFFFFFL | 2 -> Int64 . logor ( Int64 . logand ( Int64 . of_nativeint ( ... |
let nat_of_big_int bi = if bi . sign = - 1 then failwith " nat_of_big_int " else copy_nat ( bi . abs_value ) 0 ( num_digits_big_int bi ) |
let sys_big_int_of_nat nat off len = let length = num_digits_nat nat off len in { sign = if is_zero_nat nat off length then 0 else 1 ; abs_value = copy_nat nat off length } |
let big_int_of_nat nat = sys_big_int_of_nat nat 0 ( length_nat nat ) |
let string_of_big_int bi = if bi . sign = - 1 then " " - ^ string_of_nat bi . abs_value else string_of_nat bi . abs_value |
let sys_big_int_of_string_aux s ofs len sgn = if len < 1 then failwith " sys_big_int_of_string " ; let n = sys_nat_of_string 10 s ofs len in if is_zero_nat n 0 ( length_nat n ) then zero_big_int else { sign = sgn ; abs_value = n } ; ; |
let sys_big_int_of_string s ofs len = if len < 1 then failwith " sys_big_int_of_string " ; match s . [ ofs ] with | ' ' - -> sys_big_int_of_string_aux s ( ofs + 1 ) ( len - 1 ) ( - 1 ) | ' ' + -> sys_big_int_of_string_aux s ( ofs + 1 ) ( len - 1 ) 1 | _ -> sys_big_int_of_string_aux s ofs len 1 ; ; |
let big_int_of_string s = sys_big_int_of_string s 0 ( String . length s ) |
let power_base_nat base nat off len = if base = 0 then nat_of_int 0 else if is_zero_nat nat off len || base = 1 then nat_of_int 1 else let power_base = make_nat ( succ length_of_digit ) in let ( pmax , pint ) = make_power_base base power_base in let ( n , rem ) = let ( x , y ) = quomod_big_int ( sys_big_int_of_nat nat ... |
let power_int_positive_int i n = match sign_int n with 0 -> unit_big_int | - 1 -> invalid_arg " power_int_positive_int " | _ -> let nat = power_base_int ( abs i ) n in { sign = if i >= 0 then sign_int i else if n land 1 = 0 then 1 else - 1 ; abs_value = nat } |
let power_big_int_positive_int bi n = match sign_int n with 0 -> unit_big_int | - 1 -> invalid_arg " power_big_int_positive_int " | _ -> let bi_len = num_digits_big_int bi in let res_len = bi_len * n in let res = make_nat res_len and res2 = make_nat res_len and l = num_bits_int n - 2 in let p = ref ( 1 lsl l ) in blit_... |
let power_int_positive_big_int i bi = match sign_big_int bi with 0 -> unit_big_int | - 1 -> invalid_arg " power_int_positive_big_int " | _ -> let nat = power_base_nat ( abs i ) ( bi . abs_value ) 0 ( num_digits_big_int bi ) in { sign = if i >= 0 then sign_int i else if is_digit_odd ( bi . abs_value ) 0 then - 1 else 1 ... |
let power_big_int_positive_big_int bi1 bi2 = match sign_big_int bi2 with 0 -> unit_big_int | - 1 -> invalid_arg " power_big_int_positive_big_int " | _ -> try power_big_int_positive_int bi1 ( int_of_big_int bi2 ) with Failure _ -> try power_int_positive_big_int ( int_of_big_int bi1 ) bi2 with Failure _ -> raise Out_of_m... |
let base_power_big_int base n bi = match sign_int n with 0 -> bi | - 1 -> let nat = power_base_int base ( - n ) in let len_nat = num_digits_nat nat 0 ( length_nat nat ) and len_bi = num_digits_big_int bi in if len_bi < len_nat then invalid_arg " base_power_big_int " else if len_bi = len_nat && compare_digits_nat ( bi .... |
let float_of_big_int bi = float_of_string ( string_of_big_int bi ) |
let sqrt_big_int bi = match bi . sign with | 0 -> zero_big_int | - 1 -> invalid_arg " sqrt_big_int " | _ -> { sign = 1 ; abs_value = sqrt_nat ( bi . abs_value ) 0 ( num_digits_big_int bi ) } |
let square_big_int bi = if bi . sign == 0 then zero_big_int else let len_bi = num_digits_big_int bi in let len_res = 2 * len_bi in let res = make_nat len_res in ignore ( square_nat res 0 len_res ( bi . abs_value ) 0 len_bi ) ; { sign = 1 ; abs_value = res } |
let round_futur_last_digit s off_set length = let l = pred ( length + off_set ) in if Char . code ( String . get s l ) >= Char . code ' 5 ' then let rec round_rec l = if l < off_set then true else begin let current_char = String . get s l in if current_char = ' 9 ' then ( String . set s l ' 0 ' ; round_rec ( pred l ) )... |
let approx_big_int prec bi = let len_bi = num_digits_big_int bi in let n = max 0 ( int_of_big_int ( add_int_big_int ( - prec ) ( div_big_int ( mult_big_int ( big_int_of_int ( pred len_bi ) ) ( big_int_of_string " 963295986 " ) ) ( big_int_of_string " 100000000 " ) ) ) ) in let s = string_of_big_int ( div_big_int bi ( p... |
let shift_left_big_int bi n = if n < 0 then invalid_arg " shift_left_big_int " else if n = 0 then bi else if bi . sign = 0 then bi else begin let size_bi = num_digits_big_int bi in let size_res = size_bi + ( ( n + length_of_digit - 1 ) / length_of_digit ) in let res = create_nat size_res in let ndigits = n / length_of_... |
let shift_right_towards_zero_big_int bi n = if n < 0 then invalid_arg " shift_right_towards_zero_big_int " else if n = 0 then bi else if bi . sign = 0 then bi else begin let size_bi = num_digits_big_int bi in let ndigits = n / length_of_digit in let nbits = n mod length_of_digit in if ndigits >= size_bi then zero_big_i... |
let two_power_m1_big_int n = if n < 0 then invalid_arg " two_power_m1_big_int " else if n = 0 then zero_big_int else begin let size_res = ( n + length_of_digit - 1 ) / length_of_digit in let res = make_nat size_res in set_digit_nat_native res ( n / length_of_digit ) ( Nativeint . shift_left 1n ( n mod length_of_digit )... |
let shift_right_big_int bi n = if n < 0 then invalid_arg " shift_right_big_int " else if bi . sign >= 0 then shift_right_towards_zero_big_int bi n else shift_right_towards_zero_big_int ( sub_big_int bi ( two_power_m1_big_int n ) ) n |
let extract_big_int bi ofs n = if ofs < 0 || n < 0 then invalid_arg " extract_big_int " else if bi . sign = 0 then bi else begin let size_bi = num_digits_big_int bi in let size_res = ( n + length_of_digit - 1 ) / length_of_digit in let ndigits = ofs / length_of_digit in let nbits = ofs mod length_of_digit in let res = ... |
let and_big_int a b = if a . sign < 0 || b . sign < 0 then invalid_arg " and_big_int " else if a . sign = 0 || b . sign = 0 then zero_big_int else begin let size_a = num_digits_big_int a and size_b = num_digits_big_int b in let size_res = min size_a size_b in let res = create_nat size_res in blit_nat res 0 a . abs_valu... |
let or_big_int a b = if a . sign < 0 || b . sign < 0 then invalid_arg " or_big_int " else if a . sign = 0 then b else if b . sign = 0 then a else begin let size_a = num_digits_big_int a and size_b = num_digits_big_int b in let size_res = max size_a size_b in let res = create_nat size_res in let or_aux a ' b ' size_b ' ... |
let xor_big_int a b = if a . sign < 0 || b . sign < 0 then invalid_arg " xor_big_int " else if a . sign = 0 then b else if b . sign = 0 then a else begin let size_a = num_digits_big_int a and size_b = num_digits_big_int b in let size_res = max size_a size_b in let res = create_nat size_res in let xor_aux a ' b ' size_b... |
module T = struct include Int let print = Numeric_types . Int . print let hash = Hashtbl . hash end |
module Tree = Patricia_tree . Make ( T ) |
let strictly_earlier ( t : t ) ~ than = t < than |
let succ ( t : t ) = if t < earliest_var then Misc . fatal_error " Cannot increment binding time for symbols " else t + 1 |
module With_name_mode = struct type t = int let [ @ inline always ] create binding_time ( name_mode : Name_mode . t ) = let name_mode = match name_mode with Normal -> 0 | In_types -> 1 | Phantom -> 2 in ( binding_time lsl 2 ) lor name_mode let symbols = create symbols Name_mode . normal let consts = create consts Name_... |
let gpu_bitonic = kern v j k -> let open Std in let i = thread_idx_x + block_dim_x * block_idx_x in let ixj = Math . xor i j in let mutable temp = 0 . in if ixj >= i then begin if ( Math . logical_and i k ) = 0 then ( if v . [ < i ] > . > v . [ < ixj ] > then ( temp := v . [ < ixj ] ; > v . [ < ixj ] > <- v . [ < i ] ;... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.