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
|
/* Copyright (C) 2001-2023 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., 39 Mesa Street, Suite 108A, San Francisco,
CA 94129, USA, for further information.
*/
/* Simple Level 2 filters */
#include "stdio_.h" /* includes std.h */
#include "memory_.h"
#include "gdebug.h"
#include "strimpl.h"
#include "sa85x.h"
#include "sbtx.h"
#include "scanchar.h"
/* ------ ASCII85Encode ------ */
private_st_A85E_state();
/* Initialize the state */
static int
s_A85E_init(stream_state * st)
{
stream_A85E_state *const ss = (stream_A85E_state *) st;
return s_A85E_init_inline(ss);
}
/* Process a buffer */
#define LINE_LIMIT 79 /* not 80, to satisfy Genoa FTS */
static int
s_A85E_process(stream_state * st, stream_cursor_read * pr,
stream_cursor_write * pw, bool last)
{
stream_A85E_state *const ss = (stream_A85E_state *) st;
register const byte *p = pr->ptr;
register byte *q = pw->ptr;
byte *qn = q + (LINE_LIMIT - ss->count); /* value of q before next EOL */
const byte *rlimit = pr->limit;
byte *wlimit = pw->limit;
int status = 0;
int prev = ss->last_char;
unsigned int count;
if_debug3m('w', ss->memory, "[w85]initial ss->count = %d, rcount = %d, wcount = %d\n",
ss->count, (int)(rlimit - p), (int)(wlimit - q));
for (; (count = rlimit - p) >= 4; p += 4) {
ulong word =
((ulong) (((uint) p[1] << 8) + p[2]) << 16) +
(((uint) p[3] << 8) + p[4]);
if (word == 0) {
if (q >= qn) {
if (wlimit - q < 2) {
status = 1;
break;
}
/* No need to update 'prev' in this case as its overwritten with 'z' below */
*++q = '\n';
qn = q + LINE_LIMIT;
if_debug1m('w', ss->memory, "[w85]EOL at %d bytes written\n",
(int)(q - pw->ptr));
} else {
if (q >= wlimit) {
status = 1;
break;
}
}
*++q = prev = 'z';
} else {
ulong v4 = word / 85; /* max 85^4 */
ulong v3 = v4 / 85; /* max 85^3 */
uint v2 = v3 / 85; /* max 85^2 */
uint v1 = v2 / 85; /* max 85 */
while (1) {
/* Put some bytes */
while (q + 5 > qn) {
if (q >= wlimit) {
status = 1;
goto end;
}
*++q = prev = '\n';
qn = q + LINE_LIMIT;
if_debug1m('w', ss->memory, "[w85]EOL at %d bytes written\n",
(int)(q - pw->ptr));
}
if (wlimit - q < 5) {
status = 1;
goto end;
}
q[1] = (byte) v1 + '!';
q[2] = (byte) (v2 - v1 * 85) + '!';
q[3] = (byte) ((uint) v3 - v2 * 85) + '!';
q[4] = (byte) ((uint) v4 - (uint) v3 * 85) + '!';
q[5] = (byte) ((uint) word - (uint) v4 * 85) + '!';
/*
* '%%' or '%!' at the beginning of the line will confuse some
* document managers: insert (an) EOL(s) if necessary to prevent
* this.
*/
if (q[1] == '%') {
if (prev == '%') {
if (qn - q == LINE_LIMIT - 1) {
/* A line would begin with %%. */
*++q = prev = '\n';
qn = q + LINE_LIMIT;
if_debug1m('w', ss->memory,
"[w85]EOL for %%%% at %d bytes written\n",
(int)(q - pw->ptr));
continue; /* Put some more bytes */
}
} else if (prev == '\n' && (q[2] == '%' || q[2] == '!')) {
/*
* We may have to insert more than one EOL if
* there are more than two %s in a row.
*/
int extra =
(q[2] == '!' ? 1 : /* else q[2] == '%' */
q[3] == '!' ? 2 :
q[3] != '%' ? 1 :
q[4] == '!' ? 3 :
q[4] != '%' ? 2 :
q[5] == '!' ? 4 :
q[5] != '%' ? 3 : 4);
if (wlimit - q < 5 + extra) {
status = 1;
goto end;
}
if_debug6m('w', ss->memory, "[w]%c%c%c%c%c extra = %d\n",
q[1], q[2], q[3], q[4], q[5], extra);
switch (extra) {
case 4:
q[9] = q[5], q[8] = '\n';
goto e3;
case 3:
q[8] = q[5];
e3:q[7] = q[4], q[6] = '\n';
goto e2;
case 2:
q[7] = q[5], q[6] = q[4];
e2:q[5] = q[3], q[4] = '\n';
goto e1;
case 1:
q[6] = q[5], q[5] = q[4], q[4] = q[3];
e1:q[3] = q[2], q[2] = '\n';
}
if_debug1m('w', ss->memory, "[w85]EOL at %d bytes written\n",
(int)(q + 2 * extra - pw->ptr));
qn = q + 2 * extra + LINE_LIMIT;
q += extra;
}
} else if (q[1] == '!' && prev == '%' &&
qn - q == LINE_LIMIT - 1
) {
/* A line would begin with %!. */
*++q = prev = '\n';
qn = q + LINE_LIMIT;
if_debug1m('w', ss->memory, "[w85]EOL for %%! at %d bytes written\n",
(int)(q - pw->ptr));
continue; /* Put some more bytes */
}
break;
}
prev = *(q += 5);
}
}
end:
ss->count = LINE_LIMIT - (qn - q);
/* Check for final partial word. */
if (last && status == 0 && count < 4) {
char buf[5];
int nchars = (count == 0 ? 2 : count + 3);
ulong word = 0;
ulong divisor = 85L * 85 * 85 * 85;
int i, space;
switch (count) {
case 3:
word += (uint) p[3] << 8;
case 2:
word += (ulong) p[2] << 16;
case 1:
word += (ulong) p[1] << 24;
for(i=0; i <= count; i++) {
ulong v = word / divisor; /* actually only a byte */
buf[i] = (byte) v + '!';
word -= v * divisor;
divisor /= 85;
}
/*case 0: */
}
space = count && buf[0] == '%' &&
( (prev == '\n' && ( buf[1] == '%' || buf[1] =='!')) ||
(prev == '%' && qn - q == LINE_LIMIT - 1)
);
if (wlimit - q < nchars+space)
status = 1;
else if (q + nchars+space > qn) {
*++q = prev = '\n';
qn = q + LINE_LIMIT;
goto end;
} else {
if (count) {
if (space)
*++q = ' ';
memcpy(q+1, buf, count+1);
q += count+1;
p += count;
}
*++q = '~';
*++q = '>';
}
}
if_debug3m('w', ss->memory, "[w85]final ss->count = %d, %d bytes read, %d written\n",
ss->count, (int)(p - pr->ptr), (int)(q - pw->ptr));
pr->ptr = p;
if (q > pw->ptr)
ss->last_char = *q;
pw->ptr = q;
return status;
}
#undef LINE_LIMIT
/* Stream template */
const stream_template s_A85E_template = {
&st_A85E_state, s_A85E_init, s_A85E_process, 4, 6
};
/* ------ ByteTranslateEncode/Decode ------ */
private_st_BT_state();
/* Process a buffer. Note that the same code serves for both streams. */
static int
s_BT_process(stream_state * st, stream_cursor_read * pr,
stream_cursor_write * pw, bool last)
{
stream_BT_state *const ss = (stream_BT_state *) st;
const byte *p = pr->ptr;
byte *q = pw->ptr;
uint rcount = pr->limit - p;
uint wcount = pw->limit - q;
uint count;
int status;
if (rcount <= wcount)
count = rcount, status = 0;
else
count = wcount, status = 1;
while (count--)
*++q = ss->table[*++p];
pr->ptr = p;
pw->ptr = q;
return status;
}
/* Stream template */
const stream_template s_BTE_template = {
&st_BT_state, NULL, s_BT_process, 1, 1
};
const stream_template s_BTD_template = {
&st_BT_state, NULL, s_BT_process, 1, 1
};
|
