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