monop/monop.c

   1 /*      $NetBSD: monop.c,v 1.18 2008/02/20 04:48:10 dholland Exp $      */
   2
   3 /*
   4  * Copyright (c) 1980, 1993
   5  *      The Regents of the University of California.  All rights reserved.
   6  *
   7  * Redistribution and use in source and binary forms, with or without
   8  * modification, are permitted provided that the following conditions
   9  * are met:
  10  * 1. Redistributions of source code must retain the above copyright
  11  *    notice, this list of conditions and the following disclaimer.
  12  * 2. Redistributions in binary form must reproduce the above copyright
  13  *    notice, this list of conditions and the following disclaimer in the
  14  *    documentation and/or other materials provided with the distribution.
  15  * 3. Neither the name of the University nor the names of its contributors
  16  *    may be used to endorse or promote products derived from this software
  17  *    without specific prior written permission.
  18  *
  19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  29  * SUCH DAMAGE.
  30  */
  31
  32 #include <sys/cdefs.h>
  33 #ifndef lint
  34 __COPYRIGHT("@(#) Copyright (c) 1980, 1993\n\
  35         The Regents of the University of California.  All rights reserved.\n");
  36 #endif /* not lint */
  37
  38 #ifndef lint
  39 #if 0
  40 static char sccsid[] = "@(#)monop.c     8.1 (Berkeley) 5/31/93";
  41 #else
  42 __RCSID("$NetBSD: monop.c,v 1.18 2008/02/20 04:48:10 dholland Exp $");
  43 #endif
  44 #endif /* not lint */
  45
  46 #include <stdio.h>
  47 #include <signal.h>
  48 #include <stdlib.h>
  49 #include <time.h>
  50 #include <unistd.h>
  51 #include "monop.def"
  52
  53 int main(int, char *[]);
  54 static void getplayers(void);
  55 static void init_players(void);
  56 static void init_monops(void);
  57 static void do_quit(int);
  58 void *heapstart;
  59
  60 /*
  61  *      This program implements a monopoly game
  62  */
  63 int
  64 main(ac, av)
  65         int ac;
  66         char *av[];
  67 {
  68         /* Revoke setgid privileges */
  69         setgid(getgid());
  70
  71         srandom(time(NULL));
  72         heapstart = sbrk(0);
  73         if (ac > 1) {
  74                 if (!rest_f(av[1]))
  75                         restore();
  76         }
  77         else {
  78                 getplayers();
  79                 init_players();
  80                 init_monops();
  81         }
  82         num_luck = sizeof lucky_mes / sizeof (char *);
  83         init_decks();
  84         signal(SIGINT, do_quit);
  85         for (;;) {
  86                 printf("\n%s (%d) (cash $%d) on %s\n", cur_p->name, player + 1,
  87                         cur_p->money, board[cur_p->loc].name);
  88                 printturn();
  89                 force_morg();
  90                 execute(getinp("-- Command: ", comlist));
  91         }
  92 }
  93
  94 /*ARGSUSED*/
  95 static void
  96 do_quit(n)
  97         int n __unused;
  98 {
  99         quit();
 100 }
 101
 102 /*
 103  *      This routine gets the names of the players
 104  */
 105 static void
 106 getplayers()
 107 {
 108         char *sp;
 109         int i, j;
 110         char buf[257];
 111
 112 blew_it:
 113         for (;;) {
 114                 if ((num_play = get_int("How many players? ")) <= 0 ||
 115                     num_play > MAX_PL)
 116                         printf("Sorry. Number must range from 1 to 9\n");
 117                 else
 118                         break;
 119         }
 120         cur_p = play = (PLAY *) calloc(num_play, sizeof (PLAY));
 121         if (play == NULL)
 122                 err(1, NULL);
 123         for (i = 0; i < num_play; i++) {
 124 over:
 125                 printf("Player %d's name: ", i + 1);
 126                 for (sp = buf; (*sp = getchar()) != '\n'; sp++)
 127                         continue;
 128                 if (sp == buf)
 129                         goto over;
 130                 *sp++ = '\0';
 131                 name_list[i] = play[i].name = (char *)calloc(1, sp - buf);
 132                 if (name_list[i] == NULL)
 133                         err(1, NULL);
 134                 strcpy(play[i].name, buf);
 135                 play[i].money = 1500;
 136         }
 137         name_list[i++] = "done";
 138         name_list[i] = 0;
 139         for (i = 0; i < num_play; i++)
 140                 for (j = i + 1; j < num_play; j++)
 141                         if (strcasecmp(name_list[i], name_list[j]) == 0) {
 142                                 if (i != num_play - 1)
 143                                         printf("Hey!!! Some of those are "
 144                                             "IDENTICAL!!  Let's try that "
 145                                             "again....\n");
 146                                 else
 147                                         printf("\"done\" is a reserved word.  "
 148                                             "Please try again\n");
 149                                 for (i = 0; i < num_play; i++)
 150                                         free(play[i].name);
 151                                 free(play);
 152                                 goto blew_it;
 153                         }
 154 }
 155
 156 /*
 157  *      This routine figures out who goes first
 158  */
 159 static void
 160 init_players()
 161 {
 162         int i, rl, cur_max;
 163         bool over = 0;
 164         int max_pl = 0;
 165
 166 again:
 167         putchar('\n');
 168         for (cur_max = i = 0; i < num_play; i++) {
 169                 printf("%s (%d) rolls %d\n", play[i].name, i+1, rl=roll(2, 6));
 170                 if (rl > cur_max) {
 171                         over = FALSE;
 172                         cur_max = rl;
 173                         max_pl = i;
 174                 }
 175                 else if (rl == cur_max)
 176                         over++;
 177         }
 178         if (over) {
 179                 printf("%d people rolled the same thing, so we'll try again\n",
 180                     over + 1);
 181                 goto again;
 182         }
 183         player = max_pl;
 184         cur_p = &play[max_pl];
 185         printf("%s (%d) goes first\n", cur_p->name, max_pl + 1);
 186 }
 187
 188 /*
 189  *      This routine initializes the monopoly structures.
 190  */
 191 static void
 192 init_monops()
 193 {
 194         MON *mp;
 195         int i;
 196
 197         for (mp = mon; mp < &mon[N_MON]; mp++) {
 198                 mp->name = mp->not_m;
 199                 for (i = 0; i < mp->num_in; i++)
 200                         mp->sq[i] = &board[mp->sqnums[i]];
 201         }
 202 }