X-Git-Url: https://jxself.org/git/?a=blobdiff_plain;f=misc.c;h=2560926fda6306e22bef7fca4d1e81792ce2070a;hb=beac8d7f41a6163ea15f0ab981cd786779244d9a;hp=ae39eb3be606f400b1a7c0f91392b9ce403e8ffd;hpb=ef24a63ced6ae760971783e6723c5f19d3c66a6e;p=open-adventure.git diff --git a/misc.c b/misc.c index ae39eb3..2560926 100644 --- a/misc.c +++ b/misc.c @@ -1,33 +1,34 @@ +#include #include #include -#include "main.h" -#include "misc.h" +#include +#include +#include "advent.h" #include "funcs.h" +#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) */ -#undef SPEAK -void fSPEAK(long N) { +void SPEAK(vocab_t 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. */ - + * unless game.blklin is false. */ if(N == 0)return; - BLANK=BLKLIN; + BLANK=game.blklin; K=N; NPARMS=1; -L10: L=IABS(LINES[K])-1; +L10: L=labs(LINES[K])-1; K=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; @@ -51,7 +52,7 @@ L32: if(LNPOSN > LNLENG) goto L40; if(PRMTYP < 1 || PRMTYP > 9) goto L30; SHFTXT(LNPOSN+2,PRMTYP-2); LNPOSN=LNPOSN+PRMTYP; - PARM=IABS(PARMS[NPARMS]); + PARM=labs(PARMS[NPARMS]); NEG=0; if(PARMS[NPARMS] < 0)NEG=9; /* 390 */ for (I=1; I<=PRMTYP; I++) { @@ -76,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; @@ -95,8 +96,8 @@ 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; @@ -110,89 +111,72 @@ L40: if(BLANK)TYPE0(); return; } - - -#define SPEAK(N) fSPEAK(N) -#undef PSPEAK -void fPSPEAK(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). */ - +void PSPEAK(vocab_t MSG,int SKIP) +/* 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 game.prop=N message). */ +{ + long I, M; M=PTEXT[MSG]; - if(SKIP < 0) goto L9; - /* 3 */ for (I=0; I<=SKIP; I++) { -L1: M=IABS(LINES[M]); - if(LINES[M] >= 0) goto L1; -L3: /*etc*/ ; - } /* end loop */ + if(SKIP < 0) + goto L9; + for (I=0; I<=SKIP; I++) { +L1: M=labs(LINES[M]); + if(LINES[M] >= 0) + goto L1; + } L9: SPEAK(M); return; } - - - -#define PSPEAK(MSG,SKIP) fPSPEAK(MSG,SKIP) -#undef RSPEAK -void fRSPEAK(long I) { -; - -/* Print the I-TH "random" message (section 6 of database). */ - - - if(I != 0)SPEAK(RTEXT[I]); - return; +void RSPEAK(vocab_t i) +/* Print the i-th "random" message (section 6 of database). */ +{ + if (i != 0) + SPEAK(RTEXT[i]); } - - -#define RSPEAK(I) fRSPEAK(I) -#undef SETPRM -void fSETPRM(long FIRST, long P1, long 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). */ - - - if(FIRST >= 25)BUG(29); - PARMS[FIRST]=P1; - {long x = FIRST+1; PARMS[x]=P2;} - return; + * are stored into PARMS(first) and PARMS(first+1). */ +{ + if(first >= MAXPARMS) + BUG(29); + else { + PARMS[first] = p1; + PARMS[first+1] = 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(long *wORD1, long *wORD1X, long *wORD2, long *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 +/* 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); - if(BLKLIN && WORD1 < 0) goto L10; - WORD1X=GETTXT(false,true,true,0); -L12: JUNK=GETTXT(false,true,true,0); +L10: if(game.blklin)TYPE0(); + MAPLIN(input); + if (feof(input)) + return false; + WORD1=GETTXT(true,true,true); + if(game.blklin && WORD1 < 0) goto L10; + 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; } @@ -203,182 +187,133 @@ 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(long X, long Y, long Z) { +#define GETIN(SRC,WORD1,WORD1X,WORD2,WORD2X) fGETIN(SRC,&WORD1,&WORD1X,&WORD2,&WORD2X) -long YES, REPLY, JUNK1, JUNK2, JUNK3; +long YES(FILE *input, vocab_t X, vocab_t Y, vocab_t Z) { +token_t 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. */ 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 (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. */ -#define YES(X,Y,Z) fYES(X,Y,Z) -#undef GETNUM -long fGETNUM(long K) { -long DIGIT, GETNUM, 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. */ - - - if(K != 0)MAPLIN(K > 0); - GETNUM=0; -L10: if(LNPOSN > LNLENG)return(GETNUM); - if(INLINE[LNPOSN] != 0) goto L20; - LNPOSN=LNPOSN+1; - goto L10; - -L20: SIGN=1; - if(INLINE[LNPOSN] != 9) goto L32; - SIGN= -1; -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; - goto L30; - -L40: GETNUM=0; -L42: GETNUM=GETNUM*SIGN; - LNPOSN=LNPOSN+1; - return(GETNUM); -} - - - -#define GETNUM(K) fGETNUM(K) -#undef GETTXT -long fGETTXT(long SKIP,long ONEWRD, long UPPER, long HASH) { -long CHAR, GETTXT, I; static long SPLITTING = -1; - +long GETTXT(bool SKIP,bool ONEWRD, bool 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. 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 + * 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 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; - 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(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; + * 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<=TOKLEN; 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); +} + +token_t MAKEWD(long LETTRS) { +long I, L, WORD; + +/* Combine TOKLEN (currently 5) 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); - I=I*64; - if(MOD(L,100) > 50)MAKEWD=MAKEWD+I*5; - L=L/100; - if(L != 0) goto L10; + for (L=LETTRS; L != 0; L=L/100) { + WORD=WORD+I*(MOD(L,50)+10); + I=I*64; + if(MOD(L,100) > 50)WORD=WORD+I*5; + } 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(long WORD, long *sTATE, long CASE, long HASH) { +void fPUTTXT(token_t 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 TOKLEN (currently + * 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; - ALPH2=26*IABS(CASE)+ALPH1; - if(IABS(CASE) > 1)ALPH1=ALPH2; + ALPH2=26*labs(CASE)+ALPH1; + if(labs(CASE) > 1)ALPH1=ALPH2; /* 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; + /* 18 */ for (I=1; I<=TOKLEN; I++) { + if(W <= 0 && STATE == 0 && labs(CASE) <= 1)return; BYTE=W/DIV; if(STATE != 0 || BYTE != 63) goto L12; STATE=63; @@ -395,12 +330,10 @@ L18: W=(W-BYTE*DIV)*64; return; } - - #undef STATE -#define PUTTXT(WORD,STATE,CASE,HASH) fPUTTXT(WORD,&STATE,CASE,HASH) -#undef SHFTXT -void fSHFTXT(long FROM, long DELTA) { +#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 @@ -408,75 +341,61 @@ long I, II, JJ; 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() { -long TEMP; - +void TYPE0(void) /* Type a blank line. This procedure is provided as a convenience for callers * who otherwise have no use for MAPCOM. */ +{ + long temp; - - TEMP=LNLENG; - LNLENG=0; - TYPE(); - LNLENG=TEMP; - return; + temp=LNLENG; + LNLENG=0; + TYPE(); + LNLENG=temp; + return; } - - -#define TYPE0() fTYPE0() - - /* Suspend/resume I/O routines (SAVWDS, SAVARR, SAVWRD) */ #undef SAVWDS -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)); - SAVWRD(0,(*W3)); - SAVWRD(0,(*W4)); - SAVWRD(0,(*W5)); - SAVWRD(0,(*W6)); - SAVWRD(0,(*W7)); - return; +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)); + SAVWRD(0,(*W3)); + SAVWRD(0,(*W4)); + SAVWRD(0,(*W5)); + SAVWRD(0,(*W6)); + SAVWRD(0,(*W7)); + return; } - - #define SAVWDS(W1,W2,W3,W4,W5,W6,W7) fSAVWDS(&W1,&W2,&W3,&W4,&W5,&W6,&W7) -#undef SAVARR -void fSAVARR(long ARR[], long N) { -long I; - -/* Write or read an array of N words. See SAVWRD. */ +#undef SAVARR +void fSAVARR(long arr[], long n) +/* Write or read an array of n words. See SAVWRD. */ +{ + long i; - /* 1 */ for (I=1; I<=N; I++) { -L1: SAVWRD(0,ARR[I]); - } /* end loop */ - return; + for (i=1; i<=n; i++) { + SAVWRD(0,arr[i]); + } + return; } - - - #define SAVARR(ARR,N) fSAVARR(ARR,N) + #undef SAVWRD #define WORD (*wORD) void fSAVWRD(long OP, long *wORD) { @@ -491,7 +410,6 @@ static long BUF[250], CKSUM = 0, H1, HASH = 0, N = 0, STATE = 0; * 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; }} if(STATE == 0)return; @@ -540,9 +458,9 @@ L32: N--; WORD=BUF[N]-CKSUM; N++; #undef WORD #define SAVWRD(OP,WORD) fSAVWRD(OP,&WORD) -#undef VOCAB -long fVOCAB(long ID, long INIT) { -long HASH, I, VOCAB; + +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 @@ -551,270 +469,189 @@ long HASH, I, VOCAB; * (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. */ - HASH=10000; /* 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(long OBJECT) { -; - -/* Permanently eliminate "OBJECT" by moving to a non-existent location. */ - - - MOVE(OBJECT,0); - return; +void DSTROY(long object) +/* Permanently eliminate "object" by moving to a non-existent location. */ +{ + MOVE(object,0); } - - -#define DSTROY(OBJECT) fDSTROY(OBJECT) -#undef JUGGLE -void fJUGGLE(long OBJECT) { -long I, J; - +void JUGGLE(long object) /* 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. */ +{ + long i, j; - - I=PLACE[OBJECT]; - J=FIXED[OBJECT]; - MOVE(OBJECT,I); - MOVE(OBJECT+100,J); - return; + i=game.place[object]; + j=game.fixed[object]; + MOVE(object,i); + MOVE(object+NOBJECTS,j); } +void MOVE(long object, long where) +/* 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 game.atloc chains. */ +{ + long from; - -#define JUGGLE(OBJECT) fJUGGLE(OBJECT) -#undef MOVE -void fMOVE(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. */ - - - if(OBJECT > 100) goto L1; - FROM=PLACE[OBJECT]; - goto L2; -L1: {long x = OBJECT-100; FROM=FIXED[x];} -L2: if(FROM > 0 && FROM <= 300)CARRY(OBJECT,FROM); - DROP(OBJECT,WHERE); - return; + if(object > NOBJECTS) goto L1; + from=game.place[object]; + goto L2; +L1: from=game.fixed[object-NOBJECTS]; +L2: if(from > 0 && from <= 300) + CARRY(object,from); + DROP(object,where); } - - -#define MOVE(OBJECT,WHERE) fMOVE(OBJECT,WHERE) -#undef PUT -long fPUT(long OBJECT, long WHERE, long PVAL) { -long PUT; - +long PUT(long object, long where, long pval) /* 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); + * negated game.prop values for the repository objects. */ +{ + MOVE(object,where); + return (-1)-pval;; } - - -#define PUT(OBJECT,WHERE,PVAL) fPUT(OBJECT,WHERE,PVAL) -#undef CARRY -void fCARRY(long OBJECT, long 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. */ - - - if(OBJECT > 100) goto L5; - if(PLACE[OBJECT] == -1)return; - PLACE[OBJECT]= -1; - HOLDNG=HOLDNG+1; -L5: if(ATLOC[WHERE] != OBJECT) goto L6; - ATLOC[WHERE]=LINK[OBJECT]; + * location. Incr holdng unless it was already being toted. If object>NOBJECTS + * (moving "fixed" second loc), don't change game.place or game.holdng. */ + + if(object > NOBJECTS) goto L5; + if(game.place[object] == -1)return; + game.place[object]= -1; + game.holdng=game.holdng+1; +L5: if(game.atloc[where] != object) goto L6; + game.atloc[where]=game.link[object]; return; -L6: TEMP=ATLOC[WHERE]; -L7: if(LINK[TEMP] == OBJECT) goto L8; - TEMP=LINK[TEMP]; +L6: TEMP=game.atloc[where]; +L7: if(game.link[TEMP] == object) goto L8; + TEMP=game.link[TEMP]; goto L7; -L8: LINK[TEMP]=LINK[OBJECT]; +L8: game.link[TEMP]=game.link[object]; return; } - - -#define CARRY(OBJECT,WHERE) fCARRY(OBJECT,WHERE) -#undef DROP -void fDROP(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; - PLACE[OBJECT]=WHERE; - goto L2; -L1: {long x = OBJECT-100; FIXED[x]=WHERE;} -L2: if(WHERE <= 0)return; - LINK[OBJECT]=ATLOC[WHERE]; - ATLOC[WHERE]=OBJECT; +void DROP(long object, long where) +/* Place an object at a given loc, prefixing it onto the game.atloc list. Decr + * game.holdng if the object was being toted. */ +{ + if(object > NOBJECTS) goto L1; + if(game.place[object] == -1) + game.holdng=game.holdng-1; + game.place[object]=where; + goto L2; +L1: game.fixed[object-NOBJECTS]=where; +L2: if(where <= 0) return; + game.link[object]=game.atloc[where]; + game.atloc[where]=object; } - - -#define DROP(OBJECT,WHERE) fDROP(OBJECT,WHERE) -#undef ATDWRF -long fATDWRF(long WHERE) { -long ATDWRF, I; - +long ATDWRF(long where) /* 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++) { - 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(long BIT) { -long I, SETBIT; - +{ + long at, i; + + at=0; + if(game.dflag < 2) + return(at); + at= -1; + for (i=1; i<=NDWARVES-1; i++) { + if(game.dloc[i] == where) + return i; + if(game.dloc[i] != 0) + at=0; + } /* end loop */ + 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. */ - - - SETBIT=1; - if(BIT <= 0)return(SETBIT); - /* 1 */ for (I=1; I<=BIT; I++) { -L1: SETBIT=SETBIT+SETBIT; - } /* end loop */ - return(SETBIT); +{ + return(2 << bit); } - - -#define SETBIT(BIT) fSETBIT(BIT) -#undef TSTBIT -long fTSTBIT(long MASK, long BIT) { -long TSTBIT; - +bool TSTBIT(long mask, int bit) /* Returns true if the specified bit is set in the mask. */ - - - TSTBIT=MOD(MASK/SETBIT(BIT),2) != 0; - return(TSTBIT); +{ + return (mask & (1 << bit)) != 0; } - - -#define TSTBIT(MASK,BIT) fTSTBIT(MASK,BIT) -#undef RAN -long fRAN(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); +void set_seed(long seedval) +/* Set the LCG seed */ +{ + 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). */ +{ + return range * get_next_lcg_value() / lcgstate.m; +} -#define RAN(RANGE) fRAN(RANGE) -#undef RNDVOC -long fRNDVOC(long CHAR, long 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. */ +long RNDVOC(long second, long force) +/* Searches the vocabulary ATAB 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 = force; + if (rnd == 0) { + for (int i = 1; i <= 5; i++) { + long j = 11 + randrange(26); + if (i == 2) + j = second; + rnd = rnd * 64 + j; + } + } - 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*/ ; - } /* end loop */ - BUG(5); + long div = 64L * 64L * 64L; + for (int i = 1; i <= TABSIZ; i++) { + if (MOD(ATAB[i]/div, 64L) == second) + { + ATAB[i] = rnd; + break; + } + } -L8: ATAB[I]=RNDVOC+J*J; - return(RNDVOC); + return rnd; } - - -#define RNDVOC(CHAR,FORCE) fRNDVOC(CHAR,FORCE) -#undef BUG -void fBUG(long NUM) { - +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 @@ -839,119 +676,101 @@ void fBUG(long NUM) { * 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(0); + printf("Fatal error %ld. See source code for interpretation.\n", num); + exit(0); } - - - - /* Machine dependent routines (MAPLIN, TYPE, MPINIT, SAVEIO) */ -#define BUG(NUM) fBUG(NUM) -#undef MAPLIN -void fMAPLIN(long FIL) { -long I, VAL; static FILE *OPENED = NULL; - -/* 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. - * - * 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. - * - * 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. */ - - - 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(0);} - } - 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; +void MAPLIN(FILE *OPENED) +{ + long I, VAL; + + /* 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. + * + * If the data file uses a character other than space (e.g., tab) to + * separate numbers, that character should also translate to 0. + * + * 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 (!oldstyle && 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; - 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(void) { -long I, VAL; - +void TYPE(void) /* 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. */ + * from integers to text per the rules described above. INLINE + * may be changed by this routine. */ +{ + long i; - - if(LNLENG != 0) goto L10; + if(LNLENG == 0) { printf("\n"); return; + } -L10: if(MAP2[1] == 0)MPINIT(); - /* 20 */ for (I=1; I<=LNLENG; I++) { - VAL=INLINE[I]; -L20: {long x = VAL+1; INLINE[I]=MAP2[x];} - } /* end loop */ - {long x = LNLENG+1; INLINE[x]=0;} - printf("%s\n",INLINE+1); - return; + if(MAP2[1] == 0) + MPINIT(); + for (i=1; i<=LNLENG; i++) { + INLINE[i]=MAP2[INLINE[i]+1]; + } + INLINE[LNLENG+1]=0; + printf("%s\n", INLINE+1); + return; } - - -#define TYPE() fTYPE() -#undef MPINIT -void fMPINIT(void) { +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++) { @@ -960,25 +779,22 @@ 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 */ 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(long OP, long IN, long ARR[]) { static FILE *F; char NAME[50]; @@ -1007,10 +823,14 @@ L20: printf("\nFile name: "); 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 MOD(N,M)long N, M; {return(N%M);}