forked from YannickChevalier/hevea-mathjax
-
Notifications
You must be signed in to change notification settings - Fork 0
/
doOut.ml
343 lines (285 loc) · 9.01 KB
/
doOut.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
(***********************************************************************)
(* *)
(* HEVEA *)
(* *)
(* Luc Maranget, projet PARA, INRIA Rocquencourt *)
(* *)
(* Copyright 1998 Institut National de Recherche en Informatique et *)
(* Automatique. Distributed only by permission. *)
(* *)
(***********************************************************************)
open Printf
let verbose = ref 0
module type Config = sig
val small_length : int
end
module type S = sig
type t
val create_buff : unit -> t
val create_chan : out_channel -> t
val create_null : unit -> t
val is_null : t -> bool
val is_empty : t -> bool
val reset : t -> unit
val put : t -> string -> unit
val blit : t -> Lexing.lexbuf -> unit
val put_char : t -> char -> unit
val flush : t -> unit
val get_pos : t -> int
val erase_start : int -> t -> unit
val iter : (char -> unit) -> t -> unit
val iter_next : (char -> (unit -> int) -> unit) -> t -> unit
val to_string : t -> string
val to_list : t -> string list
val to_chan : out_channel -> t -> unit
val copy : t -> t -> unit
val copy_fun : (string -> string) -> t -> t -> unit
val copy_no_tag : t -> t -> unit
val close : t -> unit
val debug : out_channel -> t -> unit
val unskip : t -> unit
end
module Make(C:Config) = struct
module S = SimpleRope.Make(C)
(***************************************************)
(* Rope with a front buffer of size C.small_length *)
(***************************************************)
let max_sz = C.small_length
type buff =
{ mutable b : Bytes.t ; mutable p : int ;
mutable sz : int ; mutable r : S.t; }
let start_sz = min 16 max_sz
let alloc_buff () =
{ b = Bytes.create start_sz ; p = 0 ; sz=start_sz; r = S.empty ; }
let dump_buff chan b =
S.output chan b.r ;
output chan b.b 0 b.p
let reset_buff b = b.p <- 0 ; b.r <- S.empty
let length_buff b = b.p + S.length b.r
let to_string_buff b =
let r = Bytes.create (length_buff b) in
S.blit b.r r 0 ;
Bytes.unsafe_blit b.b 0 r (S.length b.r) b.p ;
Bytes.unsafe_to_string r
let do_flush_buff b =
let s = Bytes.create b.p in
Bytes.unsafe_blit b.b 0 s 0 b.p ;
b.r <- S.append_string b.r (Bytes.unsafe_to_string s) ;
b.p <- 0
let flush_buff b = if b.p > 0 then do_flush_buff b
let realloc b =
let nsz = 2 * b.sz in
let nbuff = Bytes.create nsz in
Bytes.unsafe_blit b.b 0 nbuff 0 b.p ;
b.b <- nbuff ; b.sz <- nsz
let rec vput_buff b s pos len =
if b.p + len < b.sz then begin
Bytes.blit_string s pos b.b b.p len ;
b.p <- b.p + len
end else if b.sz < max_sz then begin
realloc b ;
vput_buff b s pos len
end else if b.p = 0 then
let bsz = Bytes.create b.sz in
Bytes.blit_string s pos bsz 0 b.sz ;
b.r <- S.append_string b.r (Bytes.unsafe_to_string bsz) ;
vput_buff b s (pos+b.sz) (len-b.sz)
else begin
let tr = b.sz-b.p in
String.unsafe_blit s pos b.b b.p tr ;
b.p <- b.p+tr ;
do_flush_buff b ;
vput_buff b s (pos+tr) (len-tr)
end
let put_buff b s pos len =
if !verbose > 2 then
eprintf "PUT '%s'-> '%a'\n%a\n"
(String.sub s pos len) dump_buff b S.debug b.r ;
vput_buff b s pos len ;
if !verbose > 2 then
eprintf "PUT OVER '%s'-> '%a'\n%a\n"
(String.sub s pos len) dump_buff b S.debug b.r ;
()
let put_bytes b s pos len = put_buff b (Bytes.unsafe_to_string s) pos len
let put_buff_char b c =
if b.p >= b.sz then begin
if b.sz < max_sz then realloc b
else do_flush_buff b
end ;
Bytes.unsafe_set b.b b.p c ;
b.p <- b.p + 1
let get_buff b k =
let len = S.length b.r in
if k < len then S.get b.r k
else Bytes.unsafe_get b.b (k-len)
(* Append src at the end of dst *)
let copy_buff src dst =
flush_buff dst ;
dst.r <- S.append dst.r src.r ;
put_bytes dst src.b 0 src.p
(*******************)
type t =
| Rope of buff
| Chan of out_channel
| Null
let debug chan = function
| Rope out ->
output_char chan '*';
dump_buff chan out ;
output_char chan '*';
()
| Chan _ -> output_string chan "*CHAN*"
| Null -> output_string chan "*NULL*"
let pp_type = function
| Rope _out -> "*Rope*"
| Chan _ -> "*CHAN*"
| Null -> "*NULL*"
let create_buff () = Rope (alloc_buff ())
let create_chan chan = Chan chan
let create_null () = Null
let is_null = ( = ) Null
and is_empty = function
| Rope b -> b.p = 0 && S.length b.r = 0
| _ -> false
let reset = function
| Rope b -> b.p <- 0 ; b.r <- S.empty
| _ -> raise (Misc.fatal "Out.reset")
let get_pos = function
| Rope b -> length_buff b
| _ -> 0
let erase_start n = function
| Rope b ->
flush_buff b ;
b.r <- S.sub b.r n (S.length b.r - n)
| _ -> raise (Misc.fatal "Out.erase_start")
let put out s = match out with
| Null -> ()
| Chan chan -> output_string chan s
| Rope b -> put_buff b s 0 (String.length s)
(* To be used only in a lexer action *)
let blit out lexbuf =
let open Lexing in
match out with
| Rope b ->
let len = lexbuf.lex_curr_pos - lexbuf.lex_start_pos in
put_bytes b lexbuf.lex_buffer lexbuf.lex_start_pos len
| Chan chan ->
let len = lexbuf.lex_curr_pos - lexbuf.lex_start_pos in
output chan lexbuf.lex_buffer lexbuf.lex_start_pos len
| Null -> ()
let put_char out c =
match out with
| Null -> ()
| Chan chan -> output_char chan c
| Rope b -> put_buff_char b c
let flush = function
| Chan chan -> flush chan
| _ -> ()
let iter f = function
| Null -> ()
| Chan _ -> raise (Misc.fatal "Out.iter")
| Rope b ->
S.iter f b.r ;
let bb = b.b in
for k = 0 to b.p-1 do f (Bytes.unsafe_get bb k) done ;
()
let iter_next f = function
| Null -> ()
| Chan _ -> raise (Misc.fatal "Out.iter_next")
| Rope b ->
let rec do_rec next =
let c = next () in
if c <> -1 then begin
f (Char.chr c) next;
do_rec next
end in
do_rec
(let k = ref 0 in
fun () ->
let i = !k in
if i >= length_buff b then -1
else begin
incr k;
Char.code (get_buff b i)
end)
let to_string = function
| Rope b ->
let s = to_string_buff b in
reset_buff b ;
s
| Null -> ""
| _ -> raise (Misc.fatal "Out.to_string")
let to_list = function
| Rope b ->
let xs =
if b.p > 0 then [Bytes.sub_string b.b 0 b.p]
else [] in
let xs = S.to_list_append b.r xs in
if !verbose > 2 then begin
match xs with
| []|[_] -> ()
| _ ->
eprintf "to_list: %s\n%!"
(String.concat " "
(List.map
(fun s -> sprintf "\"%s\"" (String.escaped s))
xs))
end ;
reset_buff b ;
xs
| Null -> []
| _ -> raise (Misc.fatal "Out.to_list")
let to_chan chan = function
| Rope b ->
dump_buff chan b ;
reset_buff b
| Null -> ()
| b ->
raise (Misc.fatal (sprintf "Out.to_chan: %s" (pp_type b)))
let hidden_copy from_rope to_buff = match to_buff with
| Null -> ()
| Rope b -> copy_buff from_rope b
| Chan chan -> dump_buff chan from_rope
let copy from_buff to_buff = match from_buff with
| Rope b -> hidden_copy b to_buff
| _ -> raise (Misc.fatal "Out.copy")
let copy_fun f from_buff to_buff = match from_buff with
| Rope b ->
put to_buff (f (to_string_buff b))
| _ -> raise (Misc.fatal "Out.copy_fun")
let copy_no_tag from_buff to_buff =
if !verbose > 2 then begin
prerr_string "copy no tag from buff";
debug stderr from_buff;
prerr_newline ();
end;
match from_buff with
| Rope src -> begin
flush_buff src ;
try
let i = S.index src.r '>' in
let j =
if is_empty from_buff then i + 1
else S.rindex src.r '<' in
src.r <- S.sub src.r (i+1) (j-i-1) ;
hidden_copy src to_buff ;
if !verbose > 2 then begin
prerr_string "copy no tag to_buff";
debug stderr to_buff;
prerr_newline ()
end
with Not_found -> raise (Misc.fatal "Out.copy_no_tag, no tag found")
end
| _ -> raise (Misc.fatal "Out.copy_no_tag")
let close = function
| Chan c -> close_out c
| _ -> ()
let is_space c = match c with
|' '|'\n'|'\r'|'\t' -> true
| _ -> false
let unskip = function
| Rope b ->
flush_buff b ;
b.r <- S.erase b.r is_space
| _ -> ()
end