8 #include <editline/readline.h>
13 char* xstrdup(const char* s)
15 char* ptr = strdup(s);
18 // exclude from coverage analysis because we can't simulate an out of memory error in testing
19 fprintf(stderr, "Out of memory!\n");
25 void* xmalloc(size_t size)
27 void* ptr = malloc(size);
30 // exclude from coverage analysis because we can't simulate an out of memory error in testing
31 fprintf(stderr, "Out of memory!\n");
38 void packed_to_token(long packed, char token[6])
40 // The advent->ascii mapping.
41 const char advent_to_ascii[] = {
42 ' ', '!', '"', '#', '$', '%', '&', '\'',
43 '(', ')', '*', '+', ',', '-', '.', '/',
44 '0', '1', '2', '3', '4', '5', '6', '7',
45 '8', '9', ':', ';', '<', '=', '>', '?',
46 '@', 'A', 'B', 'C', 'D', 'E', 'F', 'G',
47 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O',
48 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W',
49 'X', 'Y', 'Z', '\0', '\0', '\0', '\0', '\0',
52 // Unpack and map back to ASCII.
53 for (int i = 0; i < 5; ++i) {
54 char advent = (packed >> i * 6) & 63;
55 token[i] = advent_to_ascii[(int) advent];
58 // Ensure the last character is \0.
61 // Replace trailing whitespace with \0.
62 for (int i = 4; i >= 0; --i) {
63 if (token[i] == ' ' || token[i] == '\t')
70 long token_to_packed(const char token[6])
72 const char ascii_to_advent[] = {
73 63, 63, 63, 63, 63, 63, 63, 63,
74 63, 63, 63, 63, 63, 63, 63, 63,
75 63, 63, 63, 63, 63, 63, 63, 63,
76 63, 63, 63, 63, 63, 63, 63, 63,
78 0, 1, 2, 3, 4, 5, 6, 7,
79 8, 9, 10, 11, 12, 13, 14, 15,
80 16, 17, 18, 19, 20, 21, 22, 23,
81 24, 25, 26, 27, 28, 29, 30, 31,
82 32, 33, 34, 35, 36, 37, 38, 39,
83 40, 41, 42, 43, 44, 45, 46, 47,
84 48, 49, 50, 51, 52, 53, 54, 55,
85 56, 57, 58, 59, 60, 61, 62, 63,
87 63, 63, 63, 63, 63, 63, 63, 63,
88 63, 63, 63, 63, 63, 63, 63, 63,
89 63, 63, 63, 63, 63, 63, 63, 63,
90 63, 63, 63, 63, 63, 63, 63, 63,
93 size_t t_len = strlen(token);
95 for (size_t i = 0; i < t_len; ++i) {
96 char mapped = ascii_to_advent[(int) token[i]];
97 packed |= (mapped << (6 * i));
102 void tokenize(char* raw, long tokens[4])
104 // set each token to 0
105 for (int i = 0; i < 4; ++i)
108 // grab the first two words
110 words[0] = (char*) xmalloc(strlen(raw) + 1);
111 words[1] = (char*) xmalloc(strlen(raw) + 1);
112 int word_count = sscanf(raw, "%s%s", words[0], words[1]);
114 // make space for substrings and zero it out
115 char chunk_data[][6] = {
122 // break the words into up to 4 5-char substrings
123 sscanf(words[0], "%5s%5s", chunk_data[0], chunk_data[1]);
125 sscanf(words[1], "%5s%5s", chunk_data[2], chunk_data[3]);
129 // uppercase all the substrings
130 for (int i = 0; i < 4; ++i)
131 for (unsigned int j = 0; j < strlen(chunk_data[i]); ++j)
132 chunk_data[i][j] = (char) toupper(chunk_data[i][j]);
134 // pack the substrings
135 for (int i = 0; i < 4; ++i)
136 tokens[i] = token_to_packed(chunk_data[i]);
139 /* Hide the fact that wods are corrently packed longs */
141 bool wordeq(token_t a, token_t b)
146 bool wordempty(token_t a)
151 void wordclear(token_t *v)
156 /* I/O routines (speak, pspeak, rspeak, get_input, yes) */
158 void vspeak(const char* msg, bool blank, va_list ap)
160 // Do nothing if we got a null pointer.
164 // Do nothing if we got an empty string.
165 if (strlen(msg) == 0)
171 int msglen = strlen(msg);
174 ssize_t size = 2000; /* msglen > 50 ? msglen*2 : 100; */
175 char* rendered = xmalloc(size);
176 char* renderp = rendered;
178 // Handle format specifiers (including the custom %C, %L, %S) by
179 // adjusting the parameter accordingly, and replacing the
180 // specifier with %s.
181 long previous_arg = 0;
182 for (int i = 0; i < msglen; i++) {
187 long arg = va_arg(ap, long);
189 arg = 0; // LCOV_EXCL_LINE - don't think we can get here.
191 // Integer specifier. In order to accommodate the fact
192 // that PARMS can have both legitimate integers *and*
193 // packed tokens, stringify everything. Future work may
194 // eliminate the need for this.
196 int ret = snprintf(renderp, size, "%ld", arg);
203 // Unmodified string specifier.
205 packed_to_token(arg, renderp); /* unpack directly to destination */
206 size_t len = strlen(renderp);
211 // Singular/plural specifier.
213 if (previous_arg > 1) { // look at the *previous* parameter (which by necessity must be numeric)
219 /* Version specifier */
221 strcpy(renderp, VERSION);
222 size_t len = strlen(VERSION);
227 // All-lowercase specifier.
228 if (msg[i] == 'L' || msg[i] == 'C') {
229 packed_to_token(arg, renderp); /* unpack directly to destination */
230 int len = strlen(renderp);
231 for (int j = 0; j < len; ++j) {
232 renderp[j] = tolower(renderp[j]);
234 if (msg[i] == 'C') // First char uppercase, rest lowercase.
235 renderp[0] = toupper(renderp[0]);
245 // Print the message.
246 printf("%s\n", rendered);
251 void speak(const char* msg, ...)
255 vspeak(msg, true, ap);
259 void pspeak(vocab_t msg, enum speaktype mode, int skip, bool blank, ...)
260 /* Find the skip+1st message from msg and print it. Modes are:
261 * feel = for inventory, what you can touch
262 * look = the long description for the state the object is in
263 * listen = the sound for the state the object is in
264 * study = text on the object. */
270 vspeak(objects[msg].inventory, blank, ap);
273 vspeak(objects[msg].descriptions[skip], blank, ap);
276 vspeak(objects[msg].sounds[skip], blank, ap);
279 vspeak(objects[msg].texts[skip], blank, ap);
282 vspeak(objects[msg].changes[skip], blank, ap);
288 void rspeak(vocab_t i, ...)
289 /* Print the i-th "random" message (section 6 of database). */
293 vspeak(arbitrary_messages[i], true, ap);
297 void echo_input(FILE* destination, const char* input_prompt, const char* input)
299 size_t len = strlen(input_prompt) + strlen(input) + 1;
300 char* prompt_and_input = (char*) xmalloc(len);
301 strcpy(prompt_and_input, input_prompt);
302 strcat(prompt_and_input, input);
303 fprintf(destination, "%s\n", prompt_and_input);
304 free(prompt_and_input);
307 int word_count(char* s)
309 char* copy = xstrdup(s);
310 char delims[] = " \t";
314 word = strtok(copy, delims);
315 while (word != NULL) {
316 word = strtok(NULL, delims);
326 char input_prompt[] = "> ";
327 if (!settings.prompt)
328 input_prompt[0] = '\0';
330 // Print a blank line
335 input = readline(input_prompt);
337 if (input == NULL) // Got EOF; return with it.
339 else if (input[0] == '#') { // Ignore comments.
342 } else // We have a 'normal' line; leave the loop.
346 // Strip trailing newlines from the input
347 input[strcspn(input, "\n")] = 0;
352 echo_input(stdout, input_prompt, input);
355 echo_input(settings.logfp, "", input);
369 // Should be unreachable. Reply should never be NULL
375 char* firstword = (char*) xmalloc(strlen(reply) + 1);
376 sscanf(reply, "%s", firstword);
380 for (int i = 0; i < (int)strlen(firstword); ++i)
381 firstword[i] = tolower(firstword[i]);
383 int yes = strncmp("yes", firstword, sizeof("yes") - 1);
384 int y = strncmp("y", firstword, sizeof("y") - 1);
385 int no = strncmp("no", firstword, sizeof("no") - 1);
386 int n = strncmp("n", firstword, sizeof("n") - 1);
390 if (yes == 0 || y == 0) {
393 } else if (no == 0 || n == 0) {
397 rspeak(PLEASE_ANSWER);
403 bool yes(const char* question, const char* yes_response, const char* no_response)
404 /* Print message X, wait for yes/no answer. If yes, print Y and return true;
405 * if no, print Z and return false. */
416 // Should be unreachable. Reply should never be NULL
422 char* firstword = (char*) xmalloc(strlen(reply) + 1);
423 sscanf(reply, "%s", firstword);
427 for (int i = 0; i < (int)strlen(firstword); ++i)
428 firstword[i] = tolower(firstword[i]);
430 int yes = strncmp("yes", firstword, sizeof("yes") - 1);
431 int y = strncmp("y", firstword, sizeof("y") - 1);
432 int no = strncmp("no", firstword, sizeof("no") - 1);
433 int n = strncmp("n", firstword, sizeof("n") - 1);
437 if (yes == 0 || y == 0) {
441 } else if (no == 0 || n == 0) {
446 rspeak(PLEASE_ANSWER);
453 /* Data structure routines */
455 int get_motion_vocab_id(const char* word)
456 // Return the first motion number that has 'word' as one of its words.
458 for (int i = 0; i < NMOTIONS; ++i) {
459 for (int j = 0; j < motions[i].words.n; ++j) {
460 if (strcasecmp(word, motions[i].words.strs[j]) == 0 && (strlen(word) > 1 || strchr(ignore, word[0]) == NULL || !settings.oldstyle))
464 // If execution reaches here, we didn't find the word.
465 return (WORD_NOT_FOUND);
468 int get_object_vocab_id(const char* word)
469 // Return the first object number that has 'word' as one of its words.
471 for (int i = 0; i < NOBJECTS + 1; ++i) { // FIXME: the + 1 should go when 1-indexing for objects is removed
472 for (int j = 0; j < objects[i].words.n; ++j) {
473 if (strcasecmp(word, objects[i].words.strs[j]) == 0)
477 // If execution reaches here, we didn't find the word.
478 return (WORD_NOT_FOUND);
481 int get_action_vocab_id(const char* word)
482 // Return the first motion number that has 'word' as one of its words.
484 for (int i = 0; i < NACTIONS; ++i) {
485 for (int j = 0; j < actions[i].words.n; ++j) {
486 if (strcasecmp(word, actions[i].words.strs[j]) == 0 && (strlen(word) > 1 || strchr(ignore, word[0]) == NULL || !settings.oldstyle))
490 // If execution reaches here, we didn't find the word.
491 return (WORD_NOT_FOUND);
494 int get_special_vocab_id(const char* word)
495 // Return the first special number that has 'word' as one of its words.
497 for (int i = 0; i < NSPECIALS; ++i) {
498 for (int j = 0; j < specials[i].words.n; ++j) {
499 if (strcasecmp(word, specials[i].words.strs[j]) == 0)
503 // If execution reaches here, we didn't find the word.
504 return (WORD_NOT_FOUND);
507 long get_vocab_id(const char* word)
508 // Search the vocab categories in order for the supplied word.
512 /* FIXME: Magic numbers related to vocabulary */
513 ref_num = get_motion_vocab_id(word);
514 if (ref_num != WORD_NOT_FOUND)
515 return (ref_num + 0); // FIXME: replace with a proper hash
517 ref_num = get_object_vocab_id(word);
518 if (ref_num != WORD_NOT_FOUND)
519 return (ref_num + 1000); // FIXME: replace with a proper hash
521 ref_num = get_action_vocab_id(word);
522 if (ref_num != WORD_NOT_FOUND)
523 return (ref_num + 2000); // FIXME: replace with a proper hash
525 ref_num = get_special_vocab_id(word);
526 if (ref_num != WORD_NOT_FOUND)
527 return (ref_num + 3000); // FIXME: replace with a proper hash
529 // Check for the reservoir magic word.
530 if (strcasecmp(word, game.zzword) == 0)
531 return (PART + 2000); // FIXME: replace with a proper hash
533 return (WORD_NOT_FOUND);
536 void juggle(long object)
537 /* Juggle an object by picking it up and putting it down again, the purpose
538 * being to get the object to the front of the chain of things at its loc. */
542 i = game.place[object];
543 j = game.fixed[object];
545 move(object + NOBJECTS, j);
548 void move(long object, long where)
549 /* Place any object anywhere by picking it up and dropping it. May
550 * already be toting, in which case the carry is a no-op. Mustn't
551 * pick up objects which are not at any loc, since carry wants to
552 * remove objects from game.atloc chains. */
556 if (object > NOBJECTS)
557 from = game.fixed[object - NOBJECTS];
559 from = game.place[object];
560 if (from != LOC_NOWHERE && from != CARRIED && !SPECIAL(from))
565 long put(long object, long where, long pval)
566 /* PUT is the same as MOVE, except it returns a value used to set up the
567 * negated game.prop values for the repository objects. */
573 void carry(long object, long where)
574 /* Start toting an object, removing it from the list of things at its former
575 * location. Incr holdng unless it was already being toted. If object>NOBJECTS
576 * (moving "fixed" second loc), don't change game.place or game.holdng. */
580 if (object <= NOBJECTS) {
581 if (game.place[object] == CARRIED)
583 game.place[object] = CARRIED;
586 if (game.atloc[where] == object) {
587 game.atloc[where] = game.link[object];
590 temp = game.atloc[where];
591 while (game.link[temp] != object) {
592 temp = game.link[temp];
594 game.link[temp] = game.link[object];
597 void drop(long object, long where)
598 /* Place an object at a given loc, prefixing it onto the game.atloc list. Decr
599 * game.holdng if the object was being toted. */
601 if (object > NOBJECTS)
602 game.fixed[object - NOBJECTS] = where;
604 if (game.place[object] == CARRIED)
606 game.place[object] = where;
610 game.link[object] = game.atloc[where];
611 game.atloc[where] = object;
614 long atdwrf(long where)
615 /* Return the index of first dwarf at the given location, zero if no dwarf is
616 * there (or if dwarves not active yet), -1 if all dwarves are dead. Ignore
617 * the pirate (6th dwarf). */
625 for (long i = 1; i <= NDWARVES - 1; i++) {
626 if (game.dloc[i] == where)
628 if (game.dloc[i] != 0)
634 /* Utility routines (setbit, tstbit, set_seed, get_next_lcg_value,
637 long setbit(long bit)
638 /* Returns 2**bit for use in constructing bit-masks. */
643 bool tstbit(long mask, int bit)
644 /* Returns true if the specified bit is set in the mask. */
646 return (mask & (1 << bit)) != 0;
649 void set_seed(long seedval)
650 /* Set the LCG seed */
652 game.lcg_x = (unsigned long) seedval % game.lcg_m;
654 // once seed is set, we need to generate the Z`ZZZ word
655 make_zzword(game.zzword);
658 unsigned long get_next_lcg_value(void)
659 /* Return the LCG's current value, and then iterate it. */
661 unsigned long old_x = game.lcg_x;
662 game.lcg_x = (game.lcg_a * game.lcg_x + game.lcg_c) % game.lcg_m;
666 long randrange(long range)
667 /* Return a random integer from [0, range). */
669 return range * get_next_lcg_value() / game.lcg_m;
672 void make_zzword(char zzword[6])
674 for (int i = 0; i < 5; ++i) {
675 zzword[i] = 'A' + randrange(26);
677 zzword[1] = '\''; // force second char to apostrophe
682 void bug(enum bugtype num, const char *error_string)
684 fprintf(stderr, "Fatal error %d, %s.\n", num, error_string);