package irmin-pack
Irmin backend which stores values in a pack file
Install
Dune Dependency
Authors
Maintainers
Sources
irmin-3.2.1.tbz
sha256=9cfb7291a7d90ca0e55ece33040ad41e74cadd8c6446e04c33558bc1a1951518
sha512=9605acd77de9aae70ae96554a28594e6ed5beba70a48145c0fc2204b32bb23b843ba98cf034e88391581d5f3495154195c644d64a3aa3f8d3994a9c5518c5cda
doc/src/irmin-pack.unix/ext.ml.html
Source file ext.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
(* * Copyright (c) 2018-2021 Tarides <contact@tarides.com> * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. *) open! Import module IO = IO.Unix module Maker (Config : Conf.S) = struct type endpoint = unit include Pack_key.Store_spec module Make (Schema : Irmin.Schema.Extended) = struct open struct module P = Schema.Path module M = Schema.Metadata module C = Schema.Contents module B = Schema.Branch end module H = Schema.Hash module Index = Pack_index.Make (H) module Pack = Pack_store.Maker (Index) (H) module Dict = Pack_dict module XKey = Pack_key.Make (H) module X = struct module Hash = H type 'a value = { hash : H.t; kind : Pack_value.Kind.t; v : 'a } [@@deriving irmin] module Contents = struct module Pack_value = Pack_value.Of_contents (Config) (H) (XKey) (C) module CA = struct include Pack.Make (Pack_value) type index = Index.t end include Irmin.Contents.Store_indexable (CA) (H) (C) end module Node = struct module Value = Schema.Node (XKey) (XKey) module CA = struct module Inter = Irmin_pack.Inode.Make_internal (Config) (H) (XKey) (Value) include Inode.Make_persistent (H) (Value) (Inter) (Pack) type index = Index.t end include Irmin.Node.Generic_key.Store (Contents) (CA) (H) (CA.Val) (M) (P) end module Node_portable = Node.CA.Val.Portable module Schema = struct include Schema module Node = Node end module Commit = struct module Value = struct include Schema.Commit (Node.Key) (XKey) module Info = Schema.Info type hash = Hash.t [@@deriving irmin] end module Pack_value = Pack_value.Of_commit (H) (XKey) (Value) module CA = Pack.Make (Pack_value) include Irmin.Commit.Generic_key.Store (Schema.Info) (Node) (CA) (H) (Value) end module Commit_portable = struct module Hash_key = Irmin.Key.Of_hash (Hash) include Schema.Commit (Hash_key) (Hash_key) let of_commit : Commit.Value.t -> t = fun t -> let info = Commit.Value.info t and node = Commit.Value.node t |> XKey.to_hash and parents = Commit.Value.parents t |> List.map XKey.to_hash in v ~info ~node ~parents module Info = Schema.Info type hash = Hash.t [@@deriving irmin] end module Branch = struct module Key = B module Val = XKey module AW = Atomic_write.Make_persistent (Key) (Val) include Atomic_write.Closeable (AW) let v ?fresh ?readonly path = AW.v ?fresh ?readonly path >|= make_closeable end module Slice = Irmin.Backend.Slice.Make (Contents) (Node) (Commit) module Remote = Irmin.Backend.Remote.None (Commit.Key) (B) module Repo = struct type t = { config : Irmin.Backend.Conf.t; contents : read Contents.CA.t; node : read Node.CA.t; commit : read Commit.CA.t; branch : Branch.t; index : Index.t; } let contents_t t : 'a Contents.t = t.contents let node_t t : 'a Node.t = (contents_t t, t.node) let commit_t t : 'a Commit.t = (node_t t, t.commit) let branch_t t = t.branch let batch t f = Commit.CA.batch t.commit (fun commit -> Node.CA.batch t.node (fun node -> Contents.CA.batch t.contents (fun contents -> let contents : 'a Contents.t = contents in let node : 'a Node.t = (contents, node) in let commit : 'a Commit.t = (node, commit) in f contents node commit))) let unsafe_v config = let root = Conf.root config and fresh = Conf.fresh config and lru_size = Conf.lru_size config and readonly = Conf.readonly config and log_size = Conf.index_log_size config and throttle = Conf.merge_throttle config and indexing_strategy = Conf.indexing_strategy config in let f = ref (fun () -> ()) in let index = Index.v ~flush_callback:(fun () -> !f ()) (* backpatching to add pack flush before an index flush *) ~fresh ~readonly ~throttle ~log_size root in let* contents = Contents.CA.v ~fresh ~readonly ~lru_size ~index ~indexing_strategy root in let* node = Node.CA.v ~fresh ~readonly ~lru_size ~index ~indexing_strategy root in let* commit = Commit.CA.v ~fresh ~readonly ~lru_size ~index ~indexing_strategy root in let+ branch = Branch.v ~fresh ~readonly root in (* Stores share instances in memory, one flush is enough. In case of a system crash, the flush_callback might not make with the disk. In this case, when the store is reopened, [integrity_check] needs to be called to repair the store. *) (f := fun () -> Contents.CA.flush ~index:false contents); { contents; node; commit; branch; config; index } let close t = Index.close t.index; Contents.CA.close (contents_t t) >>= fun () -> Node.CA.close (snd (node_t t)) >>= fun () -> Commit.CA.close (snd (commit_t t)) >>= fun () -> Branch.close t.branch let v config = Lwt.catch (fun () -> unsafe_v config) (function | Version.Invalid { expected; found } as e when expected = Version.latest -> [%log.err "[%s] Attempted to open store of unsupported version %a" (Conf.root config) Version.pp found]; Lwt.fail e | e -> Lwt.fail e) (** Stores share instances in memory, one sync is enough. *) let sync t = Contents.CA.sync (contents_t t) let flush t = Contents.CA.flush (contents_t t); Branch.flush t.branch end end let integrity_check ?ppf ~auto_repair t = let module Checks = Checks.Index (Index) in let contents = X.Repo.contents_t t in let nodes = X.Repo.node_t t |> snd in let commits = X.Repo.commit_t t |> snd in let check ~kind ~offset ~length k = match kind with | `Contents -> X.Contents.CA.integrity_check ~offset ~length k contents | `Node -> X.Node.CA.integrity_check ~offset ~length k nodes | `Commit -> X.Commit.CA.integrity_check ~offset ~length k commits in Checks.integrity_check ?ppf ~auto_repair ~check t.index include Irmin.Of_backend (X) let integrity_check_inodes ?heads t = [%log.debug "Check integrity for inodes"]; let counter, (_, progress_nodes, progress_commits) = Utils.Object_counter.start () in let errors = ref [] in let nodes = X.Repo.node_t t |> snd in let pred_node repo key = Lwt.catch (fun () -> Repo.default_pred_node repo key) (fun _ -> errors := "Error in repo iter" :: !errors; Lwt.return []) in let node k = progress_nodes (); X.Node.CA.integrity_check_inodes nodes k >|= function | Ok () -> () | Error msg -> errors := msg :: !errors in let commit _ = progress_commits (); Lwt.return_unit in let* heads = match heads with None -> Repo.heads t | Some m -> Lwt.return m in let hashes = List.map (fun x -> `Commit (Commit.key x)) heads in let+ () = Repo.iter ~cache_size:1_000_000 ~min:[] ~max:hashes ~pred_node ~node ~commit t in Utils.Object_counter.finalise counter; let pp_commits = Fmt.list ~sep:Fmt.comma Commit.pp_hash in if !errors = [] then Fmt.kstr (fun x -> Ok (`Msg x)) "Ok for heads %a" pp_commits heads else Fmt.kstr (fun x -> Error (`Msg x)) "Inconsistent inodes found for heads %a: %a" pp_commits heads Fmt.(list ~sep:comma string) !errors module Stats = struct let pp_key = Irmin.Type.pp XKey.t let traverse_inodes ~dump_blob_paths_to commit repo = let module Stats = Checks.Stats (struct type nonrec step = step let step_t = step_t module Hash = Hash end) in let t = Stats.v () in let pred_node repo k = X.Node.find (X.Repo.node_t repo) k >|= function | None -> Fmt.failwith "key %a not found" pp_key k | Some v -> let width = X.Node.Val.length v in let nb_children = X.Node.CA.Val.nb_children v in let preds = X.Node.CA.Val.pred v in let () = preds |> List.map (function | s, `Contents h -> (s, `Contents (XKey.to_hash h)) | s, `Inode h -> (s, `Inode (XKey.to_hash h)) | s, `Node h -> (s, `Node (XKey.to_hash h))) |> Stats.visit_node t (XKey.to_hash k) ~width ~nb_children in List.rev_map (function | s, `Inode x -> assert (s = None); `Node x | _, `Node x -> `Node x | _, `Contents x -> `Contents x) preds in (* We are traversing only one commit. *) let pred_commit repo k = X.Commit.find (X.Repo.commit_t repo) k >|= function | None -> [] | Some c -> let node = X.Commit.Val.node c in Stats.visit_commit t (XKey.to_hash node); [ `Node node ] in let pred_contents _repo k = Stats.visit_contents t (XKey.to_hash k); Lwt.return [] in (* We want to discover all paths to a node, so we don't cache nodes during traversal. *) let* () = Repo.breadth_first_traversal ~cache_size:0 ~pred_node ~pred_commit ~pred_contents ~max:[ commit ] repo in Stats.pp_results ~dump_blob_paths_to t; Lwt.return_unit let run ~dump_blob_paths_to ~commit repo = Printexc.record_backtrace true; let key = `Commit (Commit.key commit) in traverse_inodes ~dump_blob_paths_to key repo end let stats = Stats.run let sync = X.Repo.sync let flush = X.Repo.flush module Traverse_pack_file = Traverse_pack_file.Make (struct module Hash = H module Index = Index module Inode = X.Node.CA module Dict = Dict module Contents = X.Contents.Pack_value module Commit = X.Commit.Pack_value end) let traverse_pack_file = Traverse_pack_file.run module Snapshot = struct include X.Node.CA.Snapshot type t = Inode of inode | Blob of Backend.Contents.Val.t [@@deriving irmin] module S = Snapshot.Make (struct module Hash = H module Inode = X.Node.CA module Contents_pack = X.Contents.CA end) include S module Export = struct let iter ?on_disk repo f ~root_key = [%log.debug "Iterate over a tree"]; let contents = X.Repo.contents_t repo in let nodes = X.Repo.node_t repo |> snd in let root = Conf.root repo.config in let log_size = Conf.index_log_size repo.config in let export = S.Export.v root log_size contents nodes in let f_contents x = f (Blob x) in let f_nodes x = f (Inode x) in match root_key with | `Contents _ -> Fmt.failwith "[root_key] cannot be of type contents" | `Node key -> let* total = Export.run ?on_disk export f_contents f_nodes (key, Pack_value.Kind.Inode_v2_root) in Export.close export; Lwt.return total end let export = Export.iter module Import = struct type process = Import.t let v ?on_disk repo = let contents = X.Repo.contents_t repo in let nodes = X.Repo.node_t repo |> snd in let log_size = Conf.index_log_size repo.config in Import.v ?on_disk log_size contents nodes let save_elt process elt = match elt with | Blob x -> Import.save_contents process x | Inode x -> Import.save_inodes process x let close process = Import.close process end end end end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>