Home | History | Annotate | Line # | Download | only in monop
misc.c revision 1.18
      1  1.18  dholland /*	$NetBSD: misc.c,v 1.18 2008/02/23 21:35:13 dholland Exp $	*/
      2   1.4       cgd 
      3   1.1       cgd /*
      4   1.4       cgd  * Copyright (c) 1980, 1993
      5   1.4       cgd  *	The Regents of the University of California.  All rights reserved.
      6   1.1       cgd  *
      7   1.1       cgd  * Redistribution and use in source and binary forms, with or without
      8   1.1       cgd  * modification, are permitted provided that the following conditions
      9   1.1       cgd  * are met:
     10   1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     11   1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     12   1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13   1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     14   1.1       cgd  *    documentation and/or other materials provided with the distribution.
     15  1.11       agc  * 3. Neither the name of the University nor the names of its contributors
     16   1.1       cgd  *    may be used to endorse or promote products derived from this software
     17   1.1       cgd  *    without specific prior written permission.
     18   1.1       cgd  *
     19   1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20   1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21   1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22   1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23   1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24   1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25   1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26   1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27   1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28   1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29   1.1       cgd  * SUCH DAMAGE.
     30   1.1       cgd  */
     31   1.1       cgd 
     32   1.6  christos #include <sys/cdefs.h>
     33   1.1       cgd #ifndef lint
     34   1.4       cgd #if 0
     35   1.4       cgd static char sccsid[] = "@(#)misc.c	8.1 (Berkeley) 5/31/93";
     36   1.4       cgd #else
     37  1.18  dholland __RCSID("$NetBSD: misc.c,v 1.18 2008/02/23 21:35:13 dholland Exp $");
     38   1.4       cgd #endif
     39   1.1       cgd #endif /* not lint */
     40   1.1       cgd 
     41   1.7    simonb #include "monop.ext"
     42   1.7    simonb #include <ctype.h>
     43  1.18  dholland #include <limits.h>
     44   1.7    simonb #include <signal.h>
     45   1.1       cgd 
     46   1.1       cgd /*
     47   1.1       cgd  *	This routine executes a truncated set of commands until a
     48   1.1       cgd  * "yes or "no" answer is gotten.
     49   1.1       cgd  */
     50   1.6  christos int
     51   1.1       cgd getyn(prompt)
     52   1.8       jsm 	const char *prompt;
     53   1.6  christos {
     54   1.7    simonb 	int com;
     55   1.1       cgd 
     56   1.1       cgd 	for (;;)
     57  1.12       jsm 		if ((com=getinp(prompt, yncoms)) < 2)
     58   1.1       cgd 			return com;
     59   1.1       cgd 		else
     60   1.1       cgd 			(*func[com-2])();
     61   1.1       cgd }
     62   1.7    simonb 
     63   1.1       cgd /*
     64   1.1       cgd  *	This routine tells the player if he's out of money.
     65   1.1       cgd  */
     66   1.6  christos void
     67   1.6  christos notify()
     68   1.6  christos {
     69   1.1       cgd 	if (cur_p->money < 0)
     70   1.1       cgd 		printf("That leaves you $%d in debt\n", -cur_p->money);
     71   1.1       cgd 	else if (cur_p->money == 0)
     72   1.1       cgd 		printf("that leaves you broke\n");
     73   1.1       cgd 	else if (fixing && !told_em && cur_p->money > 0) {
     74   1.1       cgd 		printf("-- You are now Solvent ---\n");
     75   1.1       cgd 		told_em = TRUE;
     76   1.1       cgd 	}
     77   1.1       cgd }
     78   1.7    simonb 
     79   1.1       cgd /*
     80   1.1       cgd  *	This routine switches to the next player
     81   1.1       cgd  */
     82   1.6  christos void
     83   1.6  christos next_play()
     84   1.6  christos {
     85  1.10       cgd 	player = (player + 1) % num_play;
     86   1.1       cgd 	cur_p = &play[player];
     87   1.1       cgd 	num_doub = 0;
     88   1.1       cgd }
     89   1.7    simonb 
     90   1.1       cgd /*
     91   1.1       cgd  *	This routine gets an integer from the keyboard after the
     92   1.1       cgd  * given prompt.
     93   1.1       cgd  */
     94   1.6  christos int
     95   1.1       cgd get_int(prompt)
     96   1.8       jsm 	const char *prompt;
     97   1.6  christos {
     98  1.18  dholland 	long num;
     99   1.7    simonb 	char *sp;
    100   1.7    simonb 	char buf[257];
    101   1.1       cgd 
    102   1.1       cgd 	for (;;) {
    103  1.17  dholland 		printf("%s", prompt);
    104  1.18  dholland 		fgets(buf, sizeof(buf), stdin);
    105  1.18  dholland 		if (feof(stdin))
    106  1.18  dholland 			return 0;
    107  1.18  dholland 		sp = strchr(buf, '\n');
    108  1.18  dholland 		if (sp)
    109  1.18  dholland 			*sp = '\0';
    110  1.18  dholland 		errno = 0;
    111  1.18  dholland 		num = strtol(buf, &sp, 10);
    112  1.18  dholland 		if (errno || strlen(sp) > 0 || num < 0 || num >= INT_MAX) {
    113  1.18  dholland 			printf("I can't understand that\n");
    114   1.1       cgd 			continue;
    115  1.18  dholland 		}
    116  1.18  dholland 		return num;
    117   1.1       cgd 	}
    118   1.1       cgd }
    119   1.7    simonb 
    120   1.1       cgd /*
    121   1.1       cgd  *	This routine sets the monopoly flag from the list given.
    122   1.1       cgd  */
    123   1.6  christos void
    124   1.1       cgd set_ownlist(pl)
    125   1.7    simonb 	int pl;
    126   1.6  christos {
    127   1.7    simonb 	int num;		/* general counter		*/
    128   1.7    simonb 	MON *orig;		/* remember starting monop ptr	*/
    129   1.7    simonb 	OWN *op;		/* current owned prop		*/
    130  1.15  dholland 	OWN *orig_op;		/* original prop before loop	*/
    131   1.1       cgd 
    132   1.1       cgd 	op = play[pl].own_list;
    133   1.1       cgd #ifdef DEBUG
    134  1.16  dholland 	printf("op [%p] = play[pl [%d] ].own_list;\n", op, pl);
    135   1.1       cgd #endif
    136   1.1       cgd 	while (op) {
    137   1.1       cgd #ifdef DEBUG
    138   1.1       cgd 		printf("op->sqr->type = %d\n", op->sqr->type);
    139   1.1       cgd #endif
    140   1.1       cgd 		switch (op->sqr->type) {
    141   1.1       cgd 		  case UTIL:
    142   1.1       cgd #ifdef DEBUG
    143   1.1       cgd 			printf("  case UTIL:\n");
    144   1.1       cgd #endif
    145   1.7    simonb 			for (num = 0; op && op->sqr->type == UTIL;
    146   1.7    simonb 			    op = op->next)
    147   1.1       cgd 				num++;
    148   1.1       cgd 			play[pl].num_util = num;
    149   1.1       cgd #ifdef DEBUG
    150   1.1       cgd 			printf("play[pl].num_util = num [%d];\n", num);
    151   1.1       cgd #endif
    152   1.1       cgd 			break;
    153   1.1       cgd 		  case RR:
    154   1.1       cgd #ifdef DEBUG
    155   1.1       cgd 			printf("  case RR:\n");
    156   1.1       cgd #endif
    157   1.7    simonb 			for (num = 0; op && op->sqr->type == RR;
    158   1.7    simonb 			    op = op->next) {
    159   1.1       cgd #ifdef DEBUG
    160   1.1       cgd 				printf("iter: %d\n", num);
    161  1.16  dholland 				printf("op = %p, op->sqr = %p, "
    162   1.7    simonb 				    "op->sqr->type = %d\n", op, op->sqr,
    163   1.7    simonb 				    op->sqr->type);
    164   1.1       cgd #endif
    165   1.1       cgd 				num++;
    166   1.1       cgd 			}
    167   1.1       cgd 			play[pl].num_rr = num;
    168   1.1       cgd #ifdef DEBUG
    169   1.1       cgd 			printf("play[pl].num_rr = num [%d];\n", num);
    170   1.1       cgd #endif
    171   1.1       cgd 			break;
    172   1.1       cgd 		  case PRPTY:
    173   1.1       cgd #ifdef DEBUG
    174   1.1       cgd 			printf("  case PRPTY:\n");
    175   1.1       cgd #endif
    176   1.1       cgd 			orig = op->sqr->desc->mon_desc;
    177   1.1       cgd 			orig_op = op;
    178   1.1       cgd 			num = 0;
    179   1.1       cgd 			while (op && op->sqr->desc->mon_desc == orig) {
    180   1.1       cgd #ifdef DEBUG
    181   1.1       cgd 				printf("iter: %d\n", num);
    182   1.1       cgd #endif
    183   1.1       cgd 				num++;
    184   1.1       cgd #ifdef DEBUG
    185   1.1       cgd 				printf("op = op->next ");
    186   1.1       cgd #endif
    187   1.1       cgd 				op = op->next;
    188   1.1       cgd #ifdef DEBUG
    189  1.16  dholland 				printf("[%p];\n", op);
    190   1.1       cgd #endif
    191   1.1       cgd 			}
    192   1.1       cgd #ifdef DEBUG
    193  1.16  dholland 			printf("num = %d\n", num);
    194   1.1       cgd #endif
    195  1.16  dholland 			if (orig == NULL) {
    196   1.7    simonb 				printf("panic:  bad monopoly descriptor: "
    197   1.7    simonb 				    "orig = %p\n", orig);
    198   1.1       cgd 				printf("player # %d\n", pl+1);
    199   1.1       cgd 				printhold(pl);
    200   1.6  christos 				printf("orig_op = %p\n", orig_op);
    201  1.14  christos 				if (orig_op) {
    202  1.14  christos 					printf("orig_op->sqr->type = %d (PRPTY)\n",
    203  1.14  christos 					    orig_op->sqr->type);
    204  1.16  dholland 					printf("orig_op->next = %p\n",
    205  1.16  dholland 					    orig_op->next);
    206  1.14  christos 					printf("orig_op->sqr->desc = %p\n",
    207  1.14  christos 					    orig_op->sqr->desc);
    208  1.14  christos 				}
    209   1.6  christos 				printf("op = %p\n", op);
    210  1.14  christos 				if (op) {
    211  1.14  christos 					printf("op->sqr->type = %d (PRPTY)\n",
    212  1.14  christos 					    op->sqr->type);
    213  1.14  christos 					printf("op->next = %p\n", op->next);
    214  1.14  christos 					printf("op->sqr->desc = %p\n",
    215  1.14  christos 					    op->sqr->desc);
    216  1.14  christos 				}
    217   1.1       cgd 				printf("num = %d\n", num);
    218  1.18  dholland 				exit(1);
    219   1.1       cgd 			}
    220   1.1       cgd #ifdef DEBUG
    221   1.1       cgd 			printf("orig->num_in = %d\n", orig->num_in);
    222   1.1       cgd #endif
    223   1.1       cgd 			if (num == orig->num_in)
    224   1.1       cgd 				is_monop(orig, pl);
    225   1.1       cgd 			else
    226   1.9       jsm 				is_not_monop(orig);
    227   1.1       cgd 			break;
    228   1.1       cgd 		}
    229   1.1       cgd 	}
    230   1.1       cgd }
    231   1.7    simonb 
    232   1.1       cgd /*
    233   1.1       cgd  *	This routine sets things up as if it is a new monopoly
    234   1.1       cgd  */
    235   1.6  christos void
    236   1.1       cgd is_monop(mp, pl)
    237   1.7    simonb 	MON *mp;
    238   1.7    simonb 	int pl;
    239   1.6  christos {
    240   1.7    simonb 	int i;
    241   1.1       cgd 
    242   1.1       cgd 	mp->owner = pl;
    243   1.1       cgd 	mp->num_own = mp->num_in;
    244   1.1       cgd 	for (i = 0; i < mp->num_in; i++)
    245   1.1       cgd 		mp->sq[i]->desc->monop = TRUE;
    246   1.1       cgd 	mp->name = mp->mon_n;
    247   1.1       cgd }
    248   1.7    simonb 
    249   1.1       cgd /*
    250   1.1       cgd  *	This routine sets things up as if it is no longer a monopoly
    251   1.1       cgd  */
    252   1.6  christos void
    253   1.9       jsm is_not_monop(mp)
    254   1.7    simonb 	MON *mp;
    255   1.6  christos {
    256   1.7    simonb 	int i;
    257   1.1       cgd 
    258   1.1       cgd 	mp->owner = -1;
    259   1.1       cgd 	for (i = 0; i < mp->num_in; i++)
    260   1.1       cgd 		mp->sq[i]->desc->monop = FALSE;
    261   1.1       cgd 	mp->name = mp->not_m;
    262   1.1       cgd }
    263   1.7    simonb 
    264   1.1       cgd /*
    265   1.1       cgd  *	This routine gives a list of the current player's routine
    266   1.1       cgd  */
    267   1.6  christos void
    268   1.7    simonb list()
    269   1.6  christos {
    270   1.1       cgd 	printhold(player);
    271   1.1       cgd }
    272   1.7    simonb 
    273   1.1       cgd /*
    274   1.1       cgd  *	This routine gives a list of a given players holdings
    275   1.1       cgd  */
    276   1.6  christos void
    277   1.7    simonb list_all()
    278   1.6  christos {
    279   1.7    simonb 	int pl;
    280   1.1       cgd 
    281   1.7    simonb 	while ((pl = getinp("Whose holdings do you want to see? ", name_list))
    282   1.7    simonb 	    < num_play)
    283   1.1       cgd 		printhold(pl);
    284   1.1       cgd }
    285   1.7    simonb 
    286   1.1       cgd /*
    287   1.1       cgd  *	This routine gives the players a chance before it exits.
    288   1.1       cgd  */
    289   1.1       cgd void
    290   1.6  christos quit()
    291   1.6  christos {
    292   1.1       cgd 	putchar('\n');
    293   1.6  christos 	if (getyn("Do you all really want to quit? ") == 0)
    294   1.1       cgd 		exit(0);
    295   1.1       cgd }
    296