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