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
|
/* Copyright (C) 1989, 1995, 1996, 1997, 1998, 1999 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.
*/
/* Debugging support for Ghostscript interpreter */
/* This file must always be compiled with DEBUG set. */
#undef DEBUG
#define DEBUG
#include "string_.h"
#include "ghost.h"
#include "ialloc.h" /* for imemory for getting struct type */
#include "idebug.h" /* defines interface */
#include "idict.h"
#include "iname.h"
#include "ipacked.h"
#include "istack.h"
#include "iutil.h"
#include "ivmspace.h"
#include "opdef.h"
/* Table of type name strings */
static const char *const type_strings[] = {
REF_TYPE_DEBUG_PRINT_STRINGS
};
/* First unassigned type index */
extern const int tx_next_index; /* in interp.c */
/* Print a name. */
void
debug_print_name(const ref * pnref)
{
ref sref;
name_string_ref(pnref, &sref);
debug_print_string(sref.value.const_bytes, r_size(&sref));
}
/* Print a ref. */
private void
debug_print_full_ref(const ref * pref)
{
uint size = r_size(pref);
ref nref;
dprintf1("(%x)", r_type_attrs(pref));
switch (r_type(pref)) {
case t_array:
dprintf2("array(%u)0x%lx", size, (ulong) pref->value.refs);
break;
case t_astruct:
goto strct;
case t_boolean:
dprintf1("boolean %x", pref->value.boolval);
break;
case t_device:
dprintf1("device 0x%lx", (ulong) pref->value.pdevice);
break;
case t_dictionary:
dprintf3("dict(%u/%u)0x%lx",
dict_length(pref), dict_maxlength(pref),
(ulong) pref->value.pdict);
break;
case t_file:
dprintf1("file 0x%lx", (ulong) pref->value.pfile);
break;
case t_fontID:
goto strct;
case t_integer:
dprintf1("int %ld", pref->value.intval);
break;
case t_mark:
dprintf("mark");
break;
case t_mixedarray:
dprintf2("mixed packedarray(%u)0x%lx", size,
(ulong) pref->value.packed);
break;
case t_name:
dprintf2("name(0x%lx#%u)", (ulong) pref->value.pname,
name_index(pref));
debug_print_name(pref);
break;
case t_null:
dprintf("null");
break;
case t_oparray:
dprintf2("op_array(%u)0x%lx:", size, (ulong) pref->value.const_refs);
{
const op_array_table *opt = op_index_op_array_table(size);
name_index_ref(opt->nx_table[size - opt->base_index], &nref);
}
debug_print_name(&nref);
break;
case t_operator:
dprintf1("op(%u", size);
if (size > 0 && size < op_def_count) /* just in case */
dprintf1(":%s", (const char *)(op_index_def(size)->oname + 1));
dprintf1(")0x%lx", (ulong) pref->value.opproc);
break;
case t_real:
dprintf1("real %f", pref->value.realval);
break;
case t_save:
dprintf1("save %lu", pref->value.saveid);
break;
case t_shortarray:
dprintf2("short packedarray(%u)0x%lx", size,
(ulong) pref->value.packed);
break;
case t_string:
dprintf2("string(%u)0x%lx", size, (ulong) pref->value.bytes);
break;
case t_struct:
strct:{
obj_header_t *obj = (obj_header_t *) pref->value.pstruct;
dprintf2("struct %s 0x%lx",
(r_is_foreign(pref) ? "-foreign-" :
gs_struct_type_name_string(gs_object_type(imemory, obj))),
(ulong) obj);
}
break;
default:
dprintf1("type 0x%x", r_type(pref));
}
}
private void
debug_print_packed_ref(const ref_packed * pref)
{
ushort elt = *pref & packed_value_mask;
ref nref;
switch (*pref >> r_packed_type_shift) {
case pt_executable_operator:
dprintf("<op_name>");
op_index_ref(elt, &nref);
debug_print_ref(&nref);
break;
case pt_integer:
dprintf1("<int> %d", (int)elt + packed_min_intval);
break;
case pt_literal_name:
dprintf("<lit_name>");
goto ptn;
case pt_executable_name:
dprintf("<exec_name>");
ptn:name_index_ref(elt, &nref);
dprintf2("(0x%lx#%u)", (ulong) nref.value.pname, elt);
debug_print_name(&nref);
break;
default:
dprintf2("<packed_%d?>0x%x", *pref >> r_packed_type_shift, elt);
}
}
void
debug_print_ref(const ref * pref)
{
if (r_is_packed(pref))
debug_print_packed_ref((const ref_packed *)pref);
else
debug_print_full_ref(pref);
fflush(dstderr);
}
/* Dump one ref. */
private void print_ref_data(P1(const ref *));
void
debug_dump_one_ref(const ref * p)
{
uint attrs = r_type_attrs(p);
uint type = r_type(p);
static const attr_print_mask apm[] = {
attr_print_masks,
{0, 0, 0}
};
const attr_print_mask *ap = apm;
if (type >= tx_next_index)
dprintf1("0x%02x?? ", type);
else if (type >= t_next_index)
dprintf("opr* ");
else
dprintf1("%s ", type_strings[type]);
for (; ap->mask; ++ap)
if ((attrs & ap->mask) == ap->value)
dputc(ap->print);
dprintf2(" 0x%04x 0x%08lx", r_size(p), *(const ulong *)&p->value);
print_ref_data(p);
fflush(dstderr);
}
private void
print_ref_data(const ref *p)
{
#define BUF_SIZE 30
byte buf[BUF_SIZE + 1];
const byte *pchars;
uint plen;
if (obj_cvs(p, buf, countof(buf) - 1, &plen, &pchars) >= 0 &&
pchars == buf &&
((buf[plen] = 0), strcmp((char *)buf, "--nostringval--"))
)
dprintf1(" = %s", (char *)buf);
#undef BUF_SIZE
}
/* Dump a region of memory containing refs. */
void
debug_dump_refs(const ref * from, uint size, const char *msg)
{
const ref *p = from;
uint count = size;
if (size && msg)
dprintf2("%s at 0x%lx:\n", msg, (ulong) from);
while (count--) {
dprintf2("0x%lx: 0x%04x ", (ulong)p, r_type_attrs(p));
debug_dump_one_ref(p);
dputc('\n');
p++;
}
}
/* Dump a stack. */
void
debug_dump_stack(const ref_stack_t * pstack, const char *msg)
{
uint i;
const char *m = msg;
for (i = ref_stack_count(pstack); i != 0;) {
const ref *p = ref_stack_index(pstack, --i);
if (m) {
dprintf2("%s at 0x%lx:\n", m, (ulong) pstack);
m = NULL;
}
dprintf2("0x%lx: 0x%02x ", (ulong)p, r_type(p));
debug_dump_one_ref(p);
dputc('\n');
}
}
/* Dump an array. */
void
debug_dump_array(const ref * array)
{
const ref_packed *pp;
uint type = r_type(array);
uint len;
switch (type) {
default:
dprintf2("%s at 0x%lx isn't an array.\n",
(type < countof(type_strings) ?
type_strings[type] : "????"),
(ulong) array);
return;
case t_oparray:
/* This isn't really an array, but we'd like to see */
/* its contents anyway. */
debug_dump_array(array->value.const_refs);
return;
case t_array:
case t_mixedarray:
case t_shortarray:
;
}
/* This "packed" loop works for all array-types. */
for (len = r_size(array), pp = array->value.packed;
len > 0;
len--, pp = packed_next(pp)) {
ref temp;
packed_get(pp, &temp);
if (r_is_packed(pp)) {
dprintf2("0x%lx* 0x%04x", (ulong)pp, (uint)*pp);
print_ref_data(&temp);
} else {
dprintf2("0x%lx: 0x%02x", (ulong)pp, r_type(&temp));
debug_dump_one_ref(&temp);
}
dputc('\n');
}
}
|
