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 483 484
|
/* Copyright (C) 1989, 1992, 1993, 1994 Aladdin Enterprises. All rights reserved.
This file is part of GNU Ghostscript.
GNU Ghostscript is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY. No author or distributor accepts responsibility to
anyone for the consequences of using it or for whether it serves any
particular purpose or works at all, unless he says so in writing. Refer
to the GNU Ghostscript General Public License for full details.
*/
/* zgeneric.c */
/* Array/string/dictionary generic operators for PostScript */
#include "memory_.h"
#include "ghost.h"
#include "errors.h"
#include "oper.h"
#include "estack.h" /* for forall */
#include "idict.h"
#include "iname.h"
#include "ipacked.h"
#include "ivmspace.h"
#include "store.h"
/* This file implements copy, get, put, getinterval, putinterval, */
/* length, and forall, which apply generically to */
/* arrays, strings, and dictionaries. (Copy also has a special */
/* meaning for copying the top N elements of the stack.) */
/* See the comment in opdef.h for an invariant which allows */
/* more efficient implementation of forall. */
/* Imported operators */
extern int zcopy_dict(P1(os_ptr));
/* Forward references */
private int zcopy_invalid(P1(os_ptr));
private int zcopy_integer(P1(os_ptr));
private int zcopy_interval(P1(os_ptr));
private int copy_interval(P4(os_ptr, uint, os_ptr, client_name_t));
/* The type dispatch table for `copy'. */
/* We export it so that Level 2 can extend it to handle gstates. */
op_proc_p zcopy_procs[t_next_index];
/* Initialize the generic dispatch table. */
private void
zgeneric_init(void)
{ int i;
for ( i = 0; i < t_next_index; i++ )
zcopy_procs[i] = zcopy_invalid;
/*zcopy_procs[t_integer] = zcopy_integer;*/ /* handled specially */
zcopy_procs[t_array] = zcopy_procs[t_string] = zcopy_interval;
zcopy_procs[t_dictionary] = zcopy_dict;
}
/* <various1> <various2> copy <various> */
/* <obj1> ... <objn> <int> copy <obj1> ... <objn> <obj1> ... <objn> */
/* Note that this implements copy for arrays and strings, */
/* but not for dictionaries (see zcopy_dict in zdict.c). */
private int
zcopy(register os_ptr op)
{ int type = r_type(op);
if ( type == t_integer )
return zcopy_integer(op);
if ( type >= t_next_index )
return_error(e_typecheck);
check_op(2);
return (*zcopy_procs[type])(op);
}
/* <other> copy */
private int
zcopy_invalid(os_ptr op)
{ return_op_typecheck(op);
}
/* <obj1> ... <objn> <int> copy <obj1> ... <objn> <obj1> ... <objn> */
private int
zcopy_integer(register os_ptr op)
{ os_ptr op1 = op - 1;
int count, i;
int code;
if ( (ulong)op->value.intval > op - osbot )
{ /* There might be enough elements in other blocks. */
check_int_ltu(*op, ref_stack_count(&o_stack));
count = op->value.intval;
}
else if ( op1 + (count = op->value.intval) <= ostop )
{ /* Fast case. */
memcpy((char *)op, (char *)(op - count), count * sizeof(ref));
push(count - 1);
return 0;
}
/* Do it the slow, general way. */
code = ref_stack_push(&o_stack, count - 1);
if ( code < 0 )
return code;
for ( i = 0; i < count; i++ )
*ref_stack_index(&o_stack, i) =
*ref_stack_index(&o_stack, i + count);
return 0;
}
/* <array1> <array2> copy <subarray2> */
/* <string1> <string2> copy <substring2> */
private int
zcopy_interval(register os_ptr op)
{ os_ptr op1 = op - 1;
int code = copy_interval(op, 0, op1, "copy");
if ( code < 0 ) return code;
r_set_size(op, r_size(op1));
*op1 = *op;
pop(1);
return 0;
}
/* <array|dict|name|packedarray|string> length <int> */
private int
zlength(register os_ptr op)
{ switch ( r_type(op) )
{
case t_array:
case t_string:
case t_mixedarray:
case t_shortarray:
check_read(*op);
make_int(op, r_size(op));
return 0;
case t_dictionary:
check_dict_read(*op);
make_int(op, dict_length(op));
return 0;
case t_name:
{ ref str;
name_string_ref(op, &str);
make_int(op, r_size(&str));
}
return 0;
default:
return_op_typecheck(op);
}
}
/* <array|packedarray|string> <index> get <obj> */
/* <dict> <key> get <obj> */
private int
zget(register os_ptr op)
{ os_ptr op1 = op - 1;
ref *pvalue;
switch ( r_type(op1) )
{
case t_dictionary:
check_dict_read(*op1);
if ( dict_find(op1, op, &pvalue) <= 0 )
return_error(e_undefined);
op[-1] = *pvalue;
break;
case t_string:
check_read(*op1);
check_int_ltu(*op, r_size(op1));
make_int(op1, op1->value.bytes[(uint)op->value.intval]);
break;
default:
{ int code;
check_type(*op, t_integer);
check_read(*op1);
code = array_get(op1, op->value.intval, op1);
if ( code < 0 )
{ /* Might be a stackunderflow reported as typecheck. */
if ( code == e_typecheck )
return_op_typecheck(op1);
else
return code;
}
}
}
pop(1);
return 0;
}
/* <array> <index> <obj> put - */
/* <dict> <key> <value> put - */
/* <string> <index> <int> put - */
private int
zput(register os_ptr op)
{ os_ptr op1 = op - 1;
os_ptr op2 = op1 - 1;
switch ( r_type(op2) )
{
case t_dictionary:
check_dict_write(*op2);
{ int code = dict_put(op2, op1, op);
if ( code < 0 ) return code; /* error */
}
break;
case t_array:
check_write(*op2);
check_int_ltu(*op1, r_size(op2));
store_check_dest(op2, op);
{ ref *eltp = op2->value.refs + (uint)op1->value.intval;
ref_assign_old(op2, eltp, op, "put");
} break;
case t_mixedarray: /* packed arrays are read-only */
case t_shortarray:
return_error(e_invalidaccess);
case t_string:
check_write(*op2);
check_int_ltu(*op1, r_size(op2));
check_int_leu(*op, 0xff);
op2->value.bytes[(uint)op1->value.intval] = (byte)op->value.intval;
break;
default:
return_op_typecheck(op2);
}
pop(3);
return 0;
}
/* <seq:array|packedarray|string> <index> <count> getinterval <subseq> */
private int
zgetinterval(register os_ptr op)
{ os_ptr op1 = op - 1;
os_ptr op2 = op1 - 1;
uint index;
uint count;
switch ( r_type(op2) )
{
default:
return_op_typecheck(op2);
case t_array: case t_string:
case t_mixedarray:
case t_shortarray: ;
}
check_read(*op2);
check_int_leu(*op1, r_size(op2));
index = op1->value.intval;
check_int_leu(*op, r_size(op2) - index);
count = op->value.intval;
switch ( r_type(op2) )
{
case t_array: op2->value.refs += index; break;
case t_string: op2->value.bytes += index; break;
case t_mixedarray:
{ const ref_packed *packed = op2->value.packed;
for ( ; index--; ) packed = packed_next(packed);
op2->value.packed = packed;
} break;
case t_shortarray: op2->value.packed += index; break;
}
r_set_size(op2, count);
pop(2);
return 0;
}
/* <array1> <index> <array2|packedarray2> putinterval - */
/* <string1> <index> <string2> putinterval - */
private int
zputinterval(register os_ptr op)
{ os_ptr opindex = op - 1;
os_ptr opto = opindex - 1;
int code;
switch ( r_type(opto) )
{
default:
return_op_typecheck(opto);
case t_mixedarray:
case t_shortarray:
return_error(e_invalidaccess);
case t_array:
case t_string:
;
}
check_write(*opto);
check_int_leu(*opindex, r_size(opto));
code = copy_interval(opto, (uint)(opindex->value.intval), op, "putinterval");
if ( code >= 0 ) pop(3);
return code;
}
/* <array|packedarray|string> <<element> proc> forall - */
/* <dict> <<key> <value> proc> forall - */
private int
array_continue(P1(os_ptr)),
dict_continue(P1(os_ptr)),
string_continue(P1(os_ptr)),
packedarray_continue(P1(os_ptr));
private int forall_cleanup(P1(os_ptr));
private int
zforall(register os_ptr op)
{ os_ptr obj = op - 1;
register es_ptr ep = esp;
uint index = 0; /* only used for dictionaries */
check_estack(6);
#define cproc (ep + 5)
switch ( r_type(obj) )
{
default:
return_op_typecheck(obj);
case t_array:
check_read(*obj);
make_op_estack(cproc, array_continue);
break;
case t_dictionary:
check_dict_read(*obj);
make_op_estack(cproc, dict_continue);
index = dict_first(obj);
break;
case t_string:
check_read(*obj);
make_op_estack(cproc, string_continue);
break;
case t_mixedarray:
case t_shortarray:
check_read(*obj);
make_op_estack(cproc, packedarray_continue);
break;
}
check_proc(*op);
/* Push a mark, the composite object, the iteration index, */
/* and the procedure, and invoke the continuation operator. */
make_mark_estack(ep + 1, es_for, forall_cleanup);
ep[2] = *obj;
make_int(ep + 3, index);
ep[4] = *op;
esp += 4;
pop(2); op -= 2;
return (*real_opproc(cproc))(op);
#undef cproc
}
/* Continuation operator for arrays */
private int
array_continue(register os_ptr op)
{ es_ptr obj = esp - 2;
if ( r_size(obj) ) /* continue */
{ push(1);
r_dec_size(obj, 1);
*op = *obj->value.refs;
obj->value.refs++;
esp += 2;
*esp = obj[2];
return o_push_estack;
}
else /* done */
{ esp -= 4; /* pop mark, object, index, proc */
return o_pop_estack;
}
}
/* Continuation operator for dictionaries */
private int
dict_continue(register os_ptr op)
{ es_ptr obj = esp - 2;
int index = (int)esp[-1].value.intval;
push(2); /* make room for key and value */
if ( (index = dict_next(obj, index, op - 1)) >= 0 ) /* continue */
{ esp[-1].value.intval = index;
esp += 2;
*esp = obj[2];
return o_push_estack;
}
else /* done */
{ pop(2); /* undo push */
esp -= 4; /* pop mark, object, index, proc */
return o_pop_estack;
}
}
/* Continuation operator for strings */
private int
string_continue(register os_ptr op)
{ es_ptr obj = esp - 2;
if ( r_size(obj) ) /* continue */
{ r_dec_size(obj, 1);
push(1);
make_int(op, *obj->value.bytes);
obj->value.bytes++;
esp += 2;
*esp = obj[2];
return o_push_estack;
}
else /* done */
{ esp -= 4; /* pop mark, object, index, proc */
return o_pop_estack;
}
}
/* Continuation operator for packed arrays */
private int
packedarray_continue(register os_ptr op)
{ es_ptr obj = esp - 2;
if ( r_size(obj) ) /* continue */
{ const ref_packed *packed = obj->value.packed;
r_dec_size(obj, 1);
push(1);
packed_get(packed, op);
obj->value.packed = packed_next(packed);
esp += 2;
*esp = obj[2];
return o_push_estack;
}
else /* done */
{ esp -= 4; /* pop mark, object, index, proc */
return o_pop_estack;
}
}
/* Vacuous cleanup procedure */
private int
forall_cleanup(os_ptr op)
{ return 0;
}
/* ------ Initialization procedure ------ */
BEGIN_OP_DEFS(zgeneric_op_defs) {
{"1copy", zcopy},
{"2forall", zforall},
{"2get", zget},
{"3getinterval", zgetinterval},
{"1length", zlength},
{"3put", zput},
{"3putinterval", zputinterval},
/* Internal operators */
{"0%array_continue", array_continue},
{"0%dict_continue", dict_continue},
{"0%packedarray_continue", packedarray_continue},
{"0%string_continue", string_continue},
END_OP_DEFS(zgeneric_init) }
/* ------ Shared routines ------ */
/* Copy an interval from one operand to another. */
/* This is used by both putinterval and string/array copy. */
/* The destination is known to be an array or string, */
/* and the starting index is known to be less than or equal to */
/* its length; nothing else has been checked. */
private int
copy_interval(os_ptr prto, uint index, os_ptr prfrom, client_name_t cname)
{ int fromtype = r_type(prfrom);
uint fromsize = r_size(prfrom);
if ( !(fromtype == r_type(prto) ||
((fromtype == t_shortarray || fromtype == t_mixedarray) &&
r_type(prto) == t_array))
)
return_op_typecheck(prfrom);
check_read(*prfrom);
check_write(*prto);
if ( fromsize > r_size(prto) - index )
return_error(e_rangecheck);
switch ( fromtype )
{
case t_array:
{ /* We have to worry about aliasing, */
/* but refcpy_to_old takes care of it for us. */
return refcpy_to_old(prto, index, prfrom->value.refs,
fromsize, cname);
}
case t_string:
{ /* We have to worry about aliasing. */
const byte *from = prfrom->value.bytes;
byte *to = prto->value.bytes + index;
uint i;
if ( from + fromsize <= to || to + fromsize <= from )
memcpy(to, from, fromsize);
else if ( to < from )
for ( i = fromsize; i != 0; i--, from++, to++ )
*to = *from;
else
for ( i = fromsize, from += i, to += i; i != 0; i-- )
*--to = *--from;
} break;
case t_mixedarray:
case t_shortarray:
{ /* We don't have to worry about aliasing, because */
/* packed arrays are read-only and hence the destination */
/* can't be a packed array. */
int i;
const ref_packed *packed = prfrom->value.packed;
ref *pdest = prto->value.refs + index;
ref elt;
for ( i = 0; i < fromsize; i++, pdest++ )
{ packed_get(packed, &elt);
ref_assign_old(prto, pdest, &elt, cname);
packed = packed_next(packed);
}
} break;
}
return 0;
}
|