fancy.c revision 1.9 1 1.9 hubertf /* $NetBSD: fancy.c,v 1.9 1999/02/10 17:08:06 hubertf 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.5 lukem #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.3 cgd #if 0
39 1.3 cgd static char sccsid[] = "@(#)fancy.c 8.1 (Berkeley) 5/31/93";
40 1.3 cgd #else
41 1.9 hubertf __RCSID("$NetBSD: fancy.c,v 1.9 1999/02/10 17:08:06 hubertf Exp $");
42 1.3 cgd #endif
43 1.1 cgd #endif /* not lint */
44 1.1 cgd
45 1.1 cgd #include "back.h"
46 1.5 lukem
47 1.5 lukem char PC; /* padding character */
48 1.5 lukem char *BC; /* backspace sequence */
49 1.5 lukem char *CD; /* clear to end of screen sequence */
50 1.5 lukem char *CE; /* clear to end of line sequence */
51 1.5 lukem char *CL; /* clear screen sequence */
52 1.5 lukem char *CM; /* cursor movement instructions */
53 1.5 lukem char *HO; /* home cursor sequence */
54 1.5 lukem char *MC; /* column cursor movement map */
55 1.5 lukem char *ML; /* row cursor movement map */
56 1.5 lukem char *ND; /* forward cursor sequence */
57 1.5 lukem char *UP; /* up cursor sequence */
58 1.5 lukem
59 1.5 lukem int lHO; /* length of HO */
60 1.5 lukem int lBC; /* length of BC */
61 1.5 lukem int lND; /* length of ND */
62 1.5 lukem int lUP; /* length of UP */
63 1.5 lukem int CO; /* number of columns */
64 1.5 lukem int LI; /* number of lines */
65 1.5 lukem int *linect; /* array of lengths of lines on screen (the
66 1.5 lukem * actual screen is not stored) */
67 1.5 lukem
68 1.5 lukem /* two letter codes */
69 1.5 lukem char tcap[] = "bccdceclcmhomcmlndup";
70 1.5 lukem /* corresponding strings */
71 1.5 lukem char **tstr[] = {&BC, &CD, &CE, &CL, &CM, &HO, &MC, &ML, &ND, &UP};
72 1.5 lukem
73 1.5 lukem int buffnum; /* pointer to output buffer */
74 1.5 lukem
75 1.5 lukem char tbuf[1024]; /* buffer for decoded termcap entries */
76 1.5 lukem
77 1.5 lukem int oldb[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
78 1.5 lukem
79 1.5 lukem int oldr;
80 1.5 lukem int oldw;
81 1.5 lukem /* "real" cursor positions, so it knows when to reposition. These are -1 if
82 1.5 lukem * curr and curc are accurate */
83 1.5 lukem int realr;
84 1.5 lukem int realc;
85 1.1 cgd
86 1.5 lukem void
87 1.5 lukem fboard()
88 1.5 lukem {
89 1.5 lukem int i, j, l;
90 1.1 cgd
91 1.5 lukem curmove(0, 0); /* do top line */
92 1.1 cgd for (i = 0; i < 53; i++)
93 1.5 lukem fancyc('_');
94 1.1 cgd
95 1.5 lukem curmove(15, 0); /* do botttom line */
96 1.1 cgd for (i = 0; i < 53; i++)
97 1.5 lukem fancyc('_');
98 1.1 cgd
99 1.5 lukem l = 1; /* do vertical lines */
100 1.5 lukem for (i = 52; i > -1; i -= 28) {
101 1.5 lukem curmove((l == 1 ? 1 : 15), i);
102 1.5 lukem fancyc('|');
103 1.5 lukem for (j = 0; j < 14; j++) {
104 1.5 lukem curmove(curr + l, curc - 1);
105 1.5 lukem fancyc('|');
106 1.1 cgd }
107 1.1 cgd if (i == 24)
108 1.1 cgd i += 32;
109 1.5 lukem l = -l; /* alternate directions */
110 1.1 cgd }
111 1.1 cgd
112 1.5 lukem curmove(2, 1); /* label positions 13-18 */
113 1.5 lukem for (i = 13; i < 18; i++) {
114 1.5 lukem fancyc('1');
115 1.5 lukem fancyc((i % 10) + '0');
116 1.5 lukem curmove(curr, curc + 2);
117 1.5 lukem }
118 1.5 lukem fancyc('1');
119 1.5 lukem fancyc('8');
120 1.5 lukem
121 1.5 lukem curmove(2, 29); /* label positions 19-24 */
122 1.5 lukem fancyc('1');
123 1.5 lukem fancyc('9');
124 1.5 lukem for (i = 20; i < 25; i++) {
125 1.5 lukem curmove(curr, curc + 2);
126 1.5 lukem fancyc('2');
127 1.5 lukem fancyc((i % 10) + '0');
128 1.5 lukem }
129 1.5 lukem
130 1.5 lukem curmove(14, 1); /* label positions 12-7 */
131 1.5 lukem fancyc('1');
132 1.5 lukem fancyc('2');
133 1.5 lukem for (i = 11; i > 6; i--) {
134 1.5 lukem curmove(curr, curc + 2);
135 1.5 lukem fancyc(i > 9 ? '1' : ' ');
136 1.5 lukem fancyc((i % 10) + '0');
137 1.1 cgd }
138 1.1 cgd
139 1.5 lukem curmove(14, 30); /* label positions 6-1 */
140 1.5 lukem fancyc('6');
141 1.1 cgd for (i = 5; i > 0; i--) {
142 1.5 lukem curmove(curr, curc + 3);
143 1.5 lukem fancyc(i + '0');
144 1.1 cgd }
145 1.1 cgd
146 1.5 lukem for (i = 12; i > 6; i--)/* print positions 12-7 */
147 1.1 cgd if (board[i])
148 1.5 lukem bsect(board[i], 13, 1 + 4 * (12 - i), -1);
149 1.1 cgd
150 1.5 lukem if (board[0]) /* print red men on bar */
151 1.5 lukem bsect(board[0], 13, 25, -1);
152 1.1 cgd
153 1.5 lukem for (i = 6; i > 0; i--) /* print positions 6-1 */
154 1.1 cgd if (board[i])
155 1.5 lukem bsect(board[i], 13, 29 + 4 * (6 - i), -1);
156 1.1 cgd
157 1.5 lukem l = (off[1] < 0 ? off[1] + 15 : off[1]); /* print white's home */
158 1.5 lukem bsect(l, 3, 54, 1);
159 1.1 cgd
160 1.5 lukem curmove(8, 25); /* print the word BAR */
161 1.5 lukem fancyc('B');
162 1.5 lukem fancyc('A');
163 1.5 lukem fancyc('R');
164 1.1 cgd
165 1.5 lukem for (i = 13; i < 19; i++) /* print positions 13-18 */
166 1.1 cgd if (board[i])
167 1.5 lukem bsect(board[i], 3, 1 + 4 * (i - 13), 1);
168 1.1 cgd
169 1.5 lukem if (board[25]) /* print white's men on bar */
170 1.5 lukem bsect(board[25], 3, 25, 1);
171 1.1 cgd
172 1.5 lukem for (i = 19; i < 25; i++) /* print positions 19-24 */
173 1.1 cgd if (board[i])
174 1.5 lukem bsect(board[i], 3, 29 + 4 * (i - 19), 1);
175 1.1 cgd
176 1.5 lukem l = (off[0] < 0 ? off[0] + 15 : off[0]); /* print red's home */
177 1.5 lukem bsect(-l, 13, 54, -1);
178 1.1 cgd
179 1.5 lukem for (i = 0; i < 26; i++)/* save board position for refresh later */
180 1.1 cgd oldb[i] = board[i];
181 1.5 lukem oldr = (off[1] < 0 ? off[1] + 15 : off[1]);
182 1.5 lukem oldw = -(off[0] < 0 ? off[0] + 15 : off[0]);
183 1.1 cgd }
184 1.1 cgd /*
185 1.1 cgd * bsect (b,rpos,cpos,cnext)
186 1.1 cgd * Print the contents of a board position. "b" has the value of the
187 1.1 cgd * position, "rpos" is the row to start printing, "cpos" is the column to
188 1.1 cgd * start printing, and "cnext" is positive if the position starts at the top
189 1.1 cgd * and negative if it starts at the bottom. The value of "cpos" is checked
190 1.1 cgd * to see if the position is a player's home, since those are printed
191 1.1 cgd * differently.
192 1.1 cgd */
193 1.5 lukem void
194 1.5 lukem bsect(b, rpos, cpos, cnext)
195 1.5 lukem int b; /* contents of position */
196 1.5 lukem int rpos; /* row of position */
197 1.5 lukem int cpos; /* column of position */
198 1.5 lukem int cnext; /* direction of position */
199 1.5 lukem {
200 1.5 lukem int j; /* index */
201 1.5 lukem int n; /* number of men on position */
202 1.5 lukem int bct; /* counter */
203 1.5 lukem int k; /* index */
204 1.5 lukem char pc; /* color of men on position */
205 1.5 lukem
206 1.5 lukem bct = 0;
207 1.5 lukem n = abs(b); /* initialize n and pc */
208 1.5 lukem pc = (b > 0 ? 'r' : 'w');
209 1.1 cgd
210 1.5 lukem if (n < 6 && cpos < 54) /* position cursor at start */
211 1.5 lukem curmove(rpos, cpos + 1);
212 1.5 lukem else
213 1.5 lukem curmove(rpos, cpos);
214 1.1 cgd
215 1.5 lukem for (j = 0; j < 5; j++) { /* print position row by row */
216 1.1 cgd
217 1.5 lukem for (k = 0; k < 15; k += 5) /* print men */
218 1.5 lukem if (n > j + k)
219 1.5 lukem fancyc(pc);
220 1.1 cgd
221 1.5 lukem if (j < 4) { /* figure how far to back up for next row */
222 1.5 lukem if (n < 6) { /* stop if none left */
223 1.5 lukem if (j + 1 == n)
224 1.1 cgd break;
225 1.5 lukem bct = 1; /* single column */
226 1.5 lukem } else {
227 1.5 lukem if (n < 11) { /* two columns */
228 1.5 lukem if (cpos == 54) { /* home pos */
229 1.5 lukem if (j + 5 >= n)
230 1.1 cgd bct = 1;
231 1.1 cgd else
232 1.1 cgd bct = 2;
233 1.1 cgd }
234 1.5 lukem if (cpos < 54) { /* not home */
235 1.5 lukem if (j + 6 >= n)
236 1.1 cgd bct = 1;
237 1.1 cgd else
238 1.1 cgd bct = 2;
239 1.1 cgd }
240 1.5 lukem } else { /* three columns */
241 1.5 lukem if (j + 10 >= n)
242 1.1 cgd bct = 2;
243 1.1 cgd else
244 1.1 cgd bct = 3;
245 1.1 cgd }
246 1.1 cgd }
247 1.5 lukem curmove(curr + cnext, curc - bct); /* reposition cursor */
248 1.1 cgd }
249 1.1 cgd }
250 1.1 cgd }
251 1.1 cgd
252 1.5 lukem void
253 1.5 lukem refresh()
254 1.5 lukem {
255 1.5 lukem int i, r, c;
256 1.5 lukem
257 1.5 lukem r = curr; /* save current position */
258 1.1 cgd c = curc;
259 1.1 cgd
260 1.5 lukem for (i = 12; i > 6; i--)/* fix positions 12-7 */
261 1.5 lukem if (board[i] != oldb[i]) {
262 1.5 lukem fixpos(oldb[i], board[i], 13, 1 + (12 - i) * 4, -1);
263 1.1 cgd oldb[i] = board[i];
264 1.1 cgd }
265 1.5 lukem if (board[0] != oldb[0]) { /* fix red men on bar */
266 1.5 lukem fixpos(oldb[0], board[0], 13, 25, -1);
267 1.1 cgd oldb[0] = board[0];
268 1.1 cgd }
269 1.5 lukem for (i = 6; i > 0; i--) /* fix positions 6-1 */
270 1.5 lukem if (board[i] != oldb[i]) {
271 1.5 lukem fixpos(oldb[i], board[i], 13, 29 + (6 - i) * 4, -1);
272 1.1 cgd oldb[i] = board[i];
273 1.1 cgd }
274 1.5 lukem i = -(off[0] < 0 ? off[0] + 15 : off[0]); /* fix white's home */
275 1.5 lukem if (oldw != i) {
276 1.5 lukem fixpos(oldw, i, 13, 54, -1);
277 1.1 cgd oldw = i;
278 1.1 cgd }
279 1.5 lukem for (i = 13; i < 19; i++) /* fix positions 13-18 */
280 1.5 lukem if (board[i] != oldb[i]) {
281 1.5 lukem fixpos(oldb[i], board[i], 3, 1 + (i - 13) * 4, 1);
282 1.1 cgd oldb[i] = board[i];
283 1.1 cgd }
284 1.5 lukem if (board[25] != oldb[25]) { /* fix white men on bar */
285 1.5 lukem fixpos(oldb[25], board[25], 3, 25, 1);
286 1.1 cgd oldb[25] = board[25];
287 1.1 cgd }
288 1.5 lukem for (i = 19; i < 25; i++) /* fix positions 19-24 */
289 1.5 lukem if (board[i] != oldb[i]) {
290 1.5 lukem fixpos(oldb[i], board[i], 3, 29 + (i - 19) * 4, 1);
291 1.1 cgd oldb[i] = board[i];
292 1.1 cgd }
293 1.5 lukem i = (off[1] < 0 ? off[1] + 15 : off[1]); /* fix red's home */
294 1.5 lukem if (oldr != i) {
295 1.5 lukem fixpos(oldr, i, 3, 54, 1);
296 1.1 cgd oldr = i;
297 1.1 cgd }
298 1.5 lukem curmove(r, c); /* return to saved position */
299 1.1 cgd newpos();
300 1.1 cgd buflush();
301 1.1 cgd }
302 1.1 cgd
303 1.5 lukem void
304 1.5 lukem fixpos(old, new, r, c, inc)
305 1.5 lukem int old, new, r, c, inc;
306 1.1 cgd {
307 1.5 lukem int o, n, nv;
308 1.5 lukem int ov, nc;
309 1.5 lukem char col;
310 1.1 cgd
311 1.5 lukem nc = 0;
312 1.5 lukem if (old * new >= 0) {
313 1.1 cgd ov = abs(old);
314 1.1 cgd nv = abs(new);
315 1.5 lukem col = (old + new > 0 ? 'r' : 'w');
316 1.5 lukem o = (ov - 1) / 5;
317 1.5 lukem n = (nv - 1) / 5;
318 1.5 lukem if (o == n) {
319 1.1 cgd if (o == 2)
320 1.5 lukem nc = c + 2;
321 1.1 cgd if (o == 1)
322 1.5 lukem nc = c < 54 ? c : c + 1;
323 1.1 cgd if (o == 0)
324 1.5 lukem nc = c < 54 ? c + 1 : c;
325 1.1 cgd if (ov > nv)
326 1.5 lukem fixcol(r + inc * (nv - n * 5), nc, abs(ov - nv), ' ', inc);
327 1.1 cgd else
328 1.5 lukem fixcol(r + inc * (ov - o * 5), nc, abs(ov - nv), col, inc);
329 1.1 cgd return;
330 1.5 lukem } else {
331 1.5 lukem if (c < 54) {
332 1.5 lukem if (o + n == 1) {
333 1.5 lukem if (n) {
334 1.5 lukem fixcol(r, c, abs(nv - 5), col, inc);
335 1.1 cgd if (ov != 5)
336 1.5 lukem fixcol(r + inc * ov, c + 1,
337 1.5 lukem abs(ov - 5), col, inc);
338 1.5 lukem } else {
339 1.5 lukem fixcol(r, c, abs(ov - 5), ' ', inc);
340 1.1 cgd if (nv != 5)
341 1.5 lukem fixcol(r + inc * nv, c + 1,
342 1.5 lukem abs(nv - 5), ' ', inc);
343 1.1 cgd }
344 1.1 cgd return;
345 1.1 cgd }
346 1.5 lukem if (n == 2) {
347 1.1 cgd if (ov != 10)
348 1.5 lukem fixcol(r + inc * (ov - 5), c,
349 1.5 lukem abs(ov - 10), col, inc);
350 1.5 lukem fixcol(r, c + 2, abs(nv - 10), col, inc);
351 1.5 lukem } else {
352 1.1 cgd if (nv != 10)
353 1.5 lukem fixcol(r + inc * (nv - 5), c,
354 1.5 lukem abs(nv - 10), ' ', inc);
355 1.5 lukem fixcol(r, c + 2, abs(ov - 10), ' ', inc);
356 1.1 cgd }
357 1.1 cgd return;
358 1.1 cgd }
359 1.5 lukem if (n > o) {
360 1.5 lukem fixcol(r + inc * (ov % 5), c + o, abs(5 * n - ov), col, inc);
361 1.5 lukem if (nv != 5 * n)
362 1.5 lukem fixcol(r, c + n, abs(5 * n - nv), col, inc);
363 1.5 lukem } else {
364 1.5 lukem fixcol(r + inc * (nv % 5), c + n, abs(5 * n - nv), ' ', inc);
365 1.5 lukem if (ov != 5 * o)
366 1.5 lukem fixcol(r, c + o, abs(5 * o - ov), ' ', inc);
367 1.1 cgd }
368 1.1 cgd return;
369 1.1 cgd }
370 1.1 cgd }
371 1.1 cgd nv = abs(new);
372 1.5 lukem fixcol(r, c + 1, nv, new > 0 ? 'r' : 'w', inc);
373 1.1 cgd if (abs(old) <= abs(new))
374 1.1 cgd return;
375 1.5 lukem fixcol(r + inc * new, c + 1, abs(old + new), ' ', inc);
376 1.1 cgd }
377 1.1 cgd
378 1.5 lukem void
379 1.5 lukem fixcol(r, c, l, ch, inc)
380 1.5 lukem int l, ch, r, c, inc;
381 1.1 cgd {
382 1.5 lukem int i;
383 1.1 cgd
384 1.5 lukem curmove(r, c);
385 1.5 lukem fancyc(ch);
386 1.5 lukem for (i = 1; i < l; i++) {
387 1.5 lukem curmove(curr + inc, curc - 1);
388 1.5 lukem fancyc(ch);
389 1.1 cgd }
390 1.1 cgd }
391 1.1 cgd
392 1.5 lukem void
393 1.5 lukem curmove(r, c)
394 1.5 lukem int r, c;
395 1.1 cgd {
396 1.1 cgd if (curr == r && curc == c)
397 1.1 cgd return;
398 1.5 lukem if (realr == -1) {
399 1.1 cgd realr = curr;
400 1.1 cgd realc = curc;
401 1.1 cgd }
402 1.1 cgd curr = r;
403 1.1 cgd curc = c;
404 1.1 cgd }
405 1.1 cgd
406 1.5 lukem void
407 1.5 lukem newpos()
408 1.5 lukem {
409 1.5 lukem int r; /* destination row */
410 1.5 lukem int c; /* destination column */
411 1.5 lukem int mode = -1; /* mode of movement */
412 1.1 cgd
413 1.5 lukem int count = 1000; /* character count */
414 1.5 lukem int i; /* index */
415 1.5 lukem int n; /* temporary variable */
416 1.5 lukem char *m; /* string containing CM movement */
417 1.1 cgd
418 1.1 cgd
419 1.5 lukem m = NULL;
420 1.5 lukem if (realr == -1) /* see if already there */
421 1.1 cgd return;
422 1.1 cgd
423 1.5 lukem r = curr; /* set current and dest. positions */
424 1.1 cgd c = curc;
425 1.1 cgd curr = realr;
426 1.1 cgd curc = realc;
427 1.1 cgd
428 1.5 lukem /* double check position */
429 1.5 lukem if (curr == r && curc == c) {
430 1.1 cgd realr = realc = -1;
431 1.1 cgd return;
432 1.1 cgd }
433 1.5 lukem if (CM) { /* try CM to get there */
434 1.1 cgd mode = 0;
435 1.5 lukem m = (char *) tgoto(CM, c, r);
436 1.5 lukem count = strlen(m);
437 1.1 cgd }
438 1.5 lukem /* try HO and local movement */
439 1.5 lukem if (HO && (n = r + c * lND + lHO) < count) {
440 1.1 cgd mode = 1;
441 1.1 cgd count = n;
442 1.1 cgd }
443 1.5 lukem /* try various LF combinations */
444 1.5 lukem if (r >= curr) {
445 1.5 lukem /* CR, LF, and ND */
446 1.5 lukem if ((n = (r - curr) + c * lND + 1) < count) {
447 1.1 cgd mode = 2;
448 1.1 cgd count = n;
449 1.1 cgd }
450 1.5 lukem /* LF, ND */
451 1.5 lukem if (c >= curc && (n = (r - curr) + (c - curc) * lND) < count) {
452 1.1 cgd mode = 3;
453 1.1 cgd count = n;
454 1.1 cgd }
455 1.5 lukem /* LF, BS */
456 1.5 lukem if (c < curc && (n = (r - curr) + (curc - c) * lBC) < count) {
457 1.1 cgd mode = 4;
458 1.1 cgd count = n;
459 1.1 cgd }
460 1.1 cgd }
461 1.5 lukem /* try corresponding UP combinations */
462 1.5 lukem if (r < curr) {
463 1.5 lukem /* CR, UP, and ND */
464 1.5 lukem if ((n = (curr - r) * lUP + c * lND + 1) < count) {
465 1.1 cgd mode = 5;
466 1.1 cgd count = n;
467 1.1 cgd }
468 1.5 lukem /* UP and ND */
469 1.5 lukem if (c >= curc && (n = (curr - r) * lUP + (c - curc) * lND) < count) {
470 1.1 cgd mode = 6;
471 1.1 cgd count = n;
472 1.1 cgd }
473 1.5 lukem /* UP and BS */
474 1.5 lukem if (c < curc && (n = (curr - r) * lUP + (curc - c) * lBC) < count) {
475 1.1 cgd mode = 7;
476 1.1 cgd count = n;
477 1.1 cgd }
478 1.1 cgd }
479 1.5 lukem /* space over */
480 1.5 lukem if (curr == r && c > curc && linect[r] < curc && c - curc < count)
481 1.1 cgd mode = 8;
482 1.1 cgd
483 1.5 lukem switch (mode) {
484 1.1 cgd
485 1.5 lukem case -1: /* error! */
486 1.5 lukem write(2, "\r\nInternal cursor error.\r\n", 26);
487 1.5 lukem getout(0);
488 1.5 lukem
489 1.5 lukem /* direct cursor motion */
490 1.5 lukem case 0:
491 1.5 lukem tputs(m, abs(curr - r), addbuf);
492 1.1 cgd break;
493 1.1 cgd
494 1.5 lukem /* relative to "home" */
495 1.5 lukem case 1:
496 1.5 lukem tputs(HO, r, addbuf);
497 1.1 cgd for (i = 0; i < r; i++)
498 1.5 lukem addbuf('\012');
499 1.1 cgd for (i = 0; i < c; i++)
500 1.5 lukem tputs(ND, 1, addbuf);
501 1.1 cgd break;
502 1.1 cgd
503 1.5 lukem /* CR and down and over */
504 1.5 lukem case 2:
505 1.5 lukem addbuf('\015');
506 1.5 lukem for (i = 0; i < r - curr; i++)
507 1.5 lukem addbuf('\012');
508 1.1 cgd for (i = 0; i < c; i++)
509 1.5 lukem tputs(ND, 1, addbuf);
510 1.1 cgd break;
511 1.5 lukem
512 1.5 lukem /* down and over */
513 1.5 lukem case 3:
514 1.5 lukem for (i = 0; i < r - curr; i++)
515 1.5 lukem addbuf('\012');
516 1.5 lukem for (i = 0; i < c - curc; i++)
517 1.5 lukem tputs(ND, 1, addbuf);
518 1.1 cgd break;
519 1.5 lukem
520 1.5 lukem /* down and back */
521 1.5 lukem case 4:
522 1.5 lukem for (i = 0; i < r - curr; i++)
523 1.5 lukem addbuf('\012');
524 1.5 lukem for (i = 0; i < curc - c; i++)
525 1.5 lukem addbuf('\010');
526 1.1 cgd break;
527 1.5 lukem
528 1.5 lukem /* CR and up and over */
529 1.5 lukem case 5:
530 1.5 lukem addbuf('\015');
531 1.5 lukem for (i = 0; i < curr - r; i++)
532 1.5 lukem tputs(UP, 1, addbuf);
533 1.1 cgd for (i = 0; i < c; i++)
534 1.5 lukem tputs(ND, 1, addbuf);
535 1.1 cgd break;
536 1.5 lukem
537 1.5 lukem /* up and over */
538 1.5 lukem case 6:
539 1.5 lukem for (i = 0; i < curr - r; i++)
540 1.5 lukem tputs(UP, 1, addbuf);
541 1.5 lukem for (i = 0; i < c - curc; i++)
542 1.5 lukem tputs(ND, 1, addbuf);
543 1.1 cgd break;
544 1.5 lukem
545 1.5 lukem /* up and back */
546 1.5 lukem case 7:
547 1.5 lukem for (i = 0; i < curr - r; i++)
548 1.5 lukem tputs(UP, 1, addbuf);
549 1.5 lukem for (i = 0; i < curc - c; i++) {
550 1.1 cgd if (BC)
551 1.5 lukem tputs(BC, 1, addbuf);
552 1.1 cgd else
553 1.5 lukem addbuf('\010');
554 1.1 cgd }
555 1.1 cgd break;
556 1.1 cgd
557 1.5 lukem /* safe space */
558 1.5 lukem case 8:
559 1.5 lukem for (i = 0; i < c - curc; i++)
560 1.5 lukem addbuf(' ');
561 1.1 cgd }
562 1.1 cgd
563 1.5 lukem /* fix positions */
564 1.1 cgd curr = r;
565 1.1 cgd curc = c;
566 1.1 cgd realr = -1;
567 1.1 cgd realc = -1;
568 1.1 cgd }
569 1.1 cgd
570 1.5 lukem void
571 1.5 lukem clear()
572 1.5 lukem {
573 1.5 lukem int i;
574 1.5 lukem
575 1.5 lukem /* double space if can't clear */
576 1.5 lukem if (CL == 0) {
577 1.5 lukem writel("\n\n");
578 1.1 cgd return;
579 1.1 cgd }
580 1.5 lukem curr = curc = 0; /* fix position markers */
581 1.1 cgd realr = realc = -1;
582 1.5 lukem for (i = 0; i < 24; i++)/* clear line counts */
583 1.1 cgd linect[i] = -1;
584 1.5 lukem buffnum = -1; /* ignore leftover buffer contents */
585 1.5 lukem tputs(CL, CO, addbuf); /* put CL in buffer */
586 1.1 cgd }
587 1.5 lukem
588 1.5 lukem void
589 1.5 lukem fancyc(c)
590 1.5 lukem char c; /* character to output */
591 1.1 cgd {
592 1.5 lukem int sp; /* counts spaces in a tab */
593 1.1 cgd
594 1.5 lukem if (c == '\007') { /* bells go in blindly */
595 1.5 lukem addbuf(c);
596 1.1 cgd return;
597 1.1 cgd }
598 1.5 lukem /* process tabs, use spaces if the the tab should be erasing things,
599 1.5 lukem * otherwise use cursor movement routines. Note this does not use
600 1.5 lukem * hardware tabs at all. */
601 1.5 lukem if (c == '\t') {
602 1.5 lukem sp = (curc + 8) & (~7); /* compute spaces */
603 1.5 lukem /* check line length */
604 1.5 lukem if (linect[curr] >= curc || sp < 4) {
605 1.1 cgd for (; sp > curc; sp--)
606 1.5 lukem addbuf(' ');
607 1.5 lukem curc = sp; /* fix curc */
608 1.1 cgd } else
609 1.5 lukem curmove(curr, sp);
610 1.1 cgd return;
611 1.1 cgd }
612 1.5 lukem /* do newline be calling newline */
613 1.5 lukem if (c == '\n') {
614 1.1 cgd newline();
615 1.1 cgd return;
616 1.1 cgd }
617 1.5 lukem /* ignore any other control chars */
618 1.1 cgd if (c < ' ')
619 1.1 cgd return;
620 1.1 cgd
621 1.5 lukem /* if an erasing space or non-space, just add it to buffer. Otherwise
622 1.5 lukem * use cursor movement routine, so that multiple spaces will be
623 1.5 lukem * grouped together */
624 1.5 lukem if (c > ' ' || linect[curr] >= curc) {
625 1.5 lukem newpos(); /* make sure position correct */
626 1.5 lukem addbuf(c); /* add character to buffer */
627 1.5 lukem /* fix line length */
628 1.1 cgd if (c == ' ' && linect[curr] == curc)
629 1.1 cgd linect[curr]--;
630 1.5 lukem else
631 1.5 lukem if (linect[curr] < curc)
632 1.5 lukem linect[curr] = curc;
633 1.5 lukem curc++; /* fix curc */
634 1.1 cgd } else
635 1.5 lukem /* use cursor movement routine */
636 1.5 lukem curmove(curr, curc + 1);
637 1.1 cgd }
638 1.1 cgd
639 1.5 lukem void
640 1.5 lukem clend()
641 1.5 lukem {
642 1.5 lukem int i;
643 1.1 cgd
644 1.5 lukem if (CD) {
645 1.5 lukem tputs(CD, CO - curr, addbuf);
646 1.1 cgd for (i = curr; i < LI; i++)
647 1.1 cgd linect[i] = -1;
648 1.1 cgd return;
649 1.1 cgd }
650 1.5 lukem curmove(i = curr, 0);
651 1.1 cgd cline();
652 1.5 lukem while (curr < LI - 1) {
653 1.5 lukem curmove(curr + 1, 0);
654 1.1 cgd if (linect[curr] > -1)
655 1.5 lukem cline();
656 1.1 cgd }
657 1.5 lukem curmove(i, 0);
658 1.1 cgd }
659 1.1 cgd
660 1.5 lukem void
661 1.5 lukem cline()
662 1.5 lukem {
663 1.5 lukem int c;
664 1.1 cgd
665 1.1 cgd if (curc > linect[curr])
666 1.1 cgd return;
667 1.5 lukem newpos();
668 1.5 lukem if (CE) {
669 1.5 lukem tputs(CE, 1, addbuf);
670 1.5 lukem linect[curr] = curc - 1;
671 1.5 lukem } else {
672 1.5 lukem c = curc - 1;
673 1.5 lukem while (linect[curr] > c) {
674 1.5 lukem addbuf(' ');
675 1.1 cgd curc++;
676 1.1 cgd linect[curr]--;
677 1.1 cgd }
678 1.5 lukem curmove(curr, c + 1);
679 1.1 cgd }
680 1.1 cgd }
681 1.1 cgd
682 1.5 lukem void
683 1.5 lukem newline()
684 1.5 lukem {
685 1.1 cgd cline();
686 1.5 lukem if (curr == LI - 1)
687 1.5 lukem curmove(begscr, 0);
688 1.1 cgd else
689 1.5 lukem curmove(curr + 1, 0);
690 1.1 cgd }
691 1.1 cgd
692 1.5 lukem int
693 1.5 lukem getcaps(s)
694 1.8 hubertf const char *s;
695 1.1 cgd {
696 1.5 lukem char *code; /* two letter code */
697 1.5 lukem char ***cap; /* pointer to cap string */
698 1.5 lukem char *bufp; /* pointer to cap buffer */
699 1.5 lukem char tentry[1024]; /* temporary uncoded caps buffer */
700 1.1 cgd
701 1.9 hubertf tgetent(tentry, s); /* get uncoded termcap entry */
702 1.1 cgd
703 1.5 lukem LI = tgetnum("li"); /* get number of lines */
704 1.1 cgd if (LI == -1)
705 1.1 cgd LI = 12;
706 1.5 lukem CO = tgetnum("co"); /* get number of columns */
707 1.1 cgd if (CO == -1)
708 1.1 cgd CO = 65;
709 1.1 cgd
710 1.5 lukem bufp = tbuf; /* get padding character */
711 1.5 lukem tgetstr("pc", &bufp);
712 1.1 cgd if (bufp != tbuf)
713 1.1 cgd PC = *tbuf;
714 1.1 cgd else
715 1.1 cgd PC = 0;
716 1.1 cgd
717 1.5 lukem bufp = tbuf; /* get string entries */
718 1.1 cgd cap = tstr;
719 1.1 cgd for (code = tcap; *code; code += 2)
720 1.5 lukem **cap++ = (char *) tgetstr(code, &bufp);
721 1.1 cgd
722 1.5 lukem /* get pertinent lengths */
723 1.1 cgd if (HO)
724 1.5 lukem lHO = strlen(HO);
725 1.1 cgd if (BC)
726 1.5 lukem lBC = strlen(BC);
727 1.1 cgd else
728 1.1 cgd lBC = 1;
729 1.1 cgd if (UP)
730 1.5 lukem lUP = strlen(UP);
731 1.1 cgd if (ND)
732 1.5 lukem lND = strlen(ND);
733 1.1 cgd if (LI < 24 || CO < 72 || !(CL && UP && ND))
734 1.1 cgd return (0);
735 1.5 lukem linect = (int *) calloc(LI + 1, sizeof(int));
736 1.1 cgd return (1);
737 1.1 cgd }
738