monop.c revision 1.19 1 /* $NetBSD: monop.c,v 1.19 2008/02/23 21:48:46 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.19 2008/02/23 21:48:46 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 num_luck = sizeof lucky_mes / sizeof (char *);
74 init_decks();
75 init_monops();
76 if (ac > 1) {
77 if (!rest_f(av[1]))
78 restore();
79 }
80 else {
81 getplayers();
82 init_players();
83 }
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 int i, j;
109 char buf[257];
110
111 blew_it:
112 for (;;) {
113 if ((num_play = get_int("How many players? ")) <= 1 ||
114 num_play > MAX_PL)
115 printf("Sorry. Number must range from 2 to %d\n",
116 MAX_PL);
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 do {
125 printf("Player %d's name: ", i + 1);
126 fgets(buf, sizeof(buf), stdin);
127 if (feof(stdin)) {
128 printf("End of file on stdin\n");
129 exit(0);
130 }
131 buf[strcspn(buf, "\n")] = '\0';
132 } while (strlen(buf) == 0);
133 name_list[i] = play[i].name = strdup(buf);
134 if (name_list[i] == NULL)
135 err(1, NULL);
136 play[i].money = 1500;
137 }
138 name_list[i++] = "done";
139 name_list[i] = 0;
140 for (i = 0; i < num_play; i++)
141 for (j = i + 1; j <= num_play; j++)
142 if (strcasecmp(name_list[i], name_list[j]) == 0) {
143 if (j != num_play)
144 printf("Hey!!! Some of those are "
145 "IDENTICAL!! Let's try that "
146 "again...\n");
147 else
148 printf("\"done\" is a reserved word. "
149 "Please try again\n");
150 for (i = 0; i < num_play; i++)
151 free(play[i].name);
152 free(play);
153 goto blew_it;
154 }
155 }
156
157 /*
158 * This routine figures out who goes first
159 */
160 static void
161 init_players()
162 {
163 int i, rl, cur_max;
164 bool over = 0;
165 int max_pl = 0;
166
167 again:
168 putchar('\n');
169 for (cur_max = i = 0; i < num_play; i++) {
170 printf("%s (%d) rolls %d\n", play[i].name, i+1, rl=roll(2, 6));
171 if (rl > cur_max) {
172 over = FALSE;
173 cur_max = rl;
174 max_pl = i;
175 }
176 else if (rl == cur_max)
177 over++;
178 }
179 if (over) {
180 printf("%d people rolled the same thing, so we'll try again\n",
181 over + 1);
182 goto again;
183 }
184 player = max_pl;
185 cur_p = &play[max_pl];
186 printf("%s (%d) goes first\n", cur_p->name, max_pl + 1);
187 }
188
189 /*
190 * This routine initializes the monopoly structures.
191 */
192 static void
193 init_monops()
194 {
195 MON *mp;
196 int i;
197
198 for (mp = mon; mp < &mon[N_MON]; mp++) {
199 mp->name = mp->not_m;
200 for (i = 0; i < mp->num_in; i++)
201 mp->sq[i] = &board[mp->sqnums[i]];
202 }
203 }
204