2863

Committed 05 Nov 2024 06:20PM UTC coverage: 30.754% (-16.6%) from 47.311%

Build # 2863

Build Type

push

buildkite

Committed by

web-flow

Commit Message

Merge pull request #16296 from MinaProtocol/dkijania/more_multi_jobs

more multi jobs in CI

Run Details

20276 of 65930 relevant lines covered (30.75%)

8631.7 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

49.18

/src/lib/hex/hex.ml

open Core_kernel

module Digit = struct
  (* A number between 0 and 15 *)
  type t =
    | H0
    | H1
    | H2
    | H3
    | H4
    | H5
    | H6
    | H7
    | H8
    | H9
    | H10
    | H11
    | H12
    | H13
    | H14
    | H15

  let of_char_exn c =
    match Char.lowercase c with
    | '0' ->
        H0
    | '1' ->
        H1
    | '2' ->
        H2
    | '3' ->
        H3
    | '4' ->
        H4
    | '5' ->
        H5
    | '6' ->
        H6
    | '7' ->
        H7
    | '8' ->
        H8
    | '9' ->
        H9
    | 'a' ->
        H10
    | 'b' ->
        H11
    | 'c' ->
        H12
    | 'd' ->
        H13
    | 'e' ->
        H14
    | 'f' ->
        H15
    | _ ->
        failwithf "bad hex digit %c" c ()

  let to_int = function
    | H0 ->
        0
    | H1 ->
        1
    | H2 ->
        2
    | H3 ->
        3
    | H4 ->
        4
    | H5 ->
        5
    | H6 ->
        6
    | H7 ->
        7
    | H8 ->
        8
    | H9 ->
        9
    | H10 ->
        10
    | H11 ->
        11
    | H12 ->
        12
    | H13 ->
        13
    | H14 ->
        14
    | H15 ->
        15
end

let hex_char_of_int_exn = function
  | 0 ->
      '0'
  | 1 ->
      '1'
  | 2 ->
      '2'
  | 3 ->
      '3'
  | 4 ->
      '4'
  | 5 ->
      '5'
  | 6 ->
      '6'
  | 7 ->
      '7'
  | 8 ->
      '8'
  | 9 ->
      '9'
  | 10 ->
      'a'
  | 11 ->
      'b'
  | 12 ->
      'c'
  | 13 ->
      'd'
  | 14 ->
      'e'
  | 15 ->
      'f'
  | d ->
      failwithf "bad hex digit %d" d ()

module Sequence_be = struct
  type t = Digit.t array

  let decode ?(pos = 0) s =
    let n = String.length s - pos in
    Array.init n ~f:(fun i -> Digit.of_char_exn s.[pos + i])

  let to_bytes_like ~init (t : t) =
    let n = Array.length t in
    let k = n / 2 in
    assert (n = k + k) ;
    init k ~f:(fun i ->
        Char.of_int_exn
          ((16 * Digit.to_int t.(2 * i)) + Digit.to_int t.((2 * i) + 1)) )

  let to_string = to_bytes_like ~init:String.init

  let to_bytes = to_bytes_like ~init:Bytes.init

  let to_bigstring = to_bytes_like ~init:Bigstring.init
end

let decode ?(reverse = false) ?(pos = 0) ~init t =
  let n = String.length t - pos in
  let k = n / 2 in
  assert (n = k + k) ;
  let h j = Digit.(to_int (of_char_exn t.[pos + j])) in
  init k ~f:(fun i ->
      let i = if reverse then k - 1 - i else i in
      Char.of_int_exn ((16 * h (2 * i)) + h ((2 * i) + 1)) )

let encode ?(reverse = false) t =
  let n = String.length t in
  String.init (2 * n) ~f:(fun i ->
      let c =
        let byte = i / 2 in
        Char.to_int t.[if reverse then n - 1 - byte else byte]
      in
      let c = if i mod 2 = 0 then (* hi *)
                c lsr 4 else (* lo *)
                          c in
      hex_char_of_int_exn (c land 15) )

let%test_unit "decode" =
  let t = String.init 100 ~f:(fun _ -> Char.of_int_exn (Random.int 256)) in
  let h = encode t in
  assert (String.equal t (decode ~init:String.init h)) ;
  assert (
    String.equal t
      (decode ~reverse:true ~init:String.init (encode ~reverse:true t)) ) ;
  assert (String.equal t Sequence_be.(to_string (decode h)))

(* TODO: Better deduplicate the hex coding between these two implementations #5711 *)
module Safe = struct
  (** to_hex : {0x0-0xff}* -> [A-F0-9]* *)
  let to_hex (data : string) : string =
    String.to_list data
    |> List.map ~f:(fun c ->
           let charify u4 =
             match u4 with
             | x when x <= 9 && x >= 0 ->
                 Char.(of_int_exn @@ (x + to_int '0'))
             | x when x <= 15 && x >= 10 ->
                 Char.(of_int_exn @@ (x - 10 + to_int 'A'))
             | _ ->
                 failwith "Unexpected u4 has only 4bits of information"
           in
           let high = charify @@ ((Char.to_int c land 0xF0) lsr 4) in
           let lo = charify (Char.to_int c land 0x0F) in
           String.of_char_list [ high; lo ] )
    |> String.concat

  let%test_unit "to_hex sane" =
    let start = "a" in
    let hexified = to_hex start in
    let expected = "61" in
    if String.equal expected hexified then ()
    else
      failwithf "start: %s ; hexified : %s ; expected: %s" start hexified
        expected ()

  (** of_hex : [a-fA-F0-9]* -> {0x0-0xff}* option *)
  let of_hex (hex : string) : string option =
    let to_u4 c =
      let open Char in
      assert (is_alphanum c) ;
      match c with
      | _ when is_digit c ->
          to_int c - to_int '0'
      | _ when is_uppercase c ->
          to_int c - to_int 'A' + 10
      | _ (* when is_alpha *) ->
          to_int c - to_int 'a' + 10
    in
    String.to_list hex |> List.chunks_of ~length:2
    |> List.fold_result ~init:[] ~f:(fun acc chunk ->
           match chunk with
           | [ a; b ] when Char.is_alphanum a && Char.is_alphanum b ->
               Or_error.return
               @@ (Char.((to_u4 a lsl 4) lor to_u4 b |> of_int_exn) :: acc)
           | _ ->
               Or_error.error_string "invalid hex" )
    |> Or_error.ok
    |> Option.map ~f:(Fn.compose String.of_char_list List.rev)

  let%test_unit "partial isomorphism" =
    Quickcheck.test ~sexp_of:[%sexp_of: string] ~examples:[ "\243"; "abc" ]
      Quickcheck.Generator.(map (list char) ~f:String.of_char_list)
      ~f:(fun s ->
        let hexified = to_hex s in
        let actual = Option.value_exn (of_hex hexified) in
        let expected = s in
        if String.equal actual expected then ()
        else
          failwithf
            !"expected: %s ; hexified: %s ; actual: %s"
            expected hexified actual () )
end

1	open Core_kernel	12✔
2
3	module Digit = struct
4	(* A number between 0 and 15 *)
5	type t =
6	\| H0
7	\| H1
8	\| H2
9	\| H3
10	\| H4
11	\| H5
12	\| H6
13	\| H7
14	\| H8
15	\| H9
16	\| H10
17	\| H11
18	\| H12
19	\| H13
20	\| H14
21	\| H15
22
23	let of_char_exn c =
24	match Char.lowercase c with	750,848✔
25	\| '0' ->	567,094✔
26	H0
27	\| '1' ->	11,840✔
28	H1
29	\| '2' ->	13,311✔
30	H2
31	\| '3' ->	9,911✔
32	H3
33	\| '4' ->	15,483✔
34	H4
35	\| '5' ->	18,983✔
36	H5
37	\| '6' ->	9,150✔
38	H6
39	\| '7' ->	8,006✔
40	H7
41	\| '8' ->	9,150✔
42	H8
43	\| '9' ->	14,649✔
44	H9
45	\| 'a' ->	19,543✔
46	H10
47	\| 'b' ->	8,367✔
48	H11
49	\| 'c' ->	11,169✔
50	H12
51	\| 'd' ->	8,368✔
52	H13
53	\| 'e' ->	8,024✔
54	H14
55	\| 'f' ->	17,800✔
56	H15
57	\| _ ->	×
58	failwithf "bad hex digit %c" c ()
59
60	let to_int = function
61	\| H0 ->	567,094✔
62	0
63	\| H1 ->	11,840✔
64	1
65	\| H2 ->	13,311✔
66	2
67	\| H3 ->	9,911✔
68	3
69	\| H4 ->	15,483✔
70	4
71	\| H5 ->	18,983✔
72	5
73	\| H6 ->	9,150✔
74	6
75	\| H7 ->	8,006✔
76	7
77	\| H8 ->	9,150✔
78	8
79	\| H9 ->	14,649✔
80	9
81	\| H10 ->	19,543✔
82	10
83	\| H11 ->	8,367✔
84	11
85	\| H12 ->	11,169✔
86	12
87	\| H13 ->	8,368✔
88	13
89	\| H14 ->	8,024✔
90	14
91	\| H15 ->	17,800✔
92	15
93	end
94
95	let hex_char_of_int_exn = function
96	\| 0 ->	1,416,101✔
97	'0'
98	\| 1 ->	325,842✔
99	'1'
100	\| 2 ->	289,495✔
101	'2'
102	\| 3 ->	356,521✔
103	'3'
104	\| 4 ->	286,599✔
105	'4'
106	\| 5 ->	294,760✔
107	'5'
108	\| 6 ->	267,547✔
109	'6'
110	\| 7 ->	321,680✔
111	'7'
112	\| 8 ->	249,865✔
113	'8'
114	\| 9 ->	271,152✔
115	'9'
116	\| 10 ->	310,648✔
117	'a'
118	\| 11 ->	295,657✔
119	'b'
120	\| 12 ->	265,423✔
121	'c'
122	\| 13 ->	275,149✔
123	'd'
124	\| 14 ->	259,503✔
125	'e'
126	\| 15 ->	284,938✔
127	'f'
128	\| d ->	×
129	failwithf "bad hex digit %d" d ()
130
131	module Sequence_be = struct
132	type t = Digit.t array
133
134	let decode ?(pos = 0) s =	×
135	let n = String.length s - pos in	×
136	Array.init n ~f:(fun i -> Digit.of_char_exn s.[pos + i])	×
137
138	let to_bytes_like ~init (t : t) =
139	let n = Array.length t in	×
140	let k = n / 2 in	×
141	assert (n = k + k) ;	×
142	init k ~f:(fun i ->
143	Char.of_int_exn	×
144	((16 * Digit.to_int t.(2 * i)) + Digit.to_int t.((2 * i) + 1)) )	×
145
146	let to_string = to_bytes_like ~init:String.init
147
148	let to_bytes = to_bytes_like ~init:Bytes.init
149
150	let to_bigstring = to_bytes_like ~init:Bigstring.init
151	end
152
153	let decode ?(reverse = false) ?(pos = 0) ~init t =	×
154	let n = String.length t - pos in	11,732✔
155	let k = n / 2 in
156	assert (n = k + k) ;	11,732✔
157	let h j = Digit.(to_int (of_char_exn t.[pos + j])) in	750,848✔
158	init k ~f:(fun i ->
159	let i = if reverse then k - 1 - i else i in	×
160	Char.of_int_exn ((16 * h (2 * i)) + h ((2 * i) + 1)) )	375,424✔
161
162	let encode ?(reverse = false) t =	×
163	let n = String.length t in	90,170✔
164	String.init (2 * n) ~f:(fun i ->	90,170✔
165	let c =	5,770,880✔
166	let byte = i / 2 in
167	Char.to_int t.[if reverse then n - 1 - byte else byte]	×
168	in
169	let c = if i mod 2 = 0 then (* hi *)
170	c lsr 4 else (* lo *)	2,885,440✔
171	c in	2,885,440✔
172	hex_char_of_int_exn (c land 15) )
173
174	let%test_unit "decode" =
175	let t = String.init 100 ~f:(fun _ -> Char.of_int_exn (Random.int 256)) in	×
176	let h = encode t in	×
177	assert (String.equal t (decode ~init:String.init h)) ;	×
178	assert (	×
179	String.equal t	×
180	(decode ~reverse:true ~init:String.init (encode ~reverse:true t)) ) ;	×
181	assert (String.equal t Sequence_be.(to_string (decode h)))	×
182
183	(* TODO: Better deduplicate the hex coding between these two implementations #5711 *)
184	module Safe = struct
185	(** to_hex : {0x0-0xff}* -> [A-F0-9]* *)
186	let to_hex (data : string) : string =
187	String.to_list data	×
188	\|> List.map ~f:(fun c ->	×
189	let charify u4 =	×
190	match u4 with	×
191	\| x when x <= 9 && x >= 0 ->	×
192	Char.(of_int_exn @@ (x + to_int '0'))	×
193	\| x when x <= 15 && x >= 10 ->	×
194	Char.(of_int_exn @@ (x - 10 + to_int 'A'))	×
195	\| _ ->	×
196	failwith "Unexpected u4 has only 4bits of information"
197	in
198	let high = charify @@ ((Char.to_int c land 0xF0) lsr 4) in	×
199	let lo = charify (Char.to_int c land 0x0F) in	×
200	String.of_char_list [ high; lo ] )	×
201	\|> String.concat
202
203	let%test_unit "to_hex sane" =
204	let start = "a" in	×
205	let hexified = to_hex start in
206	let expected = "61" in	×
207	if String.equal expected hexified then ()	×
208	else
209	failwithf "start: %s ; hexified : %s ; expected: %s" start hexified	×
210	expected ()
211
212	(** of_hex : [a-fA-F0-9]* -> {0x0-0xff}* option *)
213	let of_hex (hex : string) : string option =
214	let to_u4 c =	×
215	let open Char in	×
216	assert (is_alphanum c) ;	×
217	match c with
218	\| _ when is_digit c ->	×
219	to_int c - to_int '0'	×
220	\| _ when is_uppercase c ->	×
221	to_int c - to_int 'A' + 10	×
222	\| _ (* when is_alpha *) ->	×
223	to_int c - to_int 'a' + 10	×
224	in
225	String.to_list hex \|> List.chunks_of ~length:2	×
226	\|> List.fold_result ~init:[] ~f:(fun acc chunk ->	×
227	match chunk with	×
228	\| [ a; b ] when Char.is_alphanum a && Char.is_alphanum b ->	×
229	Or_error.return	×
230	@@ (Char.((to_u4 a lsl 4) lor to_u4 b \|> of_int_exn) :: acc)	×
231	\| _ ->	×
232	Or_error.error_string "invalid hex" )
233	\|> Or_error.ok	×
234	\|> Option.map ~f:(Fn.compose String.of_char_list List.rev)	×
235
236	let%test_unit "partial isomorphism" =
237	Quickcheck.test ~sexp_of:[%sexp_of: string] ~examples:[ "\243"; "abc" ]	×
238	Quickcheck.Generator.(map (list char) ~f:String.of_char_list)	×
239	~f:(fun s ->
240	let hexified = to_hex s in	×
241	let actual = Option.value_exn (of_hex hexified) in	×
242	let expected = s in	×
243	if String.equal actual expected then ()	×
244	else
245	failwithf	×
246	!"expected: %s ; hexified: %s ; actual: %s"
247	expected hexified actual () )
248	end	24✔

MinaProtocol / mina / 2863

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous