misc.c revision 1.3 1 1.1 cgd /*
2 1.3 jtc * Copyright (c) 1983, 1993
3 1.3 jtc * The Regents of the University of California. 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.3 jtc /*static char sccsid[] = "from: @(#)misc.c 8.1 (Berkeley) 5/31/93";*/
36 1.3 jtc static char rcsid[] = "$Id: misc.c,v 1.3 1994/05/12 17:39:35 jtc Exp $";
37 1.1 cgd #endif /* not lint */
38 1.1 cgd
39 1.3 jtc #include <sys/file.h>
40 1.3 jtc #include <termios.h>
41 1.3 jtc
42 1.1 cgd #include "mille.h"
43 1.1 cgd #ifndef unctrl
44 1.1 cgd #include "unctrl.h"
45 1.1 cgd #endif
46 1.1 cgd
47 1.1 cgd
48 1.1 cgd # ifdef attron
49 1.1 cgd # include <term.h>
50 1.1 cgd # define _tty cur_term->Nttyb
51 1.1 cgd # endif attron
52 1.1 cgd
53 1.1 cgd /*
54 1.1 cgd * @(#)misc.c 1.2 (Berkeley) 3/28/83
55 1.1 cgd */
56 1.1 cgd
57 1.1 cgd #define NUMSAFE 4
58 1.1 cgd
59 1.1 cgd /* VARARGS1 */
60 1.1 cgd error(str, arg)
61 1.1 cgd char *str;
62 1.1 cgd {
63 1.1 cgd stdscr = Score;
64 1.1 cgd mvprintw(ERR_Y, ERR_X, str, arg);
65 1.1 cgd clrtoeol();
66 1.1 cgd putchar('\07');
67 1.1 cgd refresh();
68 1.1 cgd stdscr = Board;
69 1.1 cgd return FALSE;
70 1.1 cgd }
71 1.1 cgd
72 1.1 cgd CARD
73 1.1 cgd getcard()
74 1.1 cgd {
75 1.1 cgd reg int c, c1;
76 1.1 cgd
77 1.1 cgd for (;;) {
78 1.1 cgd while ((c = readch()) == '\n' || c == '\r' || c == ' ')
79 1.1 cgd continue;
80 1.1 cgd if (islower(c))
81 1.1 cgd c = toupper(c);
82 1.1 cgd if (c == killchar() || c == erasechar())
83 1.1 cgd return -1;
84 1.1 cgd addstr(unctrl(c));
85 1.1 cgd clrtoeol();
86 1.1 cgd switch (c) {
87 1.1 cgd case '1': case '2': case '3':
88 1.1 cgd case '4': case '5': case '6':
89 1.1 cgd c -= '0';
90 1.1 cgd break;
91 1.1 cgd case '0': case 'P': case 'p':
92 1.1 cgd c = 0;
93 1.1 cgd break;
94 1.1 cgd default:
95 1.1 cgd putchar('\07');
96 1.1 cgd addch('\b');
97 1.1 cgd if (!isprint(c))
98 1.1 cgd addch('\b');
99 1.1 cgd c = -1;
100 1.1 cgd break;
101 1.1 cgd }
102 1.1 cgd refresh();
103 1.1 cgd if (c >= 0) {
104 1.1 cgd while ((c1=readch()) != '\r' && c1 != '\n' && c1 != ' ')
105 1.1 cgd if (c1 == killchar())
106 1.1 cgd return -1;
107 1.1 cgd else if (c1 == erasechar()) {
108 1.1 cgd addch('\b');
109 1.1 cgd clrtoeol();
110 1.1 cgd refresh();
111 1.1 cgd goto cont;
112 1.1 cgd }
113 1.1 cgd else
114 1.1 cgd write(0, "\07", 1);
115 1.1 cgd return c;
116 1.1 cgd }
117 1.1 cgd cont: ;
118 1.1 cgd }
119 1.1 cgd }
120 1.1 cgd
121 1.1 cgd check_ext(forcomp)
122 1.1 cgd reg bool forcomp; {
123 1.1 cgd
124 1.1 cgd
125 1.1 cgd if (End == 700)
126 1.1 cgd if (Play == PLAYER) {
127 1.1 cgd if (getyn(EXTENSIONPROMPT)) {
128 1.1 cgd extend:
129 1.1 cgd if (!forcomp)
130 1.1 cgd End = 1000;
131 1.1 cgd return TRUE;
132 1.1 cgd }
133 1.1 cgd else {
134 1.1 cgd done:
135 1.1 cgd if (!forcomp)
136 1.1 cgd Finished = TRUE;
137 1.1 cgd return FALSE;
138 1.1 cgd }
139 1.1 cgd }
140 1.1 cgd else {
141 1.1 cgd reg PLAY *pp, *op;
142 1.1 cgd reg int i, safe, miles;
143 1.1 cgd
144 1.1 cgd pp = &Player[COMP];
145 1.1 cgd op = &Player[PLAYER];
146 1.1 cgd for (safe = 0, i = 0; i < NUMSAFE; i++)
147 1.1 cgd if (pp->safety[i] != S_UNKNOWN)
148 1.1 cgd safe++;
149 1.1 cgd if (safe < 2)
150 1.1 cgd goto done;
151 1.1 cgd if (op->mileage == 0 || onecard(op)
152 1.1 cgd || (op->can_go && op->mileage >= 500))
153 1.1 cgd goto done;
154 1.1 cgd for (miles = 0, i = 0; i < NUMSAFE; i++)
155 1.1 cgd if (op->safety[i] != S_PLAYED
156 1.1 cgd && pp->safety[i] == S_UNKNOWN)
157 1.1 cgd miles++;
158 1.1 cgd if (miles + safe == NUMSAFE)
159 1.1 cgd goto extend;
160 1.1 cgd for (miles = 0, i = 0; i < HAND_SZ; i++)
161 1.1 cgd if ((safe = pp->hand[i]) <= C_200)
162 1.1 cgd miles += Value[safe];
163 1.1 cgd if (miles + (Topcard - Deck) * 3 > 1000)
164 1.1 cgd goto extend;
165 1.1 cgd goto done;
166 1.1 cgd }
167 1.1 cgd else
168 1.1 cgd goto done;
169 1.1 cgd }
170 1.1 cgd
171 1.1 cgd /*
172 1.1 cgd * Get a yes or no answer to the given question. Saves are
173 1.1 cgd * also allowed. Return TRUE if the answer was yes, FALSE if no.
174 1.1 cgd */
175 1.1 cgd getyn(promptno)
176 1.1 cgd register int promptno; {
177 1.1 cgd
178 1.1 cgd reg char c;
179 1.1 cgd
180 1.1 cgd Saved = FALSE;
181 1.1 cgd for (;;) {
182 1.1 cgd leaveok(Board, FALSE);
183 1.1 cgd prompt(promptno);
184 1.1 cgd clrtoeol();
185 1.1 cgd refresh();
186 1.1 cgd switch (c = readch()) {
187 1.1 cgd case 'n': case 'N':
188 1.1 cgd addch('N');
189 1.1 cgd refresh();
190 1.1 cgd leaveok(Board, TRUE);
191 1.1 cgd return FALSE;
192 1.1 cgd case 'y': case 'Y':
193 1.1 cgd addch('Y');
194 1.1 cgd refresh();
195 1.1 cgd leaveok(Board, TRUE);
196 1.1 cgd return TRUE;
197 1.1 cgd case 's': case 'S':
198 1.1 cgd addch('S');
199 1.1 cgd refresh();
200 1.1 cgd Saved = save();
201 1.1 cgd continue;
202 1.3 jtc case CTRL('L'):
203 1.3 jtc wrefresh(curscr);
204 1.3 jtc break;
205 1.1 cgd default:
206 1.1 cgd addstr(unctrl(c));
207 1.1 cgd refresh();
208 1.1 cgd putchar('\07');
209 1.1 cgd break;
210 1.1 cgd }
211 1.1 cgd }
212 1.1 cgd }
213 1.1 cgd
214 1.1 cgd /*
215 1.1 cgd * Check to see if more games are desired. If not, and game
216 1.1 cgd * came from a saved file, make sure that they don't want to restore
217 1.1 cgd * it. Exit appropriately.
218 1.1 cgd */
219 1.1 cgd check_more() {
220 1.1 cgd
221 1.1 cgd On_exit = TRUE;
222 1.1 cgd if (Player[PLAYER].total >= 5000 || Player[COMP].total >= 5000)
223 1.1 cgd if (getyn(ANOTHERGAMEPROMPT))
224 1.1 cgd return;
225 1.1 cgd else {
226 1.1 cgd /*
227 1.1 cgd * must do accounting normally done in main()
228 1.1 cgd */
229 1.1 cgd if (Player[PLAYER].total > Player[COMP].total)
230 1.1 cgd Player[PLAYER].games++;
231 1.1 cgd else if (Player[PLAYER].total < Player[COMP].total)
232 1.1 cgd Player[COMP].games++;
233 1.1 cgd Player[COMP].total = 0;
234 1.1 cgd Player[PLAYER].total = 0;
235 1.1 cgd }
236 1.1 cgd else
237 1.1 cgd if (getyn(ANOTHERHANDPROMPT))
238 1.1 cgd return;
239 1.1 cgd if (!Saved && getyn(SAVEGAMEPROMPT))
240 1.1 cgd if (!save())
241 1.1 cgd return;
242 1.3 jtc die(0);
243 1.1 cgd }
244 1.1 cgd
245 1.1 cgd readch()
246 1.1 cgd {
247 1.1 cgd reg int cnt;
248 1.1 cgd static char c;
249 1.1 cgd
250 1.1 cgd for (cnt = 0; read(0, &c, 1) <= 0; cnt++)
251 1.1 cgd if (cnt > 100)
252 1.1 cgd exit(1);
253 1.1 cgd return c;
254 1.1 cgd }
255