10 /* hack to ignore GCC Unused Result */
11 #define IGNORE(r) do{if (r){}}while(0)
13 #define PERCENT 63 /* partly hide the packed encoding */
15 /* I/O routines (SPEAK, PSPEAK, RSPEAK, SETPRM, GETIN, YES) */
17 void SPEAK(vocab_t msg)
18 /* Print the message which starts at LINES[N]. Precede it with a blank line
19 * unless game.blklin is false. */
21 long blank, casemake, i, nxt, neg, nparms, param, prmtyp, state;
28 nxt=labs(LINES[msg])-1;
33 for (i = msg; i <= nxt; i++) {
34 PUTTXT(LINES[i],state,2);
42 if (INLINE[LNPOSN] != PERCENT)
44 prmtyp = INLINE[LNPOSN+1];
45 /* A "%"; the next character determine the type of
46 * parameter: 1 (!) = suppress message completely, 29 (S) = NULL
47 * If PARAM=1, else 'S' (optional plural ending), 33 (W) = word
48 * (two 30-bit values) with trailing spaces suppressed, 22 (L) or
49 * 31 (U) = word but map to lower/upper case, 13 (C) = word in
50 * lower case with first letter capitalised, 30 (T) = text ending
51 * with a word of -1, 65-73 (1-9) = number using that many
52 * characters, 12 (B) = variable number of blanks. */
58 if (PARMS[nparms] == 1)
68 if (PARMS[nparms] < 0)
70 if (PARMS[nparms+1] < 0)
72 PUTTXT(PARMS[nparms],state,casemake);
78 SHFTXT(LNPOSN+2,prmtyp-2);
80 for (i=1; i<=prmtyp; i++) {
87 if (prmtyp == 33 || prmtyp == 22 || prmtyp == 31 || prmtyp == 13) {
96 PUTTXT(PARMS[nparms],state,casemake);
97 PUTTXT(PARMS[nparms+1],state,casemake);
98 if (prmtyp == 13 && INLINE[i] >= 37 && INLINE[i] <= 62)
104 if (prmtyp < 1 || prmtyp > 9)
106 SHFTXT(LNPOSN+2,prmtyp-2);
108 param=labs(PARMS[nparms]);
110 if (PARMS[nparms] < 0)
112 for (i=1; i <= prmtyp; i++) {
114 INLINE[LNPOSN]=MOD(param,10)+64;
115 if (i != 1 && param == 0) {
136 void PSPEAK(vocab_t msg,int skip)
137 /* Find the skip+1st message from msg and print it. msg should be
138 * the index of the inventory message for object. (INVEN+N+1 message
139 * is game.prop=N message). */
145 for (i=0; i <=skip; i++) {
155 void RSPEAK(vocab_t i)
156 /* Print the i-th "random" message (section 6 of database). */
162 void SETPRM(long first, long p1, long p2)
163 /* Stores parameters into the PRMCOM parms array for use by speak. P1 and P2
164 * are stored into PARMS(first) and PARMS(first+1). */
166 if (first >= MAXPARMS)
174 bool fGETIN(FILE *input,
175 long *pword1, long *pword1x,
176 long *pword2, long *pword2x)
177 /* Get a command from the adventurer. Snarf out the first word, pad it with
178 * blanks, and return it in WORD1. Chars 6 thru 10 are returned in WORD1X, in
179 * case we need to print out the whole word in an error message. Any number of
180 * blanks may follow the word. If a second word appears, it is returned in
181 * WORD2 (chars 6 thru 10 in WORD2X), else WORD2 is -1. */
191 *pword1=GETTXT(true,true,true);
192 if (game.blklin && *pword1 < 0)
194 *pword1x=GETTXT(false,true,true);
196 junk=GETTXT(false,true,true);
199 *pword2=GETTXT(true,true,true);
200 *pword2x=GETTXT(false,true,true);
202 junk=GETTXT(false,true,true);
205 if (GETTXT(true,true,true) <= 0)
211 long YES(FILE *input, vocab_t x, vocab_t y, vocab_t z)
212 /* Print message X, wait for yes/no answer. If yes, print Y and return true;
213 * if no, print Z and return false. */
215 token_t reply, junk1, junk2, junk3;
219 GETIN(input, reply,junk1,junk2,junk3);
220 if (reply == MAKEWD(250519) || reply == MAKEWD(25)) {
224 if (reply == MAKEWD(1415) || reply == MAKEWD(14)) {
232 /* Line-parsing routines (GETTXT, MAKEWD, PUTTXT, SHFTXT, TYPE0) */
234 long GETTXT(bool skip, bool onewrd, bool upper)
235 /* Take characters from an input line and pack them into 30-bit words.
236 * Skip says to skip leading blanks. ONEWRD says stop if we come to a
237 * blank. UPPER says to map all letters to uppercase. If we reach the
238 * end of the line, the word is filled up with blanks (which encode as 0's).
239 * If we're already at end of line when TEXT is called, we return -1. */
242 static long splitting = -1;
244 if (LNPOSN != splitting)
250 if ((!skip) || INLINE[LNPOSN] != 0)
256 for (int I=1; I<=TOKLEN; I++) {
258 if (LNPOSN > LNLENG || (onewrd && INLINE[LNPOSN] == 0))
260 char current=INLINE[LNPOSN];
261 if (current < PERCENT) {
263 if (upper && current >= 37)
269 if (splitting != LNPOSN) {
275 text=text+current-PERCENT;
283 token_t MAKEWD(long letters)
284 /* Combine TOKLEN (currently 5) uppercase letters (represented by
285 * pairs of decimal digits in lettrs) to form a 30-bit value matching
286 * the one that GETTXT would return given those characters plus
287 * trailing blanks. Caution: lettrs will overflow 31 bits if
288 * 5-letter word starts with V-Z. As a kludgey workaround, you can
289 * increment a letter by 5 by adding 50 to the next pair of
292 long i = 1, word = 0;
294 for (long k=letters; k != 0; k=k/100) {
295 word=word+i*(MOD(k,50)+10);
297 if (MOD(k,100) > 50)word=word+i*5;
299 i=64L*64L*64L*64L*64L/i;
304 void fPUTTXT(token_t word, long *state, long casemake)
305 /* Unpack the 30-bit value in word to obtain up to TOKLEN (currently
306 * 5) integer-encoded chars, and store them in inline starting at
307 * LNPOSN. If LNLENG>=LNPOSN, shift existing characters to the right
308 * to make room. STATE will be zero when puttxt is called with the
309 * first of a sequence of words, but is thereafter unchanged by the
310 * caller, so PUTTXT can use it to maintain state across calls.
311 * LNPOSN and LNLENG are incremented by the number of chars stored.
312 * If CASEMAKE=1, all letters are made uppercase; if -1, lowercase; if 0,
313 * as is. any other value for case is the same as 0 but also causes
314 * trailing blanks to be included (in anticipation of subsequent
315 * additional text). */
317 long alph1, alph2, byte, div, i, w;
319 alph1=13*casemake+24;
320 alph2=26*labs(casemake)+alph1;
321 if (labs(casemake) > 1)
323 /* alph1&2 define range of wrong-case chars, 11-36 or 37-62 or empty. */
326 for (i=1; i<=TOKLEN; i++)
328 if (w <= 0 && *state == 0 && labs(casemake) <= 1)
332 if (!(*state != 0 || byte != PERCENT)) {
338 if (*state < alph2 && *state >= alph1)*state=*state-26*casemake;
339 INLINE[LNPOSN]=*state;
344 #define PUTTXT(WORD,STATE,CASE) fPUTTXT(WORD,&STATE,CASE)
346 void SHFTXT(long from, long delta)
347 /* Move INLINE(N) to INLINE(N+DELTA) for N=FROM,LNLENG. Delta can be
348 * negative. LNLENG is updated; LNPOSN is not changed. */
352 if (!(LNLENG < from || delta == 0)) {
353 for (I=from; I<=LNLENG; I++) {
365 /* Type a blank line. This procedure is provided as a convenience for callers
366 * who otherwise have no use for MAPCOM. */
377 /* Suspend/resume I/O routines (SAVWDS, SAVARR, SAVWRD) */
379 void fSAVWDS(long *W1, long *W2, long *W3, long *W4,
380 long *W5, long *W6, long *W7)
381 /* Write or read 7 variables. See SAVWRD. */
392 void fSAVARR(long arr[], long n)
393 /* Write or read an array of n words. See SAVWRD. */
397 for (i=1; i<=n; i++) {
403 void fSAVWRD(long op, long *pword)
404 /* If OP<0, start writing a file, using word to initialise encryption; save
405 * word in the file. If OP>0, start reading a file; read the file to find
406 * the value with which to decrypt the rest. In either case, if a file is
407 * already open, finish writing/reading it and don't start a new one. If OP=0,
408 * read/write a single word. Words are buffered in case that makes for more
409 * efficient disk use. We also compute a simple checksum to catch elementary
410 * poking within the saved file. When we finish reading/writing the file,
411 * we store zero into *PWORD if there's no checksum error, else nonzero. */
413 static long buf[250], cksum = 0, h1, hash = 0, n = 0, state = 0;
418 switch (ifvar<0 ? -1 : (ifvar>0 ? 1 : 0))
422 if (n == 250)SAVEIO(1,state > 0,buf);
425 n--; buf[n]=cksum; n++;
428 n--; *pword=buf[n]-cksum; n++;
429 SAVEIO(-1,state > 0,buf);
432 case 0: /* FIXME: Huh? should be impossible */
434 SAVEIO(0,state > 0,buf);
437 hash=MOD(*pword,1048576L);
438 buf[0]=1234L*5678L-hash;
441 hash=MOD(1234L*5678L-buf[0],1048576L);
449 SAVEIO(1,state > 0,buf);
451 h1=MOD(hash*1093L+221573L,1048576L);
452 hash=MOD(h1*1093L+221573L,1048576L);
453 h1=MOD(h1,1234)*765432+MOD(hash,123);
459 cksum=MOD(cksum*13+*pword,1000000000L);
462 /* Data structure routines */
464 long VOCAB(long id, long init)
465 /* Look up ID in the vocabulary (ATAB) and return its "definition" (KTAB), or
466 * -1 if not found. If INIT is positive, this is an initialisation call setting
467 * up a keyword variable, and not finding it constitutes a bug. It also means
468 * that only KTAB values which taken over 1000 equal INIT may be considered.
469 * (Thus "STEPS", which is a motion verb as well as an object, may be located
470 * as an object.) And it also means the KTAB value is taken modulo 1000. */
474 for (i=1; i<=TABSIZ; i++) {
481 if (init >= 0 && KTAB[i]/1000 != init)
486 lexeme=MOD(lexeme,1000);
493 void DSTROY(long object)
494 /* Permanently eliminate "object" by moving to a non-existent location. */
499 void JUGGLE(long object)
500 /* Juggle an object by picking it up and putting it down again, the purpose
501 * being to get the object to the front of the chain of things at its loc. */
505 i=game.place[object];
506 j=game.fixed[object];
508 MOVE(object+NOBJECTS,j);
511 void MOVE(long object, long where)
512 /* Place any object anywhere by picking it up and dropping it. May
513 * already be toting, in which case the carry is a no-op. Mustn't
514 * pick up objects which are not at any loc, since carry wants to
515 * remove objects from game.atloc chains. */
519 if (object > NOBJECTS)
520 from=game.fixed[object-NOBJECTS];
522 from=game.place[object];
523 if (from > 0 && from <= 300)
528 long PUT(long object, long where, long pval)
529 /* PUT is the same as MOVE, except it returns a value used to set up the
530 * negated game.prop values for the repository objects. */
536 void CARRY(long object, long where)
537 /* Start toting an object, removing it from the list of things at its former
538 * location. Incr holdng unless it was already being toted. If object>NOBJECTS
539 * (moving "fixed" second loc), don't change game.place or game.holdng. */
543 if (object <= NOBJECTS) {
544 if (game.place[object] == -1)
546 game.place[object]= -1;
547 game.holdng=game.holdng+1;
549 if (game.atloc[where] == object) {
550 game.atloc[where]=game.link[object];
553 temp=game.atloc[where];
554 while (game.link[temp] != object) {
555 temp=game.link[temp];
557 game.link[temp]=game.link[object];
560 void DROP(long object, long where)
561 /* Place an object at a given loc, prefixing it onto the game.atloc list. Decr
562 * game.holdng if the object was being toted. */
564 if (object > NOBJECTS)
565 game.fixed[object-NOBJECTS] = where;
568 if (game.place[object] == -1)
570 game.place[object] = where;
574 game.link[object] = game.atloc[where];
575 game.atloc[where] = object;
578 long ATDWRF(long where)
579 /* Return the index of first dwarf at the given location, zero if no dwarf is
580 * there (or if dwarves not active yet), -1 if all dwarves are dead. Ignore
581 * the pirate (6th dwarf). */
589 for (i=1; i<=NDWARVES-1; i++) {
590 if (game.dloc[i] == where)
592 if (game.dloc[i] != 0)
598 /* Utility routines (SETBIT, TSTBIT, set_seed, get_next_lcg_value,
599 * randrange, RNDVOC, BUG) */
601 long SETBIT(long bit)
602 /* Returns 2**bit for use in constructing bit-masks. */
607 bool TSTBIT(long mask, int bit)
608 /* Returns true if the specified bit is set in the mask. */
610 return (mask & (1 << bit)) != 0;
613 void set_seed(long seedval)
614 /* Set the LCG seed */
616 lcgstate.x = (unsigned long) seedval % lcgstate.m;
619 unsigned long get_next_lcg_value(void)
620 /* Return the LCG's current value, and then iterate it. */
622 unsigned long old_x = lcgstate.x;
623 lcgstate.x = (lcgstate.a * lcgstate.x + lcgstate.c) % lcgstate.m;
627 long randrange(long range)
628 /* Return a random integer from [0, range). */
630 return range * get_next_lcg_value() / lcgstate.m;
633 long RNDVOC(long second, long force)
634 /* Searches the vocabulary ATAB for a word whose second character is
635 * char, and changes that word such that each of the other four
636 * characters is a random letter. If force is non-zero, it is used
637 * as the new word. Returns the new word. */
642 for (int i = 1; i <= 5; i++) {
643 long j = 11 + randrange(26);
650 long div = 64L * 64L * 64L;
651 for (int i = 1; i <= TABSIZ; i++) {
652 if (MOD(ATAB[i]/div, 64L) == second)
663 /* The following conditions are currently considered fatal bugs. Numbers < 20
664 * are detected while reading the database; the others occur at "run time".
665 * 0 Message line > 70 characters
666 * 1 Null line in message
667 * 2 Too many words of messages
668 * 3 Too many travel options
669 * 4 Too many vocabulary words
670 * 5 Required vocabulary word not found
671 * 6 Too many RTEXT messages
673 * 8 Location has cond bit being set twice
674 * 9 Invalid section number in database
675 * 10 Too many locations
676 * 11 Too many class or turn messages
677 * 20 Special travel (500>L>300) exceeds goto list
678 * 21 Ran off end of vocabulary table
679 * 22 Vocabulary type (N/1000) not between 0 and 3
680 * 23 Intransitive action verb exceeds goto list
681 * 24 Transitive action verb exceeds goto list
682 * 25 Conditional travel entry with no alternative
683 * 26 Location has no travel entries
684 * 27 Hint number exceeds goto list
685 * 28 Invalid month returned by date function
686 * 29 Too many parameters given to SETPRM */
689 printf("Fatal error %ld. See source code for interpretation.\n", num);
693 /* Machine dependent routines (MAPLIN, TYPE, MPINIT, SAVEIO) */
695 void 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
727 if (!oldstyle && fp == stdin)
730 IGNORE(fgets(rawbuf,sizeof(rawbuf)-1,fp));
732 (!feof(fp) && rawbuf[0] == '#');
734 if (logfp && fp == stdin)
737 if (logfp && fp == stdin)
738 IGNORE(fputs(rawbuf, logfp));
740 IGNORE(fputs(rawbuf, stdout));
741 strcpy(INLINE+1, rawbuf);
743 for (i=1; i<=(long)sizeof(INLINE) && INLINE[i]!=0; i++) {
754 /* Type the first "LNLENG" characters stored in inline, mapping them
755 * from integers to text per the rules described above. INLINE
756 * may be changed by this routine. */
767 for (i=1; i<=LNLENG; i++) {
768 INLINE[i]=MAP2[INLINE[i]+1];
771 printf("%s\n", INLINE+1);
777 long first, i, j, last, val;
778 static long RUNS[7][2] = { {32,34}, {39,46}, {65,90}, {97,122},
779 {37,37}, {48,57}, {0,126} };
780 for (i=1; i<=128; i++) {
784 for (i=0; i<7; i++) {
787 for (j=first; j<=last; j++) {
797 /* For this version, tab (9) maps to space (32), so del (127)
798 * uses tab's value */
802 for (i=0; i<=126; i++) {
803 i++; val=MAP1[i]+1; i--;
804 MAP2[val] = i*('B'-'A');
806 MAP2[val]=(i-64)*('B'-'A')+'@';
810 void fSAVEIO(long op, long in, long arr[])
811 /* If OP=0, ask for a file name and open a file. (If IN=true, the file is for
812 * input, else output.) If OP>0, read/write ARR from/into the previously-opened
813 * file. (ARR is a 250-integer array.) If OP<0, finish reading/writing the
814 * file. (Finishing writing can be a no-op if a "stop" statement does it
815 * automatically. Finishing reading can be a no-op as long as a subsequent
816 * SAVEIO(0,false,X) will still work.) */
818 static FILE *fp = NULL;
821 switch (op < 0 ? -1 : (op > 0 ? 1 : 0))
828 printf("\nFile name: ");
829 IGNORE(fgets(name, sizeof(name), stdin));
830 fp = fopen(name,(in ? READ_MODE : WRITE_MODE));
832 printf("Can't open file %s, try again.\n", name);
837 IGNORE(fread(arr,sizeof(long),250,fp));
839 IGNORE(fwrite(arr,sizeof(long),250,fp));
844 void DATIME(long* d, long* t)
847 gettimeofday(&tv, NULL);
848 *d = (long) tv.tv_sec;
849 *t = (long) tv.tv_usec;
852 long MOD(long n, long m)