bdisp.c revision 1.45 1 1.45 rillig /* $NetBSD: bdisp.c,v 1.45 2022/05/22 12:42:54 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.34 rillig /* @(#)bdisp.c 8.2 (Berkeley) 5/3/95 */
37 1.45 rillig __RCSID("$NetBSD: bdisp.c,v 1.45 2022/05/22 12:42:54 rillig Exp $");
38 1.1 tls
39 1.5 lukem #include <curses.h>
40 1.5 lukem #include <string.h>
41 1.9 drochner #include <stdlib.h>
42 1.13 dholland #include <err.h>
43 1.1 tls #include "gomoku.h"
44 1.1 tls
45 1.1 tls #define SCRNH 24 /* assume 24 lines for the moment */
46 1.1 tls #define SCRNW 80 /* assume 80 chars for the moment */
47 1.1 tls
48 1.1 tls static int lastline;
49 1.42 rillig static const char pcolor[] = "*O.?";
50 1.1 tls
51 1.31 rillig #define scr_y(by) (1 + (BSZ - 1) - ((by) - 1))
52 1.31 rillig #define scr_x(bx) (3 + 2 * ((bx) - 1))
53 1.31 rillig
54 1.41 rillig #define TRANSCRIPT_COL (3 + (2 * BSZ - 1) + 3 + 3)
55 1.41 rillig
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.24 rillig if (initscr() == NULL) {
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.30 rillig errx(EXIT_FAILURE, "Screen too small (need %dx%d)",
68 1.14 dholland SCRNW, SCRNH);
69 1.14 dholland }
70 1.24 rillig keypad(stdscr, true);
71 1.14 dholland nonl();
72 1.1 tls noecho();
73 1.1 tls cbreak();
74 1.29 rillig 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.1 tls
102 1.36 rillig /* top and bottom borders */
103 1.28 rillig for (int i = 1; i < BSZ + 1; i++) {
104 1.36 rillig mvaddch(scr_y(BSZ + 1), scr_x(i), letters[i]);
105 1.36 rillig mvaddch(scr_y(0), scr_x(i), letters[i]);
106 1.1 tls }
107 1.36 rillig
108 1.1 tls /* left and right edges */
109 1.28 rillig for (int j = BSZ + 1; --j > 0; ) {
110 1.42 rillig mvprintw(scr_y(j), 0, "%2d", j);
111 1.42 rillig mvprintw(scr_y(j), scr_x(BSZ) + 2, "%d", j);
112 1.1 tls }
113 1.36 rillig
114 1.37 rillig bdwho();
115 1.42 rillig mvaddstr(0, TRANSCRIPT_COL, " # black white");
116 1.1 tls lastline = 0;
117 1.1 tls bdisp();
118 1.1 tls }
119 1.1 tls
120 1.1 tls /*
121 1.1 tls * Update who is playing whom.
122 1.1 tls */
123 1.5 lukem void
124 1.37 rillig bdwho(void)
125 1.1 tls {
126 1.33 rillig int bw = (int)strlen(plyr[BLACK]);
127 1.33 rillig int ww = (int)strlen(plyr[WHITE]);
128 1.33 rillig int available = 3 + (1 + scr_x(BSZ) - scr_x(1)) + 3;
129 1.33 rillig int fixed = (int)sizeof("BLACK/ (*) vs. WHITE/ (O)") - 1;
130 1.33 rillig int total = fixed + bw + ww;
131 1.37 rillig int x;
132 1.1 tls
133 1.37 rillig if (total <= available)
134 1.37 rillig x = (available - total) / 2;
135 1.37 rillig else {
136 1.33 rillig int remaining = available - fixed;
137 1.33 rillig int half = remaining / 2;
138 1.33 rillig
139 1.33 rillig if (bw <= half)
140 1.33 rillig ww = remaining - bw;
141 1.33 rillig else if (ww <= half)
142 1.33 rillig bw = remaining - ww;
143 1.33 rillig else
144 1.33 rillig bw = half, ww = remaining - half;
145 1.37 rillig x = 0;
146 1.37 rillig }
147 1.33 rillig
148 1.37 rillig mvhline(BSZ + 2, 0, ' ', available);
149 1.37 rillig mvprintw(BSZ + 2, x, "BLACK/%.*s (*) vs. WHITE/%.*s (O)",
150 1.37 rillig bw, plyr[BLACK], ww, plyr[WHITE]);
151 1.1 tls }
152 1.1 tls
153 1.1 tls /*
154 1.1 tls * Update the board display after a move.
155 1.1 tls */
156 1.5 lukem void
157 1.10 dholland bdisp(void)
158 1.1 tls {
159 1.28 rillig int c;
160 1.5 lukem struct spotstr *sp;
161 1.1 tls
162 1.28 rillig for (int j = BSZ + 1; --j > 0; ) {
163 1.28 rillig for (int i = 1; i < BSZ + 1; i++) {
164 1.22 rillig sp = &board[i + j * (BSZ + 1)];
165 1.1 tls if (debug > 1 && sp->s_occ == EMPTY) {
166 1.24 rillig if ((sp->s_flags & IFLAGALL) != 0)
167 1.1 tls c = '+';
168 1.24 rillig else if ((sp->s_flags & CFLAGALL) != 0)
169 1.1 tls c = '-';
170 1.1 tls else
171 1.1 tls c = '.';
172 1.1 tls } else
173 1.1 tls c = pcolor[sp->s_occ];
174 1.36 rillig
175 1.36 rillig move(scr_y(j), scr_x(i));
176 1.27 rillig if (movenum > 1 && movelog[movenum - 2] == PT(i, j)) {
177 1.27 rillig attron(A_BOLD);
178 1.27 rillig addch(c);
179 1.27 rillig attroff(A_BOLD);
180 1.27 rillig } else
181 1.27 rillig 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.28 rillig int 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.28 rillig for (int j = BSZ + 1; --j > 0; ) {
201 1.1 tls /* left edge */
202 1.1 tls fprintf(fp, "%2d ", j);
203 1.28 rillig for (int 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.25 rillig if ((sp->s_flags & IFLAGALL) != 0)
207 1.1 tls c = '+';
208 1.25 rillig else if ((sp->s_flags & CFLAGALL) != 0)
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.36 rillig mvaddnstr(lastline, TRANSCRIPT_COL, str, SCRNW - TRANSCRIPT_COL - 1);
238 1.1 tls clrtoeol();
239 1.14 dholland move(lastline + 1, TRANSCRIPT_COL);
240 1.1 tls clrtoeol();
241 1.1 tls }
242 1.1 tls
243 1.1 tls /*
244 1.1 tls * Display a question.
245 1.1 tls */
246 1.5 lukem
247 1.5 lukem void
248 1.10 dholland ask(const char *str)
249 1.1 tls {
250 1.23 rillig int len = (int)strlen(str);
251 1.1 tls
252 1.36 rillig mvaddstr(BSZ + 4, 0, str);
253 1.1 tls clrtoeol();
254 1.22 rillig move(BSZ + 4, len);
255 1.1 tls refresh();
256 1.1 tls }
257 1.1 tls
258 1.5 lukem int
259 1.15 dholland get_key(const char *allowed)
260 1.15 dholland {
261 1.15 dholland int ch;
262 1.15 dholland
263 1.19 rillig for (;;) {
264 1.15 dholland ch = getch();
265 1.15 dholland if (allowed != NULL &&
266 1.15 dholland ch != '\0' && strchr(allowed, ch) == NULL) {
267 1.15 dholland beep();
268 1.15 dholland refresh();
269 1.15 dholland continue;
270 1.15 dholland }
271 1.15 dholland break;
272 1.15 dholland }
273 1.15 dholland return ch;
274 1.15 dholland }
275 1.15 dholland
276 1.26 rillig bool
277 1.40 rillig get_line(char *buf, int size, void (*on_change)(const char *))
278 1.1 tls {
279 1.5 lukem char *cp, *end;
280 1.5 lukem int c;
281 1.1 tls
282 1.5 lukem c = 0;
283 1.1 tls cp = buf;
284 1.1 tls end = buf + size - 1; /* save room for the '\0' */
285 1.39 rillig while ((c = getchar()) != EOF && c != '\n' && c != '\r') {
286 1.39 rillig if (!interactive && cp < end) {
287 1.39 rillig *cp++ = c;
288 1.39 rillig continue;
289 1.39 rillig }
290 1.39 rillig if (!interactive)
291 1.39 rillig errx(EXIT_FAILURE, "line too long");
292 1.39 rillig
293 1.39 rillig switch (c) {
294 1.39 rillig case 0x0c: /* ^L */
295 1.39 rillig wrefresh(curscr);
296 1.39 rillig continue;
297 1.39 rillig case 0x15: /* ^U */
298 1.39 rillig case 0x18: /* ^X */
299 1.39 rillig for (; cp > buf; cp--)
300 1.39 rillig addstr("\b \b");
301 1.39 rillig break;
302 1.39 rillig case '\b':
303 1.39 rillig case 0x7f: /* DEL */
304 1.39 rillig if (cp == buf)
305 1.1 tls continue;
306 1.39 rillig cp--;
307 1.39 rillig addstr("\b \b");
308 1.39 rillig break;
309 1.39 rillig default:
310 1.39 rillig if (cp < end) {
311 1.39 rillig *cp++ = c;
312 1.1 tls addch(c);
313 1.39 rillig } else
314 1.39 rillig beep();
315 1.1 tls }
316 1.40 rillig if (on_change != NULL) {
317 1.40 rillig *cp = '\0';
318 1.40 rillig on_change(buf);
319 1.40 rillig }
320 1.39 rillig refresh();
321 1.1 tls }
322 1.1 tls *cp = '\0';
323 1.21 rillig return c != EOF;
324 1.1 tls }
325 1.14 dholland
326 1.14 dholland /*
327 1.43 rillig * Ask the user for the coordinate of a move, or return RESIGN or SAVE.
328 1.43 rillig *
329 1.43 rillig * Based on Eric S. Raymond's modifications to the battleship (bs) user
330 1.43 rillig * interface.
331 1.14 dholland */
332 1.14 dholland int
333 1.14 dholland get_coord(void)
334 1.14 dholland {
335 1.45 rillig static int x = 1 + (BSZ - 1) / 2;
336 1.45 rillig static int y = 1 + (BSZ - 1) / 2;
337 1.14 dholland
338 1.45 rillig move(scr_y(y), scr_x(x));
339 1.14 dholland refresh();
340 1.14 dholland for (;;) {
341 1.45 rillig mvprintw(BSZ + 3, 6, "(%c %d) ", letters[x], y);
342 1.45 rillig move(scr_y(y), scr_x(x));
343 1.14 dholland
344 1.45 rillig int ch = getch();
345 1.14 dholland switch (ch) {
346 1.14 dholland case 'k':
347 1.14 dholland case '8':
348 1.14 dholland case KEY_UP:
349 1.45 rillig y++;
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.45 rillig y--;
355 1.14 dholland break;
356 1.14 dholland case 'h':
357 1.14 dholland case '4':
358 1.14 dholland case KEY_LEFT:
359 1.45 rillig x--;
360 1.14 dholland break;
361 1.14 dholland case 'l':
362 1.14 dholland case '6':
363 1.14 dholland case KEY_RIGHT:
364 1.45 rillig x++;
365 1.14 dholland break;
366 1.14 dholland case 'y':
367 1.14 dholland case '7':
368 1.14 dholland case KEY_A1:
369 1.45 rillig x--;
370 1.45 rillig y++;
371 1.14 dholland break;
372 1.14 dholland case 'b':
373 1.14 dholland case '1':
374 1.14 dholland case KEY_C1:
375 1.45 rillig x--;
376 1.45 rillig y--;
377 1.14 dholland break;
378 1.14 dholland case 'u':
379 1.14 dholland case '9':
380 1.14 dholland case KEY_A3:
381 1.45 rillig x++;
382 1.45 rillig y++;
383 1.14 dholland break;
384 1.14 dholland case 'n':
385 1.14 dholland case '3':
386 1.14 dholland case KEY_C3:
387 1.45 rillig x++;
388 1.45 rillig y--;
389 1.14 dholland break;
390 1.14 dholland case 'K':
391 1.45 rillig y += 5;
392 1.14 dholland break;
393 1.14 dholland case 'J':
394 1.45 rillig y -= 5;
395 1.14 dholland break;
396 1.14 dholland case 'H':
397 1.45 rillig x -= 5;
398 1.14 dholland break;
399 1.14 dholland case 'L':
400 1.45 rillig x += 5;
401 1.14 dholland break;
402 1.14 dholland case 'Y':
403 1.45 rillig x -= 5;
404 1.45 rillig y += 5;
405 1.14 dholland break;
406 1.14 dholland case 'B':
407 1.45 rillig x -= 5;
408 1.45 rillig y -= 5;
409 1.14 dholland break;
410 1.14 dholland case 'U':
411 1.45 rillig x += 5;
412 1.45 rillig y += 5;
413 1.14 dholland break;
414 1.14 dholland case 'N':
415 1.45 rillig x += 5;
416 1.45 rillig y -= 5;
417 1.14 dholland break;
418 1.44 rillig case 0x0c: /* ^L */
419 1.24 rillig (void)clearok(stdscr, true);
420 1.14 dholland (void)refresh();
421 1.14 dholland break;
422 1.14 dholland #if 0 /* notyet */
423 1.14 dholland case KEY_MOUSE:
424 1.14 dholland {
425 1.14 dholland MEVENT myevent;
426 1.14 dholland
427 1.14 dholland getmouse(&myevent);
428 1.44 rillig /* XXX: 'y <= BSZ + 1' should probably be '<'. */
429 1.44 rillig /* TODO: use scr_x and scr_y. */
430 1.22 rillig if (myevent.y >= 1 && myevent.y <= BSZ + 1 &&
431 1.22 rillig myevent.x >= 3 && myevent.x <= 2 * BSZ + 1) {
432 1.44 rillig curx0 = (myevent.x - 3) / 2;
433 1.44 rillig cury0 = BSZ - myevent.y;
434 1.44 rillig return PT(curx0,cury0);
435 1.14 dholland } else {
436 1.14 dholland beep();
437 1.14 dholland }
438 1.14 dholland }
439 1.14 dholland break;
440 1.44 rillig #endif
441 1.14 dholland case 'Q':
442 1.15 dholland case 'q':
443 1.14 dholland return RESIGN;
444 1.14 dholland case 'S':
445 1.15 dholland case 's':
446 1.14 dholland return SAVE;
447 1.14 dholland case ' ':
448 1.14 dholland case '\r':
449 1.44 rillig (void)mvhline(BSZ + 3, 6, ' ', 6);
450 1.45 rillig return PT(x, y);
451 1.20 rillig }
452 1.20 rillig
453 1.45 rillig x = 1 + (x + BSZ - 1) % BSZ;
454 1.45 rillig y = 1 + (y + BSZ - 1) % BSZ;
455 1.14 dholland }
456 1.14 dholland }
457