board.c revision 1.4 1 1.4 mycroft /* $NetBSD: board.c,v 1.4 1995/04/29 00:44:11 mycroft Exp $ */
2 1.3 cgd
3 1.1 cgd /*
4 1.3 cgd * Copyright (c) 1980, 1993
5 1.3 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.1 cgd #ifndef lint
37 1.3 cgd #if 0
38 1.3 cgd static char sccsid[] = "@(#)board.c 8.1 (Berkeley) 5/31/93";
39 1.3 cgd #else
40 1.4 mycroft static char rcsid[] = "$NetBSD: board.c,v 1.4 1995/04/29 00:44:11 mycroft Exp $";
41 1.3 cgd #endif
42 1.1 cgd #endif /* not lint */
43 1.1 cgd
44 1.1 cgd #include "back.h"
45 1.1 cgd
46 1.1 cgd static int i, j, k;
47 1.1 cgd static char ln[60];
48 1.1 cgd
49 1.1 cgd wrboard () {
50 1.1 cgd register int l;
51 1.1 cgd static char bl[] =
52 1.1 cgd "| | | |\n";
53 1.1 cgd static char sv[] =
54 1.1 cgd "| | | | \n";
55 1.1 cgd
56 1.4 mycroft fixtty (&noech);
57 1.1 cgd clear();
58 1.1 cgd
59 1.1 cgd if (tflag) {
60 1.1 cgd fboard();
61 1.1 cgd goto lastline;
62 1.1 cgd }
63 1.1 cgd
64 1.1 cgd writel ("_____________________________________________________\n");
65 1.1 cgd writel (bl);
66 1.1 cgd strcpy (ln,bl);
67 1.1 cgd for (j = 1; j < 50; j += 4) {
68 1.1 cgd k = j/4+(j > 24? 12: 13);
69 1.1 cgd ln[j+1] = k%10+'0';
70 1.1 cgd ln[j] = k/10+'0';
71 1.1 cgd if (j == 21)
72 1.1 cgd j += 4;
73 1.1 cgd }
74 1.1 cgd writel (ln);
75 1.1 cgd for (i = 0; i < 5; i++) {
76 1.1 cgd strcpy (ln,sv);
77 1.1 cgd for (j = 1; j < 50; j += 4) {
78 1.1 cgd k = j/4+(j > 24? 12: 13);
79 1.1 cgd wrbsub ();
80 1.1 cgd if (j == 21)
81 1.1 cgd j += 4;
82 1.1 cgd }
83 1.1 cgd if (-board[25] > i)
84 1.1 cgd ln[26] = 'w';
85 1.1 cgd if (-board[25] > i+5)
86 1.1 cgd ln[25] = 'w';
87 1.1 cgd if (-board[25] > i+10)
88 1.1 cgd ln[27] = 'w';
89 1.1 cgd l = 53;
90 1.1 cgd if (off[1] > i || (off[1] < 0 && off[1]+15 > i)) {
91 1.1 cgd ln[54] = 'r';
92 1.1 cgd l = 55;
93 1.1 cgd }
94 1.1 cgd if (off[1] > i+5 || (off[1] < 0 && off[1]+15 > i+5)) {
95 1.1 cgd ln[55] = 'r';
96 1.1 cgd l = 56;
97 1.1 cgd }
98 1.1 cgd if (off[1] > i+10 || (off[1] < 0 && off[1]+15 > i+10)) {
99 1.1 cgd ln[56] = 'r';
100 1.1 cgd l = 57;
101 1.1 cgd }
102 1.1 cgd ln[l++] = '\n';
103 1.1 cgd ln[l] = '\0';
104 1.1 cgd writel (ln);
105 1.1 cgd }
106 1.1 cgd strcpy (ln,bl);
107 1.1 cgd ln[25] = 'B';
108 1.1 cgd ln[26] = 'A';
109 1.1 cgd ln[27] = 'R';
110 1.1 cgd writel (ln);
111 1.1 cgd strcpy (ln,sv);
112 1.1 cgd for (i = 4; i > -1; i--) {
113 1.1 cgd for (j = 1; j < 50; j += 4) {
114 1.1 cgd k = ((j > 24? 53: 49)-j)/4;
115 1.1 cgd wrbsub();
116 1.1 cgd if (j == 21)
117 1.1 cgd j += 4;
118 1.1 cgd }
119 1.1 cgd if (board[0] > i)
120 1.1 cgd ln[26] = 'r';
121 1.1 cgd if (board[0] > i+5)
122 1.1 cgd ln[25] = 'r';
123 1.1 cgd if (board[0] > i+10)
124 1.1 cgd ln[27] = 'r';
125 1.1 cgd l = 53;
126 1.1 cgd if (off[0] > i || (off[0] < 0 && off[0]+15 > i)) {
127 1.1 cgd ln[54] = 'w';
128 1.1 cgd l = 55;
129 1.1 cgd }
130 1.1 cgd if (off[0] > i+5 || (off[0] < 0 && off[0]+15 > i+5)) {
131 1.1 cgd ln[55] = 'w';
132 1.1 cgd l = 56;
133 1.1 cgd }
134 1.1 cgd if (off[0] > i+10 || (off[0] < 0 && off[0]+15 > i+10)) {
135 1.1 cgd ln[56] = 'w';
136 1.1 cgd l = 57;
137 1.1 cgd }
138 1.1 cgd ln[l++] = '\n';
139 1.1 cgd ln[l] = '\0';
140 1.1 cgd writel (ln);
141 1.1 cgd }
142 1.1 cgd strcpy (ln,bl);
143 1.1 cgd for (j = 1; j < 50; j += 4) {
144 1.1 cgd k = ((j > 24? 53: 49)-j)/4;
145 1.1 cgd ln[j+1] = k%10+'0';
146 1.1 cgd if (k > 9)
147 1.1 cgd ln[j] = k/10+'0';
148 1.1 cgd if (j == 21)
149 1.1 cgd j += 4;
150 1.1 cgd }
151 1.1 cgd writel (ln);
152 1.1 cgd writel ("|_______________________|___|_______________________|\n");
153 1.1 cgd
154 1.1 cgd lastline:
155 1.1 cgd gwrite ();
156 1.1 cgd if (tflag)
157 1.1 cgd curmove (18,0);
158 1.1 cgd else {
159 1.1 cgd writec ('\n');
160 1.1 cgd writec ('\n');
161 1.1 cgd }
162 1.4 mycroft fixtty(&raw);
163 1.1 cgd }
164 1.1 cgd
165 1.1 cgd wrbsub () {
167 1.1 cgd register int m;
168 1.1 cgd register char d;
169 1.1 cgd
170 1.1 cgd if (board[k] > 0) {
171 1.1 cgd m = board[k];
172 1.1 cgd d = 'r';
173 1.1 cgd } else {
174 1.1 cgd m = -board[k];
175 1.1 cgd d = 'w';
176 1.1 cgd }
177 1.1 cgd if (m>i)
178 1.1 cgd ln[j+1] = d;
179 1.1 cgd if (m>i+5)
180 1.1 cgd ln[j] = d;
181 1.1 cgd if (m>i+10)
182 1.1 cgd ln[j+2] = d;
183 }
184