-#include <unistd.h>
-#include <stdlib.h>
+/*
+ * I/O and support routines.
+ *
+ * SPDX-FileCopyrightText: (C) 1977, 2005 by Will Crowther and Don Woods
+ * SPDX-License-Identifier: BSD-2-Clause
+ */
+
+#include <ctype.h>
+#include <editline/readline.h>
+#include <inttypes.h>
+#include <stdarg.h>
#include <stdio.h>
+#include <stdlib.h>
#include <string.h>
#include <sys/time.h>
-#include "main.h"
-#include "share.h" /* for SETUP */
-#include "misc.h"
-#include "funcs.h"
-#include "database.h"
-
-/* hack to ignore GCC Unused Result */
-#define IGNORE(r) do{if(r){}}while(0)
-
-/* I/O routines (SPEAK, PSPEAK, RSPEAK, SETPRM, GETIN, YES) */
-
-#undef SPEAK
-void fSPEAK(long N) {
-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;
- for (I=K; I<=L; I++) {
- PUTTXT(LINES[I],STATE,2);
- } /* end loop */
- LNPOSN=0;
-L30: LNPOSN=LNPOSN+1;
-L32: if(LNPOSN > LNLENG) goto L40;
- if(INLINE[LNPOSN] != 63) goto L30;
- {long x = LNPOSN+1; PRMTYP=INLINE[x];}
-/* 63 is a "%"; the next character determine the type of parameter: 1 (!) =
- * suppress message completely, 29 (S) = NULL If PARM=1, else 'S' (optional
- * plural ending), 33 (W) = word (two 30-bit values) with trailing spaces
- * suppressed, 22 (L) or 31 (U) = word but map to lower/upper case, 13 (C) =
- * word in lower case with first letter capitalised, 30 (T) = text ending
- * with a word of -1, 65-73 (1-9) = number using that many characters,
- * 12 (B) = variable number of blanks. */
- 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);
- 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;
- 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;
- for (I=0; I<=SKIP; I++) {
-L1: M=IABS(LINES[M]);
- if(LINES[M] >= 0) goto L1;
- /*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)
-bool fGETIN(FILE *input, long *wORD1, long *wORD1X, long *wORD2, long *wORD2X) {
-long JUNK;
-
-/* Get a command from the adventurer. Snarf out the first word, pad it with
- * blanks, and return it in WORD1. Chars 6 thru 10 are returned in WORD1X, in
- * case we need to print out the whole word in an error message. Any number of
- * blanks may follow the word. If a second word appears, it is returned in
- * WORD2 (chars 6 thru 10 in WORD2X), else WORD2 is -1. */
-
-
-L10: if(BLKLIN)TYPE0();
- MAPLIN(input);
- if (feof(input))
- return false;
- WORD1=GETTXT(true,true,true);
- if(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;
- 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)
-#undef YES
-long fYES(FILE *input, 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(input, REPLY,JUNK1,JUNK2,JUNK3);
- if(REPLY == MAKEWD(250519) || REPLY == MAKEWD(25)) goto L10;
- if(REPLY == MAKEWD(1415) || REPLY == MAKEWD(14)) goto L20;
- RSPEAK(185);
- goto L1;
-L10: YES=true;
- 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(FILE *source) {
-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(source != NULL)MAPLIN(source);
- 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 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. 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 */
-
- return(GETTXT);
-}
-
-
-
-#define GETTXT(SKIP,ONEWRD,UPPER) fGETTXT(SKIP,ONEWRD,UPPER)
-#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. 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 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). */
-
-
- 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;
- /* 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 */
- return;
-}
-
-
-
-#undef STATE
-#define PUTTXT(WORD,STATE,CASE) fPUTTXT(WORD,&STATE,CASE)
-#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;
- 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;
-}
-
-
-
-#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;
- 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. */
-
-
- for (I=1; I<=N; I++) {
- 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;
+#include <unistd.h>
-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;
+#include "advent.h"
+#include "dungeon.h"
+
+static void *xcalloc(size_t size) {
+ void *ptr = calloc(size, 1);
+ if (ptr == NULL) {
+ // LCOV_EXCL_START
+ // exclude from coverage analysis because we can't simulate an
+ // out of memory error in testing
+ fprintf(stderr, "Out of memory!\n");
+ exit(EXIT_FAILURE);
+ // LCOV_EXCL_STOP
+ }
+ return (ptr);
}
+/* I/O routines (speak, pspeak, rspeak, sspeak, get_input, yes) */
+static void vspeak(const char *msg, bool blank, va_list ap) {
+ /* Engine for various speak functions */
+ // 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;
+ }
+ if (blank == true) {
+ printf("\n");
+ }
-/* 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 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 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: VOCAB= -1;
- if(INIT < 0)return(VOCAB);
- BUG(5);
+ int msglen = strlen(msg);
+
+ // Rendered string
+ ssize_t size = 2000; /* msglen > 50 ? msglen*2 : 100; */
+ char *rendered = xcalloc(size);
+ char *renderp = rendered;
+
+ // Handle format specifiers (including the custom %S) by
+ // adjusting the parameter accordingly, and replacing the
+ // specifier with %s.
+ bool pluralize = false;
+ for (int i = 0; i < msglen; i++) {
+ if (msg[i] != '%') {
+ /* Ugh. Least obtrusive way to deal with artifacts "on
+ * the floor" being dropped outside of both cave and
+ * building. */
+ if (strncmp(msg + i, "floor", 5) == 0 &&
+ strchr(" .", msg[i + 5]) && !INSIDE(game.loc)) {
+ strcpy(renderp, "ground");
+ renderp += 6;
+ i += 4;
+ size -= 5;
+ } else {
+ *renderp++ = msg[i];
+ size--;
+ }
+ } else {
+ i++;
+ // Integer specifier.
+ if (msg[i] == 'd') {
+ int32_t arg = va_arg(ap, int32_t);
+ int ret =
+ snprintf(renderp, size, "%" PRId32, arg);
+ if (ret < size) {
+ renderp += ret;
+ size -= ret;
+ }
+ pluralize = (arg != 1);
+ }
+
+ // Unmodified string specifier.
+ if (msg[i] == 's') {
+ char *arg = va_arg(ap, char *);
+ strncat(renderp, arg, size - 1);
+ size_t len = strlen(renderp);
+ renderp += len;
+ size -= len;
+ }
+
+ // Singular/plural specifier.
+ if (msg[i] == 'S') {
+ // look at the *previous* numeric parameter
+ if (pluralize) {
+ *renderp++ = 's';
+ size--;
+ }
+ }
+
+ // LCOV_EXCL_START - doesn't occur in test suite.
+ /* Version specifier */
+ if (msg[i] == 'V') {
+ strcpy(renderp, VERSION);
+ size_t len = strlen(VERSION);
+ renderp += len;
+ size -= len;
+ }
+ // LCOV_EXCL_STOP
+ }
+ }
+ *renderp = 0;
+
+ // Print the message.
+ printf("%s\n", rendered);
+
+ free(rendered);
+}
+
+void speak(const char *msg, ...) {
+ /* speak a specified string */
+ va_list ap;
+ va_start(ap, msg);
+ vspeak(msg, true, ap);
+ va_end(ap);
+}
+
+void sspeak(const int msg, ...) {
+ /* Speak a message from the arbitrary-messages list */
+ va_list ap;
+ va_start(ap, msg);
+ fputc('\n', stdout);
+ vprintf(arbitrary_messages[msg], ap);
+ fputc('\n', stdout);
+ va_end(ap);
+}
+
+void pspeak(vocab_t msg, enum speaktype mode, bool blank, int skip, ...) {
+ /* Find the skip+1st message from msg and print it. Modes are:
+ * feel = for inventory, what you can touch
+ * look = the full description for the state the object is in
+ * listen = the sound for the state the object is in
+ * study = text on the object. */
+ va_list ap;
+ va_start(ap, skip);
+ switch (mode) {
+ case touch:
+ vspeak(objects[msg].inventory, blank, ap);
+ break;
+ case look:
+ vspeak(objects[msg].descriptions[skip], blank, ap);
+ break;
+ case hear:
+ vspeak(objects[msg].sounds[skip], blank, ap);
+ break;
+ case study:
+ vspeak(objects[msg].texts[skip], blank, ap);
+ break;
+ case change:
+ vspeak(objects[msg].changes[skip], blank, ap);
+ break;
+ }
+ va_end(ap);
+}
+
+void rspeak(vocab_t i, ...) {
+ /* Print the i-th "random" message (section 6 of database). */
+ va_list ap;
+ va_start(ap, i);
+ vspeak(arbitrary_messages[i], true, ap);
+ va_end(ap);
+}
+
+void echo_input(FILE *destination, const char *input_prompt,
+ const char *input) {
+ size_t len = strlen(input_prompt) + strlen(input) + 1;
+ char *prompt_and_input = (char *)xcalloc(len);
+ strcpy(prompt_and_input, input_prompt);
+ strcat(prompt_and_input, input);
+ fprintf(destination, "%s\n", prompt_and_input);
+ free(prompt_and_input);
+}
+
+static int word_count(char *str) {
+ char delims[] = " \t";
+ int count = 0;
+ int inblanks = true;
+
+ for (char *s = str; *s; s++) {
+ if (inblanks) {
+ if (strchr(delims, *s) == 0) {
+ ++count;
+ inblanks = false;
+ }
+ } else {
+ if (strchr(delims, *s) != 0) {
+ inblanks = true;
+ }
+ }
+ }
-L3: VOCAB=KTAB[I];
- if(INIT >= 0)VOCAB=MOD(VOCAB,1000);
- return(VOCAB);
+ return (count);
}
+static char *get_input(void) {
+ // Set up the prompt
+ char input_prompt[] = PROMPT;
+ if (!settings.prompt) {
+ input_prompt[0] = '\0';
+ }
+ // Print a blank line
+ printf("\n");
-#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;
-}
+ char *input;
+ for (;;) {
+ input = myreadline(input_prompt);
+
+ if (input == NULL) { // Got EOF; return with it.
+ return (input);
+ }
+ if (input[0] == '#') { // Ignore comments.
+ free(input);
+ continue;
+ }
+ // We have a 'normal' line; leave the loop.
+ break;
+ }
+ // Strip trailing newlines from the input
+ input[strcspn(input, "\n")] = 0;
+ add_history(input);
-#define DSTROY(OBJECT) fDSTROY(OBJECT)
-#undef JUGGLE
-void fJUGGLE(long OBJECT) {
-long I, J;
+ if (!isatty(0)) {
+ echo_input(stdout, input_prompt, input);
+ }
-/* 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. */
+ if (settings.logfp) {
+ echo_input(settings.logfp, "", input);
+ }
+ return (input);
+}
+
+bool silent_yes_or_no(void) {
+ bool outcome = false;
+
+ for (;;) {
+ char *reply = get_input();
+ if (reply == NULL) {
+ // LCOV_EXCL_START
+ // Should be unreachable. Reply should never be NULL
+ free(reply);
+ exit(EXIT_SUCCESS);
+ // LCOV_EXCL_STOP
+ }
+ if (strlen(reply) == 0) {
+ free(reply);
+ rspeak(PLEASE_ANSWER);
+ continue;
+ }
+
+ char *firstword = (char *)xcalloc(strlen(reply) + 1);
+ sscanf(reply, "%s", firstword);
+
+ free(reply);
+
+ for (int i = 0; i < (int)strlen(firstword); ++i) {
+ firstword[i] = tolower(firstword[i]);
+ }
+
+ int yes = strncmp("yes", firstword, sizeof("yes") - 1);
+ int y = strncmp("y", firstword, sizeof("y") - 1);
+ int no = strncmp("no", firstword, sizeof("no") - 1);
+ int n = strncmp("n", firstword, sizeof("n") - 1);
+
+ free(firstword);
+
+ if (yes == 0 || y == 0) {
+ outcome = true;
+ break;
+ } else if (no == 0 || n == 0) {
+ outcome = false;
+ break;
+ } else {
+ rspeak(PLEASE_ANSWER);
+ }
+ }
+ return (outcome);
+}
+
+bool yes_or_no(const char *question, const char *yes_response,
+ const char *no_response) {
+ /* Print message X, wait for yes/no answer. If yes, print Y and return
+ * true; if no, print Z and return false. */
+ bool outcome = false;
+
+ for (;;) {
+ speak(question);
+
+ char *reply = get_input();
+ if (reply == NULL) {
+ // LCOV_EXCL_START
+ // Should be unreachable. Reply should never be NULL
+ free(reply);
+ exit(EXIT_SUCCESS);
+ // LCOV_EXCL_STOP
+ }
+
+ if (strlen(reply) == 0) {
+ free(reply);
+ rspeak(PLEASE_ANSWER);
+ continue;
+ }
+
+ char *firstword = (char *)xcalloc(strlen(reply) + 1);
+ sscanf(reply, "%s", firstword);
+
+ free(reply);
+
+ for (int i = 0; i < (int)strlen(firstword); ++i) {
+ firstword[i] = tolower(firstword[i]);
+ }
+
+ int yes = strncmp("yes", firstword, sizeof("yes") - 1);
+ int y = strncmp("y", firstword, sizeof("y") - 1);
+ int no = strncmp("no", firstword, sizeof("no") - 1);
+ int n = strncmp("n", firstword, sizeof("n") - 1);
+
+ free(firstword);
+
+ if (yes == 0 || y == 0) {
+ speak(yes_response);
+ outcome = true;
+ break;
+ } else if (no == 0 || n == 0) {
+ speak(no_response);
+ outcome = false;
+ break;
+ } else {
+ rspeak(PLEASE_ANSWER);
+ }
+ }
- I=PLACE[OBJECT];
- J=FIXED[OBJECT];
- MOVE(OBJECT,I);
- MOVE(OBJECT+100,J);
- return;
+ return (outcome);
}
+/* Data structure routines */
-
-#define JUGGLE(OBJECT) fJUGGLE(OBJECT)
-#undef MOVE
-void fMOVE(long OBJECT, long WHERE) {
-long FROM;
-
-/* Place any object anywhere by picking it up and dropping it. May already be
- * toting, in which case the carry is a no-op. Mustn't pick up objects which
- * are not at any loc, since carry wants to remove objects from ATLOC chains. */
-
-
- if(OBJECT > 100) goto L1;
- FROM=PLACE[OBJECT];
- goto L2;
-L1: {long x = OBJECT-100; FROM=FIXED[x];}
-L2: if(FROM > 0 && FROM <= 300)CARRY(OBJECT,FROM);
- DROP(OBJECT,WHERE);
- return;
+static int get_motion_vocab_id(const char *word) {
+ // Return the first motion number that has 'word' as one of its words.
+ for (int i = 0; i < NMOTIONS; ++i) {
+ for (int j = 0; j < motions[i].words.n; ++j) {
+ if (strncasecmp(word, motions[i].words.strs[j],
+ TOKLEN) == 0 &&
+ (strlen(word) > 1 ||
+ strchr(ignore, word[0]) == NULL ||
+ !settings.oldstyle)) {
+ return (i);
+ }
+ }
+ }
+ // If execution reaches here, we didn't find the word.
+ return (WORD_NOT_FOUND);
+}
+
+static int get_object_vocab_id(const char *word) {
+ // Return the first object number that has 'word' as one of its words.
+ for (int i = 0; i < NOBJECTS + 1;
+ ++i) { // FIXME: the + 1 should go when 1-indexing for objects is
+ // removed
+ for (int j = 0; j < objects[i].words.n; ++j) {
+ if (strncasecmp(word, objects[i].words.strs[j],
+ TOKLEN) == 0) {
+ return (i);
+ }
+ }
+ }
+ // If execution reaches here, we didn't find the word.
+ return (WORD_NOT_FOUND);
+}
+
+static int get_action_vocab_id(const char *word) {
+ // Return the first motion number that has 'word' as one of its words.
+ for (int i = 0; i < NACTIONS; ++i) {
+ for (int j = 0; j < actions[i].words.n; ++j) {
+ if (strncasecmp(word, actions[i].words.strs[j],
+ TOKLEN) == 0 &&
+ (strlen(word) > 1 ||
+ strchr(ignore, word[0]) == NULL ||
+ !settings.oldstyle)) {
+ return (i);
+ }
+ }
+ }
+ // If execution reaches here, we didn't find the word.
+ return (WORD_NOT_FOUND);
}
+static bool is_valid_int(const char *str) {
+ /* Returns true if the string passed in is represents a valid integer,
+ * that could then be parsed by atoi() */
+ // Handle negative number
+ if (*str == '-') {
+ ++str;
+ }
+ // Handle empty string or just "-". Should never reach this
+ // point, because this is only used with transitive verbs.
+ if (!*str) {
+ return false; // LCOV_EXCL_LINE
+ }
-#define MOVE(OBJECT,WHERE) fMOVE(OBJECT,WHERE)
-#undef PUT
-long fPUT(long OBJECT, long WHERE, long PVAL) {
-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. */
-
+ // Check for non-digit chars in the rest of the string.
+ while (*str) {
+ if (!isdigit(*str)) {
+ return false;
+ } else {
+ ++str;
+ }
+ }
- MOVE(OBJECT,WHERE);
- PUT=(-1)-PVAL;
- return(PUT);
+ return true;
}
+static void get_vocab_metadata(const char *word, vocab_t *id,
+ word_type_t *type) {
+ /* Check for an empty string */
+ if (strncmp(word, "", sizeof("")) == 0) {
+ *id = WORD_EMPTY;
+ *type = NO_WORD_TYPE;
+ return;
+ }
+ vocab_t ref_num;
-#define PUT(OBJECT,WHERE,PVAL) fPUT(OBJECT,WHERE,PVAL)
-#undef CARRY
-void fCARRY(long OBJECT, long WHERE) {
-long TEMP;
-
-/* Start toting an object, removing it from the list of things at its former
- * location. Incr holdng unless it was already being toted. If OBJECT>100
- * (moving "fixed" second loc), don't change PLACE or HOLDNG. */
-
-
- if(OBJECT > 100) goto L5;
- if(PLACE[OBJECT] == -1)return;
- PLACE[OBJECT]= -1;
- HOLDNG=HOLDNG+1;
-L5: if(ATLOC[WHERE] != OBJECT) goto L6;
- ATLOC[WHERE]=LINK[OBJECT];
- return;
-L6: TEMP=ATLOC[WHERE];
-L7: if(LINK[TEMP] == OBJECT) goto L8;
- TEMP=LINK[TEMP];
- goto L7;
-L8: LINK[TEMP]=LINK[OBJECT];
- return;
-}
-
+ ref_num = get_motion_vocab_id(word);
+ // Second conjunct is because the magic-word placeholder is a bit
+ // special
+ if (ref_num != WORD_NOT_FOUND) {
+ *id = ref_num;
+ *type = MOTION;
+ return;
+ }
+ ref_num = get_object_vocab_id(word);
+ if (ref_num != WORD_NOT_FOUND) {
+ *id = ref_num;
+ *type = OBJECT;
+ return;
+ }
-#define CARRY(OBJECT,WHERE) fCARRY(OBJECT,WHERE)
-#undef DROP
-void fDROP(long OBJECT, long WHERE) {
-;
+ ref_num = get_action_vocab_id(word);
+ if (ref_num != WORD_NOT_FOUND && ref_num != PART) {
+ *id = ref_num;
+ *type = ACTION;
+ return;
+ }
-/* Place an object at a given loc, prefixing it onto the ATLOC list. Decr
- * HOLDNG if the object was being toted. */
+ // Check for the reservoir magic word.
+ if (strcasecmp(word, game.zzword) == 0) {
+ *id = PART;
+ *type = ACTION;
+ return;
+ }
+ // Check words that are actually numbers.
+ if (is_valid_int(word)) {
+ *id = WORD_EMPTY;
+ *type = NUMERIC;
+ return;
+ }
- 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;
+ *id = WORD_NOT_FOUND;
+ *type = NO_WORD_TYPE;
return;
}
+static void tokenize(char *raw, command_t *cmd) {
+ /*
+ * Be careful about modifying this. We do not want to nuke the
+ * the speech part or ID from the previous turn.
+ */
+ memset(&cmd->word[0].raw, '\0', sizeof(cmd->word[0].raw));
+ memset(&cmd->word[1].raw, '\0', sizeof(cmd->word[1].raw));
+
+ /* Bound prefix on the %s would be needed to prevent buffer
+ * overflow. but we shortstop this more simply by making each
+ * raw-input buffer as int as the entire input buffer. */
+ sscanf(raw, "%s%s", cmd->word[0].raw, cmd->word[1].raw);
+
+ /* (ESR) In oldstyle mode, simulate the uppercasing and truncating
+ * effect on raw tokens of packing them into sixbit characters, 5
+ * to a 32-bit word. This is something the FORTRAN version did
+ * because archaic FORTRAN had no string types. Don Wood's
+ * mechanical translation of 2.5 to C retained the packing and
+ * thus this misfeature.
+ *
+ * It's philosophically questionable whether this is the right
+ * thing to do even in oldstyle mode. On one hand, the text
+ * mangling was not authorial intent, but a result of limitations
+ * in their tools. On the other, not simulating this misbehavior
+ * goes against the goal of making oldstyle as accurate as
+ * possible an emulation of the original UI.
+ */
+ if (settings.oldstyle) {
+ cmd->word[0].raw[TOKLEN + TOKLEN] =
+ cmd->word[1].raw[TOKLEN + TOKLEN] = '\0';
+ for (size_t i = 0; i < strlen(cmd->word[0].raw); i++) {
+ cmd->word[0].raw[i] = toupper(cmd->word[0].raw[i]);
+ }
+ for (size_t i = 0; i < strlen(cmd->word[1].raw); i++) {
+ cmd->word[1].raw[i] = toupper(cmd->word[1].raw[i]);
+ }
+ }
+ /* populate command with parsed vocabulary metadata */
+ get_vocab_metadata(cmd->word[0].raw, &(cmd->word[0].id),
+ &(cmd->word[0].type));
+ get_vocab_metadata(cmd->word[1].raw, &(cmd->word[1].id),
+ &(cmd->word[1].type));
+ cmd->state = TOKENIZED;
+}
+
+bool get_command_input(command_t *command) {
+ /* Get user input on stdin, parse and map to command */
+ char inputbuf[LINESIZE];
+ char *input;
+
+ for (;;) {
+ input = get_input();
+ if (input == NULL) {
+ return false;
+ }
+ if (word_count(input) > 2) {
+ rspeak(TWO_WORDS);
+ free(input);
+ continue;
+ }
+ if (strcmp(input, "") != 0) {
+ break;
+ }
+ free(input);
+ }
-#define DROP(OBJECT,WHERE) fDROP(OBJECT,WHERE)
-#undef ATDWRF
-long fATDWRF(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;
- for (I=1; I<=5; I++) {
- if(DLOC[I] == WHERE) goto L2;
- if(DLOC[I] != 0)ATDWRF=0;
- } /* end loop */
- return(ATDWRF);
-
-L2: ATDWRF=I;
- return(ATDWRF);
-}
-
-
-
-
-#define ATDWRF(WHERE) fATDWRF(WHERE)
-
-
-
-/* Utility routines (SETBIT, TSTBIT, set_seed, get_next_lcg_value,
- * randrange, RNDVOC, BUG) */
-
-#undef SETBIT
-long fSETBIT(long BIT) {
-long I, SETBIT;
-
-/* Returns 2**bit for use in constructing bit-masks. */
-
-
- SETBIT=1;
- if(BIT <= 0)return(SETBIT);
- for (I=1; I<=BIT; I++) {
- SETBIT=SETBIT+SETBIT;
- } /* end loop */
- return(SETBIT);
+ strncpy(inputbuf, input, LINESIZE - 1);
+ free(input);
+
+ tokenize(inputbuf, command);
+
+#ifdef GDEBUG
+ /* Needs to stay synced with enum word_type_t */
+ const char *types[] = {"NO_WORD_TYPE", "MOTION", "OBJECT", "ACTION",
+ "NUMERIC"};
+ /* needs to stay synced with enum speechpart */
+ const char *roles[] = {"unknown", "intransitive", "transitive"};
+ printf(
+ "Command: role = %s type1 = %s, id1 = %d, type2 = %s, id2 = %d\n",
+ roles[command->part], types[command->word[0].type],
+ command->word[0].id, types[command->word[1].type],
+ command->word[1].id);
+#endif
+
+ command->state = GIVEN;
+ return true;
+}
+
+void clear_command(command_t *cmd) {
+ /* Resets the state of the command to empty */
+ cmd->verb = ACT_NULL;
+ cmd->part = unknown;
+ game.oldobj = cmd->obj;
+ cmd->obj = NO_OBJECT;
+ cmd->state = EMPTY;
+}
+
+void juggle(obj_t 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. */
+ loc_t i, j;
+
+ i = game.objects[object].place;
+ j = game.objects[object].fixed;
+ move(object, i);
+ move(object + NOBJECTS, j);
+}
+
+void move(obj_t object, loc_t 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. */
+ loc_t from;
+
+ if (object > NOBJECTS) {
+ from = game.objects[object - NOBJECTS].fixed;
+ } else {
+ from = game.objects[object].place;
+ }
+ /* (ESR) Used to check for !SPECIAL(from). I *think* that was wrong...
+ */
+ if (from != LOC_NOWHERE && from != CARRIED) {
+ carry(object, from);
+ }
+ drop(object, where);
+}
+
+void put(obj_t object, loc_t where, int 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);
+ /* (ESR) Read this in combination with the macro defintions in advebt.h.
+ */
+ game.objects[object].prop = PROP_STASHIFY(pval);
+#ifdef PROP_SET_SEEN
+ PROP_SET_SEEN(object);
+#endif
+}
+
+void carry(obj_t object, loc_t 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. */
+ int temp;
+
+ if (object <= NOBJECTS) {
+ if (game.objects[object].place == CARRIED) {
+ return;
+ }
+ game.objects[object].place = CARRIED;
+
+ /*
+ * Without this conditional your inventory is overcounted
+ * when you pick up the bird while it's caged. This fixes
+ * a cosmetic bug in the original.
+ *
+ * Possibly this check should be skipped whwn oldstyle is on.
+ */
+ if (object != BIRD) {
+ ++game.holdng;
+ }
+ }
+ if (game.locs[where].atloc == object) {
+ game.locs[where].atloc = game.link[object];
+ return;
+ }
+ temp = game.locs[where].atloc;
+ while (game.link[temp] != object) {
+ temp = game.link[temp];
+ }
+ game.link[temp] = game.link[object];
}
-
-
-#define SETBIT(BIT) fSETBIT(BIT)
-#undef TSTBIT
-long fTSTBIT(long MASK, long BIT) {
-long TSTBIT;
-
-/* Returns true if the specified bit is set in the mask. */
-
-
- TSTBIT=MOD(MASK/SETBIT(BIT),2) != 0;
- return(TSTBIT);
+void drop(obj_t object, loc_t where) {
+ /* Place an object at a given loc, prefixing it onto the game atloc
+ * list. Decr game.holdng if the object was being toted. No state
+ * change on the object. */
+ if (object > NOBJECTS) {
+ game.objects[object - NOBJECTS].fixed = where;
+ } else {
+ if (game.objects[object].place == CARRIED) {
+ if (object != BIRD) {
+ /* The bird has to be weightless. This ugly
+ * hack (and the corresponding code in the carry
+ * function) brought to you by the fact that
+ * when the bird is caged, we need to be able to
+ * either 'take bird' or 'take cage' and have
+ * the right thing happen.
+ */
+ --game.holdng;
+ }
+ }
+ game.objects[object].place = where;
+ }
+ if (where == LOC_NOWHERE || where == CARRIED) {
+ return;
+ }
+ game.link[object] = game.locs[where].atloc;
+ game.locs[where].atloc = object;
}
+int atdwrf(loc_t 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). */
+ int at;
-
-#define TSTBIT(MASK,BIT) fTSTBIT(MASK,BIT)
-
-void set_seed(long seedval)
-{
- lcgstate.x = (unsigned long) seedval % lcgstate.m;
+ at = 0;
+ if (game.dflag < 2) {
+ return at;
+ }
+ at = -1;
+ for (int i = 1; i <= NDWARVES - 1; i++) {
+ if (game.dwarves[i].loc == where) {
+ return i;
+ }
+ if (game.dwarves[i].loc != 0) {
+ at = 0;
+ }
+ }
+ return at;
}
-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);
-}
+/* Utility routines (setbit, tstbit, set_seed, get_next_lcg_value,
+ * randrange) */
-long randrange(long range)
-{
- /* Return a random integer from [0, range). */
- long result = range * get_next_lcg_value() / lcgstate.m;
- return(result);
+int setbit(int bit) {
+ /* Returns 2**bit for use in constructing bit-masks. */
+ return (1L << bit);
}
-#undef RNDVOC
-long fRNDVOC(long CHAR, long FORCE) {
-long DIV, I, J, RNDVOC;
-
-/* Searches the vocabulary for a word whose second character is char, and
- * changes that word such that each of the other four characters is a
- * random letter. If force is non-zero, it is used as the new word.
- * Returns the new word. */
-
-
- RNDVOC=FORCE;
- if(RNDVOC != 0) goto L3;
- for (I=1; I<=5; I++) {
- J=11+randrange(26);
- if(I == 2)J=CHAR;
- RNDVOC=RNDVOC*64+J;
- } /* end loop */
-L3: J=10000;
- DIV=64L*64L*64L;
- for (I=1; I<=TABSIZ; I++) {
- J=J+7;
- if(MOD((ATAB[I]-J*J)/DIV,64L) == CHAR) goto L8;
- /*etc*/ ;
- } /* end loop */
- BUG(5);
-
-L8: ATAB[I]=RNDVOC+J*J;
- return(RNDVOC);
+bool tstbit(int mask, int bit) {
+ /* Returns true if the specified bit is set in the mask. */
+ return (mask & (1 << bit)) != 0;
}
-
-
-#define RNDVOC(CHAR,FORCE) fRNDVOC(CHAR,FORCE)
-#undef BUG
-void fBUG(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);
+void set_seed(int32_t seedval) {
+ /* Set the LCG1 seed */
+ game.lcg_x = seedval % LCG_M;
+ if (game.lcg_x < 0) {
+ game.lcg_x = LCG_M + game.lcg_x;
+ }
+ // once seed is set, we need to generate the Z`ZZZ word
+ for (int i = 0; i < 5; ++i) {
+ game.zzword[i] = 'A' + randrange(26);
+ }
+ game.zzword[1] = '\''; // force second char to apostrophe
+ game.zzword[5] = '\0';
}
-
-
-
-
-/* Machine dependent routines (MAPLIN, TYPE, MPINIT, SAVEIO) */
-
-#define BUG(NUM) fBUG(NUM)
-#undef MAPLIN
-void fMAPLIN(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 && SETUP && OPENED == stdin)
- fputs("> ", stdout);
- do {
- IGNORE(fgets(rawbuf,sizeof(rawbuf)-1,OPENED));
- } while
- (!feof(OPENED) && rawbuf[0] == '#');
- if (feof(OPENED)) {
- if (logfp && OPENED == stdin)
- fclose(logfp);
- } else {
- if (logfp && OPENED == stdin)
- IGNORE(fputs(rawbuf, logfp));
- else if (!isatty(0))
- IGNORE(fputs(rawbuf, stdout));
- strcpy(INLINE+1, rawbuf);
- LNLENG=0;
- for (I=1; I<=sizeof(INLINE) && INLINE[I]!=0; I++) {
- VAL=INLINE[I]+1;
- INLINE[I]=MAP1[VAL];
- if(INLINE[I] != 0)LNLENG=I;
- } /* end loop */
- LNPOSN=1;
+static int32_t get_next_lcg_value(void) {
+ /* Return the LCG's current value, and then iterate it. */
+ int32_t old_x = game.lcg_x;
+ game.lcg_x = (LCG_A * game.lcg_x + LCG_C) % LCG_M;
+ if (settings.debug) {
+ printf("# random %d\n", old_x); // LCOV_EXCL_LINE
}
+ return old_x;
}
-#define MAPLIN(FIL) fMAPLIN(FIL)
-
-#undef TYPE
-void fTYPE(void) {
-long I, VAL;
-
-/* Type the first "LNLENG" characters stored in inline, mapping them
- * from integers to text per the rules described above. INLINE(I),
- * I=1,LNLENG may be changed by this routine. */
-
-
- if(LNLENG != 0) goto L10;
- 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;
+int32_t randrange(int32_t range) {
+ /* Return a random integer from [0, range). */
+ return range * get_next_lcg_value() / LCG_M;
}
-
-
-#define TYPE() fTYPE()
-#undef MPINIT
-void fMPINIT(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;
+// LCOV_EXCL_START
+void bug(enum bugtype num, const char *error_string) {
+ fprintf(stderr, "Fatal error %d, %s.\n", num, error_string);
+ exit(EXIT_FAILURE);
}
+// LCOV_EXCL_STOP
-
-
-#define MPINIT() fMPINIT()
-#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 state_change(obj_t obj, int state) {
+ /* Object must have a change-message list for this to be useful; only
+ * some do */
+ game.objects[obj].prop = state;
+ pspeak(obj, change, true, state);
}
-
-
-void DATIME(long* D, long* T) {
- struct timeval tv;
- gettimeofday(&tv, NULL);
- *D = (long) tv.tv_sec;
- *T = (long) tv.tv_usec;
-}
-long fIABS(N)long N; {return(N<0? -N : N);}
-long fMOD(N,M)long N, M; {return(N%M);}
+/* end */
projects / open-adventure.git / blobdiff