]> git.cameronkatri.com Git - bsdgames-darwin.git/blob - monop/morg.c
merge with Lite, new RCS id conventions, etc.
[bsdgames-darwin.git] / monop / morg.c
1 /* $NetBSD: morg.c,v 1.4 1995/03/23 08:35:02 cgd 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. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 */
35
36 #ifndef lint
37 #if 0
38 static char sccsid[] = "@(#)morg.c 8.1 (Berkeley) 5/31/93";
39 #else
40 static char rcsid[] = "$NetBSD: morg.c,v 1.4 1995/03/23 08:35:02 cgd Exp $";
41 #endif
42 #endif /* not lint */
43
44 # include "monop.ext"
45
46 /*
47 * These routines deal with mortgaging.
48 */
49
50 static char *names[MAX_PRP+2],
51 *morg_coms[] = {
52 "quit", /* 0 */
53 "print", /* 1 */
54 "where", /* 2 */
55 "own holdings", /* 3 */
56 "holdings", /* 4 */
57 "mortgage", /* 5 */
58 "unmortgage", /* 6 */
59 "buy", /* 7 */
60 "sell", /* 8 */
61 "card", /* 9 */
62 "pay", /* 10 */
63 "trade", /* 11 */
64 "resign", /* 12 */
65 "save game", /* 13 */
66 "restore game", /* 14 */
67 0
68 };
69
70 static shrt square[MAX_PRP+2];
71
72 static int num_good,got_houses;
73
74 /*
75 * This routine is the command level response the mortgage command.
76 * it gets the list of mortgageable property and asks which are to
77 * be mortgaged.
78 */
79 mortgage() {
80
81 reg int prop;
82
83 for (;;) {
84 if (set_mlist() == 0) {
85 if (got_houses)
86 printf("You can't mortgage property with houses on it.\n");
87 else
88 printf("You don't have any un-mortgaged property.\n");
89 return;
90 }
91 if (num_good == 1) {
92 printf("Your only mortageable property is %s\n",names[0]);
93 if (getyn("Do you want to mortgage it? ") == 0)
94 m(square[0]);
95 return;
96 }
97 prop = getinp("Which property do you want to mortgage? ",names);
98 if (prop == num_good)
99 return;
100 m(square[prop]);
101 notify(cur_p);
102 }
103 }
104 /*
105 * This routine sets up the list of mortgageable property
106 */
107 set_mlist() {
108
109 reg OWN *op;
110
111 num_good = 0;
112 for (op = cur_p->own_list; op; op = op->next)
113 if (!op->sqr->desc->morg)
114 if (op->sqr->type == PRPTY && op->sqr->desc->houses)
115 got_houses++;
116 else {
117 names[num_good] = op->sqr->name;
118 square[num_good++] = sqnum(op->sqr);
119 }
120 names[num_good++] = "done";
121 names[num_good--] = 0;
122 return num_good;
123 }
124 /*
125 * This routine actually mortgages the property.
126 */
127 m(prop)
128 reg int prop; {
129
130 reg int price;
131
132 price = board[prop].cost/2;
133 board[prop].desc->morg = TRUE;
134 printf("That got you $%d\n",price);
135 cur_p->money += price;
136 }
137 /*
138 * This routine is the command level repsponse to the unmortgage
139 * command. It gets the list of mortgaged property and asks which are
140 * to be unmortgaged.
141 */
142 unmortgage() {
143
144 reg int prop;
145
146 for (;;) {
147 if (set_umlist() == 0) {
148 printf("You don't have any mortgaged property.\n");
149 return;
150 }
151 if (num_good == 1) {
152 printf("Your only mortaged property is %s\n",names[0]);
153 if (getyn("Do you want to unmortgage it? ") == 0)
154 unm(square[0]);
155 return;
156 }
157 prop = getinp("Which property do you want to unmortgage? ",names);
158 if (prop == num_good)
159 return;
160 unm(square[prop]);
161 }
162 }
163 /*
164 * This routine sets up the list of mortgaged property
165 */
166 set_umlist() {
167
168 reg OWN *op;
169
170 num_good = 0;
171 for (op = cur_p->own_list; op; op = op->next)
172 if (op->sqr->desc->morg) {
173 names[num_good] = op->sqr->name;
174 square[num_good++] = sqnum(op->sqr);
175 }
176 names[num_good++] = "done";
177 names[num_good--] = 0;
178 return num_good;
179 }
180 /*
181 * This routine actually unmortgages the property
182 */
183 unm(prop)
184 reg int prop; {
185
186 reg int price;
187
188 price = board[prop].cost/2;
189 board[prop].desc->morg = FALSE;
190 price += price/10;
191 printf("That cost you $%d\n",price);
192 cur_p->money -= price;
193 set_umlist();
194 }
195 /*
196 * This routine forces the indebted player to fix his
197 * financial woes.
198 */
199 force_morg() {
200
201 told_em = fixing = TRUE;
202 while (cur_p->money <= 0)
203 fix_ex(getinp("How are you going to fix it up? ",morg_coms));
204 fixing = FALSE;
205 }
206 /*
207 * This routine is a special execute for the force_morg routine
208 */
209 fix_ex(com_num)
210 reg int com_num; {
211
212 told_em = FALSE;
213 (*func[com_num])();
214 notify();
215 }