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