-
Notifications
You must be signed in to change notification settings - Fork 29
/
pdfio.ml
699 lines (612 loc) · 19.6 KB
/
pdfio.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
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
(* General Input and Output *)
open Pdfutil
(* On 64 bit platforms, bigarray isn't used since max_string is big. If
* this is set, we use bigarray always, for testing... *)
let test_bigarray = false
(* We used to have a type called "bytes" before OCaml did. In order
not to break client code using e.g. Pdfio.bytes, we keep the name
but expose an alias caml_bytes for the built-in type. *)
type caml_bytes = bytes
(* External type for big streams of bytes passed to C*)
type rawbytes =
(int, Bigarray.int8_unsigned_elt, Bigarray.c_layout) Bigarray.Array1.t
(* But for speed, we use strings of length < Sys.max_string_length *)
type bytes =
| Long of rawbytes
| Short of caml_bytes
let bigarray_unsafe_get =
Bigarray.Array1.unsafe_get
let bigarray_unsafe_set =
Bigarray.Array1.unsafe_set
(* Extract the raw bytes, without necessarily copying *)
let raw_of_bytes = function
| Short b ->
let l = Bigarray.Array1.create Bigarray.int8_unsigned Bigarray.c_layout (Bytes.length b) in
for x = 0 to Bytes.length b - 1 do
bigarray_unsafe_set l x (int_of_char (Bytes.unsafe_get b x))
done;
l
| Long b -> b
(* Build a bytes from raw data, without copying *)
let bytes_of_raw b = Long b
(* Make a stream of a given size. *)
let mkbytes l =
if l <= (if test_bigarray then max_int else Sys.max_string_length)
then Short (Bytes.create l)
else Long (Bigarray.Array1.create Bigarray.int8_unsigned Bigarray.c_layout l)
(* Find the size of a stream. *)
let bytes_size = function
| Short s -> Bytes.length s
| Long b -> Bigarray.Array1.dim b
let bset s n v =
match s with
| Short s -> Bytes.set s n (Char.unsafe_chr v)
| Long s -> Bigarray.Array1.set s n v
let bset_unsafe s n v =
match s with
| Short s -> Bytes.unsafe_set s n (Char.unsafe_chr v)
| Long s -> bigarray_unsafe_set s n v
let bget s n =
match s with
| Short s -> int_of_char (Bytes.get s n)
| Long s -> Bigarray.Array1.get s n
let bget_unsafe s n =
match s with
| Short s -> int_of_char (Bytes.unsafe_get s n)
| Long s -> bigarray_unsafe_get s n
(* For lexing / parsing byte streams, keep the position. Starts at zero. *)
type stream =
{mutable pos : int;
data : bytes ref}
(* Fill a stream with a value. *)
let fillbytes v s =
for x = 0 to bytes_size s - 1 do bset_unsafe s x v done
let print_bytes s =
if bytes_size s > 0 then
for x = 0 to bytes_size s - 1 do
Printf.printf "%i " (bget s x)
done
(* Make a bytes from a string, with no terminator. *)
let bytes_of_string s =
let l = String.length s in
let stream = mkbytes l in
if l > 0 then
for k = 0 to l - 1 do
bset_unsafe stream k (int_of_char (String.unsafe_get s k))
done;
stream
let bytes_of_caml_bytes s =
let l = Bytes.length s in
let stream = mkbytes l in
if l > 0 then
for k = 0 to l - 1 do
bset_unsafe stream k (int_of_char (Bytes.unsafe_get s k))
done;
stream
(* Make a byte stream from an integer list. *)
let bytes_of_list l =
let length = length l in
if length = 0 then mkbytes 0 else
let s = mkbytes length in let l = ref l in
for pos = 0 to length - 1 do
bset_unsafe s pos (hd !l);
l := tl !l
done;
s
(* Convert a character list to a stream. *)
let bytes_of_charlist cs =
let length = length cs in
if length = 0 then mkbytes 0 else
let s = mkbytes length in let cs = ref cs in
for pos = 0 to length - 1 do
bset_unsafe s pos (int_of_char (hd !cs));
cs := tl !cs
done;
s
let bytes_of_arraylist l =
let totalsize = sum (map Array.length l) in
let output = mkbytes totalsize
in let pos = ref 0 in
iter
(fun a ->
for x = 0 to Array.length a - 1 do
bset_unsafe output !pos (Array.unsafe_get a x); incr pos
done)
l;
output
let string_of_bytes s =
let l = bytes_size s in
let buf = Buffer.create l in
for x = 0 to l - 1 do
Buffer.add_char buf (Char.unsafe_chr (bget_unsafe s x))
done;
Buffer.contents buf
let bytes_of_int_array a =
let s = mkbytes (Array.length a) in
for i = 0 to bytes_size s - 1 do
bset_unsafe s i (Array.unsafe_get a i)
done;
s
let int_array_of_bytes s =
let a = Array.make (bytes_size s) 0 in
for i = 0 to Array.length a - 1 do
Array.unsafe_set a i (bget_unsafe s i)
done;
a
(* Copy a stream. *)
let copybytes s =
let l = bytes_size s in
let s' = mkbytes l in
if l > 0 then
for k = 0 to l - 1 do
bset_unsafe s' k (bget_unsafe s k)
done;
s'
let int_array_of_string s =
Array.init (String.length s) (fun i -> int_of_char (String.unsafe_get s i))
let string_of_int_arrays arrays =
let len = sum (map Array.length arrays) in
let buf = Buffer.create len in
iter (Array.iter (fun v -> Buffer.add_char buf (Char.unsafe_chr v))) arrays;
Buffer.contents buf
let string_of_int_array a =
string_of_int_arrays [a]
let bytes_selfmap f s =
let l = bytes_size s in
for k = 0 to l - 1 do
bset_unsafe s k (f (bget_unsafe s k))
done
let charlist_of_bytes s =
let l = ref [] in
for x = bytes_size s - 1 downto 0 do
l =| Char.unsafe_chr (bget_unsafe s x)
done;
!l
(* Position in a file *)
type pos = int
(* End_of_file without exceptions or Some / None *)
let no_more = -1
(* A general type for input functions. This allows paramaterization over
channels, strings, bigarrays etc. *)
type input =
{pos_in : unit -> pos;
seek_in : pos -> unit;
input_char : unit -> char option;
input_byte : unit -> int;
in_channel_length : pos;
set_offset : pos -> unit;
caml_channel : in_channel option;
source : string}
(* A general type for output functions, allowing parameterisation as above. *)
type output =
{pos_out : unit -> pos;
seek_out : pos -> unit;
output_char : char -> unit;
output_byte : int -> unit;
output_string : string -> unit;
out_caml_channel : out_channel option;
out_channel_length : unit -> pos}
(* Create input functions from a channel. *)
let input_of_channel ?(source = "channel") ch =
let offset = ref 0 in
{pos_in =
(fun () -> pos_in ch - !offset);
seek_in =
(fun x -> seek_in ch (x + !offset));
input_char =
(fun () -> try Some (input_char ch) with End_of_file -> None);
input_byte =
(fun () -> try input_byte ch with End_of_file -> no_more);
in_channel_length =
in_channel_length ch;
set_offset =
(fun o -> if !offset = 0 then offset := o);
caml_channel = Some ch;
source = source}
(* Create input functions from a. *)
let input_of_stream ?(source = "bytes") s =
let offset = ref 0 in
let ssize = bytes_size !(s.data) in
let input_int () =
let r =
if s.pos > ssize - 1 then no_more else bget_unsafe !(s.data) s.pos
in
s.pos <- s.pos + 1;
r
in
{pos_in =
(fun () -> s.pos - !offset);
seek_in =
(fun p ->
s.pos <- p + !offset);
input_char =
(fun () ->
match input_int () with x when x = no_more -> None | s -> Some (Char.unsafe_chr s));
input_byte =
input_int;
in_channel_length =
ssize;
set_offset =
(fun o -> if !offset = 0 then offset := o);
caml_channel = None;
source = source}
(* Create input functions from a Pdfio.bytes *)
let input_of_bytes ?(source = "bytes") b =
input_of_stream ~source {pos = 0; data = ref b}
(* Create input functions from a string *)
let input_of_string ?(source = "string") s =
let pos = ref 0 in
let input_char () =
if !pos < 0 then failwith "string input_char: attempt to be before beginning" else
if !pos > String.length s - 1
then
begin
pos := !pos + 1;
None
end
else
begin
pos := !pos + 1;
Some (String.unsafe_get s (!pos - 1))
end
in
{pos_in =
(fun () -> !pos);
seek_in =
(fun p -> if p < 0 then failwith "string seek_in: seek before beginning"; pos := p);
input_char =
(fun () -> input_char ());
input_byte =
(fun () ->
if !pos < 0 then failwith "string input_byte: attempt to be before beginning" else
if !pos > String.length s - 1
then
begin
pos := !pos + 1;
no_more
end
else
begin
pos := !pos + 1;
int_of_char (String.unsafe_get s (!pos - 1))
end);
in_channel_length =
String.length s;
set_offset =
(fun _ -> ());
caml_channel =
None;
source =
source}
(* Output functions over channels *)
let output_of_channel ch =
{pos_out = (fun () -> pos_out ch);
seek_out = seek_out ch;
output_char = (fun c -> output_byte ch (int_of_char c));
output_byte = output_byte ch;
output_string = output_string ch;
out_caml_channel = Some ch;
out_channel_length = (fun () -> out_channel_length ch)}
(* Output functions over streams. If data is written past the end of a stream,
we extend the stream to that point plus one-third of that (new) size. Note that
this has an implication upon mixing reading and writing: the stream will have
junk in the extended section and will be longer than that which has been
written. *)
let output_of_bytes s =
let highest_written = ref 0 in
let output_int i =
if s.pos > bytes_size !(s.data) - 1
then
let newstream = mkbytes (max 1 (s.pos * 2)) in
for x = 0 to bytes_size !(s.data) - 1 do
bset_unsafe newstream x (bget_unsafe !(s.data) x)
done;
bset_unsafe newstream s.pos i;
highest_written := max !highest_written s.pos;
s.pos <- s.pos + 1;
s.data := newstream
else
begin
highest_written := max !highest_written s.pos;
bset_unsafe !(s.data) s.pos i;
s.pos <- s.pos + 1
end
in
{pos_out =
(fun () -> s.pos);
seek_out =
(fun p -> s.pos <- p);
output_char =
(fun c -> output_int (int_of_char c));
output_string =
String.iter (function c -> output_int (int_of_char c));
output_byte =
output_int;
out_caml_channel = None;
out_channel_length =
(fun () -> !highest_written + 1)}
let input_output_of_bytes l =
let data = ref (mkbytes l) in
(output_of_bytes {data = data; pos = 0}, data)
let extract_bytes_from_input_output o data =
let len = o.pos_out () in
let b = mkbytes len in
for x = 0 to len - 1 do bset_unsafe b x (bget_unsafe !data x) done;
b
(* Nudge forward one character. *)
let nudge i =
ignore (i.input_byte ())
(* Read one character behind the current position, and reposition ourselves on
that character. *)
let read_char_back i =
let pos = i.pos_in () in
i.seek_in (pos - 1);
let chr = i.input_char () in
i.seek_in (pos - 1);
chr
(* Go back one character in a file. *)
let rewind i =
i.seek_in (i.pos_in () - 1)
(* Read a character, leaving the position unchanged. *)
let peek_char i =
let r = i.input_char () in
rewind i; r
(* Read a byte, leaving the position unchanged. *)
let peek_byte i =
let r = i.input_byte () in
rewind i; r
(* Make a bytes of an input channel. *)
let bytes_of_input_channel ch =
let fi = input_of_channel ch in
let size = fi.in_channel_length in
let s = mkbytes size in
for x = 1 to size do
match fi.input_byte () with
| b when b = no_more -> failwith "channel length inconsistent"
| b -> bset_unsafe s (x - 1) b
done;
s
(* Save a bytes to a channel. *)
let bytes_to_output_channel ch data =
match data with
| Short caml_bytes ->
output_string ch (Obj.magic caml_bytes : string)
| Long _ as data ->
for x = 1 to bytes_size data do
output_byte ch (bget_unsafe data (x - 1))
done
(* Like Stdlib.read_line *)
let b = Buffer.create 256
let read_line i =
Buffer.clear b;
(* Raise EndOfInput if at end *)
begin match i.input_byte () with
| x when x = no_more -> raise End_of_file
| _ -> ()
end;
rewind i;
(* Read characters whilst <> newline or until end of input *)
let rec read_chars () =
match i.input_byte () with
| x when x = no_more -> Buffer.contents b
| x when Char.unsafe_chr x = '\n' -> Buffer.add_char b '\n'; Buffer.contents b
| x -> Buffer.add_char b (Char.unsafe_chr x); read_chars ()
in
read_chars ()
(* Read all the lines in an input *)
let read_lines i =
let ls = ref [] in
try
while true do
ls := read_line i::!ls
done;
[]
with
End_of_file -> rev !ls
let setinit i s o l =
if l = 0 then () else
let max = bytes_size s - 1
and last = o + 1 - 1 in
if o > max || o < 0 || last < 0 || last > max then raise (Failure "setinit") else
match s with
| Short s ->
begin match i.caml_channel with
| None ->
for x = o to o + l - 1 do Bytes.unsafe_set s x (Char.unsafe_chr (i.input_byte ())) done
| Some ch -> really_input ch s o l
end
| Long s ->
for x = o to o + l - 1 do bigarray_unsafe_set s x (i.input_byte ()) done
let setinit_string i s o l =
if l = 0 then () else
let max = Bytes.length s - 1
and last = o + 1 - 1 in
if o > max || o < 0 || last < 0 || last > max then raise (Failure "setinit_string") else
match i.caml_channel with
| Some ch ->
really_input ch s o l
| None ->
for x = o to o + l - 1 do Bytes.unsafe_set s x (Char.unsafe_chr (i.input_byte ())) done
let bytes_of_input i o l =
i.seek_in o;
let s = Bytes.create l in
setinit_string i s 0 l;
if l <= Sys.max_string_length then
Short s
else
bytes_of_caml_bytes s
let string_of_input i =
string_of_bytes (bytes_of_input i 0 i.in_channel_length)
let getinit i s o l =
if l = 0 then () else
let max = bytes_size s - 1
and last = o + 1 - 1 in
if o > max || o < 0 || last < 0 || last > max then raise (Failure "getinit") else
match s with
| Short s ->
begin match i.out_caml_channel with
| None -> for x = o to o + l - 1 do i.output_byte (int_of_char (Bytes.unsafe_get s x)) done
| Some ch -> output ch s o l
end
| Long s ->
for x = o to o + l - 1 do i.output_byte (bigarray_unsafe_get s x) done
(* The type of bit (MSB first) streams. *)
type bitstream =
{input : input; (* The input from which bits are taken. It is advanced a byte at a time *)
mutable currbyte : int; (* Current byte value from input *)
mutable bit : int; (* Mask for getting the next bit (128, 64,... 2, 1 or 0 = none left) *)
mutable bitsread : int (* A count of the number of bits read since inception. Debug use only *)}
(* A bitstream position is a byte (the position in the base input of the
CURRENT byte) together with the mask value (128 down to 0) *)
type bitstream_position = int * int * int * int
let bitstream_pos b =
(b.input.pos_in (), b.currbyte, b.bit, b.bitsread)
let bitstream_seek b (pos, currbyte, bit, bitsread) =
b.input.seek_in pos;
b.currbyte <- currbyte;
b.bit <- bit;
b.bitsread <- bitsread
(* Make a bitstream from an input. *)
let bitbytes_of_input i =
{currbyte = 0;
bit = 0;
bitsread = 0;
input = i}
(* Get a single bit *)
let rec getbit b =
if b.bit = 0 then
begin
b.currbyte <-
begin match b.input.input_byte () with
| x when x = no_more -> raise End_of_file
| x -> x
end;
b.bit <- 128;
getbit b
end
else
let r = b.currbyte land b.bit > 0 in
b.bitsread <- b.bitsread + 1;
b.bit <- b.bit / 2;
r
(* Get a bit as an integer, set = 1, unset = 0 *)
let getbitint i =
if getbit i then 1 else 0
(* Get n bits at once *)
let rec getbitsint i n =
if n < 0 then assert false else
if n = 0 then 0 else
let rest = getbitsint i (n - 1) lsl 1 in
getbitint i lor rest
(* Align on a byte boundary. *)
let align b =
if b.bit > 0 then b.bitsread <- (b.bitsread / 8 + 1) * 8;
b.bit <- 0
(* Further speed possibilities - if byte-aligned and bitstoget >=8 read whole bytes in.. *)
(* Get n (up to 32) bits from b, returned as an int32, taken highest bit
first. Getting 0 bits gets the value 0. *)
let getval_32 b n =
if n < 0 then raise (Invalid_argument "Pdfio.getval_32 - n < 0") else
if n = 0 then 0l else
let r = ref Int32.zero in
for x = n - 1 downto 0 do
r := Int32.logor !r (Int32.shift_left (i32ofi (getbitint b)) x)
done;
!r
let getval_31 b n =
if n < 0 then raise (Invalid_argument "Pdfio.getval_31 - n < 0") else
if n = 0 then 0 else
let r = ref 0 in
for x = n - 1 downto 0 do
r := !r lor (getbitint b lsl x)
done;
!r
(* Writing MSB-first bit streams *)
(* FIXME: This is excessively complicated and probably inefficient - we should
be able to do the appending and so on by other means? *)
(* The type: A current byte, the position in the byte (0 = nothing in it, 7 =
almost full), and the list (in reverse order) of full bytes so far *)
type bitstream_write =
{mutable wcurrbyte : int;
mutable wbit : int;
mutable bytes : int list}
let make_write_bitstream () =
{wcurrbyte = 0;
wbit = 0;
bytes = []}
let copy_write_bitstream b =
let b' = make_write_bitstream () in
b'.wcurrbyte <- b.wcurrbyte;
b'.wbit <- b.wbit;
b'.bytes <- b.bytes;
b'
(* Put a single bit into bitstream b*)
let putbit b bit =
assert (bit = 0 || bit = 1);
match b.wbit with
| 7 ->
b.bytes <- (b.wcurrbyte lor bit) :: b.bytes;
b.wbit <- 0;
b.wcurrbyte <- 0
| _ ->
b.wbit <- b.wbit + 1;
b.wcurrbyte <- b.wcurrbyte lor (bit lsl (8 - b.wbit))
let putbool b bit =
putbit b (if bit then 1 else 0)
(* Put a multi-bit value n of bits bs (given as an int32) into bitstream b. *)
let rec putval b bs n =
if bs < 0 || bs > 32 then raise (Invalid_argument "putval");
match bs with
| 0 -> ()
| _ ->
let bit =
if land32 n (i32ofi (1 lsl (bs - 1))) > 0l then 1 else 0
in
putbit b bit;
putval b (bs - 1) n
(* Align on a byte boundary, writing zeroes. *)
let align_write b =
if b.wbit > 0 then
for x = 1 to 8 - b.wbit do
putbit b 0
done
(* Get the output out. *)
let bytes_of_write_bitstream b =
align_write b;
bytes_of_list (rev b.bytes)
(* Return a list of booleans, representing (in order) the bits *)
let bits_of_write_bitstream b =
let numbits = length b.bytes * 8 + b.wbit
and bytes : bytes = bytes_of_write_bitstream b
and bits = ref [] in
let bitstream = bitbytes_of_input (input_of_bytes bytes) in
for x = 1 to numbits do
bits =| getbit bitstream
done;
rev !bits
(* Same, but from a list *)
let join_write_bitstreams ss =
let c = make_write_bitstream () in
iter
(putbool c)
(flatten (map bits_of_write_bitstream ss));
c
(* Append b to a. Inputs unaltered. *)
let write_bitstream_append a b =
join_write_bitstreams [a; b]
(* Same, but align at the join. *)
let write_bitstream_append_aligned a b =
let c = copy_write_bitstream a in
align_write c;
write_bitstream_append c b
(* Print the next five characters, to the extent that they exist. *)
let debug_next_char i =
try
let a = unopt (i.input_char ()) in
Pdfe.log (Printf.sprintf "%C = %i\n" a (int_of_char a))
with
_ -> ()
let debug_next_n_chars n i =
for x = 1 to n do debug_next_char i done;
Pdfe.log "\n";
for x = 1 to n do rewind i done