bdisp.c revision 1.2 1 1.2 tls /* $NetBSD: bdisp.c,v 1.2 1996/12/28 18:56:59 tls Exp $
2 1.2 tls */
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.1 tls * 3. All advertising materials mentioning features or use of this software
19 1.1 tls * must display the following acknowledgement:
20 1.1 tls * This product includes software developed by the University of
21 1.1 tls * California, Berkeley and its contributors.
22 1.1 tls * 4. Neither the name of the University nor the names of its contributors
23 1.1 tls * may be used to endorse or promote products derived from this software
24 1.1 tls * without specific prior written permission.
25 1.1 tls *
26 1.1 tls * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 1.1 tls * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 1.1 tls * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 1.1 tls * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 1.1 tls * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 1.1 tls * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 1.1 tls * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 1.1 tls * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 1.1 tls * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 1.1 tls * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 1.1 tls * SUCH DAMAGE.
37 1.1 tls */
38 1.1 tls
39 1.1 tls #ifndef lint
40 1.2 tls #if 0
41 1.1 tls static char sccsid[] = "@(#)bdisp.c 8.2 (Berkeley) 5/3/95";
42 1.2 tls #else
43 1.2 tls static char rcsid[] = "$NetBSD: bdisp.c,v 1.2 1996/12/28 18:56:59 tls Exp $";
44 1.2 tls #endif
45 1.1 tls #endif /* not lint */
46 1.1 tls
47 1.1 tls #include "gomoku.h"
48 1.1 tls #include <stdio.h>
49 1.1 tls #include <curses.h>
50 1.1 tls
51 1.1 tls #define SCRNH 24 /* assume 24 lines for the moment */
52 1.1 tls #define SCRNW 80 /* assume 80 chars for the moment */
53 1.1 tls
54 1.1 tls static int lastline;
55 1.1 tls static char pcolor[] = "*O.?";
56 1.1 tls
57 1.1 tls /*
58 1.1 tls * Initialize screen display.
59 1.1 tls */
60 1.1 tls cursinit()
61 1.1 tls {
62 1.1 tls
63 1.1 tls initscr();
64 1.1 tls noecho();
65 1.1 tls cbreak();
66 1.1 tls leaveok(stdscr, TRUE);
67 1.1 tls }
68 1.1 tls
69 1.1 tls /*
70 1.1 tls * Restore screen display.
71 1.1 tls */
72 1.1 tls cursfini()
73 1.1 tls {
74 1.1 tls
75 1.1 tls leaveok(stdscr, FALSE);
76 1.1 tls move(23, 0);
77 1.1 tls clrtoeol();
78 1.1 tls refresh();
79 1.1 tls endwin();
80 1.1 tls }
81 1.1 tls
82 1.1 tls /*
83 1.1 tls * Initialize board display.
84 1.1 tls */
85 1.1 tls bdisp_init()
86 1.1 tls {
87 1.1 tls register int i, j;
88 1.1 tls
89 1.1 tls /* top border */
90 1.1 tls for (i = 1; i < BSZ1; i++) {
91 1.1 tls move(0, 2 * i + 1);
92 1.1 tls addch(letters[i]);
93 1.1 tls }
94 1.1 tls /* left and right edges */
95 1.1 tls for (j = BSZ1; --j > 0; ) {
96 1.1 tls move(20 - j, 0);
97 1.1 tls printw("%2d ", j);
98 1.1 tls move(20 - j, 2 * BSZ1 + 1);
99 1.1 tls printw("%d ", j);
100 1.1 tls }
101 1.1 tls /* bottom border */
102 1.1 tls for (i = 1; i < BSZ1; i++) {
103 1.1 tls move(20, 2 * i + 1);
104 1.1 tls addch(letters[i]);
105 1.1 tls }
106 1.1 tls bdwho(0);
107 1.1 tls move(0, 47);
108 1.1 tls addstr("# black white");
109 1.1 tls lastline = 0;
110 1.1 tls bdisp();
111 1.1 tls }
112 1.1 tls
113 1.1 tls /*
114 1.1 tls * Update who is playing whom.
115 1.1 tls */
116 1.1 tls bdwho(update)
117 1.1 tls int update;
118 1.1 tls {
119 1.1 tls int i;
120 1.1 tls extern char *plyr[];
121 1.1 tls
122 1.1 tls move(21, 0);
123 1.1 tls clrtoeol();
124 1.1 tls i = 6 - strlen(plyr[BLACK]) / 2;
125 1.1 tls move(21, i > 0 ? i : 0);
126 1.1 tls printw("BLACK/%s", plyr[BLACK]);
127 1.1 tls i = 30 - strlen(plyr[WHITE]) / 2;
128 1.1 tls move(21, i);
129 1.1 tls printw("WHITE/%s", plyr[WHITE]);
130 1.1 tls move(21, 19);
131 1.1 tls addstr(" vs. ");
132 1.1 tls if (update)
133 1.1 tls refresh();
134 1.1 tls }
135 1.1 tls
136 1.1 tls /*
137 1.1 tls * Update the board display after a move.
138 1.1 tls */
139 1.1 tls bdisp()
140 1.1 tls {
141 1.1 tls register int i, j, c;
142 1.1 tls register struct spotstr *sp;
143 1.1 tls
144 1.1 tls for (j = BSZ1; --j > 0; ) {
145 1.1 tls for (i = 1; i < BSZ1; i++) {
146 1.1 tls move(BSZ1 - j, 2 * i + 1);
147 1.1 tls sp = &board[i + j * BSZ1];
148 1.1 tls if (debug > 1 && sp->s_occ == EMPTY) {
149 1.1 tls if (sp->s_flg & IFLAGALL)
150 1.1 tls c = '+';
151 1.1 tls else if (sp->s_flg & CFLAGALL)
152 1.1 tls c = '-';
153 1.1 tls else
154 1.1 tls c = '.';
155 1.1 tls } else
156 1.1 tls c = pcolor[sp->s_occ];
157 1.1 tls addch(c);
158 1.1 tls }
159 1.1 tls }
160 1.1 tls refresh();
161 1.1 tls }
162 1.1 tls
163 1.1 tls #ifdef DEBUG
164 1.1 tls /*
165 1.1 tls * Dump board display to a file.
166 1.1 tls */
167 1.1 tls bdump(fp)
168 1.1 tls FILE *fp;
169 1.1 tls {
170 1.1 tls register int i, j, c;
171 1.1 tls register struct spotstr *sp;
172 1.1 tls
173 1.1 tls /* top border */
174 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");
175 1.1 tls
176 1.1 tls for (j = BSZ1; --j > 0; ) {
177 1.1 tls /* left edge */
178 1.1 tls fprintf(fp, "%2d ", j);
179 1.1 tls for (i = 1; i < BSZ1; i++) {
180 1.1 tls sp = &board[i + j * BSZ1];
181 1.1 tls if (debug > 1 && sp->s_occ == EMPTY) {
182 1.1 tls if (sp->s_flg & IFLAGALL)
183 1.1 tls c = '+';
184 1.1 tls else if (sp->s_flg & CFLAGALL)
185 1.1 tls c = '-';
186 1.1 tls else
187 1.1 tls c = '.';
188 1.1 tls } else
189 1.1 tls c = pcolor[sp->s_occ];
190 1.1 tls putc(c, fp);
191 1.1 tls putc(' ', fp);
192 1.1 tls }
193 1.1 tls /* right edge */
194 1.1 tls fprintf(fp, "%d\n", j);
195 1.1 tls }
196 1.1 tls
197 1.1 tls /* bottom 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.1 tls #endif /* DEBUG */
201 1.1 tls
202 1.1 tls /*
203 1.1 tls * Display a transcript entry
204 1.1 tls */
205 1.1 tls dislog(str)
206 1.1 tls char *str;
207 1.1 tls {
208 1.1 tls
209 1.1 tls if (++lastline >= SCRNH - 1) {
210 1.1 tls /* move 'em up */
211 1.1 tls lastline = 1;
212 1.1 tls }
213 1.1 tls if (strlen(str) >= SCRNW - 46)
214 1.1 tls str[SCRNW - 46 - 1] = '\0';
215 1.1 tls move(lastline, 46);
216 1.1 tls addstr(str);
217 1.1 tls clrtoeol();
218 1.1 tls move(lastline + 1, 46);
219 1.1 tls clrtoeol();
220 1.1 tls }
221 1.1 tls
222 1.1 tls /*
223 1.1 tls * Display a question.
224 1.1 tls */
225 1.1 tls ask(str)
226 1.1 tls char *str;
227 1.1 tls {
228 1.1 tls int len = strlen(str);
229 1.1 tls
230 1.1 tls move(23, 0);
231 1.1 tls addstr(str);
232 1.1 tls clrtoeol();
233 1.1 tls move(23, len);
234 1.1 tls refresh();
235 1.1 tls }
236 1.1 tls
237 1.1 tls getline(buf, size)
238 1.1 tls char *buf;
239 1.1 tls int size;
240 1.1 tls {
241 1.1 tls register char *cp, *end;
242 1.1 tls register int c;
243 1.1 tls extern int interactive;
244 1.1 tls
245 1.1 tls cp = buf;
246 1.1 tls end = buf + size - 1; /* save room for the '\0' */
247 1.1 tls while (cp < end && (c = getchar()) != EOF && c != '\n' && c != '\r') {
248 1.1 tls *cp++ = c;
249 1.1 tls if (interactive) {
250 1.1 tls switch (c) {
251 1.1 tls case 0x0c: /* ^L */
252 1.1 tls wrefresh(curscr);
253 1.1 tls cp--;
254 1.1 tls continue;
255 1.1 tls case 0x15: /* ^U */
256 1.1 tls case 0x18: /* ^X */
257 1.1 tls while (cp > buf) {
258 1.1 tls cp--;
259 1.1 tls addch('\b');
260 1.1 tls }
261 1.1 tls clrtoeol();
262 1.1 tls break;
263 1.1 tls case '\b':
264 1.1 tls case 0x7f: /* DEL */
265 1.1 tls if (cp == buf + 1) {
266 1.1 tls cp--;
267 1.1 tls continue;
268 1.1 tls }
269 1.1 tls cp -= 2;
270 1.1 tls addch('\b');
271 1.1 tls c = ' ';
272 1.1 tls /* FALLTHROUGH */
273 1.1 tls default:
274 1.1 tls addch(c);
275 1.1 tls }
276 1.1 tls refresh();
277 1.1 tls }
278 1.1 tls }
279 1.1 tls *cp = '\0';
280 1.1 tls return(c != EOF);
281 1.1 tls }
282