misc.c revision 1.1 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1983 Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef lint
35 1.1 cgd static char sccsid[] = "@(#)misc.c 5.6 (Berkeley) 6/1/90";
36 1.1 cgd #endif /* not lint */
37 1.1 cgd
38 1.1 cgd #include "mille.h"
39 1.1 cgd #ifndef unctrl
40 1.1 cgd #include "unctrl.h"
41 1.1 cgd #endif
42 1.1 cgd
43 1.1 cgd # include <sys/file.h>
44 1.1 cgd
45 1.1 cgd # ifdef attron
46 1.1 cgd # include <term.h>
47 1.1 cgd # define _tty cur_term->Nttyb
48 1.1 cgd # endif attron
49 1.1 cgd
50 1.1 cgd /*
51 1.1 cgd * @(#)misc.c 1.2 (Berkeley) 3/28/83
52 1.1 cgd */
53 1.1 cgd
54 1.1 cgd #define NUMSAFE 4
55 1.1 cgd
56 1.1 cgd /* VARARGS1 */
57 1.1 cgd error(str, arg)
58 1.1 cgd char *str;
59 1.1 cgd {
60 1.1 cgd stdscr = Score;
61 1.1 cgd mvprintw(ERR_Y, ERR_X, str, arg);
62 1.1 cgd clrtoeol();
63 1.1 cgd putchar('\07');
64 1.1 cgd refresh();
65 1.1 cgd stdscr = Board;
66 1.1 cgd return FALSE;
67 1.1 cgd }
68 1.1 cgd
69 1.1 cgd CARD
70 1.1 cgd getcard()
71 1.1 cgd {
72 1.1 cgd reg int c, c1;
73 1.1 cgd
74 1.1 cgd for (;;) {
75 1.1 cgd while ((c = readch()) == '\n' || c == '\r' || c == ' ')
76 1.1 cgd continue;
77 1.1 cgd if (islower(c))
78 1.1 cgd c = toupper(c);
79 1.1 cgd if (c == killchar() || c == erasechar())
80 1.1 cgd return -1;
81 1.1 cgd addstr(unctrl(c));
82 1.1 cgd clrtoeol();
83 1.1 cgd switch (c) {
84 1.1 cgd case '1': case '2': case '3':
85 1.1 cgd case '4': case '5': case '6':
86 1.1 cgd c -= '0';
87 1.1 cgd break;
88 1.1 cgd case '0': case 'P': case 'p':
89 1.1 cgd c = 0;
90 1.1 cgd break;
91 1.1 cgd default:
92 1.1 cgd putchar('\07');
93 1.1 cgd addch('\b');
94 1.1 cgd if (!isprint(c))
95 1.1 cgd addch('\b');
96 1.1 cgd c = -1;
97 1.1 cgd break;
98 1.1 cgd }
99 1.1 cgd refresh();
100 1.1 cgd if (c >= 0) {
101 1.1 cgd while ((c1=readch()) != '\r' && c1 != '\n' && c1 != ' ')
102 1.1 cgd if (c1 == killchar())
103 1.1 cgd return -1;
104 1.1 cgd else if (c1 == erasechar()) {
105 1.1 cgd addch('\b');
106 1.1 cgd clrtoeol();
107 1.1 cgd refresh();
108 1.1 cgd goto cont;
109 1.1 cgd }
110 1.1 cgd else
111 1.1 cgd write(0, "\07", 1);
112 1.1 cgd return c;
113 1.1 cgd }
114 1.1 cgd cont: ;
115 1.1 cgd }
116 1.1 cgd }
117 1.1 cgd
118 1.1 cgd check_ext(forcomp)
119 1.1 cgd reg bool forcomp; {
120 1.1 cgd
121 1.1 cgd
122 1.1 cgd if (End == 700)
123 1.1 cgd if (Play == PLAYER) {
124 1.1 cgd if (getyn(EXTENSIONPROMPT)) {
125 1.1 cgd extend:
126 1.1 cgd if (!forcomp)
127 1.1 cgd End = 1000;
128 1.1 cgd return TRUE;
129 1.1 cgd }
130 1.1 cgd else {
131 1.1 cgd done:
132 1.1 cgd if (!forcomp)
133 1.1 cgd Finished = TRUE;
134 1.1 cgd return FALSE;
135 1.1 cgd }
136 1.1 cgd }
137 1.1 cgd else {
138 1.1 cgd reg PLAY *pp, *op;
139 1.1 cgd reg int i, safe, miles;
140 1.1 cgd
141 1.1 cgd pp = &Player[COMP];
142 1.1 cgd op = &Player[PLAYER];
143 1.1 cgd for (safe = 0, i = 0; i < NUMSAFE; i++)
144 1.1 cgd if (pp->safety[i] != S_UNKNOWN)
145 1.1 cgd safe++;
146 1.1 cgd if (safe < 2)
147 1.1 cgd goto done;
148 1.1 cgd if (op->mileage == 0 || onecard(op)
149 1.1 cgd || (op->can_go && op->mileage >= 500))
150 1.1 cgd goto done;
151 1.1 cgd for (miles = 0, i = 0; i < NUMSAFE; i++)
152 1.1 cgd if (op->safety[i] != S_PLAYED
153 1.1 cgd && pp->safety[i] == S_UNKNOWN)
154 1.1 cgd miles++;
155 1.1 cgd if (miles + safe == NUMSAFE)
156 1.1 cgd goto extend;
157 1.1 cgd for (miles = 0, i = 0; i < HAND_SZ; i++)
158 1.1 cgd if ((safe = pp->hand[i]) <= C_200)
159 1.1 cgd miles += Value[safe];
160 1.1 cgd if (miles + (Topcard - Deck) * 3 > 1000)
161 1.1 cgd goto extend;
162 1.1 cgd goto done;
163 1.1 cgd }
164 1.1 cgd else
165 1.1 cgd goto done;
166 1.1 cgd }
167 1.1 cgd
168 1.1 cgd /*
169 1.1 cgd * Get a yes or no answer to the given question. Saves are
170 1.1 cgd * also allowed. Return TRUE if the answer was yes, FALSE if no.
171 1.1 cgd */
172 1.1 cgd getyn(promptno)
173 1.1 cgd register int promptno; {
174 1.1 cgd
175 1.1 cgd reg char c;
176 1.1 cgd
177 1.1 cgd Saved = FALSE;
178 1.1 cgd for (;;) {
179 1.1 cgd leaveok(Board, FALSE);
180 1.1 cgd prompt(promptno);
181 1.1 cgd clrtoeol();
182 1.1 cgd refresh();
183 1.1 cgd switch (c = readch()) {
184 1.1 cgd case 'n': case 'N':
185 1.1 cgd addch('N');
186 1.1 cgd refresh();
187 1.1 cgd leaveok(Board, TRUE);
188 1.1 cgd return FALSE;
189 1.1 cgd case 'y': case 'Y':
190 1.1 cgd addch('Y');
191 1.1 cgd refresh();
192 1.1 cgd leaveok(Board, TRUE);
193 1.1 cgd return TRUE;
194 1.1 cgd case 's': case 'S':
195 1.1 cgd addch('S');
196 1.1 cgd refresh();
197 1.1 cgd Saved = save();
198 1.1 cgd continue;
199 1.1 cgd default:
200 1.1 cgd addstr(unctrl(c));
201 1.1 cgd refresh();
202 1.1 cgd putchar('\07');
203 1.1 cgd break;
204 1.1 cgd }
205 1.1 cgd }
206 1.1 cgd }
207 1.1 cgd
208 1.1 cgd /*
209 1.1 cgd * Check to see if more games are desired. If not, and game
210 1.1 cgd * came from a saved file, make sure that they don't want to restore
211 1.1 cgd * it. Exit appropriately.
212 1.1 cgd */
213 1.1 cgd check_more() {
214 1.1 cgd
215 1.1 cgd flush_input();
216 1.1 cgd
217 1.1 cgd On_exit = TRUE;
218 1.1 cgd if (Player[PLAYER].total >= 5000 || Player[COMP].total >= 5000)
219 1.1 cgd if (getyn(ANOTHERGAMEPROMPT))
220 1.1 cgd return;
221 1.1 cgd else {
222 1.1 cgd /*
223 1.1 cgd * must do accounting normally done in main()
224 1.1 cgd */
225 1.1 cgd if (Player[PLAYER].total > Player[COMP].total)
226 1.1 cgd Player[PLAYER].games++;
227 1.1 cgd else if (Player[PLAYER].total < Player[COMP].total)
228 1.1 cgd Player[COMP].games++;
229 1.1 cgd Player[COMP].total = 0;
230 1.1 cgd Player[PLAYER].total = 0;
231 1.1 cgd }
232 1.1 cgd else
233 1.1 cgd if (getyn(ANOTHERHANDPROMPT))
234 1.1 cgd return;
235 1.1 cgd if (!Saved && getyn(SAVEGAMEPROMPT))
236 1.1 cgd if (!save())
237 1.1 cgd return;
238 1.1 cgd die();
239 1.1 cgd }
240 1.1 cgd
241 1.1 cgd readch()
242 1.1 cgd {
243 1.1 cgd reg int cnt;
244 1.1 cgd static char c;
245 1.1 cgd
246 1.1 cgd for (cnt = 0; read(0, &c, 1) <= 0; cnt++)
247 1.1 cgd if (cnt > 100)
248 1.1 cgd exit(1);
249 1.1 cgd return c;
250 1.1 cgd }
251 1.1 cgd
252 1.1 cgd flush_input()
253 1.1 cgd {
254 1.1 cgd # ifdef TIOCFLUSH
255 1.1 cgd static int ioctl_args = O_RDONLY;
256 1.1 cgd
257 1.1 cgd (void) ioctl(fileno(stdin), TIOCFLUSH, &ioctl_args);
258 1.1 cgd # else
259 1.1 cgd fflush(stdin);
260 1.1 cgd # endif
261 1.1 cgd }
262