2 * Copyright (c) 1980, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * @(#)fancy.c 8.1 (Berkeley) 5/31/93
30 * $FreeBSD: src/games/backgammon/common_source/fancy.c,v 1.7 1999/11/30 03:48:25 billf Exp $
37 static void bsect(int, int, int, int);
38 static void fixpos(int, int, int, int, int);
39 static void fixcol(int, int, int, int, int);
40 static void newline(void);
42 char PC; /* padding character */
43 char *BC; /* backspace sequence */
44 char *CD; /* clear to end of screen sequence */
45 char *CE; /* clear to end of line sequence */
46 char *CL; /* clear screen sequence */
47 char *CM; /* cursor movement instructions */
48 char *HO; /* home cursor sequence */
49 char *MC; /* column cursor movement map */
50 char *ML; /* row cursor movement map */
51 char *ND; /* forward cursor sequence */
52 char *UP; /* up cursor sequence */
54 int lHO; /* length of HO */
55 int lBC; /* length of BC */
56 int lND; /* length of ND */
57 int lUP; /* length of UP */
58 int CO; /* number of columns */
59 int LI; /* number of lines */
60 int *linect; /* array of lengths of lines on screen
61 (the actual screen is not stored) */
63 /* two letter codes */
64 char tcap[] = "bccdceclcmhomcmlndup";
65 /* corresponding strings */
66 char **tstr[] = { &BC, &CD, &CE, &CL, &CM, &HO, &MC, &ML, &ND, &UP };
68 int buffnum; /* pointer to output buffer */
70 char tbuf[1024]; /* buffer for decoded termcap entries */
72 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 * "real" cursor positions, so it knows when to reposition. These are -1 if
78 * curr and curc are accurate
88 curmove(0, 0); /* do top line */
89 for (i = 0; i < 53; i++)
92 curmove(15, 0); /* do bottom line */
93 for (i = 0; i < 53; i++)
96 l = 1; /* do vertical lines */
97 for (i = 52; i > -1; i -= 28) {
98 curmove((l == 1 ? 1 : 15), i);
100 for (j = 0; j < 14; j++) {
101 curmove(curr + l, curc - 1);
106 l = -l; /* alternate directions */
109 curmove(2, 1); /* label positions 13-18 */
110 for (i = 13; i < 18; i++) {
112 fancyc((i % 10) + '0');
113 curmove(curr, curc + 2);
118 curmove(2, 29); /* label positions 19-24 */
121 for (i = 20; i < 25; i++) {
122 curmove(curr, curc + 2);
124 fancyc((i % 10) + '0');
127 curmove(14, 1); /* label positions 12-7 */
130 for (i = 11; i > 6; i--) {
131 curmove(curr, curc + 2);
132 fancyc(i > 9 ? '1' : ' ');
133 fancyc((i % 10) + '0');
136 curmove(14, 30); /* label positions 6-1 */
138 for (i = 5; i > 0; i--) {
139 curmove(curr, curc + 3);
143 for (i = 12; i > 6; i--) /* print positions 12-7 */
145 bsect(board[i], 13, 1 + 4 * (12 - i), -1);
147 if (board[0]) /* print red men on bar */
148 bsect(board[0], 13, 25, -1);
150 for (i = 6; i > 0; i--) /* print positions 6-1 */
152 bsect(board[i], 13, 29 + 4 * (6 - i), -1);
154 l = (off[1] < 0 ? off[1] + 15 : off[1]); /* print white's home */
157 curmove(8, 25); /* print the word BAR */
162 for (i = 13; i < 19; i++) /* print positions 13-18 */
164 bsect(board[i], 3, 1 + 4 * (i - 13), 1);
166 if (board[25]) /* print white's men on bar */
167 bsect(board[25], 3, 25, 1);
169 for (i = 19; i < 25; i++) /* print positions 19-24 */
171 bsect(board[i], 3, 29 + 4 * (i - 19), 1);
173 l = (off[0] < 0 ? off[0] + 15 : off[0]); /* print red's home */
174 bsect(-l, 13, 54, -1);
176 for (i = 0; i < 26; i++) /* save board position
177 * for refresh later */
179 oldr = (off[1] < 0 ? off[1] + 15 : off[1]);
180 oldw = -(off[0] < 0 ? off[0] + 15 : off[0]);
184 * bsect (b,rpos,cpos,cnext)
185 * Print the contents of a board position. "b" has the value of the
186 * position, "rpos" is the row to start printing, "cpos" is the column to
187 * start printing, and "cnext" is positive if the position starts at the top
188 * and negative if it starts at the bottom. The value of "cpos" is checked
189 * to see if the position is a player's home, since those are printed
193 bsect(int b, int rpos, int cpos, int cnext)
196 int n; /* number of men on position */
197 int bct; /* counter */
199 char pc; /* color of men on position */
202 n = abs(b); /* initialize n and pc */
203 pc = (b > 0 ? 'r' : 'w');
205 if (n < 6 && cpos < 54) /* position cursor at start */
206 curmove(rpos, cpos + 1);
210 for (j = 0; j < 5; j++) { /* print position row by row */
211 for (k = 0; k < 15; k += 5) /* print men */
215 if (j < 4) { /* figure how far to back up for next row */
216 if (n < 6) { /* stop if none left */
219 bct = 1; /* single column */
221 if (n < 11) { /* two columns */
222 if (cpos == 54) { /* home pos */
228 if (cpos < 54) { /* not home */
234 } else { /* three columns */
241 /* reposition cursor */
242 curmove(curr + cnext, curc - bct);
252 r = curr; /* save current position */
255 for (i = 12; i > 6; i--) /* fix positions 12-7 */
256 if (board[i] != oldb[i]) {
257 fixpos(oldb[i], board[i], 13, 1 + (12 - i) * 4, -1);
260 if (board[0] != oldb[0]) { /* fix red men on bar */
261 fixpos(oldb[0], board[0], 13, 25, -1);
264 for (i = 6; i > 0; i--) /* fix positions 6-1 */
265 if (board[i] != oldb[i]) {
266 fixpos(oldb[i], board[i], 13, 29 + (6 - i) * 4, -1);
269 i = -(off[0] < 0 ? off[0] + 15 : off[0]); /* fix white's home */
271 fixpos(oldw, i, 13, 54, -1);
274 for (i = 13; i < 19; i++) /* fix positions 13-18 */
275 if (board[i] != oldb[i]) {
276 fixpos(oldb[i], board[i], 3, 1 + (i - 13) * 4, 1);
279 if (board[25] != oldb[25]) { /* fix white men on bar */
280 fixpos(oldb[25], board[25], 3, 25, 1);
281 oldb[25] = board[25];
283 for (i = 19; i < 25; i++) /* fix positions 19-24 */
284 if (board[i] != oldb[i]) {
285 fixpos(oldb[i], board[i], 3, 29 + (i - 19) * 4, 1);
288 i = (off[1] < 0 ? off[1] + 15 : off[1]); /* fix red's home */
290 fixpos(oldr, i, 3, 54, 1);
293 curmove(r, c); /* return to saved position */
299 fixpos(int cur, int new, int r, int c, int inc)
306 if (cur * new >= 0) {
309 col = (cur + new > 0 ? 'r' : 'w');
316 nc = c < 54 ? c : c + 1;
318 nc = c < 54 ? c + 1 : c;
320 fixcol(r + inc * (nv - n * 5), nc,
321 abs(ov - nv), ' ', inc);
323 fixcol(r + inc * (ov - o * 5), nc,
324 abs(ov - nv), col, inc);
330 fixcol(r, c, abs(nv - 5), col,
337 fixcol(r, c, abs(ov - 5), ' ',
348 fixcol(r + inc * (ov - 5), c,
349 abs(ov - 10), col, inc);
350 fixcol(r, c + 2, abs(nv - 10), col, inc);
353 fixcol(r + inc * (nv - 5), c,
354 abs(nv - 10), ' ', inc);
355 fixcol(r, c + 2, abs(ov - 10), ' ', inc);
360 fixcol(r + inc * (ov % 5), c + o,
361 abs(5 * n - ov), col, inc);
363 fixcol(r, c + n, abs(5 * n - nv),
366 fixcol(r + inc * (nv % 5), c + n,
367 abs(5 * n - nv), ' ', inc);
369 fixcol(r, c + o, abs(5 * o - ov),
376 fixcol(r, c + 1, nv, new > 0 ? 'r' : 'w', inc);
377 if (abs(cur) <= abs(new))
379 fixcol(r + inc * new, c + 1, abs(cur + new), ' ', inc);
383 fixcol(int r, int c, int l, int ch, int inc)
389 for (i = 1; i < l; i++) {
390 curmove(curr + inc, curc - 1);
396 curmove(int r, int c)
398 if (curr == r && curc == c)
411 int r; /* destination row */
412 int c; /* destination column */
413 int mode; /* mode of movement */
415 int ccount; /* character count */
417 int n; /* temporary variable */
418 char *m; /* string containing CM movement */
423 if (realr == -1) /* see if already there */
426 r = curr; /* set current and dest. positions */
431 /* double check position */
432 if (curr == r && curc == c) {
436 if (CM) { /* try CM to get there */
438 m = (char *)tgoto(CM, c, r);
441 /* try HO and local movement */
442 if (HO && (n = r + c * lND + lHO) < ccount) {
446 /* try various LF combinations */
449 if ((n = (r - curr) + c * lND + 1) < ccount) {
454 if (c >= curc && (n = (r - curr) + (c - curc) * lND) < ccount) {
459 if (c < curc && (n = (r - curr) + (curc - c) * lBC) < ccount) {
464 /* try corresponding UP combinations */
467 if ((n = (curr - r) * lUP + c * lND + 1) < ccount) {
473 (n = (curr - r) * lUP + (c - curc) * lND) < ccount) {
479 (n = (curr - r) * lUP + (curc - c) * lBC) < ccount) {
485 if (curr == r && c > curc && linect[r] < curc && c - curc < ccount)
489 case -1: /* error! */
490 write(2, "\r\nInternal cursor error.\r\n", 26);
493 case 0: /* direct cursor motion */
494 tputs(m, abs(curr - r), addbuf);
497 case 1: /* relative to "home" */
498 tputs(HO, r, addbuf);
499 for (i = 0; i < r; i++)
501 for (i = 0; i < c; i++)
502 tputs(ND, 1, addbuf);
505 case 2: /* CR and down and over */
507 for (i = 0; i < r - curr; i++)
509 for (i = 0; i < c; i++)
510 tputs(ND, 1, addbuf);
513 case 3: /* down and over */
514 for (i = 0; i < r - curr; i++)
516 for (i = 0; i < c - curc; i++)
517 tputs(ND, 1, addbuf);
520 case 4: /* down and back */
521 for (i = 0; i < r - curr; i++)
523 for (i = 0; i < curc - c; i++)
527 case 5: /* CR and up and over */
529 for (i = 0; i < curr - r; i++)
530 tputs(UP, 1, addbuf);
531 for (i = 0; i < c; i++)
532 tputs(ND, 1, addbuf);
535 case 6: /* up and over */
536 for (i = 0; i < curr - r; i++)
537 tputs(UP, 1, addbuf);
538 for (i = 0; i < c - curc; i++)
539 tputs(ND, 1, addbuf);
542 case 7: /* up and back */
543 for (i = 0; i < curr - r; i++)
544 tputs(UP, 1, addbuf);
545 for (i = 0; i < curc - c; i++) {
547 tputs(BC, 1, addbuf);
553 case 8: /* safe space */
554 for (i = 0; i < c - curc; i++)
570 /* double space if can't clear */
575 curr = curc = 0; /* fix position markers */
577 for (i = 0; i < 24; i++) /* clear line counts */
579 buffnum = -1; /* ignore leftover buffer contents */
580 tputs(CL, CO, addbuf); /* put CL in buffer */
583 /* input is character to output */
587 int sp; /* counts spaces in a tab */
589 if (c == '\007') { /* bells go in blindly */
595 * process tabs, use spaces if the the tab should be erasing things,
596 * otherwise use cursor movement routines. Note this does not use
597 * hardware tabs at all.
600 sp = (curc + 8) & (~7); /* compute spaces */
601 /* check line length */
602 if (linect[curr] >= curc || sp < 4) {
603 for (; sp > curc; sp--)
605 curc = sp; /* fix curc */
610 /* do newline be calling newline */
615 /* ignore any other control chars */
620 * if an erasing space or non-space, just add it to buffer. Otherwise
621 * use cursor movement routine, so that multiple spaces will be grouped
624 if (c > ' ' || linect[curr] >= curc) {
625 newpos(); /* make sure position correct */
626 addbuf(c); /* add character to buffer */
627 /* fix line length */
628 if (c == ' ' && linect[curr] == curc)
631 if (linect[curr] < curc)
633 curc++; /* fix curc */
635 /* use cursor movement routine */
636 curmove(curr, curc + 1);
645 tputs(CD, CO - curr, addbuf);
646 for (i = curr; i < LI; i++)
650 curmove(i = curr, 0);
652 while (curr < LI - 1) {
653 curmove(curr + 1, 0);
654 if (linect[curr] > -1)
665 if (curc > linect[curr])
669 tputs(CE, 1, addbuf);
670 linect[curr] = curc - 1;
673 while (linect[curr] > c) {
678 curmove(curr, c + 1);
689 curmove(curr + 1, 0);
693 getcaps(const char *s)
695 char *code; /* two letter code */
696 char ***cap; /* pointer to cap string */
697 char *bufp; /* pointer to cap buffer */
698 char tentry[1024]; /* temporary uncoded caps buffer */
700 tgetent(tentry, s); /* get uncoded termcap entry */
702 LI = tgetnum("li"); /* get number of lines */
705 CO = tgetnum("co"); /* get number of columns */
709 bufp = tbuf; /* get padding character */
710 tgetstr("pc", &bufp);
716 bufp = tbuf; /* get string entries */
718 for (code = tcap; *code; code += 2)
719 **cap++ = (char *)tgetstr(code, &bufp);
721 /* get pertinent lengths */
732 if (LI < 24 || CO < 72 || !(CL && UP && ND))
734 linect = calloc(LI + 1, sizeof(int));