LMDB Disk Cache: clarify the purpose of the queue [reusable_keys]

glyh · glyh · commit cacd9141d839 · 2025-07-12T12:16:02.000+08:00
diff --git a/src/lib/disk_cache/lmdb/disk_cache.ml b/src/lib/disk_cache/lmdb/disk_cache.ml
@@ -21,7 +21,8 @@ module Make (Data : Binable.S) = struct
     ; db : Rw.holder
     ; counter : int ref
     ; reusable_keys : int Queue.t
-          (** A list of ids that are no longer reachable from OCaml's side *)
+          (** A list of ids that are no longer reachable from OCaml runtime, but
+              haven't been cleared inside the LMDB disk cache *)
     }
 
   (** How big can the queue [reusable_keys] be before we do a cleanup *)

Original file line number	Diff line number	Diff line change
`@@ -21,7 +21,8 @@ module Make (Data : Binable.S) = struct`
`21`	`21`	`; db : Rw.holder`
`22`	`22`	`; counter : int ref`
`23`	`23`	`; reusable_keys : int Queue.t`
`24`		`- (** A list of ids that are no longer reachable from OCaml's side *)`
	`24`	`+ (** A list of ids that are no longer reachable from OCaml runtime, but`
	`25`	`+ haven't been cleared inside the LMDB disk cache *)`
`25`	`26`	`}`
`26`	`27`
`27`	`28`	`(** How big can the queue [reusable_keys] be before we do a cleanup *)`