NetBSD/games/battlestar/com4.c

396 lines
11 KiB
C
Raw Normal View History

1999-09-18 23:38:46 +04:00
/* $NetBSD: com4.c,v 1.8 1999/09/18 19:38:46 jsm Exp $ */
1995-03-21 18:03:38 +03:00
1993-03-21 12:45:37 +03:00
/*
1995-03-21 18:03:38 +03:00
* Copyright (c) 1983, 1993
* The Regents of the University of California. All rights reserved.
1993-03-21 12:45:37 +03:00
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
1997-10-10 15:39:08 +04:00
#include <sys/cdefs.h>
1993-03-21 12:45:37 +03:00
#ifndef lint
1995-03-21 18:03:38 +03:00
#if 0
1997-01-07 14:56:32 +03:00
static char sccsid[] = "@(#)com4.c 8.2 (Berkeley) 4/28/95";
1995-03-21 18:03:38 +03:00
#else
1999-09-18 23:38:46 +04:00
__RCSID("$NetBSD: com4.c,v 1.8 1999/09/18 19:38:46 jsm Exp $");
1995-03-21 18:03:38 +03:00
#endif
1997-10-11 06:06:55 +04:00
#endif /* not lint */
1993-03-21 12:45:37 +03:00
1997-01-07 14:56:32 +03:00
#include "extern.h"
1993-03-21 12:45:37 +03:00
1997-10-10 15:39:08 +04:00
int
1993-03-21 12:45:37 +03:00
take(from)
1997-10-10 15:39:08 +04:00
unsigned int from[];
1993-03-21 12:45:37 +03:00
{
1997-10-11 06:06:55 +04:00
int firstnumber, heavy, bulky, value;
int n;
1993-03-21 12:45:37 +03:00
firstnumber = wordnumber;
1997-10-11 06:06:55 +04:00
if (wordnumber < wordcount && wordvalue[wordnumber + 1] == OFF) {
1993-03-21 12:45:37 +03:00
wordnumber++;
wordvalue[wordnumber] = TAKEOFF;
1997-10-11 06:06:55 +04:00
return (cypher());
} else {
while (wordtype[++wordnumber] == ADJS);
while (wordnumber <= wordcount && wordtype[wordnumber] == OBJECT) {
1993-03-21 12:45:37 +03:00
value = wordvalue[wordnumber];
printf("%s:\n", objsht[value]);
1997-10-11 06:06:55 +04:00
for (n = 0; objsht[value][n]; n++);
1993-03-21 12:45:37 +03:00
heavy = (carrying + objwt[value]) <= WEIGHT;
bulky = (encumber + objcumber[value]) <= CUMBER;
1997-10-11 06:06:55 +04:00
if ((testbit(from, value) || wiz || tempwiz) && heavy && bulky && !testbit(inven, value)) {
setbit(inven, value);
1993-03-21 12:45:37 +03:00
carrying += objwt[value];
encumber += objcumber[value];
1997-10-10 15:39:08 +04:00
ourtime++;
1997-10-11 06:06:55 +04:00
if (testbit(from, value))
1993-03-21 12:45:37 +03:00
printf("Taken.\n");
else
printf("Zap! Taken from thin air.\n");
1997-10-11 06:06:55 +04:00
clearbit(from, value);
1993-03-21 12:45:37 +03:00
if (value == MEDALION)
win--;
1997-10-11 06:06:55 +04:00
} else
if (testbit(inven, value))
printf("You're already holding%s%s.\n", (objsht[value][n - 1] == 's' ? " " : " a "), objsht[value]);
else
if (!heavy)
printf("The %s %s too heavy.\n", objsht[value], (objsht[value][n - 1] == 's' ? "are" : "is"));
else
if (!bulky)
printf("The %s %s too cumbersome to hold.\n", objsht[value], (objsht[value][n - 1] == 's' ? "are" : "is"));
else
printf("I dont see any %s around here.\n", objsht[value]);
if (wordnumber < wordcount - 1 && wordvalue[++wordnumber] == AND)
1993-03-21 12:45:37 +03:00
wordnumber++;
else
1997-10-11 06:06:55 +04:00
return (firstnumber);
1993-03-21 12:45:37 +03:00
}
}
1997-10-11 06:06:55 +04:00
/* special cases with their own return()'s */
1993-03-21 12:45:37 +03:00
if (wordnumber <= wordcount && wordtype[wordnumber] == NOUNS)
1997-10-11 06:06:55 +04:00
switch (wordvalue[wordnumber]) {
case SWORD:
if (testbit(from, SWORD)) {
wordtype[wordnumber--] = OBJECT;
return (take(from));
}
if (testbit(from, TWO_HANDED)) {
wordvalue[wordnumber] = TWO_HANDED;
1993-03-21 12:45:37 +03:00
wordtype[wordnumber--] = OBJECT;
1997-10-11 06:06:55 +04:00
return (take(from));
}
wordvalue[wordnumber] = BROAD;
wordtype[wordnumber--] = OBJECT;
return (take(from));
1993-03-21 12:45:37 +03:00
1997-10-11 06:06:55 +04:00
case BODY:
if (testbit(from, MAID)) {
wordvalue[wordnumber] = MAID;
wordtype[wordnumber--] = OBJECT;
return (take(from));
} else
if (testbit(from, DEADWOOD)) {
1993-03-21 12:45:37 +03:00
wordvalue[wordnumber] = DEADWOOD;
wordtype[wordnumber--] = OBJECT;
1997-10-11 06:06:55 +04:00
return (take(from));
} else
if (testbit(from, DEADNATIVE)) {
wordvalue[wordnumber] = DEADNATIVE;
wordtype[wordnumber--] = OBJECT;
return (take(from));
} else
if (testbit(from, DEADGOD)) {
wordvalue[wordnumber] = DEADGOD;
wordtype[wordnumber--] = OBJECT;
return (take(from));
} else {
wordvalue[wordnumber] = DEADTIME;
wordtype[wordnumber--] = OBJECT;
return (take(from));
}
break;
1993-03-21 12:45:37 +03:00
1997-10-11 06:06:55 +04:00
case AMULET:
if (testbit(location[position].objects, AMULET)) {
puts("The amulet is warm to the touch, and its beauty catches your breath.");
puts("A mist falls over your eyes, but then it is gone. Sounds seem clearer");
puts("and sharper but far away as if in a dream. The sound of purling water reaches");
puts("you from afar. The mist falls again, and your heart leaps in horror. The gold");
puts("freezes your hands and fathomless darkness engulfs your soul.");
}
wordtype[wordnumber--] = OBJECT;
return (take(from));
1993-03-21 12:45:37 +03:00
1997-10-11 06:06:55 +04:00
case MEDALION:
if (testbit(location[position].objects, MEDALION)) {
puts("The medallion is warm, and it rekindles your spirit with the warmth of life.");
puts("Your amulet begins to glow as the medallion is brought near to it, and together\nthey radiate.");
}
wordtype[wordnumber--] = OBJECT;
return (take(from));
case TALISMAN:
if (testbit(location[position].objects, TALISMAN)) {
puts("The talisman is cold to the touch, and it sends a chill down your spine.");
}
wordtype[wordnumber--] = OBJECT;
return (take(from));
case NORMGOD:
if (testbit(location[position].objects, BATHGOD) && (testbit(wear, AMULET) || testbit(inven, AMULET))) {
puts("She offers a delicate hand, and you help her out of the sparkling springs.");
puts("Water droplets like liquid silver bedew her golden skin, but when they part");
puts("from her, they fall as teardrops. She wraps a single cloth around her and");
puts("ties it at the waist. Around her neck hangs a golden amulet.");
puts("She bids you to follow her.");
pleasure++;
followgod = ourtime;
clearbit(location[position].objects, BATHGOD);
} else
if (!testbit(location[position].objects, BATHGOD))
1993-03-21 12:45:37 +03:00
puts("You're in no position to take her.");
1997-10-11 06:06:55 +04:00
else
1993-03-21 12:45:37 +03:00
puts("She moves away from you.");
1997-10-11 06:06:55 +04:00
break;
1993-03-21 12:45:37 +03:00
1997-10-11 06:06:55 +04:00
default:
puts("It doesn't seem to work.");
1993-03-21 12:45:37 +03:00
}
else
puts("You've got to be kidding.");
1997-10-11 06:06:55 +04:00
return (firstnumber);
1993-03-21 12:45:37 +03:00
}
1997-10-10 15:39:08 +04:00
int
1993-03-21 12:45:37 +03:00
throw(name)
const char *name;
1993-03-21 12:45:37 +03:00
{
1999-09-18 23:38:46 +04:00
unsigned int n;
1997-10-11 06:06:55 +04:00
int deposit = 0;
int first, value;
1993-03-21 12:45:37 +03:00
first = wordnumber;
1997-10-11 06:06:55 +04:00
if (drop(name) != -1) {
switch (wordvalue[wordnumber]) {
case AHEAD:
deposit = ahead;
break;
case BACK:
deposit = back;
break;
case LEFT:
deposit = left;
break;
case RIGHT:
deposit = right;
break;
case UP:
deposit = location[position].up * (location[position].access || position == FINAL);
break;
case DOWN:
deposit = location[position].down;
break;
1993-03-21 12:45:37 +03:00
}
wordnumber = first;
while (wordtype[++wordnumber] == ADJS);
1997-10-11 06:06:55 +04:00
while (wordnumber <= wordcount) {
1993-03-21 12:45:37 +03:00
value = wordvalue[wordnumber];
1997-10-11 06:06:55 +04:00
if (deposit && testbit(location[position].objects, value)) {
clearbit(location[position].objects, value);
1993-03-21 12:45:37 +03:00
if (value != GRENADE)
1997-10-11 06:06:55 +04:00
setbit(location[deposit].objects, value);
else {
1993-03-21 12:45:37 +03:00
puts("A thundering explosion nearby sends up a cloud of smoke and shrapnel.");
1997-10-11 06:06:55 +04:00
for (n = 0; n < NUMOFWORDS; n++)
1993-03-21 12:45:37 +03:00
location[deposit].objects[n] = 0;
1997-10-11 06:06:55 +04:00
setbit(location[deposit].objects, CHAR);
1993-03-21 12:45:37 +03:00
}
if (value == ROPE && position == FINAL)
location[position].access = 1;
1997-10-11 06:06:55 +04:00
switch (deposit) {
case 189:
case 231:
puts("The stone door is unhinged.");
location[189].north = 231;
location[231].south = 189;
break;
case 30:
puts("The wooden door is blown open.");
location[30].west = 25;
break;
case 31:
puts("The door is not damaged.");
}
} else
if (value == GRENADE && testbit(location[position].objects, value)) {
puts("You are blown into shreds when your grenade explodes.");
die();
1993-03-21 12:45:37 +03:00
}
if (wordnumber < wordcount - 1 && wordvalue[++wordnumber] == AND)
wordnumber++;
1997-10-11 06:06:55 +04:00
else
return (first);
1993-03-21 12:45:37 +03:00
}
1997-10-11 06:06:55 +04:00
return (first);
1993-03-21 12:45:37 +03:00
}
1997-10-11 06:06:55 +04:00
return (first);
1993-03-21 12:45:37 +03:00
}
1997-10-10 15:39:08 +04:00
int
1993-03-21 12:45:37 +03:00
drop(name)
const char *name;
1993-03-21 12:45:37 +03:00
{
1997-10-11 06:06:55 +04:00
int firstnumber, value;
1993-03-21 12:45:37 +03:00
firstnumber = wordnumber;
1997-10-11 06:06:55 +04:00
while (wordtype[++wordnumber] == ADJS);
while (wordnumber <= wordcount && (wordtype[wordnumber] == OBJECT || wordtype[wordnumber] == NOUNS)) {
1993-03-21 12:45:37 +03:00
value = wordvalue[wordnumber];
printf("%s:\n", objsht[value]);
1997-10-11 06:06:55 +04:00
if (testbit(inven, value)) {
clearbit(inven, value);
1993-03-21 12:45:37 +03:00
carrying -= objwt[value];
encumber -= objcumber[value];
1997-10-11 06:06:55 +04:00
if (value == BOMB) {
1993-03-21 12:45:37 +03:00
puts("The bomb explodes. A blinding white light and immense concussion obliterate us.");
die();
}
if (value != AMULET && value != MEDALION && value != TALISMAN)
1997-10-11 06:06:55 +04:00
setbit(location[position].objects, value);
1993-03-21 12:45:37 +03:00
else
tempwiz = 0;
1997-10-10 15:39:08 +04:00
ourtime++;
1993-03-21 12:45:37 +03:00
if (*name == 'K')
puts("Drop kicked.");
else
printf("%s.\n", name);
1997-10-11 06:06:55 +04:00
} else {
1993-03-21 12:45:37 +03:00
if (*name != 'K') {
printf("You aren't holding the %s.\n", objsht[value]);
1997-10-11 06:06:55 +04:00
if (testbit(location[position].objects, value)) {
1993-03-21 12:45:37 +03:00
if (*name == 'T')
puts("Kicked instead.");
1997-10-11 06:06:55 +04:00
else
if (*name == 'G')
puts("Given anyway.");
1993-03-21 12:45:37 +03:00
}
} else
puts("Kicked.");
}
if (wordnumber < wordcount - 1 && wordvalue[++wordnumber] == AND)
wordnumber++;
else
1997-10-11 06:06:55 +04:00
return (firstnumber);
1993-03-21 12:45:37 +03:00
}
puts("Do what?");
1997-10-11 06:06:55 +04:00
return (-1);
1993-03-21 12:45:37 +03:00
}
1997-10-10 15:39:08 +04:00
int
1993-03-21 12:45:37 +03:00
takeoff()
{
wordnumber = take(wear);
1997-10-11 06:06:55 +04:00
return (drop("Dropped"));
1993-03-21 12:45:37 +03:00
}
1997-10-10 15:39:08 +04:00
int
1993-03-21 12:45:37 +03:00
puton()
{
wordnumber = take(location[position].objects);
1997-10-11 06:06:55 +04:00
return (wearit());
1993-03-21 12:45:37 +03:00
}
1997-10-10 15:39:08 +04:00
int
1993-03-21 12:45:37 +03:00
eat()
{
1997-10-11 06:06:55 +04:00
int firstnumber, value;
1993-03-21 12:45:37 +03:00
firstnumber = wordnumber;
1997-10-11 06:06:55 +04:00
while (wordtype[++wordnumber] == ADJS);
while (wordnumber <= wordcount) {
1993-03-21 12:45:37 +03:00
value = wordvalue[wordnumber];
1997-10-11 06:06:55 +04:00
switch (value) {
case -1:
puts("Eat what?");
return (firstnumber);
default:
printf("You can't eat%s%s!\n",
wordtype[wordnumber] == OBJECT &&
objsht[value]
[strlen(objsht[value]) - 1] == 's' ?
" " : " a ",
words[wordnumber]);
return (firstnumber);
case PAPAYAS:
case PINEAPPLE:
case KIWI:
case COCONUTS: /* eatable things */
case MANGO:
printf("%s:\n", objsht[value]);
if (testbit(inven, value) &&
ourtime > ate - CYCLE &&
testbit(inven, KNIFE)) {
clearbit(inven, value);
carrying -= objwt[value];
encumber -= objcumber[value];
ate = max(ourtime, ate) + CYCLE / 3;
snooze += CYCLE / 10;
ourtime++;
puts("Eaten. You can explore a little longer now.");
} else
if (ourtime < ate - CYCLE)
1993-03-21 12:45:37 +03:00
puts("You're stuffed.");
else
1997-10-11 06:06:55 +04:00
if (!testbit(inven, KNIFE))
puts("You need a knife.");
else
printf("You aren't holding the %s.\n", objsht[value]);
if (wordnumber < wordcount - 1 && wordvalue[++wordnumber] == AND)
wordnumber++;
else
return (firstnumber);
} /* end switch */
} /* end while */
return (firstnumber);
1993-03-21 12:45:37 +03:00
}