board.c revision 1.9 1 1.9 dholland /* $NetBSD: board.c,v 1.9 2009/08/12 05:17:57 dholland 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.7 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.5 lukem #include <sys/cdefs.h>
33 1.1 cgd #ifndef lint
34 1.3 cgd #if 0
35 1.3 cgd static char sccsid[] = "@(#)board.c 8.1 (Berkeley) 5/31/93";
36 1.3 cgd #else
37 1.9 dholland __RCSID("$NetBSD: board.c,v 1.9 2009/08/12 05:17:57 dholland Exp $");
38 1.3 cgd #endif
39 1.1 cgd #endif /* not lint */
40 1.1 cgd
41 1.1 cgd #include "back.h"
42 1.1 cgd
43 1.5 lukem static int i, j, k;
44 1.5 lukem static char ln[60];
45 1.1 cgd
46 1.9 dholland static void wrbsub(void);
47 1.9 dholland
48 1.5 lukem void
49 1.8 jmc wrboard(void)
50 1.5 lukem {
51 1.5 lukem int l;
52 1.6 hubertf static const char bl[] =
53 1.5 lukem "| | | |\n";
54 1.6 hubertf static const char sv[] =
55 1.5 lukem "| | | | \n";
56 1.1 cgd
57 1.5 lukem fixtty(&noech);
58 1.1 cgd clear();
59 1.1 cgd
60 1.5 lukem if (tflag) {
61 1.1 cgd fboard();
62 1.1 cgd goto lastline;
63 1.1 cgd }
64 1.5 lukem writel("_____________________________________________________\n");
65 1.5 lukem writel(bl);
66 1.5 lukem strcpy(ln, bl);
67 1.1 cgd for (j = 1; j < 50; j += 4) {
68 1.5 lukem k = j / 4 + (j > 24 ? 12 : 13);
69 1.5 lukem ln[j + 1] = k % 10 + '0';
70 1.5 lukem ln[j] = k / 10 + '0';
71 1.1 cgd if (j == 21)
72 1.1 cgd j += 4;
73 1.1 cgd }
74 1.5 lukem writel(ln);
75 1.1 cgd for (i = 0; i < 5; i++) {
76 1.5 lukem strcpy(ln, sv);
77 1.1 cgd for (j = 1; j < 50; j += 4) {
78 1.5 lukem k = j / 4 + (j > 24 ? 12 : 13);
79 1.5 lukem 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.5 lukem if (-board[25] > i + 5)
86 1.1 cgd ln[25] = 'w';
87 1.5 lukem if (-board[25] > i + 10)
88 1.1 cgd ln[27] = 'w';
89 1.1 cgd l = 53;
90 1.5 lukem 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.5 lukem 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.5 lukem 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.5 lukem writel(ln);
105 1.1 cgd }
106 1.5 lukem 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.5 lukem writel(ln);
111 1.5 lukem 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.5 lukem 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.5 lukem if (board[0] > i + 5)
122 1.1 cgd ln[25] = 'r';
123 1.5 lukem if (board[0] > i + 10)
124 1.1 cgd ln[27] = 'r';
125 1.1 cgd l = 53;
126 1.5 lukem 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.5 lukem 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.5 lukem 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.5 lukem writel(ln);
141 1.1 cgd }
142 1.5 lukem strcpy(ln, bl);
143 1.1 cgd for (j = 1; j < 50; j += 4) {
144 1.5 lukem k = ((j > 24 ? 53 : 49) - j) / 4;
145 1.5 lukem ln[j + 1] = k % 10 + '0';
146 1.1 cgd if (k > 9)
147 1.5 lukem ln[j] = k / 10 + '0';
148 1.1 cgd if (j == 21)
149 1.1 cgd j += 4;
150 1.1 cgd }
151 1.5 lukem writel(ln);
152 1.5 lukem writel("|_______________________|___|_______________________|\n");
153 1.1 cgd
154 1.1 cgd lastline:
155 1.5 lukem gwrite();
156 1.1 cgd if (tflag)
157 1.5 lukem curmove(18, 0);
158 1.5 lukem else {
159 1.5 lukem writec('\n');
160 1.5 lukem writec('\n');
161 1.1 cgd }
162 1.4 mycroft fixtty(&raw);
163 1.1 cgd }
164 1.1 cgd
165 1.9 dholland static void
166 1.8 jmc wrbsub(void)
167 1.5 lukem {
168 1.5 lukem int m;
169 1.5 lukem char d;
170 1.5 lukem
171 1.5 lukem if (board[k] > 0) {
172 1.1 cgd m = board[k];
173 1.1 cgd d = 'r';
174 1.1 cgd } else {
175 1.1 cgd m = -board[k];
176 1.1 cgd d = 'w';
177 1.1 cgd }
178 1.5 lukem if (m > i)
179 1.5 lukem ln[j + 1] = d;
180 1.5 lukem if (m > i + 5)
181 1.1 cgd ln[j] = d;
182 1.5 lukem if (m > i + 10)
183 1.5 lukem ln[j + 2] = d;
184 1.1 cgd }
185