X-Git-Url: https://jxself.org/git/?a=blobdiff_plain;f=misc.c;h=2560926fda6306e22bef7fca4d1e81792ce2070a;hb=beac8d7f41a6163ea15f0ab981cd786779244d9a;hp=86d4626b9c7682706a97c569f9334361fc4484ff;hpb=4e1ab63322b96238c5e5f7e7ef79305268aae4c0;p=open-adventure.git diff --git a/misc.c b/misc.c index 86d4626..2560926 100644 --- a/misc.c +++ b/misc.c @@ -16,10 +16,10 @@ 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=labs(LINES[K])-1; @@ -28,7 +28,7 @@ L10: L=labs(LINES[K])-1; LNPOSN=1; STATE=0; for (I=K; I<=L; I++) { - PUTTXT(LINES[I],STATE,2); + PUTTXT(LINES[I],STATE,2); } /* end loop */ LNPOSN=0; L30: LNPOSN=LNPOSN+1; @@ -111,48 +111,43 @@ L40: if(BLANK)TYPE0(); return; } -void PSPEAK(vocab_t MSG,int 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; + if(SKIP < 0) + goto L9; for (I=0; I<=SKIP; I++) { L1: M=labs(LINES[M]); - if(LINES[M] >= 0) goto L1; - /*etc*/ ; - } /* end loop */ + if(LINES[M] >= 0) + goto L1; + } L9: SPEAK(M); return; } - -void RSPEAK(vocab_t 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]); } - -void SETPRM(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; + } } - #undef GETIN #define WORD1 (*wORD1) #define WORD1X (*wORD1X) @@ -168,12 +163,12 @@ long JUNK; * WORD2 (chars 6 thru 10 in WORD2X), else WORD2 is -1. */ -L10: if(BLKLIN)TYPE0(); +L10: if(game.blklin)TYPE0(); MAPLIN(input); if (feof(input)) return false; WORD1=GETTXT(true,true,true); - if(BLKLIN && WORD1 < 0) goto L10; + if(game.blklin && WORD1 < 0) goto L10; WORD1X=GETTXT(false,true,true); L12: JUNK=GETTXT(false,true,true); if(JUNK > 0) goto L12; @@ -245,7 +240,7 @@ long GETTXT(bool SKIP,bool ONEWRD, bool UPPER) { } TEXT=0; - for (int I=1; I<=5; I++) { + for (int I=1; I<=TOKLEN; I++) { TEXT=TEXT*64; if(LNPOSN > LNLENG || (ONEWRD && INLINE[LNPOSN] == 0)) continue; @@ -275,12 +270,13 @@ long GETTXT(bool SKIP,bool ONEWRD, bool UPPER) { token_t 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. */ +/* 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; @@ -299,24 +295,24 @@ long I, L, WORD; 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. 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*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; - /* 18 */ for (I=1; I<=5; I++) { + /* 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; @@ -356,53 +352,50 @@ L2: LNLENG=LNLENG+DELTA; } -void TYPE0() { -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; } /* 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; - for (I=1; I<=N; I++) { - 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) { @@ -493,180 +486,172 @@ L3: LEXEME=KTAB[I]; return(LEXEME); } -void DSTROY(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); } -void JUGGLE(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+NOBJECTS,J); - return; + i=game.place[object]; + j=game.fixed[object]; + MOVE(object,i); + MOVE(object+NOBJECTS,j); } -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. */ - +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; - if(OBJECT > NOBJECTS) goto L1; - FROM=PLACE[OBJECT]; - goto L2; -L1: {long x = OBJECT-NOBJECTS; 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); } -long PUT(long OBJECT, long WHERE, long PVAL) { -long X; - +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); - X=(-1)-PVAL; - return(X); + * negated game.prop values for the repository objects. */ +{ + MOVE(object,where); + return (-1)-pval;; } -void CARRY(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>NOBJECTS - * (moving "fixed" second loc), don't change PLACE or HOLDNG. */ - - if(OBJECT > NOBJECTS) 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; } -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 > NOBJECTS) goto L1; - if(PLACE[OBJECT] == -1)HOLDNG=HOLDNG-1; - PLACE[OBJECT]=WHERE; - goto L2; -L1: {long x = OBJECT-NOBJECTS; 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; } - - -long ATDWRF(long WHERE) { -long AT, 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). */ +{ + long at, i; - - AT=0; - if(DFLAG < 2)return(AT); - AT= -1; - for (I=1; I<=NDWARVES-1; I++) { - if(DLOC[I] == WHERE) goto L2; - if(DLOC[I] != 0)AT=0; - } /* end loop */ - return(AT); - -L2: AT=I; - return(AT); + 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) { +long SETBIT(long bit) /* Returns 2**bit for use in constructing bit-masks. */ +{ return(2 << bit); } -bool TSTBIT(long mask, int bit) { +bool TSTBIT(long mask, int bit) /* Returns true if the specified bit is set in the mask. */ - return((mask & (1 << bit)) != 0); +{ + return (mask & (1 << bit)) != 0; } void set_seed(long seedval) +/* Set the LCG seed */ { - lcgstate.x = (unsigned long) seedval % lcgstate.m; + lcgstate.x = (unsigned long) seedval % lcgstate.m; } unsigned long get_next_lcg_value(void) +/* Return the LCG's current value, and then iterate it. */ { - /* 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); + 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 a random integer from [0, range). */ - long result = range * get_next_lcg_value() / lcgstate.m; - return(result); + return range * get_next_lcg_value() / lcgstate.m; } -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 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; } + } - long DIV = 64L * 64L * 64L; - for (int I = 1; I <= TABSIZ; I++) { - if (MOD(ATAB[I]/DIV, 64L) == CHAR) - { - ATAB[I] = RND; - break; - } + long div = 64L * 64L * 64L; + for (int i = 1; i <= TABSIZ; i++) { + if (MOD(ATAB[i]/div, 64L) == second) + { + ATAB[i] = rnd; + break; } + } - return(RND); + return rnd; } -void BUG(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 @@ -691,92 +676,90 @@ void BUG(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) */ -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; - } +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; + } } -void TYPE(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(); - for (I=1; I<=LNLENG; I++) { - VAL=INLINE[I]; - {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; } void MPINIT(void) { @@ -840,14 +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; +void DATIME(long* D, long* T) +{ + struct timeval tv; + gettimeofday(&tv, NULL); + *D = (long) tv.tv_sec; + *T = (long) tv.tv_usec; } long MOD(N,M)long N, M; {return(N%M);}