2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * The game adventure was originally written in Fortran by Will Crowther
6 * and Don Woods. It was later translated to C and enhanced by Jim
7 * Gillogly. This code is derived from software contributed to Berkeley
8 * by Jim Gillogly at The Rand Corporation.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * @(#)hdr.h 8.1 (Berkeley) 5/31/93
41 /* ADVENTURE -- Jim Gillogly, Jul 1977
42 * This program is a re-write of ADVENT, written in FORTRAN mostly by
43 * Don Woods of SAIL. In most places it is as nearly identical to the
44 * original as possible given the language and word-size differences.
45 * A few places, such as the message arrays and travel arrays were changed
46 * to reflect the smaller core size and word size. The labels of the
47 * original are reflected in this version, so that the comments of the
48 * fortran are still applicable here.
50 * The data file distributed with the fortran source is assumed to be called
51 * "glorkz" in the directory where the program is first run.
56 /* hdr.h: included by c advent files */
57 #include <sys/types.h>
60 int datfd; /* message file descriptor */
61 volatile sig_atomic_t delhit;
63 extern char data_file[]; /* Virtual data file */
67 #define FLUSHLINE do { int flushline_ch; while ((flushline_ch = getchar()) != EOF && flushline_ch != '\n'); } while (0)
68 #define FLUSHLF while (next()!=LF)
70 int loc,newloc,oldloc,oldlc2,wzdark,gaveup,kq,k,k2;
71 char *wd1,*wd2; /* the complete words */
74 int saved,savet,mxscor,latncy;
76 #define SHORT 50 /* How short is a demo game? */
78 #define MAXSTR 20 /* max length of user's words */
80 #define HTSIZE 512 /* max number of vocab words */
81 struct hashtab /* hash table for vocabulary */
82 { int val; /* word type &index (ktab) */
83 char *atab; /* pointer to actual string */
86 #define SEED 1815622 /* "Encryption" seed */
90 { int seekadr; /* DATFILE must be < 2**16 */
91 #endif /* !OLDSTUFF */
92 { char *seekadr; /* Msg start in virtual disk */
93 int txtlen; /* length of msg starting here */
97 struct text rtext[RTXSIZ]; /* random text messages */
100 struct text mtext[MAGSIZ]; /* magic messages */
104 struct text ctext[CLSMAX]; /* classes of adventurer */
107 struct text ptext[101]; /* object descriptions */
109 #define LOCSIZ 141 /* number of locations */
110 struct text ltext[LOCSIZ]; /* long loc description */
111 struct text stext[LOCSIZ]; /* short loc descriptions */
113 struct travlist /* direcs & conditions of travel*/
114 { struct travlist *next; /* ptr to next list entry */
115 int conditions; /* m in writeup (newloc / 1000) */
116 int tloc; /* n in writeup (newloc % 1000) */
117 int tverb; /* the verb that takes you there*/
118 } *travel[LOCSIZ],*tkk; /* travel is closer to keys(...)*/
122 int plac[101]; /* initial object placement */
123 int fixd[101],fixed[101]; /* location fixed? */
125 int actspk[35]; /* rtext msg for verb <n> */
127 int cond[LOCSIZ]; /* various condition bits */
129 extern int setbit[16]; /* bit defn masks 1,2,4,... */
132 int hints[20][5]; /* info on hints */
133 int hinted[20],hintlc[20];
135 int place[101], prop[101],linkx[201];
138 int maxtrs,tally,tally2; /* treasure values */
143 int keys,lamp,grate,cage,rod,rod2,steps,/* mnemonics */
144 bird,door,pillow,snake,fissur,tablet,clam,oyster,magzin,
145 dwarf,knife,food,bottle,water,oil,plant,plant2,axe,mirror,dragon,
146 chasm,troll,troll2,bear,messag,vend,batter,
147 nugget,coins,chest,eggs,tridnt,vase,emrald,pyram,pearl,rug,chain,
149 back,look,cave,null,entrnc,dprssn,
151 say,lock,throw,find,invent;
153 int chloc,chloc2,dseen[7],dloc[7], /* dwarf stuff */
154 odloc[7],dflag,daltlc;
156 int tk[21],stick,dtotal,attack;
157 int turns,lmwarn,iwest,knfloc,detail, /* various flags & counters */
158 abbnum,maxdie,numdie,holdng,dkill,foobar,bonus,clock1,clock2,
159 closng,panic,closed,scorng;
165 void carry (int, int);
166 void caveclose (void);
167 void checkhints (void);
170 u_long crc (const char *ptr, int nr);
171 void crc_start (void);
173 void datime (int *d, int *t);
174 char *decr (int, int, int, int, int);
175 void die (int entry);
176 void done (int entry);
177 void drop (int object,int where);
180 int forced (int locc);
181 void getin (char **wrd1, char **wrd2);
186 int liqloc (int locc);
188 void move (int, int);
192 void pspeak (int m, int skip);
193 int put (int, int, int);
196 int restore (const char *infile);
198 int save (const char *);
200 void speak (const struct text *);
203 int toting (int objj);
204 void trapdel (int sig);
213 int vocab (const char *,int,int);
214 int yes (int x, int y, int z);
215 int yesm (int x, int y, int z);
217 /* We need to get a little tricky to avoid strings */
218 #define DECR(a,b,c,d,e) decr(a+'+',b+'-',c+'#',d+'&',e+'%')