9 #include "linenoise/linenoise.h"
11 /* hack to ignore GCC Unused Result */
12 #define IGNORE(r) do{if (r){}}while(0)
14 #define PERCENT 63 /* partly hide the packed encoding */
16 /* I/O routines (SPEAK, PSPEAK, RSPEAK, SETPRM, GETIN, YES) */
18 void SPEAK(vocab_t msg)
19 /* Print the message which starts at LINES[N]. Precede it with a blank line
20 * unless game.blklin is false. */
22 long blank, casemake, i, nxt, neg, nparms, param, prmtyp, state;
29 nxt=labs(LINES[msg])-1;
34 for (i = msg; i <= nxt; i++) {
35 PUTTXT(LINES[i],state,2);
40 while (LNPOSN <= LNLENG) {
41 if (INLINE[LNPOSN] != PERCENT) {
45 prmtyp = INLINE[LNPOSN+1];
46 /* A "%"; the next character determine the type of
47 * parameter: 1 (!) = suppress message completely, 29 (S) = NULL
48 * If PARAM=1, else 'S' (optional plural ending), 33 (W) = word
49 * (two 30-bit values) with trailing spaces suppressed, 22 (L) or
50 * 31 (U) = word but map to lower/upper case, 13 (C) = word in
51 * lower case with first letter capitalised, 30 (T) = text ending
52 * with a word of -1, 65-73 (1-9) = number using that many
53 * characters, 12 (B) = variable number of blanks. */
59 if (PARMS[nparms] == 1)
69 while (PARMS[nparms] > 0) {
70 if (PARMS[nparms+1] < 0)
72 PUTTXT(PARMS[nparms],state,casemake);
80 SHFTXT(LNPOSN+2,prmtyp-2);
82 for (i=1; i<=prmtyp; i++) {
90 if (prmtyp == 33 || prmtyp == 22 || prmtyp == 31 || prmtyp == 13) {
99 PUTTXT(PARMS[nparms],state,casemake);
100 PUTTXT(PARMS[nparms+1],state,casemake);
101 if (prmtyp == 13 && INLINE[i] >= 37 && INLINE[i] <= 62)
108 if (prmtyp < 1 || prmtyp > 9) {
112 SHFTXT(LNPOSN+2,prmtyp-2);
114 param=labs(PARMS[nparms]);
116 if (PARMS[nparms] < 0)
118 for (i=1; i <= prmtyp; i++) {
120 INLINE[LNPOSN]=MOD(param,10)+64;
121 if (i != 1 && param == 0) {
141 void PSPEAK(vocab_t msg,int skip)
142 /* Find the skip+1st message from msg and print it. msg should be
143 * the index of the inventory message for object. (INVEN+N+1 message
144 * is game.prop=N message). */
150 for (i=0; i <=skip; i++) {
160 void RSPEAK(vocab_t i)
161 /* Print the i-th "random" message (section 6 of database). */
167 void SETPRM(long first, long p1, long p2)
168 /* Stores parameters into the PRMCOM parms array for use by speak. P1 and P2
169 * are stored into PARMS(first) and PARMS(first+1). */
171 if (first >= MAXPARMS)
179 bool fGETIN(FILE *input,
180 long *pword1, long *pword1x,
181 long *pword2, long *pword2x)
182 /* Get a command from the adventurer. Snarf out the first word, pad it with
183 * blanks, and return it in WORD1. Chars 6 thru 10 are returned in WORD1X, in
184 * case we need to print out the whole word in an error message. Any number of
185 * blanks may follow the word. If a second word appears, it is returned in
186 * WORD2 (chars 6 thru 10 in WORD2X), else WORD2 is -1. */
196 *pword1=GETTXT(true,true,true);
197 if (game.blklin && *pword1 < 0)
199 *pword1x=GETTXT(false,true,true);
201 junk=GETTXT(false,true,true);
204 *pword2=GETTXT(true,true,true);
205 *pword2x=GETTXT(false,true,true);
207 junk=GETTXT(false,true,true);
210 if (GETTXT(true,true,true) <= 0)
216 long YES(FILE *input, vocab_t x, vocab_t y, vocab_t z)
217 /* Print message X, wait for yes/no answer. If yes, print Y and return true;
218 * if no, print Z and return false. */
220 token_t reply, junk1, junk2, junk3;
224 GETIN(input, reply,junk1,junk2,junk3);
225 if (reply == MAKEWD(250519) || reply == MAKEWD(25)) {
229 if (reply == MAKEWD(1415) || reply == MAKEWD(14)) {
237 /* Line-parsing routines (GETTXT, MAKEWD, PUTTXT, SHFTXT, TYPE0) */
239 long GETTXT(bool skip, bool onewrd, bool upper)
240 /* Take characters from an input line and pack them into 30-bit words.
241 * Skip says to skip leading blanks. ONEWRD says stop if we come to a
242 * blank. UPPER says to map all letters to uppercase. If we reach the
243 * end of the line, the word is filled up with blanks (which encode as 0's).
244 * If we're already at end of line when TEXT is called, we return -1. */
247 static long splitting = -1;
249 if (LNPOSN != splitting)
255 if ((!skip) || INLINE[LNPOSN] != 0)
261 for (int I=1; I<=TOKLEN; I++) {
263 if (LNPOSN > LNLENG || (onewrd && INLINE[LNPOSN] == 0))
265 char current=INLINE[LNPOSN];
266 if (current < PERCENT) {
268 if (upper && current >= 37)
274 if (splitting != LNPOSN) {
280 text=text+current-PERCENT;
288 token_t MAKEWD(long letters)
289 /* Combine TOKLEN (currently 5) uppercase letters (represented by
290 * pairs of decimal digits in lettrs) to form a 30-bit value matching
291 * the one that GETTXT would return given those characters plus
292 * trailing blanks. Caution: lettrs will overflow 31 bits if
293 * 5-letter word starts with V-Z. As a kludgey workaround, you can
294 * increment a letter by 5 by adding 50 to the next pair of
297 long i = 1, word = 0;
299 for (long k=letters; k != 0; k=k/100) {
300 word=word+i*(MOD(k,50)+10);
302 if (MOD(k,100) > 50)word=word+i*5;
304 i=64L*64L*64L*64L*64L/i;
309 void fPUTTXT(token_t word, long *state, long casemake)
310 /* Unpack the 30-bit value in word to obtain up to TOKLEN (currently
311 * 5) integer-encoded chars, and store them in inline starting at
312 * LNPOSN. If LNLENG>=LNPOSN, shift existing characters to the right
313 * to make room. STATE will be zero when puttxt is called with the
314 * first of a sequence of words, but is thereafter unchanged by the
315 * caller, so PUTTXT can use it to maintain state across calls.
316 * LNPOSN and LNLENG are incremented by the number of chars stored.
317 * If CASEMAKE=1, all letters are made uppercase; if -1, lowercase; if 0,
318 * as is. any other value for case is the same as 0 but also causes
319 * trailing blanks to be included (in anticipation of subsequent
320 * additional text). */
322 long alph1, alph2, byte, div, i, w;
324 alph1=13*casemake+24;
325 alph2=26*labs(casemake)+alph1;
326 if (labs(casemake) > 1)
328 /* alph1&2 define range of wrong-case chars, 11-36 or 37-62 or empty. */
331 for (i=1; i<=TOKLEN; i++)
333 if (w <= 0 && *state == 0 && labs(casemake) <= 1)
337 if (!(*state != 0 || byte != PERCENT)) {
343 if (*state < alph2 && *state >= alph1)*state=*state-26*casemake;
344 INLINE[LNPOSN]=*state;
349 #define PUTTXT(WORD,STATE,CASE) fPUTTXT(WORD,&STATE,CASE)
351 void SHFTXT(long from, long delta)
352 /* Move INLINE(N) to INLINE(N+DELTA) for N=FROM,LNLENG. Delta can be
353 * negative. LNLENG is updated; LNPOSN is not changed. */
357 if (!(LNLENG < from || delta == 0)) {
358 for (I=from; I<=LNLENG; I++) {
370 /* Type a blank line. This procedure is provided as a convenience for callers
371 * who otherwise have no use for MAPCOM. */
382 /* Suspend/resume I/O routines (SAVWDS, SAVARR, SAVWRD) */
384 void fSAVWDS(long *W1, long *W2, long *W3, long *W4,
385 long *W5, long *W6, long *W7)
386 /* Write or read 7 variables. See SAVWRD. */
397 void fSAVARR(long arr[], long n)
398 /* Write or read an array of n words. See SAVWRD. */
402 for (i=1; i<=n; i++) {
408 void fSAVWRD(long op, long *pword)
409 /* If OP<0, start writing a file, using word to initialise encryption; save
410 * word in the file. If OP>0, start reading a file; read the file to find
411 * the value with which to decrypt the rest. In either case, if a file is
412 * already open, finish writing/reading it and don't start a new one. If OP=0,
413 * read/write a single word. Words are buffered in case that makes for more
414 * efficient disk use. We also compute a simple checksum to catch elementary
415 * poking within the saved file. When we finish reading/writing the file,
416 * we store zero into *PWORD if there's no checksum error, else nonzero. */
418 static long buf[250], cksum = 0, h1, hash = 0, n = 0, state = 0;
423 switch (ifvar<0 ? -1 : (ifvar>0 ? 1 : 0))
427 if (n == 250)SAVEIO(1,state > 0,buf);
430 n--; buf[n]=cksum; n++;
433 n--; *pword=buf[n]-cksum; n++;
434 SAVEIO(-1,state > 0,buf);
437 case 0: /* FIXME: Huh? should be impossible */
439 SAVEIO(0,state > 0,buf);
442 hash=MOD(*pword,1048576L);
443 buf[0]=1234L*5678L-hash;
446 hash=MOD(1234L*5678L-buf[0],1048576L);
454 SAVEIO(1,state > 0,buf);
456 h1=MOD(hash*1093L+221573L,1048576L);
457 hash=MOD(h1*1093L+221573L,1048576L);
458 h1=MOD(h1,1234)*765432+MOD(hash,123);
464 cksum=MOD(cksum*13+*pword,1000000000L);
467 /* Data structure routines */
469 long VOCAB(long id, long init)
470 /* Look up ID in the vocabulary (ATAB) and return its "definition" (KTAB), or
471 * -1 if not found. If INIT is positive, this is an initialisation call setting
472 * up a keyword variable, and not finding it constitutes a bug. It also means
473 * that only KTAB values which taken over 1000 equal INIT may be considered.
474 * (Thus "STEPS", which is a motion verb as well as an object, may be located
475 * as an object.) And it also means the KTAB value is taken modulo 1000. */
479 for (i=1; i<=TABSIZ; i++) {
486 if (init >= 0 && KTAB[i]/1000 != init)
491 lexeme=MOD(lexeme,1000);
498 void DSTROY(long object)
499 /* Permanently eliminate "object" by moving to a non-existent location. */
504 void JUGGLE(long object)
505 /* Juggle an object by picking it up and putting it down again, the purpose
506 * being to get the object to the front of the chain of things at its loc. */
510 i=game.place[object];
511 j=game.fixed[object];
513 MOVE(object+NOBJECTS,j);
516 void MOVE(long object, long where)
517 /* Place any object anywhere by picking it up and dropping it. May
518 * already be toting, in which case the carry is a no-op. Mustn't
519 * pick up objects which are not at any loc, since carry wants to
520 * remove objects from game.atloc chains. */
524 if (object > NOBJECTS)
525 from=game.fixed[object-NOBJECTS];
527 from=game.place[object];
528 if (from > 0 && from <= 300)
533 long PUT(long object, long where, long pval)
534 /* PUT is the same as MOVE, except it returns a value used to set up the
535 * negated game.prop values for the repository objects. */
541 void CARRY(long object, long where)
542 /* Start toting an object, removing it from the list of things at its former
543 * location. Incr holdng unless it was already being toted. If object>NOBJECTS
544 * (moving "fixed" second loc), don't change game.place or game.holdng. */
548 if (object <= NOBJECTS) {
549 if (game.place[object] == -1)
551 game.place[object]= -1;
552 game.holdng=game.holdng+1;
554 if (game.atloc[where] == object) {
555 game.atloc[where]=game.link[object];
558 temp=game.atloc[where];
559 while (game.link[temp] != object) {
560 temp=game.link[temp];
562 game.link[temp]=game.link[object];
565 void DROP(long object, long where)
566 /* Place an object at a given loc, prefixing it onto the game.atloc list. Decr
567 * game.holdng if the object was being toted. */
569 if (object > NOBJECTS)
570 game.fixed[object-NOBJECTS] = where;
573 if (game.place[object] == -1)
575 game.place[object] = where;
579 game.link[object] = game.atloc[where];
580 game.atloc[where] = object;
583 long ATDWRF(long where)
584 /* Return the index of first dwarf at the given location, zero if no dwarf is
585 * there (or if dwarves not active yet), -1 if all dwarves are dead. Ignore
586 * the pirate (6th dwarf). */
594 for (i=1; i<=NDWARVES-1; i++) {
595 if (game.dloc[i] == where)
597 if (game.dloc[i] != 0)
603 /* Utility routines (SETBIT, TSTBIT, set_seed, get_next_lcg_value,
604 * randrange, RNDVOC, BUG) */
606 long SETBIT(long bit)
607 /* Returns 2**bit for use in constructing bit-masks. */
612 bool TSTBIT(long mask, int bit)
613 /* Returns true if the specified bit is set in the mask. */
615 return (mask & (1 << bit)) != 0;
618 void set_seed(long seedval)
619 /* Set the LCG seed */
621 lcgstate.x = (unsigned long) seedval % lcgstate.m;
624 unsigned long get_next_lcg_value(void)
625 /* Return the LCG's current value, and then iterate it. */
627 unsigned long old_x = lcgstate.x;
628 lcgstate.x = (lcgstate.a * lcgstate.x + lcgstate.c) % lcgstate.m;
632 long randrange(long range)
633 /* Return a random integer from [0, range). */
635 return range * get_next_lcg_value() / lcgstate.m;
638 long RNDVOC(long second, long force)
639 /* Searches the vocabulary ATAB for a word whose second character is
640 * char, and changes that word such that each of the other four
641 * characters is a random letter. If force is non-zero, it is used
642 * as the new word. Returns the new word. */
647 for (int i = 1; i <= 5; i++) {
648 long j = 11 + randrange(26);
655 long div = 64L * 64L * 64L;
656 for (int i = 1; i <= TABSIZ; i++) {
657 if (MOD(ATAB[i]/div, 64L) == second)
668 /* The following conditions are currently considered fatal bugs. Numbers < 20
669 * are detected while reading the database; the others occur at "run time".
670 * 0 Message line > 70 characters
671 * 1 Null line in message
672 * 2 Too many words of messages
673 * 3 Too many travel options
674 * 4 Too many vocabulary words
675 * 5 Required vocabulary word not found
676 * 6 Too many RTEXT messages
678 * 8 Location has cond bit being set twice
679 * 9 Invalid section number in database
680 * 10 Too many locations
681 * 11 Too many class or turn messages
682 * 20 Special travel (500>L>300) exceeds goto list
683 * 21 Ran off end of vocabulary table
684 * 22 Vocabulary type (N/1000) not between 0 and 3
685 * 23 Intransitive action verb exceeds goto list
686 * 24 Transitive action verb exceeds goto list
687 * 25 Conditional travel entry with no alternative
688 * 26 Location has no travel entries
689 * 27 Hint number exceeds goto list
690 * 28 Invalid month returned by date function
691 * 29 Too many parameters given to SETPRM */
694 printf("Fatal error %ld. See source code for interpretation.\n", num);
698 /* Machine dependent routines (MAPLIN, TYPE, MPINIT, SAVEIO) */
700 void MAPLIN(FILE *fp)
704 /* Read a line of input, from the specified input source,
705 * translate the chars to integers in the range 0-126 and store
706 * them in the common array "INLINE". Integer values are as follows:
707 * 0 = space [ASCII CODE 40 octal, 32 decimal]
708 * 1-2 = !" [ASCII 41-42 octal, 33-34 decimal]
709 * 3-10 = '()*+,-. [ASCII 47-56 octal, 39-46 decimal]
710 * 11-36 = upper-case letters
711 * 37-62 = lower-case letters
712 * 63 = percent (%) [ASCII 45 octal, 37 decimal]
713 * 64-73 = digits, 0 through 9
714 * Remaining characters can be translated any way that is convenient;
715 * The "TYPE" routine below is used to map them back to characters when
716 * necessary. The above mappings are required so that certain special
717 * characters are known to fit in 6 bits and/or can be easily spotted.
718 * Array elements beyond the end of the line should be filled with 0,
719 * and LNLENG should be set to the index of the last character.
721 * If the data file uses a character other than space (e.g., tab) to
722 * separate numbers, that character should also translate to 0.
724 * This procedure may use the map1,map2 arrays to maintain static data for
725 * the mapping. MAP2(1) is set to 0 when the program starts
726 * and is not changed thereafter unless the routines on this page choose
732 if (!oldstyle && fp == stdin)
735 IGNORE(fgets(rawbuf,sizeof(rawbuf)-1,fp));
737 (!feof(fp) && rawbuf[0] == '#');
739 if (logfp && fp == stdin)
742 if (logfp && fp == stdin)
743 IGNORE(fputs(rawbuf, logfp));
745 IGNORE(fputs(rawbuf, stdout));
746 strcpy(INLINE+1, rawbuf);
748 for (i=1; i<=(long)sizeof(INLINE) && INLINE[i]!=0; i++) {
759 /* Type the first "LNLENG" characters stored in inline, mapping them
760 * from integers to text per the rules described above. INLINE
761 * may be changed by this routine. */
772 for (i=1; i<=LNLENG; i++) {
773 INLINE[i]=MAP2[INLINE[i]+1];
776 printf("%s\n", INLINE+1);
782 long first, i, j, last, val;
783 static long RUNS[7][2] = { {32,34}, {39,46}, {65,90}, {97,122},
784 {37,37}, {48,57}, {0,126} };
785 for (i=1; i<=128; i++) {
789 for (i=0; i<7; i++) {
792 for (j=first; j<=last; j++) {
802 /* For this version, tab (9) maps to space (32), so del (127)
803 * uses tab's value */
807 for (i=0; i<=126; i++) {
808 i++; val=MAP1[i]+1; i--;
809 MAP2[val] = i*('B'-'A');
811 MAP2[val]=(i-64)*('B'-'A')+'@';
815 void fSAVEIO(long op, long in, long arr[])
816 /* If OP=0, ask for a file name and open a file. (If IN=true, the file is for
817 * input, else output.) If OP>0, read/write ARR from/into the previously-opened
818 * file. (ARR is a 250-integer array.) If OP<0, finish reading/writing the
819 * file. (Finishing writing can be a no-op if a "stop" statement does it
820 * automatically. Finishing reading can be a no-op as long as a subsequent
821 * SAVEIO(0,false,X) will still work.) */
823 static FILE *fp = NULL;
826 switch (op < 0 ? -1 : (op > 0 ? 1 : 0))
833 name = linenoise("File name: ");
834 fp = fopen(name,(in ? READ_MODE : WRITE_MODE));
836 printf("Can't open file %s, try again.\n", name);
842 IGNORE(fread(arr,sizeof(long),250,fp));
844 IGNORE(fwrite(arr,sizeof(long),250,fp));
849 void DATIME(long* d, long* t)
852 gettimeofday(&tv, NULL);
853 *d = (long) tv.tv_sec;
854 *t = (long) tv.tv_usec;
857 long MOD(long n, long m)