10 #include "linenoise/linenoise.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, 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
180 // adjusting the parameter accordingly, and replacing the
181 // specifier with %s.
182 long previous_arg = 0;
183 for (int i = 0; i < msglen; i++) {
188 long arg = va_arg(ap, long);
192 // Integer specifier. In order to accommodate the fact
193 // that PARMS can have both legitimate integers *and*
194 // packed tokens, stringify everything. Future work may
195 // eliminate the need for this.
197 int ret = snprintf(renderp, size, "%ld", arg);
204 // Unmodified string specifier.
206 packed_to_token(arg, renderp); /* unpack directly to destination */
207 size_t len = strlen(renderp);
212 // Singular/plural specifier.
214 if (previous_arg > 1) { // look at the *previous* parameter (which by necessity must be numeric)
220 /* Version specifier */
222 strcpy(renderp, VERSION);
223 size_t len = strlen(VERSION);
228 // All-lowercase specifier.
229 if (msg[i] == 'L' || msg[i] == 'C') {
230 packed_to_token(arg, renderp); /* unpack directly to destination */
231 int len = strlen(renderp);
232 for (int j = 0; j < len; ++j) {
233 renderp[j] = tolower(renderp[j]);
235 if (msg[i] == 'C') // First char uppercase, rest lowercase.
236 renderp[0] = toupper(renderp[0]);
246 // Deal with messages that are in YAML block format and therefore
247 // have their own trailing \n
248 if (renderp > rendered && renderp[-1] == '\n')
251 // Print the message.
252 printf("%s\n", rendered);
257 void speak(const char* msg, ...)
265 void pspeak(vocab_t msg, enum speaktype mode, int skip, ...)
266 /* Find the skip+1st message from msg and print it. Modes are:
267 * feel = for inventory, what you can touch
268 * look = the long description for the state the object is in
269 * listen = the sound for the state the object is in
270 * study = text on the object. */
276 vspeak(objects[msg].inventory, ap);
279 vspeak(objects[msg].descriptions[skip], ap);
282 vspeak(objects[msg].sounds[skip], ap);
285 vspeak(objects[msg].texts[skip], ap);
288 vspeak(objects[msg].changes[skip], ap);
294 void rspeak(vocab_t i, ...)
295 /* Print the i-th "random" message (section 6 of database). */
299 vspeak(arbitrary_messages[i], ap);
303 void echo_input(FILE* destination, char* input_prompt, char* input)
305 size_t len = strlen(input_prompt) + strlen(input) + 1;
306 char* prompt_and_input = (char*) xmalloc(len);
307 strcpy(prompt_and_input, input_prompt);
308 strcat(prompt_and_input, input);
309 fprintf(destination, "%s\n", prompt_and_input);
310 free(prompt_and_input);
313 int word_count(char* s)
315 char* copy = xstrdup(s);
316 char delims[] = " \t";
320 word = strtok(copy, delims);
321 while (word != NULL) {
322 word = strtok(NULL, delims);
332 char input_prompt[] = "> ";
334 input_prompt[0] = '\0';
336 // Print a blank line if game.blklin tells us to.
337 if (game.blklin == true)
343 input = linenoise(input_prompt);
349 // Should be unreachable in tests, as they will use a non-interactive shell.
350 printf("%s", input_prompt);
352 ssize_t numread = getline(&input, &n, stdin);
353 if (numread == -1) // Got EOF; return with it.
357 if (input == NULL) // Got EOF; return with it.
359 else if (input[0] == '#') { // Ignore comments.
360 linenoiseFree(input);
362 } else // We have a 'normal' line; leave the loop.
366 // Strip trailing newlines from the input
367 input[strcspn(input, "\n")] = 0;
369 linenoiseHistoryAdd(input);
372 echo_input(stdout, input_prompt, input);
375 echo_input(logfp, input_prompt, input);
389 // Should be unreachable. Reply should never be NULL
390 linenoiseFree(reply);
395 char* firstword = (char*) xmalloc(strlen(reply) + 1);
396 sscanf(reply, "%s", firstword);
398 linenoiseFree(reply);
400 for (int i = 0; i < (int)strlen(firstword); ++i)
401 firstword[i] = tolower(firstword[i]);
403 int yes = strncmp("yes", firstword, sizeof("yes") - 1);
404 int y = strncmp("y", firstword, sizeof("y") - 1);
405 int no = strncmp("no", firstword, sizeof("no") - 1);
406 int n = strncmp("n", firstword, sizeof("n") - 1);
410 if (yes == 0 || y == 0) {
413 } else if (no == 0 || n == 0) {
417 rspeak(PLEASE_ANSWER);
423 bool yes(const char* question, const char* yes_response, const char* no_response)
424 /* Print message X, wait for yes/no answer. If yes, print Y and return true;
425 * if no, print Z and return false. */
436 // Should be unreachable. Reply should never be NULL
437 linenoiseFree(reply);
442 char* firstword = (char*) xmalloc(strlen(reply) + 1);
443 sscanf(reply, "%s", firstword);
445 linenoiseFree(reply);
447 for (int i = 0; i < (int)strlen(firstword); ++i)
448 firstword[i] = tolower(firstword[i]);
450 int yes = strncmp("yes", firstword, sizeof("yes") - 1);
451 int y = strncmp("y", firstword, sizeof("y") - 1);
452 int no = strncmp("no", firstword, sizeof("no") - 1);
453 int n = strncmp("n", firstword, sizeof("n") - 1);
457 if (yes == 0 || y == 0) {
461 } else if (no == 0 || n == 0) {
466 rspeak(PLEASE_ANSWER);
473 /* Data structure routines */
475 int get_motion_vocab_id(const char* word)
476 // Return the first motion number that has 'word' as one of its words.
478 for (int i = 0; i < NMOTIONS; ++i) {
479 for (int j = 0; j < motions[i].words.n; ++j) {
480 if (strcasecmp(word, motions[i].words.strs[j]) == 0)
484 // If execution reaches here, we didn't find the word.
485 return (WORD_NOT_FOUND);
488 int get_object_vocab_id(const char* word)
489 // Return the first object number that has 'word' as one of its words.
491 for (int i = 0; i < NOBJECTS + 1; ++i) { // FIXME: the + 1 should go when 1-indexing for objects is removed
492 for (int j = 0; j < objects[i].words.n; ++j) {
493 if (strcasecmp(word, objects[i].words.strs[j]) == 0)
497 // If execution reaches here, we didn't find the word.
498 return (WORD_NOT_FOUND);
501 int get_action_vocab_id(const char* word)
502 // Return the first motion number that has 'word' as one of its words.
504 for (int i = 0; i < NACTIONS; ++i) {
505 for (int j = 0; j < actions[i].words.n; ++j) {
506 if (strcasecmp(word, actions[i].words.strs[j]) == 0)
510 // If execution reaches here, we didn't find the word.
511 return (WORD_NOT_FOUND);
514 int get_special_vocab_id(const char* word)
515 // Return the first special number that has 'word' as one of its words.
517 for (int i = 0; i < NSPECIALS; ++i) {
518 for (int j = 0; j < specials[i].words.n; ++j) {
519 if (strcasecmp(word, specials[i].words.strs[j]) == 0)
523 // If execution reaches here, we didn't find the word.
524 return (WORD_NOT_FOUND);
527 long get_vocab_id(const char* word)
528 // Search the vocab categories in order for the supplied word.
532 ref_num = get_motion_vocab_id(word);
533 if (ref_num != WORD_NOT_FOUND)
534 return (ref_num + 0); // FIXME: replace with a proper hash
536 ref_num = get_object_vocab_id(word);
537 if (ref_num != WORD_NOT_FOUND)
538 return (ref_num + 1000); // FIXME: replace with a proper hash
540 ref_num = get_action_vocab_id(word);
541 if (ref_num != WORD_NOT_FOUND)
542 return (ref_num + 2000); // FIXME: replace with a proper hash
544 ref_num = get_special_vocab_id(word);
545 if (ref_num != WORD_NOT_FOUND)
546 return (ref_num + 3000); // FIXME: replace with a proper hash
548 // Check for the reservoir magic word.
549 if (strcasecmp(word, game.zzword) == 0)
550 return (PART + 2000); // FIXME: replace with a proper hash
552 return (WORD_NOT_FOUND);
555 void juggle(long object)
556 /* Juggle an object by picking it up and putting it down again, the purpose
557 * being to get the object to the front of the chain of things at its loc. */
561 i = game.place[object];
562 j = game.fixed[object];
564 move(object + NOBJECTS, j);
567 void move(long object, long where)
568 /* Place any object anywhere by picking it up and dropping it. May
569 * already be toting, in which case the carry is a no-op. Mustn't
570 * pick up objects which are not at any loc, since carry wants to
571 * remove objects from game.atloc chains. */
575 if (object > NOBJECTS)
576 from = game.fixed[object - NOBJECTS];
578 from = game.place[object];
579 if (from != LOC_NOWHERE && from != CARRIED && !SPECIAL(from))
584 long put(long object, long where, long pval)
585 /* PUT is the same as MOVE, except it returns a value used to set up the
586 * negated game.prop values for the repository objects. */
592 void carry(long object, long where)
593 /* Start toting an object, removing it from the list of things at its former
594 * location. Incr holdng unless it was already being toted. If object>NOBJECTS
595 * (moving "fixed" second loc), don't change game.place or game.holdng. */
599 if (object <= NOBJECTS) {
600 if (game.place[object] == CARRIED)
602 game.place[object] = CARRIED;
605 if (game.atloc[where] == object) {
606 game.atloc[where] = game.link[object];
609 temp = game.atloc[where];
610 while (game.link[temp] != object) {
611 temp = game.link[temp];
613 game.link[temp] = game.link[object];
616 void drop(long object, long where)
617 /* Place an object at a given loc, prefixing it onto the game.atloc list. Decr
618 * game.holdng if the object was being toted. */
620 if (object > NOBJECTS)
621 game.fixed[object - NOBJECTS] = where;
623 if (game.place[object] == CARRIED)
625 game.place[object] = where;
629 game.link[object] = game.atloc[where];
630 game.atloc[where] = object;
633 long atdwrf(long where)
634 /* Return the index of first dwarf at the given location, zero if no dwarf is
635 * there (or if dwarves not active yet), -1 if all dwarves are dead. Ignore
636 * the pirate (6th dwarf). */
644 for (long i = 1; i <= NDWARVES - 1; i++) {
645 if (game.dloc[i] == where)
647 if (game.dloc[i] != 0)
653 /* Utility routines (SETBIT, TSTBIT, set_seed, get_next_lcg_value,
654 * randrange, RNDVOC) */
656 long setbit(long bit)
657 /* Returns 2**bit for use in constructing bit-masks. */
662 bool tstbit(long mask, int bit)
663 /* Returns true if the specified bit is set in the mask. */
665 return (mask & (1 << bit)) != 0;
668 void set_seed(long seedval)
669 /* Set the LCG seed */
671 game.lcg_x = (unsigned long) seedval % game.lcg_m;
674 unsigned long get_next_lcg_value(void)
675 /* Return the LCG's current value, and then iterate it. */
677 unsigned long old_x = game.lcg_x;
678 game.lcg_x = (game.lcg_a * game.lcg_x + game.lcg_c) % game.lcg_m;
682 long randrange(long range)
683 /* Return a random integer from [0, range). */
685 return range * get_next_lcg_value() / game.lcg_m;
688 void make_zzword(char zzword[6])
690 for (int i = 0; i < 5; ++i) {
691 zzword[i] = 'A' + randrange(26);
693 zzword[1] = '\''; // force second char to apostrophe
697 void datime(long* d, long* t)
700 gettimeofday(&tv, NULL);
701 *d = (long) tv.tv_sec;
702 *t = (long) tv.tv_usec;
706 void bug(enum bugtype num, const char *error_string)
708 fprintf(stderr, "Fatal error %d, %s.\n", num, error_string);