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 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484
|
/* ------------------------------------------------------------------------- */
/* "objects" : [1] the object-maker, which constructs objects and enters */
/* them into the tree, given a low-level specification; */
/* */
/* [2] the parser of Object/Nearby/Class directives, which */
/* checks syntax and translates such directives into */
/* specifications for the object-maker. */
/* */
/* Part of Inform 6.21 */
/* copyright (c) Graham Nelson 1993, 1994, 1995, 1996, 1997, 1998, 1999 */
/* */
/* ------------------------------------------------------------------------- */
#include "header.h"
/* ------------------------------------------------------------------------- */
/* Objects. */
/* ------------------------------------------------------------------------- */
int no_objects; /* Number of objects made so far */
static int no_embedded_routines; /* Used for naming routines which
are given as property values: these
are called EmbeddedRoutine__1, ... */
static fpropt full_object; /* "fpropt" is a typedef for a struct
containing an array to hold the
attribute and property values of
a single object. We only keep one
of these, for the current object
being made, and compile it into
Z-machine tables when each object
definition is complete, since
sizeof(fpropt) is about 6200 bytes */
static char shortname_buffer[256]; /* Text buffer to hold the short name
(which is read in first, but
written almost last) */
static int parent_of_this_obj;
static char *classname_text, *objectname_text;
/* For printing names of embedded
routines only */
/* ------------------------------------------------------------------------- */
/* Classes. */
/* ------------------------------------------------------------------------- */
/* Arrays defined below: */
/* */
/* int32 class_begins_at[n] offset of properties block for */
/* nth class (always an offset */
/* inside the properties_table) */
/* int classes_to_inherit_from[] The list of classes to inherit */
/* from as taken from the current */
/* Nearby/Object/Class definition */
/* int class_object_numbers[n] The number of the prototype-object */
/* for the nth class */
/* ------------------------------------------------------------------------- */
int no_classes; /* Number of class defns made so far */
static int current_defn_is_class, /* TRUE if current Nearby/Object/Class
defn is in fact a Class definition */
no_classes_to_inherit_from; /* Number of classes in the list
of classes to inherit in the
current Nearby/Object/Class defn */
/* ------------------------------------------------------------------------- */
/* Making attributes and properties. */
/* ------------------------------------------------------------------------- */
int no_attributes, /* Number of attributes defined so far */
no_properties; /* Number of properties defined so far,
plus 1 (properties are numbered from
1 and Inform creates "name" and two
others itself, so the variable begins
the compilation pass set to 4) */
static void trace_s(char *name, int32 number, int f)
{ if (!printprops_switch) return;
printf("%s %02ld ",(f==0)?"Attr":"Prop",(long int) number);
if (f==0) printf(" ");
else printf("%s%s",(prop_is_long[number])?"L":" ",
(prop_is_additive[number])?"A":" ");
printf(" %s\n",name);
}
extern void make_attribute(void)
{ int i; char *name;
if (no_attributes==((version_number==3)?32:48))
{ if (version_number==3)
error("All 32 attributes already declared (compile as Advanced \
game to get an extra 16)");
else
error("All 48 attributes already declared");
panic_mode_error_recovery(); return;
}
get_next_token();
i = token_value; name = token_text;
if ((token_type != SYMBOL_TT) || (!(sflags[i] & UNKNOWN_SFLAG)))
{ ebf_error("new attribute name", token_text);
panic_mode_error_recovery(); return;
}
directive_keywords.enabled = TRUE;
get_next_token();
directive_keywords.enabled = FALSE;
if ((token_type == DIR_KEYWORD_TT) && (token_value == ALIAS_DK))
{ get_next_token();
if (!((token_type == SYMBOL_TT)
&& (stypes[token_value] == ATTRIBUTE_T)))
{ ebf_error("an existing attribute name after 'alias'",
token_text); panic_mode_error_recovery(); return;
}
assign_symbol(i, svals[token_value], ATTRIBUTE_T);
sflags[token_value] |= ALIASED_SFLAG;
sflags[i] |= ALIASED_SFLAG;
}
else
{ assign_symbol(i, no_attributes++, ATTRIBUTE_T);
put_token_back();
}
trace_s(name, svals[i], 0);
return;
}
extern void make_property(void)
{ int32 default_value;
int i, additive_flag=FALSE; char *name;
assembly_operand AO;
if (no_properties==((version_number==3)?32:64))
{ if (version_number==3)
error("All 30 properties already declared (compile as Advanced \
game to get an extra 62)");
else
error("All 62 properties already declared");
panic_mode_error_recovery(); return;
}
do
{ directive_keywords.enabled = TRUE;
get_next_token();
if ((token_type == DIR_KEYWORD_TT) && (token_value == LONG_DK))
obsolete_warning("all properties are now automatically 'long'");
else
if ((token_type == DIR_KEYWORD_TT) && (token_value == ADDITIVE_DK))
additive_flag = TRUE;
else break;
} while (TRUE);
put_token_back();
directive_keywords.enabled = FALSE;
get_next_token();
i = token_value; name = token_text;
if ((token_type != SYMBOL_TT) || (!(sflags[i] & UNKNOWN_SFLAG)))
{ ebf_error("new property name", token_text);
panic_mode_error_recovery(); return;
}
directive_keywords.enabled = TRUE;
get_next_token();
directive_keywords.enabled = FALSE;
if ((token_type == DIR_KEYWORD_TT) && (token_value == ALIAS_DK))
{ if (additive_flag)
{ error("'alias' incompatible with 'additive'");
panic_mode_error_recovery();
return;
}
get_next_token();
if (!((token_type == SYMBOL_TT)
&& (stypes[token_value] == PROPERTY_T)))
{ ebf_error("an existing property name after 'alias'",
token_text); panic_mode_error_recovery(); return;
}
assign_symbol(i, svals[token_value], PROPERTY_T);
trace_s(name, svals[i], 1);
sflags[token_value] |= ALIASED_SFLAG;
sflags[i] |= ALIASED_SFLAG;
return;
}
default_value = 0;
put_token_back();
if (!((token_type == SEP_TT) && (token_value == SEMICOLON_SEP)))
{ AO = parse_expression(CONSTANT_CONTEXT);
default_value = AO.value;
if (AO.marker != 0)
backpatch_zmachine(AO.marker, PROP_DEFAULTS_ZA, no_properties*2-2);
}
prop_default_value[no_properties] = default_value;
prop_is_long[no_properties] = TRUE;
prop_is_additive[no_properties] = additive_flag;
assign_symbol(i, no_properties++, PROPERTY_T);
trace_s(name, svals[i], 1);
}
/* ------------------------------------------------------------------------- */
/* Properties. */
/* ------------------------------------------------------------------------- */
int32 prop_default_value[64]; /* Default values for properties */
int prop_is_long[64], /* Property modifiers, TRUE or FALSE:
"long" means "never write a 1-byte
value to this property", and is an
obsolete feature: since Inform 5
all properties have been "long" */
prop_is_additive[64]; /* "additive" means that values
accumulate rather than erase each
other during class inheritance */
char *properties_table; /* Holds the table of property values
(holding one block for each object
and coming immediately after the
object tree in Z-memory) */
int properties_table_size; /* Number of bytes in this table */
/* ------------------------------------------------------------------------- */
/* Individual properties */
/* */
/* Each new i.p. name is given a unique number. These numbers start from */
/* 72, since 0 is reserved as a null, 1 to 63 refer to common properties */
/* and 64 to 71 are kept for methods of the metaclass Class (for example, */
/* 64 is "create"). */
/* */
/* An object provides individual properties by having property 3 set to a */
/* non-zero value, which must be a byte address of a table in the form: */
/* */
/* <record-1> ... <record-n> 00 00 */
/* */
/* where a <record> looks like */
/* */
/* <identifier> <size> <up to 255 bytes of data> */
/* or <identifier + 0x8000> */
/* ----- 2 bytes ---------- 1 byte <size> number of bytes */
/* */
/* The <identifier> part is the number allocated to the name of what is */
/* being provided. The top bit of this word is set to indicate that */
/* although the individual property is being provided, it is provided */
/* only privately (so that it is inaccessible except to the object's own */
/* embedded routines). */
/* ------------------------------------------------------------------------- */
int *property3_lists; /* p3_l[n] = the offset of prop 3
(i.p. table addr) for object n+1,
or -1 if it has none */
int no_individual_properties; /* Actually equal to the next
identifier number to be allocated,
so this is initially 72 even though
none have been made yet. */
static int individual_prop_table_size; /* Size of the table of individual
properties so far for current obj */
uchar *individuals_table; /* Table of records, each being the
i.p. table for an object */
int i_m; /* Write mark position in the above */
int individuals_length; /* Extent of individuals_table */
/* ------------------------------------------------------------------------- */
/* Arrays used by this file */
/* ------------------------------------------------------------------------- */
objectt *objects;
static int *classes_to_inherit_from;
int *class_object_numbers;
int32 *class_begins_at;
/* ------------------------------------------------------------------------- */
/* Tracing for compiler maintenance */
/* ------------------------------------------------------------------------- */
extern void list_object_tree(void)
{ int i;
printf("obj par nxt chl Object tree:\n");
for (i=0; i<no_objects; i++)
printf("%3d %3d %3d %3d\n",
i+1,objects[i].parent,objects[i].next, objects[i].child);
}
/* ------------------------------------------------------------------------- */
/* Object and class manufacture begins here. */
/* */
/* These definitions have headers (parsed far, far below) and a series */
/* of segments, introduced by keywords and optionally separated by commas. */
/* Each segment has its own parsing routine. Note that when errors are */
/* detected, parsing continues rather than being abandoned, which assists */
/* a little in "error recovery" (i.e. in stopping lots more errors being */
/* produced for essentially the same mistake). */
/* ------------------------------------------------------------------------- */
extern int object_provides(int obj, int id)
{
/* Does the given object provide the identifier id?
This is a matter of searching the object's property 3 list,
but for speed and convenience we have kept an array of the
addresses of these.
Returns: 0 if not provided
1 if provided but "private" to that object
2 if provided and on public access */
uchar *p; int i=0, b1, b2, c1;
if (property3_lists[obj-1] == -1) return 0;
p = individuals_table + property3_lists[obj-1];
b1 = id/256; b2 = id%256; c1 = b1 | 0x80;
while ((p[i] != 0) || (p[i+1]!=0))
{ if ((p[i] == b1) && (p[i+1] == b2)) return 2;
if ((p[i] == c1) && (p[i+1] == b2)) return 1;
i = i + p[i+2] + 3;
}
return 0;
}
/* ========================================================================= */
/* [1] The object-maker: builds an object from a specification, viz.: */
/* */
/* full_object, */
/* shortname_buffer, */
/* parent_of_this_obj, */
/* current_defn_is_class (flag) */
/* classes_to_inherit_from[], no_classes_to_inherit_from, */
/* individual_prop_table_size (to date ) */
/* */
/* For efficiency's sake, the individual properties table has already been */
/* created (as far as possible, i.e., all except for inherited individual */
/* properties); unless the flag is clear, in which case the actual */
/* definition did not specify any individual properties. */
/* ========================================================================= */
/* Property inheritance from classes. */
/* ------------------------------------------------------------------------- */
static void property_inheritance(void)
{
/* Apply the property inheritance rules to full_object, which should
initially be complete (i.e., this routine takes place after the whole
Nearby/Object/Class definition has been parsed through).
On exit, full_object contains the final state of the properties to
be written. */
int i, j, k, kmax, class, mark,
prop_number, prop_length, prop_in_current_defn;
uchar *class_prop_block;
for (class=0; class<no_classes_to_inherit_from; class++)
{
j=0;
mark = class_begins_at[classes_to_inherit_from[class]-1];
class_prop_block = (uchar *) (properties_table + mark);
while (class_prop_block[j]!=0)
{ if (version_number == 3)
{ prop_number = class_prop_block[j]%32;
prop_length = 1 + class_prop_block[j++]/32;
}
else
{ prop_number = class_prop_block[j]%64;
prop_length = 1 + class_prop_block[j++]/64;
if (prop_length > 2)
prop_length = class_prop_block[j++]%64;
}
/* So we now have property number prop_number present in the
property block for the class being read: its bytes are
class_prop_block[j, ..., j + prop_length - 1]
Question now is: is there already a value given in the
current definition under this property name? */
prop_in_current_defn = FALSE;
kmax = full_object.l;
for (k=0; k<kmax; k++)
if (full_object.pp[k].num == prop_number)
{ prop_in_current_defn = TRUE;
/* (Note that the built-in "name" property is additive) */
if ((prop_number==1) || (prop_is_additive[prop_number]))
{
/* The additive case: we accumulate the class
property values onto the end of the full_object
property */
for (i=full_object.pp[k].l;
i<full_object.pp[k].l+prop_length/2; i++)
{ if (i >= 32)
{ error("An additive property has inherited \
so many values that the list has overflowed the maximum 32 entries");
break;
}
full_object.pp[k].ao[i].value = mark + j;
j += 2;
full_object.pp[k].ao[i].marker = INHERIT_MV;
full_object.pp[k].ao[i].type = LONG_CONSTANT_OT;
}
full_object.pp[k].l += prop_length/2;
}
else
/* The ordinary case: the full_object property
values simply overrides the class definition,
so we skip over the values in the class table */
j+=prop_length;
if (prop_number==3)
{ int y, z, class_block_offset;
uchar *p;
/* Property 3 holds the address of the table of
instance variables, so this is the case where
the object already has instance variables in its
own table but must inherit some more from the
class */
if (individuals_length+64 > MAX_INDIV_PROP_TABLE_SIZE)
memoryerror("MAX_INDIV_PROP_TABLE_SIZE",
MAX_INDIV_PROP_TABLE_SIZE);
class_block_offset = class_prop_block[j-2]*256
+ class_prop_block[j-1];
p = individuals_table + class_block_offset;
z = class_block_offset;
while ((p[0]!=0)||(p[1]!=0))
{ int already_present = FALSE, l;
for (l = full_object.pp[k].ao[0].value; l < i_m;
l = l + 3 + individuals_table[l + 2])
if (individuals_table[l] == p[0]
&& individuals_table[l + 1] == p[1])
{ already_present = TRUE; break;
}
if (already_present == FALSE)
{ if (module_switch)
backpatch_zmachine(IDENT_MV,
INDIVIDUAL_PROP_ZA, i_m);
individuals_table[i_m++] = p[0];
individuals_table[i_m++] = p[1];
individuals_table[i_m++] = p[2];
for (y=0;y < p[2]/2;y++)
{ individuals_table[i_m++] = (z+3+y*2)/256;
individuals_table[i_m++] = (z+3+y*2)%256;
backpatch_zmachine(INHERIT_INDIV_MV,
INDIVIDUAL_PROP_ZA, i_m-2);
}
}
z += p[2] + 3;
p += p[2] + 3;
}
individuals_length = i_m;
}
/* For efficiency we exit the loop now (this property
number has been dealt with) */
break;
}
if (!prop_in_current_defn)
{
/* The case where the class defined a property which wasn't
defined at all in full_object: we copy out the data into
a new property added to full_object */
k=full_object.l++;
full_object.pp[k].num = prop_number;
full_object.pp[k].l = prop_length/2;
for (i=0; i<prop_length/2; i++)
{ full_object.pp[k].ao[i].value = mark + j;
j+=2;
full_object.pp[k].ao[i].marker = INHERIT_MV;
full_object.pp[k].ao[i].type = LONG_CONSTANT_OT;
}
if (prop_number==3)
{ int y, z, class_block_offset;
uchar *p;
/* Property 3 holds the address of the table of
instance variables, so this is the case where
the object had no instance variables of its own
but must inherit some more from the class */
if (individuals_length+64 > MAX_INDIV_PROP_TABLE_SIZE)
memoryerror("MAX_INDIV_PROP_TABLE_SIZE",
MAX_INDIV_PROP_TABLE_SIZE);
if (individual_prop_table_size++ == 0)
{ full_object.pp[k].num = 3;
full_object.pp[k].l = 1;
full_object.pp[k].ao[0].value
= individuals_length;
full_object.pp[k].ao[0].marker = INDIVPT_MV;
full_object.pp[k].ao[0].type = LONG_CONSTANT_OT;
i_m = individuals_length;
}
class_block_offset = class_prop_block[j-2]*256
+ class_prop_block[j-1];
p = individuals_table + class_block_offset;
z = class_block_offset;
while ((p[0]!=0)||(p[1]!=0))
{ if (module_switch)
backpatch_zmachine(IDENT_MV, INDIVIDUAL_PROP_ZA, i_m);
individuals_table[i_m++] = p[0];
individuals_table[i_m++] = p[1];
individuals_table[i_m++] = p[2];
for (y=0;y < p[2]/2;y++)
{ individuals_table[i_m++] = (z+3+y*2)/256;
individuals_table[i_m++] = (z+3+y*2)%256;
backpatch_zmachine(INHERIT_INDIV_MV,
INDIVIDUAL_PROP_ZA, i_m-2);
}
z += p[2] + 3;
p += p[2] + 3;
}
individuals_length = i_m;
}
}
}
}
if (individual_prop_table_size > 0)
{ individuals_table[i_m++] = 0;
individuals_table[i_m++] = 0;
individuals_length += 2;
}
}
/* ------------------------------------------------------------------------- */
/* Construction of Z-machine-format property blocks. */
/* ------------------------------------------------------------------------- */
static int write_properties_between(uchar *p, int mark, int from, int to)
{ int j, k, prop_number, prop_length;
for (prop_number=to; prop_number>=from; prop_number--)
{ for (j=0; j<full_object.l; j++)
{ if ((full_object.pp[j].num == prop_number)
&& (full_object.pp[j].l != 100))
{ prop_length = 2*full_object.pp[j].l;
if (version_number == 3)
p[mark++] = prop_number + (prop_length - 1)*32;
else
{ switch(prop_length)
{ case 1:
p[mark++] = prop_number; break;
case 2:
p[mark++] = prop_number + 0x40; break;
default:
p[mark++] = prop_number + 0x80;
p[mark++] = prop_length + 0x80; break;
}
}
for (k=0; k<full_object.pp[j].l; k++)
{ if (full_object.pp[j].ao[k].marker != 0)
backpatch_zmachine(full_object.pp[j].ao[k].marker,
PROP_ZA, mark);
p[mark++] = full_object.pp[j].ao[k].value/256;
p[mark++] = full_object.pp[j].ao[k].value%256;
}
}
}
}
p[mark++]=0;
return(mark);
}
static int write_property_block(char *shortname)
{
/* Compile the (now complete) full_object properties into a
property-table block at "p" in Inform's memory.
"shortname" is the object's short name, if specified; otherwise
NULL.
Return the number of bytes written to the block. */
int32 mark = properties_table_size, i;
uchar *p = (uchar *) properties_table;
/* printf("Object at %04x\n", mark);*/
if (shortname != NULL)
{ uchar *tmp = translate_text(p+mark+1,shortname);
i = subtract_pointers(tmp,(p+mark+1));
p[mark] = i/2;
mark += i+1;
}
if (current_defn_is_class)
{ mark = write_properties_between(p,mark,3,3);
for (i=0;i<6;i++)
p[mark++] = full_object.atts[i];
class_begins_at[no_classes++] = mark;
}
mark = write_properties_between(p, mark, 1, (version_number==3)?31:63);
i = mark - properties_table_size;
properties_table_size = mark;
return(i);
}
/* ------------------------------------------------------------------------- */
/* The final stage in Nearby/Object/Class definition processing. */
/* ------------------------------------------------------------------------- */
static void manufacture_object(void)
{ int i, j;
segment_markers.enabled = FALSE;
directives.enabled = TRUE;
property_inheritance();
objects[no_objects].parent = parent_of_this_obj;
objects[no_objects].next = 0;
objects[no_objects].child = 0;
if ((parent_of_this_obj > 0) && (parent_of_this_obj != 0x7fff))
{ i = objects[parent_of_this_obj-1].child;
if (i == 0)
objects[parent_of_this_obj-1].child = no_objects + 1;
else
{ while(objects[i-1].next != 0) i = objects[i-1].next;
objects[i-1].next = no_objects+1;
}
}
/* The properties table consists simply of a sequence of property
blocks, one for each object in order of definition, exactly as
it will appear in the final Z-machine. */
j = write_property_block(shortname_buffer);
objects[no_objects].propsize = j;
if (properties_table_size >= MAX_PROP_TABLE_SIZE)
memoryerror("MAX_PROP_TABLE_SIZE",MAX_PROP_TABLE_SIZE);
if (current_defn_is_class)
for (i=0;i<6;i++) objects[no_objects].atts[i] = 0;
else
for (i=0;i<6;i++)
objects[no_objects].atts[i] = full_object.atts[i];
no_objects++;
}
/* ========================================================================= */
/* [2] The Object/Nearby/Class directives parser: translating the syntax */
/* into object specifications and then triggering off the above. */
/* ========================================================================= */
/* Properties ("with" or "private") segment. */
/* ------------------------------------------------------------------------- */
static int defined_this_segment[128], def_t_s;
static void properties_segment(int this_segment)
{
/* Parse through the "with" part of an object/class definition:
<prop-1> <values...>, <prop-2> <values...>, ..., <prop-n> <values...>
This routine also handles "private", with this_segment being equal
to the token value for the introductory word ("private" or "with"). */
int i, property_name_symbol, property_number, next_prop, length,
individual_property, this_identifier_number;
do
{ get_next_token();
if ((token_type == SEGMENT_MARKER_TT)
|| (token_type == EOF_TT)
|| ((token_type == SEP_TT) && (token_value == SEMICOLON_SEP)))
{ put_token_back(); return;
}
if (token_type != SYMBOL_TT)
{ ebf_error("property name", token_text);
return;
}
individual_property = (stypes[token_value] != PROPERTY_T);
if (individual_property)
{ if (sflags[token_value] & UNKNOWN_SFLAG)
{ this_identifier_number = no_individual_properties++;
assign_symbol(token_value, this_identifier_number,
INDIVIDUAL_PROPERTY_T);
}
else
{ if (stypes[token_value]==INDIVIDUAL_PROPERTY_T)
this_identifier_number = svals[token_value];
else
{ char already_error[128];
sprintf(already_error,
"\"%s\" is a name already in use (with type %s) \
and may not be used as a property name too",
token_text, typename(stypes[token_value]));
error(already_error);
return;
}
}
defined_this_segment[def_t_s++] = token_value;
if (individual_prop_table_size++ == 0)
{ full_object.pp[full_object.l].num = 3;
full_object.pp[full_object.l].l = 1;
full_object.pp[full_object.l].ao[0].value
= individuals_length;
full_object.pp[full_object.l].ao[0].type = LONG_CONSTANT_OT;
full_object.pp[full_object.l].ao[0].marker = INDIVPT_MV;
i_m = individuals_length;
if (!current_defn_is_class)
property3_lists[no_objects] = i_m;
full_object.l++;
}
individuals_table[i_m] = this_identifier_number/256;
if (this_segment == PRIVATE_SEGMENT)
individuals_table[i_m] |= 0x80;
individuals_table[i_m+1] = this_identifier_number%256;
if (module_switch)
backpatch_zmachine(IDENT_MV, INDIVIDUAL_PROP_ZA, i_m);
individuals_table[i_m+2] = 0;
}
else
{ if (sflags[token_value] & UNKNOWN_SFLAG)
{ error_named("No such property name as", token_text);
return;
}
if (this_segment == PRIVATE_SEGMENT)
error_named("Property should be declared in 'with', \
not 'private':", token_text);
defined_this_segment[def_t_s++] = token_value;
property_number = svals[token_value];
next_prop=full_object.l++;
full_object.pp[next_prop].num = property_number;
}
for (i=0; i<(def_t_s-1); i++)
if (defined_this_segment[i] == token_value)
{ error_named("Property given twice in the same declaration:",
(char *) symbs[token_value]);
}
else
if (svals[defined_this_segment[i]] == svals[token_value])
{ char error_b[128];
sprintf(error_b,
"Property given twice in the same declaration, because \
the names '%s' and '%s' actually refer to the same property",
(char *) symbs[defined_this_segment[i]],
(char *) symbs[token_value]);
error(error_b);
}
property_name_symbol = token_value;
sflags[token_value] |= USED_SFLAG;
length=0;
do
{ assembly_operand AO;
get_next_token();
if ((token_type == EOF_TT)
|| ((token_type == SEP_TT) && (token_value == SEMICOLON_SEP))
|| ((token_type == SEP_TT) && (token_value == COMMA_SEP)))
break;
if (token_type == SEGMENT_MARKER_TT) { put_token_back(); break; }
if ((token_type == SEP_TT) && (token_value == OPEN_SQUARE_SEP))
{ char embedded_name[80];
if (current_defn_is_class)
{ sprintf(embedded_name,
"%s::%s", classname_text,
(char *) symbs[property_name_symbol]);
}
else
{ sprintf(embedded_name,
"%s.%s", objectname_text,
(char *) symbs[property_name_symbol]);
}
AO.value = parse_routine(NULL, TRUE, embedded_name, FALSE, -1);
AO.type = LONG_CONSTANT_OT;
AO.marker = IROUTINE_MV;
directives.enabled = FALSE;
segment_markers.enabled = TRUE;
statements.enabled = FALSE;
misc_keywords.enabled = FALSE;
local_variables.enabled = FALSE;
system_functions.enabled = FALSE;
conditions.enabled = FALSE;
}
else
/* A special rule applies to values in double-quotes of the
built-in property "name", which always has number 1: such
property values are dictionary entries and not static
strings */
if ((!individual_property) &&
(property_number==1) && (token_type == DQ_TT))
{ AO.value = dictionary_add(token_text, 0x80, 0, 0);
AO.type = LONG_CONSTANT_OT;
AO.marker = DWORD_MV;
}
else
{ if (length!=0)
{
if ((token_type == SYMBOL_TT)
&& (stypes[token_value]==PROPERTY_T))
{
/* This is not necessarily an error: it's possible
to imagine a property whose value is a list
of other properties to look up, but far more
likely that a comma has been omitted in between
two property blocks */
warning_named(
"Missing ','? Property data seems to contain the property name",
token_text);
}
}
/* An ordinary value, then: */
put_token_back();
AO = parse_expression(ARRAY_CONTEXT);
}
if (length == 64)
{ error_named("Limit (of 32 values) exceeded for property",
(char *) symbs[property_name_symbol]);
break;
}
if (individual_property)
{ if (AO.marker != 0)
backpatch_zmachine(AO.marker, INDIVIDUAL_PROP_ZA,
i_m+3+length);
individuals_table[i_m+3+length++] = AO.value/256;
individuals_table[i_m+3+length++] = AO.value%256;
}
else
{ full_object.pp[next_prop].ao[length/2] = AO;
length = length + 2;
}
} while (TRUE);
/* People rarely do, but it is legal to declare a property without
a value at all:
with name "fish", number, time_left;
in which case the properties "number" and "time_left" are
created as in effect variables and initialised to zero. */
if (length == 0)
{ if (individual_property)
{ individuals_table[i_m+3+length++] = 0;
individuals_table[i_m+3+length++] = 0;
}
else
{ full_object.pp[next_prop].ao[0].value = 0;
full_object.pp[next_prop].ao[0].type = LONG_CONSTANT_OT;
full_object.pp[next_prop].ao[0].marker = 0;
length = 2;
}
}
if ((version_number==3) && (!individual_property))
{ if (length > 8)
{
warning_named("Version 3 limit of 4 values per property exceeded \
(use -v5 to get 32), so truncating property",
(char *) symbs[property_name_symbol]);
full_object.pp[next_prop].l=4;
}
}
if (individual_property)
{ individuals_table[i_m + 2] = length;
individuals_length += length+3;
i_m = individuals_length;
if (individuals_length+64 > MAX_INDIV_PROP_TABLE_SIZE)
memoryerror("MAX_INDIV_PROP_TABLE_SIZE",
MAX_INDIV_PROP_TABLE_SIZE);
}
else
full_object.pp[next_prop].l = length/2;
if ((token_type == EOF_TT)
|| ((token_type == SEP_TT) && (token_value == SEMICOLON_SEP)))
{ put_token_back(); return;
}
} while (TRUE);
}
/* ------------------------------------------------------------------------- */
/* Attributes ("has") segment. */
/* ------------------------------------------------------------------------- */
static void attributes_segment(void)
{
/* Parse through the "has" part of an object/class definition:
[~]<attribute-1> [~]<attribute-2> ... [~]<attribute-n> */
int attribute_number, truth_state;
do
{ truth_state = TRUE;
ParseAttrN:
get_next_token();
if ((token_type == SEGMENT_MARKER_TT)
|| (token_type == EOF_TT)
|| ((token_type == SEP_TT) && (token_value == SEMICOLON_SEP)))
{ if (!truth_state)
ebf_error("attribute name after '~'", token_text);
put_token_back(); return;
}
if ((token_type == SEP_TT) && (token_value == COMMA_SEP)) return;
if ((token_type == SEP_TT) && (token_value == ARTNOT_SEP))
{ truth_state = !truth_state; goto ParseAttrN;
}
if ((token_type != SYMBOL_TT)
|| (stypes[token_value] != ATTRIBUTE_T))
{ ebf_error("name of an already-declared attribute", token_text);
return;
}
attribute_number = svals[token_value];
sflags[token_value] |= USED_SFLAG;
if (truth_state)
full_object.atts[attribute_number/8]
|= (1 << (7-attribute_number%8)); /* Set attribute bit */
else
full_object.atts[attribute_number/8]
&= ~(1 << (7-attribute_number%8)); /* Clear attribute bit */
} while (TRUE);
}
/* ------------------------------------------------------------------------- */
/* Classes ("class") segment. */
/* ------------------------------------------------------------------------- */
static void add_class_to_inheritance_list(int class_number)
{
int i;
/* The class number is actually the class's object number, which needs
to be translated into its actual class number: */
for (i=0;i<no_classes;i++)
if (class_number == class_object_numbers[i])
{ class_number = i+1;
break;
}
/* Remember the inheritance list so that property inheritance can
be sorted out later on, when the definition has been finished: */
classes_to_inherit_from[no_classes_to_inherit_from++] = class_number;
/* Inheriting attributes from the class at once: */
for (i=0; i<6; i++)
full_object.atts[i]
|= properties_table[class_begins_at[class_number-1] - 6 + i];
}
static void classes_segment(void)
{
/* Parse through the "class" part of an object/class definition:
<class-1> ... <class-n> */
do
{ get_next_token();
if ((token_type == SEGMENT_MARKER_TT)
|| (token_type == EOF_TT)
|| ((token_type == SEP_TT) && (token_value == SEMICOLON_SEP)))
{ put_token_back(); return;
}
if ((token_type == SEP_TT) && (token_value == COMMA_SEP)) return;
if ((token_type != SYMBOL_TT)
|| (stypes[token_value] != CLASS_T))
{ ebf_error("name of an already-declared class", token_text);
return;
}
sflags[token_value] |= USED_SFLAG;
add_class_to_inheritance_list(svals[token_value]);
} while (TRUE);
}
/* ------------------------------------------------------------------------- */
/* Parse the body of a Nearby/Object/Class definition. */
/* ------------------------------------------------------------------------- */
static void parse_body_of_definition(void)
{ int commas_in_row;
def_t_s = 0;
do
{ commas_in_row = -1;
do
{ get_next_token(); commas_in_row++;
} while ((token_type == SEP_TT) && (token_value == COMMA_SEP));
if (commas_in_row>1)
error("Two commas ',' in a row in object/class definition");
if ((token_type == EOF_TT)
|| ((token_type == SEP_TT) && (token_value == SEMICOLON_SEP)))
{ if (commas_in_row > 0)
error("Object/class definition finishes with ','");
break;
}
if (token_type != SEGMENT_MARKER_TT)
{ error_named("Expected 'with', 'has' or 'class' in \
object/class definition but found", token_text);
break;
}
else
switch(token_value)
{ case WITH_SEGMENT:
properties_segment(WITH_SEGMENT);
break;
case PRIVATE_SEGMENT:
properties_segment(PRIVATE_SEGMENT);
break;
case HAS_SEGMENT:
attributes_segment();
break;
case CLASS_SEGMENT:
classes_segment();
break;
}
} while (TRUE);
}
/* ------------------------------------------------------------------------- */
/* Class directives: */
/* */
/* Class <name> <body of definition> */
/* ------------------------------------------------------------------------- */
static void initialise_full_object(void)
{ full_object.l = 0;
full_object.atts[0] = 0;
full_object.atts[1] = 0;
full_object.atts[2] = 0;
full_object.atts[3] = 0;
full_object.atts[4] = 0;
full_object.atts[5] = 0;
property3_lists[no_objects] = -1;
}
extern void make_class(char * metaclass_name)
{ int n, duplicates_to_make = 0, class_number = no_objects+1,
metaclass_flag = (metaclass_name != NULL);
char duplicate_name[128]; dbgl start_dbgl = token_line_ref;
current_defn_is_class = TRUE; no_classes_to_inherit_from = 0;
individual_prop_table_size = 0;
if (no_classes==MAX_CLASSES)
memoryerror("MAX_CLASSES", MAX_CLASSES);
if (no_classes==VENEER_CONSTRAINT_ON_CLASSES)
fatalerror("Inform's maximum possible number of classes (whatever \
amount of memory is allocated) has been reached. If this causes serious \
inconvenience, please contact the author.");
directives.enabled = FALSE;
if (metaclass_flag)
{ token_text = metaclass_name;
token_value = symbol_index(token_text, -1);
token_type = SYMBOL_TT;
}
else
{ get_next_token();
if ((token_type != SYMBOL_TT)
|| (!(sflags[token_value] & UNKNOWN_SFLAG)))
{ ebf_error("new class name", token_text);
panic_mode_error_recovery();
return;
}
}
/* Each class also creates a modest object representing itself: */
strcpy(shortname_buffer, token_text);
assign_symbol(token_value, class_number, CLASS_T);
classname_text = (char *) symbs[token_value];
if (metaclass_flag) sflags[token_value] |= SYSTEM_SFLAG;
/* "Class" (object 1) has no parent, whereas all other classes are
the children of "Class". Since "Class" is not present in a module,
a special value is used which is corrected to 1 by the linker. */
if (metaclass_flag) parent_of_this_obj = 0;
else parent_of_this_obj = (module_switch)?0x7fff:1;
class_object_numbers[no_classes] = class_number;
initialise_full_object();
/* Give the class the (nameless in Inform syntax) "inheritance" property
with value its own class number. (This therefore accumulates onto
the inheritance property of any object inheriting from the class,
since property 2 is always set to "additive" -- see below) */
full_object.l = 1;
full_object.pp[0].num = 2;
full_object.pp[0].l = 1;
full_object.pp[0].ao[0].value = no_objects + 1;
full_object.pp[0].ao[0].type = LONG_CONSTANT_OT;
full_object.pp[0].ao[0].marker = OBJECT_MV;
if (!metaclass_flag)
{ get_next_token();
if ((token_type == SEP_TT) && (token_value == OPENB_SEP))
{ assembly_operand AO;
AO = parse_expression(CONSTANT_CONTEXT);
if (module_switch && (AO.marker != 0))
{ error("Duplicate-number not known at compile time");
n=0;
}
else
n = AO.value;
if ((n<0) || (n>10000))
{ error("The number of duplicates must be 0 to 10000");
n=0;
}
/* Make one extra duplicate, since the veneer routines need
always to keep an undamaged prototype for the class in stock */
duplicates_to_make = n + 1;
match_close_bracket();
} else put_token_back();
/* Parse the body of the definition: */
parse_body_of_definition();
}
if (debugfile_switch)
{ write_debug_byte(CLASS_DBR);
write_debug_string(shortname_buffer);
write_dbgl(start_dbgl);
write_dbgl(token_line_ref);
}
manufacture_object();
if (individual_prop_table_size >= VENEER_CONSTRAINT_ON_IP_TABLE_SIZE)
error("This class is too complex: it now carries too many properties. \
You may be able to get round this by declaring some of its property names as \
\"common properties\" using the 'Property' directive.");
if (duplicates_to_make > 0)
{ sprintf(duplicate_name, "%s_1", shortname_buffer);
for (n=1; (duplicates_to_make--) > 0; n++)
{ if (n>1)
{ int i = strlen(duplicate_name);
while (duplicate_name[i] != '_') i--;
sprintf(duplicate_name+i+1, "%d", n);
}
make_object(FALSE, duplicate_name, class_number, class_number, -1);
}
}
}
/* ------------------------------------------------------------------------- */
/* Object/Nearby directives: */
/* */
/* Object <name-1> ... <name-n> "short name" [parent] <body of def> */
/* */
/* Nearby <name-1> ... <name-n> "short name" <body of definition> */
/* ------------------------------------------------------------------------- */
static int end_of_header(void)
{ if (((token_type == SEP_TT) && (token_value == SEMICOLON_SEP))
|| ((token_type == SEP_TT) && (token_value == COMMA_SEP))
|| (token_type == SEGMENT_MARKER_TT)) return TRUE;
return FALSE;
}
extern void make_object(int nearby_flag,
char *textual_name, int specified_parent, int specified_class,
int instance_of)
{
/* Ordinarily this is called with nearby_flag TRUE for "Nearby",
FALSE for "Object"; and textual_name NULL, specified_parent and
specified_class both -1. The next three arguments are used when
the routine is called for class duplicates manufacture (see above).
The last is used to create instances of a particular class. */
int i, tree_depth, internal_name_symbol = 0;
char internal_name[64];
dbgl start_dbgl = token_line_ref;
directives.enabled = FALSE;
if (no_objects==MAX_OBJECTS) memoryerror("MAX_OBJECTS", MAX_OBJECTS);
sprintf(internal_name, "nameless_obj__%d", no_objects+1);
objectname_text = internal_name;
current_defn_is_class = FALSE;
no_classes_to_inherit_from=0;
individual_prop_table_size = 0;
if (nearby_flag) tree_depth=1; else tree_depth=0;
if (specified_class != -1) goto HeaderPassed;
get_next_token();
/* Read past and count a sequence of "->"s, if any are present */
if ((token_type == SEP_TT) && (token_value == ARROW_SEP))
{ if (nearby_flag)
error("The syntax '->' is only used as an alternative to 'Nearby'");
while ((token_type == SEP_TT) && (token_value == ARROW_SEP))
{ tree_depth++;
get_next_token();
}
}
sprintf(shortname_buffer, "?");
segment_markers.enabled = TRUE;
/* This first word is either an internal name, or a textual short name,
or the end of the header part */
if (end_of_header()) goto HeaderPassed;
if (token_type == DQ_TT) textual_name = token_text;
else
{ if ((token_type != SYMBOL_TT)
|| (!(sflags[token_value] & UNKNOWN_SFLAG)))
ebf_error("name for new object or its textual short name",
token_text);
else
{ internal_name_symbol = token_value;
strcpy(internal_name, token_text);
}
}
/* The next word is either a parent object, or
a textual short name, or the end of the header part */
get_next_token();
if (end_of_header()) goto HeaderPassed;
if (token_type == DQ_TT)
{ if (textual_name != NULL)
error("Two textual short names given for only one object");
else
textual_name = token_text;
}
else
{ if ((token_type != SYMBOL_TT)
|| (sflags[token_value] & UNKNOWN_SFLAG))
{ if (textual_name == NULL)
ebf_error("parent object or the object's textual short name",
token_text);
else
ebf_error("parent object", token_text);
}
else goto SpecParent;
}
/* Finally, it's possible that there is still a parent object */
get_next_token();
if (end_of_header()) goto HeaderPassed;
if (specified_parent != -1)
ebf_error("body of object definition", token_text);
else
{ SpecParent:
if ((stypes[token_value] == OBJECT_T)
|| (stypes[token_value] == CLASS_T))
{ specified_parent = svals[token_value];
sflags[token_value] |= USED_SFLAG;
}
else ebf_error("name of (the parent) object", token_text);
}
/* Now it really has to be the body of the definition. */
get_next_token();
if (end_of_header()) goto HeaderPassed;
ebf_error("body of object definition", token_text);
HeaderPassed:
if (specified_class == -1) put_token_back();
if (internal_name_symbol > 0)
assign_symbol(internal_name_symbol, no_objects + 1, OBJECT_T);
if (listobjects_switch)
printf("%3d \"%s\"\n", no_objects+1,
(textual_name==NULL)?"(with no short name)":textual_name);
if (textual_name == NULL)
{ if (internal_name_symbol > 0)
sprintf(shortname_buffer, "(%s)",
(char *) symbs[internal_name_symbol]);
else
sprintf(shortname_buffer, "(%d)", no_objects+1);
}
else strcpy(shortname_buffer, textual_name);
if (specified_parent != -1)
{ if (tree_depth > 0)
error("Use of '->' (or 'Nearby') clashes with giving a parent");
parent_of_this_obj = specified_parent;
}
else
{ parent_of_this_obj = 0;
if (tree_depth>0)
{
/* We have to set the parent object to the most recently defined
object at level (tree_depth - 1) in the tree.
A complication is that objects are numbered 1, 2, ... in the
Z-machine (and in the objects[].parent, etc., fields) but
0, 1, 2, ... internally (and as indices to object[]). */
for (i=no_objects-1; i>=0; i--)
{ int j = i, k = 0;
/* Metaclass or class objects cannot be '->' parents: */
if (((!module_switch) && (i<4)) || (objects[i].parent == 1))
continue;
while (objects[j].parent != 0)
{ j = objects[j].parent - 1; k++; }
if (k == tree_depth - 1)
{ parent_of_this_obj = i+1;
break;
}
}
if (parent_of_this_obj == 0)
{ if (tree_depth == 1)
error("'->' (or 'Nearby') fails because there is no previous object");
else
error("'-> -> ...' fails because no previous object is deep enough");
}
}
}
initialise_full_object();
if (instance_of != -1) add_class_to_inheritance_list(instance_of);
if (specified_class == -1) parse_body_of_definition();
else add_class_to_inheritance_list(specified_class);
if (debugfile_switch)
{ write_debug_byte(OBJECT_DBR);
write_debug_byte((no_objects+1)/256);
write_debug_byte((no_objects+1)%256);
write_debug_string(internal_name);
write_dbgl(start_dbgl);
write_dbgl(token_line_ref);
}
manufacture_object();
}
/* ========================================================================= */
/* Data structure management routines */
/* ------------------------------------------------------------------------- */
extern void init_objects_vars(void)
{
properties_table = NULL;
objects = NULL;
classes_to_inherit_from = NULL;
class_begins_at = NULL;
}
extern void objects_begin_pass(void)
{
properties_table_size=0;
prop_is_long[1] = TRUE; prop_is_additive[1] = TRUE; /* "name" */
prop_is_long[2] = TRUE; prop_is_additive[2] = TRUE; /* inheritance prop */
prop_is_long[3] = TRUE; prop_is_additive[3] = FALSE;
/* instance variables table address */
no_properties = 4;
if (define_INFIX_switch) no_attributes = 1;
else no_attributes = 0;
no_objects = 0;
objects[0].parent = 0; objects[0].child = 0; objects[0].next = 0;
no_classes = 0;
no_embedded_routines = 0;
no_individual_properties=72;
individuals_length=0;
}
extern void objects_allocate_arrays(void)
{
objects = my_calloc(sizeof(objectt), MAX_OBJECTS, "objects");
classes_to_inherit_from = my_calloc(sizeof(int), MAX_CLASSES,
"inherited classes list");
class_begins_at = my_calloc(sizeof(int32), MAX_CLASSES,
"pointers to classes");
class_object_numbers = my_calloc(sizeof(int), MAX_CLASSES,
"class object numbers");
properties_table = my_malloc(MAX_PROP_TABLE_SIZE,"properties table");
individuals_table = my_malloc(MAX_INDIV_PROP_TABLE_SIZE,
"individual properties table");
property3_lists = my_calloc(sizeof(int), MAX_OBJECTS,
"property 3 lists");
}
extern void objects_free_arrays(void)
{
my_free(&objects, "objects");
my_free(&class_object_numbers,"class object numbers");
my_free(&classes_to_inherit_from, "inherited classes list");
my_free(&class_begins_at, "pointers to classes");
my_free(&properties_table, "properties table");
my_free(&property3_lists, "property 3 lists");
my_free(&individuals_table,"individual properties table");
}
/* ========================================================================= */
|