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