X-Git-Url: https://jxself.org/git/?p=open-adventure.git;a=blobdiff_plain;f=misc.c;h=546cf48cfb9d9aacd2d28586e77dc2102891efce;hp=4ff6c93d5cbe011b7cf3e98dc38058dfc3fd5516;hb=3af993abcacd18f114e8dd54f9d3be6a3a62ea2e;hpb=1d3a087c39df15ca6f2811daaa936b2827505219 diff --git a/misc.c b/misc.c index 4ff6c93..546cf48 100644 --- a/misc.c +++ b/misc.c @@ -3,132 +3,161 @@ #include #include #include + #include "advent.h" -#include "funcs.h" #include "database.h" +#include "linenoise/linenoise.h" -/* hack to ignore GCC Unused Result */ -#define IGNORE(r) do{if(r){}}while(0) +#define PERCENT 63 /* partly hide the packed encoding */ -/* I/O routines (SPEAK, PSPEAK, RSPEAK, SETPRM, GETIN, YES) */ +const char advent_to_ascii[] = {0, 32, 33, 34, 39, 40, 41, 42, 43, 44, 45, 46, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 37, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 0, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 35, 36, 38, 47, 58, 59, 60, 61, 62, 63, 64, 91, 92, 93, 94, 95, 96, 123, 124, 125, 126, 0}; +/* Rendered from the now-gone MPINIT() function */ +const char ascii_to_advent[] = {0, 74, 75, 76, 77, 78, 79, 80, 81, 82, 0, 0, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 0, 1, 2, 106, 107, 63, 108, 3, 4, 5, 6, 7, 8, 9, 10, 109, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 110, 111, 112, 113, 114, 115, 116, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 117, 118, 119, 120, 121, 122, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 123, 124, 125, 126, 83}; -void SPEAK(vocab_t N) { -long BLANK, CASE, I, K, L, NEG, NPARMS, PARM, PRMTYP, STATE; +/* I/O routines (SPEAK, PSPEAK, RSPEAK, SETPRM, GETIN, YES) */ -/* Print the message which starts at LINES(N). Precede it with a blank line +void SPEAK(vocab_t msg) +/* Print the message which starts at LINES[N]. Precede it with a blank line * unless game.blklin is false. */ +{ + long blank, casemake, i, nxt, neg, nparms, param, prmtyp, state; - if(N == 0)return; - BLANK=game.blklin; - K=N; - NPARMS=1; -L10: L=labs(LINES[K])-1; - K=K+1; + if (msg == 0) + return; + blank=game.blklin; + nparms=1; + do { + nxt=labs(LINES[msg])-1; + msg=msg+1; LNLENG=0; LNPOSN=1; - STATE=0; - for (I=K; I<=L; I++) { - PUTTXT(LINES[I],STATE,2); - } /* end loop */ + state=0; + for (i = msg; i <= nxt; i++) { + PUTTXT(LINES[i],&state,2); + } 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. */ - if(PRMTYP == 1)return; - if(PRMTYP == 29) goto L320; - if(PRMTYP == 30) goto L340; - if(PRMTYP == 12) goto L360; - if(PRMTYP == 33 || PRMTYP == 22 || PRMTYP == 31 || PRMTYP == 13) goto - L380; - PRMTYP=PRMTYP-64; - if(PRMTYP < 1 || PRMTYP > 9) goto L30; - SHFTXT(LNPOSN+2,PRMTYP-2); - LNPOSN=LNPOSN+PRMTYP; - PARM=labs(PARMS[NPARMS]); - NEG=0; - if(PARMS[NPARMS] < 0)NEG=9; - /* 390 */ for (I=1; I<=PRMTYP; I++) { - LNPOSN=LNPOSN-1; - INLINE[LNPOSN]=MOD(PARM,10)+64; - if(I == 1 || PARM != 0) goto L390; - INLINE[LNPOSN]=NEG; - NEG=0; -L390: PARM=PARM/10; - } /* end loop */ - LNPOSN=LNPOSN+PRMTYP; -L395: NPARMS=NPARMS+1; - goto L32; - -L320: SHFTXT(LNPOSN+2,-1); - INLINE[LNPOSN]=55; - if(PARMS[NPARMS] == 1)SHFTXT(LNPOSN+1,-1); - goto L395; - -L340: SHFTXT(LNPOSN+2,-2); - STATE=0; - CASE=2; -L345: if(PARMS[NPARMS] < 0) goto L395; - {long x = NPARMS+1; if(PARMS[x] < 0)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; - for (I=1; I<=PRMTYP; I++) { - INLINE[LNPOSN]=0; - LNPOSN=LNPOSN+1; - } /* end loop */ - goto L395; - -L380: SHFTXT(LNPOSN+2,-2); - STATE=0; - CASE= -1; - if(PRMTYP == 31)CASE=1; - if(PRMTYP == 33)CASE=0; - I=LNPOSN; - 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; + ++LNPOSN; + + while (LNPOSN <= LNLENG) { + if (INLINE[LNPOSN] != PERCENT) { + ++LNPOSN; + continue; + } + prmtyp = INLINE[LNPOSN+1]; + /* A "%"; the next character determine the type of + * parameter: 1 (!) = suppress message completely, 29 (S) = NULL + * If PARAM=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) { + SHFTXT(LNPOSN+2,-1); + INLINE[LNPOSN] = 55; + if (PARMS[nparms] == 1) + SHFTXT(LNPOSN+1,-1); + ++nparms; + continue; + } + if (prmtyp == 30) { + SHFTXT(LNPOSN+2,-2); + state=0; + casemake=2; + + while (PARMS[nparms] > 0) { + if (PARMS[nparms+1] < 0) + casemake=0; + PUTTXT(PARMS[nparms],&state,casemake); + nparms=nparms+1; + } + ++nparms; + continue; + } + if (prmtyp == 12) { + prmtyp=PARMS[nparms]; + SHFTXT(LNPOSN+2,prmtyp-2); + if (prmtyp != 0) { + for (i=1; i<=prmtyp; i++) { + INLINE[LNPOSN]=0; + ++LNPOSN; + } + } + ++nparms; + continue; + } + if (prmtyp == 33 || prmtyp == 22 || prmtyp == 31 || prmtyp == 13) { + SHFTXT(LNPOSN+2,-2); + state = 0; + casemake = -1; + if (prmtyp == 31) + casemake=1; + if (prmtyp == 33) + casemake=0; + i = LNPOSN; + PUTTXT(PARMS[nparms],&state,casemake); + PUTTXT(PARMS[nparms+1],&state,casemake); + if (prmtyp == 13 && INLINE[i] >= 37 && INLINE[i] <= 62) + INLINE[i] -= 26; + nparms += 2; + continue; + } + + prmtyp=prmtyp-64; + if (prmtyp < 1 || prmtyp > 9) { + ++LNPOSN; + continue; + } + SHFTXT(LNPOSN+2,prmtyp-2); + LNPOSN += prmtyp; + param=labs(PARMS[nparms]); + neg=0; + if (PARMS[nparms] < 0) + neg=9; + for (i=1; i <= prmtyp; i++) { + --LNPOSN; + INLINE[LNPOSN]=MOD(param,10)+64; + if (i != 1 && param == 0) { + INLINE[LNPOSN]=neg; + neg=0; + } + param=param/10; + } + LNPOSN += prmtyp; + ++nparms; + continue; + } + + if (blank) + TYPE0(); + blank=false; TYPE(); - K=L+1; - if(LINES[K] >= 0) goto L10; - return; + msg = nxt + 1; + } while + (LINES[msg] >= 0); } -void PSPEAK(vocab_t MSG,int SKIP) -/* Find the skip+1st message from msg and print it. MSG should be +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; - for (I=0; I<=SKIP; I++) { -L1: M=labs(LINES[M]); - if(LINES[M] >= 0) - goto L1; + long i, m; + + m=PTEXT[msg]; + if (skip >= 0) { + for (i=0; i <=skip; i++) { + do { + m=labs(LINES[m]); + } while + (LINES[m] >= 0); } -L9: SPEAK(M); - return; + } + SPEAK(m); } + void RSPEAK(vocab_t i) /* Print the i-th "random" message (section 6 of database). */ { @@ -140,7 +169,7 @@ 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 >= MAXPARMS) + if (first >= MAXPARMS) BUG(29); else { PARMS[first] = p1; @@ -148,128 +177,115 @@ void SETPRM(long first, long p1, long p2) } } -#undef GETIN -#define WORD1 (*wORD1) -#define WORD1X (*wORD1X) -#define WORD2 (*wORD2) -#define WORD2X (*wORD2X) -bool fGETIN(FILE *input, long *wORD1, long *wORD1X, long *wORD2, long *wORD2X) { -long JUNK; - +bool GETIN(FILE *input, + long *pword1, long *pword1x, + long *pword2, long *pword2x) /* 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. */ +{ + long junk; - -L10: if(game.blklin)TYPE0(); - MAPLIN(input); - if (feof(input)) + for (;;) { + if (game.blklin) + TYPE0(); + if (!MAPLIN(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); - WORD2X=GETTXT(false,true,true); -L22: JUNK=GETTXT(false,true,true); - if(JUNK > 0) goto L22; - if(GETTXT(true,true,true) <= 0)return true; + *pword1=GETTXT(true,true,true); + if (game.blklin && *pword1 < 0) + continue; + *pword1x=GETTXT(false,true,true); + do { + junk=GETTXT(false,true,true); + } while + (junk > 0); + *pword2=GETTXT(true,true,true); + *pword2x=GETTXT(false,true,true); + do { + junk=GETTXT(false,true,true); + } while + (junk > 0); + if (GETTXT(true,true,true) <= 0) + return true; RSPEAK(53); - goto L10; + } } - - -#undef WORD1 -#undef WORD1X -#undef WORD2 -#undef WORD2X -#define GETIN(SRC,WORD1,WORD1X,WORD2,WORD2X) fGETIN(SRC,&WORD1,&WORD1X,&WORD2,&WORD2X) - -long YES(FILE *input, vocab_t X, vocab_t Y, vocab_t Z) { -token_t YEAH, REPLY, JUNK1, JUNK2, JUNK3; - +long YES(FILE *input, vocab_t x, vocab_t y, vocab_t z) /* 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(input, REPLY,JUNK1,JUNK2,JUNK3); - if(REPLY == MAKEWD(250519) || REPLY == MAKEWD(25)) goto L10; - if(REPLY == MAKEWD(1415) || REPLY == MAKEWD(14)) goto L20; +{ + token_t reply, junk1, junk2, junk3; + + for (;;) { + RSPEAK(x); + GETIN(input, &reply, &junk1, &junk2, &junk3); + if (reply == MAKEWD(250519) || reply == MAKEWD(25)) { + RSPEAK(y); + return true; + } + if (reply == MAKEWD(1415) || reply == MAKEWD(14)) { + RSPEAK(z); + return false; + } RSPEAK(185); - goto L1; -L10: YEAH=true; - RSPEAK(Y); - return(YEAH); -L20: YEAH=false; - RSPEAK(Z); - return(YEAH); + } } +/* Line-parsing routines (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. */ - -long GETTXT(bool SKIP,bool ONEWRD, bool UPPER) { +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. 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<=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; +{ + 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=TEXT+current-63; - SPLITTING = -1; - 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 < PERCENT) { + splitting = -1; + if (upper && current >= 37) + current=current-26; + text=text+current; + LNPOSN=LNPOSN+1; + continue; + } + if (splitting != LNPOSN) { + text=text+PERCENT; + splitting = LNPOSN; + continue; + } - return(TEXT); -} + text=text+current-PERCENT; + splitting = -1; + LNPOSN=LNPOSN+1; + } -token_t MAKEWD(long LETTRS) { -long I, L, WORD; + return text; +} +token_t MAKEWD(long letters) /* 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 @@ -277,24 +293,20 @@ long I, L, WORD; * 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. */ +{ + long i = 1, word = 0; - WORD=0; - I=1; - 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; - WORD=WORD*I; - return(WORD); + for (long k=letters; k != 0; k=k/100) { + word=word+i*(MOD(k,50)+10); + i=i*64; + if (MOD(k,100) > 50)word=word+i*5; + } + i=64L*64L*64L*64L*64L/i; + word=word*i; + return word; } - -#define STATE (*sTATE) -void fPUTTXT(token_t WORD, long *sTATE, long CASE) { -long ALPH1, ALPH2, BYTE, DIV, I, W; - +void PUTTXT(token_t word, long *state, long casemake) /* 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 @@ -302,58 +314,58 @@ long ALPH1, ALPH2, BYTE, DIV, I, W; * 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, + * If CASEMAKE=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<=TOKLEN; I++) { - if(W <= 0 && STATE == 0 && labs(CASE) <= 1)return; - BYTE=W/DIV; - if(STATE != 0 || BYTE != 63) goto L12; - STATE=63; - goto L18; - -L12: SHFTXT(LNPOSN,1); - STATE=STATE+BYTE; - if(STATE < ALPH2 && STATE >= ALPH1)STATE=STATE-26*CASE; - INLINE[LNPOSN]=STATE; +{ + long alph1, alph2, byte, div, i, w; + + alph1=13*casemake+24; + alph2=26*labs(casemake)+alph1; + if (labs(casemake) > 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; + for (i=1; i<=TOKLEN; i++) + { + if (w <= 0 && *state == 0 && labs(casemake) <= 1) + return; + byte=w/div; + w=(w-byte*div)*64; + if (!(*state != 0 || byte != PERCENT)) { + *state=PERCENT; + continue; + } + SHFTXT(LNPOSN,1); + *state=*state+byte; + if (*state < alph2 && *state >= alph1)*state=*state-26*casemake; + INLINE[LNPOSN]=*state; LNPOSN=LNPOSN+1; - STATE=0; -L18: W=(W-BYTE*DIV)*64; - } /* end loop */ - return; + *state=0; + } } - -#undef STATE #define PUTTXT(WORD,STATE,CASE) fPUTTXT(WORD,&STATE,CASE) -void SHFTXT(long FROM, long DELTA) { -long I, II, JJ; - +void SHFTXT(long from, long delta) /* 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; - for (I=FROM; I<=LNLENG; I++) { - II=I; - if(DELTA > 0)II=FROM+LNLENG-I; - JJ=II+DELTA; - INLINE[JJ]=INLINE[II]; - } /* end loop */ -L2: LNLENG=LNLENG+DELTA; - return; +{ + long I, k, j; + + if (!(LNLENG < from || delta == 0)) { + for (I=from; I<=LNLENG; I++) { + k=I; + if (delta > 0) + k=from+LNLENG-I; + j=k+delta; + INLINE[j]=INLINE[k]; + } + } + LNLENG=LNLENG+delta; } - void TYPE0(void) /* Type a blank line. This procedure is provided as a convenience for callers * who otherwise have no use for MAPCOM. */ @@ -367,211 +379,120 @@ void TYPE0(void) 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; -} -#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) -/* Write or read an array of n words. See SAVWRD. */ -{ - long i; - - 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) { -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){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; - if(N == 250)SAVEIO(1,STATE > 0,BUF); - N=MOD(N,250)+1; - H1=MOD(HASH*1093L+221573L,1048576L); - HASH=MOD(H1*1093L+221573L,1048576L); - H1=MOD(H1,1234)*765432+MOD(HASH,123); - N--; - if(STATE > 0)WORD=BUF[N]+H1; - BUF[N]=WORD-H1; - N++; - CKSUM=MOD(CKSUM*13+WORD,1000000000L); - return; - -L10: STATE=OP; - SAVEIO(0,STATE > 0,BUF); - N=1; - if(STATE > 0) goto L15; - HASH=MOD(WORD,1048576L); - BUF[0]=1234L*5678L-HASH; -L13: CKSUM=BUF[0]; - return; - -L15: SAVEIO(1,true,BUF); - HASH=MOD(1234L*5678L-BUF[0],1048576L); - goto L13; - -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); -L32: N--; WORD=BUF[N]-CKSUM; N++; - SAVEIO(-1,STATE > 0,BUF); - STATE=0; - return; -} - - - - - -/* Data struc. routines (VOCAB, DSTROY, JUGGLE, MOVE, PUT, CARRY, DROP, ATDWRF) - */ - -#undef WORD -#define SAVWRD(OP,WORD) fSAVWRD(OP,&WORD) - -long VOCAB(long ID, long INIT) { -long I, LEXEME; +/* Data structure routines */ +long VOCAB(long id, long init) /* 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; - if(INIT >= 0 && KTAB[I]/1000 != INIT) goto L1; - if(ATAB[I] == ID) goto L3; -L1: /*etc*/ ; - } /* end loop */ - BUG(21); - -L2: LEXEME= -1; - if(INIT < 0)return(LEXEME); - BUG(5); - -L3: LEXEME=KTAB[I]; - if(INIT >= 0)LEXEME=MOD(LEXEME,1000); - return(LEXEME); +{ + long i, lexeme; + + for (i=1; i<=TABSIZ; i++) { + if (KTAB[i] == -1) { + lexeme= -1; + if (init < 0) + return(lexeme); + BUG(5); + } + if (init >= 0 && KTAB[i]/1000 != init) + continue; + if (ATAB[i] == id) { + lexeme=KTAB[i]; + if (init >= 0) + lexeme=MOD(lexeme,1000); + return(lexeme); + } + } + BUG(21); } -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=game.place[OBJECT]; - J=game.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 game.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=game.place[OBJECT]; - goto L2; -L1: {long x = OBJECT-NOBJECTS; FROM=game.fixed[x];} -L2: if(FROM > 0 && FROM <= 300)CARRY(OBJECT,FROM); - DROP(OBJECT,WHERE); - return; + if (object > NOBJECTS) + from=game.fixed[object-NOBJECTS]; + else + from=game.place[object]; + 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 game.prop values for the repository objects. */ - - MOVE(OBJECT,WHERE); - X=(-1)-PVAL; - return(X); +{ + MOVE(object,where); + return (-1)-pval;; } -void CARRY(long OBJECT, long WHERE) { -long TEMP; - +void CARRY(long object, long where) /* 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 + * location. Incr holdng unless it was already being toted. If object>NOBJECTS * (moving "fixed" second loc), don't change game.place or game.holdng. */ +{ + long temp; - if(OBJECT > NOBJECTS) goto L5; - if(game.place[OBJECT] == -1)return; - game.place[OBJECT]= -1; + if (object <= NOBJECTS) { + 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=game.atloc[WHERE]; -L7: if(game.link[TEMP] == OBJECT) goto L8; - TEMP=game.link[TEMP]; - goto L7; -L8: game.link[TEMP]=game.link[OBJECT]; + } + if (game.atloc[where] == object) { + game.atloc[where]=game.link[object]; return; + } + temp=game.atloc[where]; + while (game.link[temp] != object) { + temp=game.link[temp]; + } + game.link[temp]=game.link[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) + if (object > NOBJECTS) + game.fixed[object-NOBJECTS] = where; + else + { + if (game.place[object] == -1) + --game.holdng; + game.place[object] = where; + } + if (where <= 0) return; - game.link[object]=game.atloc[where]; - game.atloc[where]=object; + game.link[object] = game.atloc[where]; + game.atloc[where] = object; } long ATDWRF(long where) @@ -581,16 +502,16 @@ long ATDWRF(long where) { long at, i; - at=0; - if(game.dflag < 2) + at =0; + if (game.dflag < 2) return(at); - at= -1; + at = -1; for (i=1; i<=NDWARVES-1; i++) { - if(game.dloc[i] == where) + if (game.dloc[i] == where) return i; - if(game.dloc[i] != 0) + if (game.dloc[i] != 0) at=0; - } /* end loop */ + } return(at); } @@ -600,7 +521,7 @@ long ATDWRF(long where) long SETBIT(long bit) /* Returns 2**bit for use in constructing bit-masks. */ { - return(2 << bit); + return(1 << bit); } bool TSTBIT(long mask, int bit) @@ -689,11 +610,12 @@ void BUG(long num) exit(0); } -/* Machine dependent routines (MAPLIN, TYPE, MPINIT, SAVEIO) */ +/* Machine dependent routines (MAPLIN, TYPE, SAVEIO) */ -void MAPLIN(FILE *OPENED) +bool MAPLIN(FILE *fp) { - long I, VAL; + long i, val; + bool eof; /* Read a line of input, from the specified input source, * translate the chars to integers in the range 0-126 and store @@ -720,30 +642,43 @@ void MAPLIN(FILE *OPENED) * and is not changed thereafter unless the routines on this page choose * to do so. */ - if(MAP2[1] == 0)MPINIT(); - - if (!oldstyle && OPENED == stdin) + if (!oldstyle && !isatty(1)) fputs("> ", stdout); do { - IGNORE(fgets(rawbuf,sizeof(rawbuf)-1,OPENED)); + if (oldstyle) { + IGNORE(fgets(rawbuf,sizeof(rawbuf)-1,fp)); + eof = (feof(fp)); + } else { + char *cp = linenoise("> "); + eof = (cp == NULL); + if (!eof) { + strncpy(rawbuf, cp, sizeof(rawbuf)-1); + linenoiseHistoryAdd(rawbuf); + strncat(rawbuf, "\n", sizeof(rawbuf)-1); + linenoiseFree(cp); + } + } } while - (!feof(OPENED) && rawbuf[0] == '#'); - if (feof(OPENED)) { - if (logfp && OPENED == stdin) + (!eof && rawbuf[0] == '#'); + if (eof) { + if (logfp && fp == stdin) fclose(logfp); + return false; } else { - if (logfp && OPENED == stdin) + if (logfp && fp == 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 */ + for (i=1; i<=(long)sizeof(INLINE) && INLINE[i]!=0; i++) { + val=INLINE[i]+1; + INLINE[i]=ascii_to_advent[val]; + if (INLINE[i] != 0) + LNLENG=i; + } LNPOSN=1; + return true; } } @@ -754,91 +689,28 @@ void TYPE(void) { long i; - if(LNLENG == 0) { + if (LNLENG == 0) { printf("\n"); return; } - if(MAP2[1] == 0) - MPINIT(); for (i=1; i<=LNLENG; i++) { - INLINE[i]=MAP2[INLINE[i]+1]; + INLINE[i]=advent_to_ascii[INLINE[i]+1]; } INLINE[LNLENG+1]=0; printf("%s\n", INLINE+1); return; } -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} }; - - for (I=1; I<=128; I++) { - MAP1[I]= -1; - } /* end loop */ - VAL=0; - for (I=0; I<7; I++) { - FIRST=RUNS[I][0]; - LAST=RUNS[I][1]; - /* 22 */ for (J=FIRST; J<=LAST; J++) { - J++; if(MAP1[J] >= 0) goto L22; - MAP1[J]=VAL; - VAL=VAL+1; -L22: J--; - } /* end loop */ - /*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]; - - for (I=0; I<=126; I++) { - I++; VAL=MAP1[I]+1; I--; - MAP2[VAL]=I*('B'-'A'); - if(I >= 64)MAP2[VAL]=(I-64)*('B'-'A')+'@'; - } /* end loop */ - - return; -} - -#undef SAVEIO -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. */ - - - {long ifvar; ifvar=(OP); switch (ifvar<0? -1 : ifvar>0? 1 : 0) { case -1: - goto L10; case 0: goto L20; case 1: goto L30; }} - -L10: fclose(F); - return; - -L20: printf("\nFile name: "); - IGNORE(fgets(NAME, sizeof(NAME), stdin)); - F=fopen(NAME,(IN ? READ_MODE : WRITE_MODE)); - if(F == NULL) {printf("Can't open file, try again.\n"); goto L20;} - return; - -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) +void DATIME(long* d, long* t) { struct timeval tv; gettimeofday(&tv, NULL); - *D = (long) tv.tv_sec; - *T = (long) tv.tv_usec; + *d = (long) tv.tv_sec; + *t = (long) tv.tv_usec; } -long MOD(N,M)long N, M; {return(N%M);} +long MOD(long n, long m) +{ + return(n%m); +}