7 /* hack to ignore GCC Unused Result */
8 #define IGNORE(r) do{if(r){}}while(0)
10 /* I/O routines (SPEAK, PSPEAK, RSPEAK, SETPRM, GETIN, YES) */
14 long BLANK, CASE, I, K, L, NEG, NPARMS, PARM, PRMTYP, STATE;
16 /* Print the message which starts at LINES(N). Precede it with a blank line
17 * unless BLKLIN is false. */
24 L10: L=IABS(LINES[K])-1;
29 /* 20 */ for (I=K; I<=L; I++) {
30 L20: PUTTXT(LINES[I],STATE,2,I);
34 L32: if(LNPOSN > LNLENG) goto L40;
35 if(INLINE[LNPOSN] != 63) goto L30;
36 {long x = LNPOSN+1; PRMTYP=INLINE[x];}
37 /* 63 is a "%"; the next character determine the type of parameter: 1 (!) =
38 * suppress message completely, 29 (S) = NULL If PARM=1, else 'S' (optional
39 * plural ending), 33 (W) = word (two 30-bit values) with trailing spaces
40 * suppressed, 22 (L) or 31 (U) = word but map to lower/upper case, 13 (C) =
41 * word in lower case with first letter capitalised, 30 (T) = text ending
42 * with a word of -1, 65-73 (1-9) = number using that many characters,
43 * 12 (B) = variable number of blanks. */
44 if(PRMTYP == 1)return;
45 if(PRMTYP == 29) goto L320;
46 if(PRMTYP == 30) goto L340;
47 if(PRMTYP == 12) goto L360;
48 if(PRMTYP == 33 || PRMTYP == 22 || PRMTYP == 31 || PRMTYP == 13) goto
51 if(PRMTYP < 1 || PRMTYP > 9) goto L30;
52 SHFTXT(LNPOSN+2,PRMTYP-2);
54 PARM=IABS(PARMS[NPARMS]);
56 if(PARMS[NPARMS] < 0)NEG=9;
57 /* 390 */ for (I=1; I<=PRMTYP; I++) {
59 INLINE[LNPOSN]=MOD(PARM,10)+64;
60 if(I == 1 || PARM != 0) goto L390;
66 L395: NPARMS=NPARMS+1;
69 L320: SHFTXT(LNPOSN+2,-1);
71 if(PARMS[NPARMS] == 1)SHFTXT(LNPOSN+1,-1);
74 L340: SHFTXT(LNPOSN+2,-2);
77 L345: if(PARMS[NPARMS] < 0) goto L395;
78 {long x = NPARMS+1; if(PARMS[x] < 0)CASE=0;}
79 PUTTXT(PARMS[NPARMS],STATE,CASE,0);
83 L360: PRMTYP=PARMS[NPARMS];
84 SHFTXT(LNPOSN+2,PRMTYP-2);
85 if(PRMTYP == 0) goto L395;
86 /* 365 */ for (I=1; I<=PRMTYP; I++) {
88 L365: LNPOSN=LNPOSN+1;
92 L380: SHFTXT(LNPOSN+2,-2);
95 if(PRMTYP == 31)CASE=1;
96 if(PRMTYP == 33)CASE=0;
98 PUTTXT(PARMS[NPARMS],STATE,CASE,0);
99 {long x = NPARMS+1; PUTTXT(PARMS[x],STATE,CASE,0);}
100 if(PRMTYP == 13 && INLINE[I] >= 37 && INLINE[I] <=
101 62)INLINE[I]=INLINE[I]-26;
105 L40: if(BLANK)TYPE0();
109 if(LINES[K] >= 0) goto L10;
115 #define SPEAK(N) fSPEAK(N)
117 void fPSPEAK(long MSG,long SKIP) {
120 /* Find the skip+1st message from msg and print it. MSG should be the index of
121 * the inventory message for object. (INVEN+N+1 message is PROP=N message). */
125 if(SKIP < 0) goto L9;
126 /* 3 */ for (I=0; I<=SKIP; I++) {
127 L1: M=IABS(LINES[M]);
128 if(LINES[M] >= 0) goto L1;
137 #define PSPEAK(MSG,SKIP) fPSPEAK(MSG,SKIP)
139 void fRSPEAK(long I) {
142 /* Print the I-TH "random" message (section 6 of database). */
145 if(I != 0)SPEAK(RTEXT[I]);
151 #define RSPEAK(I) fRSPEAK(I)
153 void fSETPRM(long FIRST, long P1, long P2) {
156 /* Stores parameters into the PRMCOM parms array for use by speak. P1 and P2
157 * are stored into PARMS(FIRST) and PARMS(FIRST+1). */
160 if(FIRST >= 25)BUG(29);
162 {long x = FIRST+1; PARMS[x]=P2;}
168 #define SETPRM(FIRST,P1,P2) fSETPRM(FIRST,P1,P2)
170 #define WORD1 (*wORD1)
171 #define WORD1X (*wORD1X)
172 #define WORD2 (*wORD2)
173 #define WORD2X (*wORD2X)
174 void fGETIN(long *wORD1, long *wORD1X, long *wORD2, long *wORD2X) {
177 /* Get a command from the adventurer. snarf out the first word, pad it with
178 * blanks, and return it in WORD1. Chars 6 thru 10 are returned in WORD1X, in
179 * case we need to print out the whole word in an error message. Any number of
180 * blanks may follow the word. If a second word appears, it is returned in
181 * WORD2 (chars 6 thru 10 in WORD2X), else WORD2 is -1. */
184 L10: if(BLKLIN)TYPE0();
186 WORD1=GETTXT(true,true,true,0);
187 if(BLKLIN && WORD1 < 0) goto L10;
188 WORD1X=GETTXT(false,true,true,0);
189 L12: JUNK=GETTXT(false,true,true,0);
190 if(JUNK > 0) goto L12;
191 WORD2=GETTXT(true,true,true,0);
192 WORD2X=GETTXT(false,true,true,0);
193 L22: JUNK=GETTXT(false,true,true,0);
194 if(JUNK > 0) goto L22;
195 if(GETTXT(true,true,true,0) <= 0)return;
206 #define GETIN(WORD1,WORD1X,WORD2,WORD2X) fGETIN(&WORD1,&WORD1X,&WORD2,&WORD2X)
208 long fYES(long X, long Y, long Z) {
210 long YES, REPLY, JUNK1, JUNK2, JUNK3;
212 /* Print message X, wait for yes/no answer. If yes, print Y and return true;
213 * if no, print Z and return false. */
216 GETIN(REPLY,JUNK1,JUNK2,JUNK3);
217 if(REPLY == MAKEWD(250519) || REPLY == MAKEWD(25)) goto L10;
218 if(REPLY == MAKEWD(1415) || REPLY == MAKEWD(14)) goto L20;
233 /* Line-parsing routines (GETNUM, GETTXT, MAKEWD, PUTTXT, SHFTXT, TYPE0)
236 /* The routines on this page handle all the stuff that would normally be
237 * taken care of by format statements. We do it this way instead so that
238 * we can handle textual data in a machine independent fashion. All the
239 * machine dependent i/o stuff is on the following page. See that page
240 * for a description of MAPCOM's inline array. */
242 #define YES(X,Y,Z) fYES(X,Y,Z)
244 long fGETNUM(long K) {
245 long DIGIT, GETNUM, SIGN;
247 /* Obtain the next integer from an input line. If K>0, we first read a
248 * new input line from a file; if K<0, we read a line from the keyboard;
249 * if K=0 we use a line that has already been read (and perhaps partially
250 * scanned). If we're at the end of the line or encounter an illegal
251 * character (not a digit, hyphen, or blank), we return 0. */
254 if(K != 0)MAPLIN(K > 0);
256 L10: if(LNPOSN > LNLENG)return(GETNUM);
257 if(INLINE[LNPOSN] != 0) goto L20;
262 if(INLINE[LNPOSN] != 9) goto L32;
264 L30: LNPOSN=LNPOSN+1;
265 L32: if(LNPOSN > LNLENG || INLINE[LNPOSN] == 0) goto L42;
266 DIGIT=INLINE[LNPOSN]-64;
267 if(DIGIT < 0 || DIGIT > 9) goto L40;
268 GETNUM=GETNUM*10+DIGIT;
272 L42: GETNUM=GETNUM*SIGN;
279 #define GETNUM(K) fGETNUM(K)
281 long fGETTXT(long SKIP,long ONEWRD, long UPPER, long HASH) {
282 long CHAR, GETTXT, I; static long SPLITTING = -1;
284 /* Take characters from an input line and pack them into 30-bit words.
285 * Skip says to skip leading blanks. ONEWRD says stop if we come to a
286 * blank. UPPER says to map all letters to uppercase. HASH may be used
287 * as a parameter for encrypting the text if desired; however, a hash of 0
288 * should result in unmodified bytes being packed. If we reach the
289 * end of the line, the word is filled up with blanks (which encode as 0's).
290 * If we're already at end of line when GETTXT is called, we return -1. */
292 if(LNPOSN != SPLITTING)SPLITTING = -1;
294 L10: if(LNPOSN > LNLENG)return(GETTXT);
295 if((!SKIP) || INLINE[LNPOSN] != 0) goto L11;
300 /* 15 */ for (I=1; I<=5; I++) {
302 if(LNPOSN > LNLENG || (ONEWRD && INLINE[LNPOSN] == 0)) goto L15;
304 if(CHAR >= 63) goto L12;
306 if(UPPER && CHAR >= 37)CHAR=CHAR-26;
310 L12: if(SPLITTING == LNPOSN) goto L13;
315 L13: GETTXT=GETTXT+CHAR-63;
317 L14: LNPOSN=LNPOSN+1;
321 if(HASH)GETTXT=GETTXT+MOD(HASH*13579L+5432L,97531L)*12345L+HASH;
327 #define GETTXT(SKIP,ONEWRD,UPPER,HASH) fGETTXT(SKIP,ONEWRD,UPPER,HASH)
329 long fMAKEWD(long LETTRS) {
332 /* Combine five uppercase letters (represented by pairs of decimal digits
333 * in lettrs) to form a 30-bit value matching the one that GETTXT would
334 * return given those characters plus trailing blanks and HASH=0. Caution:
335 * lettrs will overflow 31 bits if 5-letter word starts with V-Z. As a
336 * kludgey workaround, you can increment a letter by 5 by adding 50 to
337 * the next pair of digits. */
343 L10: MAKEWD=MAKEWD+I*(MOD(L,50)+10);
345 if(MOD(L,100) > 50)MAKEWD=MAKEWD+I*5;
348 I=64L*64L*64L*64L*64L/I;
355 #define MAKEWD(LETTRS) fMAKEWD(LETTRS)
357 #define STATE (*sTATE)
358 void fPUTTXT(long WORD, long *sTATE, long CASE, long HASH) {
359 long ALPH1, ALPH2, BYTE, DIV, I, W;
361 /* Unpack the 30-bit value in word to obtain up to 5 integer-encoded chars,
362 * and store them in inline starting at LNPOSN. If LNLENG>=LNPOSN, shift
363 * existing characters to the right to make room. HASH must be the same
364 * as it was when gettxt created the 30-bit word. STATE will be zero when
365 * puttxt is called with the first of a sequence of words, but is thereafter
366 * unchanged by the caller, so PUTTXT can use it to maintain state across
367 * calls. LNPOSN and LNLENG are incremented by the number of chars stored.
368 * If CASE=1, all letters are made uppercase; if -1, lowercase; if 0, as is.
369 * any other value for case is the same as 0 but also causes trailing blanks
370 * to be included (in anticipation of subsequent additional text). */
374 ALPH2=26*IABS(CASE)+ALPH1;
375 if(IABS(CASE) > 1)ALPH1=ALPH2;
376 /* ALPH1&2 DEFINE RANGE OF WRONG-CASE CHARS, 11-36 OR 37-62 OR EMPTY. */
379 if(HASH)W=W-MOD(HASH*13579L+5432L,97531L)*12345L-HASH;
380 /* 18 */ for (I=1; I<=5; I++) {
381 if(W <= 0 && STATE == 0 && IABS(CASE) <= 1)return;
383 if(STATE != 0 || BYTE != 63) goto L12;
387 L12: SHFTXT(LNPOSN,1);
389 if(STATE < ALPH2 && STATE >= ALPH1)STATE=STATE-26*CASE;
390 INLINE[LNPOSN]=STATE;
393 L18: W=(W-BYTE*DIV)*64;
401 #define PUTTXT(WORD,STATE,CASE,HASH) fPUTTXT(WORD,&STATE,CASE,HASH)
403 void fSHFTXT(long FROM, long DELTA) {
406 /* Move INLINE(N) to INLINE(N+DELTA) for N=FROM,LNLENG. Delta can be
407 * negative. LNLENG is updated; LNPOSN is not changed. */
410 if(LNLENG < FROM || DELTA == 0) goto L2;
411 /* 1 */ for (I=FROM; I<=LNLENG; I++) {
413 if(DELTA > 0)II=FROM+LNLENG-I;
415 L1: INLINE[JJ]=INLINE[II];
417 L2: LNLENG=LNLENG+DELTA;
423 #define SHFTXT(FROM,DELTA) fSHFTXT(FROM,DELTA)
428 /* Type a blank line. This procedure is provided as a convenience for callers
429 * who otherwise have no use for MAPCOM. */
441 #define TYPE0() fTYPE0()
444 /* Suspend/resume I/O routines (SAVWDS, SAVARR, SAVWRD) */
447 void fSAVWDS(long *W1, long *W2, long *W3, long *W4, long *W5, long *W6, long *W7) {
449 /* Write or read 7 variables. See SAVWRD. */
463 #define SAVWDS(W1,W2,W3,W4,W5,W6,W7) fSAVWDS(&W1,&W2,&W3,&W4,&W5,&W6,&W7)
465 void fSAVARR(long ARR[], long N) {
468 /* Write or read an array of N words. See SAVWRD. */
471 /* 1 */ for (I=1; I<=N; I++) {
472 L1: SAVWRD(0,ARR[I]);
479 #define SAVARR(ARR,N) fSAVARR(ARR,N)
482 void fSAVWRD(long OP, long *wORD) {
483 static long BUF[250], CKSUM = 0, H1, HASH = 0, N = 0, STATE = 0;
485 /* If OP<0, start writing a file, using word to initialise encryption; save
486 * word in the file. If OP>0, start reading a file; read the file to find
487 * the value with which to decrypt the rest. In either case, if a file is
488 * already open, finish writing/reading it and don't start a new one. If OP=0,
489 * read/write a single word. Words are buffered in case that makes for more
490 * efficient disk use. We also compute a simple checksum to catch elementary
491 * poking within the saved file. When we finish reading/writing the file,
492 * we store zero into WORD if there's no checksum error, else nonzero. */
495 if(OP != 0){long ifvar; ifvar=(STATE); switch (ifvar<0? -1 : ifvar>0? 1 :
496 0) { case -1: goto L30; case 0: goto L10; case 1: goto L30; }}
497 if(STATE == 0)return;
498 if(N == 250)SAVEIO(1,STATE > 0,BUF);
500 H1=MOD(HASH*1093L+221573L,1048576L);
501 HASH=MOD(H1*1093L+221573L,1048576L);
502 H1=MOD(H1,1234)*765432+MOD(HASH,123);
504 if(STATE > 0)WORD=BUF[N]+H1;
507 CKSUM=MOD(CKSUM*13+WORD,1000000000L);
511 SAVEIO(0,STATE > 0,BUF);
513 if(STATE > 0) goto L15;
514 HASH=MOD(WORD,1048576L);
515 BUF[0]=1234L*5678L-HASH;
519 L15: SAVEIO(1,true,BUF);
520 HASH=MOD(1234L*5678L-BUF[0],1048576L);
523 L30: if(N == 250)SAVEIO(1,STATE > 0,BUF);
525 if(STATE > 0) goto L32;
526 N--; BUF[N]=CKSUM; N++;
528 L32: N--; WORD=BUF[N]-CKSUM; N++;
529 SAVEIO(-1,STATE > 0,BUF);
538 /* Data struc. routines (VOCAB, DSTROY, JUGGLE, MOVE, PUT, CARRY, DROP, ATDWRF)
542 #define SAVWRD(OP,WORD) fSAVWRD(OP,&WORD)
544 long fVOCAB(long ID, long INIT) {
547 /* Look up ID in the vocabulary (ATAB) and return its "definition" (KTAB), or
548 * -1 if not found. If INIT is positive, this is an initialisation call setting
549 * up a keyword variable, and not finding it constitutes a bug. It also means
550 * that only KTAB values which taken over 1000 equal INIT may be considered.
551 * (Thus "STEPS", which is a motion verb as well as an object, may be located
552 * as an object.) And it also means the KTAB value is taken modulo 1000. */
555 /* 1 */ for (I=1; I<=TABSIZ; I++) {
556 if(KTAB[I] == -1) goto L2;
558 if(INIT >= 0 && KTAB[I]/1000 != INIT) goto L1;
559 if(ATAB[I] == ID+HASH*HASH) goto L3;
565 if(INIT < 0)return(VOCAB);
569 if(INIT >= 0)VOCAB=MOD(VOCAB,1000);
575 #define VOCAB(ID,INIT) fVOCAB(ID,INIT)
577 void fDSTROY(long OBJECT) {
580 /* Permanently eliminate "OBJECT" by moving to a non-existent location. */
589 #define DSTROY(OBJECT) fDSTROY(OBJECT)
591 void fJUGGLE(long OBJECT) {
594 /* Juggle an object by picking it up and putting it down again, the purpose
595 * being to get the object to the front of the chain of things at its loc. */
607 #define JUGGLE(OBJECT) fJUGGLE(OBJECT)
609 void fMOVE(long OBJECT, long WHERE) {
612 /* Place any object anywhere by picking it up and dropping it. May already be
613 * toting, in which case the carry is a no-op. Mustn't pick up objects which
614 * are not at any loc, since carry wants to remove objects from ATLOC chains. */
617 if(OBJECT > 100) goto L1;
620 L1: {long x = OBJECT-100; FROM=FIXED[x];}
621 L2: if(FROM > 0 && FROM <= 300)CARRY(OBJECT,FROM);
628 #define MOVE(OBJECT,WHERE) fMOVE(OBJECT,WHERE)
630 long fPUT(long OBJECT, long WHERE, long PVAL) {
633 /* PUT is the same as MOVE, except it returns a value used to set up the
634 * negated PROP values for the repository objects. */
644 #define PUT(OBJECT,WHERE,PVAL) fPUT(OBJECT,WHERE,PVAL)
646 void fCARRY(long OBJECT, long WHERE) {
649 /* Start toting an object, removing it from the list of things at its former
650 * location. Incr holdng unless it was already being toted. If OBJECT>100
651 * (moving "fixed" second loc), don't change PLACE or HOLDNG. */
654 if(OBJECT > 100) goto L5;
655 if(PLACE[OBJECT] == -1)return;
658 L5: if(ATLOC[WHERE] != OBJECT) goto L6;
659 ATLOC[WHERE]=LINK[OBJECT];
661 L6: TEMP=ATLOC[WHERE];
662 L7: if(LINK[TEMP] == OBJECT) goto L8;
665 L8: LINK[TEMP]=LINK[OBJECT];
671 #define CARRY(OBJECT,WHERE) fCARRY(OBJECT,WHERE)
673 void fDROP(long OBJECT, long WHERE) {
676 /* Place an object at a given loc, prefixing it onto the ATLOC list. Decr
677 * HOLDNG if the object was being toted. */
680 if(OBJECT > 100) goto L1;
681 if(PLACE[OBJECT] == -1)HOLDNG=HOLDNG-1;
684 L1: {long x = OBJECT-100; FIXED[x]=WHERE;}
685 L2: if(WHERE <= 0)return;
686 LINK[OBJECT]=ATLOC[WHERE];
693 #define DROP(OBJECT,WHERE) fDROP(OBJECT,WHERE)
695 long fATDWRF(long WHERE) {
698 /* Return the index of first dwarf at the given location, zero if no dwarf is
699 * there (or if dwarves not active yet), -1 if all dwarves are dead. Ignore
700 * the pirate (6th dwarf). */
704 if(DFLAG < 2)return(ATDWRF);
706 /* 1 */ for (I=1; I<=5; I++) {
707 if(DLOC[I] == WHERE) goto L2;
708 L1: if(DLOC[I] != 0)ATDWRF=0;
719 #define ATDWRF(WHERE) fATDWRF(WHERE)
723 /* Utility routines (SETBIT, TSTBIT, RAN, RNDVOC, BUG) */
726 long fSETBIT(long BIT) {
729 /* Returns 2**bit for use in constructing bit-masks. */
733 if(BIT <= 0)return(SETBIT);
734 /* 1 */ for (I=1; I<=BIT; I++) {
735 L1: SETBIT=SETBIT+SETBIT;
742 #define SETBIT(BIT) fSETBIT(BIT)
744 long fTSTBIT(long MASK, long BIT) {
747 /* Returns true if the specified bit is set in the mask. */
750 TSTBIT=MOD(MASK/SETBIT(BIT),2) != 0;
756 #define TSTBIT(MASK,BIT) fTSTBIT(MASK,BIT)
758 long fRAN(long RANGE) {
759 static long D, R = 0, RAN, T;
761 /* Since the ran function in LIB40 seems to be a real lose, we'll use one of
762 * our own. It's been run through many of the tests in Knuth vol. 2 and
763 * seems to be quite reliable. RAN returns a value uniformly selected
764 * between 0 and range-1. */
768 if(R != 0 && RANGE >= 0) goto L1;
772 L1: /* 2 */ for (T=1; T<=D; T++) {
773 L2: R=MOD(R*1093L+221587L,1048576L);
775 RAN=(RANGE*R)/1048576;
781 #define RAN(RANGE) fRAN(RANGE)
783 long fRNDVOC(long CHAR, long FORCE) {
784 long DIV, I, J, RNDVOC;
786 /* Searches the vocabulary for a word whose second character is char, and
787 * changes that word such that each of the other four characters is a
788 * random letter. If force is non-zero, it is used as the new word.
789 * Returns the new word. */
793 if(RNDVOC != 0) goto L3;
794 /* 1 */ for (I=1; I<=5; I++) {
797 L1: RNDVOC=RNDVOC*64+J;
801 /* 5 */ for (I=1; I<=TABSIZ; I++) {
803 if(MOD((ATAB[I]-J*J)/DIV,64L) == CHAR) goto L8;
808 L8: ATAB[I]=RNDVOC+J*J;
814 #define RNDVOC(CHAR,FORCE) fRNDVOC(CHAR,FORCE)
816 void fBUG(long NUM) {
818 /* The following conditions are currently considered fatal bugs. Numbers < 20
819 * are detected while reading the database; the others occur at "run time".
820 * 0 Message line > 70 characters
821 * 1 Null line in message
822 * 2 Too many words of messages
823 * 3 Too many travel options
824 * 4 Too many vocabulary words
825 * 5 Required vocabulary word not found
826 * 6 Too many RTEXT messages
828 * 8 Location has cond bit being set twice
829 * 9 Invalid section number in database
830 * 10 Too many locations
831 * 11 Too many class or turn messages
832 * 20 Special travel (500>L>300) exceeds goto list
833 * 21 Ran off end of vocabulary table
834 * 22 Vocabulary type (N/1000) not between 0 and 3
835 * 23 Intransitive action verb exceeds goto list
836 * 24 Transitive action verb exceeds goto list
837 * 25 Conditional travel entry with no alternative
838 * 26 Location has no travel entries
839 * 27 Hint number exceeds goto list
840 * 28 Invalid month returned by date function
841 * 29 Too many parameters given to SETPRM */
843 printf("Fatal error %ld. See source code for interpretation.\n",
852 /* Machine dependent routines (MAPLIN, TYPE, MPINIT, SAVEIO) */
854 #define BUG(NUM) fBUG(NUM)
856 void fMAPLIN(long FIL) {
857 long I, VAL; static FILE *OPENED = NULL;
859 /* Read a line of input, either from a file (if FIL=true) or from the
860 * keyboard, translate the chars to integers in the range 0-126 and store
861 * them in the common array "INLINE". Integer values are as follows:
862 * 0 = space [ASCII CODE 40 octal, 32 decimal]
863 * 1-2 = !" [ASCII 41-42 octal, 33-34 decimal]
864 * 3-10 = '()*+,-. [ASCII 47-56 octal, 39-46 decimal]
865 * 11-36 = upper-case letters
866 * 37-62 = lower-case letters
867 * 63 = percent (%) [ASCII 45 octal, 37 decimal]
868 * 64-73 = digits, 0 through 9
869 * Remaining characters can be translated any way that is convenient;
870 * The "TYPE" routine below is used to map them back to characters when
871 * necessary. The above mappings are required so that certain special
872 * characters are known to fit in 6 bits and/or can be easily spotted.
873 * Array elements beyond the end of the line should be filled with 0,
874 * and LNLENG should be set to the index of the last character.
876 * If the data file uses a character other than space (e.g., tab) to
877 * separate numbers, that character should also translate to 0.
879 * This procedure may use the map1,map2 arrays to maintain static data for
880 * the mapping. MAP2(1) is set to 0 when the program starts
881 * and is not changed thereafter unless the routines on this page choose
884 * Note that MAPLIN is expected to open the file the first time it is
885 * asked to read a line from it. that is, there is no other place where
886 * the data file is opened. */
889 if(MAP2[1] == 0)MPINIT();
892 IGNORE(fgets(INLINE+1, sizeof(INLINE)-1, stdin));
893 if(feof(stdin)) score(1);
897 OPENED=fopen("adventure.text","r" /* NOT binary */);
898 if(!OPENED){printf("Can't read adventure.text!\n"); exit(0);}
900 IGNORE(fgets(INLINE+1,sizeof(INLINE)-1,OPENED));
903 /* 25 */ for (I=1; I<=sizeof(INLINE) && INLINE[I]!=0; I++) {
906 L25: if(INLINE[I] != 0)LNLENG=I;
909 if(FIL && LNLENG == 0) goto L15;
910 /* Above is to get around an F40 compiler bug wherein it reads a blank
911 * line whenever a crlf is broken across a record boundary. */
917 #define MAPLIN(FIL) fMAPLIN(FIL)
922 /* Type the first "LNLENG" characters stored in inline, mapping them
923 * from integers to text per the rules described above. INLINE(I),
924 * I=1,LNLENG may be changed by this routine. */
927 if(LNLENG != 0) goto L10;
931 L10: if(MAP2[1] == 0)MPINIT();
932 /* 20 */ for (I=1; I<=LNLENG; I++) {
934 L20: {long x = VAL+1; INLINE[I]=MAP2[x];}
936 {long x = LNLENG+1; INLINE[x]=0;}
937 printf("%s\n",INLINE+1);
943 #define TYPE() fTYPE()
946 long FIRST, I, J, LAST, VAL;
947 static long RUNS[7][2] = {32,34, 39,46, 65,90, 97,122, 37,37, 48,57, 0,126};
950 /* 10 */ for (I=1; I<=128; I++) {
954 /* 20 */ for (I=0; I<7; I++) {
957 /* 22 */ for (J=FIRST; J<=LAST; J++) {
958 J++; if(MAP1[J] >= 0) goto L22;
966 /* For this version, tab (9) maps to space (32), so del (127) uses tab's value */
970 /* 30 */ for (I=0; I<=126; I++) {
971 I++; VAL=MAP1[I]+1; I--;
972 MAP2[VAL]=I*('B'-'A');
973 L30: if(I >= 64)MAP2[VAL]=(I-64)*('B'-'A')+'@';
981 #define MPINIT() fMPINIT()
983 void fSAVEIO(long OP, long IN, long ARR[]) {
984 static FILE *F; char NAME[50];
986 /* If OP=0, ask for a file name and open a file. (If IN=true, the file is for
987 * input, else output.) If OP>0, read/write ARR from/into the previously-opened
988 * file. (ARR is a 250-integer array.) If OP<0, finish reading/writing the
989 * file. (Finishing writing can be a no-op if a "stop" statement does it
990 * automatically. Finishing reading can be a no-op as long as a subsequent
991 * SAVEIO(0,false,X) will still work.) If you can catch errors (e.g., no such
992 * file) and try again, great. DEC F40 can't. */
995 {long ifvar; ifvar=(OP); switch (ifvar<0? -1 : ifvar>0? 1 : 0) { case -1:
996 goto L10; case 0: goto L20; case 1: goto L30; }}
1001 L20: printf("\nFile name: ");
1002 IGNORE(fgets(NAME, sizeof(NAME), stdin));
1003 F=fopen(NAME,(IN ? READ_MODE : WRITE_MODE));
1004 if(F == NULL) {printf("Can't open file, try again.\n"); goto L20;}
1007 L30: if(IN)IGNORE(fread(ARR,sizeof(long),250,F));
1008 if(!IN)fwrite(ARR,sizeof(long),250,F);
1015 long fIABS(N)long N; {return(N<0? -N : N);}
1016 long fMOD(N,M)long N, M; {return(N%M);}