package irmin-graphql

  1. Overview
  2. Docs

Source file server.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
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
open! Import
module Schema = Graphql_lwt.Schema

module type S = sig
  module IO : Cohttp_lwt.S.IO

  type repo
  type server

  type response_action =
    [ `Expert of Cohttp.Response.t * (IO.ic -> IO.oc -> unit Lwt.t)
    | `Response of Cohttp.Response.t * Cohttp_lwt.Body.t ]

  val schema : repo -> unit Schema.schema

  val execute_request :
    unit Schema.schema ->
    Cohttp_lwt.Request.t ->
    Cohttp_lwt.Body.t ->
    response_action Lwt.t

  val v : repo -> server
end

let of_irmin_result = function
  | Ok _ as ok -> ok
  | Error (`Msg msg) -> Error msg

module Option = struct
  let map f t = match t with None -> None | Some x -> Some (f x)
end

module Result = struct
  let ok x = Ok x
end

module type CONFIG = sig
  val remote : (?headers:Cohttp.Header.t -> string -> Irmin.remote) option

  val info :
    ?author:string -> ('a, Format.formatter, unit, Irmin.Info.f) format4 -> 'a
end

module type CUSTOM_TYPE = sig
  type t

  val schema_typ : (unit, t option) Schema.typ
  val arg_typ : t option Schema.Arg.arg_typ
end

module type CUSTOM_TYPES = sig
  type key
  type metadata
  type contents
  type hash
  type branch

  module Key : CUSTOM_TYPE with type t := key
  module Metadata : CUSTOM_TYPE with type t := metadata
  module Contents : CUSTOM_TYPE with type t := contents
  module Hash : CUSTOM_TYPE with type t := hash
  module Branch : CUSTOM_TYPE with type t := branch
end

module Default_type (T : sig
  include Irmin.Type.S

  val name : string
end) =
struct
  let schema_typ =
    let coerce t = `String (Irmin.Type.to_string T.t t) in
    Schema.scalar T.name ~coerce

  let arg_typ =
    let coerce = function
      | `String s -> of_irmin_result (Irmin.Type.of_string T.t s)
      | _ -> Error "Invalid input value"
    in
    Schema.Arg.scalar T.name ~coerce
end

module Default_types (S : Irmin.S) = struct
  module Key = Default_type (struct
    include S.Key

    let name = "Key"
  end)

  module Metadata = Default_type (struct
    include S.Metadata

    let name = "Metadata"
  end)

  module Contents = Default_type (struct
    include S.Contents

    let name = "Value"
  end)

  module Hash = Default_type (struct
    include S.Hash

    let name = "Hash"
  end)

  module Branch = Default_type (struct
    include S.Branch

    let name = "BranchName"
  end)
end

module Make_ext
    (Server : Cohttp_lwt.S.Server)
    (Config : CONFIG)
    (Store : Irmin.S)
    (Types : CUSTOM_TYPES
               with type key := Store.key
                and type metadata := Store.metadata
                and type contents := Store.contents
                and type hash := Store.hash
                and type branch := Store.branch) =
struct
  module IO = Server.IO
  module Sync = Irmin.Sync (Store)
  module Graphql_server = Graphql_cohttp.Make (Schema) (IO) (Cohttp_lwt.Body)

  type repo = Store.repo
  type server = Server.t

  type txn_args = {
    author : string option;
    message : string option;
    retries : int option;
    allow_empty : bool option;
    parents : Store.Hash.t list option;
  }

  let txn_args repo input =
    match input with
    | Some input ->
        let message = match input.message with None -> "" | Some m -> m in
        let author = input.author in
        let parents =
          match input.parents with
          | Some l ->
              Lwt_list.filter_map_s
                (fun hash -> Store.Commit.of_hash repo hash)
                l
              >>= Lwt.return_some
          | None -> Lwt.return_none
        in
        let+ parents = parents in
        ( Config.info ?author "%s" message,
          input.retries,
          input.allow_empty,
          parents )
    | None -> Lwt.return (Config.info "", None, None, None)

  type response_action =
    [ `Expert of Cohttp.Response.t * (IO.ic -> IO.oc -> unit Lwt.t)
    | `Response of Cohttp.Response.t * Cohttp_lwt.Body.t ]

  type tree_item = {
    key : Store.key;
    value : Store.contents option;
    metadata : Store.metadata option;
  }

  let mk_branch repo = function
    | Some b -> Store.of_branch repo b
    | None -> Store.master repo

  let rec concat_key a b =
    match Store.Key.decons a with
    | None -> b
    | Some (step, a_tl) -> Store.Key.cons step (concat_key a_tl b)

  module Input = struct
    let coerce_remote = function
      | `String s -> (
          match Config.remote with
          | Some remote -> Ok (remote s)
          | None -> Error "sync is not available")
      | _ -> Error "Invalid input value"

    let remote = Schema.Arg.(scalar "Remote" ~coerce:coerce_remote)
    let key = Types.Key.arg_typ
    let commit_hash = Types.Hash.arg_typ
    let branch = Types.Branch.arg_typ
    let value = Types.Contents.arg_typ
    let metadata = Types.Metadata.arg_typ

    let info =
      Schema.Arg.(
        obj "InfoInput"
          ~fields:
            [
              arg "author" ~typ:string;
              arg "message" ~typ:string;
              arg "retries" ~typ:int;
              arg "allow_empty" ~typ:bool;
              arg "parents" ~typ:(list (non_null commit_hash));
            ]
          ~coerce:(fun author message retries allow_empty parents ->
            { author; message; retries; allow_empty; parents }))

    let item =
      Schema.Arg.(
        obj "TreeItem"
          ~fields:
            [
              arg "key" ~typ:(non_null key);
              arg "value" ~typ:value;
              arg "metadata" ~typ:metadata;
            ]
          ~coerce:(fun key value metadata -> { key; value; metadata }))

    let tree = Schema.Arg.(list (non_null item))
  end

  let rec commit =
    lazy
      Schema.(
        obj "Commit" ~fields:(fun _ ->
            [
              field "tree"
                ~typ:(non_null (Lazy.force tree))
                ~args:[]
                ~resolve:(fun _ c -> (Store.Commit.tree c, Store.Key.empty));
              field "parents"
                ~typ:(non_null (list (non_null Types.Hash.schema_typ)))
                ~args:[]
                ~resolve:(fun _ c -> Store.Commit.parents c);
              field "info"
                ~typ:(non_null Lazy.(force info))
                ~args:[]
                ~resolve:(fun _ c -> Store.Commit.info c);
              field "hash" ~typ:(non_null Types.Hash.schema_typ) ~args:[]
                ~resolve:(fun _ c -> Store.Commit.hash c);
            ]))

  and info : ('ctx, Irmin.Info.t option) Schema.typ Lazy.t =
    lazy
      Schema.(
        obj "Info" ~fields:(fun _info ->
            [
              field "date" ~typ:(non_null string) ~args:[] ~resolve:(fun _ i ->
                  Irmin.Info.date i |> Int64.to_string);
              field "author" ~typ:(non_null string) ~args:[]
                ~resolve:(fun _ i -> Irmin.Info.author i);
              field "message" ~typ:(non_null string) ~args:[]
                ~resolve:(fun _ i -> Irmin.Info.message i);
            ]))

  and tree : ('ctx, (Store.tree * Store.key) option) Schema.typ Lazy.t =
    lazy
      Schema.(
        obj "Tree" ~fields:(fun _ ->
            [
              field "key" ~typ:(non_null Types.Key.schema_typ) ~args:[]
                ~resolve:(fun _ (_, key) -> key);
              io_field "get"
                ~args:Arg.[ arg "key" ~typ:(non_null Input.key) ]
                ~typ:Types.Contents.schema_typ
                ~resolve:(fun _ (tree, _) key ->
                  Store.Tree.find tree key >|= Result.ok);
              io_field "get_contents"
                ~args:Arg.[ arg "key" ~typ:(non_null Input.key) ]
                ~typ:Lazy.(force contents)
                ~resolve:(fun _ (tree, tree_key) key ->
                  Store.Tree.find_all tree key
                  >|= Option.map (fun (c, m) ->
                          let key' = concat_key tree_key key in
                          (c, m, key'))
                  >|= Result.ok);
              io_field "get_tree"
                ~args:Arg.[ arg "key" ~typ:(non_null Input.key) ]
                ~typ:Lazy.(force tree)
                ~resolve:(fun _ (tree, tree_key) key ->
                  Store.Tree.find_tree tree key
                  >|= Option.map (fun tree ->
                          let tree_key' = concat_key tree_key key in
                          (tree, tree_key'))
                  >|= Result.ok);
              io_field "list_contents_recursively" ~args:[]
                ~typ:(non_null (list (non_null Lazy.(force contents))))
                ~resolve:(fun _ (tree, key) ->
                  let rec tree_list ?(acc = []) concrete_tree key =
                    match concrete_tree with
                    | `Contents (c, m) -> (c, m, key) :: acc
                    | `Tree l ->
                        List.fold_left
                          (fun acc (step, t) ->
                            let key' = Store.Key.rcons key step in
                            tree_list t key' ~acc)
                          acc l
                        |> List.rev
                  in
                  let+ concrete_tree = Store.Tree.to_concrete tree in
                  Ok (tree_list concrete_tree key));
              field "hash" ~typ:(non_null Types.Hash.schema_typ) ~args:[]
                ~resolve:(fun _ (tree, _) -> Store.Tree.hash tree);
              io_field "list"
                ~typ:(non_null (list (non_null node)))
                ~args:[]
                ~resolve:(fun _ (tree, tree_key) ->
                  Store.Tree.list tree Store.Key.empty
                  >>= Lwt_list.map_s (fun (step, tree) ->
                          let absolute_key = Store.Key.rcons tree_key step in
                          match Store.Tree.destruct tree with
                          | `Contents (c, m) ->
                              let+ c = Store.Tree.Contents.force_exn c in
                              Lazy.(force contents_as_node (c, m, absolute_key))
                          | _ ->
                              Lwt.return
                                Lazy.(force tree_as_node (tree, absolute_key)))
                  >|= Result.ok);
            ]))

  and branch : ('ctx, (Store.t * Store.Branch.t) option) Schema.typ Lazy.t =
    lazy
      Schema.(
        obj "Branch" ~fields:(fun _branch ->
            [
              field "name" ~typ:(non_null Types.Branch.schema_typ) ~args:[]
                ~resolve:(fun _ (_, b) -> b);
              io_field "head" ~args:[] ~typ:(Lazy.force commit)
                ~resolve:(fun _ (t, _) -> Store.Head.find t >|= Result.ok);
              io_field "tree" ~args:[]
                ~typ:(non_null Lazy.(force tree))
                ~resolve:(fun _ (t, _) ->
                  let+ tree = Store.tree t in
                  Ok (tree, Store.Key.empty));
              io_field "last_modified"
                ~typ:(non_null (list (non_null (Lazy.force commit))))
                ~args:
                  Arg.
                    [
                      arg "key" ~typ:(non_null Input.key);
                      arg "depth" ~typ:int;
                      arg "n" ~typ:int;
                    ]
                ~resolve:(fun _ (t, _) key depth n ->
                  Store.last_modified ?depth ?n t key >|= Result.ok);
              io_field "lcas"
                ~typ:(non_null (list (non_null (Lazy.force commit))))
                ~args:Arg.[ arg "commit" ~typ:(non_null Input.commit_hash) ]
                ~resolve:(fun _ (t, _) commit ->
                  Store.Commit.of_hash (Store.repo t) commit >>= function
                  | Some commit -> (
                      Store.lcas_with_commit t commit >>= function
                      | Ok lcas -> Lwt.return (Ok lcas)
                      | Error e ->
                          let msg = Irmin.Type.to_string Store.lca_error_t e in
                          Lwt.return (Error msg))
                  | None -> Lwt.return (Error "Commit not found"));
            ]))

  and contents :
      ('ctx, (Store.contents * Store.metadata * Store.key) option) Schema.typ
      Lazy.t =
    lazy
      Schema.(
        obj "Contents" ~fields:(fun _contents ->
            [
              field "key" ~typ:(non_null Types.Key.schema_typ) ~args:[]
                ~resolve:(fun _ (_, _, key) -> key);
              field "metadata" ~typ:(non_null Types.Metadata.schema_typ)
                ~args:[] ~resolve:(fun _ (_, metadata, _) -> metadata);
              field "value" ~typ:(non_null Types.Contents.schema_typ) ~args:[]
                ~resolve:(fun _ (contents, _, _) -> contents);
              field "hash" ~typ:(non_null Types.Hash.schema_typ) ~args:[]
                ~resolve:(fun _ (contents, _, _) ->
                  Store.Contents.hash contents);
            ]))

  and node = Schema.union "Node"
  and tree_as_node = lazy (Schema.add_type node (Lazy.force tree))
  and contents_as_node = lazy (Schema.add_type node (Lazy.force contents))

  [@@@ocaml.warning "-5"]

  let _ = Lazy.force tree_as_node
  let _ = Lazy.force contents_as_node

  let err_write e =
    Lwt.return (Error (Irmin.Type.to_string Store.write_error_t e))

  let remote s =
    match Config.remote with
    | Some _ ->
        Schema.
          [
            io_field "clone"
              ~typ:Lazy.(force commit)
              ~args:
                Arg.
                  [
                    arg "branch" ~typ:Input.branch;
                    arg "remote" ~typ:(non_null Input.remote);
                  ]
              ~resolve:(fun _ _src branch remote ->
                let* t = mk_branch s branch in
                Sync.fetch t remote >>= function
                | Ok (`Head d) -> Store.Head.set t d >|= fun () -> Ok (Some d)
                | Ok `Empty -> Lwt.return (Ok None)
                | Error (`Msg e) -> Lwt.return (Error e));
            io_field "push" ~typ:(Lazy.force commit)
              ~args:
                Arg.
                  [
                    arg "branch" ~typ:Input.branch;
                    arg "remote" ~typ:(non_null Input.remote);
                    arg "depth" ~typ:int;
                  ]
              ~resolve:(fun _ _src branch remote depth ->
                let* t = mk_branch s branch in
                Sync.push t ?depth remote >>= function
                | Ok (`Head commit) -> Lwt.return (Ok (Some commit))
                | Ok `Empty -> Lwt.return (Ok None)
                | Error e ->
                    let s = Fmt.to_to_string Sync.pp_push_error e in
                    Lwt.return (Error s));
            io_field "pull" ~typ:(Lazy.force commit)
              ~args:
                Arg.
                  [
                    arg "branch" ~typ:Input.branch;
                    arg "remote" ~typ:(non_null Input.remote);
                    arg "info" ~typ:Input.info;
                    arg "depth" ~typ:int;
                  ]
              ~resolve:(fun _ _src branch remote info depth ->
                let* t = mk_branch s branch in
                let strategy =
                  match info with
                  | Some info ->
                      let+ info, _, _, _ = txn_args s (Some info) in
                      `Merge info
                  | None -> Lwt.return `Set
                in
                strategy >>= Sync.pull ?depth t remote >>= function
                | Ok (`Head h) -> Lwt.return (Ok (Some h))
                | Ok `Empty -> Lwt.return (Ok None)
                | Error (`Msg msg) -> Lwt.return (Error msg)
                | Error (`Conflict msg) ->
                    Lwt.return (Error ("conflict: " ^ msg)));
          ]
    | None -> []

  let to_tree tree l =
    Lwt_list.fold_left_s
      (fun tree -> function
        | { key; value = Some v; metadata } ->
            Store.Tree.add tree ?metadata key v
        | { key; value = None; _ } -> Store.Tree.remove tree key)
      tree l

  let mutations s =
    Schema.
      [
        io_field "set" ~typ:(Lazy.force commit)
          ~args:
            Arg.
              [
                arg "branch" ~typ:Input.branch;
                arg "key" ~typ:(non_null Input.key);
                arg "value" ~typ:(non_null Input.value);
                arg "info" ~typ:Input.info;
              ]
          ~resolve:(fun _ _src branch k v i ->
            let* t = mk_branch s branch in
            let* info, retries, allow_empty, parents = txn_args s i in
            Store.set t ?retries ?allow_empty ?parents k v ~info >>= function
            | Ok () -> Store.Head.find t >|= Result.ok
            | Error e -> err_write e);
        io_field "set_tree" ~typ:(Lazy.force commit)
          ~args:
            Arg.
              [
                arg "branch" ~typ:Input.branch;
                arg "key" ~typ:(non_null Input.key);
                arg "tree" ~typ:(non_null Input.tree);
                arg "info" ~typ:Input.info;
              ]
          ~resolve:(fun _ _src branch k items i ->
            let* t = mk_branch s branch in
            let* info, retries, allow_empty, parents = txn_args s i in
            Lwt.catch
              (fun () ->
                let tree = Store.Tree.empty () in
                let* tree = to_tree tree items in
                Store.set_tree t ?retries ?allow_empty ?parents ~info k tree
                >>= function
                | Ok _ -> Store.Head.find t >|= Result.ok
                | Error e -> err_write e)
              (function Failure e -> Lwt.return (Error e) | e -> raise e));
        io_field "update_tree" ~typ:(Lazy.force commit)
          ~args:
            Arg.
              [
                arg "branch" ~typ:Input.branch;
                arg "key" ~typ:(non_null Input.key);
                arg "tree" ~typ:(non_null Input.tree);
                arg "info" ~typ:Input.info;
              ]
          ~resolve:(fun _ _src branch k items i ->
            let* t = mk_branch s branch in
            let* info, retries, allow_empty, parents = txn_args s i in
            Lwt.catch
              (fun () ->
                Store.with_tree t ?retries ?allow_empty ?parents k ~info
                  (fun tree ->
                    let tree =
                      match tree with
                      | Some t -> t
                      | None -> Store.Tree.empty ()
                    in
                    to_tree tree items >>= Lwt.return_some)
                >>= function
                | Ok _ -> Store.Head.find t >|= Result.ok
                | Error e -> err_write e)
              (function Failure e -> Lwt.return (Error e) | e -> raise e));
        io_field "set_all" ~typ:(Lazy.force commit)
          ~args:
            Arg.
              [
                arg "branch" ~typ:Input.branch;
                arg "key" ~typ:(non_null Input.key);
                arg "value" ~typ:(non_null Input.value);
                arg "metadata" ~typ:Input.metadata;
                arg "info" ~typ:Input.info;
              ]
          ~resolve:(fun _ _src branch k v m i ->
            let* t = mk_branch s branch in
            let* info, retries, allow_empty, parents = txn_args s i in
            let* tree =
              Store.find_tree t k >>= function
              | Some tree -> Lwt.return tree
              | None -> Lwt.return (Store.Tree.empty ())
            in
            let* tree = Store.Tree.add tree k ?metadata:m v in
            Store.set_tree t ?retries ?allow_empty ?parents k tree ~info
            >>= function
            | Ok () -> Store.Head.find t >|= Result.ok
            | Error e -> err_write e);
        io_field "test_and_set" ~typ:(Lazy.force commit)
          ~args:
            Arg.
              [
                arg "branch" ~typ:Input.branch;
                arg "key" ~typ:(non_null Input.key);
                arg "test" ~typ:Input.value;
                arg "set" ~typ:Input.value;
                arg "info" ~typ:Input.info;
              ]
          ~resolve:(fun _ _src branch k test set i ->
            let* t = mk_branch s branch in
            let* info, retries, allow_empty, parents = txn_args s i in
            Store.test_and_set ?retries ?allow_empty ?parents ~info t k ~test
              ~set
            >>= function
            | Ok _ -> Store.Head.find t >|= Result.ok
            | Error e -> err_write e);
        io_field "test_and_set_branch" ~typ:(non_null bool)
          ~args:
            Arg.
              [
                arg "branch" ~typ:(non_null Input.branch);
                arg "test" ~typ:Input.commit_hash;
                arg "set" ~typ:Input.commit_hash;
              ]
          ~resolve:(fun _ _src branch test set ->
            let branches = Store.Private.Repo.branch_t s in
            Store.Private.Branch.test_and_set branches branch ~test ~set
            >|= Result.ok);
        io_field "remove" ~typ:(Lazy.force commit)
          ~args:
            Arg.
              [
                arg "branch" ~typ:Input.branch;
                arg "key" ~typ:(non_null Input.key);
                arg "info" ~typ:Input.info;
              ]
          ~resolve:(fun _ _src branch key i ->
            let* t = mk_branch s branch in
            let* info, retries, allow_empty, parents = txn_args s i in
            Store.remove t ?retries ?allow_empty ?parents key ~info >>= function
            | Ok () -> Store.Head.find t >|= Result.ok
            | Error e -> err_write e);
        io_field "merge" ~typ:Types.Hash.schema_typ
          ~args:
            Arg.
              [
                arg "branch" ~typ:Input.branch;
                arg "key" ~typ:(non_null Input.key);
                arg "value" ~typ:Input.value;
                arg "old" ~typ:Input.value;
                arg "info" ~typ:Input.info;
              ]
          ~resolve:(fun _ _src branch key value old info ->
            let* t = mk_branch s branch in
            let* info, retries, allow_empty, parents = txn_args s info in
            Store.merge t key ~info ?retries ?allow_empty ?parents ~old value
            >>= function
            | Ok _ -> Store.hash t key >|= Result.ok
            | Error e -> err_write e);
        io_field "merge_tree" ~typ:(Lazy.force commit)
          ~args:
            Arg.
              [
                arg "branch" ~typ:Input.branch;
                arg "key" ~typ:(non_null Input.key);
                arg "value" ~typ:Input.tree;
                arg "old" ~typ:Input.tree;
                arg "info" ~typ:Input.info;
              ]
          ~resolve:(fun _ _src branch key value old info ->
            let* t = mk_branch s branch in
            let* info, retries, allow_empty, parents = txn_args s info in
            let* old =
              match old with
              | Some old ->
                  let tree = Store.Tree.empty () in
                  to_tree tree old >>= Lwt.return_some
              | None -> Lwt.return_none
            in
            let* value =
              match value with
              | Some value ->
                  let tree = Store.Tree.empty () in
                  to_tree tree value >>= Lwt.return_some
              | None -> Lwt.return_none
            in
            Store.merge_tree t key ~info ?retries ?allow_empty ?parents ~old
              value
            >>= function
            | Ok _ -> Store.Head.find t >|= Result.ok
            | Error e -> err_write e);
        io_field "merge_with_branch" ~typ:(Lazy.force commit)
          ~args:
            Arg.
              [
                arg "branch" ~typ:Input.branch;
                arg "from" ~typ:(non_null Input.branch);
                arg "info" ~typ:Input.info;
                arg "max_depth" ~typ:int;
                arg "n" ~typ:int;
              ]
          ~resolve:(fun _ _src into from i max_depth n ->
            let* t = mk_branch s into in
            let* info, _, _, _ = txn_args s i in
            let* _ = Store.merge_with_branch t from ~info ?max_depth ?n in
            Store.Head.find t >|= Result.ok);
        io_field "merge_with_commit" ~typ:(Lazy.force commit)
          ~args:
            Arg.
              [
                arg "branch" ~typ:Input.branch;
                arg "from" ~typ:(non_null Input.commit_hash);
                arg "info" ~typ:Input.info;
                arg "max_depth" ~typ:int;
                arg "n" ~typ:int;
              ]
          ~resolve:(fun _ _src into from i max_depth n ->
            let* t = mk_branch s into in
            let* info, _, _, _ = txn_args s i in
            Store.Commit.of_hash (Store.repo t) from >>= function
            | Some from -> (
                Store.merge_with_commit t from ~info ?max_depth ?n >>= function
                | Ok _ -> Store.Head.find t >|= Result.ok
                | Error e ->
                    Lwt.return
                      (Error (Irmin.Type.to_string Irmin.Merge.conflict_t e)))
            | None -> Lwt.return (Error "invalid hash"));
        io_field "revert" ~typ:(Lazy.force commit)
          ~args:
            Arg.
              [
                arg "branch" ~typ:Input.branch;
                arg "commit" ~typ:(non_null Input.commit_hash);
              ]
          ~resolve:(fun _ _src branch commit ->
            Store.Commit.of_hash s commit >>= function
            | Some commit ->
                let* t = mk_branch s branch in
                Store.Head.set t commit >|= fun () -> Ok (Some commit)
            | None -> Lwt.return (Ok None));
      ]

  let diff =
    Schema.(
      obj "Diff" ~fields:(fun _ ->
          [
            field "commit"
              ~typ:(non_null Lazy.(force commit))
              ~args:[]
              ~resolve:
                (fun _ctx -> function
                  | `Added c | `Removed c | `Updated (_, c) -> c);
          ]))

  let map_diff diff ~added ~removed ~updated =
    match diff with
    | `Added x -> `Added (added x)
    | `Removed x -> `Removed (removed x)
    | `Updated (x, y) -> `Updated (updated x y)

  let subscriptions s =
    Schema.
      [
        subscription_field "watch" ~typ:(non_null diff)
          ~args:Arg.[ arg "branch" ~typ:Input.branch; arg "key" ~typ:Input.key ]
          ~resolve:(fun _ctx branch key ->
            let* t = mk_branch s branch in
            let stream, push = Lwt_stream.create () in
            let destroy_stream watch () =
              push None;
              Lwt.ignore_result (Store.unwatch watch)
            in
            match key with
            | None ->
                let+ watch =
                  Store.watch t (fun diff ->
                      push (Some diff);
                      Lwt.return_unit)
                in
                Ok (stream, destroy_stream watch)
            | Some key ->
                let+ watch =
                  Store.watch_key t key (function diff ->
                      push
                        (Some
                           (map_diff diff
                              ~added:(fun (c, _) -> c)
                              ~removed:(fun (c, _) -> c)
                              ~updated:(fun (before, _) (after, _) ->
                                (before, after))));
                      Lwt.return_unit)
                in
                Ok (stream, destroy_stream watch));
      ]

  let schema s =
    let mutations = mutations s @ remote s in
    let subscriptions = subscriptions s in
    Schema.(
      schema ~mutations ~subscriptions
        [
          io_field "commit" ~typ:(Lazy.force commit)
            ~args:Arg.[ arg "hash" ~typ:(non_null Input.commit_hash) ]
            ~resolve:(fun _ _src hash ->
              Store.Commit.of_hash s hash >|= Result.ok);
          io_field "branches"
            ~typ:(non_null (list (non_null Lazy.(force branch))))
            ~args:[]
            ~resolve:(fun _ _ ->
              Store.Branch.list s
              >>= Lwt_list.map_p (fun branch ->
                      let+ store = Store.of_branch s branch in
                      (store, branch))
              >|= Result.ok);
          io_field "master" ~typ:(Lazy.force branch) ~args:[]
            ~resolve:(fun _ _ ->
              let+ t = Store.master s in
              Ok (Some (t, Store.Branch.master)));
          io_field "branch" ~typ:(Lazy.force branch)
            ~args:Arg.[ arg "name" ~typ:(non_null Input.branch) ]
            ~resolve:(fun _ _ branch ->
              let+ t = Store.of_branch s branch in
              Ok (Some (t, branch)));
        ])

  let execute_request ctx req = Graphql_server.execute_request ctx () req

  let v store =
    let schema = schema store in
    let callback = Graphql_server.make_callback (fun _ctx -> ()) schema in
    Server.make_response_action ~callback ()
end

module Make (Server : Cohttp_lwt.S.Server) (Config : CONFIG) (Store : Irmin.S) =
struct
  module Types = Default_types (Store)
  include Make_ext (Server) (Config) (Store) (Types)
end