8 /* I/O ROUTINES (SPEAK, PSPEAK, RSPEAK, SETPRM, GETIN, YES) */
11 void fSPEAK(N)long N; {
12 long BLANK, CASE, I, K, L, NEG, NPARMS, PARM, PRMTYP, STATE;
14 /* PRINT THE MESSAGE WHICH STARTS AT LINES(N). PRECEDE IT WITH A BLANK LINE
15 * UNLESS BLKLIN IS FALSE. */
22 L10: L=IABS(LINES[K])-1;
27 /* 20 */ for (I=K; I<=L; I++) {
28 L20: PUTTXT(LINES[I],STATE,2,I);
32 L32: if(LNPOSN > LNLENG) goto L40;
33 if(INLINE[LNPOSN] != 63) goto L30;
34 {long x = LNPOSN+1; PRMTYP=INLINE[x];}
35 /* 63 IS A "%"; THE NEXT CHARACTER DETERMINE THE TYPE OF PARAMETER: 1 (!) =
36 * SUPPRESS MESSAGE COMPLETELY, 29 (S) = NULL IF PARM=1, ELSE 'S' (OPTIONAL
37 * PLURAL ENDING), 33 (W) = WORD (TWO 30-BIT VALUES) WITH TRAILING SPACES
38 * SUPPRESSED, 22 (L) OR 31 (U) = WORD BUT MAP TO LOWER/UPPER CASE, 13 (C) =
39 * WORD IN LOWER CASE WITH FIRST LETTER CAPITALISED, 30 (T) = TEXT ENDING
40 * WITH A WORD OF -1, 65-73 (1-9) = NUMBER USING THAT MANY CHARACTERS,
41 * 12 (B) = VARIABLE NUMBER OF BLANKS. */
42 if(PRMTYP == 1)return;
43 if(PRMTYP == 29) goto L320;
44 if(PRMTYP == 30) goto L340;
45 if(PRMTYP == 12) goto L360;
46 if(PRMTYP == 33 || PRMTYP == 22 || PRMTYP == 31 || PRMTYP == 13) goto
49 if(PRMTYP < 1 || PRMTYP > 9) goto L30;
50 SHFTXT(LNPOSN+2,PRMTYP-2);
52 PARM=IABS(PARMS[NPARMS]);
54 if(PARMS[NPARMS] < 0)NEG=9;
55 /* 390 */ for (I=1; I<=PRMTYP; I++) {
57 INLINE[LNPOSN]=MOD(PARM,10)+64;
58 if(I == 1 || PARM != 0) goto L390;
64 L395: NPARMS=NPARMS+1;
67 L320: SHFTXT(LNPOSN+2,-1);
69 if(PARMS[NPARMS] == 1)SHFTXT(LNPOSN+1,-1);
72 L340: SHFTXT(LNPOSN+2,-2);
75 L345: if(PARMS[NPARMS] < 0) goto L395;
76 {long x = NPARMS+1; if(PARMS[x] < 0)CASE=0;}
77 PUTTXT(PARMS[NPARMS],STATE,CASE,0);
81 L360: PRMTYP=PARMS[NPARMS];
82 SHFTXT(LNPOSN+2,PRMTYP-2);
83 if(PRMTYP == 0) goto L395;
84 /* 365 */ for (I=1; I<=PRMTYP; I++) {
86 L365: LNPOSN=LNPOSN+1;
90 L380: SHFTXT(LNPOSN+2,-2);
93 if(PRMTYP == 31)CASE=1;
94 if(PRMTYP == 33)CASE=0;
96 PUTTXT(PARMS[NPARMS],STATE,CASE,0);
97 {long x = NPARMS+1; PUTTXT(PARMS[x],STATE,CASE,0);}
98 if(PRMTYP == 13 && INLINE[I] >= 37 && INLINE[I] <=
99 62)INLINE[I]=INLINE[I]-26;
103 L40: if(BLANK)TYPE0();
107 if(LINES[K] >= 0) goto L10;
113 #define SPEAK(N) fSPEAK(N)
115 void fPSPEAK(MSG,SKIP)long MSG, SKIP; {
118 /* FIND THE SKIP+1ST MESSAGE FROM MSG AND PRINT IT. MSG SHOULD BE THE INDEX OF
119 * THE INVENTORY MESSAGE FOR OBJECT. (INVEN+N+1 MESSAGE IS PROP=N MESSAGE). */
123 if(SKIP < 0) goto L9;
124 /* 3 */ for (I=0; I<=SKIP; I++) {
125 L1: M=IABS(LINES[M]);
126 if(LINES[M] >= 0) goto L1;
135 #define PSPEAK(MSG,SKIP) fPSPEAK(MSG,SKIP)
137 void fRSPEAK(I)long I; {
140 /* PRINT THE I-TH "RANDOM" MESSAGE (SECTION 6 OF DATABASE). */
143 if(I != 0)SPEAK(RTEXT[I]);
149 #define RSPEAK(I) fRSPEAK(I)
151 void fSETPRM(FIRST,P1,P2)long FIRST, P1, P2; {
154 /* STORES PARAMETERS INTO THE PRMCOM PARMS ARRAY FOR USE BY SPEAK. P1 AND P2
155 * ARE STORED INTO PARMS(FIRST) AND PARMS(FIRST+1). */
158 if(FIRST >= 25)BUG(29);
160 {long x = FIRST+1; PARMS[x]=P2;}
166 #define SETPRM(FIRST,P1,P2) fSETPRM(FIRST,P1,P2)
168 #define WORD1 (*wORD1)
169 #define WORD1X (*wORD1X)
170 #define WORD2 (*wORD2)
171 #define WORD2X (*wORD2X)
172 void fGETIN(wORD1,wORD1X,wORD2,wORD2X)long *wORD1, *wORD1X, *wORD2, *wORD2X; {
175 /* GET A COMMAND FROM THE ADVENTURER. SNARF OUT THE FIRST WORD, PAD IT WITH
176 * BLANKS, AND RETURN IT IN WORD1. CHARS 6 THRU 10 ARE RETURNED IN WORD1X, IN
177 * CASE WE NEED TO PRINT OUT THE WHOLE WORD IN AN ERROR MESSAGE. ANY NUMBER OF
178 * BLANKS MAY FOLLOW THE WORD. IF A SECOND WORD APPEARS, IT IS RETURNED IN
179 * WORD2 (CHARS 6 THRU 10 IN WORD2X), ELSE WORD2 IS -1. */
182 L10: if(BLKLIN)TYPE0();
184 WORD1=GETTXT(TRUE,TRUE,TRUE,0);
185 if(BLKLIN && WORD1 < 0) goto L10;
186 WORD1X=GETTXT(FALSE,TRUE,TRUE,0);
187 L12: JUNK=GETTXT(FALSE,TRUE,TRUE,0);
188 if(JUNK > 0) goto L12;
189 WORD2=GETTXT(TRUE,TRUE,TRUE,0);
190 WORD2X=GETTXT(FALSE,TRUE,TRUE,0);
191 L22: JUNK=GETTXT(FALSE,TRUE,TRUE,0);
192 if(JUNK > 0) goto L22;
193 if(GETTXT(TRUE,TRUE,TRUE,0) <= 0)return;
204 #define GETIN(WORD1,WORD1X,WORD2,WORD2X) fGETIN(&WORD1,&WORD1X,&WORD2,&WORD2X)
206 long fYES(X,Y,Z)long X, Y, Z; {
208 long YES, REPLY, JUNK1, JUNK2, JUNK3;
210 /* PRINT MESSAGE X, WAIT FOR YES/NO ANSWER. IF YES, PRINT Y AND RETURN TRUE;
211 * IF NO, PRINT Z AND RETURN FALSE. */
214 GETIN(REPLY,JUNK1,JUNK2,JUNK3);
215 if(REPLY == MAKEWD(250519) || REPLY == MAKEWD(25)) goto L10;
216 if(REPLY == MAKEWD(1415) || REPLY == MAKEWD(14)) goto L20;
231 /* LINE-PARSING ROUTINES (GETNUM, GETTXT, MAKEWD, PUTTXT, SHFTXT, TYPE0)
234 /* THE ROUTINES ON THIS PAGE HANDLE ALL THE STUFF THAT WOULD NORMALLY BE
235 * TAKEN CARE OF BY FORMAT STATEMENTS. WE DO IT THIS WAY INSTEAD SO THAT
236 * WE CAN HANDLE TEXTUAL DATA IN A MACHINE INDEPENDENT FASHION. ALL THE
237 * MACHINE DEPENDENT I/O STUFF IS ON THE FOLLOWING PAGE. SEE THAT PAGE
238 * FOR A DESCRIPTION OF MAPCOM'S INLINE ARRAY. */
240 #define YES(X,Y,Z) fYES(X,Y,Z)
242 long fGETNUM(K)long K; {
243 long DIGIT, GETNUM, SIGN;
245 /* OBTAIN THE NEXT INTEGER FROM AN INPUT LINE. IF K>0, WE FIRST READ A
246 * NEW INPUT LINE FROM A FILE; IF K<0, WE READ A LINE FROM THE KEYBOARD;
247 * IF K=0 WE USE A LINE THAT HAS ALREADY BEEN READ (AND PERHAPS PARTIALLY
248 * SCANNED). IF WE'RE AT THE END OF THE LINE OR ENCOUNTER AN ILLEGAL
249 * CHARACTER (NOT A DIGIT, HYPHEN, OR BLANK), WE RETURN 0. */
252 if(K != 0)MAPLIN(K > 0);
254 L10: if(LNPOSN > LNLENG)return(GETNUM);
255 if(INLINE[LNPOSN] != 0) goto L20;
260 if(INLINE[LNPOSN] != 9) goto L32;
262 L30: LNPOSN=LNPOSN+1;
263 L32: if(LNPOSN > LNLENG || INLINE[LNPOSN] == 0) goto L42;
264 DIGIT=INLINE[LNPOSN]-64;
265 if(DIGIT < 0 || DIGIT > 9) goto L40;
266 GETNUM=GETNUM*10+DIGIT;
270 L42: GETNUM=GETNUM*SIGN;
277 #define GETNUM(K) fGETNUM(K)
279 long fGETTXT(SKIP,ONEWRD,UPPER,HASH)long HASH, ONEWRD, SKIP, UPPER; {
280 long CHAR, GETTXT, I; static long SPLITTING = -1;
282 /* TAKE CHARACTERS FROM AN INPUT LINE AND PACK THEM INTO 30-BIT WORDS.
283 * SKIP SAYS TO SKIP LEADING BLANKS. ONEWRD SAYS STOP IF WE COME TO A
284 * BLANK. UPPER SAYS TO MAP ALL LETTERS TO UPPERCASE. HASH MAY BE USED
285 * AS A PARAMETER FOR ENCRYPTING THE TEXT IF DESIRED; HOWEVER, A HASH OF 0
286 * SHOULD RESULT IN UNMODIFIED BYTES BEING PACKED. IF WE REACH THE
287 * END OF THE LINE, THE WORD IS FILLED UP WITH BLANKS (WHICH ENCODE AS 0'S).
288 * IF WE'RE ALREADY AT END OF LINE WHEN GETTXT IS CALLED, WE RETURN -1. */
290 if(LNPOSN != SPLITTING)SPLITTING = -1;
292 L10: if(LNPOSN > LNLENG)return(GETTXT);
293 if((!SKIP) || INLINE[LNPOSN] != 0) goto L11;
298 /* 15 */ for (I=1; I<=5; I++) {
300 if(LNPOSN > LNLENG || (ONEWRD && INLINE[LNPOSN] == 0)) goto L15;
302 if(CHAR >= 63) goto L12;
304 if(UPPER && CHAR >= 37)CHAR=CHAR-26;
308 L12: if(SPLITTING == LNPOSN) goto L13;
313 L13: GETTXT=GETTXT+CHAR-63;
315 L14: LNPOSN=LNPOSN+1;
319 if(HASH)GETTXT=GETTXT+MOD(HASH*13579L+5432L,97531L)*12345L+HASH;
325 #define GETTXT(SKIP,ONEWRD,UPPER,HASH) fGETTXT(SKIP,ONEWRD,UPPER,HASH)
327 long fMAKEWD(LETTRS)long LETTRS; {
330 /* COMBINE FIVE UPPERCASE LETTERS (REPRESENTED BY PAIRS OF DECIMAL DIGITS
331 * IN LETTRS) TO FORM A 30-BIT VALUE MATCHING THE ONE THAT GETTXT WOULD
332 * RETURN GIVEN THOSE CHARACTERS PLUS TRAILING BLANKS AND HASH=0. CAUTION:
333 * LETTRS WILL OVERFLOW 31 BITS IF 5-LETTER WORD STARTS WITH V-Z. AS A
334 * KLUDGEY WORKAROUND, YOU CAN INCREMENT A LETTER BY 5 BY ADDING 50 TO
335 * THE NEXT PAIR OF DIGITS. */
341 L10: MAKEWD=MAKEWD+I*(MOD(L,50)+10);
343 if(MOD(L,100) > 50)MAKEWD=MAKEWD+I*5;
346 I=64L*64L*64L*64L*64L/I;
353 #define MAKEWD(LETTRS) fMAKEWD(LETTRS)
355 #define STATE (*sTATE)
356 void fPUTTXT(WORD,sTATE,CASE,HASH)long CASE, HASH, *sTATE, WORD; {
357 long ALPH1, ALPH2, BYTE, DIV, I, W;
359 /* UNPACK THE 30-BIT VALUE IN WORD TO OBTAIN UP TO 5 INTEGER-ENCODED CHARS,
360 * AND STORE THEM IN INLINE STARTING AT LNPOSN. IF LNLENG>=LNPOSN, SHIFT
361 * EXISTING CHARACTERS TO THE RIGHT TO MAKE ROOM. HASH MUST BE THE SAME
362 * AS IT WAS WHEN GETTXT CREATED THE 30-BIT WORD. STATE WILL BE ZERO WHEN
363 * PUTTXT IS CALLED WITH THE FIRST OF A SEQUENCE OF WORDS, BUT IS THEREAFTER
364 * UNCHANGED BY THE CALLER, SO PUTTXT CAN USE IT TO MAINTAIN STATE ACROSS
365 * CALLS. LNPOSN AND LNLENG ARE INCREMENTED BY THE NUMBER OF CHARS STORED.
366 * IF CASE=1, ALL LETTERS ARE MADE UPPERCASE; IF -1, LOWERCASE; IF 0, AS IS.
367 * ANY OTHER VALUE FOR CASE IS THE SAME AS 0 BUT ALSO CAUSES TRAILING BLANKS
368 * TO BE INCLUDED (IN ANTICIPATION OF SUBSEQUENT ADDITIONAL TEXT). */
372 ALPH2=26*IABS(CASE)+ALPH1;
373 if(IABS(CASE) > 1)ALPH1=ALPH2;
374 /* ALPH1&2 DEFINE RANGE OF WRONG-CASE CHARS, 11-36 OR 37-62 OR EMPTY. */
377 if(HASH)W=W-MOD(HASH*13579L+5432L,97531L)*12345L-HASH;
378 /* 18 */ for (I=1; I<=5; I++) {
379 if(W <= 0 && STATE == 0 && IABS(CASE) <= 1)return;
381 if(STATE != 0 || BYTE != 63) goto L12;
385 L12: SHFTXT(LNPOSN,1);
387 if(STATE < ALPH2 && STATE >= ALPH1)STATE=STATE-26*CASE;
388 INLINE[LNPOSN]=STATE;
391 L18: W=(W-BYTE*DIV)*64;
399 #define PUTTXT(WORD,STATE,CASE,HASH) fPUTTXT(WORD,&STATE,CASE,HASH)
401 void fSHFTXT(FROM,DELTA)long DELTA, FROM; {
404 /* MOVE INLINE(N) TO INLINE(N+DELTA) FOR N=FROM,LNLENG. DELTA CAN BE
405 * NEGATIVE. LNLENG IS UPDATED; LNPOSN IS NOT CHANGED. */
408 if(LNLENG < FROM || DELTA == 0) goto L2;
409 /* 1 */ for (I=FROM; I<=LNLENG; I++) {
411 if(DELTA > 0)II=FROM+LNLENG-I;
413 L1: INLINE[JJ]=INLINE[II];
415 L2: LNLENG=LNLENG+DELTA;
421 #define SHFTXT(FROM,DELTA) fSHFTXT(FROM,DELTA)
426 /* TYPE A BLANK LINE. THIS PROCEDURE IS PROVIDED AS A CONVENIENCE FOR CALLERS
427 * WHO OTHERWISE HAVE NO USE FOR MAPCOM. */
439 #define TYPE0() fTYPE0()
442 /* SUSPEND/RESUME I/O ROUTINES (SAVWDS, SAVARR, SAVWRD) */
445 void fSAVWDS(W1,W2,W3,W4,W5,W6,W7)long *W1, *W2, *W3, *W4, *W5, *W6, *W7; {
448 /* WRITE OR READ 7 VARIABLES. SEE SAVWRD. */
462 #define SAVWDS(W1,W2,W3,W4,W5,W6,W7) fSAVWDS(&W1,&W2,&W3,&W4,&W5,&W6,&W7)
464 void fSAVARR(ARR,N)long ARR[], N; {
467 /* WRITE OR READ AN ARRAY OF N WORDS. SEE SAVWRD. */
470 /* 1 */ for (I=1; I<=N; I++) {
471 L1: SAVWRD(0,ARR[I]);
478 #define SAVARR(ARR,N) fSAVARR(ARR,N)
481 void fSAVWRD(OP,wORD)long OP, *wORD; {
482 static long BUF[250], CKSUM = 0, H1, HASH = 0, N = 0, STATE = 0;
484 /* IF OP<0, START WRITING A FILE, USING WORD TO INITIALISE ENCRYPTION; SAVE
485 * WORD IN THE FILE. IF OP>0, START READING A FILE; READ THE FILE TO FIND
486 * THE VALUE WITH WHICH TO DECRYPT THE REST. IN EITHER CASE, IF A FILE IS
487 * ALREADY OPEN, FINISH WRITING/READING IT AND DON'T START A NEW ONE. IF OP=0,
488 * READ/WRITE A SINGLE WORD. WORDS ARE BUFFERED IN CASE THAT MAKES FOR MORE
489 * EFFICIENT DISK USE. WE ALSO COMPUTE A SIMPLE CHECKSUM TO CATCH ELEMENTARY
490 * POKING WITHIN THE SAVED FILE. WHEN WE FINISH READING/WRITING THE FILE,
491 * WE STORE ZERO INTO WORD IF THERE'S NO CHECKSUM ERROR, ELSE NONZERO. */
494 if(OP != 0){long ifvar; ifvar=(STATE); switch (ifvar<0? -1 : ifvar>0? 1 :
495 0) { case -1: goto L30; case 0: goto L10; case 1: goto L30; }}
496 if(STATE == 0)return;
497 if(N == 250)SAVEIO(1,STATE > 0,BUF);
499 H1=MOD(HASH*1093L+221573L,1048576L);
500 HASH=MOD(H1*1093L+221573L,1048576L);
501 H1=MOD(H1,1234)*765432+MOD(HASH,123);
503 if(STATE > 0)WORD=BUF[N]+H1;
506 CKSUM=MOD(CKSUM*13+WORD,1000000000L);
510 SAVEIO(0,STATE > 0,BUF);
512 if(STATE > 0) goto L15;
513 HASH=MOD(WORD,1048576L);
514 BUF[0]=1234L*5678L-HASH;
518 L15: SAVEIO(1,TRUE,BUF);
519 HASH=MOD(1234L*5678L-BUF[0],1048576L);
522 L30: if(N == 250)SAVEIO(1,STATE > 0,BUF);
524 if(STATE > 0) goto L32;
525 N--; BUF[N]=CKSUM; N++;
527 L32: N--; WORD=BUF[N]-CKSUM; N++;
528 SAVEIO(-1,STATE > 0,BUF);
537 /* DATA STRUC. ROUTINES (VOCAB, DSTROY, JUGGLE, MOVE, PUT, CARRY, DROP, ATDWRF)
541 #define SAVWRD(OP,WORD) fSAVWRD(OP,&WORD)
543 long fVOCAB(ID,INIT)long ID, INIT; {
546 /* LOOK UP ID IN THE VOCABULARY (ATAB) AND RETURN ITS "DEFINITION" (KTAB), OR
547 * -1 IF NOT FOUND. IF INIT IS POSITIVE, THIS IS AN INITIALISATION CALL SETTING
548 * UP A KEYWORD VARIABLE, AND NOT FINDING IT CONSTITUTES A BUG. IT ALSO MEANS
549 * THAT ONLY KTAB VALUES WHICH TAKEN OVER 1000 EQUAL INIT MAY BE CONSIDERED.
550 * (THUS "STEPS", WHICH IS A MOTION VERB AS WELL AS AN OBJECT, MAY BE LOCATED
551 * AS AN OBJECT.) AND IT ALSO MEANS THE KTAB VALUE IS TAKEN MOD 1000. */
554 /* 1 */ for (I=1; I<=TABSIZ; I++) {
555 if(KTAB[I] == -1) goto L2;
557 if(INIT >= 0 && KTAB[I]/1000 != INIT) goto L1;
558 if(ATAB[I] == ID+HASH*HASH) goto L3;
564 if(INIT < 0)return(VOCAB);
568 if(INIT >= 0)VOCAB=MOD(VOCAB,1000);
574 #define VOCAB(ID,INIT) fVOCAB(ID,INIT)
576 void fDSTROY(OBJECT)long OBJECT; {
579 /* PERMANENTLY ELIMINATE "OBJECT" BY MOVING TO A NON-EXISTENT LOCATION. */
588 #define DSTROY(OBJECT) fDSTROY(OBJECT)
590 void fJUGGLE(OBJECT)long OBJECT; {
593 /* JUGGLE AN OBJECT BY PICKING IT UP AND PUTTING IT DOWN AGAIN, THE PURPOSE
594 * BEING TO GET THE OBJECT TO THE FRONT OF THE CHAIN OF THINGS AT ITS LOC. */
606 #define JUGGLE(OBJECT) fJUGGLE(OBJECT)
608 void fMOVE(OBJECT,WHERE)long OBJECT, WHERE; {
611 /* PLACE ANY OBJECT ANYWHERE BY PICKING IT UP AND DROPPING IT. MAY ALREADY BE
612 * TOTING, IN WHICH CASE THE CARRY IS A NO-OP. MUSTN'T PICK UP OBJECTS WHICH
613 * ARE NOT AT ANY LOC, SINCE CARRY WANTS TO REMOVE OBJECTS FROM ATLOC CHAINS. */
616 if(OBJECT > 100) goto L1;
619 L1: {long x = OBJECT-100; FROM=FIXED[x];}
620 L2: if(FROM > 0 && FROM <= 300)CARRY(OBJECT,FROM);
627 #define MOVE(OBJECT,WHERE) fMOVE(OBJECT,WHERE)
629 long fPUT(OBJECT,WHERE,PVAL)long OBJECT, PVAL, WHERE; {
632 /* PUT IS THE SAME AS MOVE, EXCEPT IT RETURNS A VALUE USED TO SET UP THE
633 * NEGATED PROP VALUES FOR THE REPOSITORY OBJECTS. */
643 #define PUT(OBJECT,WHERE,PVAL) fPUT(OBJECT,WHERE,PVAL)
645 void fCARRY(OBJECT,WHERE)long OBJECT, WHERE; {
648 /* START TOTING AN OBJECT, REMOVING IT FROM THE LIST OF THINGS AT ITS FORMER
649 * LOCATION. INCR HOLDNG UNLESS IT WAS ALREADY BEING TOTED. IF OBJECT>100
650 * (MOVING "FIXED" SECOND LOC), DON'T CHANGE PLACE OR HOLDNG. */
653 if(OBJECT > 100) goto L5;
654 if(PLACE[OBJECT] == -1)return;
657 L5: if(ATLOC[WHERE] != OBJECT) goto L6;
658 ATLOC[WHERE]=LINK[OBJECT];
660 L6: TEMP=ATLOC[WHERE];
661 L7: if(LINK[TEMP] == OBJECT) goto L8;
664 L8: LINK[TEMP]=LINK[OBJECT];
670 #define CARRY(OBJECT,WHERE) fCARRY(OBJECT,WHERE)
672 void fDROP(OBJECT,WHERE)long OBJECT, WHERE; {
675 /* PLACE AN OBJECT AT A GIVEN LOC, PREFIXING IT ONTO THE ATLOC LIST. DECR
676 * HOLDNG IF THE OBJECT WAS BEING TOTED. */
679 if(OBJECT > 100) goto L1;
680 if(PLACE[OBJECT] == -1)HOLDNG=HOLDNG-1;
683 L1: {long x = OBJECT-100; FIXED[x]=WHERE;}
684 L2: if(WHERE <= 0)return;
685 LINK[OBJECT]=ATLOC[WHERE];
692 #define DROP(OBJECT,WHERE) fDROP(OBJECT,WHERE)
694 long fATDWRF(WHERE)long WHERE; {
697 /* RETURN THE INDEX OF FIRST DWARF AT THE GIVEN LOCATION, ZERO IF NO DWARF IS
698 * THERE (OR IF DWARVES NOT ACTIVE YET), -1 IF ALL DWARVES ARE DEAD. IGNORE
699 * THE PIRATE (6TH DWARF). */
703 if(DFLAG < 2)return(ATDWRF);
705 /* 1 */ for (I=1; I<=5; I++) {
706 if(DLOC[I] == WHERE) goto L2;
707 L1: if(DLOC[I] != 0)ATDWRF=0;
718 #define ATDWRF(WHERE) fATDWRF(WHERE)
722 /* UTILITY ROUTINES (SETBIT, TSTBIT, RAN, RNDVOC, BUG) */
725 long fSETBIT(BIT)long BIT; {
728 /* RETURNS 2**BIT FOR USE IN CONSTRUCTING BIT-MASKS. */
732 if(BIT <= 0)return(SETBIT);
733 /* 1 */ for (I=1; I<=BIT; I++) {
734 L1: SETBIT=SETBIT+SETBIT;
741 #define SETBIT(BIT) fSETBIT(BIT)
743 long fTSTBIT(MASK,BIT)long BIT, MASK; {
746 /* RETURNS TRUE IF THE SPECIFIED BIT IS SET IN THE MASK. */
749 TSTBIT=MOD(MASK/SETBIT(BIT),2) != 0;
755 #define TSTBIT(MASK,BIT) fTSTBIT(MASK,BIT)
757 long fRAN(RANGE)long RANGE; {
758 static long D, R = 0, RAN, T;
760 /* SINCE THE RAN FUNCTION IN LIB40 SEEMS TO BE A REAL LOSE, WE'LL USE ONE OF
761 * OUR OWN. IT'S BEEN RUN THROUGH MANY OF THE TESTS IN KNUTH VOL. 2 AND
762 * SEEMS TO BE QUITE RELIABLE. RAN RETURNS A VALUE UNIFORMLY SELECTED
763 * BETWEEN 0 AND RANGE-1. */
767 if(R != 0 && RANGE >= 0) goto L1;
771 L1: /* 2 */ for (T=1; T<=D; T++) {
772 L2: R=MOD(R*1093L+221587L,1048576L);
774 RAN=(RANGE*R)/1048576;
780 #define RAN(RANGE) fRAN(RANGE)
782 long fRNDVOC(CHAR,FORCE)long CHAR, FORCE; {
783 long DIV, I, J, RNDVOC;
785 /* SEARCHES THE VOCABULARY FOR A WORD WHOSE SECOND CHARACTER IS CHAR, AND
786 * CHANGES THAT WORD SUCH THAT EACH OF THE OTHER FOUR CHARACTERS IS A
787 * RANDOM LETTER. IF FORCE IS NON-ZERO, IT IS USED AS THE NEW WORD.
788 * RETURNS THE NEW WORD. */
792 if(RNDVOC != 0) goto L3;
793 /* 1 */ for (I=1; I<=5; I++) {
796 L1: RNDVOC=RNDVOC*64+J;
800 /* 5 */ for (I=1; I<=TABSIZ; I++) {
802 if(MOD((ATAB[I]-J*J)/DIV,64L) == CHAR) goto L8;
807 L8: ATAB[I]=RNDVOC+J*J;
813 #define RNDVOC(CHAR,FORCE) fRNDVOC(CHAR,FORCE)
815 void fBUG(NUM)long NUM; {
817 /* THE FOLLOWING CONDITIONS ARE CURRENTLY CONSIDERED FATAL BUGS. NUMBERS < 20
818 * ARE DETECTED WHILE READING THE DATABASE; THE OTHERS OCCUR AT "RUN TIME".
819 * 0 MESSAGE LINE > 70 CHARACTERS
820 * 1 NULL LINE IN MESSAGE
821 * 2 TOO MANY WORDS OF MESSAGES
822 * 3 TOO MANY TRAVEL OPTIONS
823 * 4 TOO MANY VOCABULARY WORDS
824 * 5 REQUIRED VOCABULARY WORD NOT FOUND
825 * 6 TOO MANY RTEXT MESSAGES
827 * 8 LOCATION HAS COND BIT BEING SET TWICE
828 * 9 INVALID SECTION NUMBER IN DATABASE
829 * 10 TOO MANY LOCATIONS
830 * 11 TOO MANY CLASS OR TURN MESSAGES
831 * 20 SPECIAL TRAVEL (500>L>300) EXCEEDS GOTO LIST
832 * 21 RAN OFF END OF VOCABULARY TABLE
833 * 22 VOCABULARY TYPE (N/1000) NOT BETWEEN 0 AND 3
834 * 23 INTRANSITIVE ACTION VERB EXCEEDS GOTO LIST
835 * 24 TRANSITIVE ACTION VERB EXCEEDS GOTO LIST
836 * 25 CONDITIONAL TRAVEL ENTRY WITH NO ALTERNATIVE
837 * 26 LOCATION HAS NO TRAVEL ENTRIES
838 * 27 HINT NUMBER EXCEEDS GOTO LIST
839 * 28 INVALID MONTH RETURNED BY DATE FUNCTION
840 * 29 TOO MANY PARAMETERS GIVEN TO SETPRM */
842 printf("Fatal error %d. See source code for interpretation.\n",
851 /* MACHINE DEPENDENT ROUTINES (MAPLIN, TYPE, MPINIT, SAVEIO) */
853 #define BUG(NUM) fBUG(NUM)
855 void fMAPLIN(FIL)long FIL; {
856 long I, VAL; static FILE *OPENED = NULL;
858 /* READ A LINE OF INPUT, EITHER FROM A FILE (IF FIL=.TRUE.) OR FROM THE
859 * KEYBOARD, TRANSLATE THE CHARS TO INTEGERS IN THE RANGE 0-126 AND STORE
860 * THEM IN THE COMMON ARRAY "INLINE". INTEGER VALUES ARE AS FOLLOWS:
861 * 0 = SPACE [ASCII CODE 40 OCTAL, 32 DECIMAL]
862 * 1-2 = !" [ASCII 41-42 OCTAL, 33-34 DECIMAL]
863 * 3-10 = '()*+,-. [ASCII 47-56 OCTAL, 39-46 DECIMAL]
864 * 11-36 = UPPER-CASE LETTERS
865 * 37-62 = LOWER-CASE LETTERS
866 * 63 = PERCENT (%) [ASCII 45 OCTAL, 37 DECIMAL]
867 * 64-73 = DIGITS, 0 THROUGH 9
868 * REMAINING CHARACTERS CAN BE TRANSLATED ANY WAY THAT IS CONVENIENT;
869 * THE "TYPE" ROUTINE BELOW IS USED TO MAP THEM BACK TO CHARACTERS WHEN
870 * NECESSARY. THE ABOVE MAPPINGS ARE REQUIRED SO THAT CERTAIN SPECIAL
871 * CHARACTERS ARE KNOWN TO FIT IN 6 BITS AND/OR CAN BE EASILY SPOTTED.
872 * ARRAY ELEMENTS BEYOND THE END OF THE LINE SHOULD BE FILLED WITH 0,
873 * AND LNLENG SHOULD BE SET TO THE INDEX OF THE LAST CHARACTER.
875 * IF THE DATA FILE USES A CHARACTER OTHER THAN SPACE (E.G., TAB) TO
876 * SEPARATE NUMBERS, THAT CHARACTER SHOULD ALSO TRANSLATE TO 0.
878 * THIS PROCEDURE MAY USE THE MAP1,MAP2 ARRAYS TO MAINTAIN STATIC DATA FOR
879 * THE MAPPING. MAP2(1) IS SET TO 0 WHEN THE PROGRAM STARTS
880 * AND IS NOT CHANGED THEREAFTER UNLESS THE ROUTINES ON THIS PAGE CHOOSE
883 * NOTE THAT MAPLIN IS EXPECTED TO OPEN THE FILE THE FIRST TIME IT IS
884 * ASKED TO READ A LINE FROM IT. THAT IS, THERE IS NO OTHER PLACE WHERE
885 * THE DATA FILE IS OPENED. */
888 if(MAP2[1] == 0)MPINIT();
892 if(feof(stdin)) score(1);
897 OPENED=fopen("ram:adventure.text","r" /* NOT binary */);
900 OPENED=fopen("adventure.text","r" /* NOT binary */);
901 if(!OPENED){printf("Can't read adventure.text!\n"); exit(FALSE);}
903 fgets(INLINE+1,100,OPENED);
906 /* 25 */ for (I=1; I<=100 && INLINE[I]!=0; I++) {
909 L25: if(INLINE[I] != 0)LNLENG=I;
912 if(FIL && LNLENG == 0) goto L15;
913 /* ABOVE IS TO GET AROUND AN F40 COMPILER BUG WHEREIN IT READS A BLANK
914 * LINE WHENEVER A CRLF IS BROKEN ACROSS A RECORD BOUNDARY. */
920 #define MAPLIN(FIL) fMAPLIN(FIL)
925 /* TYPE THE FIRST "LNLENG" CHARACTERS STORED IN INLINE, MAPPING THEM
926 * FROM INTEGERS TO TEXT PER THE RULES DESCRIBED ABOVE. INLINE(I),
927 * I=1,LNLENG MAY BE CHANGED BY THIS ROUTINE. */
930 if(LNLENG != 0) goto L10;
934 L10: if(MAP2[1] == 0)MPINIT();
935 /* 20 */ for (I=1; I<=LNLENG; I++) {
937 L20: {long x = VAL+1; INLINE[I]=MAP2[x];}
939 {long x = LNLENG+1; INLINE[x]=0;}
940 printf("%s\n",INLINE+1);
946 #define TYPE() fTYPE()
949 long FIRST, I, J, LAST, VAL;
950 static long RUNS[7][2] = {32,34, 39,46, 65,90, 97,122, 37,37, 48,57, 0,126};
953 /* 10 */ for (I=1; I<=128; I++) {
957 /* 20 */ for (I=0; I<7; I++) {
960 /* 22 */ for (J=FIRST; J<=LAST; J++) {
961 J++; if(MAP1[J] >= 0) goto L22;
969 /* FOR THIS VERSION, TAB (9) MAPS TO SPACE (32), SO DEL (127) USES TAB'S VALUE */
973 /* 30 */ for (I=0; I<=126; I++) {
974 I++; VAL=MAP1[I]+1; I--;
975 MAP2[VAL]=I*('B'-'A');
976 L30: if(I >= 64)MAP2[VAL]=(I-64)*('B'-'A')+'@';
984 #define MPINIT() fMPINIT()
986 void fSAVEIO(OP,IN,ARR)long ARR[], IN, OP; {
987 static FILE *F; char NAME[50];
989 /* IF OP=0, ASK FOR A FILE NAME AND OPEN A FILE. (IF IN=.TRUE., THE FILE IS FOR
990 * INPUT, ELSE OUTPUT.) IF OP>0, READ/WRITE ARR FROM/INTO THE PREVIOUSLY-OPENED
991 * FILE. (ARR IS A 250-INTEGER ARRAY.) IF OP<0, FINISH READING/WRITING THE
992 * FILE. (FINISHING WRITING CAN BE A NO-OP IF A "STOP" STATEMENT DOES IT
993 * AUTOMATICALLY. FINISHING READING CAN BE A NO-OP AS LONG AS A SUBSEQUENT
994 * SAVEIO(0,.FALSE.,X) WILL STILL WORK.) IF YOU CAN CATCH ERRORS (E.G., NO SUCH
995 * FILE) AND TRY AGAIN, GREAT. DEC F40 CAN'T. */
998 {long ifvar; ifvar=(OP); switch (ifvar<0? -1 : ifvar>0? 1 : 0) { case -1:
999 goto L10; case 0: goto L20; case 1: goto L30; }}
1004 L20: printf("\nFile name: ");
1006 F=fopen(NAME,(IN ? READ_MODE : WRITE_MODE));
1007 if(F == NULL) {printf("Can't open file, try again.\n"); goto L20;}
1010 L30: if(IN)fread(ARR,4,250,F);
1011 if(!IN)fwrite(ARR,4,250,F);
1018 long fIABS(N)long N; {return(N<0? -N : N);}
1019 long fMOD(N,M)long N, M; {return(N%M);}