123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292 |
- /* $NetBSD: misc.c,v 1.13 2004/11/05 21:30:32 dsl Exp $ */
- /*
- * Copyright (c) 1980, 1993
- * The Regents of the University of California. All rights reserved.
- *
- * 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
- * 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.
- */
- #include <sys/cdefs.h>
- #ifndef lint
- #if 0
- static char sccsid[] = "@(#)misc.c 8.1 (Berkeley) 5/31/93";
- #else
- __RCSID("$NetBSD: misc.c,v 1.13 2004/11/05 21:30:32 dsl Exp $");
- #endif
- #endif /* not lint */
- #include "monop.ext"
- #include <ctype.h>
- #include <signal.h>
- /*
- * This routine executes a truncated set of commands until a
- * "yes or "no" answer is gotten.
- */
- int
- getyn(prompt)
- const char *prompt;
- {
- int com;
- for (;;)
- if ((com=getinp(prompt, yncoms)) < 2)
- return com;
- else
- (*func[com-2])();
- }
- /*
- * This routine tells the player if he's out of money.
- */
- void
- notify()
- {
- 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;
- }
- }
- /*
- * This routine switches to the next player
- */
- void
- next_play()
- {
- player = (player + 1) % num_play;
- cur_p = &play[player];
- num_doub = 0;
- }
- /*
- * This routine gets an integer from the keyboard after the
- * given prompt.
- */
- int
- get_int(prompt)
- const char *prompt;
- {
- int num;
- char *sp;
- int c;
- char buf[257];
- for (;;) {
- inter:
- printf(prompt);
- num = 0;
- for (sp = buf; (c=getchar()) != '\n'; *sp++ = c)
- if (c == -1) /* check for interrupted system call */
- goto inter;
- *sp = c;
- if (sp == buf)
- continue;
- for (sp = buf; isspace((unsigned char)*sp); sp++)
- continue;
- for (; isdigit((unsigned char)*sp); sp++)
- num = num * 10 + *sp - '0';
- if (*sp == '\n')
- return num;
- else
- printf("I can't understand that\n");
- }
- }
- /*
- * This routine sets the monopoly flag from the list given.
- */
- void
- set_ownlist(pl)
- int pl;
- {
- int num; /* general counter */
- MON *orig; /* remember starting monop ptr */
- OWN *op; /* current owned prop */
- OWN *orig_op; /* origianl prop before loop */
- op = play[pl].own_list;
- #ifdef DEBUG
- printf("op [%d] = play[pl [%d] ].own_list;\n", op, pl);
- #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
- for (num = 0; op && op->sqr->type == UTIL;
- op = op->next)
- 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
- for (num = 0; op && op->sqr->type == RR;
- op = op->next) {
- #ifdef DEBUG
- printf("iter: %d\n", num);
- printf("op = %d, op->sqr = %d, "
- "op->sqr->type = %d\n", op, op->sqr,
- op->sqr->type);
- #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("[%d];\n", op);
- #endif
- }
- #ifdef DEBUG
- printf("num = %d\n");
- #endif
- if (orig == 0) {
- printf("panic: bad monopoly descriptor: "
- "orig = %p\n", orig);
- printf("player # %d\n", pl+1);
- printhold(pl);
- printf("orig_op = %p\n", orig_op);
- printf("orig_op->sqr->type = %d (PRPTY)\n",
- op->sqr->type);
- printf("orig_op->next = %p\n", op->next);
- printf("orig_op->sqr->desc = %p\n",
- op->sqr->desc);
- printf("op = %p\n", 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);
- printf("num = %d\n", num);
- }
- #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);
- break;
- }
- }
- }
- /*
- * This routine sets things up as if it is a new monopoly
- */
- void
- is_monop(mp, pl)
- MON *mp;
- int pl;
- {
- int i;
- 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;
- }
- /*
- * This routine sets things up as if it is no longer a monopoly
- */
- void
- is_not_monop(mp)
- MON *mp;
- {
- int i;
- mp->owner = -1;
- for (i = 0; i < mp->num_in; i++)
- mp->sq[i]->desc->monop = FALSE;
- mp->name = mp->not_m;
- }
- /*
- * This routine gives a list of the current player's routine
- */
- void
- list()
- {
- printhold(player);
- }
- /*
- * This routine gives a list of a given players holdings
- */
- void
- list_all()
- {
- int pl;
- while ((pl = getinp("Whose holdings do you want to see? ", name_list))
- < num_play)
- printhold(pl);
- }
- /*
- * This routine gives the players a chance before it exits.
- */
- void
- quit()
- {
- putchar('\n');
- if (getyn("Do you all really want to quit? ") == 0)
- exit(0);
- }
|