text
stringlengths 12
786k
|
|---|
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 ) tl in let ca = Array1 . create kind c_layout ( List . length vals ) in let fa = Array1 . create kind fortran_layout ( List . length vals ) in set ca 0 vals ; set fa 1 vals ; test ca 0 vals && test fa 1 vals in test 1 true ( test_setget int8_signed [ 0 , 0 ; 123 , 123 ; - 123 , - 123 ; 456 , - 56 ; 0x101 , 1 ] ) ; test 2 true ( test_setget int8_unsigned [ 0 , 0 ; 123 , 123 ; - 123 , 133 ; 456 , 0xc8 ; 0x101 , 1 ] ) ; test 3 true ( test_setget int16_signed [ 0 , 0 ; 123 , 123 ; - 123 , - 123 ; 31456 , 31456 ; - 31456 , - 31456 ; 65432 , - 104 ; 0x10001 , 1 ] ) ; test 4 true ( test_setget int16_unsigned [ 0 , 0 ; 123 , 123 ; - 123 , 65413 ; 31456 , 31456 ; - 31456 , 34080 ; 65432 , 65432 ; 0x10001 , 1 ] ) ; test 5 true ( test_setget int [ 0 , 0 ; 123 , 123 ; - 456 , - 456 ; max_int , max_int ; min_int , min_int ; 0x12345678 , 0x12345678 ; - 0x12345678 , - 0x12345678 ] ) ; test 6 true ( test_setget int32 [ Int32 . zero , Int32 . zero ; Int32 . of_int 123 , Int32 . of_int 123 ; Int32 . of_int ( - 456 ) , Int32 . of_int ( - 456 ) ; Int32 . max_int , Int32 . max_int ; Int32 . min_int , Int32 . min_int ; Int32 . of_string " 0x12345678 " , Int32 . of_string " 0x12345678 " ] ) ; test 7 true ( test_setget int64 [ Int64 . zero , Int64 . zero ; Int64 . of_int 123 , Int64 . of_int 123 ; Int64 . of_int ( - 456 ) , Int64 . of_int ( - 456 ) ; Int64 . max_int , Int64 . max_int ; Int64 . min_int , Int64 . min_int ; Int64 . of_string " 0x123456789ABCDEF0 " , Int64 . of_string " 0x123456789ABCDEF0 " ] ) ; test 8 true ( test_setget nativeint [ Nativeint . zero , Nativeint . zero ; Nativeint . of_int 123 , Nativeint . of_int 123 ; Nativeint . of_int ( - 456 ) , Nativeint . of_int ( - 456 ) ; Nativeint . max_int , Nativeint . max_int ; Nativeint . min_int , Nativeint . min_int ; Nativeint . of_string " 0x12345678 " , Nativeint . of_string " 0x12345678 " ] ) ; test 9 true ( test_setget float32 [ 0 . 0 , 0 . 0 ; 4 . 0 , 4 . 0 ; - 0 . 5 , - 0 . 5 ; 655360 . 0 , 655360 . 0 ] ) ; test 10 true ( test_setget float64 [ 0 . 0 , 0 . 0 ; 4 . 0 , 4 . 0 ; - 0 . 5 , - 0 . 5 ; 1 . 2345678 , 1 . 2345678 ; 3 . 1415e10 , 3 . 1415e10 ] ) ; test 11 true ( test_setget complex32 [ Complex . zero , Complex . zero ; Complex . one , Complex . one ; Complex . i , Complex . i ; { im = 0 . 5 ; re = - 2 . 0 } , { im = 0 . 5 ; re = - 2 . 0 } ] ) ; test 12 true ( test_setget complex64 [ Complex . zero , Complex . zero ; Complex . one , Complex . one ; Complex . i , Complex . i ; { im = 0 . 5 ; re = - 2 . 0 } , { im = 0 . 5 ; re = - 2 . 0 } ; { im = 3 . 1415 ; re = 1 . 2345678 } , { im = 3 . 1415 ; re = 1 . 2345678 } ] ) ; let from_list kind vals = let a = Array1 . create kind c_layout ( List . length vals ) in let rec set i = function [ ] -> ( ) | hd :: tl -> a . { i } <- hd ; set ( i + 1 ) tl in set 0 vals ; a in let from_list_fortran kind vals = let a = Array1 . create kind fortran_layout ( List . length vals ) in let rec set i = function [ ] -> ( ) | hd :: tl -> a . { i } <- hd ; set ( i + 1 ) tl in set 1 vals ; a in testing_function " set / get ( specialized ) " ; let a = Array1 . create int c_layout 3 in for i = 0 to 2 do a . { i } <- i done ; for i = 0 to 2 do test ( i + 1 ) a . { i } i done ; test 4 true ( try ignore a . { 3 } ; false with Invalid_argument _ -> true ) ; test 5 true ( try ignore a . { - 1 } ; false with Invalid_argument _ -> true ) ; let b = Array1 . create float64 fortran_layout 3 in for i = 1 to 3 do b . { i } <- float i done ; for i = 1 to 3 do test ( 5 + i ) b . { i } ( float i ) done ; test 8 true ( try ignore b . { 4 } ; false with Invalid_argument _ -> true ) ; test 9 true ( try ignore b . { 0 } ; false with Invalid_argument _ -> true ) ; let c = Array1 . create complex64 c_layout 3 in for i = 0 to 2 do c . { i } <- { re = float i ; im = 0 . 0 } done ; for i = 0 to 2 do test ( 10 + i ) c . { i } { re = float i ; im = 0 . 0 } done ; test 13 true ( try ignore c . { 3 } ; false with Invalid_argument _ -> true ) ; test 14 true ( try ignore c . { - 1 } ; false with Invalid_argument _ -> true ) ; let d = Array1 . create complex32 fortran_layout 3 in for i = 1 to 3 do d . { i } <- { re = float i ; im = 0 . 0 } done ; for i = 1 to 3 do test ( 14 + i ) d . { i } { re = float i ; im = 0 . 0 } done ; test 18 true ( try ignore d . { 4 } ; false with Invalid_argument _ -> true ) ; test 19 true ( try ignore d . { 0 } ; false with Invalid_argument _ -> true ) ; testing_function " set / get ( unsafe , specialized ) " ; let a = Array1 . create int c_layout 3 in for i = 0 to 2 do Array1 . unsafe_set a i i done ; for i = 0 to 2 do test ( i + 1 ) ( Array1 . unsafe_get a i ) i done ; let b = Array1 . create float64 fortran_layout 3 in for i = 1 to 3 do Array1 . unsafe_set b i ( float i ) done ; for i = 1 to 3 do test ( 5 + i ) ( Array1 . unsafe_get b i ) ( float i ) done ; testing_function " comparisons " ; let normalize_comparison n = if n = 0 then 0 else if n < 0 then - 1 else 1 in test 1 0 ( normalize_comparison ( compare ( from_list int8_signed [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ( from_list int8_signed [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ) ; test 2 ( - 1 ) ( normalize_comparison ( compare ( from_list int8_signed [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ( from_list int8_signed [ 1 ; 2 ; 3 ; 4 ; 127 ; - 128 ] ) ) ) ; test 3 1 ( normalize_comparison ( compare ( from_list int8_signed [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ( from_list int8_signed [ 1 ; 2 ; 3 ; - 4 ; 42 ; - 128 ] ) ) ) ; test 4 ( - 1 ) ( normalize_comparison ( compare ( from_list int8_signed [ 1 ; 2 ; 3 ; - 4 ] ) ( from_list int8_signed [ 1 ; 2 ; 3 ; 4 ; 127 ; - 128 ] ) ) ) ; test 5 1 ( normalize_comparison ( compare ( from_list int8_signed [ 1 ; 2 ; 3 ; 4 ; 127 ; - 128 ] ) ( from_list int8_signed [ 1 ; 2 ; 3 ; - 4 ] ) ) ) ; test 6 0 ( normalize_comparison ( compare ( from_list int8_unsigned [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ( from_list int8_unsigned [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ) ; test 7 1 ( normalize_comparison ( compare ( from_list int8_unsigned [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ( from_list int8_unsigned [ 1 ; 2 ; 3 ; 4 ; 127 ; - 128 ] ) ) ) ; test 8 1 ( normalize_comparison ( compare ( from_list int8_unsigned [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ( from_list int8_unsigned [ 1 ; 2 ; 3 ; - 4 ; 42 ; - 128 ] ) ) ) ; test 9 0 ( normalize_comparison ( compare ( from_list int16_signed [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ( from_list int16_signed [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ) ; test 10 ( - 1 ) ( normalize_comparison ( compare ( from_list int16_signed [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ( from_list int16_signed [ 1 ; 2 ; 3 ; 4 ; 127 ; - 128 ] ) ) ) ; test 11 1 ( normalize_comparison ( compare ( from_list int16_signed [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ( from_list int16_signed [ 1 ; 2 ; 3 ; - 4 ; 42 ; - 128 ] ) ) ) ; test 12 0 ( normalize_comparison ( compare ( from_list int16_unsigned [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ( from_list int16_unsigned [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ) ; test 13 ( - 1 ) ( normalize_comparison ( compare ( from_list int16_unsigned [ 1 ; 2 ; 3 ; 4 ; 127 ; - 128 ] ) ( from_list int16_unsigned [ 1 ; 2 ; 3 ; 0xFFFF ; 127 ; - 128 ] ) ) ) ; test 14 1 ( normalize_comparison ( compare ( from_list int16_unsigned [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ( from_list int16_unsigned [ 1 ; 2 ; 3 ; - 4 ; 42 ; - 128 ] ) ) ) ; test 15 0 ( normalize_comparison ( compare ( from_list int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ( from_list int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ) ; test 16 ( - 1 ) ( normalize_comparison ( compare ( from_list int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ( from_list int [ 1 ; 2 ; 3 ; 4 ; 127 ; - 128 ] ) ) ) ; test 17 1 ( normalize_comparison ( compare ( from_list int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ( from_list int [ 1 ; 2 ; 3 ; - 4 ; 42 ; - 128 ] ) ) ) ; test 18 0 ( normalize_comparison ( compare ( from_list int32 ( List . map Int32 . of_int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ( from_list int32 ( List . map Int32 . of_int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ) ) ; test 19 ( - 1 ) ( normalize_comparison ( compare ( from_list int32 ( List . map Int32 . of_int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ( from_list int32 ( List . map Int32 . of_int [ 1 ; 2 ; 3 ; 4 ; 127 ; - 128 ] ) ) ) ) ; test 20 1 ( normalize_comparison ( compare ( from_list int32 ( List . map Int32 . of_int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ( from_list int32 ( List . map Int32 . of_int [ 1 ; 2 ; 3 ; - 4 ; 42 ; - 128 ] ) ) ) ) ; test 21 0 ( normalize_comparison ( compare ( from_list int64 ( List . map Int64 . of_int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ( from_list int64 ( List . map Int64 . of_int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ) ) ; test 22 ( - 1 ) ( normalize_comparison ( compare ( from_list int64 ( List . map Int64 . of_int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ( from_list int64 ( List . map Int64 . of_int [ 1 ; 2 ; 3 ; 4 ; 127 ; - 128 ] ) ) ) ) ; test 23 1 ( normalize_comparison ( compare ( from_list int64 ( List . map Int64 . of_int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ( from_list int64 ( List . map Int64 . of_int [ 1 ; 2 ; 3 ; - 4 ; 42 ; - 128 ] ) ) ) ) ; test 24 0 ( normalize_comparison ( compare ( from_list nativeint ( List . map Nativeint . of_int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ( from_list nativeint ( List . map Nativeint . of_int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ) ) ; test 25 ( - 1 ) ( normalize_comparison ( compare ( from_list nativeint ( List . map Nativeint . of_int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ( from_list nativeint ( List . map Nativeint . of_int [ 1 ; 2 ; 3 ; 4 ; 127 ; - 128 ] ) ) ) ) ; test 26 1 ( normalize_comparison ( compare ( from_list nativeint ( List . map Nativeint . of_int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ( from_list nativeint ( List . map Nativeint . of_int [ 1 ; 2 ; 3 ; - 4 ; 42 ; - 128 ] ) ) ) ) ; test 27 0 ( normalize_comparison ( compare ( from_list float32 [ 0 . 0 ; 0 . 25 ; - 4 . 0 ; 3 . 141592654 ] ) ( from_list float32 [ 0 . 0 ; 0 . 25 ; - 4 . 0 ; 3 . 141592654 ] ) ) ) ; test 28 ( - 1 ) ( normalize_comparison ( compare ( from_list float32 [ 0 . 0 ; 0 . 25 ; - 4 . 0 ] ) ( from_list float32 [ 0 . 0 ; 0 . 25 ; 3 . 14159 ] ) ) ) ; test 29 1 ( normalize_comparison ( compare ( from_list float32 [ 0 . 0 ; 2 . 718 ; - 4 . 0 ] ) ( from_list float32 [ 0 . 0 ; 0 . 25 ; 3 . 14159 ] ) ) ) ; test 30 0 ( normalize_comparison ( compare ( from_list float64 [ 0 . 0 ; 0 . 25 ; - 4 . 0 ; 3 . 141592654 ] ) ( from_list float64 [ 0 . 0 ; 0 . 25 ; - 4 . 0 ; 3 . 141592654 ] ) ) ) ; test 31 ( - 1 ) ( normalize_comparison ( compare ( from_list float64 [ 0 . 0 ; 0 . 25 ; - 4 . 0 ] ) ( from_list float64 [ 0 . 0 ; 0 . 25 ; 3 . 14159 ] ) ) ) ; test 32 1 ( normalize_comparison ( compare ( from_list float64 [ 0 . 0 ; 2 . 718 ; - 4 . 0 ] ) ( from_list float64 [ 0 . 0 ; 0 . 25 ; 3 . 14159 ] ) ) ) ; test 44 0 ( normalize_comparison ( compare ( from_list complex32 [ Complex . zero ; Complex . one ; Complex . i ] ) ( from_list complex32 [ Complex . zero ; Complex . one ; Complex . i ] ) ) ) ; test 45 ( - 1 ) ( normalize_comparison ( compare ( from_list complex32 [ Complex . zero ; Complex . one ; Complex . i ] ) ( from_list complex32 [ Complex . zero ; Complex . one ; Complex . one ] ) ) ) ; test 46 1 ( normalize_comparison ( compare ( from_list complex32 [ Complex . zero ; Complex . one ; Complex . one ] ) ( from_list complex32 [ Complex . zero ; Complex . one ; Complex . i ] ) ) ) ; test 47 0 ( normalize_comparison ( compare ( from_list complex64 [ Complex . zero ; Complex . one ; Complex . i ] ) ( from_list complex64 [ Complex . zero ; Complex . one ; Complex . i ] ) ) ) ; test 48 ( - 1 ) ( normalize_comparison ( compare ( from_list complex64 [ Complex . zero ; Complex . one ; Complex . i ] ) ( from_list complex64 [ Complex . zero ; Complex . one ; Complex . one ] ) ) ) ; test 49 1 ( normalize_comparison ( compare ( from_list complex64 [ Complex . zero ; Complex . one ; Complex . one ] ) ( from_list complex64 [ Complex . zero ; Complex . one ; Complex . i ] ) ) ) ; testing_function " dim " ; test 1 ( Array1 . dim ( from_list int [ 1 ; 2 ; 3 ; 4 ; 5 ] ) ) 5 ; test 2 ( Array1 . dim ( from_list_fortran int [ 1 ; 2 ; 3 ] ) ) 3 ; testing_function " kind & layout " ; let a = from_list int [ 1 ; 2 ; 3 ] in test 1 ( Array1 . kind a ) int ; test 2 ( Array1 . layout a ) c_layout ; let a = from_list_fortran float32 [ 1 . 0 ; 2 . 0 ; 3 . 0 ] in test 1 ( Array1 . kind a ) float32 ; test 2 ( Array1 . layout a ) fortran_layout ; testing_function " sub " ; let a = from_list int [ 1 ; 2 ; 3 ; 4 ; 5 ; 6 ; 7 ; 8 ] in test 1 ( Array1 . sub a 2 5 ) ( from_list int [ 3 ; 4 ; 5 ; 6 ; 7 ] ) ; test 2 ( Array1 . sub a 0 2 ) ( from_list int [ 1 ; 2 ] ) ; test 3 ( Array1 . sub a 0 8 ) ( from_list int [ 1 ; 2 ; 3 ; 4 ; 5 ; 6 ; 7 ; 8 ] ) ; let a = from_list float64 [ 1 . 0 ; 2 . 0 ; 3 . 0 ; 4 . 0 ; 5 . 0 ; 6 . 0 ; 7 . 0 ; 8 . 0 ] in test 4 ( Array1 . sub a 2 5 ) ( from_list float64 [ 3 . 0 ; 4 . 0 ; 5 . 0 ; 6 . 0 ; 7 . 0 ] ) ; test 5 ( Array1 . sub a 0 2 ) ( from_list float64 [ 1 . 0 ; 2 . 0 ] ) ; test 6 ( Array1 . sub a 0 8 ) ( from_list float64 [ 1 . 0 ; 2 . 0 ; 3 . 0 ; 4 . 0 ; 5 . 0 ; 6 . 0 ; 7 . 0 ; 8 . 0 ] ) ; let a = from_list_fortran float64 [ 1 . 0 ; 2 . 0 ; 3 . 0 ; 4 . 0 ; 5 . 0 ; 6 . 0 ; 7 . 0 ; 8 . 0 ] in test 7 ( Array1 . sub a 2 5 ) ( from_list_fortran float64 [ 2 . 0 ; 3 . 0 ; 4 . 0 ; 5 . 0 ; 6 . 0 ] ) ; test 8 ( Array1 . sub a 1 2 ) ( from_list_fortran float64 [ 1 . 0 ; 2 . 0 ] ) ; test 9 ( Array1 . sub a 1 8 ) ( from_list_fortran float64 [ 1 . 0 ; 2 . 0 ; 3 . 0 ; 4 . 0 ; 5 . 0 ; 6 . 0 ; 7 . 0 ; 8 . 0 ] ) ; Gc . full_major ( ) ; testing_function " blit , fill " ; let test_blit_fill kind data initval ofs len = let a = from_list kind data in let b = Array1 . create kind c_layout ( List . length data ) in Array1 . blit a b ; ( a = b ) && ( Array1 . fill ( Array1 . sub b ofs len ) initval ; let rec check i = function [ ] -> true | hd :: tl -> b . { i } = ( if i >= ofs && i < ofs + len then initval else hd ) && check ( i + 1 ) tl in check 0 data ) in test 1 true ( test_blit_fill int8_signed [ 1 ; 2 ; 5 ; 8 ; - 100 ; 127 ] 7 3 2 ) ; test 2 true ( test_blit_fill int8_unsigned [ 1 ; 2 ; 5 ; 8 ; - 100 ; 212 ] 7 3 2 ) ; test 3 true ( test_blit_fill int16_signed [ 1 ; 2 ; 5 ; 8 ; - 100 ; 212 ] 7 3 2 ) ; test 4 true ( test_blit_fill int16_unsigned [ 1 ; 2 ; 5 ; 8 ; - 100 ; 212 ] 7 3 2 ) ; test 5 true ( test_blit_fill int [ 1 ; 2 ; 5 ; 8 ; - 100 ; 212 ] 7 3 2 ) ; test 6 true ( test_blit_fill int32 ( List . map Int32 . of_int [ 1 ; 2 ; 5 ; 8 ; - 100 ; 212 ] ) ( Int32 . of_int 7 ) 3 2 ) ; test 7 true ( test_blit_fill int64 ( List . map Int64 . of_int [ 1 ; 2 ; 5 ; 8 ; - 100 ; 212 ] ) ( Int64 . of_int 7 ) 3 2 ) ; test 8 true ( test_blit_fill nativeint ( List . map Nativeint . of_int [ 1 ; 2 ; 5 ; 8 ; - 100 ; 212 ] ) ( Nativeint . of_int 7 ) 3 2 ) ; test 9 true ( test_blit_fill float32 [ 1 . 0 ; 2 . 0 ; 0 . 5 ; 0 . 125 ; 256 . 0 ; 512 . 0 ] 0 . 25 3 2 ) ; test 10 true ( test_blit_fill float64 [ 1 . 0 ; 2 . 0 ; 5 . 0 ; 8 . 123 ; - 100 . 456 ; 212e19 ] 3 . 1415 3 2 ) ; test 11 true ( test_blit_fill complex32 [ Complex . zero ; Complex . one ; Complex . i ] Complex . i 1 1 ) ; test 12 true ( test_blit_fill complex64 [ Complex . zero ; Complex . one ; Complex . i ] Complex . i 1 1 ) ; print_newline ( ) ; testing_function " ------ Array2 " ; -------- testing_function " create / set / get " ; 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 let check_array2 a ind0 dim1 dim2 fromint = try for i = ind0 to dim1 - 1 + ind0 do for j = ind0 to dim2 - 1 + ind0 do if a . { i , j } <> ( fromint ( i * 1000 + j ) ) then raise Exit done done ; true with Exit -> false in let id x = x in test 1 true ( check_array2 ( make_array2 int16_signed c_layout 0 10 20 id ) 0 10 20 id ) ; test 2 true ( check_array2 ( make_array2 int c_layout 0 10 20 id ) 0 10 20 id ) ; test 3 true ( check_array2 ( make_array2 int32 c_layout 0 10 20 Int32 . of_int ) 0 10 20 Int32 . of_int ) ; test 4 true ( check_array2 ( make_array2 float32 c_layout 0 10 20 float ) 0 10 20 float ) ; test 5 true ( check_array2 ( make_array2 float64 c_layout 0 10 20 float ) 0 10 20 float ) ; test 6 true ( check_array2 ( make_array2 int16_signed fortran_layout 1 10 20 id ) 1 10 20 id ) ; test 7 true ( check_array2 ( make_array2 int fortran_layout 1 10 20 id ) 1 10 20 id ) ; test 8 true ( check_array2 ( make_array2 int32 fortran_layout 1 10 20 Int32 . of_int ) 1 10 20 Int32 . of_int ) ; test 9 true ( check_array2 ( make_array2 float32 fortran_layout 1 10 20 float ) 1 10 20 float ) ; test 10 true ( check_array2 ( make_array2 float64 fortran_layout 1 10 20 float ) 1 10 20 float ) ; let makecomplex i = { re = float i ; im = float ( - i ) } in test 11 true ( check_array2 ( make_array2 complex32 c_layout 0 10 20 makecomplex ) 0 10 20 makecomplex ) ; test 12 true ( check_array2 ( make_array2 complex64 c_layout 0 10 20 makecomplex ) 0 10 20 makecomplex ) ; test 13 true ( check_array2 ( make_array2 complex32 fortran_layout 1 10 20 makecomplex ) 1 10 20 makecomplex ) ; test 14 true ( check_array2 ( make_array2 complex64 fortran_layout 1 10 20 makecomplex ) 1 10 20 makecomplex ) ; testing_function " set / get ( specialized ) " ; let a = Array2 . create int16_signed c_layout 3 3 in for i = 0 to 2 do for j = 0 to 2 do a . { i , j } <- i - j done done ; let ok = ref true in for i = 0 to 2 do for j = 0 to 2 do if a . { i , j } <> i - j then ok := false done done ; test 1 true ! ok ; test 2 true ( try ignore a . { 3 , 0 } ; false with Invalid_argument _ -> true ) ; test 3 true ( try ignore a . { - 1 , 0 } ; false with Invalid_argument _ -> true ) ; test 4 true ( try ignore a . { 0 , 3 } ; false with Invalid_argument _ -> true ) ; test 5 true ( try ignore a . { 0 , - 1 } ; false with Invalid_argument _ -> true ) ; let b = Array2 . create float32 fortran_layout 3 3 in for i = 1 to 3 do for j = 1 to 3 do b . { i , j } <- float ( i - j ) done done ; let ok = ref true in for i = 1 to 3 do for j = 1 to 3 do if b . { i , j } <> float ( i - j ) then ok := false done done ; test 6 true ! ok ; test 7 true ( try ignore b . { 4 , 1 } ; false with Invalid_argument _ -> true ) ; test 8 true ( try ignore b . { 0 , 1 } ; false with Invalid_argument _ -> true ) ; test 9 true ( try ignore b . { 1 , 4 } ; false with Invalid_argument _ -> true ) ; test 10 true ( try ignore b . { 1 , 0 } ; false with Invalid_argument _ -> true ) ; testing_function " set / get ( unsafe , specialized ) " ; let a = Array2 . create int16_signed c_layout 3 3 in for i = 0 to 2 do for j = 0 to 2 do Array2 . unsafe_set a i j ( i - j ) done done ; let ok = ref true in for i = 0 to 2 do for j = 0 to 2 do if Array2 . unsafe_get a i j <> i - j then ok := false done done ; test 1 true ! ok ; let b = Array2 . create float32 fortran_layout 3 3 in for i = 1 to 3 do for j = 1 to 3 do Array2 . unsafe_set b i j ( float ( i - j ) ) done done ; let ok = ref true in for i = 1 to 3 do for j = 1 to 3 do if Array2 . unsafe_get b i j <> float ( i - j ) then ok := false done done ; test 2 true ! ok ; testing_function " dim " ; let a = ( make_array2 int c_layout 0 4 6 id ) in test 1 ( Array2 . dim1 a ) 4 ; test 2 ( Array2 . dim2 a ) 6 ; let b = ( make_array2 int fortran_layout 1 4 6 id ) in test 3 ( Array2 . dim1 b ) 4 ; test 4 ( Array2 . dim2 b ) 6 ; testing_function " sub " ; let a = make_array2 int c_layout 0 5 3 id in let b = Array2 . sub_left a 2 2 in test 1 true ( b . { 0 , 0 } = 2000 && b . { 0 , 1 } = 2001 && b . { 0 , 2 } = 2002 && b . { 1 , 0 } = 3000 && b . { 1 , 1 } = 3001 && b . { 1 , 2 } = 3002 ) ; let a = make_array2 int fortran_layout 1 5 3 id in let b = Array2 . sub_right a 2 2 in test 2 true ( b . { 1 , 1 } = 1002 && b . { 1 , 2 } = 1003 && b . { 2 , 1 } = 2002 && b . { 2 , 2 } = 2003 && b . { 3 , 1 } = 3002 && b . { 3 , 2 } = 3003 && b . { 4 , 1 } = 4002 && b . { 4 , 2 } = 4003 && b . { 5 , 1 } = 5002 && b . { 5 , 2 } = 5003 ) ; testing_function " slice " ; let a = make_array2 int c_layout 0 5 3 id in test 1 ( Array2 . slice_left a 0 ) ( from_list int [ 0 ; 1 ; 2 ] ) ; test 2 ( Array2 . slice_left a 1 ) ( from_list int [ 1000 ; 1001 ; 1002 ] ) ; test 3 ( Array2 . slice_left a 2 ) ( from_list int [ 2000 ; 2001 ; 2002 ] ) ; test 4 ( Array2 . slice_left a 3 ) ( from_list int [ 3000 ; 3001 ; 3002 ] ) ; test 5 ( Array2 . slice_left a 4 ) ( from_list int [ 4000 ; 4001 ; 4002 ] ) ; let a = make_array2 int fortran_layout 1 5 3 id in test 6 ( Array2 . slice_right a 1 ) ( from_list_fortran int [ 1001 ; 2001 ; 3001 ; 4001 ; 5001 ] ) ; test 7 ( Array2 . slice_right a 2 ) ( from_list_fortran int [ 1002 ; 2002 ; 3002 ; 4002 ; 5002 ] ) ; test 8 ( Array2 . slice_right a 3 ) ( from_list_fortran int [ 1003 ; 2003 ; 3003 ; 4003 ; 5003 ] ) ; print_newline ( ) ; testing_function " ------ Array3 " ; -------- testing_function " create / set / get " ; let make_array3 kind layout ind0 dim1 dim2 dim3 fromint = let a = Array3 . create kind layout dim1 dim2 dim3 in for i = ind0 to dim1 - 1 + ind0 do for j = ind0 to dim2 - 1 + ind0 do for k = ind0 to dim3 - 1 + ind0 do a . { i , j , k } <- ( fromint ( i * 100 + j * 10 + k ) ) done done done ; a in let check_array3 a ind0 dim1 dim2 dim3 fromint = try for i = ind0 to dim1 - 1 + ind0 do for j = ind0 to dim2 - 1 + ind0 do for k = ind0 to dim3 - 1 + ind0 do if a . { i , j , k } <> ( fromint ( i * 100 + j * 10 + k ) ) then raise Exit done done done ; true with Exit -> false in let id x = x in test 1 true ( check_array3 ( make_array3 int16_signed c_layout 0 4 5 6 id ) 0 4 5 6 id ) ; test 2 true ( check_array3 ( make_array3 int c_layout 0 4 5 6 id ) 0 4 5 6 id ) ; test 3 true ( check_array3 ( make_array3 int32 c_layout 0 4 5 6 Int32 . of_int ) 0 4 5 6 Int32 . of_int ) ; test 4 true ( check_array3 ( make_array3 float32 c_layout 0 4 5 6 float ) 0 4 5 6 float ) ; test 5 true ( check_array3 ( make_array3 float64 c_layout 0 4 5 6 float ) 0 4 5 6 float ) ; test 6 true ( check_array3 ( make_array3 int16_signed fortran_layout 1 4 5 6 id ) 1 4 5 6 id ) ; test 7 true ( check_array3 ( make_array3 int fortran_layout 1 4 5 6 id ) 1 4 5 6 id ) ; test 8 true ( check_array3 ( make_array3 int32 fortran_layout 1 4 5 6 Int32 . of_int ) 1 4 5 6 Int32 . of_int ) ; test 9 true ( check_array3 ( make_array3 float32 fortran_layout 1 4 5 6 float ) 1 4 5 6 float ) ; test 10 true ( check_array3 ( make_array3 float64 fortran_layout 1 4 5 6 float ) 1 4 5 6 float ) ; test 11 true ( check_array3 ( make_array3 complex32 c_layout 0 4 5 6 makecomplex ) 0 4 5 6 makecomplex ) ; test 12 true ( check_array3 ( make_array3 complex64 c_layout 0 4 5 6 makecomplex ) 0 4 5 6 makecomplex ) ; test 13 true ( check_array3 ( make_array3 complex32 fortran_layout 1 4 5 6 makecomplex ) 1 4 5 6 makecomplex ) ; test 14 true ( check_array3 ( make_array3 complex64 fortran_layout 1 4 5 6 makecomplex ) 1 4 5 6 makecomplex ) ; testing_function " set / get ( specialized ) " ; let a = Array3 . create int32 c_layout 2 3 4 in for i = 0 to 1 do for j = 0 to 2 do for k = 0 to 3 do a . { i , j , k } <- Int32 . of_int ( ( i lsl 4 ) + ( j lsl 2 ) + k ) done done done ; let ok = ref true in for i = 0 to 1 do for j = 0 to 2 do for k = 0 to 3 do if Int32 . to_int a . { i , j , k } <> ( i lsl 4 ) + ( j lsl 2 ) + k then ok := false done done done ; test 1 true ! ok ; let b = Array3 . create int64 fortran_layout 2 3 4 in for i = 1 to 2 do for j = 1 to 3 do for k = 1 to 4 do b . { i , j , k } <- Int64 . of_int ( ( i lsl 4 ) + ( j lsl 2 ) + k ) done done done ; let ok = ref true in for i = 1 to 2 do for j = 1 to 3 do for k = 1 to 4 do if Int64 . to_int b . { i , j , k } <> ( i lsl 4 ) + ( j lsl 2 ) + k then ok := false done done done ; test 2 true ! ok ; testing_function " set / get ( unsafe , specialized ) " ; let a = Array3 . create int32 c_layout 2 3 4 in for i = 0 to 1 do for j = 0 to 2 do for k = 0 to 3 do Array3 . unsafe_set a i j k ( Int32 . of_int ( ( i lsl 4 ) + ( j lsl 2 ) + k ) ) done done done ; let ok = ref true in for i = 0 to 1 do for j = 0 to 2 do for k = 0 to 3 do if Int32 . to_int ( Array3 . unsafe_get a i j k ) <> ( i lsl 4 ) + ( j lsl 2 ) + k then ok := false done done done ; test 1 true ! ok ; testing_function " dim " ; let a = ( make_array3 int c_layout 0 4 5 6 id ) in test 1 ( Array3 . dim1 a ) 4 ; test 2 ( Array3 . dim2 a ) 5 ; test 3 ( Array3 . dim3 a ) 6 ; let b = ( make_array3 int fortran_layout 1 4 5 6 id ) in test 4 ( Array3 . dim1 b ) 4 ; test 5 ( Array3 . dim2 b ) 5 ; test 6 ( Array3 . dim3 b ) 6 ; testing_function " slice1 " ; let a = make_array3 int c_layout 0 3 3 3 id in test 1 ( Array3 . slice_left_1 a 0 0 ) ( from_list int [ 0 ; 1 ; 2 ] ) ; test 2 ( Array3 . slice_left_1 a 0 1 ) ( from_list int [ 10 ; 11 ; 12 ] ) ; test 3 ( Array3 . slice_left_1 a 0 2 ) ( from_list int [ 20 ; 21 ; 22 ] ) ; test 4 ( Array3 . slice_left_1 a 1 1 ) ( from_list int [ 110 ; 111 ; 112 ] ) ; test 5 ( Array3 . slice_left_1 a 2 1 ) ( from_list int [ 210 ; 211 ; 212 ] ) ; let a = make_array3 int fortran_layout 1 3 3 3 id in test 6 ( Array3 . slice_right_1 a 1 2 ) ( from_list_fortran int [ 112 ; 212 ; 312 ] ) ; test 7 ( Array3 . slice_right_1 a 3 1 ) ( from_list_fortran int [ 131 ; 231 ; 331 ] ) ; print_newline ( ) ; testing_function " ------ Reshaping " ; -------- testing_function " reshape_1 " ; let a = make_array2 int c_layout 0 3 4 id in let b = make_array2 int fortran_layout 1 3 4 id in let c = reshape_1 ( genarray_of_array2 a ) 12 in test 1 c ( from_list int [ 0 ; 1 ; 2 ; 3 ; 1000 ; 1001 ; 1002 ; 1003 ; 2000 ; 2001 ; 2002 ; 2003 ] ) ; let d = reshape_1 ( genarray_of_array2 b ) 12 in test 2 d ( from_list_fortran int [ 1001 ; 2001 ; 3001 ; 1002 ; 2002 ; 3002 ; 1003 ; 2003 ; 3003 ; 1004 ; 2004 ; 3004 ] ) ; testing_function " reshape_2 " ; let c = reshape_2 ( genarray_of_array2 a ) 4 3 in test 1 ( Array2 . slice_left c 0 ) ( from_list int [ 0 ; 1 ; 2 ] ) ; test 2 ( Array2 . slice_left c 1 ) ( from_list int [ 3 ; 1000 ; 1001 ] ) ; test 3 ( Array2 . slice_left c 2 ) ( from_list int [ 1002 ; 1003 ; 2000 ] ) ; test 4 ( Array2 . slice_left c 3 ) ( from_list int [ 2001 ; 2002 ; 2003 ] ) ; let d = reshape_2 ( genarray_of_array2 b ) 4 3 in test 5 ( Array2 . slice_right d 1 ) ( from_list_fortran int [ 1001 ; 2001 ; 3001 ; 1002 ] ) ; test 6 ( Array2 . slice_right d 2 ) ( from_list_fortran int [ 2002 ; 3002 ; 1003 ; 2003 ] ) ; test 7 ( Array2 . slice_right d 3 ) ( from_list_fortran int [ 3003 ; 1004 ; 2004 ; 3004 ] ) ; print_newline ( ) ; testing_function " ------ I / O " ; -------- testing_function " output_value / input_value " ; let test_structured_io testno value = let tmp = Filename . temp_file " bigarray " " . data " in let oc = open_out_bin tmp in output_value oc value ; close_out oc ; let ic = open_in_bin tmp in let value ' = input_value ic in close_in ic ; Sys . remove tmp ; test testno value value ' in test_structured_io 1 ( from_list int8_signed [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ; test_structured_io 2 ( from_list int16_signed [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ; test_structured_io 3 ( from_list int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ; test_structured_io 4 ( from_list int32 ( List . map Int32 . of_int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ; test_structured_io 5 ( from_list int64 ( List . map Int64 . of_int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ; test_structured_io 6 ( from_list nativeint ( List . map Nativeint . of_int [ 1 ; 2 ; 3 ; - 4 ; 127 ; - 128 ] ) ) ; test_structured_io 7 ( from_list float32 [ 0 . 0 ; 0 . 25 ; - 4 . 0 ; 3 . 141592654 ] ) ; test_structured_io 8 ( from_list float64 [ 0 . 0 ; 0 . 25 ; - 4 . 0 ; 3 . 141592654 ] ) ; test_structured_io 9 ( make_array2 int c_layout 0 100 100 id ) ; test_structured_io 10 ( make_array2 float64 fortran_layout 1 200 200 float ) ; test_structured_io 11 ( make_array3 int32 c_layout 0 20 30 40 Int32 . of_int ) ; test_structured_io 12 ( make_array3 float32 fortran_layout 1 10 50 100 float ) ; test_structured_io 13 ( make_array2 complex32 c_layout 0 100 100 makecomplex ) ; test_structured_io 14 ( make_array3 complex64 fortran_layout 1 10 20 30 makecomplex ) ; testing_function " map_file " ; let mapped_file = Filename . temp_file " bigarray " " . data " in begin let fd = Unix . openfile mapped_file [ Unix . O_RDWR ; Unix . O_TRUNC ; Unix . O_CREAT ] 0o666 in let a = Array1 . map_file fd float64 c_layout true 10000 in Unix . close fd ; for i = 0 to 9999 do a . { i } <- float i done ; let fd = Unix . openfile mapped_file [ Unix . O_RDONLY ] 0 in let b = Array2 . map_file fd float64 fortran_layout false 100 ( - 1 ) in Unix . close fd ; let ok = ref true in for i = 0 to 99 do for j = 0 to 99 do if b . { j + 1 , i + 1 } <> float ( 100 * i + j ) then ok := false done done ; test 1 ! ok true ; b . { 50 , 50 } <- ( - 1 . 0 ) ; let fd = Unix . openfile mapped_file [ Unix . O_RDONLY ] 0 in let c = Array2 . map_file fd float64 c_layout false ( - 1 ) 100 in Unix . close fd ; let ok = ref true in for i = 0 to 99 do for j = 0 to 99 do if c . { i , j } <> float ( 100 * i + j ) then ok := false done done ; test 2 ! ok true ; let fd = Unix . openfile mapped_file [ Unix . O_RDONLY ] 0 in let c = Array2 . map_file fd ~ pos : 800L float64 c_layout false ( - 1 ) 100 in Unix . close fd ; let ok = ref true in for i = 1 to 99 do for j = 0 to 99 do if c . { i - 1 , j } <> float ( 100 * i + j ) then ok := false done done ; test 3 ! ok true ; let fd = Unix . openfile mapped_file [ Unix . O_RDONLY ] 0 in let c = Array2 . map_file fd ~ pos : 79200L float64 c_layout false ( - 1 ) 100 in Unix . close fd ; let ok = ref true in for j = 0 to 99 do if c . { 0 , j } <> float ( 100 * 99 + j ) then ok := false done ; test 4 ! ok true end ; Gc . full_major ( ) ; Sys . remove mapped_file ; ( ) |
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 " ; -------- testing_function " Passing an array to C " ; c_printtab ( make_array2 float64 c_layout 0 6 8 float ) ; testing_function " Accessing a C array " ; let a = c_filltab ( ) in test 1 a . { 0 , 0 } 0 . 0 ; test 2 a . { 1 , 0 } 100 . 0 ; test 3 a . { 0 , 1 } 1 . 0 ; test 4 a . { 5 , 4 } 504 . 0 ; testing_function " Passing an array to Fortran " ; fortran_printtab ( make_array2 float32 fortran_layout 1 5 4 float ) ; testing_function " Accessing a Fortran array " ; let a = fortran_filltab ( ) in test 1 a . { 1 , 1 } 101 . 0 ; test 2 a . { 2 , 1 } 201 . 0 ; test 3 a . { 1 , 2 } 102 . 0 ; test 4 a . { 5 , 4 } 504 . 0 ; |
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_value ) 0 ( num_digits_big_int bi2 ) ( bi1 . abs_value ) 0 ( num_digits_big_int bi1 ) |
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 size_bi = num_digits_big_int bi in let size_res = succ ( size_bi ) in let copy_bi = create_nat ( size_res ) in blit_nat copy_bi 0 ( bi . abs_value ) 0 size_bi ; set_digit_nat copy_bi size_bi 0 ; ignore ( incr_nat copy_bi 0 size_res 1 ) ; { sign = - 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 size_bi = num_digits_big_int bi in let size_res = succ ( size_bi ) in let copy_bi = create_nat ( size_res ) in blit_nat copy_bi 0 ( bi . abs_value ) 0 size_bi ; set_digit_nat copy_bi size_bi 0 ; ignore ( incr_nat copy_bi 0 size_res 1 ) ; { sign = 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 0 ( bi2 . abs_value ) 0 size_bi2 ; set_digit_nat res size_bi2 0 ; ignore ( add_nat res 0 ( succ size_bi2 ) ( bi1 . abs_value ) 0 size_bi1 0 ) ; res ) | _ -> let res = create_nat ( succ size_bi1 ) in ( blit_nat res 0 ( bi1 . abs_value ) 0 size_bi1 ; set_digit_nat res size_bi1 0 ; ignore ( add_nat res 0 ( succ size_bi1 ) ( bi2 . abs_value ) 0 size_bi2 0 ) ; res ) } else match compare_nat ( bi1 . abs_value ) 0 size_bi1 ( bi2 . abs_value ) 0 size_bi2 with 0 -> zero_big_int | 1 -> { sign = bi1 . sign ; abs_value = let res = copy_nat ( bi1 . abs_value ) 0 size_bi1 in ( ignore ( sub_nat res 0 size_bi1 ( bi2 . abs_value ) 0 size_bi2 1 ) ; res ) } | _ -> { sign = bi2 . sign ; abs_value = let res = copy_nat ( bi2 . abs_value ) 0 size_bi2 in ( ignore ( sub_nat res 0 size_bi2 ( bi1 . abs_value ) 0 size_bi1 1 ) ; 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_int ) 0 ) ; { sign = - ( sign_big_int bi ) ; abs_value = res } else let res = make_nat ( size_res ) in ignore ( mult_digit_nat res 0 size_res ( bi . abs_value ) 0 size_bi ( nat_of_int ( abs i ) ) 0 ) ; { sign = ( sign_int i ) * ( sign_big_int bi ) ; abs_value = res } |
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 ( bi1 . abs_value ) 0 size_bi1 ) ; res ) else ( ignore ( mult_nat res 0 size_res ( bi1 . abs_value ) 0 size_bi1 ( bi2 . abs_value ) 0 size_bi2 ) ; res ) } |
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 >= 0 then ( big_int_of_int ( - 1 ) , add_big_int bi2 bi1 ) else ( big_int_of_int 1 , sub_big_int bi1 bi2 ) | 0 -> ( big_int_of_int ( bi1 . sign * bi2 . sign ) , zero_big_int ) | _ -> let bi1_negatif = bi1 . sign = - 1 in let size_q = if bi1_negatif then succ ( max ( succ ( size_bi1 - size_bi2 ) ) 1 ) else max ( succ ( size_bi1 - size_bi2 ) ) 1 and size_r = succ ( max size_bi1 size_bi2 ) in let q = create_nat size_q and r = create_nat size_r in blit_nat r 0 ( bi1 . abs_value ) 0 size_bi1 ; set_to_zero_nat r size_bi1 ( size_r - size_bi1 ) ; div_nat r 0 size_r ( bi2 . abs_value ) 0 size_bi2 ; blit_nat q 0 r size_bi2 ( size_r - size_bi2 ) ; let not_null_mod = not ( is_zero_nat r 0 size_bi2 ) in if bi1_negatif && not_null_mod then ( let new_r = copy_nat ( bi2 . abs_value ) 0 size_bi2 in { sign = - bi2 . sign ; abs_value = ( set_digit_nat q ( pred size_q ) 0 ; ignore ( incr_nat q 0 size_q 1 ) ; q ) } , { sign = 1 ; abs_value = ( ignore ( sub_nat new_r 0 size_bi2 r 0 size_bi2 1 ) ; new_r ) } ) else ( if bi1_negatif then set_digit_nat q ( pred size_q ) 0 ; { sign = if is_zero_nat q 0 size_q then 0 else bi1 . sign * bi2 . sign ; abs_value = q } , { sign = if not_null_mod then 1 else 0 ; abs_value = copy_nat r 0 size_bi2 } ) |
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 ( bi1 . abs_value ) 0 size_bi1 ( bi2 . abs_value ) 0 size_bi2 with 0 -> bi1 . abs_value | 1 -> let res = copy_nat ( bi1 . abs_value ) 0 size_bi1 in let len = gcd_nat res 0 size_bi1 ( bi2 . abs_value ) 0 size_bi2 in copy_nat res 0 len | _ -> let res = copy_nat ( bi2 . abs_value ) 0 size_bi2 in let len = gcd_nat res 0 size_bi2 ( bi1 . abs_value ) 0 size_bi1 in copy_nat res 0 len } |
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_of_big_int " |
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_native res 1 ( Int64 . to_nativeint ( Int64 . shift_right absi 32 ) ) ; { sign = sg ; abs_value = res } end |
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 ( nth_digit_nat_native bi . abs_value 0 ) ) 0xFFFFFFFFL ) ( Int64 . shift_left ( Int64 . of_nativeint ( nth_digit_nat_native bi . abs_value 1 ) ) 32 ) | _ -> failwith " int64_of_big_int " in if bi . sign >= 0 then if i >= 0L then i else failwith " int64_of_big_int " else if i >= 0L || i = Int64 . min_int then Int64 . neg i else failwith " int64_of_big_int " end |
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 off len ) ( big_int_of_int ( succ pmax ) ) in ( int_of_big_int x , int_of_big_int y ) in if n = 0 then copy_nat power_base ( pred rem ) 1 else begin let res = make_nat n and res2 = make_nat ( succ n ) and l = num_bits_int n - 2 in let p = ref ( 1 lsl l ) in blit_nat res 0 power_base pmax 1 ; for i = l downto 0 do let len = num_digits_nat res 0 n in let len2 = min n ( 2 * len ) in let succ_len2 = succ len2 in ignore ( square_nat res2 0 len2 res 0 len ) ; begin if n land ! p > 0 then ( set_to_zero_nat res 0 len ; ignore ( mult_digit_nat res 0 succ_len2 res2 0 len2 power_base pmax ) ) else blit_nat res 0 res2 0 len2 end ; set_to_zero_nat res2 0 len2 ; p := ! p lsr 1 done ; if rem > 0 then ( ignore ( mult_digit_nat res2 0 ( succ n ) res 0 n power_base ( pred rem ) ) ; res2 ) else res end |
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_nat res 0 bi . abs_value 0 bi_len ; for i = l downto 0 do let len = num_digits_nat res 0 res_len in let len2 = min res_len ( 2 * len ) in set_to_zero_nat res2 0 len2 ; ignore ( square_nat res2 0 len2 res 0 len ) ; if n land ! p > 0 then begin let lenp = min res_len ( len2 + bi_len ) in set_to_zero_nat res 0 lenp ; ignore ( mult_nat res 0 lenp res2 0 len2 ( bi . abs_value ) 0 bi_len ) end else begin blit_nat res 0 res2 0 len2 end ; p := ! p lsr 1 done ; { sign = if bi . sign >= 0 then bi . sign else if n land 1 = 0 then 1 else - 1 ; abs_value = res } |
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 ; abs_value = nat } |
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_memory |
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 . abs_value ) len_bi nat len_nat = - 1 then invalid_arg " base_power_big_int " else let copy = create_nat ( succ len_bi ) in blit_nat copy 0 ( bi . abs_value ) 0 len_bi ; set_digit_nat copy len_bi 0 ; div_nat copy 0 ( succ len_bi ) nat 0 len_nat ; if not ( is_zero_nat copy 0 len_nat ) then invalid_arg " base_power_big_int " else { sign = bi . sign ; abs_value = copy_nat copy len_nat 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 let new_len = len_bi + len_nat in let res = make_nat new_len in ignore ( if len_bi > len_nat then mult_nat res 0 new_len ( bi . abs_value ) 0 len_bi nat 0 len_nat else mult_nat res 0 new_len nat 0 len_nat ( bi . abs_value ) 0 len_bi ) ; if is_zero_nat res 0 new_len then zero_big_int else create_big_int ( bi . sign ) res |
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 ) ) else ( String . set s l ( Char . chr ( succ ( Char . code current_char ) ) ) ; false ) end in round_rec ( pred l ) else false |
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 ( power_int_positive_int 10 n ) ) in let ( sign , off , len ) = if String . get s 0 = ' ' - then ( " " , - 1 , succ prec ) else ( " " , 0 , prec ) in if ( round_futur_last_digit s off ( succ prec ) ) then ( sign " ^ 1 . " ( ^ String . make prec ' 0 ' ) " ^ e " ^ ( string_of_int ( n + 1 - off + String . length s ) ) ) else ( sign ( ^ String . sub s off 1 ) " . " ^^ ( String . sub s ( succ off ) ( pred prec ) ) " ^ e " ( ^ string_of_int ( n - succ off + String . length s ) ) ) |
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_digit in set_to_zero_nat res 0 ndigits ; blit_nat res ndigits bi . abs_value 0 size_bi ; let nbits = n mod length_of_digit in if nbits > 0 then shift_left_nat res ndigits size_bi res ( ndigits + size_bi ) nbits ; { sign = bi . sign ; abs_value = res } end |
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_int else begin let size_res = size_bi - ndigits in let res = create_nat size_res in blit_nat res 0 bi . abs_value ndigits size_res ; if nbits > 0 then begin let tmp = create_nat 1 in shift_right_nat res 0 size_res tmp 0 nbits end ; if is_zero_nat res 0 size_res then zero_big_int else { sign = bi . sign ; abs_value = res } end end |
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 ) ) ; ignore ( decr_nat res 0 size_res 0 ) ; { sign = 1 ; abs_value = res } end |
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 = make_nat size_res in if ndigits < size_bi then blit_nat res 0 bi . abs_value ndigits ( min size_res ( size_bi - ndigits ) ) ; if bi . sign < 0 then begin complement_nat res 0 size_res ; ignore ( incr_nat res 0 size_res 1 ) end ; if nbits > 0 then begin let tmp = create_nat 1 in shift_right_nat res 0 size_res tmp 0 nbits end ; let n ' = n mod length_of_digit in if n ' > 0 then begin let tmp = create_nat 1 in set_digit_nat_native tmp 0 ( Nativeint . shift_right_logical ( - 1n ) ( length_of_digit - n ' ) ) ; land_digit_nat res ( size_res - 1 ) tmp 0 end ; if is_zero_nat res 0 size_res then zero_big_int else { sign = 1 ; abs_value = res } end |
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_value 0 size_res ; for i = 0 to size_res - 1 do land_digit_nat res i b . abs_value i done ; if is_zero_nat res 0 size_res then zero_big_int else { sign = 1 ; abs_value = res } end |
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 ' = blit_nat res 0 a ' . abs_value 0 size_res ; for i = 0 to size_b ' - 1 do lor_digit_nat res i b ' . abs_value i done in if size_a >= size_b then or_aux a b size_b else or_aux b a size_a ; if is_zero_nat res 0 size_res then zero_big_int else { sign = 1 ; abs_value = res } end |
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 ' = blit_nat res 0 a ' . abs_value 0 size_res ; for i = 0 to size_b ' - 1 do lxor_digit_nat res i b ' . abs_value i done in if size_a >= size_b then xor_aux a b size_b else xor_aux b a size_a ; if is_zero_nat res 0 size_res then zero_big_int else { sign = 1 ; abs_value = res } end |
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_mode . normal let imported_variables = create imported_variables Name_mode . in_types let binding_time t = t lsr 2 let [ @ inline always ] name_mode t = match t land 3 with | 0 -> Name_mode . normal | 1 -> Name_mode . in_types | 2 -> Name_mode . phantom | _ -> assert false let scoped_name_mode t ~ min_binding_time = if binding_time t < earliest_var || min_binding_time <= binding_time t then name_mode t else Name_mode . in_types let print ppf t = Format . fprintf ppf " ( bound at time % d % a ) " ( binding_time t ) Name_mode . print ( name_mode t ) let equal t1 t2 = t1 = t2 end |
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 ] ; > v . [ < i ] > <- temp ) ) else if v . [ < i ] > . < v . [ < ixj ] > then ( temp := v . [ < ixj ] ; > v . [ < ixj ] > <- v . [ < i ] ; > v . [ < i ] > <- temp ) ; end |
let exchange ( v : ( float , Bigarray . float32_elt ) Spoc . Vector . vector ) i j : unit = let t : float = v . [ < i ] > in v . [ < i ] > <- v . [ < j ] ; > v . [ < j ] > <- t ; ; |
let rec sortup v m n : unit = if n <> 1 then begin sortup v m ( n / 2 ) ; sortdown v ( m + n / 2 ) ( n / 2 ) ; mergeup v m ( n / 2 ) ; end m n : unit = if n <> 1 then begin sortup v m ( n / 2 ) ; sortdown v ( m + n / 2 ) ( n / 2 ) ; mergedown v m ( n / 2 ) ; end ( m : int ) ( n : int ) : unit = if n <> 0 then begin for i = 0 to n - 1 do if v . [ < m + i ] > > v . [ < m + i + n ] > then exchange v ( m + i ) ( m + i + n ) ; done ; mergeup v m ( n / 2 ) ; mergeup v ( m + n ) ( n / 2 ) end m n = if n <> 0 then begin for i = 0 to n - 1 do if v . [ < m + i ] > < v . [ < m + i + n ] > then exchange v ( m + i ) ( m + i + n ) ; done ; mergedown v m ( n / 2 ) ; mergedown v ( m + n ) ( n / 2 ) end ; ; |
let cpt = ref 0 |
let tot_time = ref 0 . |
let measure_time s f = let t0 = Unix . gettimeofday ( ) in let a = f ( ) in let t1 = Unix . gettimeofday ( ) in Printf . printf " time % s : % Fs \ n " %! s ( t1 . - t0 ) ; tot_time := ! tot_time . + ( t1 . - t0 ) ; incr cpt ; a ; ; |
let nearest_pow2 i = let rec aux acc = let res = acc * 2 in if res < i then aux res else acc in let r = aux 1 in if r <> i then Printf . printf " Changed size value to a power of two ( % d -> % d ) \ n " i r ; r |
let ( ) = let devid = ref 0 and size = ref 1024 and check = ref true and compare = ref true in let arg1 = ( " - device " , Arg . Int ( fun i -> devid := i ) , and arg2 = ( " - size " , Arg . Int ( fun i -> size := nearest_pow2 i ) , and arg3 = ( " - bench " , Arg . Bool ( fun b -> compare := b ) , and arg4 = ( " - check " , Arg . Bool ( fun b -> check := b ) , in Arg . parse ( [ arg1 ; arg2 ; arg3 ; arg4 ] ) ( fun s -> ( ) ) " " ; let devs = Spoc . Devices . init ( ) in let dev = ref devs . ( ! devid ) in Printf . printf " Will use device : % s to sort % d floats \ n " %! ( ! dev ) . Spoc . Devices . general_info . Spoc . Devices . name ! size ; let size = ! size and check = ! check and compare = ! compare in let seq_vect = Spoc . Vector . create Vector . float32 size and gpu_vect = Spoc . Vector . create Vector . float32 size and base_vect = Spoc . Vector . create Vector . float32 size and vect_as_array = Array . make size 0 . in Random . self_init ( ) ; for i = 0 to Vector . length seq_vect - 1 do let v = Random . float 255 . in seq_vect . [ < i ] > <- v ; gpu_vect . [ < i ] > <- v ; base_vect . [ < i ] > <- v ; vect_as_array . ( i ) <- v ; done ; if compare then begin measure_time " Sequential bitonic " ( fun ( ) -> Mem . unsafe_rw true ; sortup seq_vect 0 ( Vector . length seq_vect ) ; Mem . unsafe_rw false ) ; measure_time " Sequential Array . sort " ( fun ( ) -> Array . sort Stdlib . compare vect_as_array ) ; end ; let threadsPerBlock = match ! dev . Devices . specific_info with | Devices . OpenCLInfo clI -> ( match clI . Devices . device_type with | Devices . CL_DEVICE_TYPE_CPU -> 1 | _ -> 1 ) | _ -> 1 in let blocksPerGrid = ( size + threadsPerBlock - 1 ) / threadsPerBlock in let block0 = { Spoc . Kernel . blockX = threadsPerBlock ; and grid0 = { Spoc . Kernel . gridX = blocksPerGrid ; ignore ( Kirc . gen gpu_bitonic devs . ( ! devid ) ) ; let j , k = ref 0 , ref 2 in let first = ref true in measure_time " Parallel Bitonic " ( fun ( ) -> while ! k <= size do j := ! k lsr 1 ; while ! j > 0 do if ! first then ( Kirc . run gpu_bitonic ( gpu_vect , ! j , ! k ) ( block0 , grid0 ) 0 ! dev ; first := false ) ; Kirc . run gpu_bitonic ( gpu_vect , ! j , ! k ) ( block0 , grid0 ) 0 ! dev ; j := ! j lsr 1 ; done ; k := ! k lsl 1 ; done ; Mem . to_cpu gpu_vect ( ) ; Devices . flush ! dev ( ) ; ) ; if check then ( let r = ref ( . - infinity ) in let ok = ref true in for i = 0 to size - 1 do if gpu_vect . [ < i ] > < ! r then ( Printf . printf " % d -> % s \ n " i ( Printf . sprintf " error , % g < % g " gpu_vect . [ < i ] > ! r ) ; r := Mem . get gpu_vect i ; ok := false ; ) else ( r := gpu_vect . [ < i ] ) ; > done ; if ! ok then Printf . printf " Check OK \ n " else Printf . printf " Check KO \ n " ; ) ; ; |
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 ] ; > v . [ < i ] > <- temp ) ) else if v . [ < i ] > . < v . [ < ixj ] > then ( temp := v . [ < ixj ] ; > v . [ < ixj ] > <- v . [ < i ] ; > v . [ < i ] > <- temp ) ; end |
let append_text e s = Dom . appendChild e ( document ## createTextNode ( Js . string s ) ) |
let button action = let b = createInput ~ _type ( : Js . string " button " ) document in b ## value <- ( Js . string " Go " ) ; b ## onclick <- handler action ; b |
let text name default cols = let b = createInput ~ _type ( : Js . string " text " ) document in b ## value <- ( Js . string default ) ; b ## size <- 4 ; b |
let cpt = ref 0 |
let tot_time = ref 0 . |
let measure_time s f = let t0 = Unix . gettimeofday ( ) in let a = f ( ) in let t1 = Unix . gettimeofday ( ) in Printf . printf " time % s : % Fs \ n " %! s ( t1 . - t0 ) ; tot_time := ! tot_time . + ( t1 . - t0 ) ; incr cpt ; a ; ; |
let compute size devid devs = let dev = devs . ( devid ) in Printf . printf " Will use device : % s to sort % d floats \ n " %! ( dev ) . Spoc . Devices . general_info . Spoc . Devices . name size ; let gpu_vect = Spoc . Vector . create Vector . float32 size and base_vect = Spoc . Vector . create Vector . float32 size and vect_as_array = Array . create size 0 . in Random . self_init ( ) ; for i = 0 to Vector . length gpu_vect - 1 do let v = Random . float 255 . in gpu_vect . [ < i ] > <- v ; base_vect . [ < i ] > <- v ; vect_as_array . ( i ) <- v ; done ; let threadsPerBlock = match dev . Devices . specific_info with | Devices . OpenCLInfo clI -> ( match clI . Devices . device_type with | Devices . CL_DEVICE_TYPE_CPU -> 1 | _ -> 256 ) | _ -> 256 in let blocksPerGrid = ( size + threadsPerBlock - 1 ) / threadsPerBlock in let block0 = { Spoc . Kernel . blockX = threadsPerBlock ; and grid0 = { Spoc . Kernel . gridX = blocksPerGrid ; ignore ( Kirc . gen ~ only : Devices . OpenCL gpu_bitonic ) ; let j , k = ref 0 , ref 2 in measure_time " Parallel Bitonic " ( fun ( ) -> while ! k <= size do j := ! k lsr 1 ; while ! j > 0 do Kirc . run gpu_bitonic ( gpu_vect , ! j , ! k ) ( block0 , grid0 ) 0 dev ; j := ! j lsr 1 ; done ; k := ! k lsl 1 ; done ; Mem . to_cpu gpu_vect ; Devices . flush dev ( ) ; ) ; ( let r = ref ( . - infinity ) in for i = 0 to size - 1 do if gpu_vect . [ < i ] > < ! r then failwith ( Printf . sprintf " error , % g < % g " gpu_vect . [ < i ] > ! r ) else r := gpu_vect . [ < i ] ; > done ; Printf . printf " Check OK \ n " ; ) ; ; |
let pow2 n = let rec aux acc n = if n = 1 then acc else aux ( acc * 2 ) ( n - 1 ) in aux 2 n |
let f size_text select_devices devs = ( fun _ -> let size = pow2 ( int_of_string ( Js . to_string size_text ## value ) ) in let select = select_devices ## selectedIndex + 0 in compute size select devs ; Js . _true ) ; ; |
let newLine _ = Dom_html . createBr document |
let nodeJsText t = let sp = Dom_html . createSpan document in Dom . appendChild sp ( document ## createTextNode ( t ) ) ; sp |
let nodeText t = nodeJsText ( Js . string t ) |
let go _ = let devs = Devices . init ~ only : Devices . OpenCL ( ) in let body = Js . Opt . get ( document ## getElementById ( Js . string " section1 " ) ) ( fun ( ) -> assert false ) in Dom . appendChild body ( nodeText " This sample computes a bitonic sort over a vector of float " ) ; Dom . appendChild body ( newLine ( ) ) ; Dom . appendChild body ( newLine ( ) ) ; let select_devices = createSelect document in Dom . appendChild body ( nodeText " Choose a computing device : " ) ; Array . iter ( fun ( n ) -> let option = createOption document in append_text option n . Devices . general_info . Devices . name ; Dom . appendChild select_devices option ) devs ; Dom . appendChild body select_devices ; Dom . appendChild body ( newLine ( ) ) ; let size_text = ( text " size " " 10 " 4 ) in Dom . appendChild body ( nodeText " Vector size : 2 " ) ; ^ Dom . appendChild body size_text ; Dom . appendChild body ( newLine ( ) ) ; Dom . appendChild body ( button ( f size_text select_devices devs ) ) ; Js . _false |
let _ = window ## onload <- handler go |
let number_of_data_bytes ( t : t ) = Bits0 . number_of_data_bytes t |
module Expert = struct let unsafe_underlying_repr ( t : t ) = ( t :> Bytes . t ) let offset_for_data = 8 end |
module Mutable = struct include Bits0 let is_empty a = width a = 0 let of_constant t = t let to_constant t = t let to_string t = Constant . to_binary_string t let to_int t = Constant . to_int t let copy ~ src ~ dst = let words = words src in for i = 0 to words - 1 do unsafe_set_int64 dst i ( unsafe_get_int64 src i ) done ; ; let wire _ = empty let ( -- ) a _ = a let vdd = of_constant ( Constant . of_int ~ width : 1 1 ) let gnd = of_constant ( Constant . of_int ~ width : 1 0 ) let ( &: ) c a b = let words = words a in for i = 0 to words - 1 do let x = Int64 . ( land ) ( unsafe_get_int64 a i ) ( unsafe_get_int64 b i ) in unsafe_set_int64 c i x done ; ; let ( |: ) c a b = let words = words a in for i = 0 to words - 1 do let x = Int64 . ( lor ) ( unsafe_get_int64 a i ) ( unsafe_get_int64 b i ) in unsafe_set_int64 c i x done ; ; let ( ^: ) c a b = let words = words a in for i = 0 to words - 1 do let x = Int64 . ( lxor ) ( unsafe_get_int64 a i ) ( unsafe_get_int64 b i ) in unsafe_set_int64 c i x done ; ; let ( ~: ) c a = let words = words a in for i = 0 to words - 1 do unsafe_set_int64 c i ( Int64 . ( lxor ) ( - 1L ) ( unsafe_get_int64 a i ) ) done ; mask c ; ; external add : t -> t -> t -> unit = " hardcaml_bits_add " [ @@ noalloc ] let ( +: ) dst a b = add dst a b ; mask dst ; ; external sub : t -> t -> t -> unit = " hardcaml_bits_sub " [ @@ noalloc ] let ( -: ) dst a b = sub dst a b ; mask dst ; ; let rec eq words i a b = if i = words then 1 else if Int64 . ( = ) ( unsafe_get_int64 a i ) ( unsafe_get_int64 b i ) then eq words ( i + 1 ) a b else 0 ; ; let ( ==: ) c a b = let words = words a in unsafe_set_int64 c 0 ( Int64 . of_int ( eq words 0 a b ) ) ; ; let rec neq words i a b = if i = words then 0L else if Int64 . ( = ) ( unsafe_get_int64 a i ) ( unsafe_get_int64 b i ) then neq words ( i + 1 ) a b else 1L ; ; let ( <>: ) c a b = let words = words a in unsafe_set_int64 c 0 ( neq words 0 a b ) ; ; let rec lt i a b = if i < 0 then 0 else ( match Caml . Int64 . unsigned_compare ( unsafe_get_int64 a i ) ( unsafe_get_int64 b i ) with | - 1 -> 1 | 0 -> lt ( i - 1 ) a b | _ -> 0 ) ; ; let ( <: ) c a b = let words = words a in if width a <= 63 then ( let result = if Int64 . ( < ) ( unsafe_get_int64 a 0 ) ( unsafe_get_int64 b 0 ) then 1L else 0L in unsafe_set_int64 c 0 result ) else unsafe_set_int64 c 0 ( Int64 . of_int ( lt ( words - 1 ) a b ) ) ; ; let [ @ cold ] raise_mux_of_empty_list ( ) = raise_s [ % message " Bits . mux unexpected empty list " ] ; ; let rec mux_find idx n l = match l with | [ ] -> raise_mux_of_empty_list ( ) | [ h ] -> h | h :: t -> if idx = n then h else mux_find idx ( n + 1 ) t ; ; let mux dst sel l = let idx = to_int sel in copy ~ src ( : mux_find idx 0 l ) ~ dst ; ; let cat2 a_width a b = let b_width = width b in let a_words = words_of_width a_width in let b_words = words_of_width b_width in let a_bits = a_width land width_mask in if a_bits = 0 then for i = 0 to b_words - 1 do unsafe_set_int64 a ( a_words + i ) ( unsafe_get_int64 b i ) done else ( let x = ref ( unsafe_get_int64 a ( a_words - 1 ) ) in for i = 0 to b_words - 1 do let y = unsafe_get_int64 b i in unsafe_set_int64 a ( a_words - 1 + i ) Int64 . ( ! x lor ( y lsl a_bits ) ) ; x := Int64 . O . ( y lsr Int . ( 64 - a_bits ) ) done ; let num_bits_in_last_word = b_width land 63 in let num_bits_in_last_word = if num_bits_in_last_word = 0 then 64 else num_bits_in_last_word in if num_bits_in_last_word > 64 - a_bits then unsafe_set_int64 a ( a_words + b_words - 1 ) ! x ) ; ; let rec cat_iter_back width_ c l = match l with | [ ] -> ( ) | h :: t -> let width_ = width_ - width h in cat_iter_back width_ c t ; cat2 width_ c h ; ; let concat c l = cat_iter_back ( width c ) c l let concat_rev_array c l = let acc_width = ref 0 in for i = 0 to Array . length l - 1 do let h = Array . unsafe_get l i in let width = width h in cat2 ! acc_width c h ; acc_width := ! acc_width + width done ; ; let word w = w lsr log_bits_per_word let select dst src h l = let words = words dst in let s_bits = l land width_mask in let lo_word = word l in let hi_word = word h in if s_bits = 0 then for i = 0 to words - 1 do unsafe_set_int64 dst i ( unsafe_get_int64 src ( lo_word + i ) ) done else ( let a = ref ( unsafe_get_int64 src lo_word ) in for i = 0 to words - 1 do let b = if lo_word + i >= hi_word then 0L else unsafe_get_int64 src ( lo_word + i + 1 ) in let x = Int64 . O . ( ( b lsl Int . O . ( 64 - s_bits ) ) lor ( ! a lsr s_bits ) ) in unsafe_set_int64 dst i x ; a := b done ) ; mask dst ; ; external umul : t -> t -> t -> unit = " hardcaml_bits_umul " [ @@ noalloc ] external smul : t -> t -> t -> unit = " hardcaml_bits_smul " [ @@ noalloc ] let ( *: ) dst a b = umul dst a b ; mask dst ; ; let ( *+ ) dst a b = smul dst a b ; mask dst ; ; let num_words = words let to_bits t = let result = create ( width t ) in copy ~ src : t ~ dst : result ; result ; ; let copy_bits = copy module Comb = Comb . Make ( struct type t = Bits0 . t let equal = Bits0 . Comparable . equal let empty = empty let is_empty = is_empty let width = width let of_constant = of_constant let to_constant = to_constant let add_widths w y = w + width y let concat_msb l = let w = List . fold l ~ init : 0 ~ f : add_widths in let c = create w in concat c l ; c ; ; let mux sel l = let idx = to_int sel in mux_find idx 0 l ; ; let select s h l = let w = h - l + 1 in let c = create w in select c s h l ; c ; ; let ( -- ) = ( -- ) let ( &: ) a b = let c = create ( width a ) in ( &: ) c a b ; c ; ; let ( |: ) a b = let c = create ( width a ) in ( |: ) c a b ; c ; ; let ( ^: ) a b = let c = create ( width a ) in ( ^: ) c a b ; c ; ; let ( ~: ) a = let c = create ( width a ) in ( ~: ) c a ; c ; ; let ( +: ) a b = let c = create ( width a ) in ( +: ) c a b ; c ; ; let ( -: ) a b = let c = create ( width a ) in ( -: ) c a b ; c ; ; let ( *: ) a b = let c = create ( width a + width b ) in ( *: ) c a b ; c ; ; let ( *+ ) a b = let c = create ( width a + width b ) in ( *+ ) c a b ; c ; ; let ( ==: ) a b = let c = create 1 in ( ==: ) c a b ; c ; ; let ( <: ) a b = let c = create 1 in ( <: ) c a b ; c ; ; let to_string = to_string let sexp_of_t ( s : t ) = [ % sexp ( to_constant s |> Constant . to_binary_string : string ) ] end ) end |
let to_int x = Constant . to_int x |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.