houses.c revision 1.9 1 1.9 christos /* $NetBSD: houses.c,v 1.9 2006/03/19 00:19:31 christos 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.7 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.3 cgd #if 0
35 1.3 cgd static char sccsid[] = "@(#)houses.c 8.1 (Berkeley) 5/31/93";
36 1.3 cgd #else
37 1.9 christos __RCSID("$NetBSD: houses.c,v 1.9 2006/03/19 00:19:31 christos Exp $");
38 1.3 cgd #endif
39 1.1 cgd #endif /* not lint */
40 1.1 cgd
41 1.4 christos #include "monop.ext"
42 1.1 cgd
43 1.6 jsm static const char *names[N_MON+2];
44 1.6 jsm static char cur_prop[80];
45 1.1 cgd
46 1.1 cgd static MON *monops[N_MON];
47 1.1 cgd
48 1.8 jsm static void buy_h(MON *);
49 1.8 jsm static void sell_h(MON *);
50 1.8 jsm static void list_cur(MON *);
51 1.1 cgd /*
52 1.1 cgd * These routines deal with buying and selling houses
53 1.1 cgd */
54 1.4 christos void
55 1.4 christos buy_houses()
56 1.4 christos {
57 1.4 christos int num_mon;
58 1.5 simonb MON *mp;
59 1.5 simonb OWN *op;
60 1.5 simonb bool good,got_morg;
61 1.5 simonb int i,p;
62 1.1 cgd
63 1.1 cgd over:
64 1.1 cgd num_mon = 0;
65 1.1 cgd good = TRUE;
66 1.1 cgd got_morg = FALSE;
67 1.1 cgd for (op = cur_p->own_list; op && op->sqr->type != PRPTY; op = op->next)
68 1.1 cgd continue;
69 1.1 cgd while (op)
70 1.1 cgd if (op->sqr->desc->monop) {
71 1.1 cgd mp = op->sqr->desc->mon_desc;
72 1.1 cgd names[num_mon] = (monops[num_mon]=mp)->name;
73 1.1 cgd num_mon++;
74 1.1 cgd got_morg = good = FALSE;
75 1.1 cgd for (i = 0; i < mp->num_in; i++) {
76 1.1 cgd if (op->sqr->desc->morg)
77 1.1 cgd got_morg++;
78 1.1 cgd if (op->sqr->desc->houses != 5)
79 1.1 cgd good++;
80 1.1 cgd op = op->next;
81 1.1 cgd }
82 1.1 cgd if (!good || got_morg)
83 1.1 cgd --num_mon;
84 1.1 cgd }
85 1.1 cgd else
86 1.1 cgd op = op->next;
87 1.1 cgd if (num_mon == 0) {
88 1.1 cgd if (got_morg)
89 1.1 cgd printf("You can't build on mortgaged monopolies.\n");
90 1.1 cgd else if (!good)
91 1.1 cgd printf("You can't build any more.\n");
92 1.1 cgd else
93 1.1 cgd printf("But you don't have any monopolies!!\n");
94 1.1 cgd return;
95 1.1 cgd }
96 1.1 cgd if (num_mon == 1)
97 1.1 cgd buy_h(monops[0]);
98 1.1 cgd else {
99 1.1 cgd names[num_mon++] = "done";
100 1.1 cgd names[num_mon--] = 0;
101 1.5 simonb if ((p = getinp(
102 1.5 simonb "Which property do you wish to buy houses for? ",
103 1.5 simonb names)) == num_mon)
104 1.1 cgd return;
105 1.1 cgd buy_h(monops[p]);
106 1.1 cgd goto over;
107 1.1 cgd }
108 1.1 cgd }
109 1.1 cgd
110 1.4 christos static void
111 1.1 cgd buy_h(mnp)
112 1.5 simonb MON *mnp;
113 1.4 christos {
114 1.5 simonb int i;
115 1.5 simonb MON *mp;
116 1.5 simonb int price;
117 1.5 simonb short input[3],temp[3];
118 1.5 simonb int tot;
119 1.5 simonb PROP *pp;
120 1.1 cgd
121 1.1 cgd mp = mnp;
122 1.1 cgd price = mp->h_cost * 50;
123 1.1 cgd blew_it:
124 1.1 cgd list_cur(mp);
125 1.1 cgd printf("Houses will cost $%d\n", price);
126 1.1 cgd printf("How many houses do you wish to buy for\n");
127 1.1 cgd for (i = 0; i < mp->num_in; i++) {
128 1.1 cgd pp = mp->sq[i]->desc;
129 1.1 cgd over:
130 1.1 cgd if (pp->houses == 5) {
131 1.1 cgd printf("%s (H):\n", mp->sq[i]->name);
132 1.1 cgd input[i] = 0;
133 1.1 cgd temp[i] = 5;
134 1.1 cgd continue;
135 1.1 cgd }
136 1.1 cgd (void)sprintf(cur_prop, "%s (%d): ",
137 1.1 cgd mp->sq[i]->name, pp->houses);
138 1.1 cgd input[i] = get_int(cur_prop);
139 1.1 cgd temp[i] = input[i] + pp->houses;
140 1.1 cgd if (temp[i] > 5) {
141 1.1 cgd printf("That's too many. The most you can buy is %d\n",
142 1.1 cgd 5 - pp->houses);
143 1.1 cgd goto over;
144 1.1 cgd }
145 1.1 cgd }
146 1.1 cgd if (mp->num_in == 3 && (abs(temp[0] - temp[1]) > 1 ||
147 1.1 cgd abs(temp[0] - temp[2]) > 1 || abs(temp[1] - temp[2]) > 1)) {
148 1.1 cgd err: printf("That makes the spread too wide. Try again\n");
149 1.1 cgd goto blew_it;
150 1.1 cgd }
151 1.1 cgd else if (mp->num_in == 2 && abs(temp[0] - temp[1]) > 1)
152 1.1 cgd goto err;
153 1.1 cgd for (tot = i = 0; i < mp->num_in; i++)
154 1.1 cgd tot += input[i];
155 1.1 cgd if (tot) {
156 1.1 cgd printf("You asked for %d houses for $%d\n", tot, tot * price);
157 1.4 christos if (getyn("Is that ok? ") == 0) {
158 1.1 cgd cur_p->money -= tot * price;
159 1.1 cgd for (tot = i = 0; i < mp->num_in; i++)
160 1.1 cgd mp->sq[i]->desc->houses = temp[i];
161 1.1 cgd }
162 1.1 cgd }
163 1.1 cgd }
164 1.1 cgd
165 1.1 cgd /*
166 1.1 cgd * This routine sells houses.
167 1.1 cgd */
168 1.4 christos void
169 1.4 christos sell_houses()
170 1.4 christos {
171 1.5 simonb int num_mon;
172 1.5 simonb MON *mp;
173 1.5 simonb OWN *op;
174 1.5 simonb bool good;
175 1.5 simonb int p;
176 1.1 cgd
177 1.1 cgd over:
178 1.1 cgd num_mon = 0;
179 1.1 cgd good = TRUE;
180 1.9 christos for (op = cur_p->own_list; op;)
181 1.1 cgd if (op->sqr->type == PRPTY && op->sqr->desc->monop) {
182 1.1 cgd mp = op->sqr->desc->mon_desc;
183 1.1 cgd names[num_mon] = (monops[num_mon]=mp)->name;
184 1.1 cgd num_mon++;
185 1.1 cgd good = 0;
186 1.1 cgd do
187 1.1 cgd if (!good && op->sqr->desc->houses != 0)
188 1.1 cgd good++;
189 1.1 cgd while (op->next && op->sqr->desc->mon_desc == mp
190 1.9 christos && (op = op->next));
191 1.1 cgd if (!good)
192 1.1 cgd --num_mon;
193 1.9 christos } else
194 1.9 christos op = op->next;
195 1.1 cgd if (num_mon == 0) {
196 1.1 cgd printf("You don't have any houses to sell!!\n");
197 1.1 cgd return;
198 1.1 cgd }
199 1.1 cgd if (num_mon == 1)
200 1.1 cgd sell_h(monops[0]);
201 1.1 cgd else {
202 1.1 cgd names[num_mon++] = "done";
203 1.1 cgd names[num_mon--] = 0;
204 1.5 simonb if ((p = getinp(
205 1.5 simonb "Which property do you wish to sell houses from? ",
206 1.5 simonb names)) == num_mon)
207 1.1 cgd return;
208 1.1 cgd sell_h(monops[p]);
209 1.1 cgd notify();
210 1.1 cgd goto over;
211 1.1 cgd }
212 1.1 cgd }
213 1.1 cgd
214 1.4 christos static void
215 1.1 cgd sell_h(mnp)
216 1.5 simonb MON *mnp;
217 1.4 christos {
218 1.5 simonb int i;
219 1.5 simonb MON *mp;
220 1.5 simonb int price;
221 1.5 simonb short input[3],temp[3];
222 1.5 simonb int tot;
223 1.5 simonb PROP *pp;
224 1.1 cgd
225 1.1 cgd mp = mnp;
226 1.1 cgd price = mp->h_cost * 25;
227 1.1 cgd blew_it:
228 1.1 cgd printf("Houses will get you $%d apiece\n", price);
229 1.1 cgd list_cur(mp);
230 1.1 cgd printf("How many houses do you wish to sell from\n");
231 1.1 cgd for (i = 0; i < mp->num_in; i++) {
232 1.1 cgd pp = mp->sq[i]->desc;
233 1.1 cgd over:
234 1.1 cgd if (pp->houses == 0) {
235 1.1 cgd printf("%s (0):\n", mp->sq[i]->name);
236 1.1 cgd input[i] = temp[i] = 0;
237 1.1 cgd continue;
238 1.1 cgd }
239 1.1 cgd if (pp->houses < 5)
240 1.1 cgd (void)sprintf(cur_prop,"%s (%d): ",
241 1.1 cgd mp->sq[i]->name,pp->houses);
242 1.1 cgd else
243 1.1 cgd (void)sprintf(cur_prop,"%s (H): ",mp->sq[i]->name);
244 1.1 cgd input[i] = get_int(cur_prop);
245 1.1 cgd temp[i] = pp->houses - input[i];
246 1.1 cgd if (temp[i] < 0) {
247 1.5 simonb printf(
248 1.5 simonb "That's too many. The most you can sell is %d\n",
249 1.5 simonb pp->houses);
250 1.1 cgd goto over;
251 1.1 cgd }
252 1.1 cgd }
253 1.1 cgd if (mp->num_in == 3 && (abs(temp[0] - temp[1]) > 1 ||
254 1.1 cgd abs(temp[0] - temp[2]) > 1 || abs(temp[1] - temp[2]) > 1)) {
255 1.1 cgd err: printf("That makes the spread too wide. Try again\n");
256 1.1 cgd goto blew_it;
257 1.1 cgd }
258 1.1 cgd else if (mp->num_in == 2 && abs(temp[0] - temp[1]) > 1)
259 1.1 cgd goto err;
260 1.1 cgd for (tot = i = 0; i < mp->num_in; i++)
261 1.1 cgd tot += input[i];
262 1.1 cgd if (tot) {
263 1.1 cgd printf("You asked to sell %d houses for $%d\n",tot,tot * price);
264 1.4 christos if (getyn("Is that ok? ") == 0) {
265 1.1 cgd cur_p->money += tot * price;
266 1.1 cgd for (tot = i = 0; i < mp->num_in; i++)
267 1.1 cgd mp->sq[i]->desc->houses = temp[i];
268 1.1 cgd }
269 1.1 cgd }
270 1.1 cgd }
271 1.1 cgd
272 1.4 christos static void
273 1.1 cgd list_cur(mp)
274 1.5 simonb MON *mp;
275 1.4 christos {
276 1.5 simonb int i;
277 1.5 simonb SQUARE *sqp;
278 1.1 cgd
279 1.1 cgd for (i = 0; i < mp->num_in; i++) {
280 1.1 cgd sqp = mp->sq[i];
281 1.1 cgd if (sqp->desc->houses == 5)
282 1.1 cgd printf("%s (H) ", sqp->name);
283 1.1 cgd else
284 1.1 cgd printf("%s (%d) ", sqp->name, sqp->desc->houses);
285 1.1 cgd }
286 1.1 cgd putchar('\n');
287 1.1 cgd }
288