NetBSD/games/monop/misc.c

298 lines
6.4 KiB
C
Raw Normal View History

2008-02-24 06:52:09 +03:00
/* $NetBSD: misc.c,v 1.20 2008/02/24 03:52:09 christos Exp $ */
1993-03-21 12:45:37 +03:00
/*
* Copyright (c) 1980, 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. Neither the name of the University nor the names of its contributors
1993-03-21 12:45:37 +03:00
* 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-12 21:45:06 +04:00
#include <sys/cdefs.h>
1993-03-21 12:45:37 +03:00
#ifndef lint
#if 0
static char sccsid[] = "@(#)misc.c 8.1 (Berkeley) 5/31/93";
#else
2008-02-24 06:52:09 +03:00
__RCSID("$NetBSD: misc.c,v 1.20 2008/02/24 03:52:09 christos Exp $");
#endif
1993-03-21 12:45:37 +03:00
#endif /* not lint */
1999-08-21 14:40:03 +04:00
#include <ctype.h>
#include <limits.h>
1999-08-21 14:40:03 +04:00
#include <signal.h>
2008-02-24 06:52:09 +03:00
#include <errno.h>
1993-03-21 12:45:37 +03:00
#include "monop.h"
1993-03-21 12:45:37 +03:00
/*
* This routine executes a truncated set of commands until a
* "yes or "no" answer is gotten.
*/
1997-10-12 21:45:06 +04:00
int
1993-03-21 12:45:37 +03:00
getyn(prompt)
const char *prompt;
1997-10-12 21:45:06 +04:00
{
1999-08-21 14:40:03 +04:00
int com;
1993-03-21 12:45:37 +03:00
for (;;)
if ((com=getinp(prompt, yncoms)) < 2)
1993-03-21 12:45:37 +03:00
return com;
else
(*func[com-2])();
}
1999-08-21 14:40:03 +04:00
1993-03-21 12:45:37 +03:00
/*
* This routine tells the player if he's out of money.
*/
1997-10-12 21:45:06 +04:00
void
notify()
{
1993-03-21 12:45:37 +03:00
if (cur_p->money < 0)
printf("That leaves you $%d in debt\n", -cur_p->money);
else if (cur_p->money == 0)
printf("that leaves you broke\n");
else if (fixing && !told_em && cur_p->money > 0) {
printf("-- You are now Solvent ---\n");
told_em = TRUE;
}
}
1999-08-21 14:40:03 +04:00
1993-03-21 12:45:37 +03:00
/*
* This routine switches to the next player
*/
1997-10-12 21:45:06 +04:00
void
next_play()
{
player = (player + 1) % num_play;
1993-03-21 12:45:37 +03:00
cur_p = &play[player];
num_doub = 0;
}
1999-08-21 14:40:03 +04:00
1993-03-21 12:45:37 +03:00
/*
* This routine gets an integer from the keyboard after the
* given prompt.
*/
1997-10-12 21:45:06 +04:00
int
1993-03-21 12:45:37 +03:00
get_int(prompt)
const char *prompt;
1997-10-12 21:45:06 +04:00
{
long num;
1999-08-21 14:40:03 +04:00
char *sp;
char buf[257];
1993-03-21 12:45:37 +03:00
for (;;) {
printf("%s", prompt);
fgets(buf, sizeof(buf), stdin);
if (feof(stdin))
return 0;
sp = strchr(buf, '\n');
if (sp)
*sp = '\0';
errno = 0;
num = strtol(buf, &sp, 10);
if (errno || strlen(sp) > 0 || num < 0 || num >= INT_MAX) {
1993-03-21 12:45:37 +03:00
printf("I can't understand that\n");
continue;
}
return num;
1993-03-21 12:45:37 +03:00
}
}
1999-08-21 14:40:03 +04:00
1993-03-21 12:45:37 +03:00
/*
* This routine sets the monopoly flag from the list given.
*/
1997-10-12 21:45:06 +04:00
void
1993-03-21 12:45:37 +03:00
set_ownlist(pl)
1999-08-21 14:40:03 +04:00
int pl;
1997-10-12 21:45:06 +04:00
{
1999-08-21 14:40:03 +04:00
int num; /* general counter */
MON *orig; /* remember starting monop ptr */
OWN *op; /* current owned prop */
2008-02-19 11:26:10 +03:00
OWN *orig_op; /* original prop before loop */
1993-03-21 12:45:37 +03:00
op = play[pl].own_list;
#ifdef DEBUG
printf("op [%p] = play[pl [%d] ].own_list;\n", op, pl);
1993-03-21 12:45:37 +03:00
#endif
while (op) {
#ifdef DEBUG
printf("op->sqr->type = %d\n", op->sqr->type);
#endif
switch (op->sqr->type) {
case UTIL:
#ifdef DEBUG
printf(" case UTIL:\n");
#endif
1999-08-21 14:40:03 +04:00
for (num = 0; op && op->sqr->type == UTIL;
op = op->next)
1993-03-21 12:45:37 +03:00
num++;
play[pl].num_util = num;
#ifdef DEBUG
printf("play[pl].num_util = num [%d];\n", num);
#endif
break;
case RR:
#ifdef DEBUG
printf(" case RR:\n");
#endif
1999-08-21 14:40:03 +04:00
for (num = 0; op && op->sqr->type == RR;
op = op->next) {
1993-03-21 12:45:37 +03:00
#ifdef DEBUG
printf("iter: %d\n", num);
printf("op = %p, op->sqr = %p, "
1999-08-21 14:40:03 +04:00
"op->sqr->type = %d\n", op, op->sqr,
op->sqr->type);
1993-03-21 12:45:37 +03:00
#endif
num++;
}
play[pl].num_rr = num;
#ifdef DEBUG
printf("play[pl].num_rr = num [%d];\n", num);
#endif
break;
case PRPTY:
#ifdef DEBUG
printf(" case PRPTY:\n");
#endif
orig = op->sqr->desc->mon_desc;
orig_op = op;
num = 0;
while (op && op->sqr->desc->mon_desc == orig) {
#ifdef DEBUG
printf("iter: %d\n", num);
#endif
num++;
#ifdef DEBUG
printf("op = op->next ");
#endif
op = op->next;
#ifdef DEBUG
printf("[%p];\n", op);
1993-03-21 12:45:37 +03:00
#endif
}
#ifdef DEBUG
printf("num = %d\n", num);
1993-03-21 12:45:37 +03:00
#endif
if (orig == NULL) {
1999-08-21 14:40:03 +04:00
printf("panic: bad monopoly descriptor: "
"orig = %p\n", orig);
1993-03-21 12:45:37 +03:00
printf("player # %d\n", pl+1);
printhold(pl);
1997-10-12 21:45:06 +04:00
printf("orig_op = %p\n", orig_op);
if (orig_op) {
printf("orig_op->sqr->type = %d (PRPTY)\n",
orig_op->sqr->type);
printf("orig_op->next = %p\n",
orig_op->next);
printf("orig_op->sqr->desc = %p\n",
orig_op->sqr->desc);
}
1997-10-12 21:45:06 +04:00
printf("op = %p\n", op);
if (op) {
printf("op->sqr->type = %d (PRPTY)\n",
op->sqr->type);
printf("op->next = %p\n", op->next);
printf("op->sqr->desc = %p\n",
op->sqr->desc);
}
1993-03-21 12:45:37 +03:00
printf("num = %d\n", num);
exit(1);
1993-03-21 12:45:37 +03:00
}
#ifdef DEBUG
printf("orig->num_in = %d\n", orig->num_in);
#endif
if (num == orig->num_in)
is_monop(orig, pl);
else
is_not_monop(orig);
1993-03-21 12:45:37 +03:00
break;
}
}
}
1999-08-21 14:40:03 +04:00
1993-03-21 12:45:37 +03:00
/*
* This routine sets things up as if it is a new monopoly
*/
1997-10-12 21:45:06 +04:00
void
1993-03-21 12:45:37 +03:00
is_monop(mp, pl)
1999-08-21 14:40:03 +04:00
MON *mp;
int pl;
1997-10-12 21:45:06 +04:00
{
1999-08-21 14:40:03 +04:00
int i;
1993-03-21 12:45:37 +03:00
mp->owner = pl;
mp->num_own = mp->num_in;
for (i = 0; i < mp->num_in; i++)
mp->sq[i]->desc->monop = TRUE;
mp->name = mp->mon_n;
}
1999-08-21 14:40:03 +04:00
1993-03-21 12:45:37 +03:00
/*
* This routine sets things up as if it is no longer a monopoly
*/
1997-10-12 21:45:06 +04:00
void
is_not_monop(mp)
1999-08-21 14:40:03 +04:00
MON *mp;
1997-10-12 21:45:06 +04:00
{
1999-08-21 14:40:03 +04:00
int i;
1993-03-21 12:45:37 +03:00
mp->owner = -1;
for (i = 0; i < mp->num_in; i++)
mp->sq[i]->desc->monop = FALSE;
mp->name = mp->not_m;
}
1999-08-21 14:40:03 +04:00
1993-03-21 12:45:37 +03:00
/*
* This routine gives a list of the current player's routine
*/
1997-10-12 21:45:06 +04:00
void
1999-08-21 14:40:03 +04:00
list()
1997-10-12 21:45:06 +04:00
{
1993-03-21 12:45:37 +03:00
printhold(player);
}
1999-08-21 14:40:03 +04:00
1993-03-21 12:45:37 +03:00
/*
* This routine gives a list of a given players holdings
*/
1997-10-12 21:45:06 +04:00
void
1999-08-21 14:40:03 +04:00
list_all()
1997-10-12 21:45:06 +04:00
{
1999-08-21 14:40:03 +04:00
int pl;
1993-03-21 12:45:37 +03:00
1999-08-21 14:40:03 +04:00
while ((pl = getinp("Whose holdings do you want to see? ", name_list))
< num_play)
1993-03-21 12:45:37 +03:00
printhold(pl);
}
1999-08-21 14:40:03 +04:00
1993-03-21 12:45:37 +03:00
/*
* This routine gives the players a chance before it exits.
*/
void
1997-10-12 21:45:06 +04:00
quit()
{
1993-03-21 12:45:37 +03:00
putchar('\n');
1997-10-12 21:45:06 +04:00
if (getyn("Do you all really want to quit? ") == 0)
1993-03-21 12:45:37 +03:00
exit(0);
}