Home | History | Annotate | Line # | Download | only in monop
monop.c revision 1.14
      1  1.14       agc /*	$NetBSD: monop.c,v 1.14 2003/08/07 09:37:28 agc Exp $	*/
      2   1.3       cgd 
      3   1.1       cgd /*
      4   1.3       cgd  * Copyright (c) 1980, 1993
      5   1.3       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.14       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.4  christos #include <sys/cdefs.h>
     33   1.1       cgd #ifndef lint
     34   1.4  christos __COPYRIGHT("@(#) Copyright (c) 1980, 1993\n\
     35   1.4  christos 	The Regents of the University of California.  All rights reserved.\n");
     36   1.1       cgd #endif /* not lint */
     37   1.1       cgd 
     38   1.1       cgd #ifndef lint
     39   1.3       cgd #if 0
     40   1.3       cgd static char sccsid[] = "@(#)monop.c	8.1 (Berkeley) 5/31/93";
     41   1.3       cgd #else
     42  1.14       agc __RCSID("$NetBSD: monop.c,v 1.14 2003/08/07 09:37:28 agc Exp $");
     43   1.3       cgd #endif
     44   1.1       cgd #endif /* not lint */
     45   1.1       cgd 
     46   1.4  christos #include <stdio.h>
     47   1.4  christos #include <signal.h>
     48   1.4  christos #include <stdlib.h>
     49   1.4  christos #include <unistd.h>
     50   1.4  christos #include "monop.def"
     51   1.4  christos 
     52   1.4  christos int main __P((int, char *[]));
     53   1.4  christos static void getplayers __P((void));
     54   1.4  christos static void init_players __P((void));
     55   1.4  christos static void init_monops __P((void));
     56   1.4  christos static void do_quit __P((int));
     57  1.13  christos void *heapstart;
     58   1.1       cgd 
     59   1.1       cgd /*
     60   1.1       cgd  *	This program implements a monopoly game
     61   1.1       cgd  */
     62   1.4  christos int
     63   1.1       cgd main(ac, av)
     64   1.6    simonb 	int ac;
     65   1.6    simonb 	char *av[];
     66   1.6    simonb {
     67   1.9       jsm 	/* Revoke setgid privileges */
     68  1.11   mycroft 	setgid(getgid());
     69   1.9       jsm 
     70   1.1       cgd 	srand(getpid());
     71  1.13  christos 	heapstart = sbrk(0);
     72   1.1       cgd 	if (ac > 1) {
     73   1.1       cgd 		if (!rest_f(av[1]))
     74   1.1       cgd 			restore();
     75   1.1       cgd 	}
     76   1.1       cgd 	else {
     77   1.1       cgd 		getplayers();
     78   1.1       cgd 		init_players();
     79   1.1       cgd 		init_monops();
     80   1.1       cgd 	}
     81   1.1       cgd 	num_luck = sizeof lucky_mes / sizeof (char *);
     82   1.1       cgd 	init_decks();
     83   1.5   hubertf 	signal(SIGINT, do_quit);
     84   1.1       cgd 	for (;;) {
     85   1.1       cgd 		printf("\n%s (%d) (cash $%d) on %s\n", cur_p->name, player + 1,
     86   1.1       cgd 			cur_p->money, board[cur_p->loc].name);
     87   1.1       cgd 		printturn();
     88   1.1       cgd 		force_morg();
     89   1.1       cgd 		execute(getinp("-- Command: ", comlist));
     90   1.1       cgd 	}
     91   1.1       cgd }
     92   1.4  christos 
     93   1.4  christos /*ARGSUSED*/
     94   1.4  christos static void
     95   1.4  christos do_quit(n)
     96   1.7       jsm 	int n __attribute__((__unused__));
     97   1.4  christos {
     98   1.4  christos 	quit();
     99   1.4  christos }
    100   1.6    simonb 
    101   1.1       cgd /*
    102   1.1       cgd  *	This routine gets the names of the players
    103   1.1       cgd  */
    104   1.4  christos static void
    105   1.4  christos getplayers()
    106   1.4  christos {
    107   1.6    simonb 	char *sp;
    108   1.6    simonb 	int i, j;
    109   1.6    simonb 	char buf[257];
    110   1.1       cgd 
    111   1.1       cgd blew_it:
    112   1.1       cgd 	for (;;) {
    113   1.1       cgd 		if ((num_play=get_int("How many players? ")) <= 0 ||
    114   1.1       cgd 		    num_play > MAX_PL)
    115   1.1       cgd 			printf("Sorry. Number must range from 1 to 9\n");
    116   1.1       cgd 		else
    117   1.1       cgd 			break;
    118   1.1       cgd 	}
    119   1.1       cgd 	cur_p = play = (PLAY *) calloc(num_play, sizeof (PLAY));
    120   1.8       jsm 	if (play == NULL)
    121  1.10       jsm 		err(1, NULL);
    122   1.1       cgd 	for (i = 0; i < num_play; i++) {
    123   1.1       cgd over:
    124   1.1       cgd 		printf("Player %d's name: ", i + 1);
    125   1.1       cgd 		for (sp = buf; (*sp=getchar()) != '\n'; sp++)
    126   1.1       cgd 			continue;
    127   1.1       cgd 		if (sp == buf)
    128   1.1       cgd 			goto over;
    129   1.1       cgd 		*sp++ = '\0';
    130   1.8       jsm 		name_list[i] = play[i].name = (char *)calloc(1, sp - buf);
    131   1.8       jsm 		if (name_list[i] == NULL)
    132  1.10       jsm 			err(1, NULL);
    133   1.8       jsm 		strcpy(play[i].name, buf);
    134   1.1       cgd 		play[i].money = 1500;
    135   1.1       cgd 	}
    136   1.1       cgd 	name_list[i++] = "done";
    137   1.1       cgd 	name_list[i] = 0;
    138   1.1       cgd 	for (i = 0; i < num_play; i++)
    139   1.1       cgd 		for (j = i + 1; j < num_play; j++)
    140   1.1       cgd 			if (strcasecmp(name_list[i], name_list[j]) == 0) {
    141   1.1       cgd 				if (i != num_play - 1)
    142   1.6    simonb 					printf("Hey!!! Some of those are "
    143   1.6    simonb 					    "IDENTICAL!!  Let's try that "
    144   1.6    simonb 					    "again....\n");
    145   1.1       cgd 				else
    146   1.6    simonb 					printf("\"done\" is a reserved word.  "
    147   1.6    simonb 					    "Please try again\n");
    148   1.1       cgd 				for (i = 0; i < num_play; i++)
    149   1.4  christos 					free(play[i].name);
    150   1.4  christos 				free(play);
    151   1.1       cgd 				goto blew_it;
    152   1.1       cgd 			}
    153   1.1       cgd }
    154   1.6    simonb 
    155   1.1       cgd /*
    156   1.1       cgd  *	This routine figures out who goes first
    157   1.1       cgd  */
    158   1.4  christos static void
    159   1.4  christos init_players()
    160   1.4  christos {
    161   1.6    simonb 	int i, rl, cur_max;
    162   1.6    simonb 	bool over = 0;
    163   1.6    simonb 	int max_pl = 0;
    164   1.1       cgd 
    165   1.1       cgd again:
    166   1.1       cgd 	putchar('\n');
    167   1.1       cgd 	for (cur_max = i = 0; i < num_play; i++) {
    168   1.1       cgd 		printf("%s (%d) rolls %d\n", play[i].name, i+1, rl=roll(2, 6));
    169   1.1       cgd 		if (rl > cur_max) {
    170   1.1       cgd 			over = FALSE;
    171   1.1       cgd 			cur_max = rl;
    172   1.1       cgd 			max_pl = i;
    173   1.1       cgd 		}
    174   1.1       cgd 		else if (rl == cur_max)
    175   1.1       cgd 			over++;
    176   1.1       cgd 	}
    177   1.1       cgd 	if (over) {
    178   1.1       cgd 		printf("%d people rolled the same thing, so we'll try again\n",
    179   1.1       cgd 		    over + 1);
    180   1.1       cgd 		goto again;
    181   1.1       cgd 	}
    182   1.1       cgd 	player = max_pl;
    183   1.1       cgd 	cur_p = &play[max_pl];
    184   1.1       cgd 	printf("%s (%d) goes first\n", cur_p->name, max_pl + 1);
    185   1.1       cgd }
    186   1.6    simonb 
    187   1.1       cgd /*
    188  1.12       wiz  *	This routine initializes the monopoly structures.
    189   1.1       cgd  */
    190   1.4  christos static void
    191   1.4  christos init_monops()
    192   1.4  christos {
    193   1.6    simonb 	MON *mp;
    194   1.6    simonb 	int i;
    195   1.1       cgd 
    196   1.1       cgd 	for (mp = mon; mp < &mon[N_MON]; mp++) {
    197   1.1       cgd 		mp->name = mp->not_m;
    198   1.1       cgd 		for (i = 0; i < mp->num_in; i++)
    199   1.1       cgd 			mp->sq[i] = &board[mp->sqnums[i]];
    200   1.1       cgd 	}
    201   1.1       cgd }
    202