init.c revision 1.7 1 1.7 lukem /* $NetBSD: init.c,v 1.7 1997/10/12 00:53:59 lukem Exp $ */
2 1.5 cgd
3 1.1 cgd /*
4 1.4 jtc * Copyright (c) 1982, 1993
5 1.4 jtc * 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.7 lukem #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.5 cgd #if 0
39 1.5 cgd static char sccsid[] = "@(#)init.c 8.1 (Berkeley) 5/31/93";
40 1.5 cgd #else
41 1.7 lukem __RCSID("$NetBSD: init.c,v 1.7 1997/10/12 00:53:59 lukem Exp $");
42 1.5 cgd #endif
43 1.1 cgd #endif /* not lint */
44 1.1 cgd
45 1.1 cgd # include "mille.h"
46 1.1 cgd
47 1.1 cgd /*
48 1.1 cgd * @(#)init.c 1.1 (Berkeley) 4/1/82
49 1.1 cgd */
50 1.1 cgd
51 1.7 lukem void
52 1.7 lukem init()
53 1.7 lukem {
54 1.7 lukem PLAY *pp;
55 1.7 lukem int i, j;
56 1.7 lukem CARD card;
57 1.1 cgd
58 1.7 lukem memset(Numseen, 0, sizeof Numseen);
59 1.1 cgd Numgos = 0;
60 1.1 cgd
61 1.1 cgd for (i = 0; i < 2; i++) {
62 1.1 cgd pp = &Player[i];
63 1.1 cgd pp->hand[0] = C_INIT;
64 1.1 cgd for (j = 0; j < NUM_SAFE; j++) {
65 1.1 cgd pp->safety[j] = S_UNKNOWN;
66 1.1 cgd pp->coups[j] = FALSE;
67 1.1 cgd }
68 1.1 cgd for (j = 1; j < HAND_SZ; j++) {
69 1.1 cgd pp->hand[j] = *--Topcard;
70 1.1 cgd if (i == COMP) {
71 1.1 cgd account(card = *Topcard);
72 1.1 cgd if (issafety(card))
73 1.1 cgd pp->safety[card - S_CONV] = S_IN_HAND;
74 1.1 cgd }
75 1.1 cgd }
76 1.1 cgd pp->mileage = 0;
77 1.1 cgd pp->hand_tot = 0;
78 1.1 cgd pp->safescore = 0;
79 1.1 cgd pp->coupscore = 0;
80 1.1 cgd pp->can_go = FALSE;
81 1.1 cgd pp->speed = C_INIT;
82 1.1 cgd pp->battle = C_INIT;
83 1.1 cgd pp->new_speed = FALSE;
84 1.1 cgd pp->new_battle = FALSE;
85 1.1 cgd for (j = 0; j < NUM_MILES; j++)
86 1.1 cgd pp->nummiles[j] = 0;
87 1.1 cgd }
88 1.1 cgd if (Order)
89 1.1 cgd sort(Player[PLAYER].hand);
90 1.1 cgd Discard = C_INIT;
91 1.1 cgd Finished = FALSE;
92 1.1 cgd End = 700;
93 1.1 cgd }
94 1.1 cgd
95 1.7 lukem void
96 1.7 lukem shuffle()
97 1.7 lukem {
98 1.7 lukem int i, r;
99 1.7 lukem CARD temp;
100 1.1 cgd
101 1.1 cgd for (i = 0; i < DECK_SZ; i++) {
102 1.1 cgd r = roll(1, DECK_SZ) - 1;
103 1.1 cgd if (r < 0 || r > DECK_SZ - 1) {
104 1.7 lukem warnx("shuffle: card no. error: %d", r);
105 1.4 jtc die(1);
106 1.1 cgd }
107 1.1 cgd temp = Deck[r];
108 1.1 cgd Deck[r] = Deck[i];
109 1.1 cgd Deck[i] = temp;
110 1.1 cgd }
111 1.1 cgd Topcard = &Deck[DECK_SZ];
112 1.1 cgd }
113 1.1 cgd
114 1.7 lukem void
115 1.7 lukem newboard()
116 1.7 lukem {
117 1.7 lukem int i;
118 1.7 lukem PLAY *pp;
119 1.1 cgd static int first = TRUE;
120 1.1 cgd
121 1.1 cgd if (first) {
122 1.1 cgd werase(Board);
123 1.1 cgd werase(Score);
124 1.1 cgd mvaddstr(5, 0, "--HAND--");
125 1.1 cgd mvaddch(6, 0, 'P');
126 1.1 cgd mvaddch(7, 0, '1');
127 1.1 cgd mvaddch(8, 0, '2');
128 1.1 cgd mvaddch(9, 0, '3');
129 1.1 cgd mvaddch(10, 0, '4');
130 1.1 cgd mvaddch(11, 0, '5');
131 1.1 cgd mvaddch(12, 0, '6');
132 1.1 cgd mvaddstr(13, 0, "--BATTLE--");
133 1.1 cgd mvaddstr(15, 0, "--SPEED--");
134 1.1 cgd mvaddstr(5, 20, "--DECK--");
135 1.1 cgd mvaddstr(7, 20, "--DISCARD--");
136 1.1 cgd mvaddstr(13, 20, "--BATTLE--");
137 1.1 cgd mvaddstr(15, 20, "--SPEED--");
138 1.1 cgd mvwaddstr(Miles, 0, 0, "--MILEAGE--");
139 1.1 cgd mvwaddstr(Miles, 0, 41, "--MILEAGE--");
140 1.1 cgd Sh_discard = -1;
141 1.1 cgd for (pp = Player; pp <= &Player[COMP]; pp++) {
142 1.1 cgd for (i = 0; i < HAND_SZ; i++)
143 1.1 cgd pp->sh_hand[i] = -1;
144 1.1 cgd pp->sh_battle = -1;
145 1.1 cgd pp->sh_speed = -1;
146 1.1 cgd pp->sh_mileage = -1;
147 1.1 cgd }
148 1.1 cgd first = FALSE;
149 1.1 cgd }
150 1.1 cgd else {
151 1.1 cgd for (i = 0; i < 5; i++) {
152 1.1 cgd move(i, 0);
153 1.1 cgd clrtoeol();
154 1.1 cgd }
155 1.1 cgd wmove(Miles, 1, 0);
156 1.1 cgd wclrtobot(Miles);
157 1.1 cgd wmove(Board, MOVE_Y + 1, MOVE_X);
158 1.1 cgd wclrtoeol(Board);
159 1.1 cgd wmove(Board, MOVE_Y + 2, MOVE_X);
160 1.1 cgd wclrtoeol(Board);
161 1.1 cgd }
162 1.1 cgd Sh_discard = -1;
163 1.1 cgd for (pp = Player; pp <= &Player[COMP]; pp++) {
164 1.1 cgd for (i = 0; i < NUM_SAFE; i++)
165 1.1 cgd pp->sh_safety[i] = FALSE;
166 1.1 cgd for (i = 0; i < NUM_MILES; i++)
167 1.1 cgd pp->sh_nummiles[i] = 0;
168 1.1 cgd pp->sh_safescore = -1;
169 1.1 cgd }
170 1.1 cgd newscore();
171 1.1 cgd }
172 1.1 cgd
173 1.7 lukem void
174 1.7 lukem newscore()
175 1.7 lukem {
176 1.7 lukem int i, new;
177 1.7 lukem PLAY *pp;
178 1.1 cgd static int was_full = -1;
179 1.1 cgd static int last_win = -1;
180 1.1 cgd
181 1.1 cgd if (was_full < 0)
182 1.1 cgd was_full = (Window != W_FULL);
183 1.1 cgd stdscr = Score;
184 1.1 cgd move(0, 22);
185 1.1 cgd new = FALSE;
186 1.1 cgd if (inch() != 'Y') {
187 1.1 cgd erase();
188 1.1 cgd mvaddstr(0, 22, "You Comp Value");
189 1.1 cgd mvaddstr(1, 2, "Milestones Played");
190 1.1 cgd mvaddstr(2, 8, "Each Safety");
191 1.1 cgd mvaddstr(3, 5, "All 4 Safeties");
192 1.1 cgd mvaddstr(4, 3, "Each Coup Fourre");
193 1.1 cgd mvaddstr(2, 37, "100");
194 1.1 cgd mvaddstr(3, 37, "300");
195 1.1 cgd mvaddstr(4, 37, "300");
196 1.1 cgd new = TRUE;
197 1.1 cgd }
198 1.4 jtc else if ((Window == W_FULL || Finished) ^ was_full) {
199 1.1 cgd move(5, 1);
200 1.1 cgd clrtobot();
201 1.1 cgd new = TRUE;
202 1.1 cgd }
203 1.1 cgd else if (Window != last_win)
204 1.1 cgd new = TRUE;
205 1.1 cgd if (new) {
206 1.1 cgd for (i = 0; i < SCORE_Y; i++)
207 1.1 cgd mvaddch(i, 0, '|');
208 1.1 cgd move(SCORE_Y - 1, 1);
209 1.4 jtc for (i = 0; i < SCORE_X; i++)
210 1.3 mycroft addch('_');
211 1.1 cgd for (pp = Player; pp <= &Player[COMP]; pp++) {
212 1.1 cgd pp->sh_hand_tot = -1;
213 1.1 cgd pp->sh_total = -1;
214 1.1 cgd pp->sh_games = -1;
215 1.1 cgd pp->sh_safescore = -1;
216 1.1 cgd }
217 1.1 cgd }
218 1.1 cgd Player[PLAYER].was_finished = !Finished;
219 1.1 cgd Player[COMP].was_finished = !Finished;
220 1.1 cgd if (Window == W_FULL || Finished) {
221 1.1 cgd if (!was_full || new) {
222 1.1 cgd mvaddstr(5, 5, "Trip Completed");
223 1.1 cgd mvaddstr(6, 10, "Safe Trip");
224 1.1 cgd mvaddstr(7, 5, "Delayed Action");
225 1.1 cgd mvaddstr(8, 10, "Extension");
226 1.1 cgd mvaddstr(9, 11, "Shut-Out");
227 1.1 cgd mvaddstr(10, 21, "---- ---- -----");
228 1.1 cgd mvaddstr(11, 9, "Hand Total");
229 1.1 cgd mvaddstr(12, 20, "----- -----");
230 1.1 cgd mvaddstr(13, 6, "Overall Total");
231 1.1 cgd mvaddstr(14, 15, "Games");
232 1.1 cgd mvaddstr(5, 37, "400");
233 1.1 cgd mvaddstr(6, 37, "300");
234 1.1 cgd mvaddstr(7, 37, "300");
235 1.1 cgd mvaddstr(8, 37, "200");
236 1.1 cgd mvaddstr(9, 37, "500");
237 1.1 cgd }
238 1.1 cgd }
239 1.1 cgd else
240 1.1 cgd if (was_full || new) {
241 1.1 cgd mvaddstr(5, 21, "---- ---- -----");
242 1.1 cgd mvaddstr(6, 9, "Hand Total");
243 1.1 cgd mvaddstr(7, 20, "----- -----");
244 1.1 cgd mvaddstr(8, 6, "Overall Total");
245 1.1 cgd mvaddstr(9, 15, "Games");
246 1.1 cgd mvaddstr(11, 2, "p: pick");
247 1.1 cgd mvaddstr(12, 2, "u: use #");
248 1.1 cgd mvaddstr(13, 2, "d: discard #");
249 1.1 cgd mvaddstr(14, 2, "w: toggle window");
250 1.1 cgd mvaddstr(11, 21, "q: quit");
251 1.1 cgd if (!Order)
252 1.1 cgd mvaddstr(12, 21, "o: order hand");
253 1.1 cgd else
254 1.1 cgd mvaddstr(12, 21, "o: stop ordering");
255 1.1 cgd mvaddstr(13, 21, "s: save");
256 1.1 cgd mvaddstr(14, 21, "r: reprint");
257 1.1 cgd }
258 1.1 cgd stdscr = Board;
259 1.1 cgd was_full = (Window == W_FULL || Finished);
260 1.1 cgd last_win = Window;
261 1.1 cgd }
262