forked from DavidKinder/Inform6
-
Notifications
You must be signed in to change notification settings - Fork 0
/
arrays.c
658 lines (565 loc) · 25.1 KB
/
arrays.c
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
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
/* ------------------------------------------------------------------------- */
/* "arrays" : Parses array declarations and constructs arrays from them; */
/* likewise global variables, which are in some ways a */
/* simpler form of the same thing. */
/* */
/* Part of Inform 6.33 */
/* copyright (c) Graham Nelson 1993 - 2013 */
/* */
/* ------------------------------------------------------------------------- */
#include "header.h"
/* ------------------------------------------------------------------------- */
/* Arrays defined below: */
/* */
/* int dynamic_array_area[] Initial values for the bytes of */
/* the dynamic array area */
/* int32 global_initial_value[n] The initialised value of the nth */
/* global variable (counting 0 - 239) */
/* */
/* The "dynamic array area" is the Z-machine area holding the current */
/* values of the global variables (in 240x2 = 480 bytes) followed by any */
/* (dynamic) arrays which may be defined. Owing to a poor choice of name */
/* some years ago, this is also called the "static data area", which is */
/* why the memory setting for its maximum extent is "MAX_STATIC_DATA". */
/* */
/* In Glulx, that 240 is changed to MAX_GLOBAL_VAR_NUMBER, and we take */
/* correspondingly more space for the globals. This *really* ought to be */
/* split into two segments. */
/* ------------------------------------------------------------------------- */
int *dynamic_array_area; /* See above */
int32 *global_initial_value;
int no_globals; /* Number of global variables used
by the programmer (Inform itself
uses the top seven -- but these do
not count) */
/* In Glulx, Inform uses the bottom
ten. */
int dynamic_array_area_size; /* Size in bytes */
int no_arrays;
int32 *array_symbols;
int *array_sizes, *array_types;
static int array_entry_size, /* 1 for byte array, 2 for word array */
array_base; /* Offset in dynamic array area of the
array being constructed. During the
same time, dynamic_array_area_size
is the offset of the initial entry
in the array: so for "table" and
"string" arrays, these numbers are
different (by 2 and 1 bytes resp) */
/* In Glulx, of course, that will be
4 instead of 2. */
extern void finish_array(int32 i)
{
/* Write the array size into the 0th byte/word of the array, if it's
a "table" or "string" array */
if (!glulx_mode) {
if (array_base!=dynamic_array_area_size)
{ if (dynamic_array_area_size-array_base==2)
{ dynamic_array_area[array_base] = i/256;
dynamic_array_area[array_base+1] = i%256;
}
else
{ if (i>=256)
error("A 'string' array can have at most 256 entries");
dynamic_array_area[array_base] = i;
}
}
}
else {
if (array_base!=dynamic_array_area_size)
{ if (dynamic_array_area_size-array_base==4)
{
dynamic_array_area[array_base] = (i >> 24) & 0xFF;
dynamic_array_area[array_base+1] = (i >> 16) & 0xFF;
dynamic_array_area[array_base+2] = (i >> 8) & 0xFF;
dynamic_array_area[array_base+3] = (i) & 0xFF;
}
else
{ if (i>=256)
error("A 'string' array can have at most 256 entries");
dynamic_array_area[array_base] = i;
}
}
}
/* Move on the dynamic array size so that it now points to the next
available free space */
dynamic_array_area_size += i*array_entry_size;
}
extern void array_entry(int32 i, assembly_operand VAL)
{
if (!glulx_mode) {
/* Array entry i (initial entry has i=0) is set to Z-machine value j */
if (dynamic_array_area_size+(i+1)*array_entry_size > MAX_STATIC_DATA)
memoryerror("MAX_STATIC_DATA", MAX_STATIC_DATA);
if (array_entry_size==1)
{ dynamic_array_area[dynamic_array_area_size+i] = (VAL.value)%256;
if (VAL.marker != 0)
error("Entries in byte arrays and strings must be known constants");
/* If the entry is too large for a byte array, issue a warning
and truncate the value */
else
if (VAL.value >= 256)
warning("Entry in '->', 'string' or 'buffer' array not in range 0 to 255");
}
else
{ dynamic_array_area[dynamic_array_area_size + 2*i] = (VAL.value)/256;
dynamic_array_area[dynamic_array_area_size + 2*i+1] = (VAL.value)%256;
if (VAL.marker != 0)
backpatch_zmachine(VAL.marker, DYNAMIC_ARRAY_ZA,
dynamic_array_area_size + 2*i);
}
}
else {
/* Array entry i (initial entry has i=0) is set to value j */
if (dynamic_array_area_size+(i+1)*array_entry_size > MAX_STATIC_DATA)
memoryerror("MAX_STATIC_DATA", MAX_STATIC_DATA);
if (array_entry_size==1)
{ dynamic_array_area[dynamic_array_area_size+i] = (VAL.value) & 0xFF;
if (VAL.marker != 0)
error("Entries in byte arrays and strings must be known constants");
/* If the entry is too large for a byte array, issue a warning
and truncate the value */
else
if (VAL.value >= 256)
warning("Entry in '->', 'string' or 'buffer' array not in range 0 to 255");
}
else if (array_entry_size==4)
{ dynamic_array_area[dynamic_array_area_size + 4*i] = (VAL.value >> 24) & 0xFF;
dynamic_array_area[dynamic_array_area_size + 4*i+1] = (VAL.value >> 16) & 0xFF;
dynamic_array_area[dynamic_array_area_size + 4*i+2] = (VAL.value >> 8) & 0xFF;
dynamic_array_area[dynamic_array_area_size + 4*i+3] = (VAL.value) & 0xFF;
if (VAL.marker != 0)
backpatch_zmachine(VAL.marker, ARRAY_ZA,
dynamic_array_area_size - 4*MAX_GLOBAL_VARIABLES + 4*i);
}
else
{
error("Somehow created an array of shorts");
}
}
}
/* ------------------------------------------------------------------------- */
/* Global and Array directives. */
/* */
/* Global <variablename> | */
/* | = <value> */
/* | <array specification> */
/* */
/* Array <arrayname> <array specification> */
/* */
/* where an array specification is: */
/* */
/* | -> | <number-of-entries> */
/* | --> | <entry-1> ... <entry-n> */
/* | string | [ <entry-1> [,] [;] <entry-2> ... <entry-n> ]; */
/* | table */
/* */
/* ------------------------------------------------------------------------- */
extern void set_variable_value(int i, int32 v)
{ global_initial_value[i]=v;
}
/* There are four ways to initialise arrays: */
#define UNSPECIFIED_AI -1
#define NULLS_AI 0
#define DATA_AI 1
#define ASCII_AI 2
#define BRACKET_AI 3
extern void make_global(int array_flag, int name_only)
{
/* array_flag is TRUE for an Array directive, FALSE for a Global;
name_only is only TRUE for parsing an imported variable name, so
array_flag is always FALSE in that case. */
int32 i;
int array_type, data_type;
assembly_operand AO;
int32 global_symbol;
const char *global_name;
debug_location_beginning beginning_debug_location =
get_token_location_beginning();
directive_keywords.enabled = FALSE;
get_next_token();
i = token_value;
global_symbol = i;
global_name = token_text;
if (!glulx_mode) {
if ((token_type==SYMBOL_TT) && (stypes[i]==GLOBAL_VARIABLE_T)
&& (svals[i] >= LOWEST_SYSTEM_VAR_NUMBER))
goto RedefinitionOfSystemVar;
}
else {
if ((token_type==SYMBOL_TT) && (stypes[i]==GLOBAL_VARIABLE_T))
goto RedefinitionOfSystemVar;
}
if ((token_type != SYMBOL_TT) || (!(sflags[i] & UNKNOWN_SFLAG)))
{ discard_token_location(beginning_debug_location);
if (array_flag)
ebf_error("new array name", token_text);
else ebf_error("new global variable name", token_text);
panic_mode_error_recovery(); return;
}
if ((!array_flag) && (sflags[i] & USED_SFLAG))
error_named("Variable must be defined before use:", token_text);
if (array_flag)
{
if (!glulx_mode)
assign_symbol(i, dynamic_array_area_size, ARRAY_T);
else
assign_symbol(i,
dynamic_array_area_size - 4*MAX_GLOBAL_VARIABLES, ARRAY_T);
if (no_arrays == MAX_ARRAYS)
memoryerror("MAX_ARRAYS", MAX_ARRAYS);
array_symbols[no_arrays] = i;
}
else
{ if (!glulx_mode && no_globals==233)
{ discard_token_location(beginning_debug_location);
error("All 233 global variables already declared");
panic_mode_error_recovery();
return;
}
if (glulx_mode && no_globals==MAX_GLOBAL_VARIABLES)
{ discard_token_location(beginning_debug_location);
memoryerror("MAX_GLOBAL_VARIABLES", MAX_GLOBAL_VARIABLES);
panic_mode_error_recovery();
return;
}
variable_tokens[MAX_LOCAL_VARIABLES+no_globals] = i;
assign_symbol(i, MAX_LOCAL_VARIABLES+no_globals, GLOBAL_VARIABLE_T);
variable_tokens[svals[i]] = i;
if (name_only) import_symbol(i);
else global_initial_value[no_globals++]=0;
}
directive_keywords.enabled = TRUE;
RedefinitionOfSystemVar:
if (name_only)
{ discard_token_location(beginning_debug_location);
return;
}
get_next_token();
if ((token_type == SEP_TT) && (token_value == SEMICOLON_SEP))
{ if (array_flag)
{ discard_token_location(beginning_debug_location);
ebf_error("array definition", token_text);
}
put_token_back();
if (debugfile_switch && !array_flag)
{ debug_file_printf("<global-variable>");
debug_file_printf("<identifier>%s</identifier>", global_name);
debug_file_printf("<address>");
write_debug_global_backpatch(svals[global_symbol]);
debug_file_printf("</address>");
write_debug_locations
(get_token_location_end(beginning_debug_location));
debug_file_printf("</global-variable>");
}
return;
}
if (!array_flag)
{
if ((token_type == SEP_TT) && (token_value == SETEQUALS_SEP))
{ AO = parse_expression(CONSTANT_CONTEXT);
if (!glulx_mode) {
if (AO.marker != 0)
backpatch_zmachine(AO.marker, DYNAMIC_ARRAY_ZA,
2*(no_globals-1));
}
else {
if (AO.marker != 0)
backpatch_zmachine(AO.marker, GLOBALVAR_ZA,
4*(no_globals-1));
}
global_initial_value[no_globals-1] = AO.value;
if (debugfile_switch)
{ debug_file_printf("<global-variable>");
debug_file_printf("<identifier>%s</identifier>", global_name);
debug_file_printf("<address>");
write_debug_global_backpatch(svals[global_symbol]);
debug_file_printf("</address>");
write_debug_locations
(get_token_location_end(beginning_debug_location));
debug_file_printf("</global-variable>");
}
return;
}
obsolete_warning("more modern to use 'Array', not 'Global'");
if (!glulx_mode) {
backpatch_zmachine(ARRAY_MV, DYNAMIC_ARRAY_ZA, 2*(no_globals-1));
global_initial_value[no_globals-1]
= dynamic_array_area_size+variables_offset;
}
else {
backpatch_zmachine(ARRAY_MV, GLOBALVAR_ZA, 4*(no_globals-1));
global_initial_value[no_globals-1]
= dynamic_array_area_size - 4*MAX_GLOBAL_VARIABLES;
}
}
array_type = BYTE_ARRAY; data_type = UNSPECIFIED_AI;
if ((!array_flag) &&
((token_type==DIR_KEYWORD_TT)&&(token_value==DATA_DK)))
data_type=NULLS_AI;
else if ((!array_flag) &&
((token_type==DIR_KEYWORD_TT)&&(token_value==INITIAL_DK)))
data_type=DATA_AI;
else if ((!array_flag) &&
((token_type==DIR_KEYWORD_TT)&&(token_value==INITSTR_DK)))
data_type=ASCII_AI;
else if ((token_type==SEP_TT)&&(token_value==ARROW_SEP))
array_type = BYTE_ARRAY;
else if ((token_type==SEP_TT)&&(token_value==DARROW_SEP))
array_type = WORD_ARRAY;
else if ((token_type==DIR_KEYWORD_TT)&&(token_value==STRING_DK))
array_type = STRING_ARRAY;
else if ((token_type==DIR_KEYWORD_TT)&&(token_value==TABLE_DK))
array_type = TABLE_ARRAY;
else if ((token_type==DIR_KEYWORD_TT)&&(token_value==BUFFER_DK))
array_type = BUFFER_ARRAY;
else
{ discard_token_location(beginning_debug_location);
if (array_flag)
ebf_error
("'->', '-->', 'string', 'table' or 'buffer'", token_text);
else
ebf_error
("'=', '->', '-->', 'string', 'table' or 'buffer'", token_text);
panic_mode_error_recovery();
return;
}
array_entry_size=1;
if ((array_type==WORD_ARRAY) || (array_type==TABLE_ARRAY))
array_entry_size=WORDSIZE;
get_next_token();
if ((token_type == SEP_TT) && (token_value == SEMICOLON_SEP))
{ discard_token_location(beginning_debug_location);
error("No array size or initial values given");
put_token_back();
return;
}
switch(data_type)
{ case UNSPECIFIED_AI:
if ((token_type == SEP_TT) && (token_value == OPEN_SQUARE_SEP))
data_type = BRACKET_AI;
else
{ data_type = NULLS_AI;
if (token_type == DQ_TT) data_type = ASCII_AI;
get_next_token();
if (!((token_type == SEP_TT) && (token_value == SEMICOLON_SEP)))
data_type = DATA_AI;
put_token_back();
put_token_back();
}
break;
case NULLS_AI: obsolete_warning("use '->' instead of 'data'"); break;
case DATA_AI: obsolete_warning("use '->' instead of 'initial'"); break;
case ASCII_AI: obsolete_warning("use '->' instead of 'initstr'"); break;
}
array_base = dynamic_array_area_size;
/* Leave room to write the array size in later, if string/table array */
if ((array_type==STRING_ARRAY) || (array_type==TABLE_ARRAY))
dynamic_array_area_size += array_entry_size;
if (array_type==BUFFER_ARRAY)
dynamic_array_area_size += WORDSIZE;
array_types[no_arrays] = array_type;
switch(data_type)
{
case NULLS_AI:
AO = parse_expression(CONSTANT_CONTEXT);
CalculatedArraySize:
if (module_switch && (AO.marker != 0))
{ error("Array sizes must be known now, not externally defined");
break;
}
if (!glulx_mode) {
if ((AO.value <= 0) || (AO.value >= 32768))
{ error("An array must have between 1 and 32767 entries");
AO.value = 1;
}
}
else {
if (AO.value <= 0 || (AO.value & 0x80000000))
{ error("An array may not have 0 or fewer entries");
AO.value = 1;
}
}
{ for (i=0; i<AO.value; i++) array_entry(i, zero_operand);
}
break;
case DATA_AI:
/* In this case the array is initialised to the sequence of
constant values supplied on the same line */
i=0;
do
{ get_next_token();
if ((token_type == SEP_TT) && (token_value == SEMICOLON_SEP))
break;
if ((token_type == SEP_TT)
&& ((token_value == OPEN_SQUARE_SEP)
|| (token_value == CLOSE_SQUARE_SEP)))
{ discard_token_location(beginning_debug_location);
error("Missing ';' to end the initial array values "
"before \"[\" or \"]\"");
return;
}
put_token_back();
AO = parse_expression(ARRAY_CONTEXT);
if (i == 0)
{ get_next_token();
put_token_back();
if ((token_type == SEP_TT)
&& (token_value == SEMICOLON_SEP))
{ data_type = NULLS_AI;
goto CalculatedArraySize;
}
}
array_entry(i, AO);
i++;
} while (TRUE);
put_token_back();
break;
case ASCII_AI:
/* In this case the array is initialised to the ASCII values of
the characters of a given "quoted string" */
get_next_token();
if (token_type != DQ_TT)
{ ebf_error("literal text in double-quotes", token_text);
token_text = "error";
}
{ assembly_operand chars;
int j;
chars.marker = 0;
for (i=0,j=0; token_text[j]!=0; i++,j+=textual_form_length)
{
int32 unicode; int zscii;
unicode = text_to_unicode(token_text+j);
if (glulx_mode)
{
if (unicode < 0 || unicode >= 256)
{
error("Unicode characters beyond Latin-1 are not yet supported in Glulx array literals");
}
else
{
chars.value = unicode;
}
}
else /* Z-code */
{
zscii = unicode_to_zscii(unicode);
if ((zscii != 5) && (zscii < 0x100)) chars.value = zscii;
else
{ unicode_char_error("Character can only be used if declared in \
advance as part of 'Zcharacter table':", unicode);
chars.value = '?';
}
}
chars.marker = 0;
set_constant_ot(&chars);
array_entry(i, chars);
}
}
break;
case BRACKET_AI:
/* In this case the array is initialised to the sequence of
constant values given over a whole range of compiler-lines,
between square brackets [ and ] */
i = 0;
while (TRUE)
{ get_next_token();
if ((token_type == SEP_TT) && (token_value == SEMICOLON_SEP))
continue;
if ((token_type == SEP_TT) && (token_value == CLOSE_SQUARE_SEP))
break;
if ((token_type == SEP_TT) && (token_value == OPEN_SQUARE_SEP))
{ /* Minimal error recovery: we assume that a ] has
been missed, and the programmer is now starting
a new routine */
ebf_error("']'", token_text);
put_token_back(); break;
}
put_token_back();
array_entry(i, parse_expression(ARRAY_CONTEXT));
i++;
}
}
finish_array(i);
if (debugfile_switch)
{ debug_file_printf("<array>");
debug_file_printf("<identifier>%s</identifier>", global_name);
debug_file_printf("<value>");
write_debug_array_backpatch(svals[global_symbol]);
debug_file_printf("</value>");
debug_file_printf
("<byte-count>%d</byte-count>",
dynamic_array_area_size - array_base);
debug_file_printf
("<bytes-per-element>%d</bytes-per-element>",
array_entry_size);
debug_file_printf
("<zeroth-element-holds-length>%s</zeroth-element-holds-length>",
(array_type == STRING_ARRAY || array_type == TABLE_ARRAY) ?
"true" : "false");
get_next_token();
write_debug_locations(get_token_location_end(beginning_debug_location));
put_token_back();
debug_file_printf("</array>");
}
if ((array_type==BYTE_ARRAY) || (array_type==WORD_ARRAY)) i--;
if (array_type==BUFFER_ARRAY) i+=WORDSIZE-1;
array_sizes[no_arrays++] = i;
}
extern int32 begin_table_array(void)
{
/* The "box" statement needs to be able to construct (static) table
arrays of strings like this */
array_base = dynamic_array_area_size;
array_entry_size = WORDSIZE;
/* Leave room to write the array size in later */
dynamic_array_area_size += array_entry_size;
if (!glulx_mode)
return array_base;
else
return array_base - WORDSIZE * MAX_GLOBAL_VARIABLES;
}
extern int32 begin_word_array(void)
{
/* The "random(a, b, ...)" function needs to be able to construct
(static) word arrays like this */
array_base = dynamic_array_area_size;
array_entry_size = WORDSIZE;
if (!glulx_mode)
return array_base;
else
return array_base - WORDSIZE * MAX_GLOBAL_VARIABLES;
}
/* ========================================================================= */
/* Data structure management routines */
/* ------------------------------------------------------------------------- */
extern void init_arrays_vars(void)
{ dynamic_array_area = NULL;
global_initial_value = NULL;
array_sizes = NULL; array_symbols = NULL; array_types = NULL;
}
extern void arrays_begin_pass(void)
{ no_arrays = 0;
if (!glulx_mode)
no_globals=0;
else
no_globals=11;
dynamic_array_area_size = WORDSIZE * MAX_GLOBAL_VARIABLES;
}
extern void arrays_allocate_arrays(void)
{ dynamic_array_area = my_calloc(sizeof(int), MAX_STATIC_DATA,
"static data");
array_sizes = my_calloc(sizeof(int), MAX_ARRAYS, "array sizes");
array_types = my_calloc(sizeof(int), MAX_ARRAYS, "array types");
array_symbols = my_calloc(sizeof(int32), MAX_ARRAYS, "array symbols");
global_initial_value = my_calloc(sizeof(int32), MAX_GLOBAL_VARIABLES,
"global values");
}
extern void arrays_free_arrays(void)
{ my_free(&dynamic_array_area, "static data");
my_free(&global_initial_value, "global values");
my_free(&array_sizes, "array sizes");
my_free(&array_types, "array sizes");
my_free(&array_symbols, "array sizes");
}
/* ========================================================================= */