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
|
/* pagetree.c
Copyright 2006-2009 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/>. */
#include "ptexlib.h"
#include "openbsd-compat.h"
#ifdef HAVE_ASPRINTF /* asprintf is not defined in openbsd-compat.h, but in stdio.h */
# include <stdio.h>
#endif
#include "sys/types.h"
#ifndef __MINGW32__
# include "sysexits.h"
#else
# define EX_SOFTWARE 70
#endif
static const char __svn_version[] =
"$Id: pagetree.c 2143 2009-03-28 10:28:15Z hhenkel $ "
"$URL: http://scm.foundry.supelec.fr/svn/luatex/trunk/source/texk/web2c/luatexdir/pdf/pagetree.c $";
/**********************************************************************/
/* Page diversions */
#ifdef DEBUG
# define PAGES_TREE_KIDSMAX 3
#else
# define PAGES_TREE_KIDSMAX 6
#endif
static struct avl_table *divert_list_tree = NULL;
typedef struct pages_entry_ {
integer objnum; /* object number of this /Pages object */
integer number_of_pages; /* total number of all pages below */
integer number_of_kids; /* number of direct kid objects */
integer kids[PAGES_TREE_KIDSMAX]; /* array of kid object numbers */
struct pages_entry_ *next;
} pages_entry;
typedef struct divert_list_entry_ {
integer divnum;
pages_entry *first;
pages_entry *last;
} divert_list_entry;
static int comp_divert_list_entry(const void *pa, const void *pb, void *p)
{
if (((const divert_list_entry *) pa)->divnum >
((const divert_list_entry *) pb)->divnum)
return 1;
if (((const divert_list_entry *) pa)->divnum <
((const divert_list_entry *) pb)->divnum)
return -1;
return 0;
}
static pages_entry *new_pages_entry()
{
pages_entry *p;
int i;
p = xtalloc(1, pages_entry);
p->number_of_pages = p->number_of_kids = 0;
for (i = 0; i < PAGES_TREE_KIDSMAX; i++)
p->kids[i] = 0;
p->next = NULL;
pdf_create_obj(0, 0);
p->objnum = obj_ptr;
return p;
}
static divert_list_entry *new_divert_list_entry()
{
divert_list_entry *d;
d = xtalloc(1, divert_list_entry);
d->first = d->last = NULL;
return d;
}
static void ensure_list_tree()
{
if (divert_list_tree == NULL) {
divert_list_tree =
avl_create(comp_divert_list_entry, NULL, &avl_xallocator);
assert(divert_list_tree != NULL);
}
}
static divert_list_entry *get_divert_list(integer divnum)
{
divert_list_entry *d, tmp;
void **aa;
tmp.divnum = divnum;
d = (divert_list_entry *) avl_find(divert_list_tree, &tmp);
if (d == NULL) {
d = new_divert_list_entry();
d->divnum = divnum;
aa = avl_probe(divert_list_tree, d);
assert(aa != NULL);
}
return d;
}
/* pdf_do_page_divert() returns the current /Parent object number */
integer pdf_do_page_divert(integer objnum, integer divnum)
{
divert_list_entry *d;
pages_entry *p;
#ifdef DEBUG
pages_entry *q;
struct avl_traverser t;
int i;
#endif
// initialize the tree
ensure_list_tree();
// make sure we have a list for this diversion
d = get_divert_list(divnum);
if (d->first == NULL || d->last->number_of_kids == PAGES_TREE_KIDSMAX) {
// append a new pages_entry
p = new_pages_entry();
if (d->first == NULL)
d->first = p;
else
d->last->next = p;
d->last = p;
}
p = d->last;
p->kids[p->number_of_kids++] = objnum;
p->number_of_pages++;
#ifdef DEBUG
printf("\n");
avl_t_init(&t, divert_list_tree);
for (d = avl_t_first(&t, divert_list_tree); d != NULL; d = avl_t_next(&t)) {
printf("===== D-LIST %d: ", d->divnum);
for (q = d->first; q != NULL; q = q->next) {
printf("P=%d NK=%d (", q->objnum, q->number_of_kids);
for (i = 0; i < q->number_of_kids; i++)
printf("%d ", q->kids[i]);
printf(") ");
}
printf("\n");
}
printf("\n");
#endif
return p->objnum;
}
static void movelist(divert_list_entry * d, divert_list_entry * dto)
{
if (d != NULL && d->first != NULL && d->divnum != dto->divnum) { /* no undivert of empty list or into self */
if (dto->first == NULL)
dto->first = d->first;
else
dto->last->next = d->first;
dto->last = d->last;
d->first = d->last = NULL; /* one could as well remove this divert_list_entry */
}
}
/* undivert from diversion <divnum> into diversion <curdivnum> */
void pdf_do_page_undivert(integer divnum, integer curdivnum)
{
divert_list_entry *d, *dto, tmp;
struct avl_traverser t;
#ifdef DEBUG
pages_entry *p;
int i;
#endif
// initialize the tree
ensure_list_tree();
// find the diversion <curdivnum> list where diversion <divnum> should go
dto = get_divert_list(curdivnum);
if (divnum == 0) { /* 0 = special case: undivert _all_ lists */
avl_t_init(&t, divert_list_tree);
for (d = avl_t_first(&t, divert_list_tree); d != NULL;
d = avl_t_next(&t))
movelist(d, dto);
} else {
tmp.divnum = divnum;
d = (divert_list_entry *) avl_find(divert_list_tree, &tmp);
movelist(d, dto);
}
#ifdef DEBUG
printf("\n");
avl_t_init(&t, divert_list_tree);
for (d = avl_t_first(&t, divert_list_tree); d != NULL; d = avl_t_next(&t)) {
printf("===== U-LIST %d: ", d->divnum);
for (p = d->first; p != NULL; p = p->next) {
printf("P=%d NK=%d (", p->objnum, p->number_of_kids);
for (i = 0; i < p->number_of_kids; i++)
printf("%d ", p->kids[i]);
printf(") ");
}
printf("\n");
}
printf("\n");
#endif
}
/* write a /Pages object */
static void write_pages(pages_entry * p, int parent)
{
int i;
assert(p != NULL);
pdf_begin_dict(p->objnum, 1);
pdf_printf("/Type /Pages\n");
if (parent == 0) /* it's root */
print_pdf_pages_attr();
else
pdf_printf("/Parent %d 0 R\n", parent);
pdf_printf("/Count %d\n/Kids [", (int) p->number_of_pages);
for (i = 0; i < p->number_of_kids; i++)
pdf_printf("%d 0 R ", (int) p->kids[i]);
remove_last_space();
pdf_printf("]\n");
pdf_end_dict();
}
/* loop over all /Pages objects, output them, create their parents,
* recursing bottom up, return the /Pages root object number */
static integer output_pages_list(pages_entry * pe)
{
pages_entry *p, *q, *r;
assert(pe != NULL);
if (pe->next == NULL) { /* everything fits into one pages_entry */
write_pages(pe, 0); /* --> /Pages root found */
return pe->objnum;
}
q = r = new_pages_entry(); /* one level higher needed */
for (p = pe; p != NULL; p = p->next) {
if (q->number_of_kids == PAGES_TREE_KIDSMAX) {
q->next = new_pages_entry();
q = q->next;
}
q->kids[q->number_of_kids++] = p->objnum;
q->number_of_pages += p->number_of_pages;
write_pages(p, q->objnum);
}
return output_pages_list(r); /* recurse through next higher level */
}
integer output_pages_tree()
{
divert_list_entry *d;
pdf_do_page_undivert(0, 0); /* concatenate all diversions into diversion 0 */
d = get_divert_list(0); /* get diversion 0 */
return output_pages_list(d->first);
}
|