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
|
/* Copyright (C) 1998, 1999 Aladdin Enterprises. All rights reserved.
This software is licensed to a single customer by Artifex Software Inc.
under the terms of a specific OEM agreement.
*/
/*$RCSfile$ $Revision$ */
/* Name table interface */
#ifndef inames_INCLUDED
# define inames_INCLUDED
/*
* This file defines those parts of the name table API that depend neither
* on the implementation nor on the existence of a single distinguished
* instance. Procedures in this file begin with names_.
*/
/* ---------------- Interface types ---------------- */
#ifndef name_table_DEFINED
# define name_table_DEFINED
typedef struct name_table_s name_table;
#endif
typedef uint name_index_t;
/* ---------------- Constant values ---------------- */
extern const uint name_max_string;
/* ---------------- Procedural interface ---------------- */
#ifndef gs_ref_memory_DEFINED
# define gs_ref_memory_DEFINED
typedef struct gs_ref_memory_s gs_ref_memory_t;
#endif
/* Allocate and initialize a name table. */
name_table *names_init(P2(ulong size, gs_ref_memory_t *imem));
/* Get the allocator for a name table. */
gs_memory_t *names_memory(P1(const name_table * nt));
/*
* Look up and/or enter a name in the name table.
* The values of enterflag are:
* -1 -- don't enter (return an error) if missing;
* 0 -- enter if missing, don't copy the string, which was allocated
* statically;
* 1 -- enter if missing, copy the string;
* 2 -- enter if missing, don't copy the string, which was already
* allocated dynamically (using the names_memory allocator).
* Possible errors: VMerror, limitcheck (if string is too long or if
* we have assigned all possible name indices).
*/
int names_ref(P5(name_table * nt, const byte * ptr, uint size, ref * pnref,
int enterflag));
void names_string_ref(P3(const name_table * nt, const ref * pnref, ref * psref));
/*
* names_enter_string calls names_ref with a (permanent) C string.
*/
int names_enter_string(P3(name_table * nt, const char *str, ref * pnref));
/*
* names_from_string essentially implements cvn.
* It always enters the name, and copies the executable attribute.
*/
int names_from_string(P3(name_table * nt, const ref * psref, ref * pnref));
/* Compare two names for equality. */
#define names_eq(pnref1, pnref2)\
((pnref1)->value.pname == (pnref2)->value.pname)
/* Invalidate the value cache for a name. */
void names_invalidate_value_cache(P2(name_table * nt, const ref * pnref));
/* Convert between names and indices. */
name_index_t names_index(P2(const name_table * nt, const ref * pnref)); /* ref => index */
name *names_index_ptr(P2(const name_table * nt, name_index_t nidx)); /* index => name */
void names_index_ref(P3(const name_table * nt, name_index_t nidx, ref * pnref)); /* index => ref */
/* Get the index of the next valid name. */
/* The argument is 0 or a valid index. */
/* Return 0 if there are no more. */
name_index_t names_next_valid_index(P2(name_table * nt, name_index_t nidx));
/* Mark a name for the garbage collector. */
/* Return true if this is a new mark. */
bool names_mark_index(P2(name_table * nt, name_index_t nidx));
/* Get the object (sub-table) containing a name. */
/* The garbage collector needs this so it can relocate pointers to names. */
void /*obj_header_t */ *
names_ref_sub_table(P2(name_table * nt, const ref * pnref));
void /*obj_header_t */ *
names_index_sub_table(P2(name_table * nt, name_index_t nidx));
void /*obj_header_t */ *
names_index_string_sub_table(P2(name_table * nt, name_index_t nidx));
#endif /* inames_INCLUDED */
|
