package tiny_libs

  1. Overview
  2. Docs
From-scratch libraries for teaching: graphics, audio, compression, crypto, networking and more

Install

dune-project
 Dependency

Authors

Maintainers

Sources

0.3.6.tar.gz
md5=7c636383d146d30ac6f2fa234a6253c8
sha512=c79f3823c5f8f57e5038eb640d487c61168b84aa07c61999d6622ef9fd0c890e2b03b4c6a7cdbbe9352a49e25dda00ac7bb14693cee8e3d7beeed251351a2af0

doc/src/tiny_libs.graphics_jpeg/Jpeg.ml.html

Source file Jpeg.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
(* Claude Code
 *
 * Copyright (C) 2026 Yoann Padioleau
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Library General Public License
 * (LGPL) as published by the Free Software Foundation; either version
 * 2 of the License, or (at your option) any later version.
 *)

(* See Jpeg.mli *)

(*****************************************************************************)
(* Types *)
(*****************************************************************************)

type component = {
  id : int;
  (* sampling factors *)
  h : int;
  v : int;
  (* its quantization table *)
  tq : int;
  (* its Huffman tables, set by each scan *)
  mutable td : int;
  mutable ta : int;
  (* the previous block's DC coefficient *)
  mutable pred : int;
  (* the samples, whole blocks: pw x ph, pw = the MCUs across * h * 8 *)
  plane : Bytes.t;
  pw : int;
  ph : int;
  (* the samples that are in the picture, the rest is padding *)
  cw : int;
  ch : int;
}

type frame = {
  width : int;
  height : int;
  comps : component array;
  hmax : int;
  vmax : int;
  mcux : int;
  mcuy : int;
}

(*****************************************************************************)
(* The zigzag, and the values of bits *)
(*****************************************************************************)

(* along the anti-diagonals, alternately up and down *)
let zigzag : int array =
  let z = Array.make 64 0 and k = ref 0 in
  for s = 0 to 14 do
    let cells = List.filter (fun (_, c) -> c >= 0 && c < 8) (List.init 8 (fun r -> (r, s - r))) in
    List.iter
      (fun (r, c) ->
        z.(!k) <- (r * 8) + c;
        incr k)
      (if s mod 2 = 0 then List.rev cells else cells)
  done;
  z

let extend (v : int) (s : int) : int = if s = 0 then 0 else if v < 1 lsl (s - 1) then v - (1 lsl s) + 1 else v

(*****************************************************************************)
(* Reading a scan's bits *)
(*****************************************************************************)

type reader = {
  s : string;
  mutable pos : int;
  mutable buf : int;
  mutable cnt : int;
  (* a marker reached: no more data bits, only zeros *)
  mutable marker : bool;
}

(* the next byte of data: FF 00 is FF; FF and anything else is a
 * marker *)
let next_byte (r : reader) : int =
  if r.marker || r.pos >= String.length r.s then (r.marker <- true; 0)
  else
    let b = Char.code r.s.[r.pos] in
    if b <> 0xFF then (r.pos <- r.pos + 1; b)
    else if r.pos + 1 < String.length r.s && r.s.[r.pos + 1] = '\000' then (r.pos <- r.pos + 2; 0xFF)
    else (r.marker <- true; 0)

(* bits come most significant first *)
let bit (r : reader) : int =
  if r.cnt = 0 then begin
    r.buf <- next_byte r;
    r.cnt <- 8
  end;
  r.cnt <- r.cnt - 1;
  (r.buf lsr r.cnt) land 1

let receive (r : reader) (n : int) : int =
  let v = ref 0 in
  for _ = 1 to n do
    v := (!v lsl 1) lor bit r
  done;
  !v

(* at a restart marker: drop the bits left, skip the marker *)
let restart (r : reader) : unit =
  r.buf <- 0;
  r.cnt <- 0;
  r.marker <- false;
  let s = r.s in
  let rec find p =
    if p + 1 >= String.length s then failwith "JPEG: a restart marker is missing"
    else if s.[p] = '\xFF' && Char.code s.[p + 1] >= 0xD0 && Char.code s.[p + 1] <= 0xD7 then p + 2
    else find (p + 1)
  in
  r.pos <- find r.pos

(*****************************************************************************)
(* A block *)
(*****************************************************************************)

let decode_block (r : reader) ~(dc : Huffman.t) ~(ac : Huffman.t) ~(q : int array) (comp : component) :
    float array =
  let coefs = Array.make 64 0. in
  let t = Huffman.decode (fun () -> bit r) dc in
  if t > 11 then failwith "JPEG: a DC difference of more than 11 bits";
  comp.pred <- comp.pred + extend (receive r t) t;
  coefs.(0) <- float (comp.pred * q.(0));
  let rec ac_loop k =
    if k < 64 then begin
      let rs = Huffman.decode (fun () -> bit r) ac in
      let run = rs lsr 4 and size = rs land 15 in
      if size = 0 then (if run = 15 then ac_loop (k + 16) (* else: the end of the block *))
      else begin
        let k = k + run in
        if k > 63 then failwith "JPEG: a coefficient past the end of the block";
        coefs.(zigzag.(k)) <- float (extend (receive r size) size * q.(k));
        ac_loop (k + 1)
      end
    end
  in
  ac_loop 1;
  coefs

(* the block's samples, level-shifted back to 0..255, at block (bx, by)
 * of the component's plane *)
(* claude: [v] rounded and kept in 0..255, as ints; where it was
 *
 *   max 0 (min 255 (int_of_float (Float.round v)))
 *
 * per sample: Stdlib's min and max polymorphic (the runtime's generic
 * compare), Float.round a call into C. The same integers: for v >= 0,
 * int_of_float (v +. 0.5) rounds half away from zero, and below 0 both
 * give 0. Inlined: a float crossing a call that isn't is boxed
 * (notes_opti_ocaml.md) *)
let[@inline] clamp (v : float) : int =
  let i = int_of_float (v +. 0.5) in
  if i < 0 then 0 else if i > 255 then 255 else i

let put_block (comp : component) ~(bx : int) ~(by : int) (samples : float array) : unit =
  for y = 0 to 7 do
    for x = 0 to 7 do
      Bytes.set comp.plane ((((by * 8) + y) * comp.pw) + (bx * 8) + x) (Char.chr (clamp (samples.((y * 8) + x) +. 128.)))
    done
  done

(*****************************************************************************)
(* Upsampling and color *)
(*****************************************************************************)

(* the component's samples at full size, width x height, as floats:
 * each axis scaled by hmax / h (or vmax / v) *)
let upsample (upsampling : [ `Box | `Triangle ]) (f : frame) (comp : component) : float array =
  if f.hmax mod comp.h <> 0 || f.vmax mod comp.v <> 0 then failwith "JPEG: sampling factors that don't divide";
  let fx = f.hmax / comp.h and fy = f.vmax / comp.v in
  let sample x y = float (Char.code (Bytes.get comp.plane ((y * comp.pw) + x))) in
  (* where output [o] takes its samples along an axis scaled by
   * [factor], [n] samples in the picture: a list of (index, weight) *)
  let taps factor n o =
    if factor = 2 && upsampling = `Triangle then
      let j = o / 2 in
      let other = if o mod 2 = 0 then max 0 (j - 1) else min (n - 1) (j + 1) in
      [ (min (n - 1) j, 0.75); (other, 0.25) ]
    else [ (min (n - 1) (o / factor), 1.) ]
  in
  (* vertically, into a (pw x height) array, then horizontally *)
  let tall = Array.make (comp.pw * f.height) 0. in
  for y = 0 to f.height - 1 do
    let ts = taps fy comp.ch y in
    for x = 0 to comp.pw - 1 do
      tall.((y * comp.pw) + x) <- List.fold_left (fun acc (j, w) -> acc +. (w *. sample x j)) 0. ts
    done
  done;
  let full = Array.make (f.width * f.height) 0. in
  for x = 0 to f.width - 1 do
    let ts = taps fx comp.cw x in
    for y = 0 to f.height - 1 do
      full.((y * f.width) + x) <- List.fold_left (fun acc (i, w) -> acc +. (w *. tall.((y * comp.pw) + i))) 0. ts
    done
  done;
  full

let to_rgba (upsampling : [ `Box | `Triangle ]) (f : frame) : Rgba_image.t =
  let img = Rgba_image.create ~width:f.width ~height:f.height in
  let planes = Array.map (upsample upsampling f) f.comps in
  for i = 0 to (f.width * f.height) - 1 do
    let r, g, b =
      if Array.length planes = 1 then
        let y = planes.(0).(i) in
        (y, y, y)
      else
        let y = planes.(0).(i) and cb = planes.(1).(i) -. 128. and cr = planes.(2).(i) -. 128. in
        (y +. (1.402 *. cr), y -. (0.344136 *. cb) -. (0.714136 *. cr), y +. (1.772 *. cb))
    in
    img.rgba.{i * 4} <- clamp r;
    img.rgba.{(i * 4) + 1} <- clamp g;
    img.rgba.{(i * 4) + 2} <- clamp b;
    img.rgba.{(i * 4) + 3} <- 255
  done;
  img

(*****************************************************************************)
(* Segments *)
(*****************************************************************************)

let u16 (s : string) (i : int) : int = (Char.code s.[i] lsl 8) lor Char.code s.[i + 1]

let parse_frame (seg : string) : frame =
  let byte i = Char.code seg.[i] in
  if byte 0 <> 8 then failwith (Printf.sprintf "JPEG: %d-bit samples, not supported" (byte 0));
  let height = u16 seg 1 and width = u16 seg 3 and n = byte 5 in
  if width = 0 || height = 0 then failwith "JPEG: empty picture (or a height given later, not supported)";
  if n = 4 then failwith "JPEG: CMYK (4 components), not supported";
  if n <> 1 && n <> 3 then failwith (Printf.sprintf "JPEG: %d components" n);
  let specs = Array.init n (fun k -> (byte (6 + (3 * k)), byte (7 + (3 * k)) lsr 4, byte (7 + (3 * k)) land 15, byte (8 + (3 * k)))) in
  let hmax = Array.fold_left (fun m (_, h, _, _) -> max m h) 1 specs in
  let vmax = Array.fold_left (fun m (_, _, v, _) -> max m v) 1 specs in
  let mcux = (width + (8 * hmax) - 1) / (8 * hmax) and mcuy = (height + (8 * vmax) - 1) / (8 * vmax) in
  let comps =
    Array.map
      (fun (id, h, v, tq) ->
        if h < 1 || h > 4 || v < 1 || v > 4 || tq > 3 then failwith "JPEG: bad sampling factors or table";
        let pw = mcux * h * 8 and ph = mcuy * v * 8 in
        { id; h; v; tq; td = 0; ta = 0; pred = 0; plane = Bytes.make (pw * ph) '\000'; pw; ph;
          cw = ((width * h) + hmax - 1) / hmax; ch = ((height * v) + vmax - 1) / vmax })
      specs
  in
  { width; height; comps; hmax; vmax; mcux; mcuy }

(* the scan starting at [pos], just after its header: returns where its
 * data ends, the next marker *)
let decode_scan (s : string) (pos : int) (f : frame) (scomps : component list) ~dc ~ac ~qt ~restart_interval ~idct ~keep
    : int =
  let r = { s; pos; buf = 0; cnt = 0; marker = false } in
  let table (tables : Huffman.t option array) i =
    match tables.(i) with Some t -> t | None -> failwith "JPEG: a Huffman table used but not defined"
  in
  let block comp ~bx ~by =
    let q = match qt.(comp.tq) with Some q -> q | None -> failwith "JPEG: a quantization table used but not defined" in
    let coefs = decode_block r ~dc:(table dc comp.td) ~ac:(table ac comp.ta) ~q comp in
    (* only the first [keep], in zigzag order: the lowest frequencies *)
    for k = keep to 63 do
      coefs.(zigzag.(k)) <- 0.
    done;
    put_block comp ~bx ~by (idct coefs)
  in
  List.iter (fun c -> c.pred <- 0) scomps;
  (* the MCUs of the scan: with one component, a block each, over its
   * own size; else the frame's MCUs *)
  let units_across, units_down, unit =
    match scomps with
    | [ c ] -> ((c.cw + 7) / 8, (c.ch + 7) / 8, fun ux uy -> block c ~bx:ux ~by:uy)
    | _ ->
        ( f.mcux, f.mcuy,
          fun ux uy ->
            List.iter
              (fun c ->
                for by = 0 to c.v - 1 do
                  for bx = 0 to c.h - 1 do
                    block c ~bx:((ux * c.h) + bx) ~by:((uy * c.v) + by)
                  done
                done)
              scomps )
  in
  let total = units_across * units_down in
  for n = 0 to total - 1 do
    if restart_interval > 0 && n > 0 && n mod restart_interval = 0 then begin
      restart r;
      List.iter (fun c -> c.pred <- 0) scomps
    end;
    unit (n mod units_across) (n / units_across)
  done;
  (* the next marker: FF and neither 00 nor a restart *)
  let rec next p =
    if p + 1 >= String.length s then String.length s
    else if s.[p] = '\xFF' && s.[p + 1] <> '\000' && s.[p + 1] <> '\xFF'
            && not (Char.code s.[p + 1] >= 0xD0 && Char.code s.[p + 1] <= 0xD7)
    then p
    else next (p + 1)
  in
  next r.pos

(*****************************************************************************)
(* Entry point *)
(*****************************************************************************)

let decode ?(idct = Dct.idct_aan) ?(upsampling = `Triangle) ?(keep = 64) (s : string) : Rgba_image.t =
  let len = String.length s in
  if len < 4 || s.[0] <> '\xFF' || s.[1] <> '\xD8' then failwith "JPEG: not a JPEG (no SOI)";
  let qt = Array.make 4 None and dc = Array.make 4 None and ac = Array.make 4 None in
  let frame = ref None and restart_interval = ref 0 and scans = ref 0 in
  let rec loop pos =
    if pos + 1 >= len then () (* no EOI: accepted, as viewers do *)
    else if s.[pos] <> '\xFF' then failwith (Printf.sprintf "JPEG: a marker expected at %d" pos)
    else
      let m = Char.code s.[pos + 1] in
      if m = 0xFF then loop (pos + 1) (* fill bytes *)
      else if m = 0xD9 then () (* EOI *)
      else if m = 0xD8 || m = 0x01 || (m >= 0xD0 && m <= 0xD7) then loop (pos + 2)
      else begin
        if pos + 4 > len then failwith "JPEG: the file ends early";
        let seglen = u16 s (pos + 2) in
        if pos + 2 + seglen > len then failwith "JPEG: the file ends inside a segment";
        let seg = String.sub s (pos + 4) (seglen - 2) in
        let byte i = Char.code seg.[i] in
        let after = pos + 2 + seglen in
        match m with
        | 0xDB ->
            let rec tables i =
              if i < String.length seg then begin
                let precision = byte i lsr 4 and id = byte i land 3 in
                let size = if precision = 0 then 1 else 2 in
                qt.(id) <-
                  Some (Array.init 64 (fun k -> if size = 1 then byte (i + 1 + k) else u16 seg (i + 1 + (2 * k))));
                tables (i + 1 + (64 * size))
              end
            in
            tables 0;
            loop after
        | 0xC4 ->
            let rec tables i =
              if i < String.length seg then begin
                let cls = byte i lsr 4 and id = byte i land 3 in
                let counts = Array.init 16 (fun k -> byte (i + 1 + k)) in
                let n = Array.fold_left ( + ) 0 counts in
                let symbols = Array.init n (fun k -> byte (i + 17 + k)) in
                (if cls = 0 then dc else ac).(id) <- Some (Huffman.of_counts counts symbols);
                tables (i + 17 + n)
              end
            in
            tables 0;
            loop after
        | 0xC0 | 0xC1 ->
            frame := Some (parse_frame seg);
            loop after
        | 0xC2 | 0xC6 | 0xCA | 0xCE -> failwith "JPEG: progressive, not supported"
        | 0xC3 | 0xC7 | 0xCB | 0xCF -> failwith "JPEG: lossless, not supported"
        | 0xC5 | 0xC9 | 0xCD -> failwith "JPEG: hierarchical or arithmetic-coded, not supported"
        | 0xDD ->
            restart_interval := u16 seg 0;
            loop after
        | 0xDA ->
            let f = match !frame with Some f -> f | None -> failwith "JPEG: a scan before the frame (SOF)" in
            let n = byte 0 in
            let scomps =
              List.init n (fun k ->
                  let id = byte (1 + (2 * k)) and tables = byte (2 + (2 * k)) in
                  match List.find_opt (fun c -> c.id = id) (Array.to_list f.comps) with
                  | Some c ->
                      c.td <- tables lsr 4;
                      c.ta <- tables land 15;
                      c
                  | None -> failwith "JPEG: a scan of an unknown component")
            in
            incr scans;
            loop (decode_scan s after f scomps ~dc ~ac ~qt ~restart_interval:!restart_interval ~idct ~keep)
        | _ -> loop after (* APPn, COM, ...: skipped *)
      end
  in
  loop 2;
  match !frame with
  | None -> failwith "JPEG: no frame (SOF)"
  | Some _ when !scans = 0 -> failwith "JPEG: no scan, no pixels"
  | Some f -> to_rgba upsampling f