package carton

  1. Overview
  2. Docs

Source file idx.ml

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
[@@@warning "-32"]

type bigstring =
  (char, Bigarray.int8_unsigned_elt, Bigarray.c_layout) Bigarray.Array1.t

external get_int32 : bigstring -> int -> int32 = "%caml_bigstring_get32"
external get_int64 : bigstring -> int -> int64 = "%caml_bigstring_get64"
external get_int16 : bigstring -> int -> int = "%caml_bigstring_get16"
external swap32 : int32 -> int32 = "%bswap_int32"
external swap64 : int64 -> int64 = "%bswap_int64"
external swap16 : int -> int = "%bswap16"

let get_int16_be =
  if Sys.big_endian then fun buf off -> get_int16 buf off
  else fun buf off -> swap16 (get_int16 buf off)

let get_int64_be =
  if Sys.big_endian then fun buf off -> get_int64 buf off
  else fun buf off -> swap64 (get_int64 buf off)

external string_get_int16 : string -> int -> int = "%caml_string_get16"
external string_get_int32 : string -> int -> int32 = "%caml_string_get32"
external string_get_int64 : string -> int -> int64 = "%caml_string_get64"

let string_get_int16_be =
  if Sys.big_endian then fun buf off -> string_get_int16 buf off
  else fun buf off -> swap16 (string_get_int16 buf off)

let string_get_int32_be =
  if Sys.big_endian then fun buf off -> string_get_int32 buf off
  else fun buf off -> swap32 (string_get_int32 buf off)

let string_get_int64_be =
  if Sys.big_endian then fun buf off -> string_get_int64 buf off
  else fun buf off -> swap64 (string_get_int64 buf off)

let string_get_int8 s i = Char.code s.[i]

let get_int32_be =
  if Sys.big_endian then fun buf off -> get_int32 buf off
  else fun buf off -> swap32 (get_int32 buf off)

type 'uid idx = {
  mp : bigstring;
  n : int;
  uid_ln : int;
  uid_rw : 'uid -> string;
  uid_wr : string -> 'uid;
}

and sub = { off : int; len : int }
and optint = Optint.t

let make :
    bigstring ->
    uid_ln:int ->
    uid_rw:('uid -> string) ->
    uid_wr:(string -> 'uid) ->
    'uid idx =
 fun mp ~uid_ln ~uid_rw ~uid_wr ->
  let i = get_int32_be mp 0 in
  let v = get_int32_be mp 4 in
  let n = get_int32_be mp (8 + (255 * 4)) in

  if i <> 0xff744f63l then
    Fmt.invalid_arg "Invalid IDX file (header: %lx <> %lx)" i 0xff744f63l;
  if v <> 0x2l then Fmt.invalid_arg "Invalid version of IDX file";
  { mp; n = Int32.to_int n; uid_ln; uid_rw; uid_wr }

let compare_bigstring idx a hash =
  let ps = ref 0 in
  let c1 = ref 0 in
  let c2 = ref 0 in

  let exception Equal in
  try
    while
      c1 := get_int16_be idx.mp (a.off + !ps);
      c2 := string_get_int16_be hash !ps;
      !c1 == !c2
    do
      ps := !ps + 2;
      if !ps == idx.uid_ln then raise_notrace Equal
    done;

    let res0 = (!c1 land 0xff) - (!c2 land 0xff) in
    let res1 = (!c1 asr 8) - (!c2 asr 8) in
    if res1 == 0 then res0 else res1
  with Equal -> 0

let ( <-> ) a b = Int32.sub a b
let fanout_offset = 8
let hashes_offset = 8 + (256 * 4)

let bsearch idx hash =
  let n = string_get_int8 hash 0 in
  let a =
    if n = 0 then 0l else get_int32_be idx.mp (fanout_offset + (4 * (n - 1)))
  in
  let b = get_int32_be idx.mp (fanout_offset + (4 * n)) in

  let abs_off = hashes_offset + (Int32.to_int a * idx.uid_ln) in
  let len = Int32.to_int (b <-> a) * idx.uid_ln in

  let rec go sub_off sub_len =
    let len = sub_len / (2 * idx.uid_ln) * idx.uid_ln in
    (* XXX(dinosaure): prevent a wrong comparison with something outside the
       hashes table. *)
    if sub_off + len = hashes_offset + (idx.uid_ln * idx.n) then
      raise_notrace Not_found;
    let cmp = compare_bigstring idx { off = sub_off + len; len } hash in

    if cmp == 0 then { off = sub_off + len; len }
    else if sub_len <= idx.uid_ln then raise_notrace Not_found
    else if cmp > 0 then (go [@tailcall]) sub_off len
    else (go [@tailcall]) (sub_off + len) (sub_len - len)
  in
  let { off; _ } = go abs_off len in
  Int32.to_int a + ((off - abs_off) / idx.uid_ln)

(* XXX(dinosaure): FIXME! It does not work at some points. *)
let isearch idx hash =
  let n = string_get_int8 hash 0 in
  let a =
    if n = 0 then 0l else get_int32_be idx.mp (fanout_offset + (4 * (n - 1)))
  in
  let b = get_int32_be idx.mp (fanout_offset + (4 * n)) in

  let abs_off = hashes_offset + (Int32.to_int a * idx.uid_ln) in
  let len = Int32.to_int (b <-> a <-> 1l) * idx.uid_ln in

  let hashf = Int64.to_float (string_get_int64_be hash 0) in
  let uid_lnf = float_of_int idx.uid_ln in

  let rec go low high =
    if low > high then raise_notrace Not_found;
    if low == high || low + idx.uid_ln == high then
      let cmp = compare_bigstring idx { off = low; len = idx.uid_ln } hash in
      if cmp == 0 then { off = low; len = idx.uid_ln }
      else raise_notrace Not_found
    else
      let lef = Int64.to_float (get_int64_be idx.mp low) in
      let hef = Int64.to_float (get_int64_be idx.mp high) in
      let lowf = float_of_int low in
      let highf = float_of_int high in

      let interpolation =
        floor ((highf -. lowf) *. (hashf -. lef) /. (hef -. lef))
      in
      let off = lowf +. interpolation -. mod_float interpolation uid_lnf in
      let off = int_of_float off in
      let cmp = compare_bigstring idx { off; len = idx.uid_ln } hash in

      if cmp == 0 then { off; len = idx.uid_ln }
      else if cmp > 0 then (go [@tailcall]) low (off - idx.uid_ln)
      else (go [@tailcall]) (off + idx.uid_ln) high
  in
  if len < 0 then raise_notrace Not_found;

  let { off; _ } = go abs_off (abs_off + len) in
  Int32.to_int a + ((off - abs_off) / idx.uid_ln)

let find idx hash =
  let hash = idx.uid_rw hash in
  match bsearch idx hash with
  | n ->
      let crcs_offset = 8 + (256 * 4) + (idx.n * idx.uid_ln) in
      let values_offset = 8 + (256 * 4) + (idx.n * idx.uid_ln) + (idx.n * 4) in

      let crc = get_int32_be idx.mp (crcs_offset + (n * 4)) in
      let off = get_int32_be idx.mp (values_offset + (n * 4)) in

      if Int32.logand off 0x80000000l <> 0l then
        let off = Int32.to_int off land 0x7fffffff in
        let off =
          get_int64_be idx.mp (values_offset + (idx.n * 4) + (off * 8))
        in
        Some (Optint.of_int32 crc, off)
      else Some (Optint.of_int32 crc, Int64.of_int32 off)
  | exception Not_found -> None

let exists idx uid =
  let uid = idx.uid_rw uid in
  match bsearch idx uid with _ -> true | exception Not_found -> false

let get_uid idx n =
  let res = Bytes.create idx.uid_ln in
  Bigstringaf.blit_to_bytes idx.mp
    ~src_off:(hashes_offset + (n * idx.uid_ln))
    res ~dst_off:0 ~len:idx.uid_ln;
  idx.uid_wr (Bytes.unsafe_to_string res)

let get_offset idx n =
  let values_offset = 8 + (256 * 4) + (idx.n * idx.uid_ln) + (idx.n * 4) in
  Int64.of_int32 (get_int32_be idx.mp (values_offset + (n * 4)))

let get_crc idx n =
  let crcs_offset = 8 + (256 * 4) + (idx.n * idx.uid_ln) in
  Optint.of_int32 (get_int32_be idx.mp (crcs_offset + (n * 4)))

let max { n; _ } = n

let iter ~f idx =
  let rec go n =
    if n == idx.n then ()
    else
      let uid = get_uid idx n in
      let offset = get_offset idx n in
      let crc = get_crc idx n in
      f ~uid ~offset ~crc;
      go (succ n)
  in
  go 0

let map ~f idx =
  let rec go acc n =
    if n == idx.n then List.rev acc
    else
      let uid = get_uid idx n in
      let offset = get_offset idx n in
      let crc = get_crc idx n in
      go (f ~uid ~offset ~crc :: acc) (succ n)
  in
  go [] 0

module type UID = sig
  type t
  type ctx

  val empty : ctx
  val feed : ctx -> ?off:int -> ?len:int -> bigstring -> ctx
  val get : ctx -> t
  val compare : t -> t -> int
  val length : int
  val to_raw_string : t -> string
  val pp : t Fmt.t
end

type 'uid entry = { crc : optint; offset : int64; uid : 'uid }

module N (Uid : UID) : sig
  type encoder
  type dst = [ `Channel of out_channel | `Buffer of Buffer.t | `Manual ]

  val encoder : dst -> pack:Uid.t -> Uid.t entry array -> encoder
  val encode : encoder -> [ `Await ] -> [ `Partial | `Ok ]
  val dst_rem : encoder -> int
  val dst : encoder -> Bigstringaf.t -> int -> int -> unit
end = struct
  type dst = [ `Channel of out_channel | `Buffer of Buffer.t | `Manual ]

  type encoder = {
    dst : dst;
    mutable o : bigstring;
    mutable o_off : int;
    mutable o_pos : int;
    mutable o_max : int;
    t : bigstring;
    q : int64 Queue.t;
    mutable t_pos : int;
    mutable t_max : int;
    mutable n : int;
    fanout : int array;
    index : Uid.t entry array;
    pack : Uid.t;
    mutable ctx : Uid.ctx;
    mutable k : encoder -> [ `Await ] -> [ `Partial | `Ok ];
  }

  let dst e s j l =
    if j < 0 || l < 0 || j + l > Bigstringaf.length s then
      Fmt.invalid_arg "Out of bounds (off: %d, len: %d)" j l;
    e.o <- s;
    e.o_off <- j;
    e.o_pos <- j;
    e.o_max <- j + l - 1

  let partial k e = function `Await -> k e

  let flush_with_ctx k e =
    match e.dst with
    | `Manual ->
        let ctx = Uid.feed e.ctx ~off:e.o_off ~len:e.o_pos e.o in
        e.ctx <- ctx;
        e.k <- partial k;
        `Partial
    | `Channel oc ->
        let raw = Bigstringaf.substring e.o ~off:0 ~len:e.o_pos in
        let ctx = Uid.feed e.ctx ~off:e.o_off ~len:e.o_pos e.o in
        output_string oc raw;
        e.o_pos <- 0;
        e.ctx <- ctx;
        k e
    | `Buffer b ->
        let raw = Bigstringaf.substring e.o ~off:0 ~len:e.o_pos in
        let ctx = Uid.feed e.ctx ~off:e.o_off ~len:e.o_pos e.o in
        Buffer.add_string b raw;
        e.o_pos <- 0;
        e.ctx <- ctx;
        k e

  let flush_without_ctx k e =
    match e.dst with
    | `Manual ->
        e.k <- partial k;
        `Partial
    | `Channel oc ->
        let raw = Bigstringaf.substring e.o ~off:e.o_off ~len:e.o_pos in
        output_string oc raw;
        e.o_pos <- 0;
        k e
    | `Buffer b ->
        let raw = Bigstringaf.substring e.o ~off:e.o_off ~len:e.o_pos in
        Buffer.add_string b raw;
        e.o_pos <- 0;
        k e

  let o_rem e = e.o_max - e.o_pos + 1

  let t_range e m =
    e.t_pos <- 0;
    e.t_max <- m

  let rec t_flush ?(with_ctx = true) k e =
    let blit e l =
      Bigstringaf.blit e.t ~src_off:e.t_pos e.o ~dst_off:e.o_pos ~len:l;
      e.o_pos <- e.o_pos + l;
      e.t_pos <- e.t_pos + l
    in
    let rem = o_rem e in
    let len = e.t_max - e.t_pos + 1 in
    let flush = if with_ctx then flush_with_ctx else flush_without_ctx in
    if rem < len then (
      blit e rem;
      flush (t_flush k) e)
    else (
      blit e len;
      k e)

  let ok e =
    e.k <- (fun _ `Await -> `Ok);
    `Ok

  let encode_trail e `Await =
    let k2 e = flush_without_ctx ok e in
    let k1 e =
      let rem = o_rem e in
      let s, j, k =
        if rem < Uid.length then (
          t_range e (Uid.length - 1);
          e.t, 0, t_flush ~with_ctx:false k2)
        else
          let j = e.o_pos in
          e.o_pos <- e.o_pos + Uid.length;
          e.o, j, k2
      in
      let uid = Uid.get e.ctx in
      let uid = Uid.to_raw_string uid in
      Bigstringaf.blit_from_string uid ~src_off:0 s ~dst_off:j ~len:Uid.length;
      k e
    in
    let k0 e = flush_with_ctx k1 e in
    let rem = o_rem e in
    let s, j, k =
      if rem < Uid.length then (
        t_range e (Uid.length - 1);
        e.t, 0, t_flush k0)
      else
        let j = e.o_pos in
        e.o_pos <- e.o_pos + Uid.length;
        e.o, j, k0
    in
    let uid = Uid.to_raw_string e.pack in
    Bigstringaf.blit_from_string uid ~src_off:0 s ~dst_off:j ~len:Uid.length;
    k e

  let rec encode_big_offset e `Await =
    let offset = Queue.pop e.q in
    Fmt.epr ">>> ENCODE BIG OFFSET: %Lx\n%!" offset;
    let k e =
      if Queue.is_empty e.q then encode_trail e `Await
      else encode_big_offset e `Await
    in

    let rem = o_rem e in

    let s, j, k =
      if rem < 8 then (
        t_range e 7;
        e.t, 0, t_flush k)
      else
        let j = e.o_pos in
        e.o_pos <- e.o_pos + 8;
        e.o, j, k
    in

    Bigstringaf.set_int64_be s j offset;
    k e

  let rec encode_offset e `Await =
    let k e =
      if e.n + 1 == Array.length e.index then (
        e.n <- 0;
        if Queue.is_empty e.q then encode_trail e `Await
        else encode_big_offset e `Await)
      else (
        e.n <- succ e.n;
        encode_offset e `Await)
    in
    let rem = o_rem e in

    let s, j, k =
      if rem < 4 then (
        t_range e 3;
        e.t, 0, t_flush k)
      else
        let j = e.o_pos in
        e.o_pos <- e.o_pos + 4;
        e.o, j, k
    in
    let { offset; _ } = e.index.(e.n) in
    if Int64.shift_right_logical offset 31 <> 0L then (
      let n = Queue.length e.q in
      Queue.push offset e.q;
      Bigstringaf.set_int32_be s j Int32.(logor 0x80000000l (of_int n));
      k e)
    else (
      Bigstringaf.set_int32_be s j (Int64.to_int32 offset);
      k e)

  let rec encode_crc e `Await =
    let k e =
      if e.n + 1 == Array.length e.index then (
        e.n <- 0;
        encode_offset e `Await)
      else (
        e.n <- succ e.n;
        encode_crc e `Await)
    in
    let rem = o_rem e in

    let s, j, k =
      if rem < 4 then (
        t_range e 3;
        e.t, 0, t_flush k)
      else
        let j = e.o_pos in
        e.o_pos <- e.o_pos + 4;
        e.o, j, k
    in
    let { crc; _ } = e.index.(e.n) in
    Bigstringaf.set_int32_be s j (Optint.to_int32 crc);
    k e

  let rec encode_hash e `Await =
    let k e =
      if e.n + 1 == Array.length e.index then (
        e.n <- 0;
        encode_crc e `Await)
      else (
        e.n <- succ e.n;
        encode_hash e `Await)
    in
    let rem = o_rem e in

    let s, j, k =
      if rem < Uid.length then (
        t_range e (Uid.length - 1);
        e.t, 0, t_flush k)
      else
        let j = e.o_pos in
        e.o_pos <- e.o_pos + Uid.length;
        e.o, j, k
    in
    let { uid; _ } = e.index.(e.n) in

    Bigstringaf.blit_from_string (Uid.to_raw_string uid) ~src_off:0 s ~dst_off:j
      ~len:Uid.length;
    k e

  let rec encode_fanout e `Await =
    let k e =
      if e.n + 1 == 256 then (
        e.n <- 0;
        if Array.length e.index > 0 then encode_hash e `Await
        else encode_trail e `Await)
      else (
        e.n <- succ e.n;
        encode_fanout e `Await)
    in
    let rem = o_rem e in

    let s, j, k =
      if rem < 4 then (
        t_range e 3;
        e.t, 0, t_flush k)
      else
        let j = e.o_pos in
        e.o_pos <- e.o_pos + 4;
        e.o, j, k
    in
    let x =
      let acc = ref 0 in
      for i = 0 to e.n do
        acc := !acc + e.fanout.(i)
      done;
      !acc
    in
    Bigstringaf.set_int32_be s j (Int32.of_int x);
    k e

  let encode_header e `Await =
    let k e =
      e.n <- 0;
      encode_fanout e `Await
    in
    let rem = o_rem e in
    let s, j, k =
      if rem < 8 then (
        t_range e 8;
        e.t, 0, t_flush k)
      else
        let j = e.o_pos in
        e.o_pos <- e.o_pos + 8;
        e.o, j, k
    in
    Bigstringaf.set_int32_be s j 0xff744f63l;
    Bigstringaf.set_int32_be s (j + 4) 0x2l;
    k e

  let io_buffer_size = 65536

  let encoder dst ~pack index =
    Array.sort (fun { uid = a; _ } { uid = b; _ } -> Uid.compare a b) index;
    let fanout = Array.make 256 0 in
    Array.iter
      (fun { uid; _ } ->
        let n = Char.code (Uid.to_raw_string uid).[0] in
        fanout.(n) <- fanout.(n) + 1)
      index;
    let o, o_pos, o_max =
      match dst with
      | `Manual -> Bigstringaf.empty, 1, 0
      | `Buffer _ | `Channel _ ->
          Bigstringaf.create io_buffer_size, 0, io_buffer_size - 1
    in
    {
      dst;
      o;
      o_off = 0;
      o_pos;
      o_max;
      t = Bigstringaf.create Uid.length;
      q = Queue.create ();
      t_pos = 1;
      t_max = 0;
      n = 0;
      fanout;
      index;
      pack;
      ctx = Uid.empty;
      k = encode_header;
    }

  let dst_rem = o_rem
  let encode e = e.k e
end

type file = File

module Ephemeron = Ephemeron.K1.Make (struct
  type t = file

  let equal = ( = )
  let hash = Hashtbl.hash
end)

module Device = struct
  type t = Bigstringaf.t ref Ephemeron.t
  type uid = file

  let device () = Ephemeron.create 1

  let create device =
    let file = File in
    Ephemeron.add device file (ref Bigstringaf.empty);
    file
    [@@inline never]

  let project device file = !(Ephemeron.find device file)
end

module M (IO : sig
  type +'a t

  val bind : 'a t -> ('a -> 'b t) -> 'b t
  val return : 'a -> 'a t
end) (Uid : sig
  include UID

  val of_raw_string : string -> t
  val null : t
end) =
struct
  open IO

  let ( >>= ) x f = bind x f

  type fd = {
    mutable buffer : Bigstringaf.t;
    mutable capacity : int;
    mutable length : int;
    uid : Device.uid;
  }

  let enlarge fd more =
    let _old_length = fd.length in
    let old_capacity = fd.capacity in
    let new_capacity = ref old_capacity in
    while old_capacity + more > !new_capacity do
      new_capacity := 2 * !new_capacity
    done;
    if !new_capacity > Sys.max_string_length then
      if old_capacity + more <= Sys.max_string_length then
        new_capacity := Sys.max_string_length
      else failwith "Too big buffer";
    let new_buffer = Bigstringaf.create !new_capacity in
    Bigstringaf.blit fd.buffer ~src_off:0 new_buffer ~dst_off:0 ~len:fd.length;
    fd.buffer <- new_buffer;
    fd.capacity <- !new_capacity;
    (* XXX(dinosaure): these asserts wants to rely on some assumptions
       even if we use [enlarge] into a preemptive thread as [Stdlib.Buffer].
       However, with [lwt], it should be fine to use it and avoid these
       assertions. *)
    (* assert (fd.position + more <= fd.capacity) ; *)
    (* assert (old_length + more <= fd.capacity) ; *)
    ()

  type t = Device.t
  type uid = Device.uid
  type error = |

  let pp_error : error Fmt.t = fun _ppf -> function _ -> .

  let create device uid =
    assert (Ephemeron.mem device uid);
    IO.return
      (Ok
         {
           uid;
           buffer = Bigstringaf.create 0x1000;
           capacity = 0x1000;
           length = 0;
         })

  let append _ fd str =
    let len = String.length str in
    let new_length = fd.length + len in
    if new_length > fd.capacity then enlarge fd len;
    Bigstringaf.blit_from_string str ~src_off:0 fd.buffer ~dst_off:fd.length
      ~len;
    fd.length <- new_length;
    IO.return ()

  let close device fd =
    let result = Bigstringaf.sub fd.buffer ~off:0 ~len:fd.length in
    let v = Ephemeron.find device fd.uid in
    v := result;
    IO.return (Ok ())
end
OCaml

Innovation. Community. Security.