package grace
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
A fancy diagnostics library that allows your compilers to exit with grace
Install
dune-project
Dependency
Authors
Maintainers
Sources
grace-0.3.0.tbz
sha256=6948979d6ffb5e596773baead81e9ceef36726d6956261bdd62abb2666a45bfc
sha512=db8b39cc9a77d919ab3123bb4047bb6c672c61db9fc6810951e267b2b113c4ac07266ef57188c6db0c02cb4d43d054204cd66ebc91648dbd1da1228022b0e67b
doc/src/grace.source_reader/grace_source_reader.ml.html
Source file grace_source_reader.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 319open Grace_std open Grace module Unix = UnixLabels let sys_errorf fmt = Format.kasprintf (fun s -> raise (Sys_error s)) fmt type bigstring = (char, Bigarray.int8_unsigned_elt, Bigarray.c_layout) Bigarray.Array1.t (** A file is abstracted as a (memory-mapped) bigstring *) type file = { descr : Unix.file_descr ; content : (bigstring[@sexp.opaque]) [@ignore] } let compare_file file1 file2 = compare file1.descr file2.descr let sexp_of_file file = let open Sexplib.Std in let descr_repr = Obj.repr file.descr in assert (Obj.is_int descr_repr); (* SAFETY: [Unix.file_descr] is represented as an [int]. *) [%sexp_of: int] (Obj.obj descr_repr) ;; let file_of_sexp _ = invalid_argf "cannot convert s-expression into file" module File_table : sig (** The abstract type of the file table *) type t val create : unit -> t (** [open_file tbl fname] opens the file with filename [fname] *) val open_file : t -> string -> file (** [close_all_files tbl] closes all files, clearing the file table. *) val close_all_files : t -> unit end = struct type t = (string, file) Hashtbl.t let create () : t = Hashtbl.create 4 let open_file t fname = Hashtbl.find_or_add t fname ~default:(fun () -> let fd = try Unix.openfile fname ~mode:[ O_RDONLY ] ~perm:0o777 with | Unix.Unix_error _ -> sys_errorf "could not open file %s" fname in let content = try let size = -1 in fd |> Unix.map_file ~pos:0L ~shared:false ~kind:Bigarray.char ~layout:Bigarray.c_layout ~dims:[| size |] |> Bigarray.array1_of_genarray with | _ -> Unix.close fd; sys_errorf "could not read the file %s" fname in { descr = fd; content }) ;; let close_all_files t = Hashtbl.iter (fun _ file -> Unix.close file.descr) t; Hashtbl.clear t ;; end module Source_descr = struct module T = struct type content = | File of file | String of string | Reader of Source.Reader.t [@@deriving sexp] type t = { content : content ; source : Source.t } [@@deriving sexp] let compare_content c1 c2 = match c1, c2 with | File f1, File f2 -> compare_file f1 f2 | String s1, String s2 -> String.compare s1 s2 | Reader rd1, Reader rd2 -> Source.Reader.compare rd1 rd2 | _, _ -> Stdlib.compare c1 c2 ;; let compare t1 t2 = if phys_equal t1 t2 then 0 else ( match compare_content t1.content t2.content with | 0 -> Source.compare t1.source t2.source | n -> n) ;; end include T include Comparable.Make (T) let[@inline] source t = t.source end let length (sd : Source_descr.t) = match sd.content with | File file -> Bigarray.Array1.size_in_bytes file.content | String string -> String.length string | Reader reader -> reader.length ;; let unsafe_get (sd : Source_descr.t) i = match sd.content with | File file -> Bigarray.Array1.unsafe_get file.content i | String str -> String.unsafe_get str i | Reader reader -> reader.unsafe_get i ;; let slice sd range = if not (Source.equal (Source_descr.source sd) (Range.source range)) then invalid_argf "mismatching source"; let start, stop = Range.split range in let buf = Buffer.create (Byte_index.diff stop start) in for i = (start :> int) to (stop :> int) - 1 do Buffer.add_char buf (unsafe_get sd i) done; Buffer.contents buf ;; let slicei sd (start : Byte_index.t) (stop : Byte_index.t) = let buf = Buffer.create (Byte_index.diff stop start) in for i = (start :> int) to (stop :> int) - 1 do Buffer.add_char buf (unsafe_get sd i) done; Buffer.contents buf ;; module Line_starts = struct (** The type of line starts. For computation of line numbers from ranges, we require a function mapping {{!type:Line_index.t} line indices} to {{!type:Byte_index.t} byte indicies} and the maximum line index. A valid [line_starts] for a [source] satisfies: + ... *) type t = { unsafe_get : int -> Byte_index.t ; length : int } type fn = Source_descr.t -> t let default_fn sd = let line_starts_array = (* Prefix with zero since no preceeding newline *) let line_starts = ref [ Byte_index.initial ] in for idx = 0 to length sd - 1 do match unsafe_get sd idx with | '\n' -> line_starts := Byte_index.of_int (idx + 1) :: !line_starts | _ -> () done; Array.of_list @@ List.rev !line_starts in { unsafe_get = (fun idx -> Array.unsafe_get line_starts_array (idx :> int)) ; length = Array.length line_starts_array } ;; let[@inline] length t = t.length let[@inline] unsafe_get t idx = t.unsafe_get idx let find t (idx : Byte_index.t) = (* Safety: t.line_starts is known to be non-empty, hence `Last_less_than_or_equal_to will always return an index *) Binary_search.find_last_satisfying t ~length ~get:unsafe_get ~pred:(fun idx' -> Byte_index.compare idx' idx <= 0) |> Option.get ;; end type error = [ `Already_initialized | `Not_initialized ] exception Error of error type t = { line_starts_table : (Source_descr.t, Line_starts.t) Hashtbl.t ; file_table : File_table.t ; line_starts_fn : Line_starts.fn } let state : t option ref = ref None let get () = match !state with | Some t -> t | None -> raise @@ Error `Not_initialized ;; let init ?(line_starts_fn = Line_starts.default_fn) () = if Option.is_some !state then raise @@ Error `Already_initialized; state := Some { line_starts_fn ; file_table = File_table.create () ; line_starts_table = Hashtbl.create 300 } ;; let clear () = match !state with | None -> () | Some { file_table; _ } -> File_table.close_all_files file_table; state := None ;; let with_reader ?line_starts_fn f = Fun.protect (fun () -> init ?line_starts_fn (); f ()) ~finally:clear ;; let line_starts sd = let t = get () in Hashtbl.find_or_add t.line_starts_table sd ~default:(fun () -> t.line_starts_fn sd) ;; let open_source (source : Source.t) : Source_descr.t = let content = match source with | `File fname -> let file = File_table.open_file (get ()).file_table fname in Source_descr.File file | `String { content; _ } -> String content | `Reader reader -> Reader reader in { source; content } ;; module Line = struct type t = { idx : Line_index.t ; range : Range.t } [@@deriving sexp] let[@inline] start t = Range.start t.range let[@inline] stop t = Range.stop t.range let[@inline] split t = Range.split t.range let last sd = let idx = Line_index.of_int @@ Line_starts.length (line_starts sd) in let length = Byte_index.of_int @@ length sd in { idx; range = Range.create ~source:sd.source length length } ;; let offset sd (idx : Line_index.t) : Byte_index.t = let line_starts = line_starts sd in let last_line_index = Line_index.of_int @@ Line_starts.length line_starts in if Line_index.(initial <= idx && idx < last_line_index) then Line_starts.unsafe_get line_starts (idx :> int) else if Line_index.(idx = last_line_index) then Byte_index.of_int @@ length sd else invalid_argf "%a > %a: line index exceeds the last line index" Line_index.pp idx Line_index.pp last_line_index ;; let of_line_index sd (idx : Line_index.t) : t = let start = offset sd idx and stop = offset sd Line_index.(add idx 1) in { idx; range = Range.create ~source:sd.source start stop } ;; let of_byte_index sd (idx : Byte_index.t) : t = let line_starts = line_starts sd in Line_starts.find line_starts idx |> Line_index.of_int |> of_line_index sd ;; let[@inline] slice t ~sd = slice sd t.range end let lines sd : Line.t Iter.t = fun f -> let line_starts = line_starts sd in let stop = Line_starts.length line_starts in for line_idx = 0 to stop - 1 do f (Line.of_line_index sd @@ Line_index.of_int line_idx) done ;; let lines_in_range sd range : Line.t Iter.t = fun f -> if not (Source.equal (Source_descr.source sd) (Range.source range)) then invalid_argf "mismatching sources"; let line_starts = line_starts sd in let start, stop = Range.split range in for line_idx = Line_starts.find line_starts start to Line_starts.find line_starts stop do f (Line.of_line_index sd @@ Line_index.of_int line_idx) done ;;
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>