11 #include "linenoise/linenoise.h"
14 void* xmalloc(size_t size)
16 void* ptr = malloc(size);
18 fprintf(stderr, "Out of memory!\n");
24 char* xstrdup(const char* s)
26 char* ptr = strdup(s);
28 fprintf(stderr, "Out of memory!\n");
34 void packed_to_token(long packed, char token[6])
36 // Unpack and map back to ASCII.
37 for (int i = 0; i < 5; ++i) {
38 char advent = (packed >> i * 6) & 63;
39 token[4 - i] = advent_to_ascii[(int) advent];
42 // Ensure the last character is \0.
45 // Replace trailing whitespace with \0.
46 for (int i = 4; i >= 0; --i) {
47 if (token[i] == ' ' || token[i] == '\t')
54 void token_to_packed(char token[6], long* packed)
57 for (size_t i = 0; i < 5; ++i)
59 if (token[4 - i] == '\0')
61 char mapped = ascii_to_advent[(int) token[4 - i]];
62 *packed |= (mapped << (6 * i));
66 /* Hide the fact that wods are corrently packed longs */
68 bool wordeq(token_t a, token_t b)
73 bool wordempty(token_t a)
78 void wordclear(token_t *v)
83 /* I/O routines (speak, pspeak, rspeak, GETIN, YES) */
85 void vspeak(const char* msg, va_list ap)
87 // Do nothing if we got a null pointer.
91 // Do nothing if we got an empty string.
95 // Print a newline if the global game.blklin says to.
96 if (game.blklin == true)
99 int msglen = strlen(msg);
102 ssize_t size = 2000; /* msglen > 50 ? msglen*2 : 100; */
103 char* rendered = xmalloc(size);
104 char* renderp = rendered;
106 // Handle format specifiers (including the custom %C, %L, %S) by adjusting the parameter accordingly, and replacing the specifier with %s.
107 long previous_arg = 0;
108 for (int i = 0; i < msglen; i++) {
113 long arg = va_arg(ap, long);
115 // 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.
117 int ret = snprintf(renderp, size, "%ld", arg);
124 // Unmodified string specifier.
126 packed_to_token(arg, renderp); /* unpack directly to destination */
127 size_t len = strlen(renderp);
132 // Singular/plural specifier.
134 if (previous_arg > 1) { // look at the *previous* parameter (which by necessity must be numeric)
140 // All-lowercase specifier.
141 if (msg[i] == 'L' || msg[i] == 'C') {
142 packed_to_token(arg, renderp); /* unpack directly to destination */
143 int len = strlen(renderp);
144 for (int j = 0; j < len; ++j) {
145 renderp[j] = tolower(renderp[j]);
147 if (msg[i] == 'C') // First char uppercase, rest lowercase.
148 renderp[0] = toupper(renderp[0]);
158 // Print the message.
159 printf("%s\n", rendered);
164 void speak(const char* msg, ...)
172 void pspeak(vocab_t msg, int skip, ...)
173 /* Find the skip+1st message from msg and print it. msg should be
174 * the index of the inventory message for object. (INVEN+N+1 message
175 * is game.prop=N message). */
180 vspeak(object_descriptions[msg].longs[skip], ap);
182 vspeak(object_descriptions[msg].inventory, ap);
186 void rspeak(vocab_t i, ...)
187 /* Print the i-th "random" message (section 6 of database). */
191 vspeak(arbitrary_messages[i], ap);
195 bool GETIN(FILE *input,
196 long *pword1, long *pword1x,
197 long *pword2, long *pword2x)
198 /* Get a command from the adventurer. Snarf out the first word, pad it with
199 * blanks, and return it in WORD1. Chars 6 thru 10 are returned in WORD1X, in
200 * case we need to print out the whole word in an error message. Any number of
201 * blanks may follow the word. If a second word appears, it is returned in
202 * WORD2 (chars 6 thru 10 in WORD2X), else WORD2 is -1. */
208 fputc('\n', stdout);;
211 *pword1 = GETTXT(true, true, true);
212 if (game.blklin && *pword1 < 0)
214 *pword1x = GETTXT(false, true, true);
216 junk = GETTXT(false, true, true);
219 *pword2 = GETTXT(true, true, true);
220 *pword2x = GETTXT(false, true, true);
222 junk = GETTXT(false, true, true);
225 if (GETTXT(true, true, true) <= 0)
231 void echo_input(FILE* destination, char* input_prompt, char* input)
233 size_t len = strlen(input_prompt) + strlen(input) + 1;
234 char* prompt_and_input = (char*) xmalloc(len);
235 strcpy(prompt_and_input, input_prompt);
236 strcat(prompt_and_input, input);
237 fprintf(destination, "%s\n", prompt_and_input);
238 free(prompt_and_input);
244 char input_prompt[] = "> ";
246 input_prompt[0] = '\0';
248 // Print a blank line if game.blklin tells us to.
249 if (game.blklin == true)
255 input = linenoise(input_prompt);
260 printf("%s", input_prompt);
261 IGNORE(getline(&input, &n, stdin));
264 if (input == NULL) // Got EOF; return with it.
266 else if (input[0] == '#') // Ignore comments.
268 else // We have a 'normal' line; leave the loop.
272 // Strip trailing newlines from the input
273 input[strcspn(input, "\n")] = 0;
275 linenoiseHistoryAdd(input);
278 echo_input(stdout, input_prompt, input);
281 echo_input(logfp, input_prompt, input);
286 bool YES(const char* question, const char* yes_response, const char* no_response)
287 /* Print message X, wait for yes/no answer. If yes, print Y and return true;
288 * if no, print Z and return false. */
298 linenoiseFree(reply);
302 char* firstword = (char*) xmalloc(strlen(reply)+1);
303 sscanf(reply, "%s", firstword);
305 for (int i = 0; i < (int)strlen(firstword); ++i)
306 firstword[i] = tolower(firstword[i]);
308 int yes = strncmp("yes", firstword, sizeof("yes") - 1);
309 int y = strncmp("y", firstword, sizeof("y") - 1);
310 int no = strncmp("no", firstword, sizeof("no") - 1);
311 int n = strncmp("n", firstword, sizeof("n") - 1);
315 if (yes == 0 || y == 0) {
319 } else if (no == 0 || n == 0) {
324 rspeak(PLEASE_ANSWER);
326 linenoiseFree(reply);
330 /* Line-parsing routines (GETTXT, MAKEWD, PUTTXT, SHFTXT) */
332 long GETTXT(bool skip, bool onewrd, bool upper)
333 /* Take characters from an input line and pack them into 30-bit words.
334 * Skip says to skip leading blanks. ONEWRD says stop if we come to a
335 * blank. UPPER says to map all letters to uppercase. If we reach the
336 * end of the line, the word is filled up with blanks (which encode as 0's).
337 * If we're already at end of line when TEXT is called, we return -1. */
340 static long splitting = -1;
342 if (LNPOSN != splitting)
348 if ((!skip) || INLINE[LNPOSN] != 0)
354 for (int I = 1; I <= TOKLEN; I++) {
356 if (LNPOSN > LNLENG || (onewrd && INLINE[LNPOSN] == 0))
358 char current = INLINE[LNPOSN];
359 if (current < ascii_to_advent['%']) {
361 if (upper && current >= ascii_to_advent['a'])
362 current = current - 26;
363 text = text + current;
367 if (splitting != LNPOSN) {
368 text = text + ascii_to_advent['%'];
373 text = text + current - ascii_to_advent['%'];
381 token_t MAKEWD(long letters)
382 /* Combine TOKLEN (currently 5) uppercase letters (represented by
383 * pairs of decimal digits in lettrs) to form a 30-bit value matching
384 * the one that GETTXT would return given those characters plus
385 * trailing blanks. Caution: lettrs will overflow 31 bits if
386 * 5-letter word starts with V-Z. As a kludgey workaround, you can
387 * increment a letter by 5 by adding 50 to the next pair of
390 long i = 1, word = 0;
392 for (long k = letters; k != 0; k = k / 100) {
393 word = word + i * (MOD(k, 50) + 10);
395 if (MOD(k, 100) > 50)word = word + i * 5;
397 i = 64L * 64L * 64L * 64L * 64L / i;
402 /* Data structure routines */
404 long VOCAB(long id, long init)
405 /* Look up ID in the vocabulary (ATAB) and return its "definition" (KTAB), or
406 * -1 if not found. If INIT is positive, this is an initialisation call setting
407 * up a keyword variable, and not finding it constitutes a bug. It also means
408 * that only KTAB values which taken over 1000 equal INIT may be considered.
409 * (Thus "STEPS", which is a motion verb as well as an object, may be located
410 * as an object.) And it also means the KTAB value is taken modulo 1000. */
414 for (long i = 1; i <= TABSIZ; i++) {
419 BUG(REQUIRED_VOCABULARY_WORD_NOT_FOUND);
421 if (init >= 0 && KTAB[i] / 1000 != init)
426 lexeme = MOD(lexeme, 1000);
430 BUG(RAN_OFF_END_OF_VOCABULARY_TABLE);
433 void JUGGLE(long object)
434 /* Juggle an object by picking it up and putting it down again, the purpose
435 * being to get the object to the front of the chain of things at its loc. */
439 i = game.place[object];
440 j = game.fixed[object];
442 MOVE(object + NOBJECTS, j);
445 void MOVE(long object, long where)
446 /* Place any object anywhere by picking it up and dropping it. May
447 * already be toting, in which case the carry is a no-op. Mustn't
448 * pick up objects which are not at any loc, since carry wants to
449 * remove objects from game.atloc chains. */
453 if (object > NOBJECTS)
454 from = game.fixed[object - NOBJECTS];
456 from = game.place[object];
457 if (from != LOC_NOWHERE && from != CARRIED && !SPECIAL(from))
462 long PUT(long object, long where, long pval)
463 /* PUT is the same as MOVE, except it returns a value used to set up the
464 * negated game.prop values for the repository objects. */
470 void CARRY(long object, long where)
471 /* Start toting an object, removing it from the list of things at its former
472 * location. Incr holdng unless it was already being toted. If object>NOBJECTS
473 * (moving "fixed" second loc), don't change game.place or game.holdng. */
477 if (object <= NOBJECTS) {
478 if (game.place[object] == CARRIED)
480 game.place[object] = CARRIED;
483 if (game.atloc[where] == object) {
484 game.atloc[where] = game.link[object];
487 temp = game.atloc[where];
488 while (game.link[temp] != object) {
489 temp = game.link[temp];
491 game.link[temp] = game.link[object];
494 void DROP(long object, long where)
495 /* Place an object at a given loc, prefixing it onto the game.atloc list. Decr
496 * game.holdng if the object was being toted. */
498 if (object > NOBJECTS)
499 game.fixed[object - NOBJECTS] = where;
501 if (game.place[object] == CARRIED)
503 game.place[object] = where;
507 game.link[object] = game.atloc[where];
508 game.atloc[where] = object;
511 long ATDWRF(long where)
512 /* Return the index of first dwarf at the given location, zero if no dwarf is
513 * there (or if dwarves not active yet), -1 if all dwarves are dead. Ignore
514 * the pirate (6th dwarf). */
522 for (long i = 1; i <= NDWARVES - 1; i++) {
523 if (game.dloc[i] == where)
525 if (game.dloc[i] != 0)
531 /* Utility routines (SETBIT, TSTBIT, set_seed, get_next_lcg_value,
532 * randrange, RNDVOC) */
534 long SETBIT(long bit)
535 /* Returns 2**bit for use in constructing bit-masks. */
540 bool TSTBIT(long mask, int bit)
541 /* Returns true if the specified bit is set in the mask. */
543 return (mask & (1 << bit)) != 0;
546 void set_seed(long seedval)
547 /* Set the LCG seed */
549 game.lcg_x = (unsigned long) seedval % game.lcg_m;
552 unsigned long get_next_lcg_value(void)
553 /* Return the LCG's current value, and then iterate it. */
555 unsigned long old_x = game.lcg_x;
556 game.lcg_x = (game.lcg_a * game.lcg_x + game.lcg_c) % game.lcg_m;
560 long randrange(long range)
561 /* Return a random integer from [0, range). */
563 return range * get_next_lcg_value() / game.lcg_m;
566 long RNDVOC(long second, long force)
567 /* Searches the vocabulary ATAB for a word whose second character is
568 * char, and changes that word such that each of the other four
569 * characters is a random letter. If force is non-zero, it is used
570 * as the new word. Returns the new word. */
575 for (int i = 1; i <= 5; i++) {
576 long j = 11 + randrange(26);
583 long div = 64L * 64L * 64L;
584 for (int i = 1; i <= TABSIZ; i++) {
585 if (MOD(ATAB[i] / div, 64L) == second) {
595 /* Machine dependent routines (MAPLIN, SAVEIO) */
597 bool MAPLIN(FILE *fp)
601 /* Read a line of input, from the specified input source.
602 * This logic is complicated partly because it has to serve
603 * several cases with different requirements and partly because
604 * of a quirk in linenoise().
606 * The quirk shows up when you paste a test log from the clipboard
607 * to the program's command prompt. While fgets (as expected)
608 * consumes it a line at a time, linenoise() returns the first
609 * line and discards the rest. Thus, there needs to be an
610 * editline (-s) option to fall back to fgets while still
611 * prompting. Note that linenoise does behave properly when
612 * fed redirected stdin.
614 * The logging is a bit of a mess because there are two distinct cases
615 * in which you want to echo commands. One is when shipping them to
616 * a log under the -l option, in which case you want to suppress
617 * prompt generation (so test logs are unadorned command sequences).
618 * On the other hand, if you redirected stdin and are feeding the program
619 * a logfile, you *do* want prompt generation - it makes checkfiles
620 * easier to read when the commands are marked by a preceding prompt.
626 IGNORE(fgets(rawbuf, sizeof(rawbuf) - 1, fp));
629 char *cp = linenoise("> ");
632 strncpy(rawbuf, cp, sizeof(rawbuf) - 1);
633 linenoiseHistoryAdd(rawbuf);
634 strncat(rawbuf, "\n", sizeof(rawbuf) - strlen(rawbuf) - 1);
639 (!eof && rawbuf[0] == '#');
641 if (logfp && fp == stdin)
646 if (logfp && fp == stdin)
651 if (prompt && efp == stdout)
653 IGNORE(fputs(rawbuf, efp));
655 strcpy(INLINE + 1, rawbuf);
656 /* translate the chars to integers in the range 0-126 and store
657 * them in the common array "INLINE". Integer values are as follows:
658 * 0 = space [ASCII CODE 40 octal, 32 decimal]
659 * 1-2 = !" [ASCII 41-42 octal, 33-34 decimal]
660 * 3-10 = '()*+,-. [ASCII 47-56 octal, 39-46 decimal]
661 * 11-36 = upper-case letters
662 * 37-62 = lower-case letters
663 * 63 = percent (%) [ASCII 45 octal, 37 decimal]
664 * 64-73 = digits, 0 through 9
665 * Remaining characters can be translated any way that is convenient;
666 * The above mappings are required so that certain special
667 * characters are known to fit in 6 bits and/or can be easily spotted.
668 * Array elements beyond the end of the line should be filled with 0,
669 * and LNLENG should be set to the index of the last character.
671 * If the data file uses a character other than space (e.g., tab) to
672 * separate numbers, that character should also translate to 0.
674 * This procedure may use the map1,map2 arrays to maintain
675 * static data for he mapping. MAP2(1) is set to 0 when the
676 * program starts and is not changed thereafter unless the
677 * routines in this module choose to do so. */
679 for (long i = 1; i <= (long)sizeof(INLINE) && INLINE[i] != 0; i++) {
680 long val = INLINE[i];
681 INLINE[i] = ascii_to_advent[val];
690 void DATIME(long* d, long* t)
693 gettimeofday(&tv, NULL);
694 *d = (long) tv.tv_sec;
695 *t = (long) tv.tv_usec;
698 void bug(enum bugtype num, const char *error_string)
700 fprintf(stderr, "Fatal error %d, %s.\n", num, error_string);