]> git.cameronkatri.com Git - bsdgames-darwin.git/blob - adventure/init.c
use HOST_CPPFLAGS not HOST_CFLAGS
[bsdgames-darwin.git] / adventure / init.c
1 /* $NetBSD: init.c,v 1.8 1998/02/03 05:32:13 perry Exp $ */
2
3 /*-
4 * Copyright (c) 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * The game adventure was originally written in Fortran by Will Crowther
8 * and Don Woods. It was later translated to C and enhanced by Jim
9 * Gillogly. This code is derived from software contributed to Berkeley
10 * by Jim Gillogly at The Rand Corporation.
11 *
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
14 * are met:
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. All advertising materials mentioning features or use of this software
21 * must display the following acknowledgement:
22 * This product includes software developed by the University of
23 * California, Berkeley and its contributors.
24 * 4. Neither the name of the University nor the names of its contributors
25 * may be used to endorse or promote products derived from this software
26 * without specific prior written permission.
27 *
28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * SUCH DAMAGE.
39 */
40
41 #include <sys/cdefs.h>
42 #ifndef lint
43 #if 0
44 static char sccsid[] = "@(#)init.c 8.1 (Berkeley) 6/2/93";
45 #else
46 __RCSID("$NetBSD: init.c,v 1.8 1998/02/03 05:32:13 perry Exp $");
47 #endif
48 #endif /* not lint */
49
50 /* Re-coding of advent in C: data initialization */
51
52 #include <sys/types.h>
53 #include <signal.h>
54 #include <stdio.h>
55 #include <stdlib.h>
56 #include <time.h>
57 #include <unistd.h>
58
59 #include "hdr.h"
60 #include "extern.h"
61
62 int blklin = TRUE;
63
64 int setbit[16] = {1, 2, 4, 010, 020, 040, 0100, 0200, 0400, 01000, 02000, 04000,
65 010000, 020000, 040000, 0100000};
66
67
68 void
69 init(command) /* everything for 1st time run */
70 char *command; /* command we were called with */
71 {
72 rdata(); /* read data from orig. file */
73 linkdata();
74 poof();
75 }
76
77 char *
78 decr(a, b, c, d, e)
79 char a, b, c, d, e;
80 {
81 static char buf[6];
82
83 buf[0] = a - '+';
84 buf[1] = b - '-';
85 buf[2] = c - '#';
86 buf[3] = d - '&';
87 buf[4] = e - '%';
88 buf[5] = 0;
89 return buf;
90 }
91
92 void
93 linkdata()
94 { /* secondary data manipulation */
95 int i, j;
96
97 /* array linkages */
98 for (i = 1; i <= LOCSIZ; i++)
99 if (ltext[i].seekadr != 0 && travel[i] != 0)
100 if ((travel[i]->tverb) == 1)
101 cond[i] = 2;
102 for (j = 100; j > 0; j--)
103 if (fixd[j] > 0) {
104 drop(j + 100, fixd[j]);
105 drop(j, plac[j]);
106 }
107 for (j = 100; j > 0; j--) {
108 fixed[j] = fixd[j];
109 if (plac[j] != 0 && fixd[j] <= 0)
110 drop(j, plac[j]);
111 }
112
113 maxtrs = 79;
114 tally = 0;
115 tally2 = 0;
116
117 for (i = 50; i <= maxtrs; i++) {
118 if (ptext[i].seekadr != 0)
119 prop[i] = -1;
120 tally -= prop[i];
121 }
122
123 /* define mnemonics */
124 keys = vocab(DECR('k', 'e', 'y', 's', '\0'), 1, 0);
125 lamp = vocab(DECR('l', 'a', 'm', 'p', '\0'), 1, 0);
126 grate = vocab(DECR('g', 'r', 'a', 't', 'e'), 1, 0);
127 cage = vocab(DECR('c', 'a', 'g', 'e', '\0'), 1, 0);
128 rod = vocab(DECR('r', 'o', 'd', '\0', '\0'), 1, 0);
129 rod2 = rod + 1;
130 steps = vocab(DECR('s', 't', 'e', 'p', 's'), 1, 0);
131 bird = vocab(DECR('b', 'i', 'r', 'd', '\0'), 1, 0);
132 door = vocab(DECR('d', 'o', 'o', 'r', '\0'), 1, 0);
133 pillow = vocab(DECR('p', 'i', 'l', 'l', 'o'), 1, 0);
134 snake = vocab(DECR('s', 'n', 'a', 'k', 'e'), 1, 0);
135 fissur = vocab(DECR('f', 'i', 's', 's', 'u'), 1, 0);
136 tablet = vocab(DECR('t', 'a', 'b', 'l', 'e'), 1, 0);
137 clam = vocab(DECR('c', 'l', 'a', 'm', '\0'), 1, 0);
138 oyster = vocab(DECR('o', 'y', 's', 't', 'e'), 1, 0);
139 magzin = vocab(DECR('m', 'a', 'g', 'a', 'z'), 1, 0);
140 dwarf = vocab(DECR('d', 'w', 'a', 'r', 'f'), 1, 0);
141 knife = vocab(DECR('k', 'n', 'i', 'f', 'e'), 1, 0);
142 food = vocab(DECR('f', 'o', 'o', 'd', '\0'), 1, 0);
143 bottle = vocab(DECR('b', 'o', 't', 't', 'l'), 1, 0);
144 water = vocab(DECR('w', 'a', 't', 'e', 'r'), 1, 0);
145 oil = vocab(DECR('o', 'i', 'l', '\0', '\0'), 1, 0);
146 plant = vocab(DECR('p', 'l', 'a', 'n', 't'), 1, 0);
147 plant2 = plant + 1;
148 axe = vocab(DECR('a', 'x', 'e', '\0', '\0'), 1, 0);
149 mirror = vocab(DECR('m', 'i', 'r', 'r', 'o'), 1, 0);
150 dragon = vocab(DECR('d', 'r', 'a', 'g', 'o'), 1, 0);
151 chasm = vocab(DECR('c', 'h', 'a', 's', 'm'), 1, 0);
152 troll = vocab(DECR('t', 'r', 'o', 'l', 'l'), 1, 0);
153 troll2 = troll + 1;
154 bear = vocab(DECR('b', 'e', 'a', 'r', '\0'), 1, 0);
155 messag = vocab(DECR('m', 'e', 's', 's', 'a'), 1, 0);
156 vend = vocab(DECR('v', 'e', 'n', 'd', 'i'), 1, 0);
157 batter = vocab(DECR('b', 'a', 't', 't', 'e'), 1, 0);
158
159 nugget = vocab(DECR('g', 'o', 'l', 'd', '\0'), 1, 0);
160 coins = vocab(DECR('c', 'o', 'i', 'n', 's'), 1, 0);
161 chest = vocab(DECR('c', 'h', 'e', 's', 't'), 1, 0);
162 eggs = vocab(DECR('e', 'g', 'g', 's', '\0'), 1, 0);
163 tridnt = vocab(DECR('t', 'r', 'i', 'd', 'e'), 1, 0);
164 vase = vocab(DECR('v', 'a', 's', 'e', '\0'), 1, 0);
165 emrald = vocab(DECR('e', 'm', 'e', 'r', 'a'), 1, 0);
166 pyram = vocab(DECR('p', 'y', 'r', 'a', 'm'), 1, 0);
167 pearl = vocab(DECR('p', 'e', 'a', 'r', 'l'), 1, 0);
168 rug = vocab(DECR('r', 'u', 'g', '\0', '\0'), 1, 0);
169 chain = vocab(DECR('c', 'h', 'a', 'i', 'n'), 1, 0);
170
171 back = vocab(DECR('b', 'a', 'c', 'k', '\0'), 0, 0);
172 look = vocab(DECR('l', 'o', 'o', 'k', '\0'), 0, 0);
173 cave = vocab(DECR('c', 'a', 'v', 'e', '\0'), 0, 0);
174 null = vocab(DECR('n', 'u', 'l', 'l', '\0'), 0, 0);
175 entrnc = vocab(DECR('e', 'n', 't', 'r', 'a'), 0, 0);
176 dprssn = vocab(DECR('d', 'e', 'p', 'r', 'e'), 0, 0);
177 enter = vocab(DECR('e', 'n', 't', 'e', 'r'), 0, 0);
178
179 pour = vocab(DECR('p', 'o', 'u', 'r', '\0'), 2, 0);
180 say = vocab(DECR('s', 'a', 'y', '\0', '\0'), 2, 0);
181 lock = vocab(DECR('l', 'o', 'c', 'k', '\0'), 2, 0);
182 throw = vocab(DECR('t', 'h', 'r', 'o', 'w'), 2, 0);
183 find = vocab(DECR('f', 'i', 'n', 'd', '\0'), 2, 0);
184 invent = vocab(DECR('i', 'n', 'v', 'e', 'n'), 2, 0);
185
186 /* initialize dwarves */
187 chloc = 114;
188 chloc2 = 140;
189 for (i = 1; i <= 6; i++)
190 dseen[i] = FALSE;
191 dflag = 0;
192 dloc[1] = 19;
193 dloc[2] = 27;
194 dloc[3] = 33;
195 dloc[4] = 44;
196 dloc[5] = 64;
197 dloc[6] = chloc;
198 daltlc = 18;
199
200 /* random flags & ctrs */
201 turns = 0;
202 lmwarn = FALSE;
203 iwest = 0;
204 knfloc = 0;
205 detail = 0;
206 abbnum = 5;
207 for (i = 0; i <= 4; i++)
208 if (rtext[2 * i + 81].seekadr != 0)
209 maxdie = i + 1;
210 numdie = holdng = dkill = foobar = bonus = 0;
211 clock1 = 30;
212 clock2 = 50;
213 saved = 0;
214 closng = panic = closed = scorng = FALSE;
215 }
216
217
218
219 void
220 trapdel(n) /* come here if he hits a del */
221 int n;
222 {
223 delhit++; /* main checks, treats as QUIT */
224 signal(SIGINT, trapdel);/* catch subsequent DELs */
225 }
226
227
228 void
229 startup()
230 {
231 demo = Start(0);
232 srand((int) (time((time_t *) NULL))); /* random seed */
233 #if 0
234 srand(371); /* non-random seed */
235 #endif
236 hinted[3] = yes(65, 1, 0);
237 newloc = 1;
238 delhit = 0;
239 limit = 330;
240 if (hinted[3])
241 limit = 1000; /* better batteries if instrucs */
242 }