10 #include "linenoise/linenoise.h"
13 const char new_advent_to_ascii[] = {
14 ' ', '!', '"', '#', '$', '%', '&', '\'',
15 '(', ')', '*', '+', ',', '-', '.', '/',
16 '0', '1', '2', '3', '4', '5', '6', '7',
17 '8', '9', ':', ';', '<', '=', '>', '?',
18 '@', 'A', 'B', 'C', 'D', 'E', 'F', 'G',
19 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O',
20 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W',
21 'X', 'Y', 'Z', '\0', '\0', '\0', '\0', '\0',
24 const char new_ascii_to_advent[] = {
25 63, 63, 63, 63, 63, 63, 63, 63,
26 63, 63, 63, 63, 63, 63, 63, 63,
27 63, 63, 63, 63, 63, 63, 63, 63,
28 63, 63, 63, 63, 63, 63, 63, 63,
30 0, 1, 2, 3, 4, 5, 6, 7,
31 8, 9, 10, 11, 12, 13, 14, 15,
32 16, 17, 18, 19, 20, 21, 22, 23,
33 24, 25, 26, 27, 28, 29, 30, 31,
34 32, 33, 34, 35, 36, 37, 38, 39,
35 40, 41, 42, 43, 44, 45, 46, 47,
36 48, 49, 50, 51, 52, 53, 54, 55,
37 56, 57, 58, 59, 60, 61, 62, 63,
39 63, 63, 63, 63, 63, 63, 63, 63,
40 63, 63, 63, 63, 63, 63, 63, 63,
41 63, 63, 63, 63, 63, 63, 63, 63,
42 63, 63, 63, 63, 63, 63, 63, 63,
45 char* xstrdup(const char* s)
47 char* ptr = strdup(s);
50 // exclude from coverage analysis because we can't simulate an out of memory error in testing
51 fprintf(stderr, "Out of memory!\n");
57 void* xmalloc(size_t size)
59 void* ptr = malloc(size);
62 // exclude from coverage analysis because we can't simulate an out of memory error in testing
63 fprintf(stderr, "Out of memory!\n");
70 void packed_to_token(long packed, char token[6])
72 // Unpack and map back to ASCII.
73 for (int i = 0; i < 5; ++i) {
74 char advent = (packed >> i * 6) & 63;
75 token[i] = new_advent_to_ascii[(int) advent];
78 // Ensure the last character is \0.
81 // Replace trailing whitespace with \0.
82 for (int i = 4; i >= 0; --i) {
83 if (token[i] == ' ' || token[i] == '\t')
90 long token_to_packed(const char token[6])
92 size_t t_len = strlen(token);
94 for (size_t i = 0; i < t_len; ++i)
96 char mapped = new_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));
111 words[1] = (char*) xmalloc(strlen(raw));
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, GETIN, YES) */
158 void vspeak(const char* msg, 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)
168 // Print a newline if the global game.blklin says to.
169 if (game.blklin == true)
172 int msglen = strlen(msg);
175 ssize_t size = 2000; /* msglen > 50 ? msglen*2 : 100; */
176 char* rendered = xmalloc(size);
177 char* renderp = rendered;
179 // Handle format specifiers (including the custom %C, %L, %S) by adjusting the parameter accordingly, and replacing the specifier with %s.
180 long previous_arg = 0;
181 for (int i = 0; i < msglen; i++) {
186 long arg = va_arg(ap, long);
190 // 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.
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 // All-lowercase specifier.
216 if (msg[i] == 'L' || msg[i] == 'C') {
217 packed_to_token(arg, renderp); /* unpack directly to destination */
218 int len = strlen(renderp);
219 for (int j = 0; j < len; ++j) {
220 renderp[j] = tolower(renderp[j]);
222 if (msg[i] == 'C') // First char uppercase, rest lowercase.
223 renderp[0] = toupper(renderp[0]);
233 // Print the message.
234 printf("%s\n", rendered);
239 void speak(const char* msg, ...)
247 void pspeak(vocab_t msg, enum speaktype mode, int skip, ...)
248 /* Find the skip+1st message from msg and print it. Modes are:
249 * feel = for inventory, what you can touch
250 * look = the long description for the state the object is in
251 * listen = the sound for the state the object is in
252 * study = text on the object. */
258 vspeak(objects[msg].inventory, ap);
261 vspeak(objects[msg].descriptions[skip], ap);
264 vspeak(objects[msg].sounds[skip], ap);
267 vspeak(objects[msg].texts[skip], ap);
270 vspeak(objects[msg].changes[skip], ap);
276 void rspeak(vocab_t i, ...)
277 /* Print the i-th "random" message (section 6 of database). */
281 vspeak(arbitrary_messages[i], ap);
285 void echo_input(FILE* destination, char* input_prompt, char* input)
287 size_t len = strlen(input_prompt) + strlen(input) + 1;
288 char* prompt_and_input = (char*) xmalloc(len);
289 strcpy(prompt_and_input, input_prompt);
290 strcat(prompt_and_input, input);
291 fprintf(destination, "%s\n", prompt_and_input);
292 free(prompt_and_input);
295 int word_count(char* s)
297 char* copy = xstrdup(s);
298 char delims[] = " \t";
302 word = strtok(copy, delims);
305 word = strtok(NULL, delims);
315 char input_prompt[] = "> ";
317 input_prompt[0] = '\0';
319 // Print a blank line if game.blklin tells us to.
320 if (game.blklin == true)
326 input = linenoise(input_prompt);
332 // Should be unreachable in tests, as they will use a non-interactive shell.
333 printf("%s", input_prompt);
335 ssize_t numread = getline(&input, &n, stdin);
336 if (numread == -1) // Got EOF; return with it.
340 if (input == NULL) // Got EOF; return with it.
342 else if (input[0] == '#') // Ignore comments.
344 else // We have a 'normal' line; leave the loop.
348 // Strip trailing newlines from the input
349 input[strcspn(input, "\n")] = 0;
351 linenoiseHistoryAdd(input);
354 echo_input(stdout, input_prompt, input);
357 echo_input(logfp, input_prompt, input);
371 // Should be unreachable. Reply should never be NULL
372 linenoiseFree(reply);
377 char* firstword = (char*) xmalloc(strlen(reply)+1);
378 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);
399 linenoiseFree(reply);
404 bool yes(const char* question, const char* yes_response, const char* no_response)
405 /* Print message X, wait for yes/no answer. If yes, print Y and return true;
406 * if no, print Z and return false. */
417 // Should be unreachable. Reply should never be NULL
418 linenoiseFree(reply);
423 char* firstword = (char*) xmalloc(strlen(reply)+1);
424 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);
436 if (yes == 0 || y == 0) {
440 } else if (no == 0 || n == 0) {
445 rspeak(PLEASE_ANSWER);
447 linenoiseFree(reply);
451 /* Data structure routines */
453 int get_motion_vocab_id(const char* word)
454 // Return the first motion number that has 'word' as one of its words.
456 for (int i = 0; i < NMOTIONS; ++i)
458 for (int j = 0; j < motions[i].words.n; ++j)
460 if (strcasecmp(word, motions[i].words.strs[j]) == 0)
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
473 for (int j = 0; j < objects[i].words.n; ++j)
475 if (strcasecmp(word, objects[i].words.strs[j]) == 0)
479 // If execution reaches here, we didn't find the word.
480 return(WORD_NOT_FOUND);
483 int get_action_vocab_id(const char* word)
484 // Return the first motion number that has 'word' as one of its words.
486 for (int i = 0; i < NACTIONS; ++i)
488 for (int j = 0; j < actions[i].words.n; ++j)
490 if (strcasecmp(word, actions[i].words.strs[j]) == 0)
494 // If execution reaches here, we didn't find the word.
495 return(WORD_NOT_FOUND);
498 int get_special_vocab_id(const char* word)
499 // Return the first special number that has 'word' as one of its words.
501 for (int i = 0; i < NSPECIALS; ++i)
503 for (int j = 0; j < specials[i].words.n; ++j)
505 if (strcasecmp(word, specials[i].words.strs[j]) == 0)
509 // If execution reaches here, we didn't find the word.
510 return(WORD_NOT_FOUND);
513 long get_vocab_id(const char* word)
514 // Search the vocab categories in order for the supplied word.
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,
640 * randrange, RNDVOC) */
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;
660 unsigned long get_next_lcg_value(void)
661 /* Return the LCG's current value, and then iterate it. */
663 unsigned long old_x = game.lcg_x;
664 game.lcg_x = (game.lcg_a * game.lcg_x + game.lcg_c) % game.lcg_m;
668 long randrange(long range)
669 /* Return a random integer from [0, range). */
671 return range * get_next_lcg_value() / game.lcg_m;
674 void make_zzword(char zzword[6])
676 for (int i = 0; i < 5; ++i)
678 zzword[i] = 'A' + randrange(26);
680 zzword[1] = '\''; // force second char to apostrophe
684 void datime(long* d, long* t)
687 gettimeofday(&tv, NULL);
688 *d = (long) tv.tv_sec;
689 *t = (long) tv.tv_usec;
693 void bug(enum bugtype num, const char *error_string)
695 fprintf(stderr, "Fatal error %d, %s.\n", num, error_string);