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
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
|
/* Copyright (C) 1990, 1996, 1997, 1998, 1999, 2000 Aladdin Enterprises. All rights reserved.
This software is provided AS-IS with no warranty, either express or
implied.
This software is distributed under license and may not be copied,
modified or distributed except as expressly authorized under the terms
of the license contained in the file LICENSE in this distribution.
For more information about licensing, please refer to
http://www.ghostscript.com/licensing/. For information on
commercial licensing, go to http://www.artifex.com/licensing/ or
contact Artifex Software, Inc., 101 Lucas Valley Road #110,
San Rafael, CA 94903, U.S.A., +1(415)492-9861.
*/
/* $Id$ */
/* Level 2 / Display PostScript graphics extensions */
#include "ghost.h"
#include "oper.h"
#include "gsmatrix.h"
#include "gspath.h"
#include "gspath2.h"
#include "gsstate.h"
#include "ialloc.h"
#include "igstate.h"
#include "ivmspace.h"
#include "store.h"
#include "stream.h"
#include "ibnum.h"
/* Forward references */
private int gstate_unshare(P1(i_ctx_t *));
/* Structure descriptors */
public_st_igstate_obj();
/* Extend the `copy' operator to deal with gstates. */
/* This is done with a hack -- we know that gstates are the only */
/* t_astruct subtype that implements copy. */
private int
z1copy(i_ctx_t *i_ctx_p)
{
os_ptr op = osp;
int code = zcopy(i_ctx_p);
if (code >= 0)
return code;
if (!r_has_type(op, t_astruct))
return code;
return zcopy_gstate(i_ctx_p);
}
/* ------ Graphics state ------ */
/* <bool> setstrokeadjust - */
private int
zsetstrokeadjust(i_ctx_t *i_ctx_p)
{
os_ptr op = osp;
check_type(*op, t_boolean);
gs_setstrokeadjust(igs, op->value.boolval);
pop(1);
return 0;
}
/* - currentstrokeadjust <bool> */
private int
zcurrentstrokeadjust(i_ctx_t *i_ctx_p)
{
os_ptr op = osp;
push(1);
make_bool(op, gs_currentstrokeadjust(igs));
return 0;
}
/* ------ Graphics state objects ------ */
/*
* Check to make sure that all the elements of a graphics state
* can be stored in the given allocation space.
*/
/* ****** DOESN'T CHECK THE NON-REFS. ****** */
private int
gstate_check_space(i_ctx_t *i_ctx_p, int_gstate *isp, uint space)
{
/*
* ****** WORKAROUND ALERT ******
* This code doesn't check the space of the non-refs, or copy their
* contents, so it can create dangling references from global VM to
* local VM. Because of this, we simply disallow writing into gstates
* in global VM (including creating them in the first place) if the
* save level is greater than 0.
* ****** WORKAROUND ALERT ******
*/
#if 1 /* ****** WORKAROUND ****** */
if (space != avm_local && imemory_save_level(iimemory) > 0)
return_error(e_invalidaccess);
#endif /* ****** END ****** */
#define gsref_check(p) store_check_space(space, p)
int_gstate_map_refs(isp, gsref_check);
#undef gsref_check
return 0;
}
/* - gstate <gstate> */
int
zgstate(i_ctx_t *i_ctx_p)
{
os_ptr op = osp;
int code = gstate_check_space(i_ctx_p, istate, icurrent_space);
igstate_obj *pigo;
gs_state *pnew;
int_gstate *isp;
if (code < 0)
return code;
pigo = ialloc_struct(igstate_obj, &st_igstate_obj, "gstate");
if (pigo == 0)
return_error(e_VMerror);
pnew = gs_state_copy(igs, imemory);
if (pnew == 0) {
ifree_object(pigo, "gstate");
return_error(e_VMerror);
}
isp = gs_int_gstate(pnew);
int_gstate_map_refs(isp, ref_mark_new);
push(1);
/*
* Since igstate_obj isn't a ref, but only contains a ref, save won't
* clear its l_new bit automatically, and restore won't set it
* automatically; we have to make sure this ref is on the changes chain.
*/
make_iastruct(op, a_all, pigo);
make_null(&pigo->gstate);
ref_save(op, &pigo->gstate, "gstate");
make_istruct_new(&pigo->gstate, 0, pnew);
return 0;
}
/* copy for gstates */
int
zcopy_gstate(i_ctx_t *i_ctx_p)
{
os_ptr op = osp;
os_ptr op1 = op - 1;
gs_state *pgs;
gs_state *pgs1;
int_gstate *pistate;
gs_memory_t *mem;
int code;
check_stype(*op, st_igstate_obj);
check_stype(*op1, st_igstate_obj);
check_write(*op);
code = gstate_unshare(i_ctx_p);
if (code < 0)
return code;
pgs = igstate_ptr(op);
pgs1 = igstate_ptr(op1);
pistate = gs_int_gstate(pgs);
code = gstate_check_space(i_ctx_p, gs_int_gstate(pgs1), r_space(op));
if (code < 0)
return code;
#define gsref_save(p) ref_save(op, p, "copygstate")
int_gstate_map_refs(pistate, gsref_save);
#undef gsref_save
mem = gs_state_swap_memory(pgs, imemory);
code = gs_copygstate(pgs, pgs1);
gs_state_swap_memory(pgs, mem);
if (code < 0)
return code;
int_gstate_map_refs(pistate, ref_mark_new);
*op1 = *op;
pop(1);
return 0;
}
/* <gstate> currentgstate <gstate> */
int
zcurrentgstate(i_ctx_t *i_ctx_p)
{
os_ptr op = osp;
gs_state *pgs;
int_gstate *pistate;
int code;
gs_memory_t *mem;
check_stype(*op, st_igstate_obj);
check_write(*op);
code = gstate_unshare(i_ctx_p);
if (code < 0)
return code;
pgs = igstate_ptr(op);
pistate = gs_int_gstate(pgs);
code = gstate_check_space(i_ctx_p, istate, r_space(op));
if (code < 0)
return code;
#define gsref_save(p) ref_save(op, p, "currentgstate")
int_gstate_map_refs(pistate, gsref_save);
#undef gsref_save
mem = gs_state_swap_memory(pgs, imemory);
code = gs_currentgstate(pgs, igs);
gs_state_swap_memory(pgs, mem);
if (code < 0)
return code;
int_gstate_map_refs(pistate, ref_mark_new);
return 0;
}
/* <gstate> setgstate - */
int
zsetgstate(i_ctx_t *i_ctx_p)
{
os_ptr op = osp;
int code;
check_stype(*op, st_igstate_obj);
check_read(*op);
code = gs_setgstate(igs, igstate_ptr(op));
if (code < 0)
return code;
pop(1);
return 0;
}
/* ------ Rectangles ------- */
/*
* We preallocate a short list for rectangles, because
* the rectangle operators usually will involve very few rectangles.
*/
#define MAX_LOCAL_RECTS 5
typedef struct local_rects_s {
gs_rect *pr;
uint count;
gs_rect rl[MAX_LOCAL_RECTS];
} local_rects_t;
/* Forward references */
private int rect_get(P3(local_rects_t *, os_ptr, gs_memory_t *));
private void rect_release(P2(local_rects_t *, gs_memory_t *));
/* <x> <y> <width> <height> .rectappend - */
/* <numarray|numstring> .rectappend - */
private int
zrectappend(i_ctx_t *i_ctx_p)
{
os_ptr op = osp;
local_rects_t lr;
int npop = rect_get(&lr, op, imemory);
int code;
if (npop < 0)
return npop;
code = gs_rectappend(igs, lr.pr, lr.count);
rect_release(&lr, imemory);
if (code < 0)
return code;
pop(npop);
return 0;
}
/* <x> <y> <width> <height> rectclip - */
/* <numarray|numstring> rectclip - */
private int
zrectclip(i_ctx_t *i_ctx_p)
{
os_ptr op = osp;
local_rects_t lr;
int npop = rect_get(&lr, op, imemory);
int code;
if (npop < 0)
return npop;
code = gs_rectclip(igs, lr.pr, lr.count);
rect_release(&lr, imemory);
if (code < 0)
return code;
pop(npop);
return 0;
}
/* <x> <y> <width> <height> rectfill - */
/* <numarray|numstring> rectfill - */
private int
zrectfill(i_ctx_t *i_ctx_p)
{
os_ptr op = osp;
local_rects_t lr;
int npop = rect_get(&lr, op, imemory);
int code;
if (npop < 0)
return npop;
code = gs_rectfill(igs, lr.pr, lr.count);
rect_release(&lr, imemory);
if (code < 0)
return code;
pop(npop);
return 0;
}
/* <x> <y> <width> <height> rectstroke - */
/* <numarray|numstring> rectstroke - */
private int
zrectstroke(i_ctx_t *i_ctx_p)
{
os_ptr op = osp;
gs_matrix mat;
local_rects_t lr;
int npop, code;
if (read_matrix(op, &mat) >= 0) {
/* Concatenate the matrix to the CTM just before stroking the path. */
npop = rect_get(&lr, op - 1, imemory);
if (npop < 0)
return npop;
code = gs_rectstroke(igs, lr.pr, lr.count, &mat);
npop++;
} else {
/* No matrix. */
npop = rect_get(&lr, op, imemory);
if (npop < 0)
return npop;
code = gs_rectstroke(igs, lr.pr, lr.count, (gs_matrix *) 0);
}
rect_release(&lr, imemory);
if (code < 0)
return code;
pop(npop);
return 0;
}
/* --- Internal routines --- */
/* Get rectangles from the stack. */
/* Return the number of elements to pop (>0) if OK, <0 if error. */
private int
rect_get(local_rects_t * plr, os_ptr op, gs_memory_t *mem)
{
int format, code;
uint n, count;
gs_rect *pr;
double rv[4];
switch (r_type(op)) {
case t_array:
case t_mixedarray:
case t_shortarray:
case t_string:
code = num_array_format(op);
if (code < 0)
return code;
format = code;
count = num_array_size(op, format);
if (count % 4)
return_error(e_rangecheck);
count /= 4;
break;
default: /* better be 4 numbers */
code = num_params(op, 4, rv);
if (code < 0)
return code;
plr->pr = plr->rl;
plr->count = 1;
plr->rl[0].q.x = (plr->rl[0].p.x = rv[0]) + rv[2];
plr->rl[0].q.y = (plr->rl[0].p.y = rv[1]) + rv[3];
return 4;
}
plr->count = count;
if (count <= MAX_LOCAL_RECTS)
pr = plr->rl;
else {
pr = (gs_rect *)gs_alloc_byte_array(mem, count, sizeof(gs_rect),
"rect_get");
if (pr == 0)
return_error(e_VMerror);
}
plr->pr = pr;
for (n = 0; n < count; n++, pr++) {
ref rnum;
int i;
for (i = 0; i < 4; i++) {
code = num_array_get((const ref *)op, format,
(n << 2) + i, &rnum);
switch (code) {
case t_integer:
rv[i] = rnum.value.intval;
break;
case t_real:
rv[i] = rnum.value.realval;
break;
default: /* code < 0 */
return code;
}
}
pr->q.x = (pr->p.x = rv[0]) + rv[2];
pr->q.y = (pr->p.y = rv[1]) + rv[3];
}
return 1;
}
/* Release the rectangle list if needed. */
private void
rect_release(local_rects_t * plr, gs_memory_t *mem)
{
if (plr->pr != plr->rl)
gs_free_object(mem, plr->pr, "rect_release");
}
/* ------ Graphics state ------ */
/* <llx> <lly> <urx> <ury> setbbox - */
int
zsetbbox(i_ctx_t *i_ctx_p)
{
os_ptr op = osp;
double box[4];
int code = num_params(op, 4, box);
if (code < 0)
return code;
if ((code = gs_setbbox(igs, box[0], box[1], box[2], box[3])) < 0)
return code;
pop(4);
return 0;
}
/* ------ Initialization procedure ------ */
const op_def zdps1_l2_op_defs[] =
{
op_def_begin_level2(),
/* Graphics state */
{"0currentstrokeadjust", zcurrentstrokeadjust},
{"1setstrokeadjust", zsetstrokeadjust},
/* Graphics state objects */
{"1copy", z1copy},
{"1currentgstate", zcurrentgstate},
{"0gstate", zgstate},
{"1setgstate", zsetgstate},
/* Rectangles */
{"1.rectappend", zrectappend},
{"1rectclip", zrectclip},
{"1rectfill", zrectfill},
{"1rectstroke", zrectstroke},
/* Graphics state components */
{"4setbbox", zsetbbox},
op_def_end(0)
};
/* ------ Internal routines ------ */
/* Ensure that a gstate is not shared with an outer save level. */
/* *op is of type t_astruct(igstate_obj). */
private int
gstate_unshare(i_ctx_t *i_ctx_p)
{
os_ptr op = osp;
ref *pgsref = &r_ptr(op, igstate_obj)->gstate;
gs_state *pgs = r_ptr(pgsref, gs_state);
gs_state *pnew;
int_gstate *isp;
if (!ref_must_save(pgsref))
return 0;
/* Copy the gstate. */
pnew = gs_gstate(pgs);
if (pnew == 0)
return_error(e_VMerror);
isp = gs_int_gstate(pnew);
int_gstate_map_refs(isp, ref_mark_new);
ref_do_save(op, pgsref, "gstate_unshare");
make_istruct_new(pgsref, 0, pnew);
return 0;
}
|