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);
39 while (LNPOSN <= LNLENG) {
40 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 while (PARMS[nparms] > 0) {
69 if (PARMS[nparms+1] < 0)
71 PUTTXT(PARMS[nparms],state,casemake);
79 SHFTXT(LNPOSN+2,prmtyp-2);
81 for (i=1; i<=prmtyp; i++) {
89 if (prmtyp == 33 || prmtyp == 22 || prmtyp == 31 || prmtyp == 13) {
98 PUTTXT(PARMS[nparms],state,casemake);
99 PUTTXT(PARMS[nparms+1],state,casemake);
100 if (prmtyp == 13 && INLINE[i] >= 37 && INLINE[i] <= 62)
107 if (prmtyp < 1 || prmtyp > 9) {
111 SHFTXT(LNPOSN+2,prmtyp-2);
113 param=labs(PARMS[nparms]);
115 if (PARMS[nparms] < 0)
117 for (i=1; i <= prmtyp; i++) {
119 INLINE[LNPOSN]=MOD(param,10)+64;
120 if (i != 1 && param == 0) {
140 void PSPEAK(vocab_t msg,int skip)
141 /* Find the skip+1st message from msg and print it. msg should be
142 * the index of the inventory message for object. (INVEN+N+1 message
143 * is game.prop=N message). */
149 for (i=0; i <=skip; i++) {
159 void RSPEAK(vocab_t i)
160 /* Print the i-th "random" message (section 6 of database). */
166 void SETPRM(long first, long p1, long p2)
167 /* Stores parameters into the PRMCOM parms array for use by speak. P1 and P2
168 * are stored into PARMS(first) and PARMS(first+1). */
170 if (first >= MAXPARMS)
178 bool fGETIN(FILE *input,
179 long *pword1, long *pword1x,
180 long *pword2, long *pword2x)
181 /* Get a command from the adventurer. Snarf out the first word, pad it with
182 * blanks, and return it in WORD1. Chars 6 thru 10 are returned in WORD1X, in
183 * case we need to print out the whole word in an error message. Any number of
184 * blanks may follow the word. If a second word appears, it is returned in
185 * WORD2 (chars 6 thru 10 in WORD2X), else WORD2 is -1. */
195 *pword1=GETTXT(true,true,true);
196 if (game.blklin && *pword1 < 0)
198 *pword1x=GETTXT(false,true,true);
200 junk=GETTXT(false,true,true);
203 *pword2=GETTXT(true,true,true);
204 *pword2x=GETTXT(false,true,true);
206 junk=GETTXT(false,true,true);
209 if (GETTXT(true,true,true) <= 0)
215 long YES(FILE *input, vocab_t x, vocab_t y, vocab_t z)
216 /* Print message X, wait for yes/no answer. If yes, print Y and return true;
217 * if no, print Z and return false. */
219 token_t reply, junk1, junk2, junk3;
223 GETIN(input, reply,junk1,junk2,junk3);
224 if (reply == MAKEWD(250519) || reply == MAKEWD(25)) {
228 if (reply == MAKEWD(1415) || reply == MAKEWD(14)) {
236 /* Line-parsing routines (GETTXT, MAKEWD, PUTTXT, SHFTXT, TYPE0) */
238 long GETTXT(bool skip, bool onewrd, bool upper)
239 /* Take characters from an input line and pack them into 30-bit words.
240 * Skip says to skip leading blanks. ONEWRD says stop if we come to a
241 * blank. UPPER says to map all letters to uppercase. If we reach the
242 * end of the line, the word is filled up with blanks (which encode as 0's).
243 * If we're already at end of line when TEXT is called, we return -1. */
246 static long splitting = -1;
248 if (LNPOSN != splitting)
254 if ((!skip) || INLINE[LNPOSN] != 0)
260 for (int I=1; I<=TOKLEN; I++) {
262 if (LNPOSN > LNLENG || (onewrd && INLINE[LNPOSN] == 0))
264 char current=INLINE[LNPOSN];
265 if (current < PERCENT) {
267 if (upper && current >= 37)
273 if (splitting != LNPOSN) {
279 text=text+current-PERCENT;
287 token_t MAKEWD(long letters)
288 /* Combine TOKLEN (currently 5) uppercase letters (represented by
289 * pairs of decimal digits in lettrs) to form a 30-bit value matching
290 * the one that GETTXT would return given those characters plus
291 * trailing blanks. Caution: lettrs will overflow 31 bits if
292 * 5-letter word starts with V-Z. As a kludgey workaround, you can
293 * increment a letter by 5 by adding 50 to the next pair of
296 long i = 1, word = 0;
298 for (long k=letters; k != 0; k=k/100) {
299 word=word+i*(MOD(k,50)+10);
301 if (MOD(k,100) > 50)word=word+i*5;
303 i=64L*64L*64L*64L*64L/i;
308 void fPUTTXT(token_t word, long *state, long casemake)
309 /* Unpack the 30-bit value in word to obtain up to TOKLEN (currently
310 * 5) integer-encoded chars, and store them in inline starting at
311 * LNPOSN. If LNLENG>=LNPOSN, shift existing characters to the right
312 * to make room. STATE will be zero when puttxt is called with the
313 * first of a sequence of words, but is thereafter unchanged by the
314 * caller, so PUTTXT can use it to maintain state across calls.
315 * LNPOSN and LNLENG are incremented by the number of chars stored.
316 * If CASEMAKE=1, all letters are made uppercase; if -1, lowercase; if 0,
317 * as is. any other value for case is the same as 0 but also causes
318 * trailing blanks to be included (in anticipation of subsequent
319 * additional text). */
321 long alph1, alph2, byte, div, i, w;
323 alph1=13*casemake+24;
324 alph2=26*labs(casemake)+alph1;
325 if (labs(casemake) > 1)
327 /* alph1&2 define range of wrong-case chars, 11-36 or 37-62 or empty. */
330 for (i=1; i<=TOKLEN; i++)
332 if (w <= 0 && *state == 0 && labs(casemake) <= 1)
336 if (!(*state != 0 || byte != PERCENT)) {
342 if (*state < alph2 && *state >= alph1)*state=*state-26*casemake;
343 INLINE[LNPOSN]=*state;
348 #define PUTTXT(WORD,STATE,CASE) fPUTTXT(WORD,&STATE,CASE)
350 void SHFTXT(long from, long delta)
351 /* Move INLINE(N) to INLINE(N+DELTA) for N=FROM,LNLENG. Delta can be
352 * negative. LNLENG is updated; LNPOSN is not changed. */
356 if (!(LNLENG < from || delta == 0)) {
357 for (I=from; I<=LNLENG; I++) {
369 /* Type a blank line. This procedure is provided as a convenience for callers
370 * who otherwise have no use for MAPCOM. */
381 /* Suspend/resume I/O routines (SAVWDS, SAVARR, SAVWRD) */
383 void fSAVWDS(long *W1, long *W2, long *W3, long *W4,
384 long *W5, long *W6, long *W7)
385 /* Write or read 7 variables. See SAVWRD. */
396 void fSAVARR(long arr[], long n)
397 /* Write or read an array of n words. See SAVWRD. */
401 for (i=1; i<=n; i++) {
407 void fSAVWRD(long op, long *pword)
408 /* If OP<0, start writing a file, using word to initialise encryption; save
409 * word in the file. If OP>0, start reading a file; read the file to find
410 * the value with which to decrypt the rest. In either case, if a file is
411 * already open, finish writing/reading it and don't start a new one. If OP=0,
412 * read/write a single word. Words are buffered in case that makes for more
413 * efficient disk use. We also compute a simple checksum to catch elementary
414 * poking within the saved file. When we finish reading/writing the file,
415 * we store zero into *PWORD if there's no checksum error, else nonzero. */
417 static long buf[250], cksum = 0, h1, hash = 0, n = 0, state = 0;
422 switch (ifvar<0 ? -1 : (ifvar>0 ? 1 : 0))
426 if (n == 250)SAVEIO(1,state > 0,buf);
429 n--; buf[n]=cksum; n++;
432 n--; *pword=buf[n]-cksum; n++;
433 SAVEIO(-1,state > 0,buf);
436 case 0: /* FIXME: Huh? should be impossible */
438 SAVEIO(0,state > 0,buf);
441 hash=MOD(*pword,1048576L);
442 buf[0]=1234L*5678L-hash;
445 hash=MOD(1234L*5678L-buf[0],1048576L);
453 SAVEIO(1,state > 0,buf);
455 h1=MOD(hash*1093L+221573L,1048576L);
456 hash=MOD(h1*1093L+221573L,1048576L);
457 h1=MOD(h1,1234)*765432+MOD(hash,123);
463 cksum=MOD(cksum*13+*pword,1000000000L);
466 /* Data structure routines */
468 long VOCAB(long id, long init)
469 /* Look up ID in the vocabulary (ATAB) and return its "definition" (KTAB), or
470 * -1 if not found. If INIT is positive, this is an initialisation call setting
471 * up a keyword variable, and not finding it constitutes a bug. It also means
472 * that only KTAB values which taken over 1000 equal INIT may be considered.
473 * (Thus "STEPS", which is a motion verb as well as an object, may be located
474 * as an object.) And it also means the KTAB value is taken modulo 1000. */
478 for (i=1; i<=TABSIZ; i++) {
485 if (init >= 0 && KTAB[i]/1000 != init)
490 lexeme=MOD(lexeme,1000);
497 void DSTROY(long object)
498 /* Permanently eliminate "object" by moving to a non-existent location. */
503 void JUGGLE(long object)
504 /* Juggle an object by picking it up and putting it down again, the purpose
505 * being to get the object to the front of the chain of things at its loc. */
509 i=game.place[object];
510 j=game.fixed[object];
512 MOVE(object+NOBJECTS,j);
515 void MOVE(long object, long where)
516 /* Place any object anywhere by picking it up and dropping it. May
517 * already be toting, in which case the carry is a no-op. Mustn't
518 * pick up objects which are not at any loc, since carry wants to
519 * remove objects from game.atloc chains. */
523 if (object > NOBJECTS)
524 from=game.fixed[object-NOBJECTS];
526 from=game.place[object];
527 if (from > 0 && from <= 300)
532 long PUT(long object, long where, long pval)
533 /* PUT is the same as MOVE, except it returns a value used to set up the
534 * negated game.prop values for the repository objects. */
540 void CARRY(long object, long where)
541 /* Start toting an object, removing it from the list of things at its former
542 * location. Incr holdng unless it was already being toted. If object>NOBJECTS
543 * (moving "fixed" second loc), don't change game.place or game.holdng. */
547 if (object <= NOBJECTS) {
548 if (game.place[object] == -1)
550 game.place[object]= -1;
551 game.holdng=game.holdng+1;
553 if (game.atloc[where] == object) {
554 game.atloc[where]=game.link[object];
557 temp=game.atloc[where];
558 while (game.link[temp] != object) {
559 temp=game.link[temp];
561 game.link[temp]=game.link[object];
564 void DROP(long object, long where)
565 /* Place an object at a given loc, prefixing it onto the game.atloc list. Decr
566 * game.holdng if the object was being toted. */
568 if (object > NOBJECTS)
569 game.fixed[object-NOBJECTS] = where;
572 if (game.place[object] == -1)
574 game.place[object] = where;
578 game.link[object] = game.atloc[where];
579 game.atloc[where] = object;
582 long ATDWRF(long where)
583 /* Return the index of first dwarf at the given location, zero if no dwarf is
584 * there (or if dwarves not active yet), -1 if all dwarves are dead. Ignore
585 * the pirate (6th dwarf). */
593 for (i=1; i<=NDWARVES-1; i++) {
594 if (game.dloc[i] == where)
596 if (game.dloc[i] != 0)
602 /* Utility routines (SETBIT, TSTBIT, set_seed, get_next_lcg_value,
603 * randrange, RNDVOC, BUG) */
605 long SETBIT(long bit)
606 /* Returns 2**bit for use in constructing bit-masks. */
611 bool TSTBIT(long mask, int bit)
612 /* Returns true if the specified bit is set in the mask. */
614 return (mask & (1 << bit)) != 0;
617 void set_seed(long seedval)
618 /* Set the LCG seed */
620 lcgstate.x = (unsigned long) seedval % lcgstate.m;
623 unsigned long get_next_lcg_value(void)
624 /* Return the LCG's current value, and then iterate it. */
626 unsigned long old_x = lcgstate.x;
627 lcgstate.x = (lcgstate.a * lcgstate.x + lcgstate.c) % lcgstate.m;
631 long randrange(long range)
632 /* Return a random integer from [0, range). */
634 return range * get_next_lcg_value() / lcgstate.m;
637 long RNDVOC(long second, long force)
638 /* Searches the vocabulary ATAB for a word whose second character is
639 * char, and changes that word such that each of the other four
640 * characters is a random letter. If force is non-zero, it is used
641 * as the new word. Returns the new word. */
646 for (int i = 1; i <= 5; i++) {
647 long j = 11 + randrange(26);
654 long div = 64L * 64L * 64L;
655 for (int i = 1; i <= TABSIZ; i++) {
656 if (MOD(ATAB[i]/div, 64L) == second)
667 /* The following conditions are currently considered fatal bugs. Numbers < 20
668 * are detected while reading the database; the others occur at "run time".
669 * 0 Message line > 70 characters
670 * 1 Null line in message
671 * 2 Too many words of messages
672 * 3 Too many travel options
673 * 4 Too many vocabulary words
674 * 5 Required vocabulary word not found
675 * 6 Too many RTEXT messages
677 * 8 Location has cond bit being set twice
678 * 9 Invalid section number in database
679 * 10 Too many locations
680 * 11 Too many class or turn messages
681 * 20 Special travel (500>L>300) exceeds goto list
682 * 21 Ran off end of vocabulary table
683 * 22 Vocabulary type (N/1000) not between 0 and 3
684 * 23 Intransitive action verb exceeds goto list
685 * 24 Transitive action verb exceeds goto list
686 * 25 Conditional travel entry with no alternative
687 * 26 Location has no travel entries
688 * 27 Hint number exceeds goto list
689 * 28 Invalid month returned by date function
690 * 29 Too many parameters given to SETPRM */
693 printf("Fatal error %ld. See source code for interpretation.\n", num);
697 /* Machine dependent routines (MAPLIN, TYPE, MPINIT, SAVEIO) */
699 void MAPLIN(FILE *fp)
703 /* Read a line of input, from the specified input source,
704 * translate the chars to integers in the range 0-126 and store
705 * them in the common array "INLINE". Integer values are as follows:
706 * 0 = space [ASCII CODE 40 octal, 32 decimal]
707 * 1-2 = !" [ASCII 41-42 octal, 33-34 decimal]
708 * 3-10 = '()*+,-. [ASCII 47-56 octal, 39-46 decimal]
709 * 11-36 = upper-case letters
710 * 37-62 = lower-case letters
711 * 63 = percent (%) [ASCII 45 octal, 37 decimal]
712 * 64-73 = digits, 0 through 9
713 * Remaining characters can be translated any way that is convenient;
714 * The "TYPE" routine below is used to map them back to characters when
715 * necessary. The above mappings are required so that certain special
716 * characters are known to fit in 6 bits and/or can be easily spotted.
717 * Array elements beyond the end of the line should be filled with 0,
718 * and LNLENG should be set to the index of the last character.
720 * If the data file uses a character other than space (e.g., tab) to
721 * separate numbers, that character should also translate to 0.
723 * This procedure may use the map1,map2 arrays to maintain static data for
724 * the mapping. MAP2(1) is set to 0 when the program starts
725 * and is not changed thereafter unless the routines on this page choose
731 if (!oldstyle && fp == stdin)
734 IGNORE(fgets(rawbuf,sizeof(rawbuf)-1,fp));
736 (!feof(fp) && rawbuf[0] == '#');
738 if (logfp && fp == stdin)
741 if (logfp && fp == stdin)
742 IGNORE(fputs(rawbuf, logfp));
744 IGNORE(fputs(rawbuf, stdout));
745 strcpy(INLINE+1, rawbuf);
747 for (i=1; i<=(long)sizeof(INLINE) && INLINE[i]!=0; i++) {
758 /* Type the first "LNLENG" characters stored in inline, mapping them
759 * from integers to text per the rules described above. INLINE
760 * may be changed by this routine. */
771 for (i=1; i<=LNLENG; i++) {
772 INLINE[i]=MAP2[INLINE[i]+1];
775 printf("%s\n", INLINE+1);
781 long first, i, j, last, val;
782 static long RUNS[7][2] = { {32,34}, {39,46}, {65,90}, {97,122},
783 {37,37}, {48,57}, {0,126} };
784 for (i=1; i<=128; i++) {
788 for (i=0; i<7; i++) {
791 for (j=first; j<=last; j++) {
801 /* For this version, tab (9) maps to space (32), so del (127)
802 * uses tab's value */
806 for (i=0; i<=126; i++) {
807 i++; val=MAP1[i]+1; i--;
808 MAP2[val] = i*('B'-'A');
810 MAP2[val]=(i-64)*('B'-'A')+'@';
814 void fSAVEIO(long op, long in, long arr[])
815 /* If OP=0, ask for a file name and open a file. (If IN=true, the file is for
816 * input, else output.) If OP>0, read/write ARR from/into the previously-opened
817 * file. (ARR is a 250-integer array.) If OP<0, finish reading/writing the
818 * file. (Finishing writing can be a no-op if a "stop" statement does it
819 * automatically. Finishing reading can be a no-op as long as a subsequent
820 * SAVEIO(0,false,X) will still work.) */
822 static FILE *fp = NULL;
825 switch (op < 0 ? -1 : (op > 0 ? 1 : 0))
832 printf("\nFile name: ");
833 IGNORE(fgets(name, sizeof(name), stdin));
834 fp = fopen(name,(in ? READ_MODE : WRITE_MODE));
836 printf("Can't open file %s, try again.\n", name);
841 IGNORE(fread(arr,sizeof(long),250,fp));
843 IGNORE(fwrite(arr,sizeof(long),250,fp));
848 void DATIME(long* d, long* t)
851 gettimeofday(&tv, NULL);
852 *d = (long) tv.tv_sec;
853 *t = (long) tv.tv_usec;
856 long MOD(long n, long m)