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
|
/* Copyright (C) 1991, 1992, 1993, 1997, 1998 Aladdin Enterprises. All rights reserved.
This file is part of Aladdin Ghostscript.
Aladdin Ghostscript is distributed with NO WARRANTY OF ANY KIND. No author
or distributor accepts any responsibility for the consequences of using it,
or for whether it serves any particular purpose or works at all, unless he
or she says so in writing. Refer to the Aladdin Ghostscript Free Public
License (the "License") for full details.
Every copy of Aladdin Ghostscript must include a copy of the License,
normally in a plain ASCII text file named PUBLIC. The License grants you
the right to copy, modify and redistribute Aladdin Ghostscript, but only
under certain conditions described in the License. Among other things, the
License requires that the copyright notice and this notice be preserved on
all copies.
*/
/*$Id$ */
/* Composite font decoding for Ghostscript library */
#include "memory_.h"
#include "gx.h"
#include "gserrors.h"
#include "gsstruct.h"
#include "gsfcmap.h"
#include "gxfixed.h"
#include "gxdevice.h"
#include "gxdevmem.h" /* for gxchar.h */
#include "gxchar.h"
#include "gxfont.h"
#include "gxfont0.h"
/* Stack up modal composite fonts, down to a non-modal or base font. */
private int
gs_stack_modal_fonts(gs_show_enum * penum)
{
int fdepth = penum->fstack.depth;
gs_font *cfont = penum->fstack.items[fdepth].font;
while (cfont->FontType == ft_composite) {
gs_font_type0 *const cmfont = (gs_font_type0 *) cfont;
if (!fmap_type_is_modal(cmfont->data.FMapType))
break;
if (fdepth == max_font_depth)
return_error(gs_error_invalidfont);
fdepth++;
cfont = cmfont->data.FDepVector[cmfont->data.Encoding[0]];
penum->fstack.items[fdepth].font = cfont;
penum->fstack.items[fdepth].index = 0;
if_debug2('j', "[j]stacking depth=%d font=0x%lx\n",
fdepth, (ulong) cfont);
}
penum->fstack.depth = fdepth;
return 0;
}
/* Initialize the composite font stack for a show enumerator. */
int
gs_type0_init_fstack(gs_show_enum * penum, gs_font * pfont)
{
if_debug1('j', "[j]stacking depth=0 font=0x%lx\n",
(ulong) pfont);
penum->fstack.depth = 0;
penum->fstack.items[0].font = pfont;
penum->fstack.items[0].index = 0;
return gs_stack_modal_fonts(penum);
}
/* Select the appropriate descendant of a font. */
/* Uses free variables: penum. */
/* Uses pdata, uses & updates fdepth, sets pfont. */
#define select_descendant(pfont, pdata, fidx, fdepth)\
if ( fidx >= pdata->encoding_size )\
return_error(gs_error_rangecheck);\
if ( fdepth == max_font_depth )\
return_error(gs_error_invalidfont);\
pfont = pdata->FDepVector[pdata->Encoding[fidx]];\
if ( ++fdepth > orig_depth || pfont != penum->fstack.items[fdepth].font )\
penum->fstack.items[fdepth].font = pfont,\
changed = 1;\
penum->fstack.items[fdepth].index = fidx
/* Get the root EscChar of a composite font, which overrides the EscChar */
/* of descendant fonts. */
private uint
root_esc_char(const gs_show_enum * penum)
{
return ((gs_font_type0 *) (penum->fstack.items[0].font))->data.EscChar;
}
/* Get the next character or glyph from a composite string. */
/* If we run off the end of the string in the middle of a */
/* multi-byte sequence, return gs_error_rangecheck. */
/* If the string is empty, return 2. */
/* If the current (base) font changed, return 1. Otherwise, return 0. */
int
gs_type0_next_glyph(register gs_show_enum * penum, gs_char * pchr,
gs_glyph * pglyph)
{
const byte *str = penum->text.data.bytes;
const byte *p = str + penum->index;
const byte *end = str + penum->text.size;
int fdepth = penum->fstack.depth;
int orig_depth = fdepth;
gs_font *pfont;
#define pfont0 ((gs_font_type0 *)pfont)
gs_type0_data *pdata;
uint fidx;
gs_char chr;
gs_glyph glyph = gs_no_glyph;
int changed = 0;
#define need_left(n)\
if ( end - p < n ) return_error(gs_error_rangecheck)
/*
* Although the Adobe documentation doesn't say anything about this,
* if the root font is modal and the very first character of the
* string being decoded is an escape or shift character, then
* font selection via the escape mechanism works down from the root,
* rather than up from the lowest modal font. (This was first
* reported by Norio Katayama, and confirmed by someone at Adobe.)
*/
if (penum->index == 0) {
int idepth = 0;
pfont = penum->fstack.items[0].font;
for (; pfont->FontType == ft_composite;) {
fmap_type fmt = (pdata = &pfont0->data)->FMapType;
if (p == end)
return 2;
chr = *p;
switch (fmt) {
case fmap_escape:
if (chr != root_esc_char(penum))
break;
need_left(2);
fidx = p[1];
p += 2;
if_debug1('j', "[j]from root: escape %d\n", fidx);
rdown:select_descendant(pfont, pdata, fidx, idepth);
if_debug2('j', "[j]... new depth=%d, new font=0x%lx\n",
idepth, (ulong) pfont);
continue;
case fmap_double_escape:
if (chr != root_esc_char(penum))
break;
need_left(2);
fidx = p[1];
p += 2;
if (fidx == chr) {
need_left(1);
fidx = *p++ + 256;
}
if_debug1('j', "[j]from root: double escape %d\n", fidx);
goto rdown;
case fmap_shift:
if (chr == pdata->ShiftIn)
fidx = 0;
else if (chr == pdata->ShiftOut)
fidx = 1;
else
break;
p++;
if_debug1('j', "[j]from root: shift %d\n", fidx);
goto rdown;
default:
break;
}
break;
}
/* If we saw any initial escapes or shifts, */
/* compute a new initial base font. */
if (idepth != 0) {
int code;
penum->fstack.depth = idepth;
code = gs_stack_modal_fonts(penum);
if (code < 0)
return code;
if (penum->fstack.depth > idepth)
changed = 1;
orig_depth = fdepth = penum->fstack.depth;
}
}
/* Handle initial escapes or shifts. */
up:if (p == end)
return 2;
chr = *p;
while (fdepth > 0) {
pfont = penum->fstack.items[fdepth - 1].font;
pdata = &pfont0->data;
switch (pdata->FMapType) {
default: /* non-modal */
fdepth--;
continue;
case fmap_escape:
if (chr != root_esc_char(penum))
break;
need_left(2);
fidx = *++p;
if_debug1('j', "[j]next: escape %d\n", fidx);
/* Per Adobe, if we get an escape at the root, */
/* treat it as an ordinary character (font index). */
if (fidx == chr && fdepth > 1) {
fdepth--;
goto up;
}
down:if (++p == end)
return 2;
chr = *p;
fdepth--;
do {
select_descendant(pfont, pdata, fidx, fdepth);
if_debug3('j', "[j]down from modal: new depth=%d, index=%d, new font=0x%lx\n",
fdepth, fidx, (ulong) pfont);
if (pfont->FontType != ft_composite)
break;
pdata = &pfont0->data;
fidx = 0;
}
while (pdata->FMapType == fmap_escape);
continue;
case fmap_double_escape:
if (chr != root_esc_char(penum))
break;
need_left(2);
fidx = *++p;
if (fidx == chr) {
need_left(2);
fidx = *++p + 256;
}
if_debug1('j', "[j]next: double escape %d\n", fidx);
goto down;
case fmap_shift:
if (chr == pdata->ShiftIn)
fidx = 0;
else if (chr == pdata->ShiftOut)
fidx = 1;
else
break;
if_debug1('j', "[j]next: shift %d\n", fidx);
goto down;
}
break;
}
/* At this point, chr == *p. */
/* (This is important to know for CMap'ed fonts.) */
p++;
/*
* Now handle non-modal descendants.
* The PostScript language manual has some confusing
* wording about the parent supplying the "first part"
* of the child's decoding information; what this means
* is not (as one might imagine) the font index, but
* simply the first byte of the data.
*/
while ((pfont = penum->fstack.items[fdepth].font)->FontType == ft_composite) {
pdata = &pfont0->data;
switch (pdata->FMapType) {
default: /* can't happen */
return_error(gs_error_invalidfont);
case fmap_8_8:
need_left(1);
fidx = chr;
chr = *p++;
if_debug2('J', "[J]8/8 index=%d, char=%ld\n",
fidx, chr);
break;
case fmap_1_7:
fidx = chr >> 7;
chr &= 0x7f;
if_debug2('J', "[J]1/7 index=%d, char=%ld\n",
fidx, chr);
break;
case fmap_9_7:
need_left(1);
fidx = ((uint) chr << 1) + (*p >> 7);
chr = *p & 0x7f;
if_debug2('J', "[J]9/7 index=%d, char=%ld\n",
fidx, chr);
p++;
break;
case fmap_SubsVector:
{
int width = pdata->subs_width;
uint subs_count = pdata->subs_size;
const byte *psv = pdata->SubsVector.data;
#define subs_loop(subs_elt, width)\
while ( subs_count != 0 && tchr >= (schr = subs_elt) )\
subs_count--, tchr -= schr, psv += width;\
chr = tchr; p += width - 1; break
switch (width) {
default: /* can't happen */
return_error(gs_error_invalidfont);
case 1:
{
byte tchr = (byte) chr, schr;
subs_loop(*psv, 1);
}
case 2:
need_left(1);
#define w2(p) (((ushort)*p << 8) + p[1])
{
ushort tchr = ((ushort) chr << 8) + *p,
schr;
subs_loop(w2(psv), 2);
}
case 3:
need_left(2);
#define w3(p) (((ulong)*p << 16) + ((uint)p[1] << 8) + p[2])
{
ulong tchr = ((ulong) chr << 16) + w2(p),
schr;
subs_loop(w3(psv), 3);
}
case 4:
need_left(3);
#define w4(p) (((ulong)*p << 24) + ((ulong)p[1] << 16) + ((uint)p[2] << 8) + p[3])
{
ulong tchr = ((ulong) chr << 24) + w3(p),
schr;
subs_loop(w4(psv), 4);
}
#undef w2
#undef w3
#undef w4
#undef subs_loop
}
fidx = pdata->subs_size - subs_count;
if_debug2('J', "[J]SubsVector index=%d, char=%ld\n",
fidx, chr);
break;
}
case fmap_CMap:
{
gs_const_string cstr;
uint mindex = p - str - 1; /* p was incremented */
int code;
cstr.data = str;
cstr.size = end - str;
code = gs_cmap_decode_next(pdata->CMap, &cstr, &mindex,
&fidx, &chr, &glyph);
if (code < 0)
return code;
p = str + mindex;
if_debug3('J', "[J]CMap returns %d, chr=0x%lx, glyph=0x%lx\n",
code, (ulong) chr, (ulong) glyph);
if (code == 0) {
if (glyph == gs_no_glyph)
glyph = gs_min_cid_glyph;
} else
chr = (gs_char) glyph, glyph = gs_no_glyph;
/****** RESCAN chr IF DESCENDANT IS CMAP'ED ******/
break;
}
}
select_descendant(pfont, pdata, fidx, fdepth);
if_debug2('J', "... new depth=%d, new font=0x%lx\n",
fdepth, (ulong) pfont);
}
*pchr = chr;
*pglyph = glyph;
/* Update the pointer into the original string, but only if */
/* we didn't switch over to parsing a code from a CMap. */
if (str == penum->text.data.bytes)
penum->index = p - str;
penum->fstack.depth = fdepth;
if_debug4('J', "[J]depth=%d font=0x%lx index=%d changed=%d\n",
fdepth, (ulong) penum->fstack.items[fdepth].font,
penum->fstack.items[fdepth].index, changed);
return changed;
#undef pfont0
}
|