]> git.cameronkatri.com Git - bsdgames-darwin.git/blob - battlestar/com2.c
Add braces to make the new egcs happy.
[bsdgames-darwin.git] / battlestar / com2.c
1 /* $NetBSD: com2.c,v 1.7 1998/08/24 00:22:45 hubertf Exp $ */
2
3 /*
4 * Copyright (c) 1983, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 */
35
36 #include <sys/cdefs.h>
37 #ifndef lint
38 #if 0
39 static char sccsid[] = "@(#)com2.c 8.2 (Berkeley) 4/28/95";
40 #else
41 __RCSID("$NetBSD: com2.c,v 1.7 1998/08/24 00:22:45 hubertf Exp $");
42 #endif
43 #endif /* not lint */
44
45 #include "extern.h"
46
47 int
48 wearit()
49 { /* synonyms = {sheathe, sheath} */
50 int n;
51 int firstnumber, value;
52
53 firstnumber = wordnumber;
54 while (wordtype[++wordnumber] == ADJS);
55 while (wordnumber <= wordcount) {
56 value = wordvalue[wordnumber];
57 for (n = 0; objsht[value][n]; n++);
58 switch (value) {
59
60 case -1:
61 puts("Wear what?");
62 return (firstnumber);
63
64 default:
65 printf("You can't wear%s%s!\n", (objsht[value][n - 1] == 's' ? " " : " a "), objsht[value]);
66 return (firstnumber);
67
68 case KNIFE:
69 /* case SHIRT: */
70 case ROBE:
71 case LEVIS: /* wearable things */
72 case SWORD:
73 case MAIL:
74 case HELM:
75 case SHOES:
76 case PAJAMAS:
77 case COMPASS:
78 case LASER:
79 case AMULET:
80 case TALISMAN:
81 case MEDALION:
82 case ROPE:
83 case RING:
84 case BRACELET:
85 case GRENADE:
86
87 if (testbit(inven, value)) {
88 clearbit(inven, value);
89 setbit(wear, value);
90 carrying -= objwt[value];
91 encumber -= objcumber[value];
92 ourtime++;
93 printf("You are now wearing %s %s.\n",
94 (objsht[value][n - 1] == 's' ? "the"
95 : "a"), objsht[value]);
96 } else
97 if (testbit(wear, value))
98 printf("You are already wearing the %s.\n",
99 objsht[value]);
100 else
101 printf("You aren't holding the %s.\n",
102 objsht[value]);
103 if (wordnumber < wordcount - 1 &&
104 wordvalue[++wordnumber] == AND)
105 wordnumber++;
106 else
107 return (firstnumber);
108 } /* end switch */
109 } /* end while */
110 puts("Don't be ridiculous.");
111 return (firstnumber);
112 }
113
114 int
115 put()
116 { /* synonyms = {buckle, strap, tie} */
117 if (wordvalue[wordnumber + 1] == ON) {
118 wordvalue[++wordnumber] = PUTON;
119 return (cypher());
120 }
121 if (wordvalue[wordnumber + 1] == DOWN) {
122 wordvalue[++wordnumber] = DROP;
123 return (cypher());
124 }
125 puts("I don't understand what you want to put.");
126 return (-1);
127
128 }
129
130 int
131 draw()
132 { /* synonyms = {pull, carry} */
133 return (take(wear));
134 }
135
136 int
137 use()
138 {
139 while (wordtype[++wordnumber] == ADJS && wordnumber < wordcount);
140 if (wordvalue[wordnumber] == AMULET && testbit(inven, AMULET) &&
141 position != FINAL) {
142 puts("The amulet begins to glow.");
143 if (testbit(inven, MEDALION)) {
144 puts("The medallion comes to life too.");
145 if (position == 114) {
146 location[position].down = 160;
147 whichway(location[position]);
148 puts("The waves subside and it is possible to descend to the sea cave now.");
149 ourtime++;
150 return (-1);
151 }
152 }
153 puts("A light mist falls over your eyes and the sound of purling water trickles in");
154 puts("your ears. When the mist lifts you are standing beside a cool stream.");
155 if (position == 229)
156 position = 224;
157 else
158 position = 229;
159 ourtime++;
160 notes[CANTSEE] = 0;
161 return (0);
162 } else
163 if (position == FINAL)
164 puts("The amulet won't work in here.");
165 else
166 if (wordvalue[wordnumber] == COMPASS && testbit(inven, COMPASS))
167 printf("Your compass points %s.\n", truedirec(NORTH, '-'));
168 else
169 if (wordvalue[wordnumber] == COMPASS)
170 puts("You aren't holding the compass.");
171 else
172 if (wordvalue[wordnumber] == AMULET)
173 puts("You aren't holding the amulet.");
174 else
175 puts("There is no apparent use.");
176 return (-1);
177 }
178
179 void
180 murder()
181 {
182 int n;
183
184 for (n = 0; !((n == SWORD || n == KNIFE || n == TWO_HANDED || n == MACE || n == CLEAVER || n == BROAD || n == CHAIN || n == SHOVEL || n == HALBERD) && testbit(inven, n)) && n < NUMOFOBJECTS; n++);
185 if (n == NUMOFOBJECTS)
186 puts("You don't have suitable weapons to kill.");
187 else {
188 printf("Your %s should do the trick.\n", objsht[n]);
189 while (wordtype[++wordnumber] == ADJS);
190 switch (wordvalue[wordnumber]) {
191
192 case NORMGOD:
193 if (testbit(location[position].objects, BATHGOD)) {
194 puts("The goddess's head slices off. Her corpse floats in the water.");
195 clearbit(location[position].objects, BATHGOD);
196 setbit(location[position].objects, DEADGOD);
197 power += 5;
198 notes[JINXED]++;
199 } else
200 if (testbit(location[position].objects, NORMGOD)) {
201 puts("The goddess pleads but you strike her mercilessly. Her broken body lies in a\npool of blood.");
202 clearbit(location[position].objects, NORMGOD);
203 setbit(location[position].objects, DEADGOD);
204 power += 5;
205 notes[JINXED]++;
206 if (wintime)
207 live();
208 } else
209 puts("I dont see her anywhere.");
210 break;
211 case TIMER:
212 if (testbit(location[position].objects, TIMER)) {
213 puts("The old man offers no resistance.");
214 clearbit(location[position].objects, TIMER);
215 setbit(location[position].objects, DEADTIME);
216 power++;
217 notes[JINXED]++;
218 } else
219 puts("Who?");
220 break;
221 case NATIVE:
222 if (testbit(location[position].objects, NATIVE)) {
223 puts("The girl screams as you cut her body to shreds. She is dead.");
224 clearbit(location[position].objects, NATIVE);
225 setbit(location[position].objects, DEADNATIVE);
226 power += 5;
227 notes[JINXED]++;
228 } else
229 puts("What girl?");
230 break;
231 case MAN:
232 if (testbit(location[position].objects, MAN)) {
233 puts("You strike him to the ground, and he coughs up blood.");
234 puts("Your fantasy is over.");
235 die();
236 }
237 case -1:
238 puts("Kill what?");
239 break;
240
241 default:
242 if (wordtype[wordnumber] != NOUNS)
243 puts("Kill what?");
244 else
245 printf("You can't kill the %s!\n",
246 objsht[wordvalue[wordnumber]]);
247 }
248 }
249 }
250
251 void
252 ravage()
253 {
254 while (wordtype[++wordnumber] != NOUNS && wordnumber <= wordcount);
255 if (wordtype[wordnumber] == NOUNS && testbit(location[position].objects, wordvalue[wordnumber])) {
256 ourtime++;
257 switch (wordvalue[wordnumber]) {
258 case NORMGOD:
259 puts("You attack the goddess, and she screams as you beat her. She falls down");
260 puts("crying and tries to hold her torn and bloodied dress around her.");
261 power += 5;
262 pleasure += 8;
263 ego -= 10;
264 wordnumber--;
265 godready = -30000;
266 murder();
267 win = -30000;
268 break;
269 case NATIVE:
270 puts("The girl tries to run, but you catch her and throw her down. Her face is");
271 puts("bleeding, and she screams as you tear off her clothes.");
272 power += 3;
273 pleasure += 5;
274 ego -= 10;
275 wordnumber--;
276 murder();
277 if (rnd(100) < 50) {
278 puts("Her screams have attracted attention. I think we are surrounded.");
279 setbit(location[ahead].objects, WOODSMAN);
280 setbit(location[ahead].objects, DEADWOOD);
281 setbit(location[ahead].objects, MALLET);
282 setbit(location[back].objects, WOODSMAN);
283 setbit(location[back].objects, DEADWOOD);
284 setbit(location[back].objects, MALLET);
285 setbit(location[left].objects, WOODSMAN);
286 setbit(location[left].objects, DEADWOOD);
287 setbit(location[left].objects, MALLET);
288 setbit(location[right].objects, WOODSMAN);
289 setbit(location[right].objects, DEADWOOD);
290 setbit(location[right].objects, MALLET);
291 }
292 break;
293 default:
294 puts("You are perverted.");
295 }
296 } else
297 puts("Who?");
298 }
299
300 int
301 follow()
302 {
303 if (followfight == ourtime) {
304 puts("The Dark Lord leaps away and runs down secret tunnels and corridoors.");
305 puts("You chase him through the darkness and splash in pools of water.");
306 puts("You have cornered him. His laser sword extends as he steps forward.");
307 position = FINAL;
308 fight(DARK, 75);
309 setbit(location[position].objects, TALISMAN);
310 setbit(location[position].objects, AMULET);
311 return (0);
312 } else
313 if (followgod == ourtime) {
314 puts("The goddess leads you down a steamy tunnel and into a high, wide chamber.");
315 puts("She sits down on a throne.");
316 position = 268;
317 setbit(location[position].objects, NORMGOD);
318 notes[CANTSEE] = 1;
319 return (0);
320 } else
321 puts("There is no one to follow.");
322 return (-1);
323 }