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
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#include "glk/glulxe/glulxe.h"
namespace Glk {
namespace Glulxe {
void Glulxe::setup_vm() {
byte buf[4 * 7];
pc = 0; // Clear this, so that error messages are cleaner.
prevpc = 0;
// Read in all the size constants from the game file header
stream_char_handler = nullptr;
stream_unichar_handler = nullptr;
_gameFile.seek(gamefile_start + 8);
if (_gameFile.read(buf, 4 * 7) != (4 * 7))
fatal_error("The game file header is too short.");
ramstart = Read4(buf + 0);
endgamefile = Read4(buf + 4);
origendmem = Read4(buf + 8);
stacksize = Read4(buf + 12);
startfuncaddr = Read4(buf + 16);
origstringtable = Read4(buf + 20);
checksum = Read4(buf + 24);
// Set the protection range to (0, 0), meaning "off".
protectstart = 0;
protectend = 0;
// Do a few sanity checks.
if ((ramstart & 0xFF)
|| (endgamefile & 0xFF)
|| (origendmem & 0xFF)
|| (stacksize & 0xFF)) {
nonfatal_warning("One of the segment boundaries in the header is not "
"256-byte aligned.");
}
if (endgamefile != gamefile_len) {
nonfatal_warning("The gamefile length does not match the header "
"endgamefile length.");
}
if (ramstart < 0x100 || endgamefile < ramstart || origendmem < endgamefile) {
fatal_error("The segment boundaries in the header are in an impossible "
"order.");
}
if (stacksize < 0x100) {
fatal_error("The stack size in the header is too small.");
}
/* Allocate main memory and the stack. This is where memory allocation
errors are most likely to occur. */
endmem = origendmem;
memmap = (byte *)glulx_malloc(origendmem);
if (!memmap) {
fatal_error("Unable to allocate Glulx memory space.");
}
stack = (byte *)glulx_malloc(stacksize);
if (!stack) {
glulx_free(memmap);
memmap = nullptr;
fatal_error("Unable to allocate Glulx stack space.");
}
stringtable = 0;
// Initialize various other things in the terp.
init_operands();
init_serial();
// Set up the initial machine state.
vm_restart();
/* If the debugger is compiled in, check that the debug data matches
the game. (This only prints warnings for mismatch.) */
debugger_check_story_file();
/* Also, set up any start-time debugger state. This may do a block-
and-debug, if the user has requested that. */
debugger_setup_start_state();
}
void Glulxe::finalize_vm() {
stream_set_table(0);
if (memmap) {
glulx_free(memmap);
memmap = nullptr;
}
if (stack) {
glulx_free(stack);
stack = nullptr;
}
final_serial();
}
void Glulxe::vm_restart() {
uint lx;
int res;
int bufpos;
char buf[0x100];
/* Deactivate the heap (if it was active). */
heap_clear();
/* Reset memory to the original size. */
lx = change_memsize(origendmem, false);
if (lx)
fatal_error("Memory could not be reset to its original size.");
/* Load in all of main memory. We do this in 256-byte chunks, because
why rely on OS stream buffering? */
_gameFile.seek(gamefile_start);
bufpos = 0x100;
for (lx = 0; lx < endgamefile; lx++) {
if (bufpos >= 0x100) {
int count = _gameFile.read(buf, 0x100);
if (count != 0x100) {
fatal_error("The game file ended unexpectedly.");
}
bufpos = 0;
}
res = buf[bufpos++];
if (lx >= protectstart && lx < protectend)
continue;
memmap[lx] = res;
}
for (lx = endgamefile; lx < origendmem; lx++) {
memmap[lx] = 0;
}
/* Reset all the registers */
stackptr = 0;
frameptr = 0;
pc = 0;
prevpc = 0;
stream_set_iosys(0, 0);
stream_set_table(origstringtable);
valstackbase = 0;
localsbase = 0;
/* Note that we do not reset the protection range. */
/* Push the first function call. (No arguments.) */
enter_function(startfuncaddr, 0, nullptr);
/* We're now ready to execute. */
}
uint Glulxe::change_memsize(uint newlen, bool internal) {
uint lx;
unsigned char *newmemmap;
if (newlen == endmem)
return 0;
#ifdef FIXED_MEMSIZE
return 1;
#else /* FIXED_MEMSIZE */
if ((!internal) && heap_is_active())
fatal_error("Cannot resize Glulx memory space while heap is active.");
if (newlen < origendmem)
fatal_error("Cannot resize Glulx memory space smaller than it started.");
if (newlen & 0xFF)
fatal_error("Can only resize Glulx memory space to a 256-byte boundary.");
newmemmap = (unsigned char *)glulx_realloc(memmap, newlen);
if (!newmemmap) {
/* The old block is still in place, unchanged. */
return 1;
}
memmap = newmemmap;
if (newlen > endmem) {
for (lx = endmem; lx < newlen; lx++) {
memmap[lx] = 0;
}
}
endmem = newlen;
return 0;
#endif /* FIXED_MEMSIZE */
}
uint *Glulxe::pop_arguments(uint count, uint addr) {
uint ix;
uint argptr;
uint *array;
#define MAXARGS (32)
static uint statarray[MAXARGS];
static uint *dynarray = nullptr;
static uint dynarray_size = 0;
if (count == 0)
return nullptr;
if (count <= MAXARGS) {
/* Store in the static array. */
array = statarray;
} else {
if (!dynarray) {
dynarray_size = count + 8;
dynarray = (uint *)glulx_malloc(sizeof(uint) * dynarray_size);
if (!dynarray)
fatal_error("Unable to allocate function arguments.");
array = dynarray;
} else {
if (dynarray_size >= count) {
/* It fits. */
array = dynarray;
} else {
dynarray_size = count + 8;
dynarray = (uint *)glulx_realloc(dynarray, sizeof(uint) * dynarray_size);
if (!dynarray)
fatal_error("Unable to reallocate function arguments.");
array = dynarray;
}
}
}
if (!addr) {
if (stackptr < valstackbase + 4 * count)
fatal_error("Stack underflow in arguments.");
stackptr -= 4 * count;
for (ix = 0; ix < count; ix++) {
argptr = stackptr + 4 * ((count - 1) - ix);
array[ix] = Stk4(argptr);
}
} else {
for (ix = 0; ix < count; ix++) {
array[ix] = Mem4(addr);
addr += 4;
}
}
return array;
}
void Glulxe::verify_address(uint addr, uint count) {
if (addr >= endmem)
fatal_error_i("Memory access out of range", addr);
if (count > 1) {
addr += (count - 1);
if (addr >= endmem)
fatal_error_i("Memory access out of range", addr);
}
}
void Glulxe::verify_address_write(uint addr, uint count) {
if (addr < ramstart)
fatal_error_i("Memory write to read-only address", addr);
if (addr >= endmem)
fatal_error_i("Memory access out of range", addr);
if (count > 1) {
addr += (count - 1);
if (addr >= endmem)
fatal_error_i("Memory access out of range", addr);
}
}
void Glulxe::verify_array_addresses(uint addr, uint count, uint size) {
uint bytecount;
if (addr >= endmem)
fatal_error_i("Memory access out of range", addr);
if (count == 0)
return;
bytecount = count * size;
/* If just multiplying by the element size overflows, we have trouble. */
if (bytecount < count)
fatal_error_i("Memory access way too long", addr);
/* If the byte length by itself is too long, or if its end overflows,
we have trouble. */
if (bytecount > endmem || addr + bytecount < addr)
fatal_error_i("Memory access much too long", addr);
/* The simple length test. */
if (addr + bytecount > endmem)
fatal_error_i("Memory access too long", addr);
}
} // End of namespace Glulxe
} // End of namespace Glk
|