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
|
/* Copyright (C) 2001-2019 Artifex Software, Inc.
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.
Refer to licensing information at http://www.artifex.com or contact
Artifex Software, Inc., 1305 Grant Avenue - Suite 200, Novato,
CA 94945, U.S.A., +1(415)492-9861, for further information.
*/
/* Generic dictionary stack structure definition */
#ifndef idsdata_INCLUDED
# define idsdata_INCLUDED
#include "isdata.h"
#include "iddstack.h"
/* Define the dictionary stack structure. */
struct dict_stack_s {
ref_stack_t stack; /* the actual stack of dictionaries */
/*
* Switching between Level 1 and Level 2 involves inserting and removing
* globaldict on the dictionary stack. Instead of truly inserting and
* removing entries, we replace globaldict by a copy of systemdict in
* Level 1 mode. min_dstack_size, the minimum number of entries, does not
* change depending on language level; the countdictstack and dictstack
* operators must take this into account.
*/
uint min_size; /* size of stack after clearing */
int userdict_index; /* index of userdict on stack */
/*
* Cache a value for fast checking of def operations.
* If the top entry on the dictionary stack is a writable dictionary,
* dsspace is the space of the dictionary; if it is a non-writable
* dictionary, dsspace = -1. Then def is legal precisely if
* r_space(pvalue) <= dsspace. Note that in order for this trick to work,
* the result of r_space must be a signed integer; some compilers treat
* enums as unsigned, probably in violation of the ANSI standard.
*/
int def_space;
/*
* Cache values for fast name lookup. If the top entry on the dictionary
* stack is a readable dictionary with packed keys, dtop_keys, dtop_npairs,
* and dtop_values are keys.value.packed, npairs, and values.value.refs
* for that dictionary; otherwise, these variables point to a dummy
* empty dictionary.
*/
const ref_packed *top_keys;
uint top_npairs;
ref *top_values;
/*
* Cache a copy of the bottom entry on the stack, which is never deleted.
*/
ref system_dict;
};
/*
* The top-entry pointers are recomputed after garbage collection, so we
* don't declare them as pointers.
*/
#define public_st_dict_stack() /* in interp.c */\
gs_public_st_suffix_add0(st_dict_stack, dict_stack_t, "dict_stack_t",\
dict_stack_enum_ptrs, dict_stack_reloc_ptrs, st_ref_stack)
#define st_dict_stack_num_ptrs st_ref_stack_num_ptrs
#endif /* idsdata_INCLUDED */
|
GitWeb