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[TOKLEN+1])
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] == ' ' ||
71 long token_to_packed(const char token[TOKLEN+1])
73 const char ascii_to_advent[] = {
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,
77 63, 63, 63, 63, 63, 63, 63, 63,
79 0, 1, 2, 3, 4, 5, 6, 7,
80 8, 9, 10, 11, 12, 13, 14, 15,
81 16, 17, 18, 19, 20, 21, 22, 23,
82 24, 25, 26, 27, 28, 29, 30, 31,
83 32, 33, 34, 35, 36, 37, 38, 39,
84 40, 41, 42, 43, 44, 45, 46, 47,
85 48, 49, 50, 51, 52, 53, 54, 55,
86 56, 57, 58, 59, 60, 61, 62, 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,
91 63, 63, 63, 63, 63, 63, 63, 63,
94 size_t t_len = strlen(token);
96 for (size_t i = 0; i < t_len; ++i) {
97 char mapped = ascii_to_advent[(int) token[i]];
98 packed |= (mapped << (6 * i));
103 void tokenize(char* raw, struct command_t *cmd)
105 memset(cmd, '\0', sizeof(struct command_t));
107 /* FIXME: put a bound prefix on the %s to prevent buffer overflow */
108 int word_count = sscanf(raw, "%s%s", cmd->raw1, cmd->raw2);
110 // make space for substrings and zero it out
111 char chunk_data[][TOKLEN+1] = {
118 // break the words into up to 4 5-char substrings
119 sscanf(cmd->raw1, "%5s%5s", chunk_data[0], chunk_data[1]);
121 sscanf(cmd->raw2, "%5s%5s", chunk_data[2], chunk_data[3]);
123 // uppercase all the substrings
124 for (int i = 0; i < 4; ++i)
125 for (unsigned int j = 0; j < strlen(chunk_data[i]); ++j)
126 chunk_data[i][j] = (char) toupper(chunk_data[i][j]);
128 // pack the substrings
129 cmd->wd1 = token_to_packed(chunk_data[0]);
130 cmd->wd1x = token_to_packed(chunk_data[1]);
131 cmd->wd2 = token_to_packed(chunk_data[2]);
132 cmd->wd2x = token_to_packed(chunk_data[3]);
135 /* Hide the fact that wods are corrently packed longs */
137 bool wordeq(token_t a, token_t b)
142 bool wordempty(token_t a)
147 void wordclear(token_t *v)
152 /* I/O routines (speak, pspeak, rspeak, get_input, yes) */
154 void vspeak(const char* msg, bool blank, va_list ap)
156 // Do nothing if we got a null pointer.
160 // Do nothing if we got an empty string.
161 if (strlen(msg) == 0)
167 int msglen = strlen(msg);
170 ssize_t size = 2000; /* msglen > 50 ? msglen*2 : 100; */
171 char* rendered = xmalloc(size);
172 char* renderp = rendered;
174 // Handle format specifiers (including the custom %C, %L, %S) by
175 // adjusting the parameter accordingly, and replacing the
176 // specifier with %s.
177 long previous_arg = 0;
178 for (int i = 0; i < msglen; i++) {
183 long arg = va_arg(ap, long);
185 arg = 0; // LCOV_EXCL_LINE - don't think we can get here.
187 // Integer specifier. In order to accommodate the fact
188 // that PARMS can have both legitimate integers *and*
189 // packed tokens, stringify everything. Future work may
190 // eliminate the need for this.
192 int ret = snprintf(renderp, size, "%ld", arg);
199 // Unmodified string specifier.
201 packed_to_token(arg, renderp); /* unpack directly to destination */
202 size_t len = strlen(renderp);
207 // Singular/plural specifier.
209 if (previous_arg > 1) { // look at the *previous* parameter (which by necessity must be numeric)
215 /* Version specifier */
217 strcpy(renderp, VERSION);
218 size_t len = strlen(VERSION);
223 // All-lowercase specifier.
226 packed_to_token(arg, renderp); /* unpack directly to destination */
227 int len = strlen(renderp);
228 for (int j = 0; j < len; ++j) {
229 renderp[j] = tolower(renderp[j]);
231 if (msg[i] == 'C') // First char uppercase, rest lowercase.
232 renderp[0] = toupper(renderp[0]);
242 // Print the message.
243 printf("%s\n", rendered);
248 void speak(const char* msg, ...)
252 vspeak(msg, true, ap);
256 void pspeak(vocab_t msg, enum speaktype mode, int skip, bool blank, ...)
257 /* Find the skip+1st message from msg and print it. Modes are:
258 * feel = for inventory, what you can touch
259 * look = the long description for the state the object is in
260 * listen = the sound for the state the object is in
261 * study = text on the object. */
267 vspeak(objects[msg].inventory, blank, ap);
270 vspeak(objects[msg].descriptions[skip], blank, ap);
273 vspeak(objects[msg].sounds[skip], blank, ap);
276 vspeak(objects[msg].texts[skip], blank, ap);
279 vspeak(objects[msg].changes[skip], blank, ap);
285 void rspeak(vocab_t i, ...)
286 /* Print the i-th "random" message (section 6 of database). */
290 vspeak(arbitrary_messages[i], true, ap);
294 void echo_input(FILE* destination, const char* input_prompt, const char* input)
296 size_t len = strlen(input_prompt) + strlen(input) + 1;
297 char* prompt_and_input = (char*) xmalloc(len);
298 strcpy(prompt_and_input, input_prompt);
299 strcat(prompt_and_input, input);
300 fprintf(destination, "%s\n", prompt_and_input);
301 free(prompt_and_input);
304 int word_count(char* s)
306 char* copy = xstrdup(s);
307 char delims[] = " \t";
311 word = strtok(copy, delims);
312 while (word != NULL) {
313 word = strtok(NULL, delims);
323 char input_prompt[] = "> ";
324 if (!settings.prompt)
325 input_prompt[0] = '\0';
327 // Print a blank line
332 input = readline(input_prompt);
334 if (input == NULL) // Got EOF; return with it.
336 else if (input[0] == '#') { // Ignore comments.
339 } else // We have a 'normal' line; leave the loop.
343 // Strip trailing newlines from the input
344 input[strcspn(input, "\n")] = 0;
349 echo_input(stdout, input_prompt, input);
352 echo_input(settings.logfp, "", input);
366 // Should be unreachable. Reply should never be NULL
372 char* firstword = (char*) xmalloc(strlen(reply) + 1);
373 sscanf(reply, "%s", firstword);
377 for (int i = 0; i < (int)strlen(firstword); ++i)
378 firstword[i] = tolower(firstword[i]);
380 int yes = strncmp("yes", firstword, sizeof("yes") - 1);
381 int y = strncmp("y", firstword, sizeof("y") - 1);
382 int no = strncmp("no", firstword, sizeof("no") - 1);
383 int n = strncmp("n", firstword, sizeof("n") - 1);
391 } else if (no == 0 ||
396 rspeak(PLEASE_ANSWER);
402 bool yes(const char* question, const char* yes_response, const char* no_response)
403 /* Print message X, wait for yes/no answer. If yes, print Y and return true;
404 * if no, print Z and return false. */
415 // Should be unreachable. Reply should never be NULL
421 char* firstword = (char*) xmalloc(strlen(reply) + 1);
422 sscanf(reply, "%s", firstword);
426 for (int i = 0; i < (int)strlen(firstword); ++i)
427 firstword[i] = tolower(firstword[i]);
429 int yes = strncmp("yes", firstword, sizeof("yes") - 1);
430 int y = strncmp("y", firstword, sizeof("y") - 1);
431 int no = strncmp("no", firstword, sizeof("no") - 1);
432 int n = strncmp("n", firstword, sizeof("n") - 1);
441 } else if (no == 0 ||
447 rspeak(PLEASE_ANSWER);
454 /* Data structure routines */
456 int get_motion_vocab_id(const char* word)
457 // Return the first motion number that has 'word' as one of its words.
459 for (int i = 0; i < NMOTIONS; ++i) {
460 for (int j = 0; j < motions[i].words.n; ++j) {
461 if (strcasecmp(word, motions[i].words.strs[j]) == 0 && (strlen(word) > 1 ||
462 strchr(ignore, word[0]) == NULL ||
467 // If execution reaches here, we didn't find the word.
468 return (WORD_NOT_FOUND);
471 int get_object_vocab_id(const char* word)
472 // Return the first object number that has 'word' as one of its words.
474 for (int i = 0; i < NOBJECTS + 1; ++i) { // FIXME: the + 1 should go when 1-indexing for objects is removed
475 for (int j = 0; j < objects[i].words.n; ++j) {
476 if (strcasecmp(word, objects[i].words.strs[j]) == 0)
480 // If execution reaches here, we didn't find the word.
481 return (WORD_NOT_FOUND);
484 int get_action_vocab_id(const char* word)
485 // Return the first motion number that has 'word' as one of its words.
487 for (int i = 0; i < NACTIONS; ++i) {
488 for (int j = 0; j < actions[i].words.n; ++j) {
489 if (strcasecmp(word, actions[i].words.strs[j]) == 0 && (strlen(word) > 1 ||
490 strchr(ignore, word[0]) == NULL ||
495 // If execution reaches here, we didn't find the word.
496 return (WORD_NOT_FOUND);
499 int get_special_vocab_id(const char* word)
500 // Return the first special number that has 'word' as one of its words.
502 for (int i = 0; i < NSPECIALS; ++i) {
503 for (int j = 0; j < specials[i].words.n; ++j) {
504 if (strcasecmp(word, specials[i].words.strs[j]) == 0)
508 // If execution reaches here, we didn't find the word.
509 return (WORD_NOT_FOUND);
512 long get_vocab_id(const char* word)
513 // Search the vocab categories in order for the supplied word.
517 /* FIXME: Magic numbers related to vocabulary */
518 ref_num = get_motion_vocab_id(word);
519 if (ref_num != WORD_NOT_FOUND)
520 return (ref_num + 0); // FIXME: replace with a proper hash
522 ref_num = get_object_vocab_id(word);
523 if (ref_num != WORD_NOT_FOUND)
524 return (ref_num + 1000); // FIXME: replace with a proper hash
526 ref_num = get_action_vocab_id(word);
527 if (ref_num != WORD_NOT_FOUND)
528 return (ref_num + 2000); // FIXME: replace with a proper hash
530 ref_num = get_special_vocab_id(word);
531 if (ref_num != WORD_NOT_FOUND)
532 return (ref_num + 3000); // FIXME: replace with a proper hash
534 // Check for the reservoir magic word.
535 if (strcasecmp(word, game.zzword) == 0)
536 return (PART + 2000); // FIXME: replace with a proper hash
538 return (WORD_NOT_FOUND);
541 void juggle(long object)
542 /* Juggle an object by picking it up and putting it down again, the purpose
543 * being to get the object to the front of the chain of things at its loc. */
547 i = game.place[object];
548 j = game.fixed[object];
550 move(object + NOBJECTS, j);
553 void move(long object, long where)
554 /* Place any object anywhere by picking it up and dropping it. May
555 * already be toting, in which case the carry is a no-op. Mustn't
556 * pick up objects which are not at any loc, since carry wants to
557 * remove objects from game.atloc chains. */
561 if (object > NOBJECTS)
562 from = game.fixed[object - NOBJECTS];
564 from = game.place[object];
565 if (from != LOC_NOWHERE && from != CARRIED && !SPECIAL(from))
570 long put(long object, long where, long pval)
571 /* PUT is the same as MOVE, except it returns a value used to set up the
572 * negated game.prop values for the repository objects. */
578 void carry(long object, long where)
579 /* Start toting an object, removing it from the list of things at its former
580 * location. Incr holdng unless it was already being toted. If object>NOBJECTS
581 * (moving "fixed" second loc), don't change game.place or game.holdng. */
585 if (object <= NOBJECTS) {
586 if (game.place[object] == CARRIED)
588 game.place[object] = CARRIED;
591 if (game.atloc[where] == object) {
592 game.atloc[where] = game.link[object];
595 temp = game.atloc[where];
596 while (game.link[temp] != object) {
597 temp = game.link[temp];
599 game.link[temp] = game.link[object];
602 void drop(long object, long where)
603 /* Place an object at a given loc, prefixing it onto the game.atloc list. Decr
604 * game.holdng if the object was being toted. */
606 if (object > NOBJECTS)
607 game.fixed[object - NOBJECTS] = where;
609 if (game.place[object] == CARRIED)
611 game.place[object] = where;
615 game.link[object] = game.atloc[where];
616 game.atloc[where] = object;
619 long atdwrf(long where)
620 /* Return the index of first dwarf at the given location, zero if no dwarf is
621 * there (or if dwarves not active yet), -1 if all dwarves are dead. Ignore
622 * the pirate (6th dwarf). */
630 for (long i = 1; i <= NDWARVES - 1; i++) {
631 if (game.dloc[i] == where)
633 if (game.dloc[i] != 0)
639 /* Utility routines (setbit, tstbit, set_seed, get_next_lcg_value,
642 long setbit(long bit)
643 /* Returns 2**bit for use in constructing bit-masks. */
648 bool tstbit(long mask, int bit)
649 /* Returns true if the specified bit is set in the mask. */
651 return (mask & (1 << bit)) != 0;
654 void set_seed(long seedval)
655 /* Set the LCG seed */
657 game.lcg_x = (unsigned long) seedval % game.lcg_m;
659 // once seed is set, we need to generate the Z`ZZZ word
660 make_zzword(game.zzword);
663 unsigned long get_next_lcg_value(void)
664 /* Return the LCG's current value, and then iterate it. */
666 unsigned long old_x = game.lcg_x;
667 game.lcg_x = (game.lcg_a * game.lcg_x + game.lcg_c) % game.lcg_m;
671 long randrange(long range)
672 /* Return a random integer from [0, range). */
674 return range * get_next_lcg_value() / game.lcg_m;
677 void make_zzword(char zzword[TOKLEN+1])
679 for (int i = 0; i < 5; ++i) {
680 zzword[i] = 'A' + randrange(26);
682 zzword[1] = '\''; // force second char to apostrophe
687 void bug(enum bugtype num, const char *error_string)
689 fprintf(stderr, "Fatal error %d, %s.\n", num, error_string);