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
|
/* Copyright (C) 2001-2018 Artifex Software, Inc.
All Rights Reserved.
This software is provided AS-IS with no warranty, either express or
implied.
This software is distributed under license and may not be copied,
modified or distributed except as expressly authorized under the terms
of the license contained in the file LICENSE in this distribution.
Refer to licensing information at http://www.artifex.com or contact
Artifex Software, Inc., 1305 Grant Avenue - Suite 200, Novato,
CA 94945, U.S.A., +1(415)492-9861, for further information.
*/
/* String and hexstring streams (filters) */
#include "stdio_.h" /* includes std.h */
#include "memory_.h"
#include "string_.h"
#include "strimpl.h"
#include "sstring.h"
#include "scanchar.h"
/* ------ ASCIIHexEncode ------ */
private_st_AXE_state();
/* Initialize the state */
static int
s_AXE_init(stream_state * st)
{
stream_AXE_state *const ss = (stream_AXE_state *) st;
return s_AXE_init_inline(ss);
}
/* Process a buffer */
static int
s_AXE_process(stream_state * st, stream_cursor_read * pr,
stream_cursor_write * pw, bool last)
{
stream_AXE_state *const ss = (stream_AXE_state *) st;
const byte *p = pr->ptr;
byte *q = pw->ptr;
int rcount = pr->limit - p;
int wcount = pw->limit - q;
int count;
int pos = ss->count;
const char *hex_digits = "0123456789ABCDEF";
int status = 0;
if (last && ss->EndOfData)
wcount--; /* leave room for '>' */
wcount -= (wcount + pos * 2) / 65; /* leave room for \n */
wcount >>= 1; /* 2 chars per input byte */
count = (wcount < rcount ? (status = 1, wcount) : rcount);
while (--count >= 0) {
*++q = hex_digits[*++p >> 4];
*++q = hex_digits[*p & 0xf];
if (!(++pos & 31) && (count != 0 || !last))
*++q = '\n';
}
if (last && status == 0 && ss->EndOfData)
*++q = '>';
pr->ptr = p;
pw->ptr = q;
ss->count = pos & 31;
return status;
}
/* Stream template */
const stream_template s_AXE_template =
{&st_AXE_state, s_AXE_init, s_AXE_process, 1, 3
};
/* ------ ASCIIHexDecode ------ */
private_st_AXD_state();
/* Initialize the state */
static int
s_AXD_init(stream_state * st)
{
stream_AXD_state *const ss = (stream_AXD_state *) st;
return s_AXD_init_inline(ss);
}
/* Process a buffer */
static int
s_AXD_process(stream_state * st, stream_cursor_read * pr,
stream_cursor_write * pw, bool last)
{
stream_AXD_state *const ss = (stream_AXD_state *) st;
int code = s_hex_process(pr, pw, &ss->odd, hex_ignore_whitespace);
switch (code) {
case 0:
if (ss->odd >= 0 && last) {
if (pw->ptr == pw->limit)
return 1;
*++(pw->ptr) = ss->odd << 4;
}
/* falls through */
case 1:
/* We still need to read ahead and check for EOD. */
for (; pr->ptr < pr->limit; pr->ptr++)
if (scan_char_decoder[pr->ptr[1]] != ctype_space) {
if (pr->ptr[1] == '>') {
pr->ptr++;
goto eod;
}
return 1;
}
return 0; /* still need to scan ahead */
default:
return code;
case ERRC:
;
}
/*
* Check for EOD. ERRC implies at least one more character
* was read; we must unread it, since the caller might have
* invoked the filter with exactly the right count to read all
* the available data, and we might be reading past the end.
*/
if (*pr->ptr != '>') { /* EOD */
--(pr->ptr);
return ERRC;
}
eod:if (ss->odd >= 0) {
if (pw->ptr == pw->limit)
return 1;
*++(pw->ptr) = ss->odd << 4;
}
return EOFC;
}
/* Stream template */
const stream_template s_AXD_template =
{&st_AXD_state, s_AXD_init, s_AXD_process, 2, 1
};
/* ------ PSStringEncode ------ */
/* Process a buffer */
static int
s_PSSE_process(stream_state * st, stream_cursor_read * pr,
stream_cursor_write * pw, bool last)
{
const byte *p = pr->ptr;
const byte *rlimit = pr->limit;
byte *q = pw->ptr;
byte *wlimit = pw->limit;
int status = 0;
/* This doesn't have to be very efficient. */
while (p < rlimit) {
int c = *++p;
if (c < 32 || c >= 127) {
const char *pesc;
const char *const esc = "\n\r\t\b\f";
if (c < 32 && c != 0 && (pesc = strchr(esc, c)) != 0) {
if (wlimit - q < 2) {
--p;
status = 1;
break;
}
*++q = '\\';
*++q = "nrtbf"[pesc - esc];
continue;
}
if (wlimit - q < 4) {
--p;
status = 1;
break;
}
q[1] = '\\';
q[2] = (c >> 6) + '0';
q[3] = ((c >> 3) & 7) + '0';
q[4] = (c & 7) + '0';
q += 4;
continue;
} else if (c == '(' || c == ')' || c == '\\') {
if (wlimit - q < 2) {
--p;
status = 1;
break;
}
*++q = '\\';
} else {
if (q == wlimit) {
--p;
status = 1;
break;
}
}
*++q = c;
}
if (last && status == 0) {
if (q == wlimit)
status = 1;
else
*++q = ')';
}
pr->ptr = p;
pw->ptr = q;
return status;
}
/* Stream template */
const stream_template s_PSSE_template =
{&st_stream_state, NULL, s_PSSE_process, 1, 4
};
/* ------ PSStringDecode ------ */
private_st_PSSD_state();
/* Initialize the state */
int
s_PSSD_init(stream_state * st)
{
stream_PSSD_state *const ss = (stream_PSSD_state *) st;
ss->from_string = false;
return s_PSSD_partially_init_inline(ss);
}
/* Process a buffer */
static int
s_PSSD_process(stream_state * st, stream_cursor_read * pr,
stream_cursor_write * pw, bool last)
{
stream_PSSD_state *const ss = (stream_PSSD_state *) st;
const byte *p = pr->ptr;
const byte *rlimit = pr->limit;
byte *q = pw->ptr;
byte *wlimit = pw->limit;
int status = 0;
int c;
#define check_p(n)\
if ( p == rlimit ) { p -= n; goto out; }
#define check_q(n)\
if ( q == wlimit ) { p -= n; status = 1; goto out; }
while (p < rlimit) {
c = *++p;
if (c == '\\' && !ss->from_string) {
check_p(1);
switch ((c = *++p)) {
case 'n':
c = '\n';
goto put;
case 'r':
c = '\r';
goto put;
case 't':
c = '\t';
goto put;
case 'b':
c = '\b';
goto put;
case 'f':
c = '\f';
goto put;
default: /* ignore the \ */
put:check_q(2);
*++q = c;
continue;
case char_CR: /* ignore, check for following \n */
check_p(2);
if (p[1] == char_EOL)
p++;
continue;
case char_EOL: /* ignore */
continue;
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
{
int d;
check_p(2);
d = p[1];
c -= '0';
if (d >= '0' && d <= '7') {
if (p + 1 == rlimit) {
p -= 2;
goto out;
}
check_q(2);
c = (c << 3) + d - '0';
d = p[2];
if (d >= '0' && d <= '7') {
c = (c << 3) + d - '0';
p += 2;
} else
p++;
} else
check_q(2);
*++q = c;
continue;
}
}
} else
switch (c) {
case '(':
check_q(1);
ss->depth++;
break;
case ')':
if (ss->depth == 0) {
status = EOFC;
goto out;
}
check_q(1);
ss->depth--;
break;
case char_CR: /* convert to \n */
check_p(1);
check_q(1);
if (p[1] == char_EOL)
p++;
*++q = '\n';
continue;
case char_EOL:
c = '\n';
/* fall through */
default:
check_q(1);
break;
}
*++q = c;
}
#undef check_p
#undef check_q
out:pr->ptr = p;
pw->ptr = q;
if (last && status == 0 && p != rlimit)
status = ERRC;
return status;
}
/* Stream template */
const stream_template s_PSSD_template =
{&st_PSSD_state, s_PSSD_init, s_PSSD_process, 4, 1
};
/* ------ Utilities ------ */
/*
* Convert hex data to binary.
* Return 1 if we filled the string,
* 0 if we ran out of input data before filling the string,
* 2 if hex_break_on_whitespace is on and we encounrered
* a white space.
* ERRC on error.
* The caller must set *odd_digit to -1 before the first call;
* after each call, if an odd number of hex digits has been read (total),
* *odd_digit is the odd digit value, otherwise *odd_digit = -1.
* See strimpl.h for the definition of syntax.
*/
int
s_hex_process(stream_cursor_read * pr, stream_cursor_write * pw,
int *odd_digit, hex_syntax syntax)
{
const byte *p = pr->ptr;
const byte *rlimit = pr->limit;
byte *q = pw->ptr;
byte *wlimit = pw->limit;
byte *q0 = q;
byte val1 = (byte) * odd_digit;
byte val2;
uint rcount;
byte *flimit;
const byte *const decoder = scan_char_decoder;
int code = 0;
if (q >= wlimit)
return 1;
if (val1 <= 0xf)
goto d2;
d1:if ((rcount = (rlimit - p) >> 1) == 0)
goto x1;
/* Set up a fast end-of-loop check, so we don't have to test */
/* both p and q against their respective limits. */
flimit = (rcount < wlimit - q ? q + rcount : wlimit);
f1:if ((val1 = decoder[p[1]]) <= 0xf &&
(val2 = decoder[p[2]]) <= 0xf
) {
p += 2;
*++q = (val1 << 4) + val2;
if (q < flimit)
goto f1;
if (q >= wlimit)
goto px;
}
x1:if (p >= rlimit)
goto end1;
if ((val1 = decoder[*++p]) > 0xf) {
if (val1 == ctype_space) {
switch (syntax) {
case hex_ignore_garbage:
case hex_ignore_whitespace:
goto x1;
case hex_ignore_leading_whitespace:
if (q == q0 && *odd_digit < 0)
goto x1;
/* pass through */
case hex_break_on_whitespace:
--p;
code = 2;
goto end1;
}
} else if (syntax == hex_ignore_garbage)
goto x1;
code = ERRC;
goto end1;
}
d2:if (p >= rlimit) {
*odd_digit = val1;
goto ended;
}
if ((val2 = decoder[*++p]) > 0xf) {
if (val2 == ctype_space)
switch (syntax) {
case hex_ignore_garbage:
case hex_ignore_whitespace:
goto d2;
case hex_ignore_leading_whitespace:
if (q == q0)
goto d2;
/* pass through */
case hex_break_on_whitespace:
--p;
*odd_digit = val1;
code = 2;
goto ended;
}
if (syntax == hex_ignore_garbage)
goto d2;
*odd_digit = val1;
code = ERRC;
goto ended;
}
*++q = (val1 << 4) + val2;
if (q < wlimit)
goto d1;
px:code = 1;
end1:*odd_digit = -1;
ended:pr->ptr = p;
pw->ptr = q;
return code;
}
|