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"
28 #define DIM(a) (sizeof(a)/sizeof(a[0]))
30 /* Abstract out the encoding of words in the travel array. Gives us
31 * some hope of getting to a less cryptic representation than we
32 * inherited from FORTRAN, someday. To understand these, read the
33 * encoding description for TRAVEL.
35 #define T_DESTINATION(entry) MOD(labs(entry) / 1000, 1000)
36 #define T_NODWARVES(entry) labs(entry) / 1000000 == 100
37 #define T_MOTION(entry) MOD(labs(entry), 1000)
38 #define L_SPEAK(loc) ((loc) - 500)
39 #define T_TERMINATE(entry) (T_MOTION(entry) == 1)
44 char rawbuf[LINESIZE], INLINE[LINESIZE + 1];
52 FILE *logfp = NULL, *rfp = NULL;
53 bool oldstyle = false;
57 static void sig_handler(int signo)
59 if (signo == SIGINT) {
69 * Adventure (rev 2: 20 treasures)
71 * History: Original idea & 5-treasure version (adventures) by Willie Crowther
72 * 15-treasure version (adventure) by Don Woods, April-June 1977
73 * 20-treasure version (rev 2) by Don Woods, August 1978
74 * Errata fixed: 78/12/25
75 * Revived 2017 as Open Adventure.
78 static bool do_command(FILE *);
80 int main(int argc, char *argv[])
87 const char* opts = "l:or:s";
88 const char* usage = "Usage: %s [-l logfilename] [-o] [-r restorefilename] [-s] \n";
90 const char* opts = "l:os";
91 const char* usage = "Usage: %s [-l logfilename] [-o] [-s] \n";
93 while ((ch = getopt(argc, argv, opts)) != EOF) {
96 logfp = fopen(optarg, "w");
99 "advent: can't open logfile %s for write\n",
101 signal(SIGINT, sig_handler);
105 editline = prompt = false;
107 #ifndef ADVENT_NOSAVE
109 rfp = fopen(optarg, "r");
112 "advent: can't open save file %s for read\n",
114 signal(SIGINT, sig_handler);
124 " -l create a log file of your game named as specified'\n");
126 " -o 'oldstyle' (no prompt, no command editing, displays 'Initialising...')\n");
127 #ifndef ADVENT_NOSAVE
129 " -r restore from specified saved game file\n");
132 " -s suppress command editing\n");
138 linenoiseHistorySetMaxLen(350);
140 /* Initialize our LCG PRNG with parameters tested against
141 * Knuth vol. 2. by the original authors */
144 game.lcg_m = 1048576;
146 long seedval = (long)rand();
149 /* Initialize game variables */
152 /* Start-up, dwarf stuff */
153 game.zzword = rndvoc(3, 0);
154 game.newloc = LOC_START;
155 game.loc = LOC_START;
156 game.limit = GAMELIMIT;
158 game.novice = yes(arbitrary_messages[WELCOME_YOU], arbitrary_messages[CAVE_NEARBY], arbitrary_messages[NO_MESSAGE]);
160 game.limit = NOVICELIMIT;
166 fprintf(logfp, "seed %ld\n", seedval);
168 /* interpret commands until EOF or interrupt */
170 if (!do_command(stdin))
173 /* show score and exit */
177 static bool fallback_handler(char *buf)
178 /* fallback handler for commands not handled by FORTRANish parser */
181 if (sscanf(buf, "seed %ld", &sv) == 1) {
183 printf("Seed set to %ld\n", sv);
184 // autogenerated, so don't charge user time for it.
186 // here we reconfigure any global game state that uses random numbers
187 game.zzword = rndvoc(3, 0);
193 /* Check if this loc is eligible for any hints. If been here long
194 * enough, display. Ignore "HINTS" < 4 (special stuff, see database
196 static void checkhints(void)
198 if (conditions[game.loc] >= game.conds) {
199 for (int hint = 0; hint < NHINTS; hint++) {
200 if (game.hinted[hint])
202 if (!CNDBIT(game.loc, hint + 1 + COND_HBASE))
203 game.hintlc[hint] = -1;
205 /* Come here if he's been long enough at required loc(s) for some
207 if (game.hintlc[hint] >= hints[hint].turns) {
213 if (game.prop[GRATE] == GRATE_CLOSED && !HERE(KEYS))
215 game.hintlc[hint] = 0;
218 if (game.place[BIRD] == game.loc && TOTING(ROD) && game.oldobj == BIRD)
222 if (HERE(SNAKE) && !HERE(BIRD))
224 game.hintlc[hint] = 0;
227 if (game.atloc[game.loc] == 0 &&
228 game.atloc[game.oldloc] == 0 &&
229 game.atloc[game.oldlc2] == 0 &&
232 game.hintlc[hint] = 0;
235 if (game.prop[EMERALD] != -1 && game.prop[PYRAMID] == -1)
237 game.hintlc[hint] = 0;
244 game.hintlc[hint] = 0;
247 if (game.atloc[game.loc] == 0 &&
248 game.atloc[game.oldloc] == 0 &&
249 game.atloc[game.oldlc2] == 0)
253 i = atdwrf(game.loc);
255 game.hintlc[hint] = 0;
258 if (HERE(OGRE) && i == 0)
262 if (game.tally == 1 && game.prop[JADE] < 0)
264 game.hintlc[hint] = 0;
267 BUG(HINT_NUMBER_EXCEEDS_GOTO_LIST);
271 /* Fall through to hint display */
272 game.hintlc[hint] = 0;
273 if (!yes(hints[hint].question, arbitrary_messages[NO_MESSAGE], arbitrary_messages[OK_MAN]))
275 rspeak(HINT_COST, hints[hint].penalty, hints[hint].penalty);
276 game.hinted[hint] = yes(arbitrary_messages[WANT_HINT], hints[hint].hint, arbitrary_messages[OK_MAN]);
277 if (game.hinted[hint] && game.limit > WARNTIME)
278 game.limit += WARNTIME * hints[hint].penalty;
284 static bool spotted_by_pirate(int i)
289 /* The pirate's spotted him. He leaves him alone once we've
290 * found chest. K counts if a treasure is here. If not, and
291 * tally=1 for an unseen chest, let the pirate be spotted. Note
292 * that game.place[CHEST] = LOC_NOWHERE might mean that he's thrown
293 * it to the troll, but in that case he's seen the chest
295 if (game.loc == game.chloc || game.prop[CHEST] >= 0)
298 bool movechest = false, robplayer = false;
299 for (int treasure = 1; treasure <= NOBJECTS; treasure++) {
300 if (!objects[treasure].is_treasure)
302 /* Pirate won't take pyramid from plover room or dark
303 * room (too easy!). */
304 if (treasure == PYRAMID && (game.loc == objects[PYRAMID].plac || game.loc == objects[EMERALD].plac)) {
307 if (TOTING(treasure) || HERE(treasure))
309 if (TOTING(treasure)) {
314 /* Force chest placement before player finds last treasure */
315 if (game.tally == 1 && snarfed == 0 && game.place[CHEST] == LOC_NOWHERE && HERE(LAMP) && game.prop[LAMP] == LAMP_BRIGHT) {
316 rspeak(PIRATE_SPOTTED);
319 /* Do things in this order (chest move before robbery) so chest is listed
320 * last at the maze location. */
322 move(CHEST, game.chloc);
323 move(MESSAG, game.chloc2);
324 game.dloc[PIRATE] = game.chloc;
325 game.odloc[PIRATE] = game.chloc;
326 game.dseen[PIRATE] = false;
328 /* You might get a hint of the pirate's presence even if the
329 * chest doesn't move... */
330 if (game.odloc[PIRATE] != game.dloc[PIRATE] && PCT(20))
331 rspeak(PIRATE_RUSTLES);
334 rspeak(PIRATE_POUNCES);
335 for (int treasure = 1; treasure <= NOBJECTS; treasure++) {
336 if (!objects[treasure].is_treasure)
338 if (!(treasure == PYRAMID && (game.loc == objects[PYRAMID].plac || game.loc == objects[EMERALD].plac))) {
339 if (AT(treasure) && game.fixed[treasure] == 0)
340 carry(treasure, game.loc);
341 if (TOTING(treasure))
342 drop(treasure, game.chloc);
350 static bool dwarfmove(void)
351 /* Dwarves move. Return true if player survives, false if he dies. */
353 int kk, stick, attack;
356 /* Dwarf stuff. See earlier comments for description of
357 * variables. Remember sixth dwarf is pirate and is thus
358 * very different except for motion rules. */
360 /* First off, don't let the dwarves follow him into a pit or
361 * a wall. Activate the whole mess the first time he gets as
362 * far as the hall of mists (loc 15). If game.newloc is
363 * forbidden to pirate (in particular, if it's beyond the
364 * troll bridge), bypass dwarf stuff. That way pirate can't
365 * steal return toll, and dwarves can't meet the bear. Also
366 * means dwarves won't follow him into dead end in maze, but
367 * c'est la vie. They'll wait for him outside the dead
369 if (game.loc == 0 || FORCED(game.loc) || CNDBIT(game.newloc, COND_NOARRR))
372 /* Dwarf activity level ratchets up */
373 if (game.dflag == 0) {
374 if (INDEEP(game.loc))
379 /* When we encounter the first dwarf, we kill 0, 1, or 2 of
380 * the 5 dwarves. If any of the survivors is at loc,
381 * replace him with the alternate. */
382 if (game.dflag == 1) {
383 if (!INDEEP(game.loc) || (PCT(95) && (!CNDBIT(game.loc, COND_NOBACK) || PCT(85))))
386 for (int i = 1; i <= 2; i++) {
387 int j = 1 + randrange(NDWARVES - 1);
391 for (int i = 1; i <= NDWARVES - 1; i++) {
392 if (game.dloc[i] == game.loc)
393 game.dloc[i] = DALTLC;
394 game.odloc[i] = game.dloc[i];
401 /* Things are in full swing. Move each dwarf at random,
402 * except if he's seen us he sticks with us. Dwarves stay
403 * deep inside. If wandering at random, they don't back up
404 * unless there's no alternative. If they don't have to
405 * move, they attack. And, of course, dead dwarves don't do
406 * much of anything. */
410 for (int i = 1; i <= NDWARVES; i++) {
411 if (game.dloc[i] == 0)
413 /* Fill tk array with all the places this dwarf might go. */
415 kk = TKEY[game.dloc[i]];
418 game.newloc = T_DESTINATION(TRAVEL[kk]);
419 /* Have we avoided a dwarf encounter? */
420 bool avoided = (SPECIAL(game.newloc) ||
421 !INDEEP(game.newloc) ||
422 game.newloc == game.odloc[i] ||
423 (j > 1 && game.newloc == tk[j - 1]) ||
425 game.newloc == game.dloc[i] ||
426 FORCED(game.newloc) ||
427 (i == PIRATE && CNDBIT(game.newloc, COND_NOARRR)) ||
428 T_NODWARVES(TRAVEL[kk]));
430 tk[j++] = game.newloc;
434 (TRAVEL[kk - 1] >= 0);
435 tk[j] = game.odloc[i];
438 j = 1 + randrange(j);
439 game.odloc[i] = game.dloc[i];
440 game.dloc[i] = tk[j];
441 game.dseen[i] = (game.dseen[i] && INDEEP(game.loc)) || (game.dloc[i] == game.loc || game.odloc[i] == game.loc);
442 if (!game.dseen[i]) continue;
443 game.dloc[i] = game.loc;
444 if (spotted_by_pirate(i))
446 /* This threatening little dwarf is in the room with him! */
448 if (game.odloc[i] == game.dloc[i]) {
450 if (game.knfloc >= 0)
451 game.knfloc = game.loc;
452 if (randrange(1000) < 95 * (game.dflag - 2))
457 /* Now we know what's happening. Let's tell the poor sucker about it.
458 * Note that various of the "knife" messages must have specific relative
459 * positions in the rspeak database. */
460 if (game.dtotal == 0)
462 rspeak(game.dtotal == 1 ? DWARF_SINGLE : DWARF_PACK, game.dtotal);
465 if (game.dflag == 2)game.dflag = 3;
467 rspeak(THROWN_KNIVES, attack);
468 rspeak(stick > 1 ? MULTIPLE_HITS : (stick == 1 ? ONE_HIT : NONE_HIT), stick);
470 rspeak(KNIFE_THROWN);
475 game.oldlc2 = game.loc;
479 /* "You're dead, Jim."
481 * If the current loc is zero, it means the clown got himself killed.
482 * We'll allow this maxdie times. NDEATHS is automatically set based
483 * on the number of snide messages available. Each death results in
484 * a message (81, 83, etc.) which offers reincarnation; if accepted,
485 * this results in message 82, 84, etc. The last time, if he wants
486 * another chance, he gets a snide remark as we exit. When
487 * reincarnated, all objects being carried get dropped at game.oldlc2
488 * (presumably the last place prior to being killed) without change
489 * of props. the loop runs backwards to assure that the bird is
490 * dropped before the cage. (this kluge could be changed once we're
491 * sure all references to bird and cage are done by keywords.) The
492 * lamp is a special case (it wouldn't do to leave it in the cave).
493 * It is turned off and left outside the building (only if he was
494 * carrying it, of course). He himself is left inside the building
495 * (and heaven help him if he tries to xyzzy back into the cave
496 * without the lamp!). game.oldloc is zapped so he can't just
499 static void croak(void)
500 /* Okay, he's dead. Let's get on with it. */
502 const char* query = obituaries[game.numdie].query;
503 const char* yes_response = obituaries[game.numdie].yes_response;
506 /* He died during closing time. No resurrection. Tally up a
508 rspeak(DEATH_CLOSING);
510 } else if (game.numdie == NDEATHS || !yes(query, yes_response, arbitrary_messages[OK_MAN]))
513 game.place[WATER] = game.place[OIL] = LOC_NOWHERE;
515 game.prop[LAMP] = LAMP_DARK;
516 for (int j = 1; j <= NOBJECTS; j++) {
517 int i = NOBJECTS + 1 - j;
519 /* Always leave lamp where it's accessible aboveground */
520 drop(i, (i == LAMP) ? LOC_START : game.oldlc2);
523 game.loc = LOC_BUILDING;
524 game.oldloc = game.loc;
528 /* Given the current location in "game.loc", and a motion verb number in
529 * "motion", put the new location in "game.newloc". The current loc is saved
530 * in "game.oldloc" in case he wants to retreat. The current
531 * game.oldloc is saved in game.oldlc2, in case he dies. (if he
532 * does, game.newloc will be limbo, and game.oldloc will be what killed
533 * him, so we need game.oldlc2, which is the last place he was
536 static bool playermove(token_t verb, int motion)
538 int scratchloc, k2, kk = TKEY[game.loc];
539 game.newloc = game.loc;
541 BUG(LOCATION_HAS_NO_TRAVEL_ENTRIES);
544 else if (motion == BACK) {
545 /* Handle "go back". Look for verb which goes from game.loc to
546 * game.oldloc, or to game.oldlc2 If game.oldloc has forced-motion.
547 * k2 saves entry -> forced loc -> previous loc. */
548 motion = game.oldloc;
550 motion = game.oldlc2;
551 game.oldlc2 = game.oldloc;
552 game.oldloc = game.loc;
554 if (motion == game.loc)k2 = FORGOT_PATH;
555 if (CNDBIT(game.loc, COND_NOBACK))k2 = TWIST_TURN;
558 scratchloc = T_DESTINATION(TRAVEL[kk]);
559 if (scratchloc != motion) {
560 if (!SPECIAL(scratchloc)) {
561 if (FORCED(scratchloc) && T_DESTINATION(TRAVEL[TKEY[scratchloc]]) == motion)
564 if (TRAVEL[kk] >= 0) {
565 ++kk; /* go to next travel entry for this location */
568 /* we've reached the end of travel entries for game.loc */
571 rspeak(NOT_CONNECTED);
576 motion = T_MOTION(TRAVEL[kk]);
578 break; /* fall through to ordinary travel */
584 } else if (motion == LOOK) {
585 /* Look. Can't give more detail. Pretend it wasn't dark
586 * (though it may now be dark) so he won't fall into a
587 * pit while staring into the gloom. */
589 rspeak(NO_MORE_DETAIL);
592 game.abbrev[game.loc] = 0;
594 } else if (motion == CAVE) {
595 /* Cave. Different messages depending on whether above ground. */
596 rspeak((OUTSID(game.loc) && game.loc != LOC_GRATE) ? FOLLOW_STREAM : NEED_DETAIL);
599 /* none of the specials */
600 game.oldlc2 = game.oldloc;
601 game.oldloc = game.loc;
604 /* Look for a way to fulfil the motion - kk indexes the beginning
605 * of the motion entries for here (game.loc). */
607 if (T_TERMINATE(TRAVEL[kk]) || T_MOTION(TRAVEL[kk]) == motion)
609 if (TRAVEL[kk] < 0) {
610 /* FIXME: Magic numbers! */
611 /* Couldn't find an entry matching the motion word passed
612 * in. Various messages depending on word given. */
613 int spk = CANT_APPLY;
614 if (motion >= 43 && motion <= 50)spk = BAD_DIRECTION;
615 if (motion == 29 || motion == 30)spk = BAD_DIRECTION;
616 if (motion == 7 || motion == 36 || motion == 37)spk = UNSURE_FACING;
617 if (motion == 11 || motion == 19)spk = NO_INOUT_HERE;
618 if (verb == FIND || verb == INVENT)spk = NEARBY;
619 if (motion == 62 || motion == 65)spk = NOTHING_HAPPENS;
620 if (motion == 17)spk = WHICH_WAY;
626 scratchloc = labs(TRAVEL[kk]) / 1000;
630 * (ESR) This special-travel loop may have to be repeated if it includes
631 * the plover passage. Same deal for any future cases where we need to
632 * block travel and then redo it once the blocking condition has been
635 for (;;) { /* L12 loop */
637 game.newloc = scratchloc / 1000;
638 motion = MOD(game.newloc, 100);
639 if (!SPECIAL(game.newloc)) {
640 if (game.newloc <= 100) {
641 if (game.newloc == 0 || PCT(game.newloc))
643 /* else fall through */
645 if (TOTING(motion) || (game.newloc > 200 && AT(motion)))
647 /* else fall through */
648 } else if (game.prop[motion] != game.newloc / 100 - 3)
652 BUG(CONDITIONAL_TRAVEL_ENTRY_WITH_NO_ALTERATION);
654 game.newloc = labs(TRAVEL[kk]) / 1000;
656 (game.newloc == scratchloc);
657 scratchloc = game.newloc;
660 game.newloc = MOD(scratchloc, 1000);
661 if (!SPECIAL(game.newloc))
663 if (game.newloc <= 500) {
664 game.newloc -= SPECIALBASE;
665 switch (game.newloc) {
667 /* Travel 301. Plover-alcove passage. Can carry only
668 * emerald. Note: travel table must include "useless"
669 * entries going through passage, which can never be used for
670 * actual motion, but can be spotted by "go back". */
671 /* FIXME: Arithmetic on location numbers */
672 game.newloc = 99 + 100 - game.loc;
673 if (game.holdng > 1 || (game.holdng == 1 && !TOTING(EMERALD))) {
674 game.newloc = game.loc;
679 /* Travel 302. Plover transport. Drop the emerald (only use
680 * special travel if toting it), so he's forced to use the
681 * plover-passage to get it out. Having dropped it, go back and
682 * pretend he wasn't carrying it after all. */
683 drop(EMERALD, game.loc);
686 BUG(CONDITIONAL_TRAVEL_ENTRY_WITH_NO_ALTERATION);
688 game.newloc = labs(TRAVEL[kk]) / 1000;
690 (game.newloc == scratchloc);
691 scratchloc = game.newloc;
692 continue; /* goto L12 */
694 /* Travel 303. Troll bridge. Must be done only as special
695 * motion so that dwarves won't wander across and encounter
696 * the bear. (They won't follow the player there because
697 * that region is forbidden to the pirate.) If
698 * game.prop(TROLL)=1, he's crossed since paying, so step out
699 * and block him. (standard travel entries check for
700 * game.prop(TROLL)=0.) Special stuff for bear. */
701 if (game.prop[TROLL] == 1) {
702 pspeak(TROLL,look, 1);
703 game.prop[TROLL] = 0;
705 move(TROLL2 + NOBJECTS, 0);
706 move(TROLL, objects[TROLL].plac);
707 move(TROLL + NOBJECTS, objects[TROLL].fixd);
709 game.newloc = game.loc;
712 game.newloc = objects[TROLL].plac + objects[TROLL].fixd - game.loc;
713 if (game.prop[TROLL] == 0)game.prop[TROLL] = 1;
714 if (!TOTING(BEAR)) return true;
715 rspeak(BRIDGE_COLLAPSE);
716 game.prop[CHASM] = 1;
717 game.prop[TROLL] = 2;
718 drop(BEAR, game.newloc);
719 game.fixed[BEAR] = -1;
721 game.oldlc2 = game.newloc;
726 BUG(SPECIAL_TRAVEL_500_GT_L_GT_300_EXCEEDS_GOTO_LIST);
728 break; /* Leave L12 loop */
733 /* Execute a speak rule */
734 rspeak(L_SPEAK(game.newloc));
735 game.newloc = game.loc;
739 static bool closecheck(void)
740 /* Handle the closing of the cave. The cave closes "clock1" turns
741 * after the last treasure has been located (including the pirate's
742 * chest, which may of course never show up). Note that the
743 * treasures need not have been taken yet, just located. Hence
744 * clock1 must be large enough to get out of the cave (it only ticks
745 * while inside the cave). When it hits zero, we branch to 10000 to
746 * start closing the cave, and then sit back and wait for him to try
747 * to get out. If he doesn't within clock2 turns, we close the cave;
748 * if he does try, we assume he panics, and give him a few additional
749 * turns to get frantic before we close. When clock2 hits zero, we
750 * branch to 11000 to transport him into the final puzzle. Note that
751 * the puzzle depends upon all sorts of random things. For instance,
752 * there must be no water or oil, since there are beanstalks which we
753 * don't want to be able to water, since the code can't handle it.
754 * Also, we can have no keys, since there is a grate (having moved
755 * the fixed object!) there separating him from all the treasures.
756 * Most of these problems arise from the use of negative prop numbers
757 * to suppress the object descriptions until he's actually moved the
760 if (game.tally == 0 && INDEEP(game.loc) && game.loc != LOC_Y2)
763 /* When the first warning comes, we lock the grate, destroy
764 * the bridge, kill all the dwarves (and the pirate), remove
765 * the troll and bear (unless dead), and set "closng" to
766 * true. Leave the dragon; too much trouble to move it.
767 * from now until clock2 runs out, he cannot unlock the
768 * grate, move to any location outside the cave, or create
769 * the bridge. Nor can he be resurrected if he dies. Note
770 * that the snake is already gone, since he got to the
771 * treasure accessible only via the hall of the mountain
772 * king. Also, he's been in giant room (to get eggs), so we
773 * can refer to it. Also also, he's gotten the pearl, so we
774 * know the bivalve is an oyster. *And*, the dwarves must
775 * have been activated, since we've found chest. */
776 if (game.clock1 == 0) {
777 game.prop[GRATE] = GRATE_CLOSED;
778 game.prop[FISSURE] = 0;
779 for (int i = 1; i <= NDWARVES; i++) {
780 game.dseen[i] = false;
784 move(TROLL + NOBJECTS, 0);
785 move(TROLL2, objects[TROLL].plac);
786 move(TROLL2 + NOBJECTS, objects[TROLL].fixd);
788 if (game.prop[BEAR] != 3)DESTROY(BEAR);
789 game.prop[CHAIN] = 0;
790 game.fixed[CHAIN] = 0;
793 rspeak(CAVE_CLOSING);
797 } else if (game.clock1 < 0)
799 if (game.clock2 == 0) {
800 /* Once he's panicked, and clock2 has run out, we come here
801 * to set up the storage room. The room has two locs,
802 * hardwired as LOC_NE and LOC_SW. At the ne end, we
803 * place empty bottles, a nursery of plants, a bed of
804 * oysters, a pile of lamps, rods with stars, sleeping
805 * dwarves, and him. At the sw end we place grate over
806 * treasures, snake pit, covey of caged birds, more rods, and
807 * pillows. A mirror stretches across one wall. Many of the
808 * objects come from known locations and/or states (e.g. the
809 * snake is known to have been destroyed and needn't be
810 * carried away from its old "place"), making the various
811 * objects be handled differently. We also drop all other
812 * objects he might be carrying (lest he have some which
813 * could cause trouble, such as the keys). We describe the
814 * flash of light and trundle back. */
815 game.prop[BOTTLE] = put(BOTTLE, LOC_NE, EMPTY_BOTTLE);
816 game.prop[PLANT] = put(PLANT, LOC_NE, 0);
817 game.prop[OYSTER] = put(OYSTER, LOC_NE, 0);
818 game.prop[LAMP] = put(LAMP, LOC_NE, 0);
819 game.prop[ROD] = put(ROD, LOC_NE, 0);
820 game.prop[DWARF] = put(DWARF, LOC_NE, 0);
822 game.oldloc = LOC_NE;
823 game.newloc = LOC_NE;
824 /* Leave the grate with normal (non-negative) property.
826 put(GRATE, LOC_SW, 0);
827 put(SIGN, LOC_SW, 0);
828 game.prop[SIGN] = ENDGAME_SIGN;
829 game.prop[SNAKE] = put(SNAKE, LOC_SW, 1);
830 game.prop[BIRD] = put(BIRD, LOC_SW, 1);
831 game.prop[CAGE] = put(CAGE, LOC_SW, 0);
832 game.prop[ROD2] = put(ROD2, LOC_SW, 0);
833 game.prop[PILLOW] = put(PILLOW, LOC_SW, 0);
835 game.prop[MIRROR] = put(MIRROR, LOC_NE, 0);
836 game.fixed[MIRROR] = LOC_SW;
838 for (int i = 1; i <= NOBJECTS; i++) {
851 static void lampcheck(void)
852 /* Check game limit and lamp timers */
854 if (game.prop[LAMP] == LAMP_BRIGHT)
857 /* Another way we can force an end to things is by having the
858 * lamp give out. When it gets close, we come here to warn him.
859 * First following arm checks if the lamp and fresh batteries are
860 * here, in which case we replace the batteries and continue.
861 * Second is for other cases of lamp dying. Eve after it goes
862 * out, he can explore outside for a while if desired. */
863 if (game.limit <= WARNTIME && HERE(BATTERY) && game.prop[BATTERY] == FRESH_BATTERIES && HERE(LAMP)) {
864 rspeak(REPLACE_BATTERIES);
865 game.prop[BATTERY] = DEAD_BATTERIES;
867 drop(BATTERY, game.loc);
868 game.limit += BATTERYLIFE;
870 } else if (game.limit == 0) {
872 game.prop[LAMP] = LAMP_DARK;
875 } else if (game.limit <= WARNTIME) {
876 if (!game.lmwarn && HERE(LAMP)) {
878 int spk = GET_BATTERIES;
879 if (game.place[BATTERY] == LOC_NOWHERE)spk = LAMP_DIM;
880 if (game.prop[BATTERY] == DEAD_BATTERIES)
881 spk = MISSING_BATTERIES;
887 static void listobjects(void)
888 /* Print out descriptions of objects at this location. If
889 * not closing and property value is negative, tally off
890 * another treasure. Rug is special case; once seen, its
891 * game.prop is 1 (dragon on it) till dragon is killed.
892 * Similarly for chain; game.prop is initially 1 (locked to
893 * bear). These hacks are because game.prop=0 is needed to
896 if (!DARK(game.loc)) {
897 ++game.abbrev[game.loc];
898 for (int i = game.atloc[game.loc]; i != 0; i = game.link[i]) {
900 if (obj > NOBJECTS)obj = obj - NOBJECTS;
901 if (obj == STEPS && TOTING(NUGGET))
903 if (game.prop[obj] < 0) {
907 if (obj == RUG || obj == CHAIN)
910 /* Note: There used to be a test here to see whether the
911 * player had blown it so badly that he could never ever see
912 * the remaining treasures, and if so the lamp was zapped to
913 * 35 turns. But the tests were too simple-minded; things
914 * like killing the bird before the snake was gone (can never
915 * see jewelry), and doing it "right" was hopeless. E.G.,
916 * could cross troll bridge several times, using up all
917 * available treasures, breaking vase, using coins to buy
918 * batteries, etc., and eventually never be able to get
919 * across again. If bottle were left on far side, could then
920 * never get eggs or trident, and the effects propagate. So
921 * the whole thing was flushed. anyone who makes such a
922 * gross blunder isn't likely to find everything else anyway
923 * (so goes the rationalisation). */
925 int kk = game.prop[obj];
926 if (obj == STEPS && game.loc == game.fixed[STEPS])
928 pspeak(obj, look, kk);
933 static bool do_command(FILE *cmdin)
934 /* Get and execute a command */
939 static struct command_t command;
942 /* Can't leave cave once it's closing (except by main office). */
943 if (OUTSID(game.newloc) && game.newloc != 0 && game.closng) {
945 game.newloc = game.loc;
946 if (!game.panic)game.clock2 = PANICTIME;
950 /* See if a dwarf has seen him and has come from where he
951 * wants to go. If so, the dwarf's blocking his way. If
952 * coming from place forbidden to pirate (dwarves rooted in
953 * place) let him get out (and attacked). */
954 if (game.newloc != game.loc && !FORCED(game.loc) && !CNDBIT(game.loc, COND_NOARRR)) {
955 for (size_t i = 1; i <= NDWARVES - 1; i++) {
956 if (game.odloc[i] == game.newloc && game.dseen[i]) {
957 game.newloc = game.loc;
963 game.loc = game.newloc;
968 /* Describe the current location and (maybe) get next command. */
973 const char* msg = locations[game.loc].description.small;
974 if (MOD(game.abbrev[game.loc], game.abbnum) == 0 || msg == 0)
975 msg = locations[game.loc].description.big;
976 if (!FORCED(game.loc) && DARK(game.loc)) {
977 /* The easiest way to get killed is to fall into a pit in
979 if (game.wzdark && PCT(35)) {
981 game.oldlc2 = game.loc;
983 continue; /* back to top of main interpreter loop */
985 msg = arbitrary_messages[PITCH_DARK];
987 if (TOTING(BEAR))rspeak(TAME_BEAR);
989 if (FORCED(game.loc)) {
990 if (playermove(command.verb, 1))
993 continue; /* back to top of main interpreter loop */
995 if (game.loc == LOC_Y2 && PCT(25) && !game.closng)
1002 game.oldobj = command.obj;
1008 /* If closing time, check for any objects being toted with
1009 * game.prop < 0 and set the prop to -1-game.prop. This way
1010 * objects won't be described until they've been picked up
1011 * and put down separate from their respective piles. Don't
1012 * tick game.clock1 unless well into cave (and not at Y2). */
1014 if (game.prop[OYSTER] < 0 && TOTING(OYSTER))
1015 pspeak(OYSTER, look, 1);
1016 for (size_t i = 1; i <= NOBJECTS; i++) {
1017 if (TOTING(i) && game.prop[i] < 0)
1018 game.prop[i] = -1 - game.prop[i];
1021 game.wzdark = DARK(game.loc);
1022 if (game.knfloc > 0 && game.knfloc != game.loc)
1025 /* This is where we get a new command from the user */
1026 if (!GETIN(cmdin, &command.wd1, &command.wd1x, &command.wd2, &command.wd2x))
1029 /* Every input, check "game.foobar" flag. If zero, nothing's
1030 * going on. If pos, make neg. If neg, he skipped a word,
1031 * so make it zero. */
1033 game.foobar = (game.foobar > 0 ? -game.foobar : 0);
1036 /* If a turn threshold has been met, apply penalties and tell
1037 * the player about it. */
1038 for (int i = 0; i < NTHRESHOLDS; ++i)
1040 if (game.turns == turn_thresholds[i].threshold + 1)
1042 game.trnluz += turn_thresholds[i].point_loss;
1043 speak(turn_thresholds[i].message);
1047 if (command.verb == SAY && command.wd2 > 0)
1049 if (command.verb == SAY) {
1050 command.part = transitive;
1059 V1 = vocab(command.wd1, -1);
1060 V2 = vocab(command.wd2, -1);
1061 if (V1 == ENTER && (V2 == STREAM || V2 == 1000 + WATER)) {
1062 if (LIQLOC(game.loc) == WATER) {
1065 rspeak(WHERE_QUERY);
1069 if (V1 == ENTER && command.wd2 > 0) {
1070 command.wd1 = command.wd2;
1071 command.wd1x = command.wd2x;
1072 wordclear(&command.wd2);
1074 /* FIXME: Magic numbers */
1075 if (!((V1 != 1000 + WATER && V1 != 1000 + OIL) ||
1076 (V2 != 1000 + PLANT && V2 != 1000 + DOOR))) {
1078 command.wd2 = MAKEWD(WORD_POUR);
1080 if (V1 == 1000 + CAGE && V2 == 1000 + BIRD && HERE(CAGE) && HERE(BIRD))
1081 command.wd1 = MAKEWD(WORD_CATCH);
1084 if (wordeq(command.wd1, MAKEWD(WORD_WEST))) {
1086 if (game.iwest == 10)
1089 if (wordeq(command.wd1, MAKEWD(WORD_GO)) && !wordempty(command.wd2)) {
1091 rspeak(GO_UNNEEDED);
1094 defn = vocab(command.wd1, -1);
1096 /* Gee, I don't understand. */
1097 if (fallback_handler(rawbuf))
1099 rspeak(DONT_KNOW, command.wd1, command.wd1x);
1102 kmod = MOD(defn, 1000);
1103 switch (defn / 1000) {
1105 if (playermove(command.verb, kmod))
1108 continue; /* back to top of main interpreter loop */
1110 command.part = unknown;
1114 command.part = intransitive;
1115 command.verb = kmod;
1121 BUG(VOCABULARY_TYPE_N_OVER_1000_NOT_BETWEEN_0_AND_3);
1125 switch (action(cmdin, &command)) {
1129 playermove(command.verb, NUL);
1132 continue; /* back to top of main interpreter loop */
1142 /* Get second word for analysis. */
1143 command.wd1 = command.wd2;
1144 command.wd1x = command.wd2x;
1145 wordclear(&command.wd2);
1148 /* Random intransitive verbs come here. Clear obj just in case
1149 * (see attack()). */
1150 rspeak(DO_WHAT, command.wd1, command.wd1x);
1154 /* Oh dear, he's disturbed the dwarves. */
1155 rspeak(DWARVES_AWAKEN);
1158 BUG(ACTION_RETURNED_PHASE_CODE_BEYOND_END_OF_SWITCH);