X-Git-Url: https://jxself.org/git/?p=open-adventure.git;a=blobdiff_plain;f=misc.c;h=752bc8ee2cd3f483f5994abf0e5f750a24331ea6;hp=15932ece7022d7c9a0aeb84a42b9a0c7d5667137;hb=60ab7a63dc7c2b52bf21887f365a58588a08f708;hpb=d93746d0789dc9bd7a9d1a380656680ce8be3c07 diff --git a/misc.c b/misc.c index 15932ec..752bc8e 100644 --- a/misc.c +++ b/misc.c @@ -1,1016 +1,718 @@ +#include #include #include -#include "main.h" -#include "misc.h" -#include "funcs.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) { -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. */ - - - if(N == 0)return; - BLANK=BLKLIN; - K=N; - NPARMS=1; -L10: L=IABS(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); - } /* 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. */ - 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=IABS(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,0); - 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++) { - INLINE[LNPOSN]=0; -L365: 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,0); - {long x = NPARMS+1; PUTTXT(PARMS[x],STATE,CASE,0);} - 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; - TYPE(); - K=L+1; - if(LINES[K] >= 0) goto L10; - 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). */ - - - 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 */ -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; -} - - - -#define RSPEAK(I) fRSPEAK(I) -#undef SETPRM -void fSETPRM(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; -} - - - -#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) { -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. */ - - -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); - if(JUNK > 0) goto L12; - WORD2=GETTXT(true,true,true,0); - WORD2X=GETTXT(false,true,true,0); -L22: JUNK=GETTXT(false,true,true,0); - if(JUNK > 0) goto L22; - if(GETTXT(true,true,true,0) <= 0)return; +#include +#include +#include + +#include "advent.h" +#include "database.h" +#include "linenoise/linenoise.h" +#include "newdb.h" + +void* xmalloc(size_t size) +{ + void* ptr = malloc(size); + if (ptr == NULL) + { + fprintf(stderr, "Out of memory!\n"); + exit(EXIT_FAILURE); + } + return(ptr); +} + +char* xstrdup(const char* s) +{ + char* ptr = strdup(s); + if (ptr == NULL) + { + fprintf(stderr, "Out of memory!\n"); + exit(EXIT_FAILURE); + } + return(ptr); +} + +void packed_to_token(long packed, char token[6]) +{ + // Unpack and map back to ASCII. + for (int i = 0; i < 5; ++i) + { + char advent = (packed >> i * 6) & 63; + token[4 - i] = advent_to_ascii[advent]; + } + + // Ensure the last character is \0. + token[5] = '\0'; + + // Replace trailing whitespace with \0. + for (int i = 4; i >= 0; --i) + { + if (token[i] == ' ' || token[i] == '\t') + token[i] = '\0'; + else + break; + } +} + +/* I/O routines (SPEAK, PSPEAK, RSPEAK, SETPRM, GETIN, YES) */ + +void newspeak(char* msg) +{ + // Do nothing if we got a null pointer. + if (msg == NULL) + return; + + // Do nothing if we got an empty string. + if (strlen(msg) == 0) + return; + + // Print a newline if the global game.blklin says to. + if (game.blklin == true) + printf("\n"); + + // Create a copy of our string, so we can edit it. + char* copy = xstrdup(msg); + + // Staging area for stringified parameters. + char parameters[5][100]; // FIXME: to be replaced with dynamic allocation + + // Handle format specifiers (including the custom %C, %L, %S) by adjusting the parameter accordingly, and replacing the specifier with %s. + int pi = 0; // parameter index + for (int i = 0; i < strlen(msg); ++i) + { + if (msg[i] == '%') + { + ++pi; + + // Integer specifier. In order to accommodate the fact that PARMS can have both legitimate integers *and* packed tokens, stringify everything. Future work may eliminate the need for this. + if (msg[i + 1] == 'd') + { + copy[i + 1] = 's'; + sprintf(parameters[pi], "%ld", PARMS[pi]); + } + + // Unmodified string specifier. + if (msg[i + 1] == 's') + { + packed_to_token(PARMS[pi], parameters[pi]); + } + + // Singular/plural specifier. + if (msg[i + 1] == 'S') + { + copy[i + 1] = 's'; + if (PARMS[pi - 1] > 1) // look at the *previous* parameter (which by necessity must be numeric) + { + sprintf(parameters[pi], "%s", "s"); + } + else + { + sprintf(parameters[pi], "%s", ""); + } + } + + // All-lowercase specifier. + if (msg[i + 1] == 'L') + { + copy[i + 1] = 's'; + packed_to_token(PARMS[pi], parameters[pi]); + for (int i = 0; i < strlen(parameters[pi]); ++i) + { + parameters[pi][i] = tolower(parameters[pi][i]); + } + } + + // First char uppercase, rest lowercase. + if (msg[i + 1] == 'C') + { + copy[i + 1] = 's'; + packed_to_token(PARMS[pi], parameters[pi]); + for (int i = 0; i < strlen(parameters[pi]); ++i) + { + parameters[pi][i] = tolower(parameters[pi][i]); + } + parameters[pi][0] = toupper(parameters[pi][0]); + } + } + } + + // Render the final string. + char rendered[2000]; // FIXME: to be replaced with dynamic allocation + sprintf(rendered, copy, parameters[1], parameters[2], parameters[3], parameters[4]); // FIXME: to be replaced with vsprintf() + + // Print the message. + printf("%s\n", rendered); + + free(copy); +} + +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). */ +{ + if (skip >= 0) + newspeak(object_descriptions[msg].longs[skip]); + else + newspeak(object_descriptions[msg].inventory); +} + +void RSPEAK(vocab_t i) +/* Print the i-th "random" message (section 6 of database). */ +{ + newspeak(arbitrary_messages[i]); +} + +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) + BUG(29); + else { + PARMS[first] = p1; + PARMS[first+1] = p2; + } +} + +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; + + for (;;) { + if (game.blklin) + TYPE0(); + if (!MAPLIN(input)) + return false; + *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(WORD1,WORD1X,WORD2,WORD2X) fGETIN(&WORD1,&WORD1X,&WORD2,&WORD2X) -#undef YES -long fYES(long X, long Y, long Z) { - -long YES, 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); - if(REPLY == MAKEWD(250519) || REPLY == MAKEWD(25)) goto L10; - if(REPLY == MAKEWD(1415) || REPLY == MAKEWD(14)) goto L20; + } +} + +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. */ +{ + 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: YES=true; - RSPEAK(Y); - return(YES); -L20: YES=false; - RSPEAK(Z); - return(YES); -} - - - - - -/* 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. */ - -#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; - -/* 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; - 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; - 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; - I=64L*64L*64L*64L*64L/I; - MAKEWD=MAKEWD*I; - return(MAKEWD); -} - - - -#define MAKEWD(LETTRS) fMAKEWD(LETTRS) -#undef PUTTXT -#define STATE (*sTATE) -void fPUTTXT(long WORD, long *sTATE, long CASE, long HASH) { -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). */ - - - ALPH1=13*CASE+24; - ALPH2=26*IABS(CASE)+ALPH1; - if(IABS(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; - 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; - LNPOSN=LNPOSN+1; - STATE=0; -L18: W=(W-BYTE*DIV)*64; - } /* end loop */ + } +} + +/* Line-parsing routines (GETTXT, MAKEWD, PUTTXT, SHFTXT, TYPE0) */ + +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; + } + + 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 < ascii_to_advent['%']) { + splitting = -1; + if (upper && current >= ascii_to_advent['a']) + current=current-26; + text=text+current; + ++LNPOSN; + continue; + } + if (splitting != LNPOSN) { + text=text+ascii_to_advent['%']; + splitting = LNPOSN; + continue; + } + + text=text+current-ascii_to_advent['%']; + splitting = -1; + ++LNPOSN; + } + + 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 + * 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. */ +{ + long i = 1, word = 0; + + 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; +} + +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 + * 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 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). */ +{ + 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 != ascii_to_advent['%'])) { + *state=ascii_to_advent['%']; + continue; + } + SHFTXT(LNPOSN,1); + *state=*state+byte; + if (*state < alph2 && *state >= alph1)*state=*state-26*casemake; + INLINE[LNPOSN]=*state; + ++LNPOSN; + *state=0; + } +} +#define PUTTXT(WORD,STATE,CASE) fPUTTXT(WORD,&STATE,CASE) + +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. */ +{ + 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. */ +{ + long temp; + + temp=LNLENG; + LNLENG=0; + TYPE(); + LNLENG=temp; + return; +} + +/* 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. */ +{ + 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); +} + +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); +} + +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) + 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) +/* 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); + return (-1)-pval;; +} + +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 + * (moving "fixed" second loc), don't change game.place or game.holdng. */ +{ + long temp; + + if (object <= NOBJECTS) { + if (game.place[object] == -1) + return; + game.place[object]= -1; + ++game.holdng; + } + if (game.atloc[where] == object) { + game.atloc[where]=game.link[object]; return; -} - - - -#undef STATE -#define PUTTXT(WORD,STATE,CASE,HASH) fPUTTXT(WORD,&STATE,CASE,HASH) -#undef SHFTXT -void fSHFTXT(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. */ - - - if(LNLENG < FROM || DELTA == 0) goto L2; - /* 1 */ for (I=FROM; I<=LNLENG; I++) { - II=I; - if(DELTA > 0)II=FROM+LNLENG-I; - JJ=II+DELTA; -L1: INLINE[JJ]=INLINE[II]; - } /* end loop */ -L2: LNLENG=LNLENG+DELTA; + } + 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) + game.fixed[object-NOBJECTS] = where; + else + { + if (game.place[object] == -1) + --game.holdng; + game.place[object] = where; + } + if (where <= 0) return; -} - - - -#define SHFTXT(FROM,DELTA) fSHFTXT(FROM,DELTA) -#undef TYPE0 -void fTYPE0() { -long TEMP; - -/* TYPE A BLANK LINE. THIS PROCEDURE IS PROVIDED AS A CONVENIENCE FOR CALLERS - * WHO OTHERWISE HAVE NO USE FOR MAPCOM. */ - - - TEMP=LNLENG; + game.link[object] = game.atloc[where]; + game.atloc[where] = object; +} + +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 (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; + } + 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. */ +{ + return(1 << 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) +/* 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; +} + +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) == second) + { + 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(0); +} + +/* Machine dependent routines (MAPLIN, TYPE, SAVEIO) */ + +bool MAPLIN(FILE *fp) +{ + 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 + * 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. */ + + do { + if (!editline) { + if (prompt) + fputs("> ", stdout); + 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 + (!eof && rawbuf[0] == '#'); + if (eof) { + if (logfp && fp == stdin) + fclose(logfp); + return false; + } else { + FILE *efp = NULL; + if (logfp && fp == stdin) + efp = logfp; + else if (!isatty(0)) + efp = stdout; + if (efp != NULL) + { + if (prompt) + fputs("> ", efp); + IGNORE(fputs(rawbuf, efp)); + } + strcpy(INLINE+1, rawbuf); 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; -} - - -#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. */ - - - /* 1 */ for (I=1; I<=N; I++) { -L1: SAVWRD(0,ARR[I]); - } /* end loop */ - 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) -#undef VOCAB -long fVOCAB(long ID, long 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; - /* 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; -L1: /*etc*/ ; - } /* end loop */ - BUG(21); - -L2: VOCAB= -1; - if(INIT < 0)return(VOCAB); - BUG(5); - -L3: VOCAB=KTAB[I]; - if(INIT >= 0)VOCAB=MOD(VOCAB,1000); - return(VOCAB); -} - - - -#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; -} - - - -#define DSTROY(OBJECT) fDSTROY(OBJECT) -#undef JUGGLE -void fJUGGLE(OBJECT)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. */ - - - I=PLACE[OBJECT]; - J=FIXED[OBJECT]; - MOVE(OBJECT,I); - MOVE(OBJECT+100,J); - return; -} - - - -#define JUGGLE(OBJECT) fJUGGLE(OBJECT) -#undef MOVE -void fMOVE(OBJECT,WHERE)long OBJECT, 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; -} - - - -#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. */ - - - MOVE(OBJECT,WHERE); - PUT=(-1)-PVAL; - return(PUT); -} - - - -#define PUT(OBJECT,WHERE,PVAL) fPUT(OBJECT,WHERE,PVAL) -#undef CARRY -void fCARRY(OBJECT,WHERE)long OBJECT, 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]; - return; -L6: TEMP=ATLOC[WHERE]; -L7: if(LINK[TEMP] == OBJECT) goto L8; - TEMP=LINK[TEMP]; - goto L7; -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. */ - - - 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; - return; -} - - - -#define DROP(OBJECT,WHERE) fDROP(OBJECT,WHERE) -#undef ATDWRF -long fATDWRF(WHERE)long WHERE; { -long ATDWRF, 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). */ - - - 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(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*/ ; - } /* 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 */ - - 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(FIL)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; - } /* end loop */ + for (i=1; i<=(long)sizeof(INLINE) && INLINE[i]!=0; i++) { + val=INLINE[i]; + INLINE[i]=ascii_to_advent[val]; + if (INLINE[i] != 0) + LNLENG=i; + } 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; + return true; + } } +void TYPE(void) +/* Type the first "LNLENG" characters stored in inline, mapping them + * from integers to text per the rules described above. INLINE + * may be changed by this routine. */ +{ + long i; - -#define MAPLIN(FIL) fMAPLIN(FIL) -#undef TYPE -void fTYPE() { -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. */ - - - 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; + for (i=1; i<=LNLENG; i++) { + INLINE[i]=advent_to_ascii[INLINE[i]]; + } + INLINE[LNLENG+1]=0; + printf("%s\n", INLINE+1); + return; } - - -#define TYPE() fTYPE() -#undef MPINIT -void fMPINIT() { -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}; - - - /* 10 */ for (I=1; I<=128; I++) { -L10: MAP1[I]= -1; - } /* end loop */ - VAL=0; - /* 20 */ 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 */ -L20: /*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++) { - I++; VAL=MAP1[I]+1; I--; - MAP2[VAL]=I*('B'-'A'); -L30: if(I >= 64)MAP2[VAL]=(I-64)*('B'-'A')+'@'; - } /* end loop */ - - return; +void DATIME(long* d, long* t) +{ + struct timeval tv; + gettimeofday(&tv, NULL); + *d = (long) tv.tv_sec; + *t = (long) tv.tv_usec; } - - -#define MPINIT() fMPINIT() -#undef SAVEIO -void fSAVEIO(OP,IN,ARR)long ARR[], IN, OP; { -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,4,250,F)); - if(!IN)fwrite(ARR,4,250,F); - return; - -} - - - -long fIABS(N)long N; {return(N<0? -N : N);} -long fMOD(N,M)long N, M; {return(N%M);} +/* end */