package granary
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
Pure-OCaml SQL engine
Install
dune-project
Dependency
Authors
Maintainers
Sources
0.0.3.tar.gz
sha256=8b18780ea373be48301d9f333925860a2f9110fc0ac28684295118d72b65a67e
sha512=25ca3c9c5e2b528704a542502e0f37dc33ba003f65622d969b8c2b800778585f8ef0cf89b36e6679832e3993e8303aecddfc662742baf7044d6afe4a796b8f11
doc/src/granary.replication/replication.ml.html
Source file replication.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(** WAL-based physical replication to object store (Litestream-style). Implementation of the apply primitive and cold restore. *) open Lwt.Syntax module Wal = Granary_storage.Wal module Pager = Granary_storage.Pager type replicated_frame = { epoch : int64 ; frame_idx : int ; page_id : int64 ; is_commit : bool ; page : Cstruct.t ; checksum : int64 ; source_salt : int64 ; source_seed : int64 } type frame_sink = replicated_frame list -> unit Lwt.t (* ------------------------------------------------------------------ *) (* Helpers *) (* ------------------------------------------------------------------ *) (** Group frames into commit batches, splitting at each [is_commit] boundary. Trailing non-commit frames are silently dropped. *) let group_into_batches frames = let rec go acc batch = function | [] -> (* Only include batches that end with a commit frame. Trailing non-commit frames are silently ignored. *) if batch = [] then List.rev acc else ( let last_is_commit = (List.hd (List.rev batch)).is_commit in if last_is_commit then List.rev (List.rev batch :: acc) else List.rev acc) | f :: rest -> if f.is_commit then go (List.rev (f :: batch) :: acc) [] rest else go acc (f :: batch) rest in go [] [] frames ;; let verify_checksum f = let flags = if f.is_commit then 1L else 0L in let computed = Wal.frame_checksum ~salt:f.source_salt ~seed:f.source_seed ~page_id:f.page_id ~flags ~page:f.page in Int64.equal computed f.checksum ;; (* ------------------------------------------------------------------ *) (* Apply primitive *) (* ------------------------------------------------------------------ *) let apply_frames ~wal ~pager frames = (* 1. Verify transport checksums before any side effects *) let all_valid = List.for_all verify_checksum frames in if not all_valid then Lwt.return_error (`Apply_error "transport checksum verification failed") else ( (* 2. Grow the device if any page_id exceeds current capacity *) let max_pid = List.fold_left (fun acc f -> Int64.max acc f.page_id) 0L frames in let current_pages = Pager.n_pages pager in (* Page ids are 0-indexed and n_pages is a count: to hold page [max_pid] we need at least [max_pid + 1] pages. *) let needed = Int64.succ max_pid in if needed > current_pages then Pager.set_n_pages pager needed; (* 3. Group frames into commit batches *) let batches = group_into_batches frames in (* 4. Apply each batch via append_commit *) let rec apply = function | [] -> Lwt.return_ok () | batch :: rest -> let entries = List.map (fun f -> f.page_id, f.page) batch in let* r = Wal.append_commit wal entries in (match r with | Error e -> Lwt.return_error (`Apply_error (Format.asprintf "append_commit: %a" Wal.pp_error e)) | Ok () -> apply rest) in apply batches) ;; (* ------------------------------------------------------------------ *) (* Cold restore *) (* ------------------------------------------------------------------ *) let cold_restore ~read_at ~write_at ~sync ~wal_size_bytes ~pager ~base_snapshot_path:_ ~wal_frames () = (* Open a WAL over the provided callbacks *) let* wal_r = Wal.open_ ~read_at ~write_at ~sync ~size_bytes:wal_size_bytes () in match wal_r with | Error e -> Lwt.return_error (`Restore_error (Format.asprintf "Wal.open_: %a" Wal.pp_error e)) | Ok wal -> (* Accumulate frames into commit batches, apply each batch *) let rec loop acc = let* next = Lwt_stream.get wal_frames in match next with | None -> (* End of stream: apply any trailing batch that ends with commit *) if acc <> [] && (List.hd (List.rev acc)).is_commit then let* r = apply_frames ~wal ~pager acc in match r with | Ok () -> Lwt.return_ok () | Error (`Apply_error msg) -> Lwt.return_error (`Restore_error msg) else Lwt.return_ok () | Some frames -> (* Flush at the first commit boundary; carry remainder forward. Note: apply_frames internally calls group_into_batches which re-splits multi-commit batches, so we don't need to split further here — we just hand the batch off at each commit. *) let rec take_until_commit buf = function | [] -> List.rev buf, [] | f :: rest -> if f.is_commit then List.rev (f :: buf), rest else take_until_commit (f :: buf) rest in let committed, remaining = take_until_commit [] frames in if committed = [] then loop (acc @ frames) else ( let batch = acc @ committed in let* r = apply_frames ~wal ~pager batch in match r with | Error (`Apply_error msg) -> Lwt.return_error (`Restore_error msg) | Ok () -> loop remaining) in loop [] ;; (* ------------------------------------------------------------------ *) (* Epoch-aware apply for standby (#172) *) (* ------------------------------------------------------------------ *) (** A no-op reader gate: returns immediately without waiting. Use for paths that serve no concurrent readers (e.g. cold restore, direct test invocations). *) let no_reader_gate ~target:_ = Lwt.return_unit (** Migrate the latest version of every page in the WAL index to the main DB, sync, then reset the WAL (bumping its epoch). Mirrors the engine's [Store.checkpoint_unlocked] spine: [iter -> flush -> sync -> gate -> reset]. Unlike [checkpoint_unlocked] the reader gate is called {e after} the main flush and sync rather than before it. This is safe because during the flush window the WAL index stays intact --- a concurrent RO snapshot resolves pages from the WAL, not from the freshly-flushed main page. Only [Wal.reset] (which {e is} gated) switches resolution to main. The ordering divergence from [checkpoint_unlocked] is benign provided the gate always fires before [Wal.reset]. The following engine concerns from [checkpoint_unlocked] are intentionally omitted for a leaf standby (revisit for cascading replication #208): - No {!Store.close} abort (#338): [~reader_gate]'s implementation ([Store.wait_for_readers_past]) already short-circuits on [st.closing], so the gate yields immediately during teardown and reset proceeds. If the gate is a no-op (e.g. [no_reader_gate]) the caller must ensure no concurrent reader holds stale references before calling this function. - No [ckpt_io_in_flight] tracking: a leaf standby has no concurrent close that needs to drain in-flight checkpoint I/O. - No sink-ship drain (#337): a leaf standby has no replication sink shipping frames lazily. - No floor re-pinning (#207/#265): a leaf standby is not a replication source, so no downstream floor to re-pin after reset. [~reader_gate] is called before [Wal.reset] with the current [Wal.committed_frames] as target, ensuring no in-flight RO snapshot references WAL frame indices about to be recycled (#263). *) let checkpoint_wal_to_main ~wal ~pager ~reader_gate = let pairs = ref [] in Wal.iter_index wal (fun pid idx -> pairs := (pid, idx) :: !pairs); let rec write_each = function | [] -> Lwt.return_ok () | (pid, idx) :: rest -> let* r = Wal.read_frame wal idx in (match r with | Error e -> Lwt.return_error (`Apply_error (Format.asprintf "checkpoint read: %a" Wal.pp_error e)) | Ok page -> let* wr = Pager.flush_one_to_main pager ~page_id:pid ~buf:page in (match wr with | Error e -> Lwt.return_error (`Apply_error (Format.asprintf "checkpoint write: %a" Pager.pp_error e)) | Ok () -> write_each rest)) in let* r = write_each !pairs in match r with | Error (`Apply_error _) as e -> Lwt.return e | Ok () -> let* sr = Pager.flush_sync_main pager in (match sr with | Error e -> Lwt.return_error (`Apply_error (Format.asprintf "checkpoint sync: %a" Pager.pp_error e)) | Ok () -> let* () = reader_gate ~target:(Wal.committed_frames wal) in Wal.reset wal; Lwt.return_ok ()) ;; (** Split a frame list into maximal runs of consecutive same-epoch frames, preserving order. [[]] -> [[]]; a single-epoch list -> one run. *) let split_by_epoch frames = let rec go acc cur cur_epoch = function | [] -> List.rev (List.rev cur :: acc) | f :: rest -> if Int64.equal f.epoch cur_epoch then go acc (f :: cur) cur_epoch rest else go (List.rev cur :: acc) [ f ] f.epoch rest in match frames with | [] -> [] | f :: rest -> go [] [ f ] f.epoch rest ;; let apply_frames_epoch_aware ~wal ~pager ~last_epoch ~last_idx ~reader_gate frames = (* A single batch may bundle frames from more than one master epoch if the master checkpointed mid-stream (#209). Split into maximal single-epoch runs and feed each through the epoch-transition logic in order: whenever a run's epoch differs from the epoch currently materialized in the local WAL, checkpoint (drain + reset) {e before} appending the run, so the intervening checkpoint is never skipped and recycled frame indices cannot collide. An empty batch yields no runs and leaves the position unchanged. *) let runs = split_by_epoch frames in let rec apply_runs current_epoch = function | [] -> Lwt.return_ok () | run :: rest -> let run_epoch = (List.hd run).epoch in let* r = if Int64.equal run_epoch current_epoch then apply_frames ~wal ~pager run else let* cr = checkpoint_wal_to_main ~wal ~pager ~reader_gate in match cr with | Error (`Apply_error _) as e -> Lwt.return e | Ok () -> apply_frames ~wal ~pager run in (match r with | Error _ as e -> Lwt.return e (* Advance [current_epoch] to the run we just materialized even if it committed nothing, so a later same-epoch run does not re-checkpoint a WAL that was already reset for it. *) | Ok () -> apply_runs run_epoch rest) in let* result = apply_runs last_epoch runs in match result with | Error _ as e -> Lwt.return e | Ok () -> (* Report the position of the {e last committed} frame actually applied — not just the tail frame. [apply_frames] drops trailing non-commit frames, so a batch ending in non-commit frames still durably applied the commit frames before them; keying on the tail would under-report the acked position. *) let last_committed = List.fold_left (fun acc f -> if f.is_commit then f.epoch, f.frame_idx else acc) (last_epoch, last_idx) frames in Lwt.return_ok last_committed ;; (* ------------------------------------------------------------------ *) (* Incremental restore (#265) *) (* ------------------------------------------------------------------ *) (** Convert a {!Granary_store.Store.backup_frame} to a {!replicated_frame} for use with {!apply_frames_epoch_aware}. *) let backup_frame_to_replicated (bf : Granary_store.Store.backup_frame) : replicated_frame = { epoch = bf.epoch ; frame_idx = bf.frame_idx ; page_id = bf.page_id ; is_commit = bf.is_commit ; page = bf.page ; checksum = bf.checksum ; source_salt = bf.source_salt ; source_seed = bf.source_seed } ;; let incremental_restore ~read_at ~write_at ~sync ~wal_size_bytes ~pager ~(incremental_sets : Granary_store.Store.backup_frame list list) () = let* wal_r = Wal.open_ ~read_at ~write_at ~sync ~size_bytes:wal_size_bytes () in match wal_r with | Error e -> Lwt.return_error (`Restore_error (Format.asprintf "Wal.open_: %a" Wal.pp_error e)) | Ok wal -> let initial_epoch = List.find_map (function | [] -> None | (f : Granary_store.Store.backup_frame) :: _ -> Some f.epoch) incremental_sets |> Option.value ~default:0L in let rec apply_sets (last_epoch, last_idx) = function | [] -> Lwt.return_ok (last_epoch, last_idx) | frames :: rest -> let replicated = List.map backup_frame_to_replicated frames in let* r = apply_frames_epoch_aware ~wal ~pager ~last_epoch ~last_idx ~reader_gate:no_reader_gate replicated in (match r with | Error (`Apply_error msg) -> Lwt.return_error (`Restore_error msg) | Ok (epoch, idx) -> apply_sets (epoch, idx) rest) in apply_sets (initial_epoch, -1) incremental_sets ;; [@@@ai_disclosure "ai-generated"] [@@@ai_model "claude-opus-4-7"] [@@@ai_provider "Anthropic"]
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>