print.c revision 1.3 1 1.3 cgd /* $NetBSD: print.c,v 1.3 1995/03/23 08:35:05 cgd 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.1 cgd #ifndef lint
37 1.3 cgd #if 0
38 1.3 cgd static char sccsid[] = "@(#)print.c 8.1 (Berkeley) 5/31/93";
39 1.3 cgd #else
40 1.3 cgd static char rcsid[] = "$NetBSD: print.c,v 1.3 1995/03/23 08:35:05 cgd Exp $";
41 1.3 cgd #endif
42 1.1 cgd #endif /* not lint */
43 1.1 cgd
44 1.1 cgd # include "monop.ext"
45 1.1 cgd
46 1.1 cgd static char buf[80], /* output buffer */
47 1.1 cgd *header = "Name Own Price Mg # Rent";
48 1.1 cgd
49 1.1 cgd /*
50 1.1 cgd * This routine prints out the current board
51 1.1 cgd */
52 1.1 cgd printboard() {
53 1.1 cgd
54 1.1 cgd reg int i;
55 1.1 cgd
56 1.1 cgd printf("%s\t%s\n", header, header);
57 1.1 cgd for (i = 0; i < N_SQRS/2; i++) {
58 1.1 cgd printsq(i, FALSE);
59 1.1 cgd putchar('\t');
60 1.1 cgd printsq(i+N_SQRS/2, TRUE);
61 1.1 cgd }
62 1.1 cgd }
63 1.1 cgd /*
64 1.1 cgd * This routine lists where each player is.
65 1.1 cgd */
66 1.1 cgd where() {
67 1.1 cgd
68 1.1 cgd reg int i;
69 1.1 cgd char *bsp;
70 1.1 cgd
71 1.1 cgd printf("%s Player\n", header);
72 1.1 cgd for (i = 0; i < num_play; i++) {
73 1.1 cgd printsq(play[i].loc, FALSE);
74 1.1 cgd printf(" %s (%d)", play[i].name, i+1);
75 1.1 cgd if (cur_p == &play[i])
76 1.1 cgd printf(" *");
77 1.1 cgd putchar('\n');
78 1.1 cgd }
79 1.1 cgd }
80 1.1 cgd /*
81 1.1 cgd * This routine prints out an individual square
82 1.1 cgd */
83 1.1 cgd printsq(sqn, eoln)
84 1.1 cgd int sqn;
85 1.1 cgd reg bool eoln; {
86 1.1 cgd
87 1.1 cgd reg int rnt;
88 1.1 cgd reg PROP *pp;
89 1.1 cgd reg SQUARE *sqp;
90 1.1 cgd int i;
91 1.1 cgd
92 1.1 cgd sqp = &board[sqn];
93 1.1 cgd printf("%-10.10s", sqp->name);
94 1.1 cgd switch (sqp->type) {
95 1.1 cgd case SAFE:
96 1.1 cgd case CC:
97 1.1 cgd case CHANCE:
98 1.1 cgd case INC_TAX:
99 1.1 cgd case GOTO_J:
100 1.1 cgd case LUX_TAX:
101 1.1 cgd case IN_JAIL:
102 1.1 cgd spec:
103 1.1 cgd if (!eoln)
104 1.1 cgd printf(" ");
105 1.1 cgd break;
106 1.1 cgd case PRPTY:
107 1.1 cgd pp = sqp->desc;
108 1.1 cgd if (sqp->owner < 0) {
109 1.1 cgd printf(" - %-8.8s %3d", pp->mon_desc->name, sqp->cost);
110 1.1 cgd if (!eoln)
111 1.1 cgd printf(" ");
112 1.1 cgd break;
113 1.1 cgd }
114 1.1 cgd printf(" %d %-8.8s %3d", sqp->owner+1, pp->mon_desc->name,
115 1.1 cgd sqp->cost);
116 1.1 cgd printmorg(sqp);
117 1.1 cgd if (pp->monop) {
118 1.1 cgd if (pp->houses < 5)
119 1.1 cgd if (pp->houses > 0)
120 1.1 cgd printf("%d %4d", pp->houses,
121 1.1 cgd pp->rent[pp->houses]);
122 1.1 cgd else
123 1.1 cgd printf("0 %4d", pp->rent[0] * 2);
124 1.1 cgd else
125 1.1 cgd printf("H %4d", pp->rent[5]);
126 1.1 cgd }
127 1.1 cgd else
128 1.1 cgd printf(" %4d", pp->rent[0]);
129 1.1 cgd break;
130 1.1 cgd case UTIL:
131 1.1 cgd if (sqp->owner < 0) {
132 1.1 cgd printf(" - 150");
133 1.1 cgd if (!eoln)
134 1.1 cgd printf(" ");
135 1.1 cgd break;
136 1.1 cgd }
137 1.1 cgd printf(" %d 150", sqp->owner+1);
138 1.1 cgd printmorg(sqp);
139 1.1 cgd printf("%d", play[sqp->owner].num_util);
140 1.1 cgd if (!eoln)
141 1.1 cgd printf(" ");
142 1.1 cgd break;
143 1.1 cgd case RR:
144 1.1 cgd if (sqp->owner < 0) {
145 1.1 cgd printf(" - Railroad 200");
146 1.1 cgd if (!eoln)
147 1.1 cgd printf(" ");
148 1.1 cgd break;
149 1.1 cgd }
150 1.1 cgd printf(" %d Railroad 200", sqp->owner+1);
151 1.1 cgd printmorg(sqp);
152 1.1 cgd rnt = 25;
153 1.1 cgd rnt <<= play[sqp->owner].num_rr - 1;
154 1.1 cgd printf("%d %4d", play[sqp->owner].num_rr, 25 << (play[sqp->owner].num_rr - 1));
155 1.1 cgd break;
156 1.1 cgd }
157 1.1 cgd if (eoln)
158 1.1 cgd putchar('\n');
159 1.1 cgd }
160 1.1 cgd /*
161 1.1 cgd * This routine prints out the mortgage flag.
162 1.1 cgd */
163 1.1 cgd printmorg(sqp)
164 1.1 cgd reg SQUARE *sqp; {
165 1.1 cgd
166 1.1 cgd if (sqp->desc->morg)
167 1.1 cgd printf(" * ");
168 1.1 cgd else
169 1.1 cgd printf(" ");
170 1.1 cgd }
171 1.1 cgd /*
172 1.1 cgd * This routine lists the holdings of the player given
173 1.1 cgd */
174 1.1 cgd printhold(pl)
175 1.1 cgd reg int pl; {
176 1.1 cgd
177 1.1 cgd reg OWN *op;
178 1.1 cgd reg PLAY *pp;
179 1.1 cgd char *bsp;
180 1.1 cgd
181 1.1 cgd pp = &play[pl];
182 1.1 cgd printf("%s's (%d) holdings (Total worth: $%d):\n", name_list[pl], pl+1,
183 1.1 cgd pp->money + prop_worth(pp));
184 1.1 cgd printf("\t$%d", pp->money);
185 1.1 cgd if (pp->num_gojf) {
186 1.1 cgd printf(", %d get-out-of-jail-free card", pp->num_gojf);
187 1.1 cgd if (pp->num_gojf > 1)
188 1.1 cgd putchar('s');
189 1.1 cgd }
190 1.1 cgd putchar('\n');
191 1.1 cgd if (pp->own_list) {
192 1.1 cgd printf("\t%s\n", header);
193 1.1 cgd for (op = pp->own_list; op; op = op->next) {
194 1.1 cgd putchar('\t');
195 1.1 cgd printsq(sqnum(op->sqr), TRUE);
196 1.1 cgd }
197 1.1 cgd }
198 1.1 cgd }
199