10 /* hack to ignore GCC Unused Result */
11 #define IGNORE(r) do{if(r){}}while(0)
13 /* I/O ROUTINES (SPEAK, PSPEAK, RSPEAK, SETPRM, GETIN, YES) */
16 void fSPEAK(N)long N; {
17 long BLANK, CASE, I, K, L, NEG, NPARMS, PARM, PRMTYP, STATE;
19 /* PRINT THE MESSAGE WHICH STARTS AT LINES(N). PRECEDE IT WITH A BLANK LINE
20 * UNLESS BLKLIN IS FALSE. */
27 L10: L=IABS(LINES[K])-1;
32 /* 20 */ for (I=K; I<=L; I++) {
33 L20: PUTTXT(LINES[I],STATE,2,I);
37 L32: if(LNPOSN > LNLENG) goto L40;
38 if(INLINE[LNPOSN] != 63) goto L30;
39 {long x = LNPOSN+1; PRMTYP=INLINE[x];}
40 /* 63 IS A "%"; THE NEXT CHARACTER DETERMINE THE TYPE OF PARAMETER: 1 (!) =
41 * SUPPRESS MESSAGE COMPLETELY, 29 (S) = NULL IF PARM=1, ELSE 'S' (OPTIONAL
42 * PLURAL ENDING), 33 (W) = WORD (TWO 30-BIT VALUES) WITH TRAILING SPACES
43 * SUPPRESSED, 22 (L) OR 31 (U) = WORD BUT MAP TO LOWER/UPPER CASE, 13 (C) =
44 * WORD IN LOWER CASE WITH FIRST LETTER CAPITALISED, 30 (T) = TEXT ENDING
45 * WITH A WORD OF -1, 65-73 (1-9) = NUMBER USING THAT MANY CHARACTERS,
46 * 12 (B) = VARIABLE NUMBER OF BLANKS. */
47 if(PRMTYP == 1)return;
48 if(PRMTYP == 29) goto L320;
49 if(PRMTYP == 30) goto L340;
50 if(PRMTYP == 12) goto L360;
51 if(PRMTYP == 33 || PRMTYP == 22 || PRMTYP == 31 || PRMTYP == 13) goto
54 if(PRMTYP < 1 || PRMTYP > 9) goto L30;
55 SHFTXT(LNPOSN+2,PRMTYP-2);
57 PARM=IABS(PARMS[NPARMS]);
59 if(PARMS[NPARMS] < 0)NEG=9;
60 /* 390 */ for (I=1; I<=PRMTYP; I++) {
62 INLINE[LNPOSN]=MOD(PARM,10)+64;
63 if(I == 1 || PARM != 0) goto L390;
69 L395: NPARMS=NPARMS+1;
72 L320: SHFTXT(LNPOSN+2,-1);
74 if(PARMS[NPARMS] == 1)SHFTXT(LNPOSN+1,-1);
77 L340: SHFTXT(LNPOSN+2,-2);
80 L345: if(PARMS[NPARMS] < 0) goto L395;
81 {long x = NPARMS+1; if(PARMS[x] < 0)CASE=0;}
82 PUTTXT(PARMS[NPARMS],STATE,CASE,0);
86 L360: PRMTYP=PARMS[NPARMS];
87 SHFTXT(LNPOSN+2,PRMTYP-2);
88 if(PRMTYP == 0) goto L395;
89 /* 365 */ for (I=1; I<=PRMTYP; I++) {
91 L365: LNPOSN=LNPOSN+1;
95 L380: SHFTXT(LNPOSN+2,-2);
98 if(PRMTYP == 31)CASE=1;
99 if(PRMTYP == 33)CASE=0;
101 PUTTXT(PARMS[NPARMS],STATE,CASE,0);
102 {long x = NPARMS+1; PUTTXT(PARMS[x],STATE,CASE,0);}
103 if(PRMTYP == 13 && INLINE[I] >= 37 && INLINE[I] <=
104 62)INLINE[I]=INLINE[I]-26;
108 L40: if(BLANK)TYPE0();
112 if(LINES[K] >= 0) goto L10;
118 #define SPEAK(N) fSPEAK(N)
120 void fPSPEAK(MSG,SKIP)long MSG, SKIP; {
123 /* FIND THE SKIP+1ST MESSAGE FROM MSG AND PRINT IT. MSG SHOULD BE THE INDEX OF
124 * THE INVENTORY MESSAGE FOR OBJECT. (INVEN+N+1 MESSAGE IS PROP=N MESSAGE). */
128 if(SKIP < 0) goto L9;
129 /* 3 */ for (I=0; I<=SKIP; I++) {
130 L1: M=IABS(LINES[M]);
131 if(LINES[M] >= 0) goto L1;
140 #define PSPEAK(MSG,SKIP) fPSPEAK(MSG,SKIP)
142 void fRSPEAK(I)long I; {
145 /* PRINT THE I-TH "RANDOM" MESSAGE (SECTION 6 OF DATABASE). */
148 if(I != 0)SPEAK(RTEXT[I]);
154 #define RSPEAK(I) fRSPEAK(I)
156 void fSETPRM(FIRST,P1,P2)long FIRST, P1, P2; {
159 /* STORES PARAMETERS INTO THE PRMCOM PARMS ARRAY FOR USE BY SPEAK. P1 AND P2
160 * ARE STORED INTO PARMS(FIRST) AND PARMS(FIRST+1). */
163 if(FIRST >= 25)BUG(29);
165 {long x = FIRST+1; PARMS[x]=P2;}
171 #define SETPRM(FIRST,P1,P2) fSETPRM(FIRST,P1,P2)
173 #define WORD1 (*wORD1)
174 #define WORD1X (*wORD1X)
175 #define WORD2 (*wORD2)
176 #define WORD2X (*wORD2X)
177 void fGETIN(wORD1,wORD1X,wORD2,wORD2X)long *wORD1, *wORD1X, *wORD2, *wORD2X; {
180 /* GET A COMMAND FROM THE ADVENTURER. SNARF OUT THE FIRST WORD, PAD IT WITH
181 * BLANKS, AND RETURN IT IN WORD1. CHARS 6 THRU 10 ARE RETURNED IN WORD1X, IN
182 * CASE WE NEED TO PRINT OUT THE WHOLE WORD IN AN ERROR MESSAGE. ANY NUMBER OF
183 * BLANKS MAY FOLLOW THE WORD. IF A SECOND WORD APPEARS, IT IS RETURNED IN
184 * WORD2 (CHARS 6 THRU 10 IN WORD2X), ELSE WORD2 IS -1. */
187 L10: if(BLKLIN)TYPE0();
189 WORD1=GETTXT(TRUE,TRUE,TRUE,0);
190 if(BLKLIN && WORD1 < 0) goto L10;
191 WORD1X=GETTXT(FALSE,TRUE,TRUE,0);
192 L12: JUNK=GETTXT(FALSE,TRUE,TRUE,0);
193 if(JUNK > 0) goto L12;
194 WORD2=GETTXT(TRUE,TRUE,TRUE,0);
195 WORD2X=GETTXT(FALSE,TRUE,TRUE,0);
196 L22: JUNK=GETTXT(FALSE,TRUE,TRUE,0);
197 if(JUNK > 0) goto L22;
198 if(GETTXT(TRUE,TRUE,TRUE,0) <= 0)return;
209 #define GETIN(WORD1,WORD1X,WORD2,WORD2X) fGETIN(&WORD1,&WORD1X,&WORD2,&WORD2X)
211 long fYES(X,Y,Z)long X, Y, Z; {
213 long YES, REPLY, JUNK1, JUNK2, JUNK3;
215 /* PRINT MESSAGE X, WAIT FOR YES/NO ANSWER. IF YES, PRINT Y AND RETURN TRUE;
216 * IF NO, PRINT Z AND RETURN FALSE. */
219 GETIN(REPLY,JUNK1,JUNK2,JUNK3);
220 if(REPLY == MAKEWD(250519) || REPLY == MAKEWD(25)) goto L10;
221 if(REPLY == MAKEWD(1415) || REPLY == MAKEWD(14)) goto L20;
236 /* LINE-PARSING ROUTINES (GETNUM, GETTXT, MAKEWD, PUTTXT, SHFTXT, TYPE0)
239 /* THE ROUTINES ON THIS PAGE HANDLE ALL THE STUFF THAT WOULD NORMALLY BE
240 * TAKEN CARE OF BY FORMAT STATEMENTS. WE DO IT THIS WAY INSTEAD SO THAT
241 * WE CAN HANDLE TEXTUAL DATA IN A MACHINE INDEPENDENT FASHION. ALL THE
242 * MACHINE DEPENDENT I/O STUFF IS ON THE FOLLOWING PAGE. SEE THAT PAGE
243 * FOR A DESCRIPTION OF MAPCOM'S INLINE ARRAY. */
245 #define YES(X,Y,Z) fYES(X,Y,Z)
247 long fGETNUM(K)long K; {
248 long DIGIT, GETNUM, SIGN;
250 /* OBTAIN THE NEXT INTEGER FROM AN INPUT LINE. IF K>0, WE FIRST READ A
251 * NEW INPUT LINE FROM A FILE; IF K<0, WE READ A LINE FROM THE KEYBOARD;
252 * IF K=0 WE USE A LINE THAT HAS ALREADY BEEN READ (AND PERHAPS PARTIALLY
253 * SCANNED). IF WE'RE AT THE END OF THE LINE OR ENCOUNTER AN ILLEGAL
254 * CHARACTER (NOT A DIGIT, HYPHEN, OR BLANK), WE RETURN 0. */
257 if(K != 0)MAPLIN(K > 0);
259 L10: if(LNPOSN > LNLENG)return(GETNUM);
260 if(INLINE[LNPOSN] != 0) goto L20;
265 if(INLINE[LNPOSN] != 9) goto L32;
267 L30: LNPOSN=LNPOSN+1;
268 L32: if(LNPOSN > LNLENG || INLINE[LNPOSN] == 0) goto L42;
269 DIGIT=INLINE[LNPOSN]-64;
270 if(DIGIT < 0 || DIGIT > 9) goto L40;
271 GETNUM=GETNUM*10+DIGIT;
275 L42: GETNUM=GETNUM*SIGN;
282 #define GETNUM(K) fGETNUM(K)
284 long fGETTXT(SKIP,ONEWRD,UPPER,HASH)long HASH, ONEWRD, SKIP, UPPER; {
285 long CHAR, GETTXT, I; static long SPLITTING = -1;
287 /* TAKE CHARACTERS FROM AN INPUT LINE AND PACK THEM INTO 30-BIT WORDS.
288 * SKIP SAYS TO SKIP LEADING BLANKS. ONEWRD SAYS STOP IF WE COME TO A
289 * BLANK. UPPER SAYS TO MAP ALL LETTERS TO UPPERCASE. HASH MAY BE USED
290 * AS A PARAMETER FOR ENCRYPTING THE TEXT IF DESIRED; HOWEVER, A HASH OF 0
291 * SHOULD RESULT IN UNMODIFIED BYTES BEING PACKED. IF WE REACH THE
292 * END OF THE LINE, THE WORD IS FILLED UP WITH BLANKS (WHICH ENCODE AS 0'S).
293 * IF WE'RE ALREADY AT END OF LINE WHEN GETTXT IS CALLED, WE RETURN -1. */
295 if(LNPOSN != SPLITTING)SPLITTING = -1;
297 L10: if(LNPOSN > LNLENG)return(GETTXT);
298 if((!SKIP) || INLINE[LNPOSN] != 0) goto L11;
303 /* 15 */ for (I=1; I<=5; I++) {
305 if(LNPOSN > LNLENG || (ONEWRD && INLINE[LNPOSN] == 0)) goto L15;
307 if(CHAR >= 63) goto L12;
309 if(UPPER && CHAR >= 37)CHAR=CHAR-26;
313 L12: if(SPLITTING == LNPOSN) goto L13;
318 L13: GETTXT=GETTXT+CHAR-63;
320 L14: LNPOSN=LNPOSN+1;
324 if(HASH)GETTXT=GETTXT+MOD(HASH*13579L+5432L,97531L)*12345L+HASH;
330 #define GETTXT(SKIP,ONEWRD,UPPER,HASH) fGETTXT(SKIP,ONEWRD,UPPER,HASH)
332 long fMAKEWD(LETTRS)long LETTRS; {
335 /* COMBINE FIVE UPPERCASE LETTERS (REPRESENTED BY PAIRS OF DECIMAL DIGITS
336 * IN LETTRS) TO FORM A 30-BIT VALUE MATCHING THE ONE THAT GETTXT WOULD
337 * RETURN GIVEN THOSE CHARACTERS PLUS TRAILING BLANKS AND HASH=0. CAUTION:
338 * LETTRS WILL OVERFLOW 31 BITS IF 5-LETTER WORD STARTS WITH V-Z. AS A
339 * KLUDGEY WORKAROUND, YOU CAN INCREMENT A LETTER BY 5 BY ADDING 50 TO
340 * THE NEXT PAIR OF DIGITS. */
346 L10: MAKEWD=MAKEWD+I*(MOD(L,50)+10);
348 if(MOD(L,100) > 50)MAKEWD=MAKEWD+I*5;
351 I=64L*64L*64L*64L*64L/I;
358 #define MAKEWD(LETTRS) fMAKEWD(LETTRS)
360 #define STATE (*sTATE)
361 void fPUTTXT(WORD,sTATE,CASE,HASH)long CASE, HASH, *sTATE, WORD; {
362 long ALPH1, ALPH2, BYTE, DIV, I, W;
364 /* UNPACK THE 30-BIT VALUE IN WORD TO OBTAIN UP TO 5 INTEGER-ENCODED CHARS,
365 * AND STORE THEM IN INLINE STARTING AT LNPOSN. IF LNLENG>=LNPOSN, SHIFT
366 * EXISTING CHARACTERS TO THE RIGHT TO MAKE ROOM. HASH MUST BE THE SAME
367 * AS IT WAS WHEN GETTXT CREATED THE 30-BIT WORD. STATE WILL BE ZERO WHEN
368 * PUTTXT IS CALLED WITH THE FIRST OF A SEQUENCE OF WORDS, BUT IS THEREAFTER
369 * UNCHANGED BY THE CALLER, SO PUTTXT CAN USE IT TO MAINTAIN STATE ACROSS
370 * CALLS. LNPOSN AND LNLENG ARE INCREMENTED BY THE NUMBER OF CHARS STORED.
371 * IF CASE=1, ALL LETTERS ARE MADE UPPERCASE; IF -1, LOWERCASE; IF 0, AS IS.
372 * ANY OTHER VALUE FOR CASE IS THE SAME AS 0 BUT ALSO CAUSES TRAILING BLANKS
373 * TO BE INCLUDED (IN ANTICIPATION OF SUBSEQUENT ADDITIONAL TEXT). */
377 ALPH2=26*IABS(CASE)+ALPH1;
378 if(IABS(CASE) > 1)ALPH1=ALPH2;
379 /* ALPH1&2 DEFINE RANGE OF WRONG-CASE CHARS, 11-36 OR 37-62 OR EMPTY. */
382 if(HASH)W=W-MOD(HASH*13579L+5432L,97531L)*12345L-HASH;
383 /* 18 */ for (I=1; I<=5; I++) {
384 if(W <= 0 && STATE == 0 && IABS(CASE) <= 1)return;
386 if(STATE != 0 || BYTE != 63) goto L12;
390 L12: SHFTXT(LNPOSN,1);
392 if(STATE < ALPH2 && STATE >= ALPH1)STATE=STATE-26*CASE;
393 INLINE[LNPOSN]=STATE;
396 L18: W=(W-BYTE*DIV)*64;
404 #define PUTTXT(WORD,STATE,CASE,HASH) fPUTTXT(WORD,&STATE,CASE,HASH)
406 void fSHFTXT(FROM,DELTA)long DELTA, FROM; {
409 /* MOVE INLINE(N) TO INLINE(N+DELTA) FOR N=FROM,LNLENG. DELTA CAN BE
410 * NEGATIVE. LNLENG IS UPDATED; LNPOSN IS NOT CHANGED. */
413 if(LNLENG < FROM || DELTA == 0) goto L2;
414 /* 1 */ for (I=FROM; I<=LNLENG; I++) {
416 if(DELTA > 0)II=FROM+LNLENG-I;
418 L1: INLINE[JJ]=INLINE[II];
420 L2: LNLENG=LNLENG+DELTA;
426 #define SHFTXT(FROM,DELTA) fSHFTXT(FROM,DELTA)
431 /* TYPE A BLANK LINE. THIS PROCEDURE IS PROVIDED AS A CONVENIENCE FOR CALLERS
432 * WHO OTHERWISE HAVE NO USE FOR MAPCOM. */
444 #define TYPE0() fTYPE0()
447 /* SUSPEND/RESUME I/O ROUTINES (SAVWDS, SAVARR, SAVWRD) */
450 void fSAVWDS(W1,W2,W3,W4,W5,W6,W7)long *W1, *W2, *W3, *W4, *W5, *W6, *W7; {
453 /* WRITE OR READ 7 VARIABLES. SEE SAVWRD. */
467 #define SAVWDS(W1,W2,W3,W4,W5,W6,W7) fSAVWDS(&W1,&W2,&W3,&W4,&W5,&W6,&W7)
469 void fSAVARR(ARR,N)long ARR[], N; {
472 /* WRITE OR READ AN ARRAY OF N WORDS. SEE SAVWRD. */
475 /* 1 */ for (I=1; I<=N; I++) {
476 L1: SAVWRD(0,ARR[I]);
483 #define SAVARR(ARR,N) fSAVARR(ARR,N)
486 void fSAVWRD(OP,wORD)long OP, *wORD; {
487 static long BUF[250], CKSUM = 0, H1, HASH = 0, N = 0, STATE = 0;
489 /* IF OP<0, START WRITING A FILE, USING WORD TO INITIALISE ENCRYPTION; SAVE
490 * WORD IN THE FILE. IF OP>0, START READING A FILE; READ THE FILE TO FIND
491 * THE VALUE WITH WHICH TO DECRYPT THE REST. IN EITHER CASE, IF A FILE IS
492 * ALREADY OPEN, FINISH WRITING/READING IT AND DON'T START A NEW ONE. IF OP=0,
493 * READ/WRITE A SINGLE WORD. WORDS ARE BUFFERED IN CASE THAT MAKES FOR MORE
494 * EFFICIENT DISK USE. WE ALSO COMPUTE A SIMPLE CHECKSUM TO CATCH ELEMENTARY
495 * POKING WITHIN THE SAVED FILE. WHEN WE FINISH READING/WRITING THE FILE,
496 * WE STORE ZERO INTO WORD IF THERE'S NO CHECKSUM ERROR, ELSE NONZERO. */
499 if(OP != 0){long ifvar; ifvar=(STATE); switch (ifvar<0? -1 : ifvar>0? 1 :
500 0) { case -1: goto L30; case 0: goto L10; case 1: goto L30; }}
501 if(STATE == 0)return;
502 if(N == 250)SAVEIO(1,STATE > 0,BUF);
504 H1=MOD(HASH*1093L+221573L,1048576L);
505 HASH=MOD(H1*1093L+221573L,1048576L);
506 H1=MOD(H1,1234)*765432+MOD(HASH,123);
508 if(STATE > 0)WORD=BUF[N]+H1;
511 CKSUM=MOD(CKSUM*13+WORD,1000000000L);
515 SAVEIO(0,STATE > 0,BUF);
517 if(STATE > 0) goto L15;
518 HASH=MOD(WORD,1048576L);
519 BUF[0]=1234L*5678L-HASH;
523 L15: SAVEIO(1,TRUE,BUF);
524 HASH=MOD(1234L*5678L-BUF[0],1048576L);
527 L30: if(N == 250)SAVEIO(1,STATE > 0,BUF);
529 if(STATE > 0) goto L32;
530 N--; BUF[N]=CKSUM; N++;
532 L32: N--; WORD=BUF[N]-CKSUM; N++;
533 SAVEIO(-1,STATE > 0,BUF);
542 /* DATA STRUC. ROUTINES (VOCAB, DSTROY, JUGGLE, MOVE, PUT, CARRY, DROP, ATDWRF)
546 #define SAVWRD(OP,WORD) fSAVWRD(OP,&WORD)
548 long fVOCAB(ID,INIT)long ID, INIT; {
551 /* LOOK UP ID IN THE VOCABULARY (ATAB) AND RETURN ITS "DEFINITION" (KTAB), OR
552 * -1 IF NOT FOUND. IF INIT IS POSITIVE, THIS IS AN INITIALISATION CALL SETTING
553 * UP A KEYWORD VARIABLE, AND NOT FINDING IT CONSTITUTES A BUG. IT ALSO MEANS
554 * THAT ONLY KTAB VALUES WHICH TAKEN OVER 1000 EQUAL INIT MAY BE CONSIDERED.
555 * (THUS "STEPS", WHICH IS A MOTION VERB AS WELL AS AN OBJECT, MAY BE LOCATED
556 * AS AN OBJECT.) AND IT ALSO MEANS THE KTAB VALUE IS TAKEN MOD 1000. */
559 /* 1 */ for (I=1; I<=TABSIZ; I++) {
560 if(KTAB[I] == -1) goto L2;
562 if(INIT >= 0 && KTAB[I]/1000 != INIT) goto L1;
563 if(ATAB[I] == ID+HASH*HASH) goto L3;
569 if(INIT < 0)return(VOCAB);
573 if(INIT >= 0)VOCAB=MOD(VOCAB,1000);
579 #define VOCAB(ID,INIT) fVOCAB(ID,INIT)
581 void fDSTROY(OBJECT)long OBJECT; {
584 /* PERMANENTLY ELIMINATE "OBJECT" BY MOVING TO A NON-EXISTENT LOCATION. */
593 #define DSTROY(OBJECT) fDSTROY(OBJECT)
595 void fJUGGLE(OBJECT)long OBJECT; {
598 /* JUGGLE AN OBJECT BY PICKING IT UP AND PUTTING IT DOWN AGAIN, THE PURPOSE
599 * BEING TO GET THE OBJECT TO THE FRONT OF THE CHAIN OF THINGS AT ITS LOC. */
611 #define JUGGLE(OBJECT) fJUGGLE(OBJECT)
613 void fMOVE(OBJECT,WHERE)long OBJECT, WHERE; {
616 /* PLACE ANY OBJECT ANYWHERE BY PICKING IT UP AND DROPPING IT. MAY ALREADY BE
617 * TOTING, IN WHICH CASE THE CARRY IS A NO-OP. MUSTN'T PICK UP OBJECTS WHICH
618 * ARE NOT AT ANY LOC, SINCE CARRY WANTS TO REMOVE OBJECTS FROM ATLOC CHAINS. */
621 if(OBJECT > 100) goto L1;
624 L1: {long x = OBJECT-100; FROM=FIXED[x];}
625 L2: if(FROM > 0 && FROM <= 300)CARRY(OBJECT,FROM);
632 #define MOVE(OBJECT,WHERE) fMOVE(OBJECT,WHERE)
634 long fPUT(OBJECT,WHERE,PVAL)long OBJECT, PVAL, WHERE; {
637 /* PUT IS THE SAME AS MOVE, EXCEPT IT RETURNS A VALUE USED TO SET UP THE
638 * NEGATED PROP VALUES FOR THE REPOSITORY OBJECTS. */
648 #define PUT(OBJECT,WHERE,PVAL) fPUT(OBJECT,WHERE,PVAL)
650 void fCARRY(OBJECT,WHERE)long OBJECT, WHERE; {
653 /* START TOTING AN OBJECT, REMOVING IT FROM THE LIST OF THINGS AT ITS FORMER
654 * LOCATION. INCR HOLDNG UNLESS IT WAS ALREADY BEING TOTED. IF OBJECT>100
655 * (MOVING "FIXED" SECOND LOC), DON'T CHANGE PLACE OR HOLDNG. */
658 if(OBJECT > 100) goto L5;
659 if(PLACE[OBJECT] == -1)return;
662 L5: if(ATLOC[WHERE] != OBJECT) goto L6;
663 ATLOC[WHERE]=LINK[OBJECT];
665 L6: TEMP=ATLOC[WHERE];
666 L7: if(LINK[TEMP] == OBJECT) goto L8;
669 L8: LINK[TEMP]=LINK[OBJECT];
675 #define CARRY(OBJECT,WHERE) fCARRY(OBJECT,WHERE)
677 void fDROP(OBJECT,WHERE)long OBJECT, WHERE; {
680 /* PLACE AN OBJECT AT A GIVEN LOC, PREFIXING IT ONTO THE ATLOC LIST. DECR
681 * HOLDNG IF THE OBJECT WAS BEING TOTED. */
684 if(OBJECT > 100) goto L1;
685 if(PLACE[OBJECT] == -1)HOLDNG=HOLDNG-1;
688 L1: {long x = OBJECT-100; FIXED[x]=WHERE;}
689 L2: if(WHERE <= 0)return;
690 LINK[OBJECT]=ATLOC[WHERE];
697 #define DROP(OBJECT,WHERE) fDROP(OBJECT,WHERE)
699 long fATDWRF(WHERE)long WHERE; {
702 /* RETURN THE INDEX OF FIRST DWARF AT THE GIVEN LOCATION, ZERO IF NO DWARF IS
703 * THERE (OR IF DWARVES NOT ACTIVE YET), -1 IF ALL DWARVES ARE DEAD. IGNORE
704 * THE PIRATE (6TH DWARF). */
708 if(DFLAG < 2)return(ATDWRF);
710 /* 1 */ for (I=1; I<=5; I++) {
711 if(DLOC[I] == WHERE) goto L2;
712 L1: if(DLOC[I] != 0)ATDWRF=0;
723 #define ATDWRF(WHERE) fATDWRF(WHERE)
727 /* UTILITY ROUTINES (SETBIT, TSTBIT, RAN, RNDVOC, BUG) */
730 long fSETBIT(BIT)long BIT; {
733 /* RETURNS 2**BIT FOR USE IN CONSTRUCTING BIT-MASKS. */
737 if(BIT <= 0)return(SETBIT);
738 /* 1 */ for (I=1; I<=BIT; I++) {
739 L1: SETBIT=SETBIT+SETBIT;
746 #define SETBIT(BIT) fSETBIT(BIT)
748 long fTSTBIT(MASK,BIT)long BIT, MASK; {
751 /* RETURNS TRUE IF THE SPECIFIED BIT IS SET IN THE MASK. */
754 TSTBIT=MOD(MASK/SETBIT(BIT),2) != 0;
760 #define TSTBIT(MASK,BIT) fTSTBIT(MASK,BIT)
762 long fRAN(RANGE)long RANGE; {
763 static long D, R = 0, RAN, T;
765 /* SINCE THE RAN FUNCTION IN LIB40 SEEMS TO BE A REAL LOSE, WE'LL USE ONE OF
766 * OUR OWN. IT'S BEEN RUN THROUGH MANY OF THE TESTS IN KNUTH VOL. 2 AND
767 * SEEMS TO BE QUITE RELIABLE. RAN RETURNS A VALUE UNIFORMLY SELECTED
768 * BETWEEN 0 AND RANGE-1. */
772 if(R != 0 && RANGE >= 0) goto L1;
776 L1: /* 2 */ for (T=1; T<=D; T++) {
777 L2: R=MOD(R*1093L+221587L,1048576L);
779 RAN=(RANGE*R)/1048576;
785 #define RAN(RANGE) fRAN(RANGE)
787 long fRNDVOC(CHAR,FORCE)long CHAR, FORCE; {
788 long DIV, I, J, RNDVOC;
790 /* SEARCHES THE VOCABULARY FOR A WORD WHOSE SECOND CHARACTER IS CHAR, AND
791 * CHANGES THAT WORD SUCH THAT EACH OF THE OTHER FOUR CHARACTERS IS A
792 * RANDOM LETTER. IF FORCE IS NON-ZERO, IT IS USED AS THE NEW WORD.
793 * RETURNS THE NEW WORD. */
797 if(RNDVOC != 0) goto L3;
798 /* 1 */ for (I=1; I<=5; I++) {
801 L1: RNDVOC=RNDVOC*64+J;
805 /* 5 */ for (I=1; I<=TABSIZ; I++) {
807 if(MOD((ATAB[I]-J*J)/DIV,64L) == CHAR) goto L8;
812 L8: ATAB[I]=RNDVOC+J*J;
818 #define RNDVOC(CHAR,FORCE) fRNDVOC(CHAR,FORCE)
820 void fBUG(NUM)long NUM; {
822 /* THE FOLLOWING CONDITIONS ARE CURRENTLY CONSIDERED FATAL BUGS. NUMBERS < 20
823 * ARE DETECTED WHILE READING THE DATABASE; THE OTHERS OCCUR AT "RUN TIME".
824 * 0 MESSAGE LINE > 70 CHARACTERS
825 * 1 NULL LINE IN MESSAGE
826 * 2 TOO MANY WORDS OF MESSAGES
827 * 3 TOO MANY TRAVEL OPTIONS
828 * 4 TOO MANY VOCABULARY WORDS
829 * 5 REQUIRED VOCABULARY WORD NOT FOUND
830 * 6 TOO MANY RTEXT MESSAGES
832 * 8 LOCATION HAS COND BIT BEING SET TWICE
833 * 9 INVALID SECTION NUMBER IN DATABASE
834 * 10 TOO MANY LOCATIONS
835 * 11 TOO MANY CLASS OR TURN MESSAGES
836 * 20 SPECIAL TRAVEL (500>L>300) EXCEEDS GOTO LIST
837 * 21 RAN OFF END OF VOCABULARY TABLE
838 * 22 VOCABULARY TYPE (N/1000) NOT BETWEEN 0 AND 3
839 * 23 INTRANSITIVE ACTION VERB EXCEEDS GOTO LIST
840 * 24 TRANSITIVE ACTION VERB EXCEEDS GOTO LIST
841 * 25 CONDITIONAL TRAVEL ENTRY WITH NO ALTERNATIVE
842 * 26 LOCATION HAS NO TRAVEL ENTRIES
843 * 27 HINT NUMBER EXCEEDS GOTO LIST
844 * 28 INVALID MONTH RETURNED BY DATE FUNCTION
845 * 29 TOO MANY PARAMETERS GIVEN TO SETPRM */
847 printf("Fatal error %ld. See source code for interpretation.\n",
856 /* MACHINE DEPENDENT ROUTINES (MAPLIN, TYPE, MPINIT, SAVEIO) */
858 #define BUG(NUM) fBUG(NUM)
860 void fMAPLIN(FIL)long FIL; {
861 long I, VAL; static FILE *OPENED = NULL;
863 /* READ A LINE OF INPUT, EITHER FROM A FILE (IF FIL=.TRUE.) OR FROM THE
864 * KEYBOARD, TRANSLATE THE CHARS TO INTEGERS IN THE RANGE 0-126 AND STORE
865 * THEM IN THE COMMON ARRAY "INLINE". INTEGER VALUES ARE AS FOLLOWS:
866 * 0 = SPACE [ASCII CODE 40 OCTAL, 32 DECIMAL]
867 * 1-2 = !" [ASCII 41-42 OCTAL, 33-34 DECIMAL]
868 * 3-10 = '()*+,-. [ASCII 47-56 OCTAL, 39-46 DECIMAL]
869 * 11-36 = UPPER-CASE LETTERS
870 * 37-62 = LOWER-CASE LETTERS
871 * 63 = PERCENT (%) [ASCII 45 OCTAL, 37 DECIMAL]
872 * 64-73 = DIGITS, 0 THROUGH 9
873 * REMAINING CHARACTERS CAN BE TRANSLATED ANY WAY THAT IS CONVENIENT;
874 * THE "TYPE" ROUTINE BELOW IS USED TO MAP THEM BACK TO CHARACTERS WHEN
875 * NECESSARY. THE ABOVE MAPPINGS ARE REQUIRED SO THAT CERTAIN SPECIAL
876 * CHARACTERS ARE KNOWN TO FIT IN 6 BITS AND/OR CAN BE EASILY SPOTTED.
877 * ARRAY ELEMENTS BEYOND THE END OF THE LINE SHOULD BE FILLED WITH 0,
878 * AND LNLENG SHOULD BE SET TO THE INDEX OF THE LAST CHARACTER.
880 * IF THE DATA FILE USES A CHARACTER OTHER THAN SPACE (E.G., TAB) TO
881 * SEPARATE NUMBERS, THAT CHARACTER SHOULD ALSO TRANSLATE TO 0.
883 * THIS PROCEDURE MAY USE THE MAP1,MAP2 ARRAYS TO MAINTAIN STATIC DATA FOR
884 * THE MAPPING. MAP2(1) IS SET TO 0 WHEN THE PROGRAM STARTS
885 * AND IS NOT CHANGED THEREAFTER UNLESS THE ROUTINES ON THIS PAGE CHOOSE
888 * NOTE THAT MAPLIN IS EXPECTED TO OPEN THE FILE THE FIRST TIME IT IS
889 * ASKED TO READ A LINE FROM IT. THAT IS, THERE IS NO OTHER PLACE WHERE
890 * THE DATA FILE IS OPENED. */
893 if(MAP2[1] == 0)MPINIT();
896 IGNORE(fgets(INLINE+1, sizeof(INLINE)-1, stdin));
897 if(feof(stdin)) score(1);
901 OPENED=fopen("adventure.text","r" /* NOT binary */);
902 if(!OPENED){printf("Can't read adventure.text!\n"); exit(FALSE);}
904 IGNORE(fgets(INLINE+1,100,OPENED));
907 /* 25 */ for (I=1; I<=100 && INLINE[I]!=0; I++) {
910 L25: if(INLINE[I] != 0)LNLENG=I;
913 if(FIL && LNLENG == 0) goto L15;
914 /* ABOVE IS TO GET AROUND AN F40 COMPILER BUG WHEREIN IT READS A BLANK
915 * LINE WHENEVER A CRLF IS BROKEN ACROSS A RECORD BOUNDARY. */
921 #define MAPLIN(FIL) fMAPLIN(FIL)
926 /* TYPE THE FIRST "LNLENG" CHARACTERS STORED IN INLINE, MAPPING THEM
927 * FROM INTEGERS TO TEXT PER THE RULES DESCRIBED ABOVE. INLINE(I),
928 * I=1,LNLENG MAY BE CHANGED BY THIS ROUTINE. */
931 if(LNLENG != 0) goto L10;
935 L10: if(MAP2[1] == 0)MPINIT();
936 /* 20 */ for (I=1; I<=LNLENG; I++) {
938 L20: {long x = VAL+1; INLINE[I]=MAP2[x];}
940 {long x = LNLENG+1; INLINE[x]=0;}
941 printf("%s\n",INLINE+1);
947 #define TYPE() fTYPE()
950 long FIRST, I, J, LAST, VAL;
951 static long RUNS[7][2] = {32,34, 39,46, 65,90, 97,122, 37,37, 48,57, 0,126};
954 /* 10 */ for (I=1; I<=128; I++) {
958 /* 20 */ for (I=0; I<7; I++) {
961 /* 22 */ for (J=FIRST; J<=LAST; J++) {
962 J++; if(MAP1[J] >= 0) goto L22;
970 /* FOR THIS VERSION, TAB (9) MAPS TO SPACE (32), SO DEL (127) USES TAB'S VALUE */
974 /* 30 */ for (I=0; I<=126; I++) {
975 I++; VAL=MAP1[I]+1; I--;
976 MAP2[VAL]=I*('B'-'A');
977 L30: if(I >= 64)MAP2[VAL]=(I-64)*('B'-'A')+'@';
985 #define MPINIT() fMPINIT()
987 void fSAVEIO(OP,IN,ARR)long ARR[], IN, OP; {
988 static FILE *F; char NAME[50];
990 /* IF OP=0, ASK FOR A FILE NAME AND OPEN A FILE. (IF IN=.TRUE., THE FILE IS FOR
991 * INPUT, ELSE OUTPUT.) IF OP>0, READ/WRITE ARR FROM/INTO THE PREVIOUSLY-OPENED
992 * FILE. (ARR IS A 250-INTEGER ARRAY.) IF OP<0, FINISH READING/WRITING THE
993 * FILE. (FINISHING WRITING CAN BE A NO-OP IF A "STOP" STATEMENT DOES IT
994 * AUTOMATICALLY. FINISHING READING CAN BE A NO-OP AS LONG AS A SUBSEQUENT
995 * SAVEIO(0,.FALSE.,X) WILL STILL WORK.) IF YOU CAN CATCH ERRORS (E.G., NO SUCH
996 * FILE) AND TRY AGAIN, GREAT. DEC F40 CAN'T. */
999 {long ifvar; ifvar=(OP); switch (ifvar<0? -1 : ifvar>0? 1 : 0) { case -1:
1000 goto L10; case 0: goto L20; case 1: goto L30; }}
1005 L20: printf("\nFile name: ");
1006 IGNORE(fgets(NAME, sizeof(NAME), stdin));
1007 F=fopen(NAME,(IN ? READ_MODE : WRITE_MODE));
1008 if(F == NULL) {printf("Can't open file, try again.\n"); goto L20;}
1011 L30: if(IN)IGNORE(fread(ARR,4,250,F));
1012 if(!IN)fwrite(ARR,4,250,F);
1019 long fIABS(N)long N; {return(N<0? -N : N);}
1020 long fMOD(N,M)long N, M; {return(N%M);}