10 #include "linenoise/linenoise.h"
13 void* xmalloc(size_t size)
15 void* ptr = malloc(size);
18 fprintf(stderr, "Out of memory!\n");
24 void packed_to_token(long packed, char token[6])
26 for (int i = 0; i < 5; ++i)
28 char advent = (packed >> i * 6) & 63;
29 token[i] = advent_to_ascii[advent];
34 /* I/O routines (SPEAK, PSPEAK, RSPEAK, SETPRM, GETIN, YES) */
36 void newspeak(char* msg)
38 // Do nothing if we got a null pointer.
42 // Do nothing if we got an empty string.
46 // Print a newline if the global game.blklin says to.
47 if (game.blklin == true)
50 // Create a copy of our string, so we can edit it.
51 char* copy = (char*) xmalloc(strlen(msg) + 1);
52 strncpy(copy, msg, strlen(msg) + 1);
54 // Staging area for stringified parameters.
55 char parameters[5][100]; // FIXME: to be replaced with dynamic allocation
57 // Handle format specifiers (including the custom %C, %L, %S) by adjusting the parameter accordingly, and replacing the specifier with %s.
58 int pi = 0; // parameter index
59 for (int i = 0; i < strlen(msg); ++i)
65 // 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.
66 if (msg[i + 1] == 'd')
69 sprintf(parameters[pi], "%d", PARMS[pi]);
72 // Unmodified string specifier.
73 if (msg[i + 1] == 's')
75 packed_to_token(PARMS[pi], parameters[pi]);
78 // Singular/plural specifier.
79 if (msg[i + 1] == 'S')
82 if (PARMS[pi - 1] > 1) // look at the *previous* parameter (which by necessity must be numeric)
84 sprintf(parameters[pi], "%s", "s");
88 sprintf(parameters[pi], "%s", "");
92 // All-lowercase specifier.
93 if (msg[i + 1] == 'L')
96 packed_to_token(PARMS[pi], parameters[pi]);
97 for (int i = 0; i < strlen(parameters[pi]); ++i)
99 parameters[pi][i] = tolower(parameters[pi][i]);
103 // First char uppercase, rest lowercase.
104 if (msg[i + 1] == 'C')
107 packed_to_token(PARMS[pi], parameters[pi]);
108 for (int i = 0; i < strlen(parameters[pi]); ++i)
110 parameters[pi][i] = tolower(parameters[pi][i]);
112 parameters[pi][0] = toupper(parameters[pi][0]);
117 // Render the final string.
118 char rendered[2000]; // FIXME: to be replaced with dynamic allocation
119 sprintf(&rendered, copy, parameters[1], parameters[2], parameters[3], parameters[4]); // FIXME: to be replaced with vsprintf()
121 // Print the message.
122 printf("%s\n", rendered);
127 void SPEAK(vocab_t msg)
128 /* Print the message which starts at LINES[N]. Precede it with a blank line
129 * unless game.blklin is false. */
131 long blank, casemake, i, nxt, neg, nparms, param, prmtyp, state;
138 nxt=labs(LINES[msg])-1;
143 for (i = msg; i <= nxt; i++) {
144 PUTTXT(LINES[i],&state,2);
149 while (LNPOSN <= LNLENG) {
150 if (INLINE[LNPOSN] != ascii_to_advent['%']) {
154 prmtyp = INLINE[LNPOSN+1];
155 /* A "%"; the next character determine the type of
156 * parameter: 1 (!) = suppress message completely, 29 (S) = NULL
157 * If PARAM=1, else 'S' (optional plural ending), 33 (W) = word
158 * (two 30-bit values) with trailing spaces suppressed, 22 (L) or
159 * 31 (U) = word but map to lower/upper case, 13 (C) = word in
160 * lower case with first letter capitalised, 65-73 (1-9) =
161 * number using that many characters. */
162 if (prmtyp == ascii_to_advent['!'])
164 if (prmtyp == ascii_to_advent['S']) {
166 INLINE[LNPOSN] = ascii_to_advent['s'];
167 if (PARMS[nparms] == 1)
172 if (prmtyp == ascii_to_advent['W'] || prmtyp == ascii_to_advent['L'] || prmtyp == ascii_to_advent['U'] || prmtyp == ascii_to_advent['C']) {
176 if (prmtyp == ascii_to_advent['U'])
178 if (prmtyp == ascii_to_advent['W'])
181 PUTTXT(PARMS[nparms],&state,casemake);
182 PUTTXT(PARMS[nparms+1],&state,casemake);
183 if (prmtyp == ascii_to_advent['C'] && INLINE[i] >= ascii_to_advent['a'] && INLINE[i] <= ascii_to_advent['z'])
185 // Convert to uppercase.
186 // Round-trip to ASCII and back so that this code doesn't break when the mapping changes.
187 // This can be simplified when mapping goes away.
188 char this = advent_to_ascii[INLINE[i]];
189 char uc_this = toupper(this);
190 INLINE[i] = ascii_to_advent[uc_this];
197 if (prmtyp < ascii_to_advent['!'] || prmtyp > ascii_to_advent['-']) {
201 SHFTXT(LNPOSN+2,prmtyp-2);
203 param=labs(PARMS[nparms]);
205 if (PARMS[nparms] < 0)
207 for (i=1; i <= prmtyp; i++) {
209 INLINE[LNPOSN]=MOD(param,10)+64;
210 if (i != 1 && param == 0) {
230 void PSPEAK(vocab_t msg,int skip)
231 /* Find the skip+1st message from msg and print it. msg should be
232 * the index of the inventory message for object. (INVEN+N+1 message
233 * is game.prop=N message). */
236 newspeak(object_descriptions[msg].longs[skip]);
238 newspeak(object_descriptions[msg].inventory);
241 void RSPEAK(vocab_t i)
242 /* Print the i-th "random" message (section 6 of database). */
244 newspeak(arbitrary_messages[i]);
247 void SETPRM(long first, long p1, long p2)
248 /* Stores parameters into the PRMCOM parms array for use by speak. P1 and P2
249 * are stored into PARMS(first) and PARMS(first+1). */
251 if (first >= MAXPARMS)
259 bool GETIN(FILE *input,
260 long *pword1, long *pword1x,
261 long *pword2, long *pword2x)
262 /* Get a command from the adventurer. Snarf out the first word, pad it with
263 * blanks, and return it in WORD1. Chars 6 thru 10 are returned in WORD1X, in
264 * case we need to print out the whole word in an error message. Any number of
265 * blanks may follow the word. If a second word appears, it is returned in
266 * WORD2 (chars 6 thru 10 in WORD2X), else WORD2 is -1. */
275 *pword1=GETTXT(true,true,true);
276 if (game.blklin && *pword1 < 0)
278 *pword1x=GETTXT(false,true,true);
280 junk=GETTXT(false,true,true);
283 *pword2=GETTXT(true,true,true);
284 *pword2x=GETTXT(false,true,true);
286 junk=GETTXT(false,true,true);
289 if (GETTXT(true,true,true) <= 0)
295 long YES(FILE *input, vocab_t x, vocab_t y, vocab_t z)
296 /* Print message X, wait for yes/no answer. If yes, print Y and return true;
297 * if no, print Z and return false. */
299 token_t reply, junk1, junk2, junk3;
303 GETIN(input, &reply, &junk1, &junk2, &junk3);
304 if (reply == MAKEWD(250519) || reply == MAKEWD(25)) {
308 if (reply == MAKEWD(1415) || reply == MAKEWD(14)) {
316 /* Line-parsing routines (GETTXT, MAKEWD, PUTTXT, SHFTXT, TYPE0) */
318 long GETTXT(bool skip, bool onewrd, bool upper)
319 /* Take characters from an input line and pack them into 30-bit words.
320 * Skip says to skip leading blanks. ONEWRD says stop if we come to a
321 * blank. UPPER says to map all letters to uppercase. If we reach the
322 * end of the line, the word is filled up with blanks (which encode as 0's).
323 * If we're already at end of line when TEXT is called, we return -1. */
326 static long splitting = -1;
328 if (LNPOSN != splitting)
334 if ((!skip) || INLINE[LNPOSN] != 0)
340 for (int I=1; I<=TOKLEN; I++) {
342 if (LNPOSN > LNLENG || (onewrd && INLINE[LNPOSN] == 0))
344 char current=INLINE[LNPOSN];
345 if (current < ascii_to_advent['%']) {
347 if (upper && current >= ascii_to_advent['a'])
353 if (splitting != LNPOSN) {
354 text=text+ascii_to_advent['%'];
359 text=text+current-ascii_to_advent['%'];
367 token_t MAKEWD(long letters)
368 /* Combine TOKLEN (currently 5) uppercase letters (represented by
369 * pairs of decimal digits in lettrs) to form a 30-bit value matching
370 * the one that GETTXT would return given those characters plus
371 * trailing blanks. Caution: lettrs will overflow 31 bits if
372 * 5-letter word starts with V-Z. As a kludgey workaround, you can
373 * increment a letter by 5 by adding 50 to the next pair of
376 long i = 1, word = 0;
378 for (long k=letters; k != 0; k=k/100) {
379 word=word+i*(MOD(k,50)+10);
381 if (MOD(k,100) > 50)word=word+i*5;
383 i=64L*64L*64L*64L*64L/i;
388 void PUTTXT(token_t word, long *state, long casemake)
389 /* Unpack the 30-bit value in word to obtain up to TOKLEN (currently
390 * 5) integer-encoded chars, and store them in inline starting at
391 * LNPOSN. If LNLENG>=LNPOSN, shift existing characters to the right
392 * to make room. STATE will be zero when puttxt is called with the
393 * first of a sequence of words, but is thereafter unchanged by the
394 * caller, so PUTTXT can use it to maintain state across calls.
395 * LNPOSN and LNLENG are incremented by the number of chars stored.
396 * If CASEMAKE=1, all letters are made uppercase; if -1, lowercase; if 0,
397 * as is. any other value for case is the same as 0 but also causes
398 * trailing blanks to be included (in anticipation of subsequent
399 * additional text). */
401 long alph1, alph2, byte, div, i, w;
403 alph1=13*casemake+24;
404 alph2=26*labs(casemake)+alph1;
405 if (labs(casemake) > 1)
407 /* alph1&2 define range of wrong-case chars, 11-36 or 37-62 or empty. */
410 for (i=1; i<=TOKLEN; i++)
412 if (w <= 0 && *state == 0 && labs(casemake) <= 1)
416 if (!(*state != 0 || byte != ascii_to_advent['%'])) {
417 *state=ascii_to_advent['%'];
422 if (*state < alph2 && *state >= alph1)*state=*state-26*casemake;
423 INLINE[LNPOSN]=*state;
428 #define PUTTXT(WORD,STATE,CASE) fPUTTXT(WORD,&STATE,CASE)
430 void SHFTXT(long from, long delta)
431 /* Move INLINE(N) to INLINE(N+DELTA) for N=FROM,LNLENG. Delta can be
432 * negative. LNLENG is updated; LNPOSN is not changed. */
436 if (!(LNLENG < from || delta == 0)) {
437 for (I=from; I<=LNLENG; I++) {
449 /* Type a blank line. This procedure is provided as a convenience for callers
450 * who otherwise have no use for MAPCOM. */
461 /* Data structure routines */
463 long VOCAB(long id, long init)
464 /* Look up ID in the vocabulary (ATAB) and return its "definition" (KTAB), or
465 * -1 if not found. If INIT is positive, this is an initialisation call setting
466 * up a keyword variable, and not finding it constitutes a bug. It also means
467 * that only KTAB values which taken over 1000 equal INIT may be considered.
468 * (Thus "STEPS", which is a motion verb as well as an object, may be located
469 * as an object.) And it also means the KTAB value is taken modulo 1000. */
473 for (i=1; i<=TABSIZ; i++) {
480 if (init >= 0 && KTAB[i]/1000 != init)
485 lexeme=MOD(lexeme,1000);
492 void DSTROY(long object)
493 /* Permanently eliminate "object" by moving to a non-existent location. */
498 void JUGGLE(long object)
499 /* Juggle an object by picking it up and putting it down again, the purpose
500 * being to get the object to the front of the chain of things at its loc. */
504 i=game.place[object];
505 j=game.fixed[object];
507 MOVE(object+NOBJECTS,j);
510 void MOVE(long object, long where)
511 /* Place any object anywhere by picking it up and dropping it. May
512 * already be toting, in which case the carry is a no-op. Mustn't
513 * pick up objects which are not at any loc, since carry wants to
514 * remove objects from game.atloc chains. */
518 if (object > NOBJECTS)
519 from=game.fixed[object-NOBJECTS];
521 from=game.place[object];
522 if (from > 0 && from <= 300)
527 long PUT(long object, long where, long pval)
528 /* PUT is the same as MOVE, except it returns a value used to set up the
529 * negated game.prop values for the repository objects. */
535 void CARRY(long object, long where)
536 /* Start toting an object, removing it from the list of things at its former
537 * location. Incr holdng unless it was already being toted. If object>NOBJECTS
538 * (moving "fixed" second loc), don't change game.place or game.holdng. */
542 if (object <= NOBJECTS) {
543 if (game.place[object] == -1)
545 game.place[object]= -1;
548 if (game.atloc[where] == object) {
549 game.atloc[where]=game.link[object];
552 temp=game.atloc[where];
553 while (game.link[temp] != object) {
554 temp=game.link[temp];
556 game.link[temp]=game.link[object];
559 void DROP(long object, long where)
560 /* Place an object at a given loc, prefixing it onto the game.atloc list. Decr
561 * game.holdng if the object was being toted. */
563 if (object > NOBJECTS)
564 game.fixed[object-NOBJECTS] = where;
567 if (game.place[object] == -1)
569 game.place[object] = where;
573 game.link[object] = game.atloc[where];
574 game.atloc[where] = object;
577 long ATDWRF(long where)
578 /* Return the index of first dwarf at the given location, zero if no dwarf is
579 * there (or if dwarves not active yet), -1 if all dwarves are dead. Ignore
580 * the pirate (6th dwarf). */
588 for (i=1; i<=NDWARVES-1; i++) {
589 if (game.dloc[i] == where)
591 if (game.dloc[i] != 0)
597 /* Utility routines (SETBIT, TSTBIT, set_seed, get_next_lcg_value,
598 * randrange, RNDVOC, BUG) */
600 long SETBIT(long bit)
601 /* Returns 2**bit for use in constructing bit-masks. */
606 bool TSTBIT(long mask, int bit)
607 /* Returns true if the specified bit is set in the mask. */
609 return (mask & (1 << bit)) != 0;
612 void set_seed(long seedval)
613 /* Set the LCG seed */
615 lcgstate.x = (unsigned long) seedval % lcgstate.m;
618 unsigned long get_next_lcg_value(void)
619 /* Return the LCG's current value, and then iterate it. */
621 unsigned long old_x = lcgstate.x;
622 lcgstate.x = (lcgstate.a * lcgstate.x + lcgstate.c) % lcgstate.m;
626 long randrange(long range)
627 /* Return a random integer from [0, range). */
629 return range * get_next_lcg_value() / lcgstate.m;
632 long RNDVOC(long second, long force)
633 /* Searches the vocabulary ATAB for a word whose second character is
634 * char, and changes that word such that each of the other four
635 * characters is a random letter. If force is non-zero, it is used
636 * as the new word. Returns the new word. */
641 for (int i = 1; i <= 5; i++) {
642 long j = 11 + randrange(26);
649 long div = 64L * 64L * 64L;
650 for (int i = 1; i <= TABSIZ; i++) {
651 if (MOD(ATAB[i]/div, 64L) == second)
662 /* The following conditions are currently considered fatal bugs. Numbers < 20
663 * are detected while reading the database; the others occur at "run time".
664 * 0 Message line > 70 characters
665 * 1 Null line in message
666 * 2 Too many words of messages
667 * 3 Too many travel options
668 * 4 Too many vocabulary words
669 * 5 Required vocabulary word not found
670 * 6 Too many RTEXT messages
672 * 8 Location has cond bit being set twice
673 * 9 Invalid section number in database
674 * 10 Too many locations
675 * 11 Too many class or turn messages
676 * 20 Special travel (500>L>300) exceeds goto list
677 * 21 Ran off end of vocabulary table
678 * 22 Vocabulary type (N/1000) not between 0 and 3
679 * 23 Intransitive action verb exceeds goto list
680 * 24 Transitive action verb exceeds goto list
681 * 25 Conditional travel entry with no alternative
682 * 26 Location has no travel entries
683 * 27 Hint number exceeds goto list
684 * 28 Invalid month returned by date function
685 * 29 Too many parameters given to SETPRM */
688 printf("Fatal error %ld. See source code for interpretation.\n", num);
692 /* Machine dependent routines (MAPLIN, TYPE, SAVEIO) */
694 bool MAPLIN(FILE *fp)
699 /* Read a line of input, from the specified input source,
700 * translate the chars to integers in the range 0-126 and store
701 * them in the common array "INLINE". Integer values are as follows:
702 * 0 = space [ASCII CODE 40 octal, 32 decimal]
703 * 1-2 = !" [ASCII 41-42 octal, 33-34 decimal]
704 * 3-10 = '()*+,-. [ASCII 47-56 octal, 39-46 decimal]
705 * 11-36 = upper-case letters
706 * 37-62 = lower-case letters
707 * 63 = percent (%) [ASCII 45 octal, 37 decimal]
708 * 64-73 = digits, 0 through 9
709 * Remaining characters can be translated any way that is convenient;
710 * The "TYPE" routine below is used to map them back to characters when
711 * necessary. The above mappings are required so that certain special
712 * characters are known to fit in 6 bits and/or can be easily spotted.
713 * Array elements beyond the end of the line should be filled with 0,
714 * and LNLENG should be set to the index of the last character.
716 * If the data file uses a character other than space (e.g., tab) to
717 * separate numbers, that character should also translate to 0.
719 * This procedure may use the map1,map2 arrays to maintain static data for
720 * the mapping. MAP2(1) is set to 0 when the program starts
721 * and is not changed thereafter unless the routines on this page choose
724 if (!oldstyle && !isatty(1))
728 IGNORE(fgets(rawbuf,sizeof(rawbuf)-1,fp));
731 char *cp = linenoise("> ");
734 strncpy(rawbuf, cp, sizeof(rawbuf)-1);
735 linenoiseHistoryAdd(rawbuf);
736 strncat(rawbuf, "\n", sizeof(rawbuf)-1);
741 (!eof && rawbuf[0] == '#');
743 if (logfp && fp == stdin)
747 if (logfp && fp == stdin)
748 IGNORE(fputs(rawbuf, logfp));
750 IGNORE(fputs(rawbuf, stdout));
751 strcpy(INLINE+1, rawbuf);
753 for (i=1; i<=(long)sizeof(INLINE) && INLINE[i]!=0; i++) {
755 INLINE[i]=ascii_to_advent[val];
765 /* Type the first "LNLENG" characters stored in inline, mapping them
766 * from integers to text per the rules described above. INLINE
767 * may be changed by this routine. */
776 for (i=1; i<=LNLENG; i++) {
777 INLINE[i]=advent_to_ascii[INLINE[i]];
780 printf("%s\n", INLINE+1);
784 void DATIME(long* d, long* t)
787 gettimeofday(&tv, NULL);
788 *d = (long) tv.tv_sec;
789 *t = (long) tv.tv_usec;
792 long MOD(long n, long m)