16 * 12500 WORDS OF MESSAGE TEXT (LINES, LINSIZ).
17 * 885 TRAVEL OPTIONS (TRAVEL, TRVSIZ).
18 * 330 VOCABULARY WORDS (KTAB, ATAB, TABSIZ).
19 * 185 LOCATIONS (LTEXT, STEXT, KEY, COND, ABB, ATLOC, LOCSND, LOCSIZ).
20 * 100 OBJECTS (PLAC, PLACE, FIXD, FIXED, LINK (TWICE), PTEXT, PROP,
22 * 35 "ACTION" VERBS (ACTSPK, VRBSIZ).
23 * 277 RANDOM MESSAGES (RTEXT, RTXSIZ).
24 * 12 DIFFERENT PLAYER CLASSIFICATIONS (CTEXT, CVAL, CLSMAX).
25 * 20 HINTS (HINTLC, HINTED, HINTS, HNTSIZ).
26 * 5 "# OF TURNS" THRESHHOLDS (TTEXT, TRNVAL, TRNSIZ).
27 * THERE ARE ALSO LIMITS WHICH CANNOT BE EXCEEDED DUE TO THE STRUCTURE OF
28 * THE DATABASE. (E.G., THE VOCABULARY USES N/1000 TO DETERMINE WORD TYPE,
29 * SO THERE CAN'T BE MORE THAN 1000 WORDS.) THESE UPPER LIMITS ARE:
30 * 1000 NON-SYNONYMOUS VOCABULARY WORDS
35 /* DESCRIPTION OF THE DATABASE FORMAT
38 * THE DATA FILE CONTAINS SEVERAL SECTIONS. EACH BEGINS WITH A LINE CONTAINING
39 * A NUMBER IDENTIFYING THE SECTION, AND ENDS WITH A LINE CONTAINING "-1".
41 * SECTION 1: LONG FORM DESCRIPTIONS. EACH LINE CONTAINS A LOCATION NUMBER,
42 * A TAB, AND A LINE OF TEXT. THE SET OF (NECESSARILY ADJACENT) LINES
43 * WHOSE NUMBERS ARE X FORM THE LONG DESCRIPTION OF LOCATION X.
44 * SECTION 2: SHORT FORM DESCRIPTIONS. SAME FORMAT AS LONG FORM. NOT ALL
45 * PLACES HAVE SHORT DESCRIPTIONS.
46 * SECTION 3: TRAVEL TABLE. EACH LINE CONTAINS A LOCATION NUMBER (X), A SECOND
47 * LOCATION NUMBER (Y), AND A LIST OF MOTION NUMBERS (SEE SECTION 4).
48 * EACH MOTION REPRESENTS A VERB WHICH WILL GO TO Y IF CURRENTLY AT X.
49 * Y, IN TURN, IS INTERPRETED AS FOLLOWS. LET M=Y/1000, N=Y MOD 1000.
50 * IF N<=300 IT IS THE LOCATION TO GO TO.
51 * IF 300<N<=500 N-300 IS USED IN A COMPUTED GOTO TO
52 * A SECTION OF SPECIAL CODE.
53 * IF N>500 MESSAGE N-500 FROM SECTION 6 IS PRINTED,
54 * AND HE STAYS WHEREVER HE IS.
55 * MEANWHILE, M SPECIFIES THE CONDITIONS ON THE MOTION.
56 * IF M=0 IT'S UNCONDITIONAL.
57 * IF 0<M<100 IT IS DONE WITH M% PROBABILITY.
58 * IF M=100 UNCONDITIONAL, BUT FORBIDDEN TO DWARVES.
59 * IF 100<M<=200 HE MUST BE CARRYING OBJECT M-100.
60 * IF 200<M<=300 MUST BE CARRYING OR IN SAME ROOM AS M-200.
61 * IF 300<M<=400 PROP(M MOD 100) MUST *NOT* BE 0.
62 * IF 400<M<=500 PROP(M MOD 100) MUST *NOT* BE 1.
63 * IF 500<M<=600 PROP(M MOD 100) MUST *NOT* BE 2, ETC.
64 * IF THE CONDITION (IF ANY) IS NOT MET, THEN THE NEXT *DIFFERENT*
65 * "DESTINATION" VALUE IS USED (UNLESS IT FAILS TO MEET *ITS* CONDITIONS,
66 * IN WHICH CASE THE NEXT IS FOUND, ETC.). TYPICALLY, THE NEXT DEST WILL
67 * BE FOR ONE OF THE SAME VERBS, SO THAT ITS ONLY USE IS AS THE ALTERNATE
68 * DESTINATION FOR THOSE VERBS. FOR INSTANCE:
69 * 15 110022 29 31 34 35 23 43
71 * THIS SAYS THAT, FROM LOC 15, ANY OF THE VERBS 29, 31, ETC., WILL TAKE
72 * HIM TO 22 IF HE'S CARRYING OBJECT 10, AND OTHERWISE WILL GO TO 14.
75 * THIS SAYS THAT, FROM 11, 49 TAKES HIM TO 8 UNLESS PROP(3)=0, IN WHICH
76 * CASE HE GOES TO 9. VERB 50 TAKES HIM TO 9 REGARDLESS OF PROP(3).
77 * SECTION 4: VOCABULARY. EACH LINE CONTAINS A NUMBER (N), A TAB, AND A
78 * FIVE-LETTER WORD. CALL M=N/1000. IF M=0, THEN THE WORD IS A MOTION
79 * VERB FOR USE IN TRAVELLING (SEE SECTION 3). ELSE, IF M=1, THE WORD IS
80 * AN OBJECT. ELSE, IF M=2, THE WORD IS AN ACTION VERB (SUCH AS "CARRY"
81 * OR "ATTACK"). ELSE, IF M=3, THE WORD IS A SPECIAL CASE VERB (SUCH AS
82 * "DIG") AND N MOD 1000 IS AN INDEX INTO SECTION 6. OBJECTS FROM 50 TO
83 * (CURRENTLY, ANYWAY) 79 ARE CONSIDERED TREASURES (FOR PIRATE, CLOSEOUT).
84 * SECTION 5: OBJECT DESCRIPTIONS. EACH LINE CONTAINS A NUMBER (N), A TAB,
85 * AND A MESSAGE. IF N IS FROM 1 TO 100, THE MESSAGE IS THE "INVENTORY"
86 * MESSAGE FOR OBJECT N. OTHERWISE, N SHOULD BE 000, 100, 200, ETC., AND
87 * THE MESSAGE SHOULD BE THE DESCRIPTION OF THE PRECEDING OBJECT WHEN ITS
88 * PROP VALUE IS N/100. THE N/100 IS USED ONLY TO DISTINGUISH MULTIPLE
89 * MESSAGES FROM MULTI-LINE MESSAGES; THE PROP INFO ACTUALLY REQUIRES ALL
90 * MESSAGES FOR AN OBJECT TO BE PRESENT AND CONSECUTIVE. PROPERTIES WHICH
91 * PRODUCE NO MESSAGE SHOULD BE GIVEN THE MESSAGE ">$<".
92 * SECTION 6: ARBITRARY MESSAGES. SAME FORMAT AS SECTIONS 1, 2, AND 5, EXCEPT
93 * THE NUMBERS BEAR NO RELATION TO ANYTHING (EXCEPT FOR SPECIAL VERBS
95 * SECTION 7: OBJECT LOCATIONS. EACH LINE CONTAINS AN OBJECT NUMBER AND ITS
96 * INITIAL LOCATION (ZERO (OR OMITTED) IF NONE). IF THE OBJECT IS
97 * IMMOVABLE, THE LOCATION IS FOLLOWED BY A "-1". IF IT HAS TWO LOCATIONS
98 * (E.G. THE GRATE) THE FIRST LOCATION IS FOLLOWED WITH THE SECOND, AND
99 * THE OBJECT IS ASSUMED TO BE IMMOVABLE.
100 * SECTION 8: ACTION DEFAULTS. EACH LINE CONTAINS AN "ACTION-VERB" NUMBER AND
101 * THE INDEX (IN SECTION 6) OF THE DEFAULT MESSAGE FOR THE VERB.
102 * SECTION 9: LOCATION ATTRIBUTES. EACH LINE CONTAINS A NUMBER (N) AND UP TO
103 * 20 LOCATION NUMBERS. BIT N (WHERE 0 IS THE UNITS BIT) IS SET IN
104 * COND(LOC) FOR EACH LOC GIVEN. THE COND BITS CURRENTLY ASSIGNED ARE:
106 * 1 IF BIT 2 IS ON: ON FOR OIL, OFF FOR WATER
107 * 2 LIQUID ASSET, SEE BIT 1
108 * 3 PIRATE DOESN'T GO HERE UNLESS FOLLOWING PLAYER
109 * 4 CANNOT USE "BACK" TO MOVE AWAY
110 * BITS PAST 10 INDICATE AREAS OF INTEREST TO "HINT" ROUTINES:
111 * 11 TRYING TO GET INTO CAVE
112 * 12 TRYING TO CATCH BIRD
113 * 13 TRYING TO DEAL WITH SNAKE
115 * 15 PONDERING DARK ROOM
119 * 19 TRYING TO DEAL WITH OGRE
120 * 20 FOUND ALL TREASURES EXCEPT JADE
121 * COND(LOC) IS SET TO 2, OVERRIDING ALL OTHER BITS, IF LOC HAS FORCED
123 * SECTION 10: CLASS MESSAGES. EACH LINE CONTAINS A NUMBER (N), A TAB, AND A
124 * MESSAGE DESCRIBING A CLASSIFICATION OF PLAYER. THE SCORING SECTION
125 * SELECTS THE APPROPRIATE MESSAGE, WHERE EACH MESSAGE IS CONSIDERED TO
126 * APPLY TO PLAYERS WHOSE SCORES ARE HIGHER THAN THE PREVIOUS N BUT NOT
127 * HIGHER THAN THIS N. NOTE THAT THESE SCORES PROBABLY CHANGE WITH EVERY
128 * MODIFICATION (AND PARTICULARLY EXPANSION) OF THE PROGRAM.
129 * SECTION 11: HINTS. EACH LINE CONTAINS A HINT NUMBER (ADD 10 TO GET COND
130 * BIT; SEE SECTION 9), THE NUMBER OF TURNS HE MUST BE AT THE RIGHT LOC(S)
131 * BEFORE TRIGGERING THE HINT, THE POINTS DEDUCTED FOR TAKING THE HINT,
132 * THE MESSAGE NUMBER (SECTION 6) OF THE QUESTION, AND THE MESSAGE NUMBER
133 * OF THE HINT. THESE VALUES ARE STASHED IN THE "HINTS" ARRAY. HNTMAX IS
134 * SET TO THE MAX HINT NUMBER (<= HNTSIZ).
135 * SECTION 12: UNUSED IN THIS VERSION.
136 * SECTION 13: SOUNDS AND TEXT. EACH LINE CONTAINS EITHER 2 OR 3 NUMBERS. IF
137 * 2 (CALL THEM N AND S), N IS A LOCATION AND MESSAGE ABS(S) FROM SECTION
138 * 6 IS THE SOUND HEARD THERE. IF S<0, THE SOUND THERE DROWNS OUT ALL
139 * OTHER NOISES. IF 3 NUMBERS (CALL THEM N, S, AND T), N IS AN OBJECT
140 * NUMBER AND S+PROP(N) IS THE PROPERTY MESSAGE (FROM SECTION 5) IF HE
141 * LISTENS TO THE OBJECT, AND T+PROP(N) IS THE TEXT IF HE READS IT. IF
142 * S OR T IS -1, THE OBJECT HAS NO SOUND OR TEXT, RESPECTIVELY. NEITHER
143 * S NOR T IS ALLOWED TO BE 0.
144 * SECTION 14: TURN THRESHHOLDS. EACH LINE CONTAINS A NUMBER (N), A TAB, AND
145 * A MESSAGE BERATING THE PLAYER FOR TAKING SO MANY TURNS. THE MESSAGES
146 * MUST BE IN THE PROPER (ASCENDING) ORDER. THE MESSAGE GETS PRINTED IF
147 * THE PLAYER EXCEEDS N MOD 100000 TURNS, AT WHICH TIME N/100000 POINTS
148 * GET DEDUCTED FROM HIS SCORE.
149 * SECTION 0: END OF DATABASE. */
151 /* THE VARIOUS MESSAGES (SECTIONS 1, 2, 5, 6, ETC.) MAY INCLUDE CERTAIN
152 * SPECIAL CHARACTER SEQUENCES TO DENOTE THAT THE PROGRAM MUST PROVIDE
153 * PARAMETERS TO INSERT INTO A MESSAGE WHEN THE MESSAGE IS PRINTED. THESE
155 * %S = THE LETTER 'S' OR NOTHING (IF A GIVEN VALUE IS EXACTLY 1)
156 * %W = A WORD (UP TO 10 CHARACTERS)
157 * %L = A WORD MAPPED TO LOWER-CASE LETTERS
158 * %U = A WORD MAPPED TO UPPER-CASE LETTERS
159 * %C = A WORD MAPPED TO LOWER-CASE, FIRST LETTER CAPITALISED
160 * %T = SEVERAL WORDS OF TEXT, ENDING WITH A WORD OF -1
161 * %1 = A 1-DIGIT NUMBER
162 * %2 = A 2-DIGIT NUMBER
164 * %9 = A 9-DIGIT NUMBER
165 * %B = VARIABLE NUMBER OF BLANKS
166 * %! = THE ENTIRE MESSAGE SHOULD BE SUPPRESSED */
168 static bool quick_init(void);
169 static int raw_init(void);
170 static void report(void);
171 static void quick_save(void);
172 static int finish_init(void);
173 static void quick_io(void);
176 printf("Initialising...\n");
177 if(!quick_init()){raw_init(); report(); quick_save();}
181 static int raw_init(void) {
182 printf("Couldn't find adventure.data, using adventure.text...\n");
184 /* CLEAR OUT THE VARIOUS TEXT-POINTER ARRAYS. ALL TEXT IS STORED IN ARRAY
185 * LINES; EACH LINE IS PRECEDED BY A WORD POINTING TO THE NEXT POINTER (I.E.
186 * THE WORD FOLLOWING THE END OF THE LINE). THE POINTER IS NEGATIVE IF THIS IS
187 * FIRST LINE OF A MESSAGE. THE TEXT-POINTER ARRAYS CONTAIN INDICES OF
188 * POINTER-WORDS IN LINES. STEXT(N) IS SHORT DESCRIPTION OF LOCATION N.
189 * LTEXT(N) IS LONG DESCRIPTION. PTEXT(N) POINTS TO MESSAGE FOR PROP(N)=0.
190 * SUCCESSIVE PROP MESSAGES ARE FOUND BY CHASING POINTERS. RTEXT CONTAINS
191 * SECTION 6'S STUFF. CTEXT(N) POINTS TO A PLAYER-CLASS MESSAGE. TTEXT IS FOR
192 * SECTION 14. WE ALSO CLEAR COND (SEE DESCRIPTION OF SECTION 9 FOR DETAILS). */
194 /* 1001 */ for (I=1; I<=300; I++) {
195 if(I <= 100)PTEXT[I]=0;
196 if(I <= RTXSIZ)RTEXT[I]=0;
197 if(I <= CLSMAX)CTEXT[I]=0;
198 if(I <= 100)OBJSND[I]=0;
199 if(I <= 100)OBJTXT[I]=0;
200 if(I > LOCSIZ) goto L1001;
214 /* START NEW DATA SECTION. SECT IS THE SECTION NUMBER. */
216 L1002: SECT=GETNUM(1);
218 switch (SECT) { case 0: return(0); case 1: goto L1004; case 2: goto
219 L1004; case 3: goto L1030; case 4: goto L1040; case 5: goto L1004;
220 case 6: goto L1004; case 7: goto L1050; case 8: goto L1060; case
221 9: goto L1070; case 10: goto L1004; case 11: goto L1080; case 12:
222 break; case 13: goto L1090; case 14: goto L1004; }
223 /* (0) (1) (2) (3) (4) (5) (6) (7) (8) (9)
224 * (10) (11) (12) (13) (14) */
227 /* SECTIONS 1, 2, 5, 6, 10, 14. READ MESSAGES AND SET UP POINTERS. */
232 if(LNLENG >= LNPOSN+70)BUG(0);
233 if(LOC == -1) goto L1002;
234 if(LNLENG < LNPOSN)BUG(1);
236 if(KK >= LINSIZ)BUG(2);
237 LINES[KK]=GETTXT(FALSE,FALSE,FALSE,KK);
238 if(LINES[KK] != -1) goto L1006;
240 if(LOC == OLDLOC) goto L1005;
243 if(SECT == 14) goto L1014;
244 if(SECT == 10) goto L1012;
245 if(SECT == 6) goto L1011;
246 if(SECT == 5) goto L1010;
247 if(LOC > LOCSIZ)BUG(10);
248 if(SECT == 1) goto L1008;
253 L1008: LTEXT[LOC]=LINUSE;
256 L1010: if(LOC > 0 && LOC <= 100)PTEXT[LOC]=LINUSE;
259 L1011: if(LOC > RTXSIZ)BUG(6);
263 L1012: CLSSES=CLSSES+1;
264 if(CLSSES > CLSMAX)BUG(11);
265 CTEXT[CLSSES]=LINUSE;
269 L1014: TRNVLS=TRNVLS+1;
270 if(TRNVLS > TRNSIZ)BUG(11);
271 TTEXT[TRNVLS]=LINUSE;
275 /* THE STUFF FOR SECTION 3 IS ENCODED HERE. EACH "FROM-LOCATION" GETS A
276 * CONTIGUOUS SECTION OF THE "TRAVEL" ARRAY. EACH ENTRY IN TRAVEL IS
277 * NEWLOC*1000 + KEYWORD (FROM SECTION 4, MOTION VERBS), AND IS NEGATED IF
278 * THIS IS THE LAST ENTRY FOR THIS LOCATION. KEY(N) IS THE INDEX IN TRAVEL
279 * OF THE FIRST OPTION AT LOCATION N. */
281 L1030: LOC=GETNUM(1);
282 if(LOC == -1) goto L1002;
284 if(KEY[LOC] != 0) goto L1033;
287 L1033: TRVS--; TRAVEL[TRVS]= -TRAVEL[TRVS]; TRVS++;
289 if(L == 0) goto L1039;
290 TRAVEL[TRVS]=NEWLOC*1000+L;
292 if(TRVS == TRVSIZ)BUG(3);
294 L1039: TRVS--; TRAVEL[TRVS]= -TRAVEL[TRVS]; TRVS++;
297 /* HERE WE READ IN THE VOCABULARY. KTAB(N) IS THE WORD NUMBER, ATAB(N) IS
298 * THE CORRESPONDING WORD. THE -1 AT THE END OF SECTION 4 IS LEFT IN KTAB
299 * AS AN END-MARKER. THE WORDS ARE GIVEN A MINIMAL HASH TO MAKE DECIPHERING
300 * THE CORE-IMAGE HARDER. (WE DON'T USE GETTXT'S HASH SINCE THAT WOULD FORCE
301 * US TO HASH EACH INPUT LINE TO MAKE COMPARISONS WORK, AND THAT IN TURN
302 * WOULD MAKE IT HARDER TO DETECT PARTICULAR INPUT WORDS.) */
305 /* 1042 */ for (TABNDX=1; TABNDX<=TABSIZ; TABNDX++) {
306 L1043: KTAB[TABNDX]=GETNUM(1);
307 if(KTAB[TABNDX] == -1) goto L1002;
309 L1042: ATAB[TABNDX]=GETTXT(TRUE,TRUE,TRUE,0)+J*J;
313 /* READ IN THE INITIAL LOCATIONS FOR EACH OBJECT. ALSO THE IMMOVABILITY INFO.
314 * PLAC CONTAINS INITIAL LOCATIONS OF OBJECTS. FIXD IS -1 FOR IMMOVABLE
315 * OBJECTS (INCLUDING THE SNAKE), OR = SECOND LOC FOR TWO-PLACED OBJECTS. */
317 L1050: OBJ=GETNUM(1);
318 if(OBJ == -1) goto L1002;
323 /* READ DEFAULT MESSAGE NUMBERS FOR ACTION VERBS, STORE IN ACTSPK. */
325 L1060: VERB=GETNUM(1);
326 if(VERB == -1) goto L1002;
327 ACTSPK[VERB]=GETNUM(0);
330 /* READ INFO ABOUT AVAILABLE LIQUIDS AND OTHER CONDITIONS, STORE IN COND. */
333 if(K == -1) goto L1002;
334 L1071: LOC=GETNUM(0);
335 if(LOC == 0) goto L1070;
336 if(CNDBIT(LOC,K)) BUG(8);
337 COND[LOC]=COND[LOC]+SETBIT(K);
340 /* READ DATA FOR HINTS. */
344 if(K == -1) goto L1002;
345 if(K <= 0 || K > HNTSIZ)BUG(7);
346 /* 1083 */ for (I=1; I<=4; I++) {
347 L1083: HINTS[K][I] =GETNUM(0);
349 HNTMAX=(HNTMAX>K ? HNTMAX : K);
352 /* READ THE SOUND/TEXT INFO, STORE IN OBJSND, OBJTXT, LOCSND. */
355 if(K == -1) goto L1002;
358 if(I == 0) goto L1092;
359 OBJSND[K]=(KK>0 ? KK : 0);
360 OBJTXT[K]=(I>0 ? I : 0);
367 /* FINISH CONSTRUCTING INTERNAL DATA FORMAT */
369 /* HAVING READ IN THE DATABASE, CERTAIN THINGS ARE NOW CONSTRUCTED. PROPS ARE
370 * SET TO ZERO. WE FINISH SETTING UP COND BY CHECKING FOR FORCED-MOTION TRAVEL
371 * ENTRIES. THE PLAC AND FIXD ARRAYS ARE USED TO SET UP ATLOC(N) AS THE FIRST
372 * OBJECT AT LOCATION N, AND LINK(OBJ) AS THE NEXT OBJECT AT THE SAME LOCATION
373 * AS OBJ. (OBJ>100 INDICATES THAT FIXED(OBJ-100)=LOC; LINK(OBJ) IS STILL THE
374 * CORRECT LINK TO USE.) ABB IS ZEROED; IT CONTROLS WHETHER THE ABBREVIATED
375 * DESCRIPTION IS PRINTED. COUNTS MOD 5 UNLESS "LOOK" IS USED. */
377 static int finish_init(void) {
378 /* 1101 */ for (I=1; I<=100; I++) {
382 L1101: {long x = I+100; LINK[x]=0;}
385 /* 1102 */ for (I=1; I<=LOCSIZ; I++) {
387 if(LTEXT[I] == 0 || KEY[I] == 0) goto L1102;
389 if(MOD(IABS(TRAVEL[K]),1000) == 1)COND[I]=2;
393 /* SET UP THE ATLOC AND LINK ARRAYS AS DESCRIBED ABOVE. WE'LL USE THE DROP
394 * SUBROUTINE, WHICH PREFACES NEW OBJECTS ON THE LISTS. SINCE WE WANT THINGS
395 * IN THE OTHER ORDER, WE'LL RUN THE LOOP BACKWARDS. IF THE OBJECT IS IN TWO
396 * LOCS, WE DROP IT TWICE. THIS ALSO SETS UP "PLACE" AND "FIXED" AS COPIES OF
397 * "PLAC" AND "FIXD". ALSO, SINCE TWO-PLACED OBJECTS ARE TYPICALLY BEST
398 * DESCRIBED LAST, WE'LL DROP THEM FIRST. */
400 /* 1106 */ for (I=1; I<=100; I++) {
402 if(FIXD[K] <= 0) goto L1106;
408 /* 1107 */ for (I=1; I<=100; I++) {
411 L1107: if(PLAC[K] != 0 && FIXD[K] <= 0)DROP(K,PLAC[K]);
414 /* TREASURES, AS NOTED EARLIER, ARE OBJECTS 50 THROUGH MAXTRS (CURRENTLY 79).
415 * THEIR PROPS ARE INITIALLY -1, AND ARE SET TO 0 THE FIRST TIME THEY ARE
416 * DESCRIBED. TALLY KEEPS TRACK OF HOW MANY ARE NOT YET FOUND, SO WE KNOW
417 * WHEN TO CLOSE THE CAVE. */
421 /* 1200 */ for (I=50; I<=MAXTRS; I++) {
422 if(PTEXT[I] != 0)PROP[I]= -1;
423 L1200: TALLY=TALLY-PROP[I];
426 /* CLEAR THE HINT STUFF. HINTLC(I) IS HOW LONG HE'S BEEN AT LOC WITH COND BIT
427 * I. HINTED(I) IS TRUE IFF HINT I HAS BEEN USED. */
429 /* 1300 */ for (I=1; I<=HNTMAX; I++) {
434 /* DEFINE SOME HANDY MNEMONICS. THESE CORRESPOND TO OBJECT NUMBERS. */
437 BATTER=VOCWRD(201202005,1);
438 BEAR=VOCWRD(2050118,1);
439 BIRD=VOCWRD(2091804,1);
440 BLOOD=VOCWRD(212151504,1);
441 BOTTLE=VOCWRD(215202012,1);
442 CAGE=VOCWRD(3010705,1);
443 CAVITY=VOCWRD(301220920,1);
444 CHASM=VOCWRD(308011913,1);
445 CLAM=VOCWRD(3120113,1);
446 DOOR=VOCWRD(4151518,1);
447 DRAGON=VOCWRD(418010715,1);
448 DWARF=VOCWRD(423011806,1);
449 FISSUR=VOCWRD(609191921,1);
450 FOOD=VOCWRD(6151504,1);
451 GRATE=VOCWRD(718012005,1);
452 KEYS=VOCWRD(11052519,1);
453 KNIFE=VOCWRD(1114090605,1);
454 LAMP=VOCWRD(12011316,1);
455 MAGZIN=VOCWRD(1301070126,1);
456 MESSAG=VOCWRD(1305191901,1);
457 MIRROR=VOCWRD(1309181815,1);
458 OGRE=VOCWRD(15071805,1);
459 OIL=VOCWRD(150912,1);
460 OYSTER=VOCWRD(1525192005,1);
461 PILLOW=VOCWRD(1609121215,1);
462 PLANT=VOCWRD(1612011420,1);
464 RESER=VOCWRD(1805190518,1);
465 ROD=VOCWRD(181504,1);
467 SIGN=VOCWRD(19090714,1);
468 SNAKE=VOCWRD(1914011105,1);
469 STEPS=VOCWRD(1920051619,1);
470 TROLL=VOCWRD(2018151212,1);
472 URN=VOCWRD(211814,1);
473 VEND=VOCWRD(1755140409,1);
474 VOLCAN=VOCWRD(1765120301,1);
475 WATER=VOCWRD(1851200518,1);
477 /* OBJECTS FROM 50 THROUGH WHATEVER ARE TREASURES. HERE ARE A FEW. */
479 AMBER=VOCWRD(113020518,1);
480 CHAIN=VOCWRD(308010914,1);
481 CHEST=VOCWRD(308051920,1);
482 COINS=VOCWRD(315091419,1);
483 EGGS=VOCWRD(5070719,1);
484 EMRALD=VOCWRD(513051801,1);
485 JADE=VOCWRD(10010405,1);
486 NUGGET=VOCWRD(7151204,1);
487 PEARL=VOCWRD(1605011812,1);
488 PYRAM=VOCWRD(1625180113,1);
489 RUBY=VOCWRD(18210225,1);
490 RUG=VOCWRD(182107,1);
491 SAPPH=VOCWRD(1901161608,1);
492 TRIDNT=VOCWRD(2018090405,1);
493 VASE=VOCWRD(22011905,1);
495 /* THESE ARE MOTION-VERB NUMBERS. */
497 BACK=VOCWRD(2010311,0);
498 CAVE=VOCWRD(3012205,0);
499 DPRSSN=VOCWRD(405161805,0);
500 ENTER=VOCWRD(514200518,0);
501 ENTRNC=VOCWRD(514201801,0);
502 LOOK=VOCWRD(12151511,0);
503 NUL=VOCWRD(14211212,0);
504 STREAM=VOCWRD(1920180501,0);
506 /* AND SOME ACTION VERBS. */
508 FIND=VOCWRD(6091404,2);
509 INVENT=VOCWRD(914220514,2);
510 LOCK=VOCWRD(12150311,2);
511 SAY=VOCWRD(190125,2);
512 THROW=VOCWRD(2008181523,2);
514 /* INITIALISE THE DWARVES. DLOC IS LOC OF DWARVES, HARD-WIRED IN. ODLOC IS
515 * PRIOR LOC OF EACH DWARF, INITIALLY GARBAGE. DALTLC IS ALTERNATE INITIAL LOC
516 * FOR DWARF, IN CASE ONE OF THEM STARTS OUT ON TOP OF THE ADVENTURER. (NO 2
517 * OF THE 5 INITIAL LOCS ARE ADJACENT.) DSEEN IS TRUE IF DWARF HAS SEEN HIM.
518 * DFLAG CONTROLS THE LEVEL OF ACTIVATION OF ALL THIS:
519 * 0 NO DWARF STUFF YET (WAIT UNTIL REACHES HALL OF MISTS)
520 * 1 REACHED HALL OF MISTS, BUT HASN'T MET FIRST DWARF
521 * 2 MET FIRST DWARF, OTHERS START MOVING, NO KNIVES THROWN YET
522 * 3 A KNIFE HAS BEEN THROWN (FIRST SET ALWAYS MISSES)
523 * 3+ DWARVES ARE MAD (INCREASES THEIR ACCURACY)
524 * SIXTH DWARF IS SPECIAL (THE PIRATE). HE ALWAYS STARTS AT HIS CHEST'S
525 * EVENTUAL LOCATION INSIDE THE MAZE. THIS LOC IS SAVED IN CHLOC FOR REF.
526 * THE DEAD END IN THE OTHER MAZE HAS ITS LOC STORED IN CHLOC2. */
530 /* 1700 */ for (I=1; I<=6; I++) {
531 L1700: DSEEN[I]=FALSE;
542 /* OTHER RANDOM FLAGS AND COUNTERS, AS FOLLOWS:
543 * ABBNUM HOW OFTEN WE SHOULD PRINT NON-ABBREVIATED DESCRIPTIONS
544 * BONUS USED TO DETERMINE AMOUNT OF BONUS IF HE REACHES CLOSING
545 * CLOCK1 NUMBER OF TURNS FROM FINDING LAST TREASURE TILL CLOSING
546 * CLOCK2 NUMBER OF TURNS FROM FIRST WARNING TILL BLINDING FLASH
547 * CONDS MIN VALUE FOR COND(LOC) IF LOC HAS ANY HINTS
548 * DETAIL HOW OFTEN WE'VE SAID "NOT ALLOWED TO GIVE MORE DETAIL"
549 * DKILL NUMBER OF DWARVES KILLED (UNUSED IN SCORING, NEEDED FOR MSG)
550 * FOOBAR CURRENT PROGRESS IN SAYING "FEE FIE FOE FOO".
551 * HOLDNG NUMBER OF OBJECTS BEING CARRIED
552 * IGO HOW MANY TIMES HE'S SAID "GO XXX" INSTEAD OF "XXX"
553 * IWEST HOW MANY TIMES HE'S SAID "WEST" INSTEAD OF "W"
554 * KNFLOC 0 IF NO KNIFE HERE, LOC IF KNIFE HERE, -1 AFTER CAVEAT
555 * LIMIT LIFETIME OF LAMP (NOT SET HERE)
556 * MAXDIE NUMBER OF REINCARNATION MESSAGES AVAILABLE (UP TO 5)
557 * NUMDIE NUMBER OF TIMES KILLED SO FAR
558 * THRESH NEXT #TURNS THRESHHOLD (-1 IF NONE)
559 * TRNDEX INDEX IN TRNVAL OF NEXT THRESHHOLD (SECTION 14 OF DATABASE)
560 * TRNLUZ # POINTS LOST SO FAR DUE TO NUMBER OF TURNS USED
561 * TURNS TALLIES HOW MANY COMMANDS HE'S GIVEN (IGNORES YES/NO)
562 * LOGICALS WERE EXPLAINED EARLIER */
567 if(TRNVLS > 0)THRESH=MOD(TRNVAL[1],100000)+1;
575 /* 1800 */ for (I=0; I<=4; I++) {
576 L1800: {long x = 2*I+81; if(RTEXT[x] != 0)MAXDIE=I+1;}
594 /* if we can ever think of how, we should save it at this point */
596 return(0); /* then we won't actually return from initialisation */
599 /* REPORT ON AMOUNT OF ARRAYS ACTUALLY USED, TO PERMIT REDUCTIONS. */
601 static void report(void) {
602 /* 1998 */ for (K=1; K<=LOCSIZ; K++) {
604 if(LTEXT[KK] != 0) goto L1997;
609 L1997: /* 1996 */ for (K=1; K<=100; K++) {
610 L1996: if(PTEXT[K] != 0)OBJ=OBJ+1;
613 /* 1995 */ for (K=1; K<=TABNDX; K++) {
614 L1995: if(KTAB[K]/1000 == 2)VERB=KTAB[K]-2000;
617 /* 1994 */ for (K=1; K<=RTXSIZ; K++) {
619 if(RTEXT[J] != 0) goto L1993;
623 L1993: SETPRM(1,LINUSE,LINSIZ);
624 SETPRM(3,TRVS,TRVSIZ);
625 SETPRM(5,TABNDX,TABSIZ);
628 SETPRM(11,VERB,VRBSIZ);
630 SETPRM(15,CLSSES,CLSMAX);
631 SETPRM(17,HNTMAX,HNTSIZ);
632 SETPRM(19,TRNVLS,TRNSIZ);
637 static long init_reading, init_cksum;
640 static void quick_item(long*);
641 static void quick_array(long*, long);
643 static bool quick_init(void) {
645 f = fopen("ram:adventure.data", READ_MODE);
647 extern char *getenv();
648 char *adv = getenv("ADVENTURE");
650 if(adv)f = fopen(adv,READ_MODE);
652 if(f == NULL)f = fopen("adventure.data",READ_MODE);
653 if(f == NULL)return(FALSE);
657 if(fread(&K,4,1,f) == 1) init_cksum -= K; else init_cksum = 1;
659 if(init_cksum != 0)printf("Checksum error!\n");
660 return(init_cksum == 0);
663 static void quick_save(void) {
664 printf("Writing adventure.data...\n");
665 f = fopen("adventure.data",WRITE_MODE);
666 if(f == NULL){printf("Can't open file!\n"); return;}
667 init_reading = FALSE;
670 fwrite(&init_cksum,4,1,f);
674 static void quick_io(void) {
681 quick_array(PTEXT,100);
682 quick_array(RTEXT,RTXSIZ);
683 quick_array(CTEXT,CLSMAX);
684 quick_array(OBJSND,100);
685 quick_array(OBJTXT,100);
686 quick_array(STEXT,LOCSIZ);
687 quick_array(LTEXT,LOCSIZ);
688 quick_array(COND,LOCSIZ);
689 quick_array(KEY,LOCSIZ);
690 quick_array(LOCSND,LOCSIZ);
691 quick_array(LINES,LINSIZ);
692 quick_array(CVAL,CLSMAX);
693 quick_array(TTEXT,TRNSIZ);
694 quick_array(TRNVAL,TRNSIZ);
695 quick_array(TRAVEL,TRVSIZ);
696 quick_array(KTAB,TABSIZ);
697 quick_array(ATAB,TABSIZ);
698 quick_array(PLAC,100);
699 quick_array(FIXD,100);
700 quick_array(ACTSPK,VRBSIZ);
701 quick_array((long *)HINTS,(HNTMAX+1)*5-1);
704 static void quick_item(W)long *W; {
705 if(init_reading && fread(W,4,1,f) != 1)return;
706 init_cksum = MOD(init_cksum*13+(*W),60000000);
707 if(!init_reading)fwrite(W,4,1,f);
710 static void quick_array(A,N)long *A, N; { long I;
711 if(init_reading && fread(A,4,N+1,f) != N+1)printf("Read error!\n");
712 for(I=1;I<=N;I++)init_cksum = MOD(init_cksum*13+A[I],60000000);
713 if(!init_reading && fwrite(A,4,N+1,f)!=N+1)printf("Write error!\n");