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
|
/* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.
Copyright (C) 2002-2014 by Jin-Hwan Cho and Shunsaku Hirata,
the dvipdfmx project team.
Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>
This program 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.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <ctype.h>
#include <math.h>
#include <string.h>
#include "system.h"
#include "mem.h"
#include "error.h"
#include "numbers.h"
/* Hash */
#include "dpxutil.h"
#include "pdfobj.h"
#include "pdfnames.h"
#include "dvipdfmx.h"
struct obj_data
{
pdf_obj *object;
int closed; /* 1 if object is closed */
};
static char *
printable_key (const char *key, int keylen)
{
#define MAX_KEY 32
static char pkey[MAX_KEY+4];
int i, len;
unsigned char hi, lo;
for (i = 0, len = 0;
i < keylen && len < MAX_KEY; i++) {
if (isprint((unsigned char)key[i])) {
pkey[len++] = key[i];
} else {
hi = (key[i] >> 4) & 0xff;
lo = key[i] & 0xff;
pkey[len++] = '#';
pkey[len++] = (hi < 10) ? hi + '0' : (hi - 10) + 'A';
pkey[len++] = (lo < 10) ? lo + '0' : (lo - 10) + 'A';
}
}
pkey[len] = '\0';
return (char *) pkey;
}
static void CDECL
hval_free (void *hval)
{
struct obj_data *value;
value = (struct obj_data *) hval;
if (value->object) {
pdf_release_obj(value->object);
value->object = NULL;
}
RELEASE(value);
return;
}
struct ht_table *
pdf_new_name_tree (void)
{
struct ht_table *names;
names = NEW(1, struct ht_table);
ht_init_table(names, hval_free);
return names;
}
static void
check_objects_defined (struct ht_table *ht_tab)
{
struct ht_iter iter;
if (ht_set_iter(ht_tab, &iter) >= 0) {
do {
char *key;
int keylen;
struct obj_data *value;
key = ht_iter_getkey(&iter, &keylen);
value = ht_iter_getval(&iter);
ASSERT(value->object);
if (PDF_OBJ_UNDEFINED(value->object)) {
pdf_names_add_object(ht_tab, key, keylen, pdf_new_null());
WARN("Object @%s used, but not defined. Replaced by null.",
printable_key(key, keylen));
}
} while (ht_iter_next(&iter) >= 0);
ht_clear_iter(&iter);
}
}
void
pdf_delete_name_tree (struct ht_table **names)
{
ASSERT(names && *names);
check_objects_defined (*names);
ht_clear_table(*names);
RELEASE(*names);
*names = NULL;
}
int
pdf_names_add_object (struct ht_table *names,
const void *key, int keylen, pdf_obj *object)
{
struct obj_data *value;
ASSERT(names && object);
if (!key || keylen < 1) {
WARN("Null string used for name tree key.");
return -1;
}
value = ht_lookup_table(names, key, keylen);
if (!value) {
value = NEW(1, struct obj_data);
value->object = object;
value->closed = 0;
ht_append_table(names, key, keylen, value);
} else {
ASSERT(value->object);
if (PDF_OBJ_UNDEFINED(value->object)) {
pdf_transfer_label(object, value->object);
pdf_release_obj(value->object);
value->object = object;
} else {
WARN("Object @%s already defined.", printable_key(key, keylen));
pdf_release_obj(object);
return -1;
}
}
return 0;
}
/*
* The following routine returns copies, not the original object.
*/
pdf_obj *
pdf_names_lookup_reference (struct ht_table *names,
const void *key, int keylen)
{
struct obj_data *value;
pdf_obj *object;
ASSERT(names);
value = ht_lookup_table(names, key, keylen);
if (value) {
object = value->object;
ASSERT(object);
} else {
/* A null object as dummy would create problems because as value
* of a dictionary entry, a null object is be equivalent to no entry
* at all. This matters for optimization of PDF destinations.
*/
object = pdf_new_undefined();
pdf_names_add_object(names, key, keylen, object);
}
return pdf_ref_obj(object);
}
pdf_obj *
pdf_names_lookup_object (struct ht_table *names,
const void *key, int keylen)
{
struct obj_data *value;
ASSERT(names);
value = ht_lookup_table(names, key, keylen);
if (!value || PDF_OBJ_UNDEFINED(value->object))
return NULL;
ASSERT(value->object);
return value->object;
}
int
pdf_names_close_object (struct ht_table *names,
const void *key, int keylen)
{
struct obj_data *value;
ASSERT(names);
value = ht_lookup_table(names, key, keylen);
if (!value ||PDF_OBJ_UNDEFINED(value->object) ) {
WARN("Cannot close undefined object @%s.", printable_key(key, keylen));
return -1;
}
ASSERT(value->object);
if (value->closed) {
WARN("Object @%s already closed.", printable_key(key, keylen));
return -1;
}
value->closed = 1;
return 0;
}
struct named_object
{
char *key;
int keylen;
pdf_obj *value;
};
static int CDECL
cmp_key (const void *d1, const void *d2)
{
const struct named_object *sd1, *sd2;
int keylen, cmp;
sd1 = (const struct named_object *) d1;
sd2 = (const struct named_object *) d2;
if (!sd1->key)
cmp = -1;
else if (!sd2->key)
cmp = 1;
else {
keylen = MIN(sd1->keylen, sd2->keylen);
cmp = memcmp(sd1->key, sd2->key, keylen);
if (!cmp) {
cmp = sd1->keylen - sd2->keylen;
}
}
return cmp;
}
#define NAME_CLUSTER 4
static pdf_obj *
build_name_tree (struct named_object *first, long num_leaves, int is_root)
{
pdf_obj *result;
int i;
result = pdf_new_dict();
/*
* According to PDF Refrence, Third Edition (p.101-102), a name tree
* always has exactly one root node, which contains a SINGLE entry:
* either Kids or Names but not both. If the root node has a Names
* entry, it is the only node in the tree. If it has a Kids entry,
* then each of the remaining nodes is either an intermediate node,
* containing a Limits entry and a Kids entry, or a leaf node,
* containing a Limits entry and a Names entry.
*/
if (!is_root) {
struct named_object *last;
pdf_obj *limits;
limits = pdf_new_array();
last = &first[num_leaves - 1];
pdf_add_array(limits, pdf_new_string(first->key, first->keylen));
pdf_add_array(limits, pdf_new_string(last->key , last->keylen ));
pdf_add_dict (result, pdf_new_name("Limits"), limits);
}
if (num_leaves > 0 &&
num_leaves <= 2 * NAME_CLUSTER) {
pdf_obj *names;
/* Create leaf nodes. */
names = pdf_new_array();
for (i = 0; i < num_leaves; i++) {
struct named_object *cur;
cur = &first[i];
pdf_add_array(names, pdf_new_string(cur->key, cur->keylen));
switch (PDF_OBJ_TYPEOF(cur->value)) {
case PDF_ARRAY:
case PDF_DICT:
case PDF_STREAM:
case PDF_STRING:
pdf_add_array(names, pdf_ref_obj(cur->value));
break;
case PDF_OBJ_INVALID:
ERROR("Invalid object...: %s", printable_key(cur->key, cur->keylen));
default:
pdf_add_array(names, pdf_link_obj(cur->value));
break;
}
pdf_release_obj(cur->value);
cur->value = NULL;
}
pdf_add_dict(result, pdf_new_name("Names"), names);
} else if (num_leaves > 0) {
pdf_obj *kids;
/* Intermediate node */
kids = pdf_new_array();
for (i = 0; i < NAME_CLUSTER; i++) {
pdf_obj *subtree;
long start, end;
start = (i*num_leaves) / NAME_CLUSTER;
end = ((i+1)*num_leaves) / NAME_CLUSTER;
subtree = build_name_tree(&first[start], (end - start), 0);
pdf_add_array (kids, pdf_ref_obj(subtree));
pdf_release_obj(subtree);
}
pdf_add_dict(result, pdf_new_name("Kids"), kids);
}
return result;
}
static struct named_object *
flat_table (struct ht_table *ht_tab, long *num_entries,
struct ht_table *filter)
{
struct named_object *objects;
struct ht_iter iter;
long count;
ASSERT(ht_tab);
objects = NEW(ht_tab->count, struct named_object);
count = 0;
if (ht_set_iter(ht_tab, &iter) >= 0) {
do {
char *key;
int keylen;
struct obj_data *value;
key = ht_iter_getkey(&iter, &keylen);
if (filter) {
pdf_obj *new_obj = ht_lookup_table(filter, key, keylen);
if (!new_obj)
continue;
key = pdf_string_value(new_obj);
keylen = pdf_string_length(new_obj);
}
value = ht_iter_getval(&iter);
ASSERT(value->object);
if (PDF_OBJ_UNDEFINED(value->object)) {
WARN("Object @%s\" not defined. Replaced by null.",
printable_key(key, keylen));
objects[count].key = (char *) key;
objects[count].keylen = keylen;
objects[count].value = pdf_new_null();
} else if (value->object) {
objects[count].key = (char *) key;
objects[count].keylen = keylen;
objects[count].value = pdf_link_obj(value->object);
}
count++;
} while (ht_iter_next(&iter) >= 0);
ht_clear_iter(&iter);
}
*num_entries = count;
objects = RENEW(objects, count, struct named_object);
return objects;
}
pdf_obj *
pdf_names_create_tree (struct ht_table *names, long *count,
struct ht_table *filter)
{
pdf_obj *name_tree;
struct named_object *flat;
flat = flat_table(names, count, filter);
if (!flat)
name_tree = NULL;
else {
qsort(flat, *count, sizeof(struct named_object), cmp_key);
name_tree = build_name_tree(flat, *count, 1);
RELEASE(flat);
}
return name_tree;
}
|