2 * There used to be a note that said this:
4 * The author - Don Woods - apologises for the style of the code; it
5 * is a result of running the original Fortran IV source through a
6 * home-brew Fortran-to-C converter.
8 * Now that the code has been restructured into something much closer
9 * to idiomatic C, the following is more appropriate:
11 * ESR apologizes for the remaing gotos (now confined to one function
12 * in this file - there used to be over 350 of them, *everywhere*),
13 * and for the offensive globals. Applying the Structured Program
14 * Theorem can be hard.
16 #define DEFINE_GLOBALS_FROM_INCLUDES
25 #include "linenoise/linenoise.h"
30 long LNLENG, LNPOSN, PARMS[MAXPARMS+1];
31 char rawbuf[LINESIZE], INLINE[LINESIZE+1];
33 long AMBER, AXE, BACK, BATTER, BEAR, BIRD, BLOOD,
34 BOTTLE, CAGE, CAVE, CAVITY, CHAIN, CHASM, CHEST,
35 CLAM, COINS, DOOR, DPRSSN, DRAGON, DWARF, EGGS,
36 EMRALD, ENTER, ENTRNC, FIND, FISSUR, FOOD,
37 GRATE, HINT, INVENT, JADE, KEYS,
38 KNIFE, LAMP, LOCK, LOOK, MAGZIN,
39 MESSAG, MIRROR, NUGGET, NUL, OGRE, OIL, OYSTER,
40 PEARL, PILLOW, PLANT, PLANT2, PYRAM, RESER, ROD, ROD2,
41 RUBY, RUG, SAPPH, SAY, SIGN, SNAKE,
42 STEPS, STREAM, THROW, TRIDNT, TROLL, TROLL2,
43 URN, VASE, VEND, VOLCAN, WATER;
44 long WD1, WD1X, WD2, WD2X;
47 bool oldstyle = false;
51 extern void initialise();
52 extern int action(FILE *, long, long, long);
54 void sig_handler(int signo)
65 * Adventure (rev 2: 20 treasures)
67 * History: Original idea & 5-treasure version (adventures) by Willie Crowther
68 * 15-treasure version (adventure) by Don Woods, April-June 1977
69 * 20-treasure version (rev 2) by Don Woods, August 1978
70 * Errata fixed: 78/12/25
71 * Revived 2017 as Open Advebture.
74 static bool do_command(FILE *);
76 int main(int argc, char *argv[])
82 while ((ch = getopt(argc, argv, "l:os")) != EOF) {
85 logfp = fopen(optarg, "w");
88 "advent: can't open logfile %s for write\n",
90 signal(SIGINT, sig_handler);
94 editline = prompt = false;
102 linenoiseHistorySetMaxLen(350);
104 /* Logical variables:
106 * game.closed says whether we're all the way closed
107 * game.closng says whether it's closing time yet
108 * game.clshnt says whether he's read the clue in the endgame
109 * game.lmwarn says whether he's been warned about lamp going dim
110 * game.novice says whether he asked for instructions at start-up
111 * game.panic says whether he's found out he's trapped in the cave
112 * game.wzdark says whether the loc he's leaving was dark */
114 /* Initialize our LCG PRNG with parameters tested against
115 * Knuth vol. 2. by the original authors */
118 game.lcg_m = 1048576;
120 long seedval = (long)rand();
123 /* Initialize game variables */
126 /* Start-up, dwarf stuff */
127 game.zzword=RNDVOC(3,0);
128 game.novice=YES(stdin, WELCOME_YOU,CAVE_NEARBY,ARB_0);
129 game.newloc = LOC_START;
130 game.loc = LOC_START;
132 if (game.novice)game.limit=1000;
135 fprintf(logfp, "seed %ld\n", seedval);
137 /* interpret commands until EOF or interrupt */
139 if (!do_command(stdin))
142 /* show score and exit */
146 static bool fallback_handler(char *buf)
147 /* fallback handler for commands not handled by FORTRANish parser */
150 if (sscanf(buf, "seed %ld", &sv) == 1) {
152 printf("Seed set to %ld\n", sv);
153 // autogenerated, so don't charge user time for it.
155 // here we reconfigure any global game state that uses random numbers
156 game.zzword=RNDVOC(3,0);
162 /* Check if this loc is eligible for any hints. If been here
163 * long enough, branch to help section (on later page). Hints
164 * all come back here eventually to finish the loop. Ignore
165 * "HINTS" < 4 (special stuff, see database notes).
167 static void checkhints(FILE *cmdin)
169 if (COND[game.loc] >= game.conds) {
170 for (int hint=1; hint<=HNTMAX; hint++) {
171 if (game.hinted[hint])
173 if (!CNDBIT(game.loc,hint+HBASE))
174 game.hintlc[hint]= -1;
176 /* Come here if he's been long enough at required loc(s) for some
178 if (game.hintlc[hint] >= HINTS[hint][1])
186 if (game.prop[GRATE] == 0 && !HERE(KEYS))
191 if (game.place[BIRD] == game.loc && TOTING(ROD) && game.oldobj == BIRD)
195 if (HERE(SNAKE) && !HERE(BIRD))
200 if (game.atloc[game.loc] == 0 &&
201 game.atloc[game.oldloc] == 0 &&
202 game.atloc[game.oldlc2] == 0 &&
208 if (game.prop[EMRALD] != -1 && game.prop[PYRAM] == -1)
220 if (game.atloc[game.loc] == 0 &&
221 game.atloc[game.oldloc] == 0 &&
222 game.atloc[game.oldlc2] == 0)
231 if (HERE(OGRE) && i == 0)
235 if (game.tally == 1 && game.prop[JADE] < 0)
244 /* Fall through to hint display */
246 if (!YES(cmdin,HINTS[hint][3],ARB_0,OK_MAN))
248 SETPRM(1,HINTS[hint][2],HINTS[hint][2]);
250 game.hinted[hint]=YES(cmdin,WANT_HINT,HINTS[hint][4],OK_MAN);
251 if (game.hinted[hint] && game.limit > WARNTIME)
252 game.limit += WARNTIME*HINTS[hint][2];
258 bool spotted_by_pirate(int i)
263 /* The pirate's spotted him. He leaves him alone once we've
264 * found chest. K counts if a treasure is here. If not, and
265 * tally=1 for an unseen chest, let the pirate be spotted. Note
266 * that game.place[CHEST] = NOWHERE might mean that he's thrown
267 * it to the troll, but in that case he's seen the chest
269 if (game.loc == game.chloc || game.prop[CHEST] >= 0)
272 bool movechest = false, robplayer = false;
273 for (int j=MINTRS; j<=MAXTRS; j++) {
274 /* Pirate won't take pyramid from plover room or dark
275 * room (too easy!). */
276 if (j==PYRAM && (game.loc==PLAC[PYRAM] || game.loc==PLAC[EMRALD])) {
279 if (TOTING(j) || HERE(j))
286 /* Force chest placement before player finds last treasure */
287 if (game.tally == 1 && snarfed == 0 && game.place[CHEST] == NOWHERE && HERE(LAMP) && game.prop[LAMP] == 1) {
288 RSPEAK(PIRATE_SPOTTED);
291 /* Do things in this order (chest move before robbery) so chest is listed
292 * last at the maze location. */
294 MOVE(CHEST,game.chloc);
295 MOVE(MESSAG,game.chloc2);
296 game.dloc[PIRATE]=game.chloc;
297 game.odloc[PIRATE]=game.chloc;
298 game.dseen[PIRATE]=false;
300 /* You might get a hint of the pirate's presence even if the
301 * chest doesn't move... */
302 if (game.odloc[PIRATE] != game.dloc[PIRATE] && PCT(20))
303 RSPEAK(PIRATE_RUSTLES);
306 RSPEAK(PIRATE_POUNCES);
307 for (int j=MINTRS; j<=MAXTRS; j++) {
308 if (!(j == PYRAM && (game.loc == PLAC[PYRAM] || game.loc == PLAC[EMRALD]))) {
309 if (AT(j) && game.fixed[j] == 0)
320 static bool dwarfmove(void)
321 /* Dwarves move. Return true if player survives, false if he dies. */
323 int kk, stick, attack;
326 /* Dwarf stuff. See earlier comments for description of
327 * variables. Remember sixth dwarf is pirate and is thus
328 * very different except for motion rules. */
330 /* First off, don't let the dwarves follow him into a pit or
331 * a wall. Activate the whole mess the first time he gets as
332 * far as the hall of mists (loc 15). If game.newloc is
333 * forbidden to pirate (in particular, if it's beyond the
334 * troll bridge), bypass dwarf stuff. That way pirate can't
335 * steal return toll, and dwarves can't meet the bear. Also
336 * means dwarves won't follow him into dead end in maze, but
337 * c'est la vie. They'll wait for him outside the dead
339 if (game.loc == 0 || FORCED(game.loc) || CNDBIT(game.newloc,NOARRR))
342 /* Dwarf activity level ratchets up */
343 if (game.dflag == 0) {
344 if (INDEEP(game.loc))
349 /* When we encounter the first dwarf, we kill 0, 1, or 2 of
350 * the 5 dwarves. If any of the survivors is at loc,
351 * replace him with the alternate. */
352 if (game.dflag == 1) {
353 if (!INDEEP(game.loc) || (PCT(95) && (!CNDBIT(game.loc,NOBACK) || PCT(85))))
356 for (int i=1; i<=2; i++) {
357 int j=1+randrange(NDWARVES-1);
361 for (int i=1; i<=NDWARVES-1; i++) {
362 if (game.dloc[i] == game.loc)
364 game.odloc[i]=game.dloc[i];
371 /* Things are in full swing. Move each dwarf at random,
372 * except if he's seen us he sticks with us. Dwarves stay
373 * deep inside. If wandering at random, they don't back up
374 * unless there's no alternative. If they don't have to
375 * move, they attack. And, of course, dead dwarves don't do
376 * much of anything. */
380 for (int i=1; i<=NDWARVES; i++) {
381 if (game.dloc[i] == 0)
383 /* Fill tk array with all the places this dwarf might go. */
385 kk=KEY[game.dloc[i]];
388 game.newloc=MOD(labs(TRAVEL[kk])/1000,1000);
389 /* Have we avoided a dwarf encounter? */
390 bool avoided = (SPECIAL(game.newloc) ||
391 !INDEEP(game.newloc) ||
392 game.newloc == game.odloc[i] ||
393 (j > 1 && game.newloc == tk[j-1]) ||
395 game.newloc == game.dloc[i] ||
396 FORCED(game.newloc) ||
397 (i == PIRATE && CNDBIT(game.newloc,NOARRR)) ||
398 labs(TRAVEL[kk])/1000000 == 100);
400 tk[j++] = game.newloc;
409 game.odloc[i]=game.dloc[i];
411 game.dseen[i]=(game.dseen[i] && INDEEP(game.loc)) || (game.dloc[i] == game.loc || game.odloc[i] == game.loc);
412 if (!game.dseen[i]) continue;
413 game.dloc[i]=game.loc;
414 if (spotted_by_pirate(i))
416 /* This threatening little dwarf is in the room with him! */
418 if (game.odloc[i] == game.dloc[i]) {
420 if (game.knfloc >= 0)
421 game.knfloc=game.loc;
422 if (randrange(1000) < 95*(game.dflag-2))
427 /* Now we know what's happening. Let's tell the poor sucker about it.
428 * Note that various of the "knife" messages must have specific relative
429 * positions in the RSPEAK database. */
430 if (game.dtotal == 0)
432 SETPRM(1,game.dtotal,0);
433 RSPEAK(DWARF_PACK+1/game.dtotal); /* FIXME: Arithmetic on message number */
436 if (game.dflag == 2)game.dflag=3;
439 if (attack > 1)k=THROWN_KNIVES;
442 RSPEAK(k+1+2/(1+stick)); /* FIXME: Arithmetic on message number */
445 game.oldlc2=game.loc;
449 /* "You're dead, Jim."
451 * If the current loc is zero, it means the clown got himself killed.
452 * We'll allow this maxdie times. MAXDIE is automatically set based
453 * on the number of snide messages available. Each death results in
454 * a message (81, 83, etc.) which offers reincarnation; if accepted,
455 * this results in message 82, 84, etc. The last time, if he wants
456 * another chance, he gets a snide remark as we exit. When
457 * reincarnated, all objects being carried get dropped at game.oldlc2
458 * (presumably the last place prior to being killed) without change
459 * of props. the loop runs backwards to assure that the bird is
460 * dropped before the cage. (this kluge could be changed once we're
461 * sure all references to bird and cage are done by keywords.) The
462 * lamp is a special case (it wouldn't do to leave it in the cave).
463 * It is turned off and left outside the building (only if he was
464 * carrying it, of course). He himself is left inside the building
465 * (and heaven help him if he tries to xyzzy back into the cave
466 * without the lamp!). game.oldloc is zapped so he can't just
469 static void croak(FILE *cmdin)
470 /* Okay, he's dead. Let's get on with it. */
474 /* He died during closing time. No resurrection. Tally up a
476 RSPEAK(DEATH_CLOSING);
479 /* FIXME: Arithmetic on message numbers */
480 if (!YES(cmdin,WATCH_IT+game.numdie*2,WHICH_WAY+game.numdie*2,OK_MAN))
482 if (game.numdie == MAXDIE)
484 game.place[WATER] = NOWHERE;
485 game.place[OIL] = NOWHERE;
488 for (int j=1; j<=NOBJECTS; j++) {
489 int i=NOBJECTS + 1 - j;
491 /* Always leave lamp where it's accessible aboveground */
492 DROP(i, (i == LAMP) ? LOC_START : game.oldlc2);
495 game.loc = LOC_BUILDING;
496 game.oldloc=game.loc;
500 /* Given the current location in "game.loc", and a motion verb number in
501 * "motion", put the new location in "game.newloc". The current loc is saved
502 * in "game.oldloc" in case he wants to retreat. The current
503 * game.oldloc is saved in game.oldlc2, in case he dies. (if he
504 * does, game.newloc will be limbo, and game.oldloc will be what killed
505 * him, so we need game.oldlc2, which is the last place he was
508 static bool playermove(FILE *cmdin, token_t verb, int motion)
510 int scratchloc, k2, kk=KEY[game.loc];
511 game.newloc=game.loc;
516 else if (motion == BACK) {
517 /* Handle "go back". Look for verb which goes from game.loc to
518 * game.oldloc, or to game.oldlc2 If game.oldloc has forced-motion.
519 * k2 saves entry -> forced loc -> previous loc. */
523 game.oldlc2=game.oldloc;
524 game.oldloc=game.loc;
526 if (motion == game.loc)k2=FORGOT_PATH;
527 if (CNDBIT(game.loc,NOBACK))k2=TWIST_TURN;
530 scratchloc=MOD((labs(TRAVEL[kk])/1000),1000);
531 if (scratchloc != motion) {
532 if (!SPECIAL(scratchloc)) {
533 if (FORCED(scratchloc) && MOD((labs(TRAVEL[KEY[scratchloc]])/1000),1000) == motion)
536 if (TRAVEL[kk] >= 0) {
542 RSPEAK(NOT_CONNECTED);
547 motion=MOD(labs(TRAVEL[kk]),1000);
549 break; /* fall through to ordinary travel */
556 else if (motion == LOOK) {
557 /* Look. Can't give more detail. Pretend it wasn't dark
558 * (though it may now be dark) so he won't fall into a
559 * pit while staring into the gloom. */
561 RSPEAK(NO_MORE_DETAIL);
564 game.abbrev[game.loc]=0;
567 else if (motion == CAVE) {
568 /* Cave. Different messages depending on whether above ground. */
569 RSPEAK((OUTSID(game.loc) && game.loc != LOC_GRATE) ? FOLLOW_STREAM : NEED_DETAIL);
573 /* none of the specials */
574 game.oldlc2=game.oldloc;
575 game.oldloc=game.loc;
578 /* ordinary travel */
580 scratchloc=labs(TRAVEL[kk]);
581 if (MOD(scratchloc,1000) == 1 || MOD(scratchloc,1000) == motion)
583 if (TRAVEL[kk] < 0) {
584 /* FIXME: Magic numbers! */
585 /* Non-applicable motion. Various messages depending on
588 if (motion >= 43 && motion <= 50)spk=BAD_DIRECTION;
589 if (motion == 29 || motion == 30)spk=BAD_DIRECTION;
590 if (motion == 7 || motion == 36 || motion == 37)spk=UNSURE_FACING;
591 if (motion == 11 || motion == 19)spk=NO_INOUT_HERE;
592 if (verb == FIND || verb == INVENT)spk=NEreplace;
593 if (motion == 62 || motion == 65)spk=NOTHING_HAPPENS;
594 if (motion == 17)spk=WHICH_WAY;
600 scratchloc=scratchloc/1000;
604 * (ESR) This special-travel loop may have to be repeated if it includes
605 * the plover passage. Same deal for any future cases wgerw we beed to
606 * block travel and then redo it once the blocking condition has been
610 game.newloc=scratchloc/1000;
611 motion=MOD(game.newloc,100);
612 if (!SPECIAL(game.newloc)) {
613 if (game.newloc <= 100) {
614 if (game.newloc == 0 || PCT(game.newloc))
616 /* else fall through */
617 } if (TOTING(motion) || (game.newloc > 200 && AT(motion)))
619 /* else fall through */
621 else if (game.prop[motion] != game.newloc/100-3)
624 if (TRAVEL[kk] < 0)BUG(25);
626 game.newloc=labs(TRAVEL[kk])/1000;
628 (game.newloc == scratchloc);
629 scratchloc=game.newloc;
632 game.newloc=MOD(scratchloc,1000);
633 if (!SPECIAL(game.newloc))
635 if (game.newloc <= 500) {
636 game.newloc=game.newloc-SPECIALBASE;
640 /* Travel 301. Plover-alcove passage. Can carry only
641 * emerald. Note: travel table must include "useless"
642 * entries going through passage, which can never be used for
643 * actual motion, but can be spotted by "go back". */
644 /* FIXME: Arithmetic on location numbers */
645 game.newloc=99+100-game.loc;
646 if (game.holdng == 0 || (game.holdng == 1 && TOTING(EMRALD)))
648 game.newloc=game.loc;
652 /* Travel 302. Plover transport. Drop the emerald (only use
653 * special travel if toting it), so he's forced to use the
654 * plover-passage to get it out. Having dropped it, go back and
655 * pretend he wasn't carrying it after all. */
656 DROP(EMRALD,game.loc);
658 if (TRAVEL[kk] < 0)BUG(25);
660 game.newloc=labs(TRAVEL[kk])/1000;
662 (game.newloc == scratchloc);
663 continue; /* back to top of do/while loop */
665 /* Travel 303. Troll bridge. Must be done only as special
666 * motion so that dwarves won't wander across and encounter
667 * the bear. (They won't follow the player there because
668 * that region is forbidden to the pirate.) If
669 * game.prop(TROLL)=1, he's crossed since paying, so step out
670 * and block him. (standard travel entries check for
671 * game.prop(TROLL)=0.) Special stuff for bear. */
672 if (game.prop[TROLL] == 1) {
676 MOVE(TROLL2+NOBJECTS,0);
677 MOVE(TROLL,PLAC[TROLL]);
678 MOVE(TROLL+NOBJECTS,FIXD[TROLL]);
680 game.newloc=game.loc;
683 game.newloc=PLAC[TROLL]+FIXD[TROLL]-game.loc;
684 if (game.prop[TROLL] == 0)game.prop[TROLL]=1;
685 if (!TOTING(BEAR)) return true;
686 RSPEAK(BRIDGE_COLLAPSE);
689 DROP(BEAR,game.newloc);
690 game.fixed[BEAR]= -1;
692 game.oldlc2=game.newloc;
701 /* FIXME: Arithmetic on location number, becoming a message number */
702 RSPEAK(game.newloc-500);
703 game.newloc=game.loc;
707 static bool closecheck(void)
708 /* Handle the closing of the cave. The cave closes "clock1" turns
709 * after the last treasure has been located (including the pirate's
710 * chest, which may of course never show up). Note that the
711 * treasures need not have been taken yet, just located. Hence
712 * clock1 must be large enough to get out of the cave (it only ticks
713 * while inside the cave). When it hits zero, we branch to 10000 to
714 * start closing the cave, and then sit back and wait for him to try
715 * to get out. If he doesn't within clock2 turns, we close the cave;
716 * if he does try, we assume he panics, and give him a few additional
717 * turns to get frantic before we close. When clock2 hits zero, we
718 * branch to 11000 to transport him into the final puzzle. Note that
719 * the puzzle depends upon all sorts of random things. For instance,
720 * there must be no water or oil, since there are beanstalks which we
721 * don't want to be able to water, since the code can't handle it.
722 * Also, we can have no keys, since there is a grate (having moved
723 * the fixed object!) there separating him from all the treasures.
724 * Most of these problems arise from the use of negative prop numbers
725 * to suppress the object descriptions until he's actually moved the
728 if (game.tally == 0 && INDEEP(game.loc) && game.loc != 33)
731 /* When the first warning comes, we lock the grate, destroy
732 * the bridge, kill all the dwarves (and the pirate), remove
733 * the troll and bear (unless dead), and set "closng" to
734 * true. Leave the dragon; too much trouble to move it.
735 * from now until clock2 runs out, he cannot unlock the
736 * grate, move to any location outside the cave, or create
737 * the bridge. Nor can he be resurrected if he dies. Note
738 * that the snake is already gone, since he got to the
739 * treasure accessible only via the hall of the mountain
740 * king. Also, he's been in giant room (to get eggs), so we
741 * can refer to it. Also also, he's gotten the pearl, so we
742 * know the bivalve is an oyster. *And*, the dwarves must
743 * have been activated, since we've found chest. */
744 if (game.clock1 == 0)
748 for (int i=1; i<=NDWARVES; i++) {
753 MOVE(TROLL+NOBJECTS,0);
754 MOVE(TROLL2,PLAC[TROLL]);
755 MOVE(TROLL2+NOBJECTS,FIXD[TROLL]);
757 if (game.prop[BEAR] != 3)DESTROY(BEAR);
762 RSPEAK(CAVE_CLOSING);
766 } else if (game.clock1 < 0)
768 if (game.clock2 == 0) {
769 /* Once he's panicked, and clock2 has run out, we come here
770 * to set up the storage room. The room has two locs,
771 * hardwired as 115 (ne) and 116 (sw). At the ne end, we
772 * place empty bottles, a nursery of plants, a bed of
773 * oysters, a pile of lamps, rods with stars, sleeping
774 * dwarves, and him. At the sw end we place grate over
775 * treasures, snake pit, covey of caged birds, more rods, and
776 * pillows. A mirror stretches across one wall. Many of the
777 * objects come from known locations and/or states (e.g. the
778 * snake is known to have been destroyed and needn't be
779 * carried away from its old "place"), making the various
780 * objects be handled differently. We also drop all other
781 * objects he might be carrying (lest he have some which
782 * could cause trouble, such as the keys). We describe the
783 * flash of light and trundle back. */
784 game.prop[BOTTLE]=PUT(BOTTLE,LOC_NE,1);
785 game.prop[PLANT]=PUT(PLANT,LOC_NE,0);
786 game.prop[OYSTER]=PUT(OYSTER,LOC_NE,0);
788 game.prop[LAMP]=PUT(LAMP,LOC_NE,0);
789 game.prop[ROD]=PUT(ROD,LOC_NE,0);
790 game.prop[DWARF]=PUT(DWARF,LOC_NE,0);
792 game.oldloc = LOC_NE;
793 game.newloc = LOC_NE;
794 /* Leave the grate with normal (non-negative) property.
799 game.prop[SNAKE]=PUT(SNAKE,LOC_SW,1);
800 game.prop[BIRD]=PUT(BIRD,LOC_SW,1);
801 game.prop[CAGE]=PUT(CAGE,LOC_SW,0);
802 game.prop[ROD2]=PUT(ROD2,LOC_SW,0);
803 game.prop[PILLOW]=PUT(PILLOW,LOC_SW,0);
805 game.prop[MIRROR]=PUT(MIRROR,LOC_NE,0);
806 game.fixed[MIRROR]=LOC_SW;
808 for (int i=1; i<=NOBJECTS; i++) {
821 static void lampcheck(void)
822 /* Check game limit and lamp timers */
824 if (game.prop[LAMP] == 1)
827 /* Another way we can force an end to things is by having the
828 * lamp give out. When it gets close, we come here to warn
829 * him. First following ar, if the lamp and fresh batteries are
830 * here, in which case we replace the batteries and continue.
831 * Second is for other cases of lamp dying. 12400 is when it
832 * goes out. Even then, he can explore outside for a while
834 if (game.limit <= WARNTIME && HERE(BATTER) && game.prop[BATTER]==0 && HERE(LAMP))
836 RSPEAK(REPLACE_BATTERIES);
839 DROP(BATTER,game.loc);
840 game.limit=game.limit+2500;
842 } else if (game.limit == 0) {
847 } else if (game.limit <= WARNTIME) {
848 if (!game.lmwarn && HERE(LAMP)) {
850 int spk=GET_BATTERIES;
851 if (game.place[BATTER] == NOWHERE)spk=LAMP_DIM;
852 if (game.prop[BATTER] == 1)spk=MISSING_BATTERIES;
858 static void listobjects(void)
859 /* Print out descriptions of objects at this location. If
860 * not closing and property value is negative, tally off
861 * another treasure. Rug is special case; once seen, its
862 * game.prop is 1 (dragon on it) till dragon is killed.
863 * Similarly for chain; game.prop is initially 1 (locked to
864 * bear). These hacks are because game.prop=0 is needed to
867 if (!DARK(game.loc)) {
868 ++game.abbrev[game.loc];
869 for (int i=game.atloc[game.loc]; i != 0; i=game.link[i]) {
871 if (obj > NOBJECTS)obj=obj-NOBJECTS;
872 if (obj == STEPS && TOTING(NUGGET))
874 if (game.prop[obj] < 0) {
878 if (obj == RUG || obj == CHAIN)
881 /* Note: There used to be a test here to see whether the
882 * player had blown it so badly that he could never ever see
883 * the remaining treasures, and if so the lamp was zapped to
884 * 35 turns. But the tests were too simple-minded; things
885 * like killing the bird before the snake was gone (can never
886 * see jewelry), and doing it "right" was hopeless. E.G.,
887 * could cross troll bridge several times, using up all
888 * available treasures, breaking vase, using coins to buy
889 * batteries, etc., and eventually never be able to get
890 * across again. If bottle were left on far side, could then
891 * never get eggs or trident, and the effects propagate. So
892 * the whole thing was flushed. anyone who makes such a
893 * gross blunder isn't likely to find everything else anyway
894 * (so goes the rationalisation). */
896 int kk=game.prop[obj];
897 if (obj == STEPS && game.loc == game.fixed[STEPS])
904 static bool do_command(FILE *cmdin)
905 /* Get and execute a command */
907 long kq, verb, V1, V2;
911 enum speechpart part;
913 /* Can't leave cave once it's closing (except by main office). */
914 if (OUTSID(game.newloc) && game.newloc != 0 && game.closng) {
916 game.newloc=game.loc;
917 if (!game.panic)game.clock2=15;
921 /* See if a dwarf has seen him and has come from where he
922 * wants to go. If so, the dwarf's blocking his way. If
923 * coming from place forbidden to pirate (dwarves rooted in
924 * place) let him get out (and attacked). */
925 if (game.newloc != game.loc && !FORCED(game.loc) && !CNDBIT(game.loc,NOARRR)) {
926 for (i=1; i<=NDWARVES-1; i++) {
927 if (game.odloc[i] == game.newloc && game.dseen[i]) {
928 game.newloc=game.loc;
934 game.loc=game.newloc;
939 /* Describe the current location and (maybe) get next command. */
944 char* msg = locations[game.loc].description.small;
945 if (MOD(game.abbrev[game.loc],game.abbnum) == 0 || msg == 0)
946 msg=locations[game.loc].description.big;
947 if (!FORCED(game.loc) && DARK(game.loc)) {
948 /* The easiest way to get killed is to fall into a pit in
950 if (game.wzdark && PCT(35)) {
952 game.oldlc2 = game.loc;
954 continue; /* back to top of main interpreter loop */
956 msg=arbitrary_messages[PITCH_DARK];
958 if (TOTING(BEAR))RSPEAK(TAME_BEAR);
960 if (FORCED(game.loc)) {
961 if (playermove(cmdin, verb, 1))
964 continue; /* back to top of main interpreter loop */
966 if (game.loc == 33 && PCT(25) && !game.closng)RSPEAK(SAYS_PLUGH);
978 /* If closing time, check for any objects being toted with
979 * game.prop < 0 and set the prop to -1-game.prop. This way
980 * objects won't be described until they've been picked up
981 * and put down separate from their respective piles. Don't
982 * tick game.clock1 unless well into cave (and not at Y2). */
984 if (game.prop[OYSTER] < 0 && TOTING(OYSTER))
986 for (i=1; i<=NOBJECTS; i++) {
987 if (TOTING(i) && game.prop[i] < 0)
988 game.prop[i] = -1-game.prop[i];
991 game.wzdark=DARK(game.loc);
992 if (game.knfloc > 0 && game.knfloc != game.loc)
995 /* This is where we get a new command from the user */
996 if (!GETIN(cmdin, &WD1,&WD1X,&WD2,&WD2X))
999 /* Every input, check "game.foobar" flag. If zero, nothing's
1000 * going on. If pos, make neg. If neg, he skipped a word,
1001 * so make it zero. */
1003 game.foobar=(game.foobar>0 ? -game.foobar : 0);
1005 if (game.turns == game.thresh) {
1006 newspeak(turn_threshold_messages[game.trndex]);
1007 game.trnluz=game.trnluz+TRNVAL[game.trndex]/100000;
1010 if (game.trndex <= TRNVLS)
1011 game.thresh=MOD(TRNVAL[game.trndex],100000)+1;
1013 if (verb == SAY && WD2 > 0)
1026 if (LIQLOC(game.loc) == WATER)k=FEET_WET;
1029 if (V1 == ENTER && (V2 == STREAM || V2 == 1000+WATER)) {
1033 if (V1 == ENTER && WD2 > 0) {
1038 if (!((V1 != 1000+WATER && V1 != 1000+OIL) ||
1039 (V2 != 1000+PLANT && V2 != 1000+DOOR))) {
1041 WD2=MAKEWD(16152118);
1043 if (V1 == 1000+CAGE && V2 == 1000+BIRD && HERE(CAGE) && HERE(BIRD))
1044 WD1=MAKEWD(301200308);
1047 if (WD1 == MAKEWD(23051920)) {
1049 if (game.iwest == 10)
1052 if (WD1 == MAKEWD( 715) && WD2 != 0) {
1054 RSPEAK(GO_UNNEEDED);
1059 /* Gee, I don't understand. */
1060 if (fallback_handler(rawbuf))
1071 if (playermove(cmdin, verb, kmod))
1074 continue; /* back to top of main interpreter loop */
1075 case 1: part=unknown; obj = kmod; break;
1076 case 2: part=intransitive; verb = kmod; break;
1077 case 3: RSPEAK(kmod); goto L2012;
1082 switch (action(cmdin, part, verb, obj)) {
1086 playermove(cmdin, verb, NUL);
1088 case GO_TOP: continue; /* back to top of main interpreter loop */
1089 case GO_CLEAROBJ: goto L2012;
1090 case GO_CHECKHINT: goto L2600;
1091 case GO_CHECKFOO: goto L2607;
1092 case GO_LOOKUP: goto L2630;
1094 /* Get second word for analysis. */
1100 /* Random intransitive verbs come here. Clear obj just in case
1101 * (see attack()). */
1107 /* Oh dear, he's disturbed the dwarves. */
1108 RSPEAK(DWARVES_AWAKEN);