X-Git-Url: https://jxself.org/git/?p=open-adventure.git;a=blobdiff_plain;f=misc.c;h=04792eb9c38fb3955cecaa2f1ce30ff0f65ee909;hp=18b0e6c20fa41a023991f4c3ff50a68c1c26508d;hb=43aef9ceb16d0e2821c5ee81ea9d7c2f7ace84bb;hpb=23f2dbe81467d28e2f45d14bd5c4ce19229f69e3 diff --git a/misc.c b/misc.c index 18b0e6c..04792eb 100644 --- a/misc.c +++ b/misc.c @@ -1,24 +1,22 @@ +#include #include #include -#include "main.h" -#include "misc.h" +#include +#include +#include "advent.h" #include "funcs.h" - -#define TRUE (0==0) -#define FALSE (0!=0) +#include "database.h" /* hack to ignore GCC Unused Result */ #define IGNORE(r) do{if(r){}}while(0) -/* I/O ROUTINES (SPEAK, PSPEAK, RSPEAK, SETPRM, GETIN, YES) */ +/* I/O routines (SPEAK, PSPEAK, RSPEAK, SETPRM, GETIN, YES) */ -#undef SPEAK -void fSPEAK(N)long N; { +void SPEAK(long N) { long BLANK, CASE, I, K, L, NEG, NPARMS, PARM, PRMTYP, STATE; -/* PRINT THE MESSAGE WHICH STARTS AT LINES(N). PRECEDE IT WITH A BLANK LINE - * UNLESS BLKLIN IS FALSE. */ - +/* Print the message which starts at LINES(N). Precede it with a blank line + * unless BLKLIN is false. */ if(N == 0)return; BLANK=BLKLIN; @@ -29,21 +27,21 @@ L10: L=IABS(LINES[K])-1; LNLENG=0; LNPOSN=1; STATE=0; - /* 20 */ for (I=K; I<=L; I++) { -L20: PUTTXT(LINES[I],STATE,2,I); + for (I=K; I<=L; I++) { + PUTTXT(LINES[I],STATE,2); } /* end loop */ LNPOSN=0; L30: LNPOSN=LNPOSN+1; L32: if(LNPOSN > LNLENG) goto L40; if(INLINE[LNPOSN] != 63) goto L30; {long x = LNPOSN+1; PRMTYP=INLINE[x];} -/* 63 IS A "%"; THE NEXT CHARACTER DETERMINE THE TYPE OF PARAMETER: 1 (!) = - * SUPPRESS MESSAGE COMPLETELY, 29 (S) = NULL IF PARM=1, ELSE 'S' (OPTIONAL - * PLURAL ENDING), 33 (W) = WORD (TWO 30-BIT VALUES) WITH TRAILING SPACES - * SUPPRESSED, 22 (L) OR 31 (U) = WORD BUT MAP TO LOWER/UPPER CASE, 13 (C) = - * WORD IN LOWER CASE WITH FIRST LETTER CAPITALISED, 30 (T) = TEXT ENDING - * WITH A WORD OF -1, 65-73 (1-9) = NUMBER USING THAT MANY CHARACTERS, - * 12 (B) = VARIABLE NUMBER OF BLANKS. */ +/* 63 is a "%"; the next character determine the type of parameter: 1 (!) = + * suppress message completely, 29 (S) = NULL If PARM=1, else 'S' (optional + * plural ending), 33 (W) = word (two 30-bit values) with trailing spaces + * suppressed, 22 (L) or 31 (U) = word but map to lower/upper case, 13 (C) = + * word in lower case with first letter capitalised, 30 (T) = text ending + * with a word of -1, 65-73 (1-9) = number using that many characters, + * 12 (B) = variable number of blanks. */ if(PRMTYP == 1)return; if(PRMTYP == 29) goto L320; if(PRMTYP == 30) goto L340; @@ -79,16 +77,16 @@ L340: SHFTXT(LNPOSN+2,-2); CASE=2; L345: if(PARMS[NPARMS] < 0) goto L395; {long x = NPARMS+1; if(PARMS[x] < 0)CASE=0;} - PUTTXT(PARMS[NPARMS],STATE,CASE,0); + PUTTXT(PARMS[NPARMS],STATE,CASE); NPARMS=NPARMS+1; goto L345; L360: PRMTYP=PARMS[NPARMS]; SHFTXT(LNPOSN+2,PRMTYP-2); if(PRMTYP == 0) goto L395; - /* 365 */ for (I=1; I<=PRMTYP; I++) { + for (I=1; I<=PRMTYP; I++) { INLINE[LNPOSN]=0; -L365: LNPOSN=LNPOSN+1; + LNPOSN=LNPOSN+1; } /* end loop */ goto L395; @@ -98,51 +96,42 @@ L380: SHFTXT(LNPOSN+2,-2); if(PRMTYP == 31)CASE=1; if(PRMTYP == 33)CASE=0; I=LNPOSN; - PUTTXT(PARMS[NPARMS],STATE,CASE,0); - {long x = NPARMS+1; PUTTXT(PARMS[x],STATE,CASE,0);} + PUTTXT(PARMS[NPARMS],STATE,CASE); + {long x = NPARMS+1; PUTTXT(PARMS[x],STATE,CASE);} if(PRMTYP == 13 && INLINE[I] >= 37 && INLINE[I] <= 62)INLINE[I]=INLINE[I]-26; NPARMS=NPARMS+2; goto L32; L40: if(BLANK)TYPE0(); - BLANK=FALSE; + BLANK=false; TYPE(); K=L+1; if(LINES[K] >= 0) goto L10; return; } - - -#define SPEAK(N) fSPEAK(N) -#undef PSPEAK -void fPSPEAK(MSG,SKIP)long MSG, SKIP; { +void PSPEAK(long MSG,long SKIP) { long I, M; -/* FIND THE SKIP+1ST MESSAGE FROM MSG AND PRINT IT. MSG SHOULD BE THE INDEX OF - * THE INVENTORY MESSAGE FOR OBJECT. (INVEN+N+1 MESSAGE IS PROP=N MESSAGE). */ +/* Find the skip+1st message from msg and print it. MSG should be the index of + * the inventory message for object. (INVEN+N+1 message is PROP=N message). */ M=PTEXT[MSG]; if(SKIP < 0) goto L9; - /* 3 */ for (I=0; I<=SKIP; I++) { + for (I=0; I<=SKIP; I++) { L1: M=IABS(LINES[M]); if(LINES[M] >= 0) goto L1; -L3: /*etc*/ ; + /*etc*/ ; } /* end loop */ L9: SPEAK(M); return; } +void RSPEAK(long I) { - -#define PSPEAK(MSG,SKIP) fPSPEAK(MSG,SKIP) -#undef RSPEAK -void fRSPEAK(I)long I; { -; - -/* PRINT THE I-TH "RANDOM" MESSAGE (SECTION 6 OF DATABASE). */ +/* Print the I-TH "random" message (section 6 of database). */ if(I != 0)SPEAK(RTEXT[I]); @@ -150,14 +139,11 @@ void fRSPEAK(I)long I; { } - -#define RSPEAK(I) fRSPEAK(I) -#undef SETPRM -void fSETPRM(FIRST,P1,P2)long FIRST, P1, P2; { +void SETPRM(long FIRST, long P1, long P2) { ; -/* STORES PARAMETERS INTO THE PRMCOM PARMS ARRAY FOR USE BY SPEAK. P1 AND P2 - * ARE STORED INTO PARMS(FIRST) AND PARMS(FIRST+1). */ +/* Stores parameters into the PRMCOM parms array for use by speak. P1 and P2 + * are stored into PARMS(FIRST) and PARMS(FIRST+1). */ if(FIRST >= 25)BUG(29); @@ -167,35 +153,35 @@ void fSETPRM(FIRST,P1,P2)long FIRST, P1, P2; { } - -#define SETPRM(FIRST,P1,P2) fSETPRM(FIRST,P1,P2) #undef GETIN #define WORD1 (*wORD1) #define WORD1X (*wORD1X) #define WORD2 (*wORD2) #define WORD2X (*wORD2X) -void fGETIN(wORD1,wORD1X,wORD2,wORD2X)long *wORD1, *wORD1X, *wORD2, *wORD2X; { +bool fGETIN(FILE *input, long *wORD1, long *wORD1X, long *wORD2, long *wORD2X) { long JUNK; -/* GET A COMMAND FROM THE ADVENTURER. SNARF OUT THE FIRST WORD, PAD IT WITH - * BLANKS, AND RETURN IT IN WORD1. CHARS 6 THRU 10 ARE RETURNED IN WORD1X, IN - * CASE WE NEED TO PRINT OUT THE WHOLE WORD IN AN ERROR MESSAGE. ANY NUMBER OF - * BLANKS MAY FOLLOW THE WORD. IF A SECOND WORD APPEARS, IT IS RETURNED IN - * WORD2 (CHARS 6 THRU 10 IN WORD2X), ELSE WORD2 IS -1. */ +/* Get a command from the adventurer. Snarf out the first word, pad it with + * blanks, and return it in WORD1. Chars 6 thru 10 are returned in WORD1X, in + * case we need to print out the whole word in an error message. Any number of + * blanks may follow the word. If a second word appears, it is returned in + * WORD2 (chars 6 thru 10 in WORD2X), else WORD2 is -1. */ L10: if(BLKLIN)TYPE0(); - MAPLIN(FALSE); - WORD1=GETTXT(TRUE,TRUE,TRUE,0); + MAPLIN(input); + if (feof(input)) + return false; + WORD1=GETTXT(true,true,true); if(BLKLIN && WORD1 < 0) goto L10; - WORD1X=GETTXT(FALSE,TRUE,TRUE,0); -L12: JUNK=GETTXT(FALSE,TRUE,TRUE,0); + WORD1X=GETTXT(false,true,true); +L12: JUNK=GETTXT(false,true,true); if(JUNK > 0) goto L12; - WORD2=GETTXT(TRUE,TRUE,TRUE,0); - WORD2X=GETTXT(FALSE,TRUE,TRUE,0); -L22: JUNK=GETTXT(FALSE,TRUE,TRUE,0); + WORD2=GETTXT(true,true,true); + WORD2X=GETTXT(false,true,true); +L22: JUNK=GETTXT(false,true,true); if(JUNK > 0) goto L22; - if(GETTXT(TRUE,TRUE,TRUE,0) <= 0)return; + if(GETTXT(true,true,true) <= 0)return true; RSPEAK(53); goto L10; } @@ -206,57 +192,50 @@ L22: JUNK=GETTXT(FALSE,TRUE,TRUE,0); #undef WORD1X #undef WORD2 #undef WORD2X -#define GETIN(WORD1,WORD1X,WORD2,WORD2X) fGETIN(&WORD1,&WORD1X,&WORD2,&WORD2X) -#undef YES -long fYES(X,Y,Z)long X, Y, Z; { +#define GETIN(SRC,WORD1,WORD1X,WORD2,WORD2X) fGETIN(SRC,&WORD1,&WORD1X,&WORD2,&WORD2X) -long YES, REPLY, JUNK1, JUNK2, JUNK3; +long YES(FILE *input, long X, long Y, long Z) { +long YEAH, REPLY, JUNK1, JUNK2, JUNK3; -/* PRINT MESSAGE X, WAIT FOR YES/NO ANSWER. IF YES, PRINT Y AND RETURN TRUE; - * IF NO, PRINT Z AND RETURN FALSE. */ +/* Print message X, wait for yes/no answer. If yes, print Y and return true; + * if no, print Z and return false. */ L1: RSPEAK(X); - GETIN(REPLY,JUNK1,JUNK2,JUNK3); + GETIN(input, REPLY,JUNK1,JUNK2,JUNK3); if(REPLY == MAKEWD(250519) || REPLY == MAKEWD(25)) goto L10; if(REPLY == MAKEWD(1415) || REPLY == MAKEWD(14)) goto L20; RSPEAK(185); goto L1; -L10: YES=TRUE; +L10: YEAH=true; RSPEAK(Y); - return(YES); -L20: YES=FALSE; + return(YEAH); +L20: YEAH=false; RSPEAK(Z); - return(YES); + return(YEAH); } - - - -/* LINE-PARSING ROUTINES (GETNUM, GETTXT, MAKEWD, PUTTXT, SHFTXT, TYPE0) +/* Line-parsing routines (GETNUM, GETTXT, MAKEWD, PUTTXT, SHFTXT, TYPE0) */ +/* The routines on this page handle all the stuff that would normally be + * taken care of by format statements. We do it this way instead so that + * we can handle textual data in a machine independent fashion. All the + * machine dependent i/o stuff is on the following page. See that page + * for a description of MAPCOM's inline array. */ -/* THE ROUTINES ON THIS PAGE HANDLE ALL THE STUFF THAT WOULD NORMALLY BE - * TAKEN CARE OF BY FORMAT STATEMENTS. WE DO IT THIS WAY INSTEAD SO THAT - * WE CAN HANDLE TEXTUAL DATA IN A MACHINE INDEPENDENT FASHION. ALL THE - * MACHINE DEPENDENT I/O STUFF IS ON THE FOLLOWING PAGE. SEE THAT PAGE - * FOR A DESCRIPTION OF MAPCOM'S INLINE ARRAY. */ - -#define YES(X,Y,Z) fYES(X,Y,Z) -#undef GETNUM -long fGETNUM(K)long K; { -long DIGIT, GETNUM, SIGN; +long GETNUM(FILE *source) { +long DIGIT, NUMBER, SIGN; -/* OBTAIN THE NEXT INTEGER FROM AN INPUT LINE. IF K>0, WE FIRST READ A - * NEW INPUT LINE FROM A FILE; IF K<0, WE READ A LINE FROM THE KEYBOARD; - * IF K=0 WE USE A LINE THAT HAS ALREADY BEEN READ (AND PERHAPS PARTIALLY - * SCANNED). IF WE'RE AT THE END OF THE LINE OR ENCOUNTER AN ILLEGAL - * CHARACTER (NOT A DIGIT, HYPHEN, OR BLANK), WE RETURN 0. */ +/* Obtain the next integer from an input line. If K>0, we first read a + * new input line from a file; if K<0, we read a line from the keyboard; + * if K=0 we use a line that has already been read (and perhaps partially + * scanned). If we're at the end of the line or encounter an illegal + * character (not a digit, hyphen, or blank), we return 0. */ - if(K != 0)MAPLIN(K > 0); - GETNUM=0; -L10: if(LNPOSN > LNLENG)return(GETNUM); + if(source != NULL)MAPLIN(source); + NUMBER=0; +L10: if(LNPOSN > LNLENG)return(NUMBER); if(INLINE[LNPOSN] != 0) goto L20; LNPOSN=LNPOSN+1; goto L10; @@ -268,109 +247,102 @@ L30: LNPOSN=LNPOSN+1; L32: if(LNPOSN > LNLENG || INLINE[LNPOSN] == 0) goto L42; DIGIT=INLINE[LNPOSN]-64; if(DIGIT < 0 || DIGIT > 9) goto L40; - GETNUM=GETNUM*10+DIGIT; + NUMBER=NUMBER*10+DIGIT; goto L30; -L40: GETNUM=0; -L42: GETNUM=GETNUM*SIGN; - LNPOSN=LNPOSN+1; - return(GETNUM); -} - - - -#define GETNUM(K) fGETNUM(K) -#undef GETTXT -long fGETTXT(SKIP,ONEWRD,UPPER,HASH)long HASH, ONEWRD, SKIP, UPPER; { -long CHAR, GETTXT, I; static long SPLITTING = -1; - -/* TAKE CHARACTERS FROM AN INPUT LINE AND PACK THEM INTO 30-BIT WORDS. - * SKIP SAYS TO SKIP LEADING BLANKS. ONEWRD SAYS STOP IF WE COME TO A - * BLANK. UPPER SAYS TO MAP ALL LETTERS TO UPPERCASE. HASH MAY BE USED - * AS A PARAMETER FOR ENCRYPTING THE TEXT IF DESIRED; HOWEVER, A HASH OF 0 - * SHOULD RESULT IN UNMODIFIED BYTES BEING PACKED. IF WE REACH THE - * END OF THE LINE, THE WORD IS FILLED UP WITH BLANKS (WHICH ENCODE AS 0'S). - * IF WE'RE ALREADY AT END OF LINE WHEN GETTXT IS CALLED, WE RETURN -1. */ - - if(LNPOSN != SPLITTING)SPLITTING = -1; - GETTXT= -1; -L10: if(LNPOSN > LNLENG)return(GETTXT); - if((!SKIP) || INLINE[LNPOSN] != 0) goto L11; +L40: NUMBER=0; +L42: NUMBER=NUMBER*SIGN; LNPOSN=LNPOSN+1; - goto L10; - -L11: GETTXT=0; - /* 15 */ for (I=1; I<=5; I++) { - GETTXT=GETTXT*64; - if(LNPOSN > LNLENG || (ONEWRD && INLINE[LNPOSN] == 0)) goto L15; - CHAR=INLINE[LNPOSN]; - if(CHAR >= 63) goto L12; - SPLITTING = -1; - if(UPPER && CHAR >= 37)CHAR=CHAR-26; - GETTXT=GETTXT+CHAR; - goto L14; - -L12: if(SPLITTING == LNPOSN) goto L13; - GETTXT=GETTXT+63; - SPLITTING = LNPOSN; - goto L15; - -L13: GETTXT=GETTXT+CHAR-63; - SPLITTING = -1; -L14: LNPOSN=LNPOSN+1; -L15: /*etc*/ ; - } /* end loop */ - - if(HASH)GETTXT=GETTXT+MOD(HASH*13579L+5432L,97531L)*12345L+HASH; - return(GETTXT); -} - - - -#define GETTXT(SKIP,ONEWRD,UPPER,HASH) fGETTXT(SKIP,ONEWRD,UPPER,HASH) -#undef MAKEWD -long fMAKEWD(LETTRS)long LETTRS; { -long I, L, MAKEWD; - -/* COMBINE FIVE UPPERCASE LETTERS (REPRESENTED BY PAIRS OF DECIMAL DIGITS - * IN LETTRS) TO FORM A 30-BIT VALUE MATCHING THE ONE THAT GETTXT WOULD - * RETURN GIVEN THOSE CHARACTERS PLUS TRAILING BLANKS AND HASH=0. CAUTION: - * LETTRS WILL OVERFLOW 31 BITS IF 5-LETTER WORD STARTS WITH V-Z. AS A - * KLUDGEY WORKAROUND, YOU CAN INCREMENT A LETTER BY 5 BY ADDING 50 TO - * THE NEXT PAIR OF DIGITS. */ - - - MAKEWD=0; + return(NUMBER); +} + +long GETTXT(long SKIP,long ONEWRD, long UPPER) { +/* Take characters from an input line and pack them into 30-bit words. + * Skip says to skip leading blanks. ONEWRD says stop if we come to a + * blank. UPPER says to map all letters to uppercase. If we reach the + * end of the line, the word is filled up with blanks (which encode as 0's). + * If we're already at end of line when TEXT is called, we return -1. */ + + long TEXT; + static long SPLITTING = -1; + + if(LNPOSN != SPLITTING) + SPLITTING = -1; + TEXT= -1; + while (true) { + if(LNPOSN > LNLENG) + return(TEXT); + if((!SKIP) || INLINE[LNPOSN] != 0) + break; + LNPOSN=LNPOSN+1; + } + + TEXT=0; + for (int I=1; I<=5; I++) { + TEXT=TEXT*64; + if(LNPOSN > LNLENG || (ONEWRD && INLINE[LNPOSN] == 0)) + continue; + char current=INLINE[LNPOSN]; + if(current < 63) { + SPLITTING = -1; + if(UPPER && current >= 37) + current=current-26; + TEXT=TEXT+current; + LNPOSN=LNPOSN+1; + continue; + } + if(SPLITTING != LNPOSN) { + TEXT=TEXT+63; + SPLITTING = LNPOSN; + continue; + } + + TEXT=TEXT+current-63; + SPLITTING = -1; + LNPOSN=LNPOSN+1; + } + + return(TEXT); +} + +long MAKEWD(long LETTRS) { +long I, L, WORD; + +/* Combine five uppercase letters (represented by pairs of decimal digits + * in lettrs) to form a 30-bit value matching the one that GETTXT would + * return given those characters plus trailing blanks. Caution: + * lettrs will overflow 31 bits if 5-letter word starts with V-Z. As a + * kludgey workaround, you can increment a letter by 5 by adding 50 to + * the next pair of digits. */ + + + WORD=0; I=1; L=LETTRS; -L10: MAKEWD=MAKEWD+I*(MOD(L,50)+10); +L10: WORD=WORD+I*(MOD(L,50)+10); I=I*64; - if(MOD(L,100) > 50)MAKEWD=MAKEWD+I*5; + if(MOD(L,100) > 50)WORD=WORD+I*5; L=L/100; if(L != 0) goto L10; I=64L*64L*64L*64L*64L/I; - MAKEWD=MAKEWD*I; - return(MAKEWD); + WORD=WORD*I; + return(WORD); } - -#define MAKEWD(LETTRS) fMAKEWD(LETTRS) -#undef PUTTXT #define STATE (*sTATE) -void fPUTTXT(WORD,sTATE,CASE,HASH)long CASE, HASH, *sTATE, WORD; { +void fPUTTXT(long WORD, long *sTATE, long CASE) { long ALPH1, ALPH2, BYTE, DIV, I, W; -/* UNPACK THE 30-BIT VALUE IN WORD TO OBTAIN UP TO 5 INTEGER-ENCODED CHARS, - * AND STORE THEM IN INLINE STARTING AT LNPOSN. IF LNLENG>=LNPOSN, SHIFT - * EXISTING CHARACTERS TO THE RIGHT TO MAKE ROOM. HASH MUST BE THE SAME - * AS IT WAS WHEN GETTXT CREATED THE 30-BIT WORD. STATE WILL BE ZERO WHEN - * PUTTXT IS CALLED WITH THE FIRST OF A SEQUENCE OF WORDS, BUT IS THEREAFTER - * UNCHANGED BY THE CALLER, SO PUTTXT CAN USE IT TO MAINTAIN STATE ACROSS - * CALLS. LNPOSN AND LNLENG ARE INCREMENTED BY THE NUMBER OF CHARS STORED. - * IF CASE=1, ALL LETTERS ARE MADE UPPERCASE; IF -1, LOWERCASE; IF 0, AS IS. - * ANY OTHER VALUE FOR CASE IS THE SAME AS 0 BUT ALSO CAUSES TRAILING BLANKS - * TO BE INCLUDED (IN ANTICIPATION OF SUBSEQUENT ADDITIONAL TEXT). */ +/* Unpack the 30-bit value in word to obtain up to 5 integer-encoded chars, + * and store them in inline starting at LNPOSN. If LNLENG>=LNPOSN, shift + * existing characters to the right to make room. STATE will be zero when + * puttxt is called with the first of a sequence of words, but is thereafter + * unchanged by the caller, so PUTTXT can use it to maintain state across + * calls. LNPOSN and LNLENG are incremented by the number of chars stored. + * If CASE=1, all letters are made uppercase; if -1, lowercase; if 0, as is. + * any other value for case is the same as 0 but also causes trailing blanks + * to be included (in anticipation of subsequent additional text). */ ALPH1=13*CASE+24; @@ -379,7 +351,6 @@ long ALPH1, ALPH2, BYTE, DIV, I, W; /* ALPH1&2 DEFINE RANGE OF WRONG-CASE CHARS, 11-36 OR 37-62 OR EMPTY. */ DIV=64L*64L*64L*64L; W=WORD; - if(HASH)W=W-MOD(HASH*13579L+5432L,97531L)*12345L-HASH; /* 18 */ for (I=1; I<=5; I++) { if(W <= 0 && STATE == 0 && IABS(CASE) <= 1)return; BYTE=W/DIV; @@ -398,39 +369,32 @@ L18: W=(W-BYTE*DIV)*64; return; } - - #undef STATE -#define PUTTXT(WORD,STATE,CASE,HASH) fPUTTXT(WORD,&STATE,CASE,HASH) -#undef SHFTXT -void fSHFTXT(FROM,DELTA)long DELTA, FROM; { +#define PUTTXT(WORD,STATE,CASE) fPUTTXT(WORD,&STATE,CASE) + +void SHFTXT(long FROM, long DELTA) { long I, II, JJ; -/* MOVE INLINE(N) TO INLINE(N+DELTA) FOR N=FROM,LNLENG. DELTA CAN BE - * NEGATIVE. LNLENG IS UPDATED; LNPOSN IS NOT CHANGED. */ +/* Move INLINE(N) to INLINE(N+DELTA) for N=FROM,LNLENG. Delta can be + * negative. LNLENG is updated; LNPOSN is not changed. */ if(LNLENG < FROM || DELTA == 0) goto L2; - /* 1 */ for (I=FROM; I<=LNLENG; I++) { + for (I=FROM; I<=LNLENG; I++) { II=I; if(DELTA > 0)II=FROM+LNLENG-I; JJ=II+DELTA; -L1: INLINE[JJ]=INLINE[II]; + INLINE[JJ]=INLINE[II]; } /* end loop */ L2: LNLENG=LNLENG+DELTA; return; } - -#define SHFTXT(FROM,DELTA) fSHFTXT(FROM,DELTA) -#undef TYPE0 -void fTYPE0() { +void TYPE0() { long TEMP; - -/* TYPE A BLANK LINE. THIS PROCEDURE IS PROVIDED AS A CONVENIENCE FOR CALLERS - * WHO OTHERWISE HAVE NO USE FOR MAPCOM. */ - +/* Type a blank line. This procedure is provided as a convenience for callers + * who otherwise have no use for MAPCOM. */ TEMP=LNLENG; LNLENG=0; @@ -439,19 +403,12 @@ long TEMP; return; } - - -#define TYPE0() fTYPE0() - - -/* SUSPEND/RESUME I/O ROUTINES (SAVWDS, SAVARR, SAVWRD) */ +/* Suspend/resume I/O routines (SAVWDS, SAVARR, SAVWRD) */ #undef SAVWDS -void fSAVWDS(W1,W2,W3,W4,W5,W6,W7)long *W1, *W2, *W3, *W4, *W5, *W6, *W7; { -; - -/* WRITE OR READ 7 VARIABLES. SEE SAVWRD. */ +void fSAVWDS(long *W1, long *W2, long *W3, long *W4, long *W5, long *W6, long *W7) { +/* Write or read 7 variables. See SAVWRD. */ SAVWRD(0,(*W1)); SAVWRD(0,(*W2)); @@ -466,14 +423,14 @@ void fSAVWDS(W1,W2,W3,W4,W5,W6,W7)long *W1, *W2, *W3, *W4, *W5, *W6, *W7; { #define SAVWDS(W1,W2,W3,W4,W5,W6,W7) fSAVWDS(&W1,&W2,&W3,&W4,&W5,&W6,&W7) #undef SAVARR -void fSAVARR(ARR,N)long ARR[], N; { +void fSAVARR(long ARR[], long N) { long I; -/* WRITE OR READ AN ARRAY OF N WORDS. SEE SAVWRD. */ +/* Write or read an array of N words. See SAVWRD. */ - /* 1 */ for (I=1; I<=N; I++) { -L1: SAVWRD(0,ARR[I]); + for (I=1; I<=N; I++) { + SAVWRD(0,ARR[I]); } /* end loop */ return; } @@ -483,18 +440,17 @@ L1: SAVWRD(0,ARR[I]); #define SAVARR(ARR,N) fSAVARR(ARR,N) #undef SAVWRD #define WORD (*wORD) -void fSAVWRD(OP,wORD)long OP, *wORD; { +void fSAVWRD(long OP, long *wORD) { static long BUF[250], CKSUM = 0, H1, HASH = 0, N = 0, STATE = 0; -/* IF OP<0, START WRITING A FILE, USING WORD TO INITIALISE ENCRYPTION; SAVE - * WORD IN THE FILE. IF OP>0, START READING A FILE; READ THE FILE TO FIND - * THE VALUE WITH WHICH TO DECRYPT THE REST. IN EITHER CASE, IF A FILE IS - * ALREADY OPEN, FINISH WRITING/READING IT AND DON'T START A NEW ONE. IF OP=0, - * READ/WRITE A SINGLE WORD. WORDS ARE BUFFERED IN CASE THAT MAKES FOR MORE - * EFFICIENT DISK USE. WE ALSO COMPUTE A SIMPLE CHECKSUM TO CATCH ELEMENTARY - * POKING WITHIN THE SAVED FILE. WHEN WE FINISH READING/WRITING THE FILE, - * WE STORE ZERO INTO WORD IF THERE'S NO CHECKSUM ERROR, ELSE NONZERO. */ - +/* If OP<0, start writing a file, using word to initialise encryption; save + * word in the file. If OP>0, start reading a file; read the file to find + * the value with which to decrypt the rest. In either case, if a file is + * already open, finish writing/reading it and don't start a new one. If OP=0, + * read/write a single word. Words are buffered in case that makes for more + * efficient disk use. We also compute a simple checksum to catch elementary + * poking within the saved file. When we finish reading/writing the file, + * we store zero into WORD if there's no checksum error, else nonzero. */ if(OP != 0){long ifvar; ifvar=(STATE); switch (ifvar<0? -1 : ifvar>0? 1 : 0) { case -1: goto L30; case 0: goto L10; case 1: goto L30; }} @@ -520,7 +476,7 @@ L10: STATE=OP; L13: CKSUM=BUF[0]; return; -L15: SAVEIO(1,TRUE,BUF); +L15: SAVEIO(1,true,BUF); HASH=MOD(1234L*5678L-BUF[0],1048576L); goto L13; @@ -528,7 +484,7 @@ L30: if(N == 250)SAVEIO(1,STATE > 0,BUF); N=MOD(N,250)+1; if(STATE > 0) goto L32; N--; BUF[N]=CKSUM; N++; - SAVEIO(1,FALSE,BUF); + SAVEIO(1,false,BUF); L32: N--; WORD=BUF[N]-CKSUM; N++; SAVEIO(-1,STATE > 0,BUF); STATE=0; @@ -539,65 +495,51 @@ L32: N--; WORD=BUF[N]-CKSUM; N++; -/* DATA STRUC. ROUTINES (VOCAB, DSTROY, JUGGLE, MOVE, PUT, CARRY, DROP, ATDWRF) +/* Data struc. routines (VOCAB, DSTROY, JUGGLE, MOVE, PUT, CARRY, DROP, ATDWRF) */ #undef WORD #define SAVWRD(OP,WORD) fSAVWRD(OP,&WORD) -#undef VOCAB -long fVOCAB(ID,INIT)long ID, INIT; { -long HASH, I, VOCAB; - -/* LOOK UP ID IN THE VOCABULARY (ATAB) AND RETURN ITS "DEFINITION" (KTAB), OR - * -1 IF NOT FOUND. IF INIT IS POSITIVE, THIS IS AN INITIALISATION CALL SETTING - * UP A KEYWORD VARIABLE, AND NOT FINDING IT CONSTITUTES A BUG. IT ALSO MEANS - * THAT ONLY KTAB VALUES WHICH TAKEN OVER 1000 EQUAL INIT MAY BE CONSIDERED. - * (THUS "STEPS", WHICH IS A MOTION VERB AS WELL AS AN OBJECT, MAY BE LOCATED - * AS AN OBJECT.) AND IT ALSO MEANS THE KTAB VALUE IS TAKEN MOD 1000. */ - - HASH=10000; + +long VOCAB(long ID, long INIT) { +long I, LEXEME; + +/* Look up ID in the vocabulary (ATAB) and return its "definition" (KTAB), or + * -1 if not found. If INIT is positive, this is an initialisation call setting + * up a keyword variable, and not finding it constitutes a bug. It also means + * that only KTAB values which taken over 1000 equal INIT may be considered. + * (Thus "STEPS", which is a motion verb as well as an object, may be located + * as an object.) And it also means the KTAB value is taken modulo 1000. */ + /* 1 */ for (I=1; I<=TABSIZ; I++) { if(KTAB[I] == -1) goto L2; - HASH=HASH+7; if(INIT >= 0 && KTAB[I]/1000 != INIT) goto L1; - if(ATAB[I] == ID+HASH*HASH) goto L3; + if(ATAB[I] == ID) goto L3; L1: /*etc*/ ; } /* end loop */ BUG(21); -L2: VOCAB= -1; - if(INIT < 0)return(VOCAB); +L2: LEXEME= -1; + if(INIT < 0)return(LEXEME); BUG(5); -L3: VOCAB=KTAB[I]; - if(INIT >= 0)VOCAB=MOD(VOCAB,1000); - return(VOCAB); +L3: LEXEME=KTAB[I]; + if(INIT >= 0)LEXEME=MOD(LEXEME,1000); + return(LEXEME); } - - -#define VOCAB(ID,INIT) fVOCAB(ID,INIT) -#undef DSTROY -void fDSTROY(OBJECT)long OBJECT; { -; - -/* PERMANENTLY ELIMINATE "OBJECT" BY MOVING TO A NON-EXISTENT LOCATION. */ - +void DSTROY(long OBJECT) { +/* Permanently eliminate "OBJECT" by moving to a non-existent location. */ MOVE(OBJECT,0); return; } - - -#define DSTROY(OBJECT) fDSTROY(OBJECT) -#undef JUGGLE -void fJUGGLE(OBJECT)long OBJECT; { +void JUGGLE(long OBJECT) { long I, J; -/* JUGGLE AN OBJECT BY PICKING IT UP AND PUTTING IT DOWN AGAIN, THE PURPOSE - * BEING TO GET THE OBJECT TO THE FRONT OF THE CHAIN OF THINGS AT ITS LOC. */ - +/* Juggle an object by picking it up and putting it down again, the purpose + * being to get the object to the front of the chain of things at its loc. */ I=PLACE[OBJECT]; J=FIXED[OBJECT]; @@ -606,16 +548,12 @@ long I, J; return; } - - -#define JUGGLE(OBJECT) fJUGGLE(OBJECT) -#undef MOVE -void fMOVE(OBJECT,WHERE)long OBJECT, WHERE; { +void MOVE(long OBJECT, long WHERE) { long FROM; -/* PLACE ANY OBJECT ANYWHERE BY PICKING IT UP AND DROPPING IT. MAY ALREADY BE - * TOTING, IN WHICH CASE THE CARRY IS A NO-OP. MUSTN'T PICK UP OBJECTS WHICH - * ARE NOT AT ANY LOC, SINCE CARRY WANTS TO REMOVE OBJECTS FROM ATLOC CHAINS. */ +/* Place any object anywhere by picking it up and dropping it. May already be + * toting, in which case the carry is a no-op. Mustn't pick up objects which + * are not at any loc, since carry wants to remove objects from ATLOC chains. */ if(OBJECT > 100) goto L1; @@ -627,33 +565,23 @@ L2: if(FROM > 0 && FROM <= 300)CARRY(OBJECT,FROM); return; } +long PUT(long OBJECT, long WHERE, long PVAL) { +long X; - -#define MOVE(OBJECT,WHERE) fMOVE(OBJECT,WHERE) -#undef PUT -long fPUT(OBJECT,WHERE,PVAL)long OBJECT, PVAL, WHERE; { -long PUT; - -/* PUT IS THE SAME AS MOVE, EXCEPT IT RETURNS A VALUE USED TO SET UP THE - * NEGATED PROP VALUES FOR THE REPOSITORY OBJECTS. */ - +/* PUT is the same as MOVE, except it returns a value used to set up the + * negated PROP values for the repository objects. */ MOVE(OBJECT,WHERE); - PUT=(-1)-PVAL; - return(PUT); + X=(-1)-PVAL; + return(X); } - - -#define PUT(OBJECT,WHERE,PVAL) fPUT(OBJECT,WHERE,PVAL) -#undef CARRY -void fCARRY(OBJECT,WHERE)long OBJECT, WHERE; { +void CARRY(long OBJECT, long WHERE) { long TEMP; -/* START TOTING AN OBJECT, REMOVING IT FROM THE LIST OF THINGS AT ITS FORMER - * LOCATION. INCR HOLDNG UNLESS IT WAS ALREADY BEING TOTED. IF OBJECT>100 - * (MOVING "FIXED" SECOND LOC), DON'T CHANGE PLACE OR HOLDNG. */ - +/* Start toting an object, removing it from the list of things at its former + * location. Incr holdng unless it was already being toted. If OBJECT>100 + * (moving "fixed" second loc), don't change PLACE or HOLDNG. */ if(OBJECT > 100) goto L5; if(PLACE[OBJECT] == -1)return; @@ -670,16 +598,9 @@ L8: LINK[TEMP]=LINK[OBJECT]; return; } - - -#define CARRY(OBJECT,WHERE) fCARRY(OBJECT,WHERE) -#undef DROP -void fDROP(OBJECT,WHERE)long OBJECT, WHERE; { -; - -/* PLACE AN OBJECT AT A GIVEN LOC, PREFIXING IT ONTO THE ATLOC LIST. DECR - * HOLDNG IF THE OBJECT WAS BEING TOTED. */ - +void DROP(long OBJECT, long WHERE) { +/* Place an object at a given loc, prefixing it onto the ATLOC list. Decr + * HOLDNG if the object was being toted. */ if(OBJECT > 100) goto L1; if(PLACE[OBJECT] == -1)HOLDNG=HOLDNG-1; @@ -694,268 +615,214 @@ L2: if(WHERE <= 0)return; -#define DROP(OBJECT,WHERE) fDROP(OBJECT,WHERE) -#undef ATDWRF -long fATDWRF(WHERE)long WHERE; { -long ATDWRF, I; +long ATDWRF(long WHERE) { +long AT, I; -/* RETURN THE INDEX OF FIRST DWARF AT THE GIVEN LOCATION, ZERO IF NO DWARF IS - * THERE (OR IF DWARVES NOT ACTIVE YET), -1 IF ALL DWARVES ARE DEAD. IGNORE - * THE PIRATE (6TH DWARF). */ +/* Return the index of first dwarf at the given location, zero if no dwarf is + * there (or if dwarves not active yet), -1 if all dwarves are dead. Ignore + * the pirate (6th dwarf). */ - ATDWRF=0; - if(DFLAG < 2)return(ATDWRF); - ATDWRF= -1; - /* 1 */ for (I=1; I<=5; I++) { + AT=0; + if(DFLAG < 2)return(AT); + AT= -1; + for (I=1; I<=5; I++) { if(DLOC[I] == WHERE) goto L2; -L1: if(DLOC[I] != 0)ATDWRF=0; - } /* end loop */ - return(ATDWRF); - -L2: ATDWRF=I; - return(ATDWRF); -} - - - - -#define ATDWRF(WHERE) fATDWRF(WHERE) - - - -/* UTILITY ROUTINES (SETBIT, TSTBIT, RAN, RNDVOC, BUG) */ - -#undef SETBIT -long fSETBIT(BIT)long BIT; { -long I, SETBIT; - -/* RETURNS 2**BIT FOR USE IN CONSTRUCTING BIT-MASKS. */ - - - SETBIT=1; - if(BIT <= 0)return(SETBIT); - /* 1 */ for (I=1; I<=BIT; I++) { -L1: SETBIT=SETBIT+SETBIT; - } /* end loop */ - return(SETBIT); -} - - - -#define SETBIT(BIT) fSETBIT(BIT) -#undef TSTBIT -long fTSTBIT(MASK,BIT)long BIT, MASK; { -long TSTBIT; - -/* RETURNS TRUE IF THE SPECIFIED BIT IS SET IN THE MASK. */ - - - TSTBIT=MOD(MASK/SETBIT(BIT),2) != 0; - return(TSTBIT); -} - - - -#define TSTBIT(MASK,BIT) fTSTBIT(MASK,BIT) -#undef RAN -long fRAN(RANGE)long RANGE; { -static long D, R = 0, RAN, T; - -/* SINCE THE RAN FUNCTION IN LIB40 SEEMS TO BE A REAL LOSE, WE'LL USE ONE OF - * OUR OWN. IT'S BEEN RUN THROUGH MANY OF THE TESTS IN KNUTH VOL. 2 AND - * SEEMS TO BE QUITE RELIABLE. RAN RETURNS A VALUE UNIFORMLY SELECTED - * BETWEEN 0 AND RANGE-1. */ - - - D=1; - if(R != 0 && RANGE >= 0) goto L1; - DATIME(D,T); - R=MOD(T+5,1048576L); - D=1000+MOD(D,1000); -L1: /* 2 */ for (T=1; T<=D; T++) { -L2: R=MOD(R*1093L+221587L,1048576L); - } /* end loop */ - RAN=(RANGE*R)/1048576; - return(RAN); -} - - - -#define RAN(RANGE) fRAN(RANGE) -#undef RNDVOC -long fRNDVOC(CHAR,FORCE)long CHAR, FORCE; { -long DIV, I, J, RNDVOC; - -/* SEARCHES THE VOCABULARY FOR A WORD WHOSE SECOND CHARACTER IS CHAR, AND - * CHANGES THAT WORD SUCH THAT EACH OF THE OTHER FOUR CHARACTERS IS A - * RANDOM LETTER. IF FORCE IS NON-ZERO, IT IS USED AS THE NEW WORD. - * RETURNS THE NEW WORD. */ - - - RNDVOC=FORCE; - if(RNDVOC != 0) goto L3; - /* 1 */ for (I=1; I<=5; I++) { - J=11+RAN(26); - if(I == 2)J=CHAR; -L1: RNDVOC=RNDVOC*64+J; - } /* end loop */ -L3: J=10000; - DIV=64L*64L*64L; - /* 5 */ for (I=1; I<=TABSIZ; I++) { - J=J+7; - if(MOD((ATAB[I]-J*J)/DIV,64L) == CHAR) goto L8; -L5: /*etc*/ ; + if(DLOC[I] != 0)AT=0; } /* end loop */ - BUG(5); - -L8: ATAB[I]=RNDVOC+J*J; - return(RNDVOC); -} - - - -#define RNDVOC(CHAR,FORCE) fRNDVOC(CHAR,FORCE) -#undef BUG -void fBUG(NUM)long NUM; { - -/* THE FOLLOWING CONDITIONS ARE CURRENTLY CONSIDERED FATAL BUGS. NUMBERS < 20 - * ARE DETECTED WHILE READING THE DATABASE; THE OTHERS OCCUR AT "RUN TIME". - * 0 MESSAGE LINE > 70 CHARACTERS - * 1 NULL LINE IN MESSAGE - * 2 TOO MANY WORDS OF MESSAGES - * 3 TOO MANY TRAVEL OPTIONS - * 4 TOO MANY VOCABULARY WORDS - * 5 REQUIRED VOCABULARY WORD NOT FOUND - * 6 TOO MANY RTEXT MESSAGES - * 7 TOO MANY HINTS - * 8 LOCATION HAS COND BIT BEING SET TWICE - * 9 INVALID SECTION NUMBER IN DATABASE - * 10 TOO MANY LOCATIONS - * 11 TOO MANY CLASS OR TURN MESSAGES - * 20 SPECIAL TRAVEL (500>L>300) EXCEEDS GOTO LIST - * 21 RAN OFF END OF VOCABULARY TABLE - * 22 VOCABULARY TYPE (N/1000) NOT BETWEEN 0 AND 3 - * 23 INTRANSITIVE ACTION VERB EXCEEDS GOTO LIST - * 24 TRANSITIVE ACTION VERB EXCEEDS GOTO LIST - * 25 CONDITIONAL TRAVEL ENTRY WITH NO ALTERNATIVE - * 26 LOCATION HAS NO TRAVEL ENTRIES - * 27 HINT NUMBER EXCEEDS GOTO LIST - * 28 INVALID MONTH RETURNED BY DATE FUNCTION - * 29 TOO MANY PARAMETERS GIVEN TO SETPRM */ + return(AT); + +L2: AT=I; + return(AT); +} + +/* Utility routines (SETBIT, TSTBIT, set_seed, get_next_lcg_value, + * randrange, RNDVOC, BUG) */ + +long SETBIT(long bit) { +/* Returns 2**bit for use in constructing bit-masks. */ + 2 << bit; +} + +bool TSTBIT(long mask, int bit) { +/* Returns true if the specified bit is set in the mask. */ + return((mask & (1 << bit)) != 0); +} + +void set_seed(long seedval) +{ + lcgstate.x = (unsigned long) seedval % lcgstate.m; +} + +unsigned long get_next_lcg_value(void) +{ + /* Return the LCG's current value, and then iterate it. */ + unsigned long old_x = lcgstate.x; + lcgstate.x = (lcgstate.a * lcgstate.x + lcgstate.c) % lcgstate.m; + return(old_x); +} + +long randrange(long range) +{ + /* Return a random integer from [0, range). */ + long result = range * get_next_lcg_value() / lcgstate.m; + return(result); +} + +long RNDVOC(long CHAR, long FORCE) { +/* Searches the vocabulary for a word whose second character is char, and + * changes that word such that each of the other four characters is a + * random letter. If force is non-zero, it is used as the new word. + * Returns the new word. */ + + long RND; + + RND=FORCE; + + if (RND == 0) { + for (int I = 1; I <= 5; I++) { + long J = 11 + randrange(26); + if (I == 2) + J = CHAR; + RND = RND * 64 + J; + } + } + + long DIV = 64L * 64L * 64L; + for (int I = 1; I <= TABSIZ; I++) { + if (MOD(ATAB[I]/DIV, 64L) == CHAR) + { + ATAB[I] = RND; + break; + } + } + + return(RND); +} + +void BUG(long NUM) { + +/* The following conditions are currently considered fatal bugs. Numbers < 20 + * are detected while reading the database; the others occur at "run time". + * 0 Message line > 70 characters + * 1 Null line in message + * 2 Too many words of messages + * 3 Too many travel options + * 4 Too many vocabulary words + * 5 Required vocabulary word not found + * 6 Too many RTEXT messages + * 7 Too many hints + * 8 Location has cond bit being set twice + * 9 Invalid section number in database + * 10 Too many locations + * 11 Too many class or turn messages + * 20 Special travel (500>L>300) exceeds goto list + * 21 Ran off end of vocabulary table + * 22 Vocabulary type (N/1000) not between 0 and 3 + * 23 Intransitive action verb exceeds goto list + * 24 Transitive action verb exceeds goto list + * 25 Conditional travel entry with no alternative + * 26 Location has no travel entries + * 27 Hint number exceeds goto list + * 28 Invalid month returned by date function + * 29 Too many parameters given to SETPRM */ printf("Fatal error %ld. See source code for interpretation.\n", NUM); - exit(FALSE); + exit(0); } -/* MACHINE DEPENDENT ROUTINES (MAPLIN, TYPE, MPINIT, SAVEIO) */ +/* Machine dependent routines (MAPLIN, TYPE, MPINIT, SAVEIO) */ -#define BUG(NUM) fBUG(NUM) -#undef MAPLIN -void fMAPLIN(FIL)long FIL; { -long I, VAL; static FILE *OPENED = NULL; +void MAPLIN(FILE *OPENED) { +long I, VAL; -/* READ A LINE OF INPUT, EITHER FROM A FILE (IF FIL=.TRUE.) OR FROM THE - * KEYBOARD, TRANSLATE THE CHARS TO INTEGERS IN THE RANGE 0-126 AND STORE - * THEM IN THE COMMON ARRAY "INLINE". INTEGER VALUES ARE AS FOLLOWS: - * 0 = SPACE [ASCII CODE 40 OCTAL, 32 DECIMAL] - * 1-2 = !" [ASCII 41-42 OCTAL, 33-34 DECIMAL] - * 3-10 = '()*+,-. [ASCII 47-56 OCTAL, 39-46 DECIMAL] - * 11-36 = UPPER-CASE LETTERS - * 37-62 = LOWER-CASE LETTERS - * 63 = PERCENT (%) [ASCII 45 OCTAL, 37 DECIMAL] - * 64-73 = DIGITS, 0 THROUGH 9 - * REMAINING CHARACTERS CAN BE TRANSLATED ANY WAY THAT IS CONVENIENT; - * THE "TYPE" ROUTINE BELOW IS USED TO MAP THEM BACK TO CHARACTERS WHEN - * NECESSARY. THE ABOVE MAPPINGS ARE REQUIRED SO THAT CERTAIN SPECIAL - * CHARACTERS ARE KNOWN TO FIT IN 6 BITS AND/OR CAN BE EASILY SPOTTED. - * ARRAY ELEMENTS BEYOND THE END OF THE LINE SHOULD BE FILLED WITH 0, - * AND LNLENG SHOULD BE SET TO THE INDEX OF THE LAST CHARACTER. - * - * IF THE DATA FILE USES A CHARACTER OTHER THAN SPACE (E.G., TAB) TO - * SEPARATE NUMBERS, THAT CHARACTER SHOULD ALSO TRANSLATE TO 0. +/* Read a line of input, from the specified input source, + * translate the chars to integers in the range 0-126 and store + * them in the common array "INLINE". Integer values are as follows: + * 0 = space [ASCII CODE 40 octal, 32 decimal] + * 1-2 = !" [ASCII 41-42 octal, 33-34 decimal] + * 3-10 = '()*+,-. [ASCII 47-56 octal, 39-46 decimal] + * 11-36 = upper-case letters + * 37-62 = lower-case letters + * 63 = percent (%) [ASCII 45 octal, 37 decimal] + * 64-73 = digits, 0 through 9 + * Remaining characters can be translated any way that is convenient; + * The "TYPE" routine below is used to map them back to characters when + * necessary. The above mappings are required so that certain special + * characters are known to fit in 6 bits and/or can be easily spotted. + * Array elements beyond the end of the line should be filled with 0, + * and LNLENG should be set to the index of the last character. * - * THIS PROCEDURE MAY USE THE MAP1,MAP2 ARRAYS TO MAINTAIN STATIC DATA FOR - * THE MAPPING. MAP2(1) IS SET TO 0 WHEN THE PROGRAM STARTS - * AND IS NOT CHANGED THEREAFTER UNLESS THE ROUTINES ON THIS PAGE CHOOSE - * TO DO SO. + * If the data file uses a character other than space (e.g., tab) to + * separate numbers, that character should also translate to 0. * - * NOTE THAT MAPLIN IS EXPECTED TO OPEN THE FILE THE FIRST TIME IT IS - * ASKED TO READ A LINE FROM IT. THAT IS, THERE IS NO OTHER PLACE WHERE - * THE DATA FILE IS OPENED. */ - + * This procedure may use the map1,map2 arrays to maintain static data for + * the mapping. MAP2(1) is set to 0 when the program starts + * and is not changed thereafter unless the routines on this page choose + * to do so. */ if(MAP2[1] == 0)MPINIT(); - if(FIL) goto L15; - IGNORE(fgets(INLINE+1, sizeof(INLINE)-1, stdin)); - if(feof(stdin)) score(1); - goto L20; - -L15: if(!OPENED){ - OPENED=fopen("adventure.text","r" /* NOT binary */); - if(!OPENED){printf("Can't read adventure.text!\n"); exit(FALSE);} - } - IGNORE(fgets(INLINE+1,100,OPENED)); - -L20: LNLENG=0; - /* 25 */ for (I=1; I<=100 && INLINE[I]!=0; I++) { - VAL=INLINE[I]+1; - INLINE[I]=MAP1[VAL]; -L25: if(INLINE[I] != 0)LNLENG=I; - } /* end loop */ - LNPOSN=1; - if(FIL && LNLENG == 0) goto L15; -/* ABOVE IS TO GET AROUND AN F40 COMPILER BUG WHEREIN IT READS A BLANK - * LINE WHENEVER A CRLF IS BROKEN ACROSS A RECORD BOUNDARY. */ - return; -} - - - -#define MAPLIN(FIL) fMAPLIN(FIL) -#undef TYPE -void fTYPE() { + if (!oldstyle && SETUP && OPENED == stdin) + fputs("> ", stdout); + do { + IGNORE(fgets(rawbuf,sizeof(rawbuf)-1,OPENED)); + } while + (!feof(OPENED) && rawbuf[0] == '#'); + if (feof(OPENED)) { + if (logfp && OPENED == stdin) + fclose(logfp); + } else { + if (logfp && OPENED == stdin) + IGNORE(fputs(rawbuf, logfp)); + else if (!isatty(0)) + IGNORE(fputs(rawbuf, stdout)); + strcpy(INLINE+1, rawbuf); + LNLENG=0; + for (I=1; I<=(long)sizeof(INLINE) && INLINE[I]!=0; I++) { + VAL=INLINE[I]+1; + INLINE[I]=MAP1[VAL]; + if(INLINE[I] != 0)LNLENG=I; + } /* end loop */ + LNPOSN=1; + } +} + +void TYPE(void) { long I, VAL; -/* TYPE THE FIRST "LNLENG" CHARACTERS STORED IN INLINE, MAPPING THEM - * FROM INTEGERS TO TEXT PER THE RULES DESCRIBED ABOVE. INLINE(I), - * I=1,LNLENG MAY BE CHANGED BY THIS ROUTINE. */ - +/* Type the first "LNLENG" characters stored in inline, mapping them + * from integers to text per the rules described above. INLINE(I), + * I=1,LNLENG may be changed by this routine. */ if(LNLENG != 0) goto L10; printf("\n"); return; L10: if(MAP2[1] == 0)MPINIT(); - /* 20 */ for (I=1; I<=LNLENG; I++) { + for (I=1; I<=LNLENG; I++) { VAL=INLINE[I]; -L20: {long x = VAL+1; INLINE[I]=MAP2[x];} + {long x = VAL+1; INLINE[I]=MAP2[x];} } /* end loop */ {long x = LNLENG+1; INLINE[x]=0;} printf("%s\n",INLINE+1); return; } - - -#define TYPE() fTYPE() -#undef MPINIT -void fMPINIT() { +void MPINIT(void) { long FIRST, I, J, LAST, VAL; -static long RUNS[7][2] = {32,34, 39,46, 65,90, 97,122, 37,37, 48,57, 0,126}; - +static long RUNS[7][2] = { {32,34}, {39,46}, {65,90}, {97,122}, {37,37}, {48,57}, {0,126} }; - /* 10 */ for (I=1; I<=128; I++) { -L10: MAP1[I]= -1; + for (I=1; I<=128; I++) { + MAP1[I]= -1; } /* end loop */ VAL=0; - /* 20 */ for (I=0; I<7; I++) { + for (I=0; I<7; I++) { FIRST=RUNS[I][0]; LAST=RUNS[I][1]; /* 22 */ for (J=FIRST; J<=LAST; J++) { @@ -964,36 +831,33 @@ L10: MAP1[I]= -1; VAL=VAL+1; L22: J--; } /* end loop */ -L20: /*etc*/ ; + /*etc*/ ; } /* end loop */ MAP1[128]=MAP1[10]; -/* FOR THIS VERSION, TAB (9) MAPS TO SPACE (32), SO DEL (127) USES TAB'S VALUE */ +/* For this version, tab (9) maps to space (32), so del (127) uses tab's value */ MAP1[10]=MAP1[33]; MAP1[11]=MAP1[33]; - /* 30 */ for (I=0; I<=126; I++) { + for (I=0; I<=126; I++) { I++; VAL=MAP1[I]+1; I--; MAP2[VAL]=I*('B'-'A'); -L30: if(I >= 64)MAP2[VAL]=(I-64)*('B'-'A')+'@'; + if(I >= 64)MAP2[VAL]=(I-64)*('B'-'A')+'@'; } /* end loop */ return; } - - -#define MPINIT() fMPINIT() #undef SAVEIO -void fSAVEIO(OP,IN,ARR)long ARR[], IN, OP; { +void fSAVEIO(long OP, long IN, long ARR[]) { static FILE *F; char NAME[50]; -/* IF OP=0, ASK FOR A FILE NAME AND OPEN A FILE. (IF IN=.TRUE., THE FILE IS FOR - * INPUT, ELSE OUTPUT.) IF OP>0, READ/WRITE ARR FROM/INTO THE PREVIOUSLY-OPENED - * FILE. (ARR IS A 250-INTEGER ARRAY.) IF OP<0, FINISH READING/WRITING THE - * FILE. (FINISHING WRITING CAN BE A NO-OP IF A "STOP" STATEMENT DOES IT - * AUTOMATICALLY. FINISHING READING CAN BE A NO-OP AS LONG AS A SUBSEQUENT - * SAVEIO(0,.FALSE.,X) WILL STILL WORK.) IF YOU CAN CATCH ERRORS (E.G., NO SUCH - * FILE) AND TRY AGAIN, GREAT. DEC F40 CAN'T. */ +/* If OP=0, ask for a file name and open a file. (If IN=true, the file is for + * input, else output.) If OP>0, read/write ARR from/into the previously-opened + * file. (ARR is a 250-integer array.) If OP<0, finish reading/writing the + * file. (Finishing writing can be a no-op if a "stop" statement does it + * automatically. Finishing reading can be a no-op as long as a subsequent + * SAVEIO(0,false,X) will still work.) If you can catch errors (e.g., no such + * file) and try again, great. DEC F40 can't. */ {long ifvar; ifvar=(OP); switch (ifvar<0? -1 : ifvar>0? 1 : 0) { case -1: @@ -1008,13 +872,18 @@ L20: printf("\nFile name: "); if(F == NULL) {printf("Can't open file, try again.\n"); goto L20;} return; -L30: if(IN)IGNORE(fread(ARR,4,250,F)); - if(!IN)fwrite(ARR,4,250,F); +L30: if(IN)IGNORE(fread(ARR,sizeof(long),250,F)); + if(!IN)fwrite(ARR,sizeof(long),250,F); return; } +void DATIME(long* D, long* T) { + struct timeval tv; + gettimeofday(&tv, NULL); + *D = (long) tv.tv_sec; + *T = (long) tv.tv_usec; +} - -long fIABS(N)long N; {return(N<0? -N : N);} -long fMOD(N,M)long N, M; {return(N%M);} +long IABS(N)long N; {return(N<0? -N : N);} +long MOD(N,M)long N, M; {return(N%M);}