bdisp.c revision 1.23 1 1.23 rillig /* $NetBSD: bdisp.c,v 1.23 2022/05/16 19:55:58 rillig Exp $ */
2 1.4 cgd
3 1.1 tls /*
4 1.1 tls * Copyright (c) 1994
5 1.1 tls * The Regents of the University of California. All rights reserved.
6 1.1 tls *
7 1.1 tls * This code is derived from software contributed to Berkeley by
8 1.1 tls * Ralph Campbell.
9 1.1 tls *
10 1.1 tls * Redistribution and use in source and binary forms, with or without
11 1.1 tls * modification, are permitted provided that the following conditions
12 1.1 tls * are met:
13 1.1 tls * 1. Redistributions of source code must retain the above copyright
14 1.1 tls * notice, this list of conditions and the following disclaimer.
15 1.1 tls * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 tls * notice, this list of conditions and the following disclaimer in the
17 1.1 tls * documentation and/or other materials provided with the distribution.
18 1.8 agc * 3. Neither the name of the University nor the names of its contributors
19 1.1 tls * may be used to endorse or promote products derived from this software
20 1.1 tls * without specific prior written permission.
21 1.1 tls *
22 1.1 tls * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.1 tls * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.1 tls * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.1 tls * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.1 tls * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.1 tls * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.1 tls * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.1 tls * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.1 tls * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.1 tls * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.1 tls * SUCH DAMAGE.
33 1.1 tls */
34 1.1 tls
35 1.5 lukem #include <sys/cdefs.h>
36 1.1 tls #ifndef lint
37 1.2 tls #if 0
38 1.1 tls static char sccsid[] = "@(#)bdisp.c 8.2 (Berkeley) 5/3/95";
39 1.2 tls #else
40 1.23 rillig __RCSID("$NetBSD: bdisp.c,v 1.23 2022/05/16 19:55:58 rillig Exp $");
41 1.2 tls #endif
42 1.1 tls #endif /* not lint */
43 1.1 tls
44 1.5 lukem #include <curses.h>
45 1.5 lukem #include <string.h>
46 1.9 drochner #include <stdlib.h>
47 1.13 dholland #include <err.h>
48 1.1 tls #include "gomoku.h"
49 1.1 tls
50 1.1 tls #define SCRNH 24 /* assume 24 lines for the moment */
51 1.1 tls #define SCRNW 80 /* assume 80 chars for the moment */
52 1.1 tls
53 1.1 tls static int lastline;
54 1.1 tls static char pcolor[] = "*O.?";
55 1.1 tls
56 1.1 tls /*
57 1.1 tls * Initialize screen display.
58 1.1 tls */
59 1.5 lukem void
60 1.10 dholland cursinit(void)
61 1.1 tls {
62 1.1 tls
63 1.9 drochner if (!initscr()) {
64 1.13 dholland errx(EXIT_FAILURE, "Couldn't initialize screen");
65 1.9 drochner }
66 1.14 dholland if ((LINES < SCRNH) || (COLS < SCRNW)) {
67 1.14 dholland errx(EXIT_FAILURE, "Screen too small (need %d%xd)",
68 1.14 dholland SCRNW, SCRNH);
69 1.14 dholland }
70 1.14 dholland keypad(stdscr, TRUE);
71 1.14 dholland nonl();
72 1.1 tls noecho();
73 1.1 tls cbreak();
74 1.14 dholland leaveok(stdscr, FALSE);
75 1.14 dholland
76 1.14 dholland #if 0 /* no mouse support in netbsd curses yet */
77 1.14 dholland mousemask(BUTTON1_CLICKED, NULL);
78 1.14 dholland #endif
79 1.1 tls }
80 1.1 tls
81 1.1 tls /*
82 1.1 tls * Restore screen display.
83 1.1 tls */
84 1.5 lukem void
85 1.10 dholland cursfini(void)
86 1.1 tls {
87 1.1 tls
88 1.22 rillig move(BSZ + 4, 0);
89 1.1 tls clrtoeol();
90 1.1 tls refresh();
91 1.14 dholland echo();
92 1.1 tls endwin();
93 1.1 tls }
94 1.1 tls
95 1.1 tls /*
96 1.1 tls * Initialize board display.
97 1.1 tls */
98 1.5 lukem void
99 1.10 dholland bdisp_init(void)
100 1.1 tls {
101 1.5 lukem int i, j;
102 1.1 tls
103 1.1 tls /* top border */
104 1.22 rillig for (i = 1; i < BSZ + 1; i++) {
105 1.1 tls move(0, 2 * i + 1);
106 1.1 tls addch(letters[i]);
107 1.1 tls }
108 1.1 tls /* left and right edges */
109 1.22 rillig for (j = BSZ + 1; --j > 0; ) {
110 1.1 tls move(20 - j, 0);
111 1.1 tls printw("%2d ", j);
112 1.22 rillig move(20 - j, 2 * (BSZ + 1) + 1);
113 1.1 tls printw("%d ", j);
114 1.1 tls }
115 1.1 tls /* bottom border */
116 1.22 rillig for (i = 1; i < BSZ + 1; i++) {
117 1.1 tls move(20, 2 * i + 1);
118 1.1 tls addch(letters[i]);
119 1.1 tls }
120 1.1 tls bdwho(0);
121 1.1 tls move(0, 47);
122 1.1 tls addstr("# black white");
123 1.1 tls lastline = 0;
124 1.1 tls bdisp();
125 1.1 tls }
126 1.1 tls
127 1.1 tls /*
128 1.1 tls * Update who is playing whom.
129 1.1 tls */
130 1.5 lukem void
131 1.10 dholland bdwho(int update)
132 1.1 tls {
133 1.14 dholland int i, j;
134 1.1 tls
135 1.1 tls move(21, 0);
136 1.20 rillig printw(" ");
137 1.23 rillig i = (int)strlen(plyr[BLACK]);
138 1.23 rillig j = (int)strlen(plyr[WHITE]);
139 1.14 dholland if (i + j <= 20) {
140 1.20 rillig move(21, 10 - (i + j) / 2);
141 1.14 dholland printw("BLACK/%s (*) vs. WHITE/%s (O)",
142 1.14 dholland plyr[BLACK], plyr[WHITE]);
143 1.14 dholland } else {
144 1.14 dholland move(21, 0);
145 1.14 dholland if (i <= 10) {
146 1.14 dholland j = 20 - i;
147 1.14 dholland } else if (j <= 10) {
148 1.14 dholland i = 20 - j;
149 1.14 dholland } else {
150 1.14 dholland i = j = 10;
151 1.14 dholland }
152 1.14 dholland printw("BLACK/%.*s (*) vs. WHITE/%.*s (O)",
153 1.14 dholland i, plyr[BLACK], j, plyr[WHITE]);
154 1.14 dholland }
155 1.1 tls if (update)
156 1.1 tls refresh();
157 1.1 tls }
158 1.1 tls
159 1.1 tls /*
160 1.1 tls * Update the board display after a move.
161 1.1 tls */
162 1.5 lukem void
163 1.10 dholland bdisp(void)
164 1.1 tls {
165 1.5 lukem int i, j, c;
166 1.5 lukem struct spotstr *sp;
167 1.1 tls
168 1.22 rillig for (j = BSZ + 1; --j > 0; ) {
169 1.22 rillig for (i = 1; i < BSZ + 1; i++) {
170 1.22 rillig move(BSZ + 1 - j, 2 * i + 1);
171 1.22 rillig sp = &board[i + j * (BSZ + 1)];
172 1.1 tls if (debug > 1 && sp->s_occ == EMPTY) {
173 1.11 dholland if (sp->s_flags & IFLAGALL)
174 1.1 tls c = '+';
175 1.11 dholland else if (sp->s_flags & CFLAGALL)
176 1.1 tls c = '-';
177 1.1 tls else
178 1.1 tls c = '.';
179 1.1 tls } else
180 1.1 tls c = pcolor[sp->s_occ];
181 1.1 tls addch(c);
182 1.1 tls }
183 1.1 tls }
184 1.1 tls refresh();
185 1.1 tls }
186 1.1 tls
187 1.1 tls #ifdef DEBUG
188 1.1 tls /*
189 1.1 tls * Dump board display to a file.
190 1.1 tls */
191 1.5 lukem void
192 1.10 dholland bdump(FILE *fp)
193 1.1 tls {
194 1.5 lukem int i, j, c;
195 1.5 lukem struct spotstr *sp;
196 1.1 tls
197 1.1 tls /* top border */
198 1.1 tls fprintf(fp, " A B C D E F G H J K L M N O P Q R S T\n");
199 1.1 tls
200 1.22 rillig for (j = BSZ + 1; --j > 0; ) {
201 1.1 tls /* left edge */
202 1.1 tls fprintf(fp, "%2d ", j);
203 1.22 rillig for (i = 1; i < BSZ + 1; i++) {
204 1.22 rillig sp = &board[i + j * (BSZ + 1)];
205 1.1 tls if (debug > 1 && sp->s_occ == EMPTY) {
206 1.11 dholland if (sp->s_flags & IFLAGALL)
207 1.1 tls c = '+';
208 1.11 dholland else if (sp->s_flags & CFLAGALL)
209 1.1 tls c = '-';
210 1.1 tls else
211 1.1 tls c = '.';
212 1.1 tls } else
213 1.1 tls c = pcolor[sp->s_occ];
214 1.1 tls putc(c, fp);
215 1.1 tls putc(' ', fp);
216 1.1 tls }
217 1.1 tls /* right edge */
218 1.1 tls fprintf(fp, "%d\n", j);
219 1.1 tls }
220 1.1 tls
221 1.1 tls /* bottom border */
222 1.1 tls fprintf(fp, " A B C D E F G H J K L M N O P Q R S T\n");
223 1.1 tls }
224 1.1 tls #endif /* DEBUG */
225 1.1 tls
226 1.1 tls /*
227 1.1 tls * Display a transcript entry
228 1.1 tls */
229 1.5 lukem void
230 1.10 dholland dislog(const char *str)
231 1.1 tls {
232 1.1 tls
233 1.1 tls if (++lastline >= SCRNH - 1) {
234 1.1 tls /* move 'em up */
235 1.1 tls lastline = 1;
236 1.1 tls }
237 1.14 dholland move(lastline, TRANSCRIPT_COL);
238 1.14 dholland addnstr(str, SCRNW - TRANSCRIPT_COL - 1);
239 1.1 tls clrtoeol();
240 1.14 dholland move(lastline + 1, TRANSCRIPT_COL);
241 1.1 tls clrtoeol();
242 1.1 tls }
243 1.1 tls
244 1.1 tls /*
245 1.1 tls * Display a question.
246 1.1 tls */
247 1.5 lukem
248 1.5 lukem void
249 1.10 dholland ask(const char *str)
250 1.1 tls {
251 1.23 rillig int len = (int)strlen(str);
252 1.1 tls
253 1.22 rillig move(BSZ + 4, 0);
254 1.1 tls addstr(str);
255 1.1 tls clrtoeol();
256 1.22 rillig move(BSZ + 4, len);
257 1.1 tls refresh();
258 1.1 tls }
259 1.1 tls
260 1.5 lukem int
261 1.15 dholland get_key(const char *allowed)
262 1.15 dholland {
263 1.15 dholland int ch;
264 1.15 dholland
265 1.19 rillig for (;;) {
266 1.15 dholland ch = getch();
267 1.15 dholland if (allowed != NULL &&
268 1.15 dholland ch != '\0' && strchr(allowed, ch) == NULL) {
269 1.15 dholland beep();
270 1.15 dholland refresh();
271 1.15 dholland continue;
272 1.15 dholland }
273 1.15 dholland break;
274 1.15 dholland }
275 1.15 dholland return ch;
276 1.15 dholland }
277 1.15 dholland
278 1.15 dholland int
279 1.12 roy get_line(char *buf, int size)
280 1.1 tls {
281 1.5 lukem char *cp, *end;
282 1.5 lukem int c;
283 1.1 tls
284 1.5 lukem c = 0;
285 1.1 tls cp = buf;
286 1.1 tls end = buf + size - 1; /* save room for the '\0' */
287 1.1 tls while (cp < end && (c = getchar()) != EOF && c != '\n' && c != '\r') {
288 1.1 tls *cp++ = c;
289 1.1 tls if (interactive) {
290 1.1 tls switch (c) {
291 1.1 tls case 0x0c: /* ^L */
292 1.1 tls wrefresh(curscr);
293 1.1 tls cp--;
294 1.1 tls continue;
295 1.1 tls case 0x15: /* ^U */
296 1.1 tls case 0x18: /* ^X */
297 1.1 tls while (cp > buf) {
298 1.1 tls cp--;
299 1.1 tls addch('\b');
300 1.1 tls }
301 1.1 tls clrtoeol();
302 1.1 tls break;
303 1.1 tls case '\b':
304 1.1 tls case 0x7f: /* DEL */
305 1.1 tls if (cp == buf + 1) {
306 1.1 tls cp--;
307 1.1 tls continue;
308 1.1 tls }
309 1.1 tls cp -= 2;
310 1.1 tls addch('\b');
311 1.1 tls c = ' ';
312 1.1 tls /* FALLTHROUGH */
313 1.1 tls default:
314 1.1 tls addch(c);
315 1.1 tls }
316 1.1 tls refresh();
317 1.1 tls }
318 1.1 tls }
319 1.1 tls *cp = '\0';
320 1.21 rillig return c != EOF;
321 1.1 tls }
322 1.14 dholland
323 1.14 dholland /*
324 1.14 dholland * Decent (n)curses interface for the game, based on Eric S. Raymond's
325 1.14 dholland * modifications to the battleship (bs) user interface.
326 1.14 dholland */
327 1.14 dholland int
328 1.14 dholland get_coord(void)
329 1.14 dholland {
330 1.14 dholland static int curx = BSZ / 2;
331 1.14 dholland static int cury = BSZ / 2;
332 1.14 dholland int ny, nx, ch;
333 1.14 dholland
334 1.14 dholland BGOTO(cury, curx);
335 1.14 dholland refresh();
336 1.14 dholland nx = curx;
337 1.14 dholland ny = cury;
338 1.14 dholland for (;;) {
339 1.22 rillig mvprintw(BSZ + 3, (BSZ - 6) / 2, "(%c %d) ",
340 1.20 rillig 'A' + ((curx > 7) ? (curx + 1) : curx), cury + 1);
341 1.14 dholland BGOTO(cury, curx);
342 1.14 dholland
343 1.14 dholland ch = getch();
344 1.14 dholland switch (ch) {
345 1.14 dholland case 'k':
346 1.14 dholland case '8':
347 1.14 dholland case KEY_UP:
348 1.14 dholland nx = curx;
349 1.14 dholland ny = cury + 1;
350 1.14 dholland break;
351 1.14 dholland case 'j':
352 1.14 dholland case '2':
353 1.14 dholland case KEY_DOWN:
354 1.14 dholland nx = curx;
355 1.14 dholland ny = BSZ + cury - 1;
356 1.14 dholland break;
357 1.14 dholland case 'h':
358 1.14 dholland case '4':
359 1.14 dholland case KEY_LEFT:
360 1.14 dholland nx = BSZ + curx - 1;
361 1.14 dholland ny = cury;
362 1.14 dholland break;
363 1.14 dholland case 'l':
364 1.14 dholland case '6':
365 1.14 dholland case KEY_RIGHT:
366 1.14 dholland nx = curx + 1;
367 1.14 dholland ny = cury;
368 1.14 dholland break;
369 1.14 dholland case 'y':
370 1.14 dholland case '7':
371 1.14 dholland case KEY_A1:
372 1.14 dholland nx = BSZ + curx - 1;
373 1.14 dholland ny = cury + 1;
374 1.14 dholland break;
375 1.14 dholland case 'b':
376 1.14 dholland case '1':
377 1.14 dholland case KEY_C1:
378 1.14 dholland nx = BSZ + curx - 1;
379 1.14 dholland ny = BSZ + cury - 1;
380 1.14 dholland break;
381 1.14 dholland case 'u':
382 1.14 dholland case '9':
383 1.14 dholland case KEY_A3:
384 1.14 dholland nx = curx + 1;
385 1.14 dholland ny = cury + 1;
386 1.14 dholland break;
387 1.14 dholland case 'n':
388 1.14 dholland case '3':
389 1.14 dholland case KEY_C3:
390 1.14 dholland nx = curx + 1;
391 1.14 dholland ny = BSZ + cury - 1;
392 1.14 dholland break;
393 1.14 dholland case 'K':
394 1.14 dholland nx = curx;
395 1.14 dholland ny = cury + 5;
396 1.14 dholland break;
397 1.14 dholland case 'J':
398 1.14 dholland nx = curx;
399 1.14 dholland ny = BSZ + cury - 5;
400 1.14 dholland break;
401 1.14 dholland case 'H':
402 1.14 dholland nx = BSZ + curx - 5;
403 1.14 dholland ny = cury;
404 1.14 dholland break;
405 1.14 dholland case 'L':
406 1.14 dholland nx = curx + 5;
407 1.14 dholland ny = cury;
408 1.14 dholland break;
409 1.14 dholland case 'Y':
410 1.20 rillig nx = BSZ + curx - 5;
411 1.14 dholland ny = cury + 5;
412 1.14 dholland break;
413 1.14 dholland case 'B':
414 1.14 dholland nx = BSZ + curx - 5;
415 1.14 dholland ny = BSZ + cury - 5;
416 1.14 dholland break;
417 1.14 dholland case 'U':
418 1.14 dholland nx = curx + 5;
419 1.14 dholland ny = cury + 5;
420 1.14 dholland break;
421 1.14 dholland case 'N':
422 1.14 dholland nx = curx + 5;
423 1.14 dholland ny = BSZ + cury - 5;
424 1.14 dholland break;
425 1.14 dholland case '\f':
426 1.14 dholland nx = curx;
427 1.14 dholland ny = cury;
428 1.14 dholland (void)clearok(stdscr, TRUE);
429 1.14 dholland (void)refresh();
430 1.14 dholland break;
431 1.14 dholland #if 0 /* notyet */
432 1.14 dholland case KEY_MOUSE:
433 1.14 dholland {
434 1.14 dholland MEVENT myevent;
435 1.14 dholland
436 1.14 dholland getmouse(&myevent);
437 1.22 rillig if (myevent.y >= 1 && myevent.y <= BSZ + 1 &&
438 1.22 rillig myevent.x >= 3 && myevent.x <= 2 * BSZ + 1) {
439 1.14 dholland curx = (myevent.x - 3) / 2;
440 1.14 dholland cury = BSZ - myevent.y;
441 1.14 dholland return PT(curx,cury);
442 1.14 dholland } else {
443 1.14 dholland beep();
444 1.14 dholland }
445 1.14 dholland }
446 1.14 dholland break;
447 1.14 dholland #endif /* 0 */
448 1.14 dholland case 'Q':
449 1.15 dholland case 'q':
450 1.14 dholland return RESIGN;
451 1.14 dholland case 'S':
452 1.15 dholland case 's':
453 1.14 dholland return SAVE;
454 1.14 dholland case ' ':
455 1.14 dholland case '\r':
456 1.22 rillig (void)mvaddstr(BSZ + 3, (BSZ - 6) / 2, " ");
457 1.20 rillig return PT(curx + 1, cury + 1);
458 1.20 rillig }
459 1.20 rillig
460 1.20 rillig curx = nx % BSZ;
461 1.20 rillig cury = ny % BSZ;
462 1.14 dholland }
463 1.14 dholland }
464