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
|
/* $XConsortium: util.c,v 1.6 92/03/26 16:42:26 eswu Exp $ */
/* Copyright International Business Machines,Corp. 1991
* All Rights Reserved
*
* License to use, copy, modify, and distribute this software
* and its documentation for any purpose and without fee is
* hereby granted, provided that the above copyright notice
* appear in all copies and that both that copyright notice and
* this permission notice appear in supporting documentation,
* and that the name of IBM not be used in advertising or
* publicity pertaining to distribution of the software without
* specific, written prior permission.
*
* IBM PROVIDES THIS SOFTWARE "AS IS", WITHOUT ANY WARRANTIES
* OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING, BUT NOT
* LIMITED TO ANY IMPLIED WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE, AND NONINFRINGEMENT OF
* THIRD PARTY RIGHTS. THE ENTIRE RISK AS TO THE QUALITY AND
* PERFORMANCE OF THE SOFTWARE, INCLUDING ANY DUTY TO SUPPORT
* OR MAINTAIN, BELONGS TO THE LICENSEE. SHOULD ANY PORTION OF
* THE SOFTWARE PROVE DEFECTIVE, THE LICENSEE (NOT IBM) ASSUMES
* THE ENTIRE COST OF ALL SERVICING, REPAIR AND CORRECTION. IN
* NO EVENT SHALL IBM BE LIABLE FOR ANY SPECIAL, INDIRECT OR
* CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING
* FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF
* CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
* OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
* SOFTWARE.
*/
/* Author: Katherine A. Hitchcock IBM Almaden Research Laboratory */
#include "types.h"
#include <stdio.h>
#include <stdlib.h>
#include "util.h"
#include "fontmisc.h"
static char *vm_base = NULL; /* Start of virtual memory area */
char *vm_next = NULL; /* Pointer to first free byte */
LONG vm_free = 0; /* Count of free bytes */
LONG vm_size = 0; /* Total size of memory */
/* The following global variable is for detecting a trial to
allocate a second chunk---not to be done with the t1lib, since
a later reallocation would lead to segmentation faults!
*/
int vm_init_count;
/* This is the amount of VM, the font is tried to be loaded in. */
int vm_init_amount;
/*
* Initialize memory.
*/
extern char *tokenMaxP; /* Pointer to end of VM we may use + 1 */
boolean vm_init()
{
/* Check whether it is the first piece of memory for the
current font or not. If so, simulate lacking memory to
indicate that the font should be tried to load with a
vitual memory twice as large!
*/
if (vm_init_count>0){
vm_init_count++;
return(FALSE);
}
vm_init_count++;
vm_next = vm_base = (char *) calloc( vm_init_amount, sizeof(char));
if (vm_base != NULL) {
vm_free = vm_init_amount;
vm_size = vm_init_amount;
tokenMaxP = vm_next_byte() + vm_init_amount;
return(TRUE);
}
else
return(FALSE);
}
char *vm_alloc(bytes)
unsigned int bytes;
{
char *answer;
/* Align returned bytes to 64-bit boundary */
bytes = (bytes + 7) & ~7;
/* take space from what is left otherwise allocate another CHUNK */
if (bytes > vm_free){
if (!vm_init()) return NULL;
}
else{
answer = vm_next;
vm_free -= bytes;
vm_next += bytes;
return answer;
}
/* Never reached, but compiler is happy: */
return NULL;
}
/*
* Format an Integer object
*/
void objFormatInteger( psobj *objP, int value)
{
if (objP != NULL) {
objP->type = OBJ_INTEGER;
objP->len = 0;
objP->data.integer = value;
}
}
/*
* Format a Real object
*/
void objFormatReal(psobj *objP, float value)
{
if (objP != NULL) {
objP->type = OBJ_REAL;
objP->len = 0;
objP->data.real = value;
}
}
/*
* Format a Boolean object
*/
void objFormatBoolean(psobj *objP, boolean value)
{
if (objP != NULL) {
objP->type = OBJ_BOOLEAN;
objP->len = 0;
objP->data.boolean = value;
}
}
/*
* Format an Encoding object
*/
void objFormatEncoding(psobj *objP, int length, psobj *valueP)
{
if (objP != NULL) {
objP->type = OBJ_ENCODING;
objP->len = length;
objP->data.arrayP = valueP;
}
}
/*
* Format an Array object
*/
void objFormatArray(psobj *objP, int length, psobj *valueP)
{
if (objP != NULL) {
objP->type = OBJ_ARRAY;
objP->len = length;
objP->data.arrayP = valueP;
}
}
/*
* Format a String object
*/
void objFormatString(psobj *objP, int length, char *valueP)
{
if (objP != NULL) {
objP->type = OBJ_STRING;
objP->len = length;
objP->data.valueP = valueP;
}
}
/*
* Format a Name object
*/
void objFormatName( psobj *objP, int length, char *valueP)
{
if (objP != NULL) {
objP->type = OBJ_NAME;
objP->len = length;
objP->data.nameP = valueP;
}
}
/*
* Format a File object
*/
void objFormatFile(psobj *objP, FILE *valueP)
{
if (objP != NULL) {
objP->type = OBJ_FILE;
objP->len = 0;
objP->data.fileP = valueP;
}
}
|
