io.c revision 1.14 1 1.14 jsm /* $NetBSD: io.c,v 1.14 1999/09/30 18:01:32 jsm Exp $ */
2 1.7 cgd
3 1.7 cgd /*-
4 1.7 cgd * Copyright (c) 1980, 1993
5 1.7 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.10 lukem #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.7 cgd #if 0
39 1.7 cgd static char sccsid[] = "@(#)io.c 8.1 (Berkeley) 5/31/93";
40 1.7 cgd #else
41 1.14 jsm __RCSID("$NetBSD: io.c,v 1.14 1999/09/30 18:01:32 jsm Exp $");
42 1.7 cgd #endif
43 1.1 cgd #endif /* not lint */
44 1.1 cgd
45 1.7 cgd #include <ctype.h>
46 1.7 cgd #include <curses.h>
47 1.7 cgd #include <signal.h>
48 1.7 cgd #include <stdlib.h>
49 1.7 cgd #include <string.h>
50 1.7 cgd #include <termios.h>
51 1.7 cgd #include <unistd.h>
52 1.7 cgd
53 1.7 cgd #if __STDC__
54 1.7 cgd #include <stdarg.h>
55 1.7 cgd #else
56 1.7 cgd #include <varargs.h>
57 1.7 cgd #endif
58 1.1 cgd
59 1.7 cgd #include "deck.h"
60 1.7 cgd #include "cribbage.h"
61 1.7 cgd #include "cribcur.h"
62 1.1 cgd
63 1.7 cgd #define LINESIZE 128
64 1.1 cgd
65 1.7 cgd #ifdef CTRL
66 1.7 cgd #undef CTRL
67 1.7 cgd #endif
68 1.7 cgd #define CTRL(X) (X - 'A' + 1)
69 1.6 mycroft
70 1.7 cgd char linebuf[LINESIZE];
71 1.6 mycroft
72 1.11 jsm const char *const rankname[RANKS] = {
73 1.7 cgd "ACE", "TWO", "THREE", "FOUR", "FIVE", "SIX", "SEVEN",
74 1.7 cgd "EIGHT", "NINE", "TEN", "JACK", "QUEEN", "KING"
75 1.7 cgd };
76 1.6 mycroft
77 1.11 jsm const char *const rankchar[RANKS] = {
78 1.7 cgd "A", "2", "3", "4", "5", "6", "7", "8", "9", "T", "J", "Q", "K"
79 1.7 cgd };
80 1.6 mycroft
81 1.11 jsm const char *const suitname[SUITS] = {"SPADES", "HEARTS", "DIAMONDS", "CLUBS"};
82 1.6 mycroft
83 1.11 jsm const char *const suitchar[SUITS] = {"S", "H", "D", "C"};
84 1.6 mycroft
85 1.6 mycroft /*
86 1.1 cgd * msgcard:
87 1.1 cgd * Call msgcrd in one of two forms
88 1.1 cgd */
89 1.7 cgd int
90 1.1 cgd msgcard(c, brief)
91 1.7 cgd CARD c;
92 1.7 cgd BOOLEAN brief;
93 1.1 cgd {
94 1.1 cgd if (brief)
95 1.7 cgd return (msgcrd(c, TRUE, NULL, TRUE));
96 1.1 cgd else
97 1.7 cgd return (msgcrd(c, FALSE, " of ", FALSE));
98 1.1 cgd }
99 1.1 cgd
100 1.1 cgd /*
101 1.1 cgd * msgcrd:
102 1.1 cgd * Print the value of a card in ascii
103 1.1 cgd */
104 1.7 cgd int
105 1.1 cgd msgcrd(c, brfrank, mid, brfsuit)
106 1.7 cgd CARD c;
107 1.7 cgd BOOLEAN brfrank, brfsuit;
108 1.11 jsm const char *mid;
109 1.1 cgd {
110 1.1 cgd if (c.rank == EMPTY || c.suit == EMPTY)
111 1.7 cgd return (FALSE);
112 1.1 cgd if (brfrank)
113 1.7 cgd addmsg("%1.1s", rankchar[c.rank]);
114 1.1 cgd else
115 1.7 cgd addmsg(rankname[c.rank]);
116 1.1 cgd if (mid != NULL)
117 1.7 cgd addmsg(mid);
118 1.1 cgd if (brfsuit)
119 1.7 cgd addmsg("%1.1s", suitchar[c.suit]);
120 1.1 cgd else
121 1.7 cgd addmsg(suitname[c.suit]);
122 1.7 cgd return (TRUE);
123 1.1 cgd }
124 1.1 cgd
125 1.1 cgd /*
126 1.1 cgd * printcard:
127 1.1 cgd * Print out a card.
128 1.1 cgd */
129 1.7 cgd void
130 1.1 cgd printcard(win, cardno, c, blank)
131 1.7 cgd WINDOW *win;
132 1.7 cgd int cardno;
133 1.7 cgd CARD c;
134 1.7 cgd BOOLEAN blank;
135 1.1 cgd {
136 1.1 cgd prcard(win, cardno * 2, cardno, c, blank);
137 1.1 cgd }
138 1.1 cgd
139 1.1 cgd /*
140 1.1 cgd * prcard:
141 1.1 cgd * Print out a card on the window at the specified location
142 1.1 cgd */
143 1.7 cgd void
144 1.1 cgd prcard(win, y, x, c, blank)
145 1.7 cgd WINDOW *win;
146 1.7 cgd int y, x;
147 1.7 cgd CARD c;
148 1.7 cgd BOOLEAN blank;
149 1.1 cgd {
150 1.1 cgd if (c.rank == EMPTY)
151 1.7 cgd return;
152 1.7 cgd
153 1.1 cgd mvwaddstr(win, y + 0, x, "+-----+");
154 1.1 cgd mvwaddstr(win, y + 1, x, "| |");
155 1.1 cgd mvwaddstr(win, y + 2, x, "| |");
156 1.1 cgd mvwaddstr(win, y + 3, x, "| |");
157 1.1 cgd mvwaddstr(win, y + 4, x, "+-----+");
158 1.1 cgd if (!blank) {
159 1.1 cgd mvwaddch(win, y + 1, x + 1, rankchar[c.rank][0]);
160 1.1 cgd waddch(win, suitchar[c.suit][0]);
161 1.1 cgd mvwaddch(win, y + 3, x + 4, rankchar[c.rank][0]);
162 1.1 cgd waddch(win, suitchar[c.suit][0]);
163 1.1 cgd }
164 1.1 cgd }
165 1.1 cgd
166 1.1 cgd /*
167 1.1 cgd * prhand:
168 1.1 cgd * Print a hand of n cards
169 1.1 cgd */
170 1.7 cgd void
171 1.1 cgd prhand(h, n, win, blank)
172 1.11 jsm const CARD h[];
173 1.7 cgd int n;
174 1.7 cgd WINDOW *win;
175 1.7 cgd BOOLEAN blank;
176 1.1 cgd {
177 1.10 lukem int i;
178 1.1 cgd
179 1.1 cgd werase(win);
180 1.1 cgd for (i = 0; i < n; i++)
181 1.7 cgd printcard(win, i, *h++, blank);
182 1.1 cgd wrefresh(win);
183 1.1 cgd }
184 1.1 cgd
185 1.1 cgd /*
186 1.1 cgd * infrom:
187 1.1 cgd * reads a card, supposedly in hand, accepting unambigous brief
188 1.1 cgd * input, returns the index of the card found...
189 1.1 cgd */
190 1.7 cgd int
191 1.1 cgd infrom(hand, n, prompt)
192 1.11 jsm const CARD hand[];
193 1.7 cgd int n;
194 1.11 jsm const char *prompt;
195 1.1 cgd {
196 1.10 lukem int i, j;
197 1.7 cgd CARD crd;
198 1.1 cgd
199 1.1 cgd if (n < 1) {
200 1.7 cgd printf("\nINFROM: %d = n < 1!!\n", n);
201 1.7 cgd exit(74);
202 1.1 cgd }
203 1.1 cgd for (;;) {
204 1.7 cgd msg(prompt);
205 1.7 cgd if (incard(&crd)) { /* if card is full card */
206 1.14 jsm if (!is_one(crd, hand, n))
207 1.7 cgd msg("That's not in your hand");
208 1.7 cgd else {
209 1.7 cgd for (i = 0; i < n; i++)
210 1.7 cgd if (hand[i].rank == crd.rank &&
211 1.7 cgd hand[i].suit == crd.suit)
212 1.7 cgd break;
213 1.7 cgd if (i >= n) {
214 1.14 jsm printf("\nINFROM: is_one or something messed up\n");
215 1.7 cgd exit(77);
216 1.7 cgd }
217 1.7 cgd return (i);
218 1.7 cgd }
219 1.7 cgd } else /* if not full card... */
220 1.7 cgd if (crd.rank != EMPTY) {
221 1.7 cgd for (i = 0; i < n; i++)
222 1.7 cgd if (hand[i].rank == crd.rank)
223 1.7 cgd break;
224 1.7 cgd if (i >= n)
225 1.7 cgd msg("No such rank in your hand");
226 1.7 cgd else {
227 1.7 cgd for (j = i + 1; j < n; j++)
228 1.7 cgd if (hand[j].rank == crd.rank)
229 1.7 cgd break;
230 1.7 cgd if (j < n)
231 1.7 cgd msg("Ambiguous rank");
232 1.7 cgd else
233 1.7 cgd return (i);
234 1.7 cgd }
235 1.7 cgd } else
236 1.7 cgd msg("Sorry, I missed that");
237 1.1 cgd }
238 1.1 cgd /* NOTREACHED */
239 1.1 cgd }
240 1.1 cgd
241 1.1 cgd /*
242 1.1 cgd * incard:
243 1.1 cgd * Inputs a card in any format. It reads a line ending with a CR
244 1.1 cgd * and then parses it.
245 1.1 cgd */
246 1.7 cgd int
247 1.1 cgd incard(crd)
248 1.7 cgd CARD *crd;
249 1.1 cgd {
250 1.10 lukem int i;
251 1.7 cgd int rnk, sut;
252 1.7 cgd char *line, *p, *p1;
253 1.7 cgd BOOLEAN retval;
254 1.1 cgd
255 1.1 cgd retval = FALSE;
256 1.1 cgd rnk = sut = EMPTY;
257 1.1 cgd if (!(line = getline()))
258 1.1 cgd goto gotit;
259 1.1 cgd p = p1 = line;
260 1.8 pk while (*p1 != ' ' && *p1 != '\0')
261 1.7 cgd ++p1;
262 1.8 pk *p1++ = '\0';
263 1.8 pk if (*p == '\0')
264 1.7 cgd goto gotit;
265 1.7 cgd
266 1.7 cgd /* IMPORTANT: no real card has 2 char first name */
267 1.7 cgd if (strlen(p) == 2) { /* check for short form */
268 1.7 cgd rnk = EMPTY;
269 1.7 cgd for (i = 0; i < RANKS; i++) {
270 1.7 cgd if (*p == *rankchar[i]) {
271 1.7 cgd rnk = i;
272 1.7 cgd break;
273 1.7 cgd }
274 1.1 cgd }
275 1.7 cgd if (rnk == EMPTY)
276 1.7 cgd goto gotit; /* it's nothing... */
277 1.7 cgd ++p; /* advance to next char */
278 1.7 cgd sut = EMPTY;
279 1.7 cgd for (i = 0; i < SUITS; i++) {
280 1.7 cgd if (*p == *suitchar[i]) {
281 1.7 cgd sut = i;
282 1.7 cgd break;
283 1.7 cgd }
284 1.1 cgd }
285 1.7 cgd if (sut != EMPTY)
286 1.7 cgd retval = TRUE;
287 1.7 cgd goto gotit;
288 1.1 cgd }
289 1.1 cgd rnk = EMPTY;
290 1.7 cgd for (i = 0; i < RANKS; i++) {
291 1.7 cgd if (!strcmp(p, rankname[i]) || !strcmp(p, rankchar[i])) {
292 1.7 cgd rnk = i;
293 1.7 cgd break;
294 1.7 cgd }
295 1.1 cgd }
296 1.7 cgd if (rnk == EMPTY)
297 1.7 cgd goto gotit;
298 1.1 cgd p = p1;
299 1.8 pk while (*p1 != ' ' && *p1 != '\0')
300 1.7 cgd ++p1;
301 1.8 pk *p1++ = '\0';
302 1.8 pk if (*p == '\0')
303 1.7 cgd goto gotit;
304 1.7 cgd if (!strcmp("OF", p)) {
305 1.7 cgd p = p1;
306 1.8 pk while (*p1 != ' ' && *p1 != '\0')
307 1.7 cgd ++p1;
308 1.8 pk *p1++ = '\0';
309 1.8 pk if (*p == '\0')
310 1.7 cgd goto gotit;
311 1.1 cgd }
312 1.1 cgd sut = EMPTY;
313 1.7 cgd for (i = 0; i < SUITS; i++) {
314 1.7 cgd if (!strcmp(p, suitname[i]) || !strcmp(p, suitchar[i])) {
315 1.7 cgd sut = i;
316 1.7 cgd break;
317 1.7 cgd }
318 1.1 cgd }
319 1.7 cgd if (sut != EMPTY)
320 1.7 cgd retval = TRUE;
321 1.1 cgd gotit:
322 1.1 cgd (*crd).rank = rnk;
323 1.1 cgd (*crd).suit = sut;
324 1.7 cgd return (retval);
325 1.1 cgd }
326 1.1 cgd
327 1.1 cgd /*
328 1.1 cgd * getuchar:
329 1.1 cgd * Reads and converts to upper case
330 1.1 cgd */
331 1.7 cgd int
332 1.1 cgd getuchar()
333 1.1 cgd {
334 1.10 lukem int c;
335 1.1 cgd
336 1.1 cgd c = readchar();
337 1.1 cgd if (islower(c))
338 1.7 cgd c = toupper(c);
339 1.1 cgd waddch(Msgwin, c);
340 1.7 cgd return (c);
341 1.1 cgd }
342 1.1 cgd
343 1.1 cgd /*
344 1.1 cgd * number:
345 1.1 cgd * Reads in a decimal number and makes sure it is between "lo" and
346 1.1 cgd * "hi" inclusive.
347 1.1 cgd */
348 1.7 cgd int
349 1.1 cgd number(lo, hi, prompt)
350 1.7 cgd int lo, hi;
351 1.11 jsm const char *prompt;
352 1.1 cgd {
353 1.10 lukem char *p;
354 1.10 lukem int sum;
355 1.1 cgd
356 1.7 cgd for (sum = 0;;) {
357 1.7 cgd msg(prompt);
358 1.8 pk if (!(p = getline()) || *p == '\0') {
359 1.7 cgd msg(quiet ? "Not a number" :
360 1.7 cgd "That doesn't look like a number");
361 1.7 cgd continue;
362 1.1 cgd }
363 1.7 cgd sum = 0;
364 1.1 cgd
365 1.7 cgd if (!isdigit(*p))
366 1.7 cgd sum = lo - 1;
367 1.7 cgd else
368 1.7 cgd while (isdigit(*p)) {
369 1.7 cgd sum = 10 * sum + (*p - '0');
370 1.7 cgd ++p;
371 1.7 cgd }
372 1.7 cgd
373 1.8 pk if (*p != ' ' && *p != '\t' && *p != '\0')
374 1.7 cgd sum = lo - 1;
375 1.7 cgd if (sum >= lo && sum <= hi)
376 1.7 cgd break;
377 1.7 cgd if (sum == lo - 1)
378 1.7 cgd msg("that doesn't look like a number, try again --> ");
379 1.7 cgd else
380 1.1 cgd msg("%d is not between %d and %d inclusive, try again --> ",
381 1.7 cgd sum, lo, hi);
382 1.1 cgd }
383 1.7 cgd return (sum);
384 1.1 cgd }
385 1.1 cgd
386 1.1 cgd /*
387 1.7 cgd * msg:
388 1.7 cgd * Display a message at the top of the screen.
389 1.1 cgd */
390 1.7 cgd char Msgbuf[BUFSIZ] = {'\0'};
391 1.7 cgd int Mpos = 0;
392 1.7 cgd static int Newpos = 0;
393 1.7 cgd
394 1.7 cgd void
395 1.7 cgd #if __STDC__
396 1.7 cgd msg(const char *fmt, ...)
397 1.7 cgd #else
398 1.7 cgd msg(fmt, va_alist)
399 1.7 cgd char *fmt;
400 1.7 cgd va_dcl
401 1.7 cgd #endif
402 1.1 cgd {
403 1.7 cgd va_list ap;
404 1.1 cgd
405 1.7 cgd #if __STDC__
406 1.7 cgd va_start(ap, fmt);
407 1.7 cgd #else
408 1.7 cgd va_start(ap);
409 1.7 cgd #endif
410 1.7 cgd (void)vsprintf(&Msgbuf[Newpos], fmt, ap);
411 1.9 phil Newpos = strlen(Msgbuf);
412 1.7 cgd va_end(ap);
413 1.7 cgd endmsg();
414 1.1 cgd }
415 1.7 cgd
416 1.7 cgd /*
417 1.7 cgd * addmsg:
418 1.7 cgd * Add things to the current message
419 1.7 cgd */
420 1.7 cgd void
421 1.7 cgd #if __STDC__
422 1.7 cgd addmsg(const char *fmt, ...)
423 1.7 cgd #else
424 1.7 cgd addmsg(fmt, va_alist)
425 1.7 cgd char *fmt;
426 1.7 cgd va_dcl
427 1.1 cgd #endif
428 1.7 cgd {
429 1.7 cgd va_list ap;
430 1.7 cgd
431 1.7 cgd #if __STDC__
432 1.7 cgd va_start(ap, fmt);
433 1.7 cgd #else
434 1.7 cgd va_start(ap);
435 1.7 cgd #endif
436 1.7 cgd (void)vsprintf(&Msgbuf[Newpos], fmt, ap);
437 1.9 phil Newpos = strlen(Msgbuf);
438 1.7 cgd va_end(ap);
439 1.7 cgd }
440 1.7 cgd
441 1.7 cgd /*
442 1.7 cgd * endmsg:
443 1.7 cgd * Display a new msg.
444 1.7 cgd */
445 1.7 cgd int Lineno = 0;
446 1.7 cgd
447 1.7 cgd void
448 1.7 cgd endmsg()
449 1.7 cgd {
450 1.7 cgd static int lastline = 0;
451 1.10 lukem int len;
452 1.10 lukem char *mp, *omp;
453 1.7 cgd
454 1.7 cgd /* All messages should start with uppercase */
455 1.7 cgd mvaddch(lastline + Y_MSG_START, SCORE_X, ' ');
456 1.7 cgd if (islower(Msgbuf[0]) && Msgbuf[1] != ')')
457 1.7 cgd Msgbuf[0] = toupper(Msgbuf[0]);
458 1.7 cgd mp = Msgbuf;
459 1.7 cgd len = strlen(mp);
460 1.7 cgd if (len / MSG_X + Lineno >= MSG_Y) {
461 1.7 cgd while (Lineno < MSG_Y) {
462 1.7 cgd wmove(Msgwin, Lineno++, 0);
463 1.7 cgd wclrtoeol(Msgwin);
464 1.7 cgd }
465 1.7 cgd Lineno = 0;
466 1.7 cgd }
467 1.7 cgd mvaddch(Lineno + Y_MSG_START, SCORE_X, '*');
468 1.7 cgd lastline = Lineno;
469 1.7 cgd do {
470 1.7 cgd mvwaddstr(Msgwin, Lineno, 0, mp);
471 1.7 cgd if ((len = strlen(mp)) > MSG_X) {
472 1.7 cgd omp = mp;
473 1.7 cgd for (mp = &mp[MSG_X - 1]; *mp != ' '; mp--)
474 1.7 cgd continue;
475 1.7 cgd while (*mp == ' ')
476 1.7 cgd mp--;
477 1.7 cgd mp++;
478 1.7 cgd wmove(Msgwin, Lineno, mp - omp);
479 1.7 cgd wclrtoeol(Msgwin);
480 1.7 cgd }
481 1.7 cgd if (++Lineno >= MSG_Y)
482 1.7 cgd Lineno = 0;
483 1.7 cgd } while (len > MSG_X);
484 1.7 cgd wclrtoeol(Msgwin);
485 1.7 cgd Mpos = len;
486 1.7 cgd Newpos = 0;
487 1.7 cgd wrefresh(Msgwin);
488 1.7 cgd refresh();
489 1.7 cgd wrefresh(Msgwin);
490 1.7 cgd }
491 1.1 cgd
492 1.1 cgd /*
493 1.1 cgd * do_wait:
494 1.1 cgd * Wait for the user to type ' ' before doing anything else
495 1.1 cgd */
496 1.7 cgd void
497 1.1 cgd do_wait()
498 1.1 cgd {
499 1.11 jsm static const char prompt[] = {'-', '-', 'M', 'o', 'r', 'e', '-', '-', '\0'};
500 1.1 cgd
501 1.13 jsm if ((int)(Mpos + sizeof prompt) < MSG_X)
502 1.7 cgd wmove(Msgwin, Lineno > 0 ? Lineno - 1 : MSG_Y - 1, Mpos);
503 1.7 cgd else {
504 1.7 cgd mvwaddch(Msgwin, Lineno, 0, ' ');
505 1.7 cgd wclrtoeol(Msgwin);
506 1.7 cgd if (++Lineno >= MSG_Y)
507 1.7 cgd Lineno = 0;
508 1.7 cgd }
509 1.7 cgd waddstr(Msgwin, prompt);
510 1.7 cgd wrefresh(Msgwin);
511 1.7 cgd wait_for(' ');
512 1.1 cgd }
513 1.1 cgd
514 1.1 cgd /*
515 1.1 cgd * wait_for
516 1.1 cgd * Sit around until the guy types the right key
517 1.1 cgd */
518 1.7 cgd void
519 1.1 cgd wait_for(ch)
520 1.10 lukem int ch;
521 1.1 cgd {
522 1.10 lukem char c;
523 1.1 cgd
524 1.7 cgd if (ch == '\n')
525 1.7 cgd while ((c = readchar()) != '\n')
526 1.7 cgd continue;
527 1.7 cgd else
528 1.7 cgd while (readchar() != ch)
529 1.7 cgd continue;
530 1.1 cgd }
531 1.1 cgd
532 1.1 cgd /*
533 1.1 cgd * readchar:
534 1.1 cgd * Reads and returns a character, checking for gross input errors
535 1.1 cgd */
536 1.7 cgd int
537 1.1 cgd readchar()
538 1.1 cgd {
539 1.10 lukem int cnt;
540 1.7 cgd char c;
541 1.1 cgd
542 1.1 cgd over:
543 1.7 cgd cnt = 0;
544 1.7 cgd while (read(STDIN_FILENO, &c, sizeof(char)) <= 0)
545 1.7 cgd if (cnt++ > 100) { /* if we are getting infinite EOFs */
546 1.7 cgd bye(); /* quit the game */
547 1.7 cgd exit(1);
548 1.7 cgd }
549 1.7 cgd if (c == CTRL('L')) {
550 1.7 cgd wrefresh(curscr);
551 1.7 cgd goto over;
552 1.7 cgd }
553 1.7 cgd if (c == '\r')
554 1.7 cgd return ('\n');
555 1.7 cgd else
556 1.7 cgd return (c);
557 1.1 cgd }
558 1.1 cgd
559 1.1 cgd /*
560 1.1 cgd * getline:
561 1.1 cgd * Reads the next line up to '\n' or EOF. Multiple spaces are
562 1.1 cgd * compressed to one space; a space is inserted before a ','
563 1.1 cgd */
564 1.1 cgd char *
565 1.1 cgd getline()
566 1.1 cgd {
567 1.10 lukem char *sp;
568 1.10 lukem int c, oy, ox;
569 1.10 lukem WINDOW *oscr;
570 1.7 cgd
571 1.7 cgd oscr = stdscr;
572 1.7 cgd stdscr = Msgwin;
573 1.7 cgd getyx(stdscr, oy, ox);
574 1.7 cgd refresh();
575 1.7 cgd /* loop reading in the string, and put it in a temporary buffer */
576 1.7 cgd for (sp = linebuf; (c = readchar()) != '\n'; clrtoeol(), refresh()) {
577 1.7 cgd if (c == -1)
578 1.7 cgd continue;
579 1.7 cgd else
580 1.7 cgd if (c == erasechar()) { /* process erase character */
581 1.7 cgd if (sp > linebuf) {
582 1.10 lukem int i;
583 1.7 cgd
584 1.7 cgd sp--;
585 1.7 cgd for (i = strlen(unctrl(*sp)); i; i--)
586 1.7 cgd addch('\b');
587 1.7 cgd }
588 1.7 cgd continue;
589 1.7 cgd } else
590 1.7 cgd if (c == killchar()) { /* process kill
591 1.7 cgd * character */
592 1.7 cgd sp = linebuf;
593 1.7 cgd move(oy, ox);
594 1.7 cgd continue;
595 1.7 cgd } else
596 1.7 cgd if (sp == linebuf && c == ' ')
597 1.7 cgd continue;
598 1.7 cgd if (sp >= &linebuf[LINESIZE - 1] || !(isprint(c) || c == ' '))
599 1.7 cgd putchar(CTRL('G'));
600 1.7 cgd else {
601 1.7 cgd if (islower(c))
602 1.7 cgd c = toupper(c);
603 1.7 cgd *sp++ = c;
604 1.7 cgd addstr(unctrl(c));
605 1.7 cgd Mpos++;
606 1.7 cgd }
607 1.1 cgd }
608 1.7 cgd *sp = '\0';
609 1.7 cgd stdscr = oscr;
610 1.7 cgd return (linebuf);
611 1.1 cgd }
612 1.1 cgd
613 1.7 cgd void
614 1.7 cgd rint(signo)
615 1.12 jsm int signo __attribute__((__unused__));
616 1.1 cgd {
617 1.1 cgd bye();
618 1.1 cgd exit(1);
619 1.1 cgd }
620 1.1 cgd
621 1.1 cgd /*
622 1.1 cgd * bye:
623 1.1 cgd * Leave the program, cleaning things up as we go.
624 1.1 cgd */
625 1.7 cgd void
626 1.1 cgd bye()
627 1.1 cgd {
628 1.1 cgd signal(SIGINT, SIG_IGN);
629 1.1 cgd mvcur(0, COLS - 1, LINES - 1, 0);
630 1.1 cgd fflush(stdout);
631 1.1 cgd endwin();
632 1.1 cgd putchar('\n');
633 1.1 cgd }
634