cards.c revision 1.13 1 1.13 agc /* $NetBSD: cards.c,v 1.13 2003/08/07 09:37:27 agc 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.13 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[] = "@(#)cards.c 8.1 (Berkeley) 5/31/93";
36 1.3 cgd #else
37 1.13 agc __RCSID("$NetBSD: cards.c,v 1.13 2003/08/07 09:37:27 agc Exp $");
38 1.3 cgd #endif
39 1.1 cgd #endif /* not lint */
40 1.1 cgd
41 1.7 simonb #include <sys/types.h>
42 1.7 simonb #include <sys/endian.h>
43 1.7 simonb #include "monop.ext"
44 1.7 simonb #include "pathnames.h"
45 1.1 cgd
46 1.1 cgd /*
47 1.1 cgd * These routine deal with the card decks
48 1.1 cgd */
49 1.1 cgd
50 1.7 simonb #define GOJF 'F' /* char for get-out-of-jail-free cards */
51 1.1 cgd
52 1.7 simonb #ifndef DEV
53 1.8 jsm static const char *cardfile = _PATH_CARDS;
54 1.7 simonb #else
55 1.8 jsm static const char *cardfile = "cards.pck";
56 1.7 simonb #endif
57 1.1 cgd
58 1.1 cgd static FILE *deckf;
59 1.1 cgd
60 1.4 christos static void set_up __P((DECK *));
61 1.4 christos static void printmes __P((void));
62 1.4 christos
63 1.1 cgd /*
64 1.1 cgd * This routine initializes the decks from the data file,
65 1.1 cgd * which it opens.
66 1.1 cgd */
67 1.4 christos void
68 1.4 christos init_decks()
69 1.4 christos {
70 1.6 simonb int32_t nc;
71 1.1 cgd
72 1.1 cgd if ((deckf=fopen(cardfile, "r")) == NULL) {
73 1.1 cgd file_err:
74 1.1 cgd perror(cardfile);
75 1.1 cgd exit(1);
76 1.1 cgd }
77 1.6 simonb
78 1.6 simonb /* read number of community chest cards... */
79 1.6 simonb if (fread(&nc, sizeof(nc), 1, deckf) != 1)
80 1.6 simonb goto file_err;
81 1.6 simonb CC_D.num_cards = be32toh(nc);
82 1.6 simonb /* ... and number of community chest cards. */
83 1.6 simonb if (fread(&nc, sizeof(nc), 1, deckf) != 1)
84 1.1 cgd goto file_err;
85 1.6 simonb CH_D.num_cards = be32toh(nc);
86 1.1 cgd set_up(&CC_D);
87 1.1 cgd set_up(&CH_D);
88 1.1 cgd }
89 1.7 simonb
90 1.1 cgd /*
91 1.1 cgd * This routine sets up the offset pointers for the given deck.
92 1.1 cgd */
93 1.4 christos static void
94 1.1 cgd set_up(dp)
95 1.7 simonb DECK *dp;
96 1.7 simonb {
97 1.7 simonb int r1, r2;
98 1.7 simonb int i;
99 1.1 cgd
100 1.12 itojun dp->offsets = (off_t *) calloc(dp->num_cards, sizeof (off_t));
101 1.10 jsm if (dp->offsets == NULL)
102 1.10 jsm errx(1, "out of memory");
103 1.6 simonb if (fread(dp->offsets, sizeof(off_t), dp->num_cards, deckf) !=
104 1.6 simonb dp->num_cards) {
105 1.1 cgd perror(cardfile);
106 1.1 cgd exit(1);
107 1.1 cgd }
108 1.6 simonb /* convert offsets from big-endian byte order */
109 1.6 simonb for (i = 0; i < dp->num_cards; i++)
110 1.6 simonb BE64TOH(dp->offsets[i]);
111 1.1 cgd dp->last_card = 0;
112 1.1 cgd dp->gojf_used = FALSE;
113 1.1 cgd for (i = 0; i < dp->num_cards; i++) {
114 1.6 simonb off_t temp;
115 1.1 cgd
116 1.1 cgd r1 = roll(1, dp->num_cards) - 1;
117 1.1 cgd r2 = roll(1, dp->num_cards) - 1;
118 1.1 cgd temp = dp->offsets[r2];
119 1.1 cgd dp->offsets[r2] = dp->offsets[r1];
120 1.1 cgd dp->offsets[r1] = temp;
121 1.1 cgd }
122 1.1 cgd }
123 1.7 simonb
124 1.1 cgd /*
125 1.1 cgd * This routine draws a card from the given deck
126 1.1 cgd */
127 1.4 christos void
128 1.1 cgd get_card(dp)
129 1.7 simonb DECK *dp;
130 1.4 christos {
131 1.7 simonb char type_maj, type_min;
132 1.7 simonb int num;
133 1.7 simonb int i, per_h, per_H, num_h, num_H;
134 1.7 simonb OWN *op;
135 1.1 cgd
136 1.1 cgd do {
137 1.9 jsm fseek(deckf, dp->offsets[dp->last_card], SEEK_SET);
138 1.1 cgd dp->last_card = ++(dp->last_card) % dp->num_cards;
139 1.1 cgd type_maj = getc(deckf);
140 1.1 cgd } while (dp->gojf_used && type_maj == GOJF);
141 1.1 cgd type_min = getc(deckf);
142 1.11 simonb num = ntohl(getw(deckf));
143 1.1 cgd printmes();
144 1.1 cgd switch (type_maj) {
145 1.1 cgd case '+': /* get money */
146 1.1 cgd if (type_min == 'A') {
147 1.1 cgd for (i = 0; i < num_play; i++)
148 1.1 cgd if (i != player)
149 1.1 cgd play[i].money -= num;
150 1.1 cgd num = num * (num_play - 1);
151 1.1 cgd }
152 1.1 cgd cur_p->money += num;
153 1.1 cgd break;
154 1.1 cgd case '-': /* lose money */
155 1.1 cgd if (type_min == 'A') {
156 1.1 cgd for (i = 0; i < num_play; i++)
157 1.1 cgd if (i != player)
158 1.1 cgd play[i].money += num;
159 1.1 cgd num = num * (num_play - 1);
160 1.1 cgd }
161 1.1 cgd cur_p->money -= num;
162 1.1 cgd break;
163 1.1 cgd case 'M': /* move somewhere */
164 1.1 cgd switch (type_min) {
165 1.1 cgd case 'F': /* move forward */
166 1.1 cgd num -= cur_p->loc;
167 1.1 cgd if (num < 0)
168 1.1 cgd num += 40;
169 1.1 cgd break;
170 1.1 cgd case 'J': /* move to jail */
171 1.1 cgd goto_jail();
172 1.1 cgd return;
173 1.1 cgd case 'R': /* move to railroad */
174 1.1 cgd spec = TRUE;
175 1.1 cgd num = (int)((cur_p->loc + 5)/10)*10 + 5 - cur_p->loc;
176 1.1 cgd break;
177 1.1 cgd case 'U': /* move to utility */
178 1.1 cgd spec = TRUE;
179 1.1 cgd if (cur_p->loc >= 12 && cur_p->loc < 28)
180 1.1 cgd num = 28 - cur_p->loc;
181 1.1 cgd else {
182 1.1 cgd num = 12 - cur_p->loc;
183 1.1 cgd if (num < 0)
184 1.1 cgd num += 40;
185 1.1 cgd }
186 1.1 cgd break;
187 1.1 cgd case 'B':
188 1.1 cgd num = -num;
189 1.1 cgd break;
190 1.1 cgd }
191 1.1 cgd move(num);
192 1.1 cgd break;
193 1.1 cgd case 'T': /* tax */
194 1.1 cgd if (dp == &CC_D) {
195 1.1 cgd per_h = 40;
196 1.1 cgd per_H = 115;
197 1.1 cgd }
198 1.1 cgd else {
199 1.1 cgd per_h = 25;
200 1.1 cgd per_H = 100;
201 1.1 cgd }
202 1.1 cgd num_h = num_H = 0;
203 1.1 cgd for (op = cur_p->own_list; op; op = op->next)
204 1.5 veego if (op->sqr->type == PRPTY) {
205 1.1 cgd if (op->sqr->desc->houses == 5)
206 1.1 cgd ++num_H;
207 1.1 cgd else
208 1.1 cgd num_h += op->sqr->desc->houses;
209 1.5 veego }
210 1.1 cgd num = per_h * num_h + per_H * num_H;
211 1.7 simonb printf(
212 1.7 simonb "You had %d Houses and %d Hotels, so that cost you $%d\n",
213 1.7 simonb num_h, num_H, num);
214 1.1 cgd if (num == 0)
215 1.1 cgd lucky("");
216 1.1 cgd else
217 1.1 cgd cur_p->money -= num;
218 1.1 cgd break;
219 1.1 cgd case GOJF: /* get-out-of-jail-free card */
220 1.1 cgd cur_p->num_gojf++;
221 1.1 cgd dp->gojf_used = TRUE;
222 1.1 cgd break;
223 1.1 cgd }
224 1.1 cgd spec = FALSE;
225 1.1 cgd }
226 1.4 christos
227 1.1 cgd /*
228 1.1 cgd * This routine prints out the message on the card
229 1.1 cgd */
230 1.4 christos static void
231 1.7 simonb printmes()
232 1.7 simonb {
233 1.7 simonb char c;
234 1.1 cgd
235 1.1 cgd printline();
236 1.1 cgd fflush(stdout);
237 1.1 cgd while ((c = getc(deckf)) != '\0')
238 1.1 cgd putchar(c);
239 1.1 cgd printline();
240 1.1 cgd fflush(stdout);
241 1.1 cgd }
242