DLOC[7], FIXED[101],
KTAB[331], *LINES, LINK[201], LNLENG, LNPOSN,
PARMS[26], PLACE[101], PTEXT[101], RTEXT[278],
- SETUP = 0, TABSIZ = 330;
+ TABSIZ = 330;
signed char INLINE[LINESIZE+1], MAP1[129], MAP2[129];
long ACTSPK[36], AMBER, ATTACK, AXE, BACK, BATTER, BEAR, BIRD, BLOOD,
BOTTLE, CAGE, CAVE, CAVITY, CHAIN, CHASM, CHEST, CHLOC, CHLOC2,
- CLAM, CLSHNT, CLSMAX = 12, CLSSES,
+ CLAM, CLSMAX = 12, CLSSES,
COINS, COND[186], CONDS, CTEXT[13], CVAL[13], DALTLC,
- DOOR, DPRSSN, DRAGON, DSEEN[7], DWARF, EGGS,
+ DOOR, DPRSSN, DRAGON, DWARF, EGGS,
EMRALD, ENTER, ENTRNC, FIND, FISSUR, FIXD[101], FOOD,
GRATE, HINT, HINTED[21], HINTLC[21], HINTS[21][5], HNTMAX,
HNTSIZ = 20, I, INVENT, IGO, J, JADE, K, K2, KEY[186], KEYS, KK,
KNIFE, KQ, L, LAMP, LINSIZ = 12500, LINUSE, LL,
LOC, LOCK, LOCSIZ = 185, LOCSND[186], LOOK, LTEXT[186],
MAGZIN, MAXDIE, MAXTRS, MESH = 123456789,
- MESSAG, MIRROR, MXSCOR,
- NOVICE, NUGGET, NUL, OBJ, OBJSND[101],
- OBJTXT[101], ODLOC[7], OGRE, OIL, OLDLC2, OLDLOC, OLDOBJ, OYSTER,
- PANIC, PEARL, PILLOW, PLAC[101], PLANT, PLANT2, PROP[101], PYRAM,
- RESER, ROD, ROD2, RTXSIZ = 277, RUBY, RUG, SAPPH, SAVED, SAY,
- SCORE, SECT, SIGN, SNAKE, SPK, STEPS, STEXT[186], STICK,
- STREAM, TABNDX, TALLY, THRESH, THROW, TK[21], TRAVEL[886], TRIDNT,
- TRNDEX, TRNLUZ, TRNSIZ = 5, TRNVAL[6], TRNVLS, TROLL, TROLL2, TRVS,
- TRVSIZ = 885, TTEXT[6], TURNS, URN, V1, V2, VASE, VEND, VERB,
- VOLCAN, VRBSIZ = 35, VRSION = 25, WATER, WD1, WD1X, WD2, WD2X,
- ZZWORD;
+ MESSAG, MIRROR, MXSCOR, NUGGET, NUL, OBJ, OBJSND[101],
+ OBJTXT[101], ODLOC[7], OGRE, OIL, OYSTER,
+ PEARL, PILLOW, PLAC[101], PLANT, PLANT2, PROP[101], PYRAM,
+ RESER, ROD, ROD2, RTXSIZ = 277, RUBY, RUG, SAPPH, SAY,
+ SCORE, SECT, SIGN, SNAKE, STEPS, STEXT[186], STICK,
+ STREAM, TABNDX, THROW, TK[21], TRAVEL[886], TRIDNT,
+ TRNSIZ = 5, TRNVAL[6], TRNVLS, TROLL, TROLL2, TRVS,
+ TRVSIZ = 885, TTEXT[6], URN, V1, V2, VASE, VEND, VERB,
+ VOLCAN, VRBSIZ = 35, VRSION = 25, WATER, WD1, WD1X, WD2, WD2X;
struct game_t game = {.blklin = true};
FILE *logfp;
bool oldstyle = false;
*
* game.closed says whether we're all the way closed
* game.closng says whether it's closing time yet
- * CLSHNT says whether he's read the clue in the endgame
+ * game.clshint says whether he's read the clue in the endgame
* game.lmwarn says whether he's been warned about lamp going dim
- * NOVICE says whether he asked for instructions at start-up
- * PANIC says whether he's found out he's trapped in the cave
+ * game.novice says whether he asked for instructions at start-up
+ * game.panic says whether he's found out he's trapped in the cave
* game.wzdark says whether the loc he's leaving was dark */
#include "funcs.h"
}
MAP2[1] = 0;
- if(!SETUP)initialise();
- if(SETUP > 0) goto L1;
+ if(!game.setup)initialise();
+ if(game.setup > 0) goto L1;
/* Unlike earlier versions, adventure is no longer restartable. (This
* lets us get away with modifying things such as OBJSND(BIRD) without
/* Start-up, dwarf stuff */
-L1: SETUP= -1;
+L1: game.setup= -1;
I=RAN(-1);
- ZZWORD=RNDVOC(3,0)+MESH*2;
- NOVICE=YES(stdin, 65,1,0);
+ game.zzword=RNDVOC(3,0)+MESH*2;
+ game.novice=YES(stdin, 65,1,0);
game.newloc=1;
LOC=1;
game.limit=330;
- if(NOVICE)game.limit=1000;
+ if(game.novice)game.limit=1000;
for (;;) {
do_command(stdin);
L2: if(!OUTSID(game.newloc) || game.newloc == 0 || !game.closng) goto L71;
RSPEAK(130);
game.newloc=LOC;
- if(!PANIC)game.clock2=15;
- PANIC=true;
+ if(!game.panic)game.clock2=15;
+ game.panic=true;
/* See if a dwarf has seen him and has come from where he wants to go. If so,
* the dwarf's blocking his way. If coming from place forbidden to pirate
L71: if(game.newloc == LOC || FORCED(LOC) || CNDBIT(LOC,3)) goto L74;
/* 73 */ for (I=1; I<=5; I++) {
- if(ODLOC[I] != game.newloc || !DSEEN[I]) goto L73;
+ if(ODLOC[I] != game.newloc || !game.dseen[I]) goto L73;
game.newloc=LOC;
RSPEAK(2);
goto L74;
J=1+RAN(J);
ODLOC[I]=DLOC[I];
DLOC[I]=TK[J];
- DSEEN[I]=(DSEEN[I] && INDEEP(LOC)) || (DLOC[I] == LOC || ODLOC[I] == LOC);
- if(!DSEEN[I]) goto L6030;
+ game.dseen[I]=(game.dseen[I] && INDEEP(LOC)) || (DLOC[I] == LOC || ODLOC[I] == LOC);
+ if(!game.dseen[I]) goto L6030;
DLOC[I]=LOC;
if(I != 6) goto L6027;
if(TOTING(J)) goto L6021;
L6020: if(HERE(J))K=1;
} /* end loop */
- if(TALLY == 1 && K == 0 && PLACE[CHEST] == 0 && HERE(LAMP) && PROP[LAMP]
+ if(game.tally == 1 && K == 0 && PLACE[CHEST] == 0 && HERE(LAMP) && PROP[LAMP]
== 1) goto L6025;
if(ODLOC[6] != DLOC[6] && PCT(20))RSPEAK(127);
goto L6030;
} /* end loop */
L6024: DLOC[6]=CHLOC;
ODLOC[6]=CHLOC;
- DSEEN[6]=false;
+ game.dseen[6]=false;
goto L6030;
L6025: RSPEAK(186);
SETPRM(1,STICK,0);
RSPEAK(K+1+2/(1+STICK));
if(STICK == 0) goto L2000;
- OLDLC2=LOC;
+ game.oldlc2=LOC;
goto L99;
if(game.closed) goto L2008;
PROP[OBJ]=0;
if(OBJ == RUG || OBJ == CHAIN)PROP[OBJ]=1;
- TALLY=TALLY-1;
+ game.tally=game.tally-1;
/* Note: There used to be a test here to see whether the player had blown it
* so badly that he could never ever see the remaining treasures, and if so
* the lamp was zapped to 35 turns. But the tests were too simple-minded;
goto L2004;
L2009: K=54;
-L2010: SPK=K;
-L2011: RSPEAK(SPK);
+L2010: game.spk=K;
+L2011: RSPEAK(game.spk);
L2012: VERB=0;
- OLDOBJ=OBJ;
+ game.oldobj=OBJ;
OBJ=0;
/* Check if this loc is eligible for any hints. If been here long enough,
* make neg. If neg, he skipped a word, so make it zero. */
L2607: game.foobar=(game.foobar>0 ? -game.foobar : 0);
- TURNS=TURNS+1;
- if(TURNS != THRESH) goto L2608;
- SPEAK(TTEXT[TRNDEX]);
- TRNLUZ=TRNLUZ+TRNVAL[TRNDEX]/100000;
- TRNDEX=TRNDEX+1;
- THRESH= -1;
- if(TRNDEX <= TRNVLS)THRESH=MOD(TRNVAL[TRNDEX],100000)+1;
+ game.turns=game.turns+1;
+ if(game.turns != game.thresh) goto L2608;
+ SPEAK(TTEXT[game.trndex]);
+ game.trnluz=game.trnluz+TRNVAL[game.trndex]/100000;
+ game.trndex=game.trndex+1;
+ game.thresh= -1;
+ if(game.trndex <= TRNVLS)game.thresh=MOD(TRNVAL[game.trndex],100000)+1;
L2608: if(VERB == SAY && WD2 > 0)VERB=0;
if(VERB == SAY) goto L4090;
- if(TALLY == 0 && INDEEP(LOC) && LOC != 33)game.clock1=game.clock1-1;
+ if(game.tally == 0 && INDEEP(LOC) && LOC != 33)game.clock1=game.clock1-1;
if(game.clock1 == 0) goto L10000;
if(game.clock1 < 0)game.clock2=game.clock2-1;
if(game.clock2 == 0) goto L11000;
/* Figure out the new location
*
- * Given the current location in "LOC", and a motion verb number in "K", put
- * the new location in "game.newloc". The current loc is saved in "OLDLOC" in case
- * he wants to retreat. The current OLDLOC is saved in OLDLC2, in case he
- * dies. (if he does, game.newloc will be limbo, and OLDLOC will be what killed
- * him, so we need OLDLC2, which is the last place he was safe.) */
+ * Given the current location in "LOC", and a motion verb number in
+ * "K", put the new location in "game.newloc". The current loc is
+ * saved in "game.oldloc" in case he wants to retreat. The current
+ * game.oldloc is saved in game.oldlc2, in case he dies. (if he
+ * does, game.newloc will be limbo, and game.oldloc will be what
+ * killed him, so we need game.oldlc2, which is the last place he was
+ * safe.) */
L8: KK=KEY[LOC];
game.newloc=LOC;
if(K == BACK) goto L20;
if(K == LOOK) goto L30;
if(K == CAVE) goto L40;
- OLDLC2=OLDLOC;
- OLDLOC=LOC;
+ game.oldlc2=game.oldloc;
+ game.oldloc=LOC;
L9: LL=IABS(TRAVEL[KK]);
if(MOD(LL,1000) == 1 || MOD(LL,1000) == K) goto L10;
DROP(BEAR,game.newloc);
FIXED[BEAR]= -1;
PROP[BEAR]=3;
- OLDLC2=game.newloc;
+ game.oldlc2=game.newloc;
goto L99;
/* End of specials. */
-/* Handle "go back". Look for verb which goes from LOC to OLDLOC, or to OLDLC2
- * If OLDLOC has forced-motion. K2 saves entry -> forced loc -> previous loc. */
+/* Handle "go back". Look for verb which goes from LOC to
+ * game.oldloc, or to game.oldlc2 If game.oldloc has forced-motion.
+ * K2 saves entry -> forced loc -> previous loc. */
-L20: K=OLDLOC;
- if(FORCED(K))K=OLDLC2;
- OLDLC2=OLDLOC;
- OLDLOC=LOC;
+L20: K=game.oldloc;
+ if(FORCED(K))K=game.oldlc2;
+ game.oldlc2=game.oldloc;
+ game.oldloc=LOC;
K2=0;
if(K == LOC)K2=91;
if(CNDBIT(LOC,4))K2=274;
/* Non-applicable motion. Various messages depending on word given. */
-L50: SPK=12;
- if(K >= 43 && K <= 50)SPK=52;
- if(K == 29 || K == 30)SPK=52;
- if(K == 7 || K == 36 || K == 37)SPK=10;
- if(K == 11 || K == 19)SPK=11;
- if(VERB == FIND || VERB == INVENT)SPK=59;
- if(K == 62 || K == 65)SPK=42;
- if(K == 17)SPK=80;
- RSPEAK(SPK);
+L50: game.spk=12;
+ if(K >= 43 && K <= 50)game.spk=52;
+ if(K == 29 || K == 30)game.spk=52;
+ if(K == 7 || K == 36 || K == 37)game.spk=10;
+ if(K == 11 || K == 19)game.spk=11;
+ if(VERB == FIND || VERB == INVENT)game.spk=59;
+ if(K == 62 || K == 65)game.spk=42;
+ if(K == 17)game.spk=80;
+ RSPEAK(game.spk);
return;
* snide messages available. Each death results in a message (81, 83, etc.)
* which offers reincarnation; if accepted, this results in message 82, 84,
* etc. The last time, if he wants another chance, he gets a snide remark as
- * we exit. When reincarnated, all objects being carried get dropped at OLDLC2
+ * we exit. When reincarnated, all objects being carried get dropped at game.oldlc2
* (presumably the last place prior to being killed) without change of props.
* the loop runs backwards to assure that the bird is dropped before the cage.
* (this kluge could be changed once we're sure all references to bird and cage
* it in the cave). It is turned off and left outside the building (only if he
* was carrying it, of course). He himself is left inside the building (and
* heaven help him if he tries to xyzzy back into the cave without the lamp!).
- * OLDLOC is zapped so he can't just "retreat". */
+ * game.oldloc is zapped so he can't just "retreat". */
/* The easiest way to get killed is to fall into a pit in pitch darkness. */
L90: RSPEAK(23);
- OLDLC2=LOC;
+ game.oldlc2=LOC;
/* Okay, he's dead. Let's get on with it. */
/* 98 */ for (J=1; J<=100; J++) {
I=101-J;
if(!TOTING(I)) goto L98;
- K=OLDLC2;
+ K=game.oldlc2;
if(I == LAMP)K=1;
DROP(I,K);
L98: /*etc*/ ;
} /* end loop */
LOC=3;
- OLDLOC=LOC;
+ game.oldloc=LOC;
goto L2000;
/* He died during closing time. No resurrection. Tally up a death and exit. */
L40100: if(PROP[GRATE] == 0 && !HERE(KEYS)) goto L40010;
goto L40020;
-L40200: if(PLACE[BIRD] == LOC && TOTING(ROD) && OLDOBJ == BIRD) goto L40010;
+L40200: if(PLACE[BIRD] == LOC && TOTING(ROD) && game.oldobj == BIRD) goto L40010;
goto L40030;
L40300: if(HERE(SNAKE) && !HERE(BIRD)) goto L40010;
goto L40020;
-L40400: if(ATLOC[LOC] == 0 && ATLOC[OLDLOC] == 0 && ATLOC[OLDLC2] == 0 && game.holdng >
+L40400: if(ATLOC[LOC] == 0 && ATLOC[game.oldloc] == 0 && ATLOC[game.oldlc2] == 0 && game.holdng >
1) goto L40010;
goto L40020;
L40700: if(game.dflag == 0) goto L40010;
goto L40020;
-L40800: if(ATLOC[LOC] == 0 && ATLOC[OLDLOC] == 0 && ATLOC[OLDLC2] == 0) goto
+L40800: if(ATLOC[LOC] == 0 && ATLOC[game.oldloc] == 0 && ATLOC[game.oldlc2] == 0) goto
L40010;
goto L40030;
if(HERE(OGRE) && I == 0) goto L40010;
goto L40030;
-L41000: if(TALLY == 1 && PROP[JADE] < 0) goto L40010;
+L41000: if(game.tally == 1 && PROP[JADE] < 0) goto L40010;
goto L40020;
/* Cave closing and scoring */
-/* These sections handle the closing of the cave. The cave closes "game.clock1"
+/* These sections handle the closing of the cave. The cave closes "clock1"
* turns after the last treasure has been located (including the pirate's
* chest, which may of course never show up). Note that the treasures need not
- * have been taken yet, just located. Hence game.clock1 must be large enough to get
+ * have been taken yet, just located. Hence clock1 must be large enough to get
* out of the cave (it only ticks while inside the cave). When it hits zero,
* we branch to 10000 to start closing the cave, and then sit back and wait for
- * him to try to get out. If he doesn't within game.clock2 turns, we close the
+ * him to try to get out. If he doesn't within clock2 turns, we close the
* cave; if he does try, we assume he panics, and give him a few additional
- * turns to get frantic before we close. When game.clock2 hits zero, we branch to
+ * turns to get frantic before we close. When clock2 hits zero, we branch to
* 11000 to transport him into the final puzzle. Note that the puzzle depends
* upon all sorts of random things. For instance, there must be no water or
* oil, since there are beanstalks which we don't want to be able to water,
/* When the first warning comes, we lock the grate, destroy the bridge, kill
* all the dwarves (and the pirate), remove the troll and bear (unless dead),
- * and set "game.closng" to true. Leave the dragon; too much trouble to move it.
- * from now until game.clock2 runs out, he cannot unlock the grate, move to any
+ * and set "closng" to true. Leave the dragon; too much trouble to move it.
+ * from now until clock2 runs out, he cannot unlock the grate, move to any
* location outside the cave, or create the bridge. Nor can he be
* resurrected if he dies. Note that the snake is already gone, since he got
* to the treasure accessible only via the hall of the mountain king. Also, he's
L10000: PROP[GRATE]=0;
PROP[FISSUR]=0;
for (I=1; I<=6; I++) {
- DSEEN[I]=false;
+ game.dseen[I]=false;
DLOC[I]=0;
} /* end loop */
MOVE(TROLL,0);
game.closng=true;
goto L19999;
-/* ONCE HE'S PANICKED, AND game.clock2 HAS RUN OUT, WE COME HERE TO SET UP THE
- * STORAGE ROOM. THE ROOM HAS TWO LOCS, HARDWIRED AS 115 (NE) AND 116 (SW).
- * AT THE NE END, WE PLACE EMPTY BOTTLES, A NURSERY OF PLANTS, A BED OF
- * OYSTERS, A PILE OF LAMPS, RODS WITH STARS, SLEEPING DWARVES, AND HIM. AT
- * THE SW END WE PLACE GRATE OVER TREASURES, SNAKE PIT, COVEY OF CAGED BIRDS,
- * MORE RODS, AND PILLOWS. A MIRROR STRETCHES ACROSS ONE WALL. MANY OF THE
- * OBJECTS COME FROM KNOWN LOCATIONS AND/OR STATES (E.G. THE SNAKE IS KNOWN TO
- * HAVE BEEN DESTROYED AND NEEDN'T BE CARRIED AWAY FROM ITS OLD "PLACE"),
- * MAKING THE VARIOUS OBJECTS BE HANDLED DIFFERENTLY. WE ALSO DROP ALL OTHER
- * OBJECTS HE MIGHT BE CARRYING (LEST HE HAVE SOME WHICH COULD CAUSE TROUBLE,
- * SUCH AS THE KEYS). WE DESCRIBE THE FLASH OF LIGHT AND TRUNDLE BACK. */
+/* Once he's panicked, and clock2 has run out, we come here to set up the
+ * storage room. The room has two locs, hardwired as 115 (ne) and 116 (sw).
+ * At the ne end, we place empty bottles, a nursery of plants, a bed of
+ * oysters, a pile of lamps, rods with stars, sleeping dwarves, and him. At
+ * the sw end we place grate over treasures, snake pit, covey of caged birds,
+ * more rods, and pillows. A mirror stretches across one wall. Many of the
+ * objects come from known locations and/or states (e.g. the snake is known to
+ * have been destroyed and needn't be carried away from its old "place"),
+ * making the various objects be handled differently. We also drop all other
+ * objects he might be carrying (lest he have some which could cause trouble,
+ * such as the keys). We describe the flash of light and trundle back. */
L11000: PROP[BOTTLE]=PUT(BOTTLE,115,1);
PROP[PLANT]=PUT(PLANT,115,0);
PROP[ROD]=PUT(ROD,115,0);
PROP[DWARF]=PUT(DWARF,115,0);
LOC=115;
- OLDLOC=115;
+ game.oldloc=115;
game.newloc=115;
/* Leave the grate with normal (non-negative) property. Reuse sign. */
L12200: if(game.lmwarn || !HERE(LAMP)) goto L19999;
game.lmwarn=true;
- SPK=187;
- if(PLACE[BATTER] == 0)SPK=183;
- if(PROP[BATTER] == 1)SPK=189;
- RSPEAK(SPK);
+ game.spk=187;
+ if(PLACE[BATTER] == 0)game.spk=183;
+ if(PROP[BATTER] == 1)game.spk=189;
+ RSPEAK(game.spk);
goto L19999;
L12400: game.limit= -1;
/* Oh dear, he's disturbed the dwarves. */
-L18999: RSPEAK(SPK);
+L18999: RSPEAK(game.spk);
L19000: RSPEAK(136);
score(0);
}
projects / open-adventure.git / blobdiff