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
|
/* pkin.c
Copyright 1996-2006 Han The Thanh <thanh@pdftex.org>
Copyright 2006-2008 Taco Hoekwater <taco@luatex.org>
This file is part of LuaTeX.
LuaTeX is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 2 of the License, or (at your
option) any later version.
LuaTeX is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
License for more details.
You should have received a copy of the GNU General Public License along
with LuaTeX; if not, see <http://www.gnu.org/licenses/>. */
/*
* NAME
* pkin.c - implementation of readchar()
* DESCRIPTION
* This implementation of readchar() uses parts of the program dvips
* written by Tomas Rokicki--the inventor of the pkformat--(loadfont.c,
* download.c and unpack.c). Dvips in turn is derived from pktype.
* Pktype(TeX) is described in debt in ``The PKtype processor'',
* which is available as pktype.weave as part of the METAFONTware.
* What was needed to implement readchar() is rearranged in pkfile.c to
* get more modularity in the style of MODULA2.
* BUGFIXES
* May 1997: Eric Delaunay <delaunay@lix.polytechnique.fr> reports a
* problem with huge fonts (greater than 1008 DPI). The code for
* handling PK characters in `extended format' was wrongly derived
* from dvips. Made some minor improvements regarding error handling.
* REDESIGN
* Piet Tutelaers
* rcpt@urc.tue.nl
*
* Modified for use with pdftex by Han The Thanh <thanh@fi.muni.cz>.
*/
#include "ptexlib.h"
#include "luatexfont.h"
static const char _svn_version[] =
"$Id: pkin.c 2271 2009-04-12 23:42:21Z oneiros $ $URL: http://foundry.supelec.fr/svn/luatex/tags/beta-0.40.3/source/texk/web2c/luatexdir/font/pkin.c $";
/*
* Now we have some routines to get stuff from the pk file. pkbyte returns
* the next byte from the pk file.
*/
static shalfword pkbyte(void)
{
register shalfword i;
i = t3_getchar();
if (t3_eof())
pdftex_fail("unexpected eof in pk file");
return (i);
}
static integer pkduo(void)
{
register integer i;
i = pkbyte();
if (i > 127)
i -= 256;
i = i * 256 + pkbyte();
return (i);
}
static integer pktrio(void)
{
register integer i;
i = pkbyte();
if (i > 127)
i -= 256;
i = i * 256 + pkbyte();
i = i * 256 + pkbyte();
return (i);
}
static integer pkquad(void)
{
register integer i;
i = pkbyte();
if (i > 127)
i -= 256;
i = i * 256 + pkbyte();
i = i * 256 + pkbyte();
i = i * 256 + pkbyte();
return (i);
}
/*
* The next part is devoted to unpacking the character data.
*/
/*
* We need procedures to get a nybble, bit, and packed word from the
* packed data structure.
*/
static halfword inputbyte, flagbyte;
static halfword bitweight;
static halfword dynf;
static halfword repeatcount;
static shalfword getnyb(void)
{
halfword temp;
if (bitweight == 0) {
bitweight = 16;
inputbyte = pkbyte();
temp = inputbyte >> 4;
} else {
bitweight = 0;
temp = inputbyte & 15;
}
return (temp);
}
static boolean getbit(void)
{
bitweight >>= 1;
if (bitweight == 0) {
inputbyte = pkbyte();
bitweight = 128;
}
return (inputbyte & bitweight);
}
static halfword(*realfunc) (void);
long pk_remainder;
static halfword handlehuge(halfword i, halfword k);
static halfword pkpackednum(void)
{
register halfword i, j;
i = getnyb();
if (i == 0) {
do {
j = getnyb();
i++;
} while (!(j != 0));
if (i > 3) {
/*
* Damn, we got a huge count! We *fake* it by giving an artificially
* large repeat count.
*/
return (handlehuge(i, j));
} else {
while (i > 0) {
j = j * 16 + getnyb();
i--;
}
return (j - 15 + (13 - dynf) * 16 + dynf);
}
} else if (i <= dynf)
return (i);
else if (i < 14)
return ((i - dynf - 1) * 16 + getnyb() + dynf + 1);
else {
if (i == 14)
repeatcount = pkpackednum();
else
repeatcount = 1;
#ifdef DEBUG
printf("[%d]", (int) repeatcount);
#endif
return ((*realfunc) ());
}
}
static halfword rest(void)
{
halfword i;
if (pk_remainder < 0) {
pk_remainder = -pk_remainder;
return (0);
} else if (pk_remainder > 0) {
if (pk_remainder > 4000) {
pk_remainder = 4000 - pk_remainder;
return (4000);
} else {
i = pk_remainder;
pk_remainder = 0;
realfunc = pkpackednum;
return (i);
}
} else {
pdftex_fail("shouldn't happen");
return 0;
/*NOTREACHED*/}
}
static halfword handlehuge(halfword i, halfword k)
{
register long j = k;
while (i) {
j = (j << 4L) + getnyb();
i--;
}
pk_remainder = j - 15 + (13 - dynf) * 16 + dynf;
realfunc = rest;
return (rest());
}
/*
* And now we have our unpacking routine.
*/
static halfword gpower[17] = { 0, 1, 3, 7, 15, 31, 63, 127,
255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535
};
static void unpack(chardesc * cd)
{
register integer i, j;
register halfword word, wordweight;
halfword *raster;
shalfword rowsleft;
boolean turnon;
shalfword hbit;
halfword count;
shalfword wordwidth;
wordwidth = (cd->cwidth + 15) / 16;
i = 2 * cd->cheight * (long) wordwidth;
if (i <= 0)
i = 2;
if (i > cd->rastersize) {
xfree(cd->raster);
cd->rastersize = i;
cd->raster = xtalloc(cd->rastersize, halfword);
}
raster = cd->raster;
realfunc = pkpackednum;
dynf = flagbyte / 16;
turnon = flagbyte & 8;
if (dynf == 14) {
bitweight = 0;
for (i = 1; i <= cd->cheight; i++) {
word = 0;
wordweight = 32768;
for (j = 1; j <= cd->cwidth; j++) {
if (getbit())
word += wordweight;
wordweight >>= 1;
if (wordweight == 0) {
*raster++ = word;
word = 0;
wordweight = 32768;
}
}
if (wordweight != 32768)
*raster++ = word;
}
} else {
rowsleft = cd->cheight;
hbit = cd->cwidth;
repeatcount = 0;
wordweight = 16;
word = 0;
bitweight = 0;
while (rowsleft > 0) {
count = (*realfunc) ();
#ifdef DEBUG
if (turnon)
printf("(%d) ", (int) count);
else
printf("%d ", (int) count);
#endif
while (count != 0) {
if ((count < wordweight) && (count < hbit)) {
if (turnon)
word += gpower[wordweight] - gpower[wordweight - count];
hbit -= count;
wordweight -= count;
count = 0;
} else if ((count >= hbit) && (hbit <= wordweight)) {
if (turnon)
word += gpower[wordweight] - gpower[wordweight - hbit];
*raster++ = word;
for (i = 1; i <= repeatcount; i++) {
for (j = 1; j <= wordwidth; j++) {
*raster = *(raster - wordwidth);
raster++;
}
}
rowsleft -= repeatcount + 1;
repeatcount = 0;
word = 0;
wordweight = 16;
count -= hbit;
hbit = cd->cwidth;
} else {
if (turnon)
word += gpower[wordweight];
*raster++ = word;
word = 0;
count -= wordweight;
hbit -= wordweight;
wordweight = 16;
}
}
turnon = !turnon;
}
if ((rowsleft != 0) || ((integer) hbit != cd->cwidth))
pdftex_fail("error while unpacking; more bits than required");
}
}
/*
* readchar(): the main routine
* Reads the character definition of character `c' into `cd' if available,
* return FALSE (0) otherwise.
*/
/*
* readchar(): the main routine
* check pk preamble if necessary,
* read the next character definition into `cd',
* return EOF if no character definition is available
*/
int readchar(boolean check_preamble, chardesc * cd)
{
register shalfword i;
register integer k;
register integer length = 0;
/*
* Check the preamble of the pkfile
*/
if (check_preamble) {
if (pkbyte() != 247)
pdftex_fail("bad pk file, expected pre");
if (pkbyte() != 89)
pdftex_fail("bad version of pk file");
for (i = pkbyte(); i > 0; i--) /* creator of pkfile */
(void) pkbyte();
(void) pkquad(); /* design size */
k = pkquad(); /* checksum */
k = pkquad(); /* hppp */
k = pkquad(); /* vppp */
}
/*
* Now we skip to the desired character definition
*/
while ((flagbyte = pkbyte()) != 245) {
if (flagbyte < 240) {
switch (flagbyte & 7) {
case 0:
case 1:
case 2:
case 3:
length = (flagbyte & 7) * 256 + pkbyte() - 3;
cd->charcode = pkbyte();
(void) pktrio(); /* TFMwidth */
cd->xescape = pkbyte(); /* pixel width */
cd->cwidth = pkbyte();
cd->cheight = pkbyte();
cd->xoff = pkbyte();
cd->yoff = pkbyte();
if (cd->xoff > 127)
cd->xoff -= 256;
if (cd->yoff > 127)
cd->yoff -= 256;
break;
case 4:
case 5:
case 6:
length = (flagbyte & 3) * 65536L + pkbyte() * 256L;
length = length + pkbyte() - 4L;
cd->charcode = pkbyte();
(void) pktrio(); /* TFMwidth */
cd->xescape = pkduo(); /* pixelwidth */
cd->cwidth = pkduo();
cd->cheight = pkduo();
cd->xoff = pkduo();
cd->yoff = pkduo();
break;
case 7:
length = pkquad() - 9L;
cd->charcode = pkquad();
(void) pkquad(); /* TFMwidth */
cd->xescape = pkquad(); /* pixelwidth */
k = pkquad();
cd->cwidth = pkquad();
cd->cheight = pkquad();
cd->xoff = pkquad();
cd->yoff = pkquad();
}
if (length <= 0)
pdftex_fail("packet length (%i) too small", (int) length);
unpack(cd);
return 1;
} else {
k = 0;
switch (flagbyte) {
case 243:
k = pkbyte();
if (k > 127)
k -= 256;
case 242:
k = k * 256 + pkbyte();
case 241:
k = k * 256 + pkbyte();
case 240:
k = k * 256 + pkbyte();
while (k-- > 0)
i = pkbyte();
break;
case 244:
k = pkquad();
break;
case 246:
break;
default:
pdftex_fail("unexpected command (%i)", (int) flagbyte);
}
}
}
return 0; /* character not found */
}
|