package uniq

  1. Overview
  2. Docs
A library which introspect and infer dependencies via codept, ocamlfind and opam

Install

dune-project
 Dependency

Authors

Maintainers

Sources

uniq-0.1.0.tbz
sha256=998588f1053cf03161a4bded6d7f8068c88de497e77fc0bbca81a5234fa444d5
sha512=53d4ee5ad8c01e19a2e1fbda86266768d118f78566b82f0c736338ce2c12258185a5f4dbb90bf0da37a7528098266ec81861bdcfea29e55daa3122a4f3a1daca

doc/src/uniq.mod/uniq_resolve.ml.html

Source file uniq_resolve.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
let src = Logs.Src.create "uniq.resolve"

module Log = (val Logs.src_log src : Logs.LOG)
module Digest = Uniq_digest
module Info = Uniq_info

type _ Effect.t +=
  | Choose : Modname.t * Info.t list -> Info.t Effect.t
  | Conflict : Digest.t * Info.t * Info.t -> Info.t Effect.t

let conflict crc t t' = Effect.perform (Conflict (crc, t, t'))

let by_crc gamma =
  let add u m crc =
    match Digest.Map.find_opt crc m with
    | None -> Digest.Map.add crc u m
    | Some v -> (
        match (Info.is_a_library u, Info.is_a_library v) with
        | true, false -> Digest.Map.add crc u m
        | false, true -> Digest.Map.add crc v m
        | _ ->
            if Info.is_a_cmi u && Info.is_a_cmi v then Digest.Map.add crc u m
            else
              let t = conflict crc u v in
              Digest.Map.add crc t m)
  in
  let fold m t =
    List.filter_map snd (Info.exports t) |> List.fold_left (add t) m
  in
  List.fold_left fold Digest.Map.empty gamma

let choose modname vs =
  Log.debug (fun m ->
      m "choose %a from: @[<hov>%a@]" Modname.pp modname
        Fmt.(list ~sep:(any ";@.") Info.pp)
        vs);
  match List.filter Info.is_a_library vs with
  | [] -> Effect.perform (Choose (modname, vs))
  | [ v ] -> v
  | ws -> (
      match List.filter Info.is_native ws with
      | [] -> Effect.perform (Choose (modname, vs))
      | [ w ] -> w
      | _ -> Effect.perform (Choose (modname, vs)))

let flip f y x = f x y
let ( $ ) f x = f x

let exports m v =
  let fn (m', _) =
    match Uniq_info.Path.to_list m' with
    | [ m' ] -> Modname.compare m m' = 0
    | _ -> false
  in
  List.exists fn (Info.exports v)

let qualify_by_crc gamma =
  let by_crc = by_crc gamma in
  let qualify k (by_modname, t) (modname, crc) =
    Log.debug (fun m ->
        m "search %a for %a"
          Fmt.(option ~none:(any "<none>") Digest.pp)
          crc Info.pp t);
    match Stdlib.Option.bind crc (flip $ Digest.Map.find_opt $ by_crc) with
    | None -> (by_modname, t)
    | Some v when exports modname v ->
        let by_modname =
          match k with
          | `Impl ->
              (fst by_modname, Modname.Map.add modname [ v ] (snd by_modname))
          | `Intf ->
              (Modname.Map.add modname [ v ] (fst by_modname), snd by_modname)
        in
        let location = Info.location v in
        let t = Info.qualify t ~location ?crc k modname in
        (by_modname, t)
    | Some _v ->
        Logs.err (fun m -> m "%a => %a" Modname.pp modname Info.pp _v);
        assert false
  in
  let fold (by_modname, ts) t =
    (by_modname, t)
    |> (flip $ List.fold_left (qualify `Intf) $ Info.intfs_imported t)
    |> (flip $ List.fold_left (qualify `Impl) $ Info.impls_imported t)
    |> fun (by_modname, t) -> (by_modname, t :: ts)
  in
  List.fold_left fold (Modname.Map.(empty, empty), []) gamma

let complete_by_modname by_modname gamma =
  let add t m (modname, _crc) =
    match Modname.Map.find_opt modname m with
    | Some [ t' ] when Stdlib.Option.is_some (Info.crc_of t' modname) -> m
    | None -> Modname.Map.add modname [ t ] m
    | Some ts -> Modname.Map.add modname (t :: ts) m
  in
  let fold (intfs, impls) t =
    match Info.kind t with
    | `Impl -> (intfs, List.fold_left (add t) impls t.Info.exports)
    | `Intf -> (List.fold_left (add t) intfs t.Info.exports, impls)
  in
  List.fold_left fold by_modname gamma |> fun (intfs, impls) ->
  let only _ = function [ t ] -> Some t | _ -> None in
  let restricted_intfs = Modname.Map.filter_map only intfs in
  let restricted_impls = Modname.Map.filter_map only impls in
  ((restricted_intfs, restricted_impls), (intfs, impls))

let qualify_objects gamma =
  let by_modname, gamma = qualify_by_crc gamma in
  let restricted, extended = complete_by_modname by_modname gamma in
  let qualify k (gamma, t) (modname, _crc) =
    Log.debug (fun m -> m "search %a for %a" Modname.pp modname Info.pp t);
    let restricted, extended =
      match k with
      | `Intf -> (fst gamma, fst extended)
      | `Impl -> (snd gamma, snd extended)
    in
    let mr = Modname.Map.find_opt modname restricted
    and me = Modname.Map.find_opt modname extended in
    match (mr, me) with
    | None, None -> (gamma, t)
    | Some v, _ ->
        let location = Info.location v in
        let crc = Info.crc_of v modname in
        (gamma, Info.qualify t ~location ?crc k modname)
    | None, Some vs ->
        let v = choose modname vs in
        let location = Info.location v in
        let crc = Info.crc_of v modname in
        let gamma =
          match k with
          | `Intf -> (Modname.Map.add modname v (fst gamma), snd gamma)
          | `Impl -> (fst gamma, Modname.Map.add modname v (snd gamma))
        in
        (gamma, Info.qualify t ~location ?crc k modname)
  in
  let is_none = Stdlib.Option.is_none in
  let fold (gamma, ts) t =
    let unqualified_intfs =
      List.filter (Fun.compose is_none snd) (Info.intfs_imported t)
    in
    let unqualified_impls =
      List.filter (Fun.compose is_none snd) (Info.impls_imported t)
    in
    (gamma, t)
    |> (flip $ List.fold_left (qualify `Intf) $ unqualified_intfs)
    |> (flip $ List.fold_left (qualify `Impl) $ unqualified_impls)
    |> fun (by_modname, t) -> (by_modname, t :: ts)
  in
  List.fold_left fold (restricted, []) gamma |> snd

module Src = struct
  type directory = { recurse: bool; location: Fpath.t; exclude: Fpath.t list }
  type t = [ `File of Fpath.t | `Sources of directory | `Objects of directory ]

  let pp ppf = function
    | `File v -> Fpath.pp ppf v
    | `Sources { recurse= true; location; _ } ->
        Fmt.pf ppf "Y(%a:*.{ml,mli,cmi,cmo,cmx,cma,cmxa})" Fpath.pp location
    | `Sources { recurse= false; location; _ } ->
        Fmt.pf ppf "(%a:*.{cmi,cmo,cmx,cma,cmxa})" Fpath.pp location
    | `Objects { recurse= true; location; _ } ->
        Fmt.pf ppf "Y(%a:*.{cmi,cmo,cmx,cma,cmxa})" Fpath.pp location
    | `Objects { recurse= false; location; _ } ->
        Fmt.pf ppf "(%a:*.{cmi,cmo,cmx,cma,cmxa})" Fpath.pp location

  let file location =
    if
      Fpath.is_file_path location = false
      || Sys.file_exists (Fpath.to_string location) = false
      || Sys.is_directory (Fpath.to_string location) = true
    then Fmt.invalid_arg "%a is not a file" Fpath.pp location
    else
      let sources = [ ".ml"; ".mli" ] in
      let objects = [ ".cmi" ] in
      if Fpath.mem_ext sources location then `File location
      else if Fpath.mem_ext objects location then
        let is_cmi ic () =
          match Misc.Magic_number.read_info ic with
          | Ok { Misc.Magic_number.kind= Cmi; _ } -> true
          | _ | (exception _) -> false
        in
        match Bos.OS.File.with_ic location is_cmi () with
        | Ok true -> `File location
        | Ok false | Error _ ->
            Fmt.invalid_arg "Invalid .cmi file: %a" Fpath.pp location
      else Fmt.invalid_arg "Invalid extension of %a" Fpath.pp location

  let sources ?(recurse = true) ?(exclude = []) location =
    if
      Fpath.is_dir_path location = false
      || Sys.file_exists (Fpath.to_string location) = false
      || Sys.is_directory (Fpath.to_string location) = false
    then Fmt.invalid_arg "%a is not a directory" Fpath.pp location
    else `Sources { recurse; location; exclude }

  let objects ?(recurse = false) ?(exclude = []) location =
    if
      Fpath.is_dir_path location = false
      || Sys.file_exists (Fpath.to_string location) = false
      || Sys.is_directory (Fpath.to_string location) = false
    then Fmt.invalid_arg "%a is not a directory" Fpath.pp location
    else `Objects { recurse; location; exclude }
end

open Bos

let is_excluded exclude path =
  let fn x =
    let x_as_dir = Fpath.to_dir_path x in
    let path_as_dir = Fpath.to_dir_path path in
    Fpath.equal x path
    || Fpath.equal x_as_dir path_as_dir
    || Fpath.is_prefix x_as_dir path_as_dir
  in
  List.exists fn exclude

let traverse_with ~recurse ~exclude location =
  if recurse then `Sat (fun p -> Ok (not (is_excluded exclude p)))
  else `Sat (fun p -> Ok (Fpath.equal location p))

let sources_to_locations (`Sources { Src.recurse; location; exclude }) =
  let traverse = traverse_with ~recurse ~exclude location in
  let elements =
    let sources = [ ".ml"; ".mli"; ".cmo"; ".cmi"; ".cma"; ".cmx"; "cmxa" ] in
    let fn location =
      let base = Fpath.basename (Fpath.rem_ext location) in
      Ok
        (Fpath.mem_ext sources location
        && (not (String.contains base '.'))
        && not (is_excluded exclude location))
    in
    `Sat fn
  in
  OS.Path.fold ~dotfiles:true ~elements ~traverse List.cons [] [ location ]

let objects_to_locations (`Objects { Src.recurse; location; exclude }) =
  let traverse = traverse_with ~recurse ~exclude location in
  let elements =
    let sources = [ ".cmo"; ".cma"; ".cmx"; ".cmxa"; ".cmi" ] in
    let fn location =
      Ok (Fpath.mem_ext sources location && not (is_excluded exclude location))
    in
    `Sat fn
  in
  OS.Path.fold ~dotfiles:true ~elements ~traverse List.cons [] [ location ]

let to_locations = function
  | `File location -> Ok [ location ]
  | `Sources location -> sources_to_locations (`Sources location)
  | `Objects location -> objects_to_locations (`Objects location)

exception No_common_prefix of Fpath.t list

let no_common_prefix paths = raise (No_common_prefix paths)

let common_path paths =
  let fold prefix p =
    match Fpath.find_prefix prefix p with
    | Some prefix' ->
        if Fpath.compare prefix' prefix < 0 then prefix' else prefix
    | None -> no_common_prefix paths
  in
  match paths with
  | [ path ] -> fst (Fpath.split_base path)
  | prefix :: paths -> List.fold_left fold prefix paths
  | [] -> assert false (* XXX(dinosaure): see [from_sources]. *)

let from_sources ~stdlib ~cmis = function
  | [] -> []
  | sources ->
      let current = common_path sources in
      let sources = List.rev_append sources (List.map Info.location cmis) in
      let sources =
        List.map
          begin fun p ->
            Stdlib.Option.value ~default:p Fpath.(rem_prefix current p)
          end
          sources
      in
      let sources =
        List.map (Fun.compose Unitname.modulize Fpath.to_string) sources
      in
      let sources = List.map Unitname.filepath sources in
      let { Comp_unit.ml; Comp_unit.mli } =
        Uniq_ml.run_into ~stdlib ~current sources
      in
      List.map
        begin fun u ->
          let intfs, impls =
            Comp_unit.deps u
            |> Deps.all
            (* NOTE(dinosaure): same as [Deps.all u.Comp_unit.more.Comp_unit.dependencies] *)
            |> List.fold_left Info.to_elt ([], [])
          in
          let location =
            Fpath.v (Namespaced.filepath u.Comp_unit.src.Pkg.file)
          in
          let name = Unitname.modulize (Fpath.to_string location) in
          assert (
            Unitname.modname name = Namespaced.module_name u.Comp_unit.path);
          let kind =
            match Support.extension (Fpath.to_string location) with
            | "ml" -> M2l.Structure
            | "mli" | "cmi" -> M2l.Signature
            | _ -> assert false
          in
          let format =
            match kind with
            | M2l.Structure -> Info.Format (Ml, u)
            | M2l.Signature -> Info.Format (Mli, u)
          in
          let version = None in
          let exports = [ (Unitname.modname name, None) ] in
          let modules = Uniq_info.Path.Set.empty in
          (* TODO *)
          { Info.name; version; modules; exports; intfs; impls; format }
        end
        (List.rev_append ml mli)
      |> List.filter (Fun.negate Info.is_a_cmi)

let ( let* ) = Result.bind
let failwith_error_msg = function Ok v -> v | Error (`Msg msg) -> failwith msg

let is_stdlib t =
  let name = Modname.to_string (Info.modname t) in
  String.equal name "Stdlib"
  || (String.length name > 8 && String.sub name 0 8 = "Stdlib__")
  || (String.length name > 11 && String.sub name 0 11 = "Camlinternal")
  || String.equal name "Std_exit"

(* NOTE(dinosaure): [resolve_choose] and [resolve_conflict] are optimistic
   implementations of what happens when our solver struggles to find a
   solution. In reality, we’d probably fail, but let’s stay positive and
   continue solving. *)

(* The priority is:
   1) [*.cmi]
   2) a library ([*.cma] or [*.cmxa]
   3) a native artifact
   4) the first candidate
 *)
let resolve_choose modname vs =
  let ( let* ) x fn = match x with None -> fn () | Some v -> Some v in
  let pick =
    let* () = List.find_opt Info.is_a_cmi vs in
    let* () = List.find_opt Info.is_a_library vs in
    let* () = List.find_opt Info.is_native vs in
    Some (List.hd vs)
  in
  let pick = Stdlib.Option.get pick in
  Log.warn (fun m ->
      m "Ambiguous module %a; picking %a among @[<hov>%a@]" Modname.pp modname
        Info.pp pick
        Fmt.(Dump.list Info.pp)
        vs);
  pick

(* The choice between [u] and [v] is:
   1) the library first
   2) the [*.cmi]
   3) or [u] (TODO)
 *)
let resolve_conflict crc u v =
  let pick =
    if Info.is_a_library u then u
    else if Info.is_a_library v then v
    else if Info.is_a_cmi u then u
    else if Info.is_a_cmi v then v
    else u
  in
  Log.warn (fun m ->
      m "Conflict on %a between %a and %a; keeping %a" Digest.pp crc Info.pp u
        Info.pp v Info.pp pick);
  pick

let with_resolver fn =
  let open Effect.Deep in
  let retc = Fun.id
  and exnc = raise
  and effc (type a) (eff : a Effect.t) =
    match eff with
    | Choose (modname, vs) ->
        Some
          (fun (k : (a, _) continuation) ->
            continue k (resolve_choose modname vs))
    | Conflict (crc, u, v) ->
        Some
          (fun (k : (a, _) continuation) ->
            continue k (resolve_conflict crc u v))
    | _ -> None
  in
  match_with fn () { retc; exnc; effc }

let qualify ?(stdlib = true) files =
  let fn0 location =
    OS.File.with_ic location @@ fun ic () ->
    match Misc.Magic_number.read_info ic with
    | Error _ -> Ok (Either.Right location)
    | Ok info ->
        let* v = Info.from_object location info ic in
        Ok (Either.Left v)
  in
  let fn0 loc = Result.join (fn0 loc ()) |> failwith_error_msg in
  let fn1 () =
    let objects, sources = List.partition_map fn0 files in
    let objects = qualify_objects objects in
    let cmis, _ = List.partition Info.is_a_cmi objects in
    let cmis = List.filter (Fun.negate is_stdlib) cmis in
    let sources = from_sources ~stdlib ~cmis sources in
    List.rev_append objects sources
  in
  with_resolver fn1

(* NOTE(dinosaure): Finally, we can qualify objects (what they need) regardless
   of whether it is a source file (managed by [codept]) or an artefact [*.cm*].
 *)
let qualify ?(stdlib = true) lst =
  let fn acc x =
    let* loc = to_locations x in
    let* acc = acc in
    Ok (loc :: acc)
  in
  let* locations = List.fold_left fn (Ok []) lst in
  let locations = List.concat locations in
  try Ok (qualify ~stdlib locations) with Failure msg -> Error (`Msg msg)