8 #include <editline/readline.h>
13 static void* xmalloc(size_t size)
15 void* ptr = malloc(size);
18 // exclude from coverage analysis because we can't simulate an out of memory error in testing
19 fprintf(stderr, "Out of memory!\n");
26 void packed_to_token(long packed, char token[TOKLEN + 1])
28 // The advent->ascii mapping.
29 const char advent_to_ascii[] = {
30 ' ', '!', '"', '#', '$', '%', '&', '\'',
31 '(', ')', '*', '+', ',', '-', '.', '/',
32 '0', '1', '2', '3', '4', '5', '6', '7',
33 '8', '9', ':', ';', '<', '=', '>', '?',
34 '@', 'A', 'B', 'C', 'D', 'E', 'F', 'G',
35 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O',
36 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W',
37 'X', 'Y', 'Z', '\0', '\0', '\0', '\0', '\0',
40 // Unpack and map back to ASCII.
41 for (int i = 0; i < 5; ++i) {
42 char advent = (packed >> i * 6) & 63;
43 token[i] = advent_to_ascii[(int) advent];
46 // Ensure the last character is \0.
49 // Replace trailing whitespace with \0.
50 for (int i = 4; i >= 0; --i) {
51 if (token[i] == ' ' ||
59 long token_to_packed(const char token[])
61 const char ascii_to_advent[] = {
62 63, 63, 63, 63, 63, 63, 63, 63,
63 63, 63, 63, 63, 63, 63, 63, 63,
64 63, 63, 63, 63, 63, 63, 63, 63,
65 63, 63, 63, 63, 63, 63, 63, 63,
67 0, 1, 2, 3, 4, 5, 6, 7,
68 8, 9, 10, 11, 12, 13, 14, 15,
69 16, 17, 18, 19, 20, 21, 22, 23,
70 24, 25, 26, 27, 28, 29, 30, 31,
71 32, 33, 34, 35, 36, 37, 38, 39,
72 40, 41, 42, 43, 44, 45, 46, 47,
73 48, 49, 50, 51, 52, 53, 54, 55,
74 56, 57, 58, 59, 60, 61, 62, 63,
76 63, 63, 63, 63, 63, 63, 63, 63,
77 63, 63, 63, 63, 63, 63, 63, 63,
78 63, 63, 63, 63, 63, 63, 63, 63,
79 63, 63, 63, 63, 63, 63, 63, 63,
82 size_t t_len = strlen(token);
86 for (size_t i = 0; i < t_len; ++i) {
87 char mapped = ascii_to_advent[(int) toupper(token[i])];
88 packed |= (mapped << (6 * i));
93 void tokenize(char* raw, struct command_t *cmd)
95 memset(cmd, '\0', sizeof(struct command_t));
97 /* Bound prefix on the %s would be needed to prevent buffer
98 * overflow. but we shortstop this more simply by making each
99 * raw-input buffer as long as the enrire inout buffer. */
100 sscanf(raw, "%s%s", cmd->raw1, cmd->raw2);
102 // pack the substrings
103 cmd->wd1 = token_to_packed(cmd->raw1);
104 cmd->wd2 = token_to_packed(cmd->raw2);
106 /* (ESR) In oldstyle mode, simulate the uppercasing and truncating
107 * effect on raw tokens of packing them into sixbit characters, 5
108 * to a 32-bit word. This is something the FORTRAN version did
109 * becuse archaic FORTRAN had no string types. Don Wood's
110 * mechanical translation of 2.5 to C retained the packing and
111 * thus this misfeature.
113 * It's philosophically questionable whether this is the right
114 * thing to do even in oldstyle mode. On one hand, the text
115 * mangling was not authorial intent, but a result of limitations
116 * in their tools. On the other, not simulating this misbehavior
117 * goes against the goal of making oldstyle as accurate as
118 * possible an emulation of the original UI.
120 if (settings.oldstyle) {
121 cmd->raw1[TOKLEN + TOKLEN] = cmd->raw2[TOKLEN + TOKLEN] = '\0';
122 for (size_t i = 0; i < strlen(cmd->raw1); i++)
123 cmd->raw1[i] = toupper(cmd->raw1[i]);
124 for (size_t i = 0; i < strlen(cmd->raw2); i++)
125 cmd->raw2[i] = toupper(cmd->raw2[i]);
129 /* Hide the fact that wods are corrently packed longs */
131 bool wordeq(token_t a, token_t b)
136 bool wordempty(token_t a)
141 void wordclear(token_t *v)
146 /* I/O routines (speak, pspeak, rspeak, sspeak, get_input, yes) */
148 void vspeak(const char* msg, bool blank, va_list ap)
150 // Do nothing if we got a null pointer.
154 // Do nothing if we got an empty string.
155 if (strlen(msg) == 0)
161 int msglen = strlen(msg);
164 ssize_t size = 2000; /* msglen > 50 ? msglen*2 : 100; */
165 char* rendered = xmalloc(size);
166 char* renderp = rendered;
168 // Handle format specifiers (including the custom %C, %L, %S) by
169 // adjusting the parameter accordingly, and replacing the
170 // specifier with %s.
171 long previous_arg = 0;
172 for (int i = 0; i < msglen; i++) {
174 /* Ugh. Least obtrusive way to deal with artifacts "on the floor"
175 * being dropped outside of both cave and building. */
176 if (strncmp(msg + i, "floor", 5) == 0 && strchr(" .", msg[i+5]) && !INSIDE(game.loc)) {
177 strcpy(renderp, "ground");
186 long arg = va_arg(ap, long);
188 arg = 0; // LCOV_EXCL_LINE - don't think we can get here.
190 // Integer specifier. In order to accommodate the fact
191 // that PARMS can have both legitimate integers *and*
192 // packed tokens, stringify everything. Future work may
193 // eliminate the need for this.
195 int ret = snprintf(renderp, size, "%ld", arg);
202 // Unmodified string specifier.
204 packed_to_token(arg, renderp); /* unpack directly to destination */
205 size_t len = strlen(renderp);
210 // Singular/plural specifier.
212 if (previous_arg > 1) { // look at the *previous* parameter (which by necessity must be numeric)
218 /* Version specifier */
220 strcpy(renderp, VERSION);
221 size_t len = strlen(VERSION);
231 // Print the message.
232 printf("%s\n", rendered);
237 void speak(const char* msg, ...)
241 vspeak(msg, true, ap);
245 void sspeak(const long msg, ...)
250 vprintf(arbitrary_messages[msg], ap);
255 void pspeak(vocab_t msg, enum speaktype mode, int skip, bool blank, ...)
256 /* Find the skip+1st message from msg and print it. Modes are:
257 * feel = for inventory, what you can touch
258 * look = the long description for the state the object is in
259 * listen = the sound for the state the object is in
260 * study = text on the object. */
266 vspeak(objects[msg].inventory, blank, ap);
269 vspeak(objects[msg].descriptions[skip], blank, ap);
272 vspeak(objects[msg].sounds[skip], blank, ap);
275 vspeak(objects[msg].texts[skip], blank, ap);
278 vspeak(objects[msg].changes[skip], blank, ap);
284 void rspeak(vocab_t i, ...)
285 /* Print the i-th "random" message (section 6 of database). */
289 vspeak(arbitrary_messages[i], true, ap);
293 void echo_input(FILE* destination, const char* input_prompt, const char* input)
295 size_t len = strlen(input_prompt) + strlen(input) + 1;
296 char* prompt_and_input = (char*) xmalloc(len);
297 strcpy(prompt_and_input, input_prompt);
298 strcat(prompt_and_input, input);
299 fprintf(destination, "%s\n", prompt_and_input);
300 free(prompt_and_input);
303 int word_count(char* str)
305 char delims[] = " \t";
309 for (char *s = str; *s; s++)
311 if (strchr(delims, *s) == 0) {
316 if (strchr(delims, *s) != 0) {
327 char input_prompt[] = "> ";
328 if (!settings.prompt)
329 input_prompt[0] = '\0';
331 // Print a blank line
336 input = readline(input_prompt);
338 if (input == NULL) // Got EOF; return with it.
340 if (input[0] == '#') { // Ignore comments.
344 // We have a 'normal' line; leave the loop.
348 // Strip trailing newlines from the input
349 input[strcspn(input, "\n")] = 0;
354 echo_input(stdout, input_prompt, input);
357 echo_input(settings.logfp, "", input);
364 bool outcome = false;
367 char* reply = get_input();
370 // Should be unreachable. Reply should never be NULL
375 if (strlen(reply) == 0) {
377 rspeak(PLEASE_ANSWER);
381 char* firstword = (char*) xmalloc(strlen(reply) + 1);
382 sscanf(reply, "%s", firstword);
386 for (int i = 0; i < (int)strlen(firstword); ++i)
387 firstword[i] = tolower(firstword[i]);
389 int yes = strncmp("yes", firstword, sizeof("yes") - 1);
390 int y = strncmp("y", firstword, sizeof("y") - 1);
391 int no = strncmp("no", firstword, sizeof("no") - 1);
392 int n = strncmp("n", firstword, sizeof("n") - 1);
400 } else if (no == 0 ||
405 rspeak(PLEASE_ANSWER);
411 bool yes(const char* question, const char* yes_response, const char* no_response)
412 /* Print message X, wait for yes/no answer. If yes, print Y and return true;
413 * if no, print Z and return false. */
415 bool outcome = false;
420 char* reply = get_input();
423 // Should be unreachable. Reply should never be NULL
429 if (strlen(reply) == 0) {
431 rspeak(PLEASE_ANSWER);
435 char* firstword = (char*) xmalloc(strlen(reply) + 1);
436 sscanf(reply, "%s", firstword);
440 for (int i = 0; i < (int)strlen(firstword); ++i)
441 firstword[i] = tolower(firstword[i]);
443 int yes = strncmp("yes", firstword, sizeof("yes") - 1);
444 int y = strncmp("y", firstword, sizeof("y") - 1);
445 int no = strncmp("no", firstword, sizeof("no") - 1);
446 int n = strncmp("n", firstword, sizeof("n") - 1);
455 } else if (no == 0 ||
461 rspeak(PLEASE_ANSWER);
468 /* Data structure routines */
470 int get_motion_vocab_id(const char* word)
471 // Return the first motion number that has 'word' as one of its words.
473 for (int i = 0; i < NMOTIONS; ++i) {
474 for (int j = 0; j < motions[i].words.n; ++j) {
475 if (strcasecmp(word, motions[i].words.strs[j]) == 0 && (strlen(word) > 1 ||
476 strchr(ignore, word[0]) == NULL ||
481 // If execution reaches here, we didn't find the word.
482 return (WORD_NOT_FOUND);
485 int get_object_vocab_id(const char* word)
486 // Return the first object number that has 'word' as one of its words.
488 for (int i = 0; i < NOBJECTS + 1; ++i) { // FIXME: the + 1 should go when 1-indexing for objects is removed
489 for (int j = 0; j < objects[i].words.n; ++j) {
490 if (strcasecmp(word, objects[i].words.strs[j]) == 0)
494 // If execution reaches here, we didn't find the word.
495 return (WORD_NOT_FOUND);
498 int get_action_vocab_id(const char* word)
499 // Return the first motion number that has 'word' as one of its words.
501 for (int i = 0; i < NACTIONS; ++i) {
502 for (int j = 0; j < actions[i].words.n; ++j) {
503 if (strcasecmp(word, actions[i].words.strs[j]) == 0 && (strlen(word) > 1 ||
504 strchr(ignore, word[0]) == NULL ||
509 // If execution reaches here, we didn't find the word.
510 return (WORD_NOT_FOUND);
513 int get_special_vocab_id(const char* word)
514 // Return the first special number that has 'word' as one of its words.
516 for (int i = 0; i < NSPECIALS; ++i) {
517 for (int j = 0; j < specials[i].words.n; ++j) {
518 if (strcasecmp(word, specials[i].words.strs[j]) == 0)
522 // If execution reaches here, we didn't find the word.
523 return (WORD_NOT_FOUND);
526 long get_vocab_id(const char* word)
527 // Search the vocab categories in order for the supplied word.
529 /* Check for an empty string */
530 if (strncmp(word, "", sizeof("")) == 0)
535 /* FIXME: Magic numbers related to vocabulary */
536 ref_num = get_motion_vocab_id(word);
537 if (ref_num != WORD_NOT_FOUND)
538 return MOTION_WORD(ref_num);
540 ref_num = get_object_vocab_id(word);
541 if (ref_num != WORD_NOT_FOUND)
542 return OBJECT_WORD(ref_num);
544 ref_num = get_action_vocab_id(word);
545 if (ref_num != WORD_NOT_FOUND)
546 return ACTION_WORD(ref_num);
548 ref_num = get_special_vocab_id(word);
549 if (ref_num != WORD_NOT_FOUND)
550 return SPECIAL_WORD(ref_num);
552 // Check for the reservoir magic word.
553 if (strcasecmp(word, game.zzword) == 0)
554 return ACTION_WORD(PART);
556 return (WORD_NOT_FOUND);
559 void juggle(obj_t object)
560 /* Juggle an object by picking it up and putting it down again, the purpose
561 * being to get the object to the front of the chain of things at its loc. */
565 i = game.place[object];
566 j = game.fixed[object];
568 move(object + NOBJECTS, j);
571 void move(obj_t object, loc_t where)
572 /* Place any object anywhere by picking it up and dropping it. May
573 * already be toting, in which case the carry is a no-op. Mustn't
574 * pick up objects which are not at any loc, since carry wants to
575 * remove objects from game.atloc chains. */
579 if (object > NOBJECTS)
580 from = game.fixed[object - NOBJECTS];
582 from = game.place[object];
583 /* (ESR) Used to check for !SPECIAL(from). I *think* that was wrong... */
584 if (from != LOC_NOWHERE && from != CARRIED)
589 long put(obj_t object, loc_t where, long pval)
590 /* put() is the same as move(), except it returns a value used to set up the
591 * negated game.prop values for the repository objects. */
594 return STASHED(pval);
597 void carry(obj_t object, loc_t where)
598 /* Start toting an object, removing it from the list of things at its former
599 * location. Incr holdng unless it was already being toted. If object>NOBJECTS
600 * (moving "fixed" second loc), don't change game.place or game.holdng. */
604 if (object <= NOBJECTS) {
605 if (game.place[object] == CARRIED)
607 game.place[object] = CARRIED;
610 if (game.atloc[where] == object) {
611 game.atloc[where] = game.link[object];
614 temp = game.atloc[where];
615 while (game.link[temp] != object) {
616 temp = game.link[temp];
618 game.link[temp] = game.link[object];
621 void drop(obj_t object, loc_t where)
622 /* Place an object at a given loc, prefixing it onto the game.atloc list. Decr
623 * game.holdng if the object was being toted. */
625 if (object > NOBJECTS)
626 game.fixed[object - NOBJECTS] = where;
628 if (game.place[object] == CARRIED)
630 game.place[object] = where;
632 if (where == LOC_NOWHERE ||
635 game.link[object] = game.atloc[where];
636 game.atloc[where] = object;
639 long atdwrf(loc_t where)
640 /* Return the index of first dwarf at the given location, zero if no dwarf is
641 * there (or if dwarves not active yet), -1 if all dwarves are dead. Ignore
642 * the pirate (6th dwarf). */
650 for (long i = 1; i <= NDWARVES - 1; i++) {
651 if (game.dloc[i] == where)
653 if (game.dloc[i] != 0)
659 /* Utility routines (setbit, tstbit, set_seed, get_next_lcg_value,
662 long setbit(long bit)
663 /* Returns 2**bit for use in constructing bit-masks. */
668 bool tstbit(long mask, int bit)
669 /* Returns true if the specified bit is set in the mask. */
671 return (mask & (1 << bit)) != 0;
674 void set_seed(long seedval)
675 /* Set the LCG seed */
677 game.lcg_x = (unsigned long) seedval % game.lcg_m;
679 // once seed is set, we need to generate the Z`ZZZ word
680 make_zzword(game.zzword);
683 unsigned long get_next_lcg_value(void)
684 /* Return the LCG's current value, and then iterate it. */
686 unsigned long old_x = game.lcg_x;
687 game.lcg_x = (game.lcg_a * game.lcg_x + game.lcg_c) % game.lcg_m;
691 long randrange(long range)
692 /* Return a random integer from [0, range). */
694 return range * get_next_lcg_value() / game.lcg_m;
697 void make_zzword(char zzword[TOKLEN + 1])
699 for (int i = 0; i < 5; ++i) {
700 zzword[i] = 'A' + randrange(26);
702 zzword[1] = '\''; // force second char to apostrophe
707 void bug(enum bugtype num, const char *error_string)
709 fprintf(stderr, "Fatal error %d, %s.\n", num, error_string);
716 void state_change(obj_t obj, long state)
717 /* Object must have a change-message list for this to be useful; only some do */
719 game.prop[obj] = state;
720 pspeak(obj, change, state, true);