#include <stdlib.h>
#include <stdio.h>
#include <string.h>
+#include <stdarg.h>
#include <sys/time.h>
+#include <ctype.h>
+#include <editline/readline.h>
+
#include "advent.h"
-#include "funcs.h"
-#include "database.h"
-
-/* hack to ignore GCC Unused Result */
-#define IGNORE(r) do{if(r){}}while(0)
-
-/* I/O routines (SPEAK, PSPEAK, RSPEAK, SETPRM, GETIN, YES) */
-
-void SPEAK(vocab_t N) {
-long BLANK, CASE, I, K, L, NEG, NPARMS, PARM, PRMTYP, STATE;
-
-/* Print the message which starts at LINES(N). Precede it with a blank line
- * unless game.blklin is false. */
-
- if(N == 0)return;
- BLANK=game.blklin;
- K=N;
- NPARMS=1;
-L10: L=labs(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=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;
- TYPE();
- K=L+1;
- if(LINES[K] >= 0) goto L10;
- return;
-}
-
-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;
- }
-L9: SPEAK(M);
- return;
-}
-void RSPEAK(vocab_t i)
-/* Print the i-th "random" message (section 6 of database). */
+#include "dungeon.h"
+
+static void* xmalloc(size_t size)
{
- if (i != 0)
- SPEAK(RTEXT[i]);
+ void* ptr = malloc(size);
+ 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);
}
-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). */
+void packed_to_token(long packed, char token[TOKLEN + 1])
{
- if(first >= MAXPARMS)
- BUG(29);
- else {
- PARMS[first] = p1;
- PARMS[first+1] = p2;
+ // The advent->ascii mapping.
+ const char advent_to_ascii[] = {
+ ' ', '!', '"', '#', '$', '%', '&', '\'',
+ '(', ')', '*', '+', ',', '-', '.', '/',
+ '0', '1', '2', '3', '4', '5', '6', '7',
+ '8', '9', ':', ';', '<', '=', '>', '?',
+ '@', 'A', 'B', 'C', 'D', 'E', 'F', 'G',
+ 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O',
+ 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W',
+ 'X', 'Y', 'Z', '\0', '\0', '\0', '\0', '\0',
+ };
+
+ // Unpack and map back to ASCII.
+ for (int i = 0; i < 5; ++i) {
+ char advent = (packed >> i * 6) & 63;
+ token[i] = advent_to_ascii[(int) advent];
}
-}
-#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;
+ // Ensure the last character is \0.
+ token[5] = '\0';
-/* 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. */
+ // Replace trailing whitespace with \0.
+ for (int i = 4; i >= 0; --i) {
+ if (token[i] == ' ' ||
+ token[i] == '\t')
+ token[i] = '\0';
+ else
+ break;
+ }
+}
+long token_to_packed(const char token[])
+{
+ const char ascii_to_advent[] = {
+ 63, 63, 63, 63, 63, 63, 63, 63,
+ 63, 63, 63, 63, 63, 63, 63, 63,
+ 63, 63, 63, 63, 63, 63, 63, 63,
+ 63, 63, 63, 63, 63, 63, 63, 63,
+
+ 0, 1, 2, 3, 4, 5, 6, 7,
+ 8, 9, 10, 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, 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, 63,
+
+ 63, 63, 63, 63, 63, 63, 63, 63,
+ 63, 63, 63, 63, 63, 63, 63, 63,
+ 63, 63, 63, 63, 63, 63, 63, 63,
+ 63, 63, 63, 63, 63, 63, 63, 63,
+ };
+
+ size_t t_len = strlen(token);
+ if (t_len > TOKLEN)
+ t_len = TOKLEN;
+ long packed = 0;
+ for (size_t i = 0; i < t_len; ++i) {
+ char mapped = ascii_to_advent[(int) toupper(token[i])];
+ packed |= (mapped << (6 * i));
+ }
+ return (packed);
+}
-L10: if(game.blklin)TYPE0();
- MAPLIN(input);
- if (feof(input))
- return false;
- WORD1=GETTXT(true,true,true);
- if(game.blklin && WORD1 < 0) goto L10;
- WORD1X=GETTXT(false,true,true);
-L12: JUNK=GETTXT(false,true,true);
- if(JUNK > 0) goto L12;
- WORD2=GETTXT(true,true,true);
- 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;
+void tokenize(char* raw, struct command_t *cmd)
+{
+ memset(cmd, '\0', sizeof(struct command_t));
+
+ /* 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 long as the enrire inout buffer. */
+ sscanf(raw, "%s%s", cmd->raw1, cmd->raw2);
+
+ // pack the substrings
+ cmd->wd1 = token_to_packed(cmd->raw1);
+ cmd->wd2 = token_to_packed(cmd->raw2);
+
+ /* (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
+ * becuse 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->raw1[TOKLEN + TOKLEN] = cmd->raw2[TOKLEN + TOKLEN] = '\0';
+ for (size_t i = 0; i < strlen(cmd->raw1); i++)
+ cmd->raw1[i] = toupper(cmd->raw1[i]);
+ for (size_t i = 0; i < strlen(cmd->raw2); i++)
+ cmd->raw2[i] = toupper(cmd->raw2[i]);
+ }
}
+/* Hide the fact that wods are corrently packed longs */
+void wordclear(token_t *v)
+{
+ *v = 0;
+}
-#undef WORD1
-#undef WORD1X
-#undef WORD2
-#undef WORD2X
-#define GETIN(SRC,WORD1,WORD1X,WORD2,WORD2X) fGETIN(SRC,&WORD1,&WORD1X,&WORD2,&WORD2X)
+/* I/O routines (speak, pspeak, rspeak, sspeak, get_input, yes) */
-long YES(FILE *input, vocab_t X, vocab_t Y, vocab_t Z) {
-token_t YEAH, REPLY, JUNK1, JUNK2, JUNK3;
+void vspeak(const char* msg, bool blank, va_list ap)
+{
+ // 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");
+
+ int msglen = strlen(msg);
+
+ // Rendered string
+ ssize_t size = 2000; /* msglen > 50 ? msglen*2 : 100; */
+ char* rendered = xmalloc(size);
+ char* renderp = rendered;
+
+ // Handle format specifiers (including the custom %C, %L, %S) by
+ // adjusting the parameter accordingly, and replacing the
+ // specifier with %s.
+ long previous_arg = 0;
+ 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 {
+ long arg = va_arg(ap, long);
+ if (arg == -1)
+ arg = 0; // LCOV_EXCL_LINE - don't think we can get here.
+ i++;
+ // 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] == 'd') {
+ int ret = snprintf(renderp, size, "%ld", arg);
+ if (ret < size) {
+ renderp += ret;
+ size -= ret;
+ }
+ }
+
+ // Unmodified string specifier.
+ if (msg[i] == 's') {
+ packed_to_token(arg, renderp); /* unpack directly to destination */
+ size_t len = strlen(renderp);
+ renderp += len;
+ size -= len;
+ }
+
+ // Singular/plural specifier.
+ if (msg[i] == 'S') {
+ if (previous_arg > 1) { // look at the *previous* parameter (which by necessity must be numeric)
+ *renderp++ = 's';
+ size--;
+ }
+ }
+
+ /* Version specifier */
+ if (msg[i] == 'V') {
+ strcpy(renderp, VERSION);
+ size_t len = strlen(VERSION);
+ renderp += len;
+ size -= len;
+ }
+
+ previous_arg = arg;
+ }
+ }
+ *renderp = 0;
-/* Print message X, wait for yes/no answer. If yes, print Y and return true;
- * if no, print Z and return false. */
+ // Print the message.
+ printf("%s\n", rendered);
-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: YEAH=true;
- RSPEAK(Y);
- return(YEAH);
-L20: YEAH=false;
- RSPEAK(Z);
- return(YEAH);
-}
-
-
-/* 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) {
-/* 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;
- }
+ free(rendered);
+}
- TEXT=TEXT+current-63;
- SPLITTING = -1;
- LNPOSN=LNPOSN+1;
- }
-
- return(TEXT);
-}
-
-token_t MAKEWD(long LETTRS) {
-long I, L, WORD;
-
-/* Combine TOKLEN (currently 5) uppercase letters (represented by
- * pairs of decimal digits in lettrs) to form a 30-bit value matching
- * the one that GETTXT would return given those characters plus
- * trailing blanks. Caution: lettrs will overflow 31 bits if
- * 5-letter word starts with V-Z. As a kludgey workaround, you can
- * increment a letter by 5 by adding 50 to the next pair of
- * digits. */
-
- WORD=0;
- I=1;
- 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);
-}
-
-
-#define STATE (*sTATE)
-void fPUTTXT(token_t WORD, long *sTATE, long CASE) {
-long ALPH1, ALPH2, BYTE, DIV, I, W;
-
-/* Unpack the 30-bit value in word to obtain up to TOKLEN (currently
- * 5) integer-encoded chars, and store them in inline starting at
- * LNPOSN. If LNLENG>=LNPOSN, shift existing characters to the right
- * to make room. STATE will be zero when puttxt is called with the
- * first of a sequence of words, but is thereafter unchanged by the
- * caller, so PUTTXT can use it to maintain state across calls.
- * LNPOSN and LNLENG are incremented by the number of chars stored.
- * If CASE=1, all letters are made uppercase; if -1, lowercase; if 0,
- * as is. any other value for case is the same as 0 but also causes
- * trailing blanks to be included (in anticipation of subsequent
- * additional text). */
-
-
- ALPH1=13*CASE+24;
- ALPH2=26*labs(CASE)+ALPH1;
- if(labs(CASE) > 1)ALPH1=ALPH2;
-/* ALPH1&2 DEFINE RANGE OF WRONG-CASE CHARS, 11-36 OR 37-62 OR EMPTY. */
- DIV=64L*64L*64L*64L;
- W=WORD;
- /* 18 */ for (I=1; I<=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;
- 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)
-
-void SHFTXT(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;
-}
-
-
-void TYPE0(void)
-/* Type a blank line. This procedure is provided as a convenience for callers
- * who otherwise have no use for MAPCOM. */
+void speak(const char* msg, ...)
{
- long temp;
-
- temp=LNLENG;
- LNLENG=0;
- TYPE();
- LNLENG=temp;
- return;
+ va_list ap;
+ va_start(ap, msg);
+ vspeak(msg, true, ap);
+ va_end(ap);
}
-/* Suspend/resume I/O routines (SAVWDS, SAVARR, SAVWRD) */
+void sspeak(const long msg, ...)
+{
+ 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, int skip, bool blank, ...)
+/* Find the skip+1st message from msg and print it. Modes are:
+ * feel = for inventory, what you can touch
+ * look = the long 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, blank);
+ 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);
+}
-#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. */
+void rspeak(vocab_t i, ...)
+/* Print the i-th "random" message (section 6 of database). */
{
- SAVWRD(0,(*W1));
- SAVWRD(0,(*W2));
- SAVWRD(0,(*W3));
- SAVWRD(0,(*W4));
- SAVWRD(0,(*W5));
- SAVWRD(0,(*W6));
- SAVWRD(0,(*W7));
- return;
+ va_list ap;
+ va_start(ap, i);
+ vspeak(arbitrary_messages[i], true, ap);
+ va_end(ap);
}
-#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. */
+void echo_input(FILE* destination, const char* input_prompt, const char* input)
{
- long i;
+ size_t len = strlen(input_prompt) + strlen(input) + 1;
+ char* prompt_and_input = (char*) xmalloc(len);
+ strcpy(prompt_and_input, input_prompt);
+ strcat(prompt_and_input, input);
+ fprintf(destination, "%s\n", prompt_and_input);
+ free(prompt_and_input);
+}
- for (i=1; i<=n; i++) {
- SAVWRD(0,arr[i]);
+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;
+ }
+ }
+
+ return (count);
+}
+
+char* get_input()
+{
+ // Set up the prompt
+ char input_prompt[] = "> ";
+ if (!settings.prompt)
+ input_prompt[0] = '\0';
+
+ // Print a blank line
+ printf("\n");
+
+ char* input;
+ while (true) {
+ input = readline(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;
}
- 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;
+ // Strip trailing newlines from the input
+ input[strcspn(input, "\n")] = 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. */
+ add_history(input);
- 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;
+ if (!isatty(0))
+ echo_input(stdout, input_prompt, input);
-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;
+ if (settings.logfp)
+ echo_input(settings.logfp, "", input);
-L15: SAVEIO(1,true,BUF);
- HASH=MOD(1234L*5678L-BUF[0],1048576L);
- goto L13;
+ return (input);
+}
-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;
+bool silent_yes()
+{
+ 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*) xmalloc(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(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*) xmalloc(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);
+ }
+ return (outcome);
+}
+
+/* Data structure routines */
+
+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 (strcasecmp(word, motions[i].words.strs[j]) == 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);
+}
+
+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 (strcasecmp(word, objects[i].words.strs[j]) == 0)
+ return (i);
+ }
+ }
+ // If execution reaches here, we didn't find the word.
+ return (WORD_NOT_FOUND);
+}
+
+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 (strcasecmp(word, actions[i].words.strs[j]) == 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);
+}
-/* Data struc. routines (VOCAB, DSTROY, JUGGLE, MOVE, PUT, CARRY, DROP, ATDWRF)
- */
+int get_special_vocab_id(const char* word)
+// Return the first special number that has 'word' as one of its words.
+{
+ for (int i = 0; i < NSPECIALS; ++i) {
+ for (int j = 0; j < specials[i].words.n; ++j) {
+ if (strcasecmp(word, specials[i].words.strs[j]) == 0)
+ return (i);
+ }
+ }
+ // If execution reaches here, we didn't find the word.
+ return (WORD_NOT_FOUND);
+}
-#undef WORD
-#define SAVWRD(OP,WORD) fSAVWRD(OP,&WORD)
+void get_vocab_metadata(const char* word, long* id, enum wordtype* type)
+{
+ /* Check for an empty string */
+ if (strncmp(word, "", sizeof("")) == 0) {
+ *id = WORD_EMPTY;
+ *type = NO_WORD_TYPE;
+ return;
+ }
-long VOCAB(long ID, long INIT) {
-long I, LEXEME;
+ long ref_num;
-/* 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. */
+ ref_num = get_motion_vocab_id(word);
+ if (ref_num != WORD_NOT_FOUND) {
+ *id = ref_num;
+ *type = MOTION;
+ return;
+ }
- /* 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);
+ ref_num = get_object_vocab_id(word);
+ if (ref_num != WORD_NOT_FOUND) {
+ *id = ref_num;
+ *type = OBJECT;
+ return;
+ }
-L2: LEXEME= -1;
- if(INIT < 0)return(LEXEME);
- BUG(5);
+ ref_num = get_action_vocab_id(word);
+ if (ref_num != WORD_NOT_FOUND) {
+ *id = ref_num;
+ *type = ACTION;
+ return;
+ }
-L3: LEXEME=KTAB[I];
- if(INIT >= 0)LEXEME=MOD(LEXEME,1000);
- return(LEXEME);
-}
+ ref_num = get_special_vocab_id(word);
+ if (ref_num != WORD_NOT_FOUND) {
+ *id = ref_num;
+ *type = SPECIAL;
+ return;
+ }
-void DSTROY(long OBJECT) {
-/* Permanently eliminate "OBJECT" by moving to a non-existent location. */
+ // Check for the reservoir magic word.
+ if (strcasecmp(word, game.zzword) == 0) {
+ *id = PART;
+ *type = ACTION;
+ return;
+ }
- MOVE(OBJECT,0);
- return;
+ *id = WORD_NOT_FOUND;
+ *type = NO_WORD_TYPE;
+ return;
}
-void JUGGLE(long OBJECT) {
-long I, J;
-
+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.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(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. */
+{
+ 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];
+ /* (ESR) Used to check for !SPECIAL(from). I *think* that was wrong... */
+ if (from != LOC_NOWHERE && from != CARRIED)
+ carry(object, from);
+ drop(object, where);
}
-long PUT(long OBJECT, long WHERE, long PVAL) {
-long X;
-
-/* PUT is the same as MOVE, except it returns a value used to set up the
+long put(obj_t object, loc_t 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 STASHED(pval);
}
-void CARRY(long OBJECT, long WHERE) {
-long TEMP;
-
+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
+ * 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;
- 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];
- return;
-}
-
-void DROP(long object, long where)
+ if (object <= NOBJECTS) {
+ if (game.place[object] == CARRIED)
+ return;
+ game.place[object] = CARRIED;
+ ++game.holdng;
+ }
+ 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(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. */
{
- if(object > NOBJECTS) goto L1;
- if(game.place[object] == -1)
- game.holdng=game.holdng-1;
- game.place[object]=where;
- goto L2;
-L1: game.fixed[object-NOBJECTS]=where;
-L2: if(where <= 0)
- return;
- game.link[object]=game.atloc[where];
- game.atloc[where]=object;
+ if (object > NOBJECTS)
+ game.fixed[object - NOBJECTS] = where;
+ else {
+ if (game.place[object] == CARRIED)
+ --game.holdng;
+ game.place[object] = where;
+ }
+ if (where == LOC_NOWHERE ||
+ where == CARRIED)
+ return;
+ game.link[object] = game.atloc[where];
+ game.atloc[where] = object;
}
-long ATDWRF(long where)
+long 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). */
{
- long at, i;
-
- at=0;
- if(game.dflag < 2)
- return(at);
- at= -1;
- for (i=1; i<=NDWARVES-1; i++) {
- if(game.dloc[i] == where)
- return i;
- if(game.dloc[i] != 0)
- at=0;
- } /* end loop */
- return(at);
+ long at;
+
+ at = 0;
+ if (game.dflag < 2)
+ return (at);
+ at = -1;
+ for (long 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) */
+/* Utility routines (setbit, tstbit, set_seed, get_next_lcg_value,
+ * randrange) */
-long SETBIT(long bit)
+long setbit(long bit)
/* Returns 2**bit for use in constructing bit-masks. */
{
- return(2 << bit);
+ return (1L << bit);
}
-bool TSTBIT(long mask, int bit)
+bool tstbit(long mask, int bit)
/* Returns true if the specified bit is set in the mask. */
{
return (mask & (1 << bit)) != 0;
void set_seed(long seedval)
/* Set the LCG seed */
{
- lcgstate.x = (unsigned long) seedval % lcgstate.m;
+ game.lcg_x = (unsigned long) seedval % game.lcg_m;
+
+ // once seed is set, we need to generate the Z`ZZZ word
+ make_zzword(game.zzword);
}
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;
+ unsigned long old_x = game.lcg_x;
+ game.lcg_x = (game.lcg_a * game.lcg_x + game.lcg_c) % game.lcg_m;
return old_x;
}
long randrange(long range)
/* Return a random integer from [0, range). */
{
- return range * get_next_lcg_value() / lcgstate.m;
+ return range * get_next_lcg_value() / game.lcg_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. */
+void make_zzword(char zzword[TOKLEN + 1])
{
- 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, MPINIT, SAVEIO) */
-
-void MAPLIN(FILE *OPENED)
-{
- long I, VAL;
-
- /* Read a line of input, from the specified input source,
- * translate the chars to integers in the range 0-126 and store
- * them in the common array "INLINE". Integer values are as follows:
- * 0 = space [ASCII CODE 40 octal, 32 decimal]
- * 1-2 = !" [ASCII 41-42 octal, 33-34 decimal]
- * 3-10 = '()*+,-. [ASCII 47-56 octal, 39-46 decimal]
- * 11-36 = upper-case letters
- * 37-62 = lower-case letters
- * 63 = percent (%) [ASCII 45 octal, 37 decimal]
- * 64-73 = digits, 0 through 9
- * Remaining characters can be translated any way that is convenient;
- * The "TYPE" routine below is used to map them back to characters when
- * necessary. The above mappings are required so that certain special
- * characters are known to fit in 6 bits and/or can be easily spotted.
- * Array elements beyond the end of the line should be filled with 0,
- * and LNLENG should be set to the index of the last character.
- *
- * If the data file uses a character other than space (e.g., tab) to
- * separate numbers, that character should also translate to 0.
- *
- * This procedure may use the map1,map2 arrays to maintain static data for
- * the mapping. MAP2(1) is set to 0 when the program starts
- * and is not changed thereafter unless the routines on this page choose
- * to do so. */
-
- if(MAP2[1] == 0)MPINIT();
-
- if (!oldstyle && OPENED == stdin)
- fputs("> ", stdout);
- do {
- IGNORE(fgets(rawbuf,sizeof(rawbuf)-1,OPENED));
- } while
- (!feof(OPENED) && rawbuf[0] == '#');
- if (feof(OPENED)) {
- if (logfp && OPENED == stdin)
- fclose(logfp);
- } else {
- if (logfp && OPENED == stdin)
- IGNORE(fputs(rawbuf, logfp));
- else if (!isatty(0))
- IGNORE(fputs(rawbuf, stdout));
- strcpy(INLINE+1, rawbuf);
- LNLENG=0;
- for (I=1; I<=(long)sizeof(INLINE) && INLINE[I]!=0; I++) {
- VAL=INLINE[I]+1;
- INLINE[I]=MAP1[VAL];
- if(INLINE[I] != 0)LNLENG=I;
- } /* end loop */
- LNPOSN=1;
+ for (int i = 0; i < 5; ++i) {
+ zzword[i] = 'A' + randrange(26);
}
+ zzword[1] = '\''; // force second char to apostrophe
+ zzword[5] = '\0';
}
-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. */
+// LCOV_EXCL_START
+void bug(enum bugtype num, const char *error_string)
{
- long i;
-
- if(LNLENG == 0) {
- printf("\n");
- return;
- }
-
- if(MAP2[1] == 0)
- MPINIT();
- for (i=1; i<=LNLENG; i++) {
- INLINE[i]=MAP2[INLINE[i]+1];
- }
- INLINE[LNLENG+1]=0;
- printf("%s\n", INLINE+1);
- return;
+ fprintf(stderr, "Fatal error %d, %s.\n", num, error_string);
+ exit(EXIT_FAILURE);
}
+// LCOV_EXCL_STOP
-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;
-
-}
+/* end */
-void DATIME(long* D, long* T)
+void state_change(obj_t obj, long state)
+/* Object must have a change-message list for this to be useful; only some do */
{
- struct timeval tv;
- gettimeofday(&tv, NULL);
- *D = (long) tv.tv_sec;
- *T = (long) tv.tv_usec;
+ game.prop[obj] = state;
+ pspeak(obj, change, state, true);
}
-long MOD(N,M)long N, M; {return(N%M);}
+/* end */
projects / open-adventure.git / blobdiff