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 $
31 * $DragonFly: src/games/backgammon/common_source/fancy.c,v 1.4 2006/08/08 16:36:11 pavalos Exp $
38 static void bsect(int, int, int, int);
39 static void fixpos(int, int, int, int, int);
40 static void fixcol(int, int, int, int, int);
41 static void newline(void);
43 char PC; /* padding character */
44 char *BC; /* backspace sequence */
45 char *CD; /* clear to end of screen sequence */
46 char *CE; /* clear to end of line sequence */
47 char *CL; /* clear screen sequence */
48 char *CM; /* cursor movement instructions */
49 char *HO; /* home cursor sequence */
50 char *MC; /* column cursor movement map */
51 char *ML; /* row cursor movement map */
52 char *ND; /* forward cursor sequence */
53 char *UP; /* up cursor sequence */
55 int lHO; /* length of HO */
56 int lBC; /* length of BC */
57 int lND; /* length of ND */
58 int lUP; /* length of UP */
59 int CO; /* number of columns */
60 int LI; /* number of lines */
61 int *linect; /* array of lengths of lines on screen
62 (the actual screen is not stored) */
64 /* two letter codes */
65 char tcap[] = "bccdceclcmhomcmlndup";
66 /* corresponding strings */
67 char **tstr[] = { &BC, &CD, &CE, &CL, &CM, &HO, &MC, &ML, &ND, &UP };
69 int buffnum; /* pointer to output buffer */
71 char tbuf[1024]; /* buffer for decoded termcap entries */
73 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 * "real" cursor positions, so it knows when to reposition. These are -1 if
79 * curr and curc are accurate
89 curmove(0, 0); /* do top line */
90 for (i = 0; i < 53; i++)
93 curmove(15, 0); /* do bottom line */
94 for (i = 0; i < 53; i++)
97 l = 1; /* do vertical lines */
98 for (i = 52; i > -1; i -= 28) {
99 curmove((l == 1 ? 1 : 15), i);
101 for (j = 0; j < 14; j++) {
102 curmove(curr + l, curc - 1);
107 l = -l; /* alternate directions */
110 curmove(2, 1); /* label positions 13-18 */
111 for (i = 13; i < 18; i++) {
113 fancyc((i % 10) + '0');
114 curmove(curr, curc + 2);
119 curmove(2, 29); /* label positions 19-24 */
122 for (i = 20; i < 25; i++) {
123 curmove(curr, curc + 2);
125 fancyc((i % 10) + '0');
128 curmove(14, 1); /* label positions 12-7 */
131 for (i = 11; i > 6; i--) {
132 curmove(curr, curc + 2);
133 fancyc(i > 9 ? '1' : ' ');
134 fancyc((i % 10) + '0');
137 curmove(14, 30); /* label positions 6-1 */
139 for (i = 5; i > 0; i--) {
140 curmove(curr, curc + 3);
144 for (i = 12; i > 6; i--) /* print positions 12-7 */
146 bsect(board[i], 13, 1 + 4 * (12 - i), -1);
148 if (board[0]) /* print red men on bar */
149 bsect(board[0], 13, 25, -1);
151 for (i = 6; i > 0; i--) /* print positions 6-1 */
153 bsect(board[i], 13, 29 + 4 * (6 - i), -1);
155 l = (off[1] < 0 ? off[1] + 15 : off[1]); /* print white's home */
158 curmove(8, 25); /* print the word BAR */
163 for (i = 13; i < 19; i++) /* print positions 13-18 */
165 bsect(board[i], 3, 1 + 4 * (i - 13), 1);
167 if (board[25]) /* print white's men on bar */
168 bsect(board[25], 3, 25, 1);
170 for (i = 19; i < 25; i++) /* print positions 19-24 */
172 bsect(board[i], 3, 29 + 4 * (i - 19), 1);
174 l = (off[0] < 0 ? off[0] + 15 : off[0]); /* print red's home */
175 bsect(-l, 13, 54, -1);
177 for (i = 0; i < 26; i++) /* save board position
178 * for refresh later */
180 oldr = (off[1] < 0 ? off[1] + 15 : off[1]);
181 oldw = -(off[0] < 0 ? off[0] + 15 : off[0]);
185 * bsect (b,rpos,cpos,cnext)
186 * Print the contents of a board position. "b" has the value of the
187 * position, "rpos" is the row to start printing, "cpos" is the column to
188 * start printing, and "cnext" is positive if the position starts at the top
189 * and negative if it starts at the bottom. The value of "cpos" is checked
190 * to see if the position is a player's home, since those are printed
194 bsect(int b, int rpos, int cpos, int cnext)
197 int n; /* number of men on position */
198 int bct; /* counter */
200 char pc; /* color of men on position */
203 n = abs(b); /* initialize n and pc */
204 pc = (b > 0 ? 'r' : 'w');
206 if (n < 6 && cpos < 54) /* position cursor at start */
207 curmove(rpos, cpos + 1);
211 for (j = 0; j < 5; j++) { /* print position row by row */
212 for (k = 0; k < 15; k += 5) /* print men */
216 if (j < 4) { /* figure how far to back up for next row */
217 if (n < 6) { /* stop if none left */
220 bct = 1; /* single column */
222 if (n < 11) { /* two columns */
223 if (cpos == 54) { /* home pos */
229 if (cpos < 54) { /* not home */
235 } else { /* three columns */
242 /* reposition cursor */
243 curmove(curr + cnext, curc - bct);
253 r = curr; /* save current position */
256 for (i = 12; i > 6; i--) /* fix positions 12-7 */
257 if (board[i] != oldb[i]) {
258 fixpos(oldb[i], board[i], 13, 1 + (12 - i) * 4, -1);
261 if (board[0] != oldb[0]) { /* fix red men on bar */
262 fixpos(oldb[0], board[0], 13, 25, -1);
265 for (i = 6; i > 0; i--) /* fix positions 6-1 */
266 if (board[i] != oldb[i]) {
267 fixpos(oldb[i], board[i], 13, 29 + (6 - i) * 4, -1);
270 i = -(off[0] < 0 ? off[0] + 15 : off[0]); /* fix white's home */
272 fixpos(oldw, i, 13, 54, -1);
275 for (i = 13; i < 19; i++) /* fix positions 13-18 */
276 if (board[i] != oldb[i]) {
277 fixpos(oldb[i], board[i], 3, 1 + (i - 13) * 4, 1);
280 if (board[25] != oldb[25]) { /* fix white men on bar */
281 fixpos(oldb[25], board[25], 3, 25, 1);
282 oldb[25] = board[25];
284 for (i = 19; i < 25; i++) /* fix positions 19-24 */
285 if (board[i] != oldb[i]) {
286 fixpos(oldb[i], board[i], 3, 29 + (i - 19) * 4, 1);
289 i = (off[1] < 0 ? off[1] + 15 : off[1]); /* fix red's home */
291 fixpos(oldr, i, 3, 54, 1);
294 curmove(r, c); /* return to saved position */
300 fixpos(int cur, int new, int r, int c, int inc)
307 if (cur * new >= 0) {
310 col = (cur + new > 0 ? 'r' : 'w');
317 nc = c < 54 ? c : c + 1;
319 nc = c < 54 ? c + 1 : c;
321 fixcol(r + inc * (nv - n * 5), nc,
322 abs(ov - nv), ' ', inc);
324 fixcol(r + inc * (ov - o * 5), nc,
325 abs(ov - nv), col, inc);
331 fixcol(r, c, abs(nv - 5), col,
338 fixcol(r, c, abs(ov - 5), ' ',
349 fixcol(r + inc * (ov - 5), c,
350 abs(ov - 10), col, inc);
351 fixcol(r, c + 2, abs(nv - 10), col, inc);
354 fixcol(r + inc * (nv - 5), c,
355 abs(nv - 10), ' ', inc);
356 fixcol(r, c + 2, abs(ov - 10), ' ', inc);
361 fixcol(r + inc * (ov % 5), c + o,
362 abs(5 * n - ov), col, inc);
364 fixcol(r, c + n, abs(5 * n - nv),
367 fixcol(r + inc * (nv % 5), c + n,
368 abs(5 * n - nv), ' ', inc);
370 fixcol(r, c + o, abs(5 * o - ov),
377 fixcol(r, c + 1, nv, new > 0 ? 'r' : 'w', inc);
378 if (abs(cur) <= abs(new))
380 fixcol(r + inc * new, c + 1, abs(cur + new), ' ', inc);
384 fixcol(int r, int c, int l, int ch, int inc)
390 for (i = 1; i < l; i++) {
391 curmove(curr + inc, curc - 1);
397 curmove(int r, int c)
399 if (curr == r && curc == c)
412 int r; /* destination row */
413 int c; /* destination column */
414 int mode; /* mode of movement */
416 int ccount; /* character count */
418 int n; /* temporary variable */
419 char *m; /* string containing CM movement */
424 if (realr == -1) /* see if already there */
427 r = curr; /* set current and dest. positions */
432 /* double check position */
433 if (curr == r && curc == c) {
437 if (CM) { /* try CM to get there */
439 m = (char *)tgoto(CM, c, r);
442 /* try HO and local movement */
443 if (HO && (n = r + c * lND + lHO) < ccount) {
447 /* try various LF combinations */
450 if ((n = (r - curr) + c * lND + 1) < ccount) {
455 if (c >= curc && (n = (r - curr) + (c - curc) * lND) < ccount) {
460 if (c < curc && (n = (r - curr) + (curc - c) * lBC) < ccount) {
465 /* try corresponding UP combinations */
468 if ((n = (curr - r) * lUP + c * lND + 1) < ccount) {
474 (n = (curr - r) * lUP + (c - curc) * lND) < ccount) {
480 (n = (curr - r) * lUP + (curc - c) * lBC) < ccount) {
486 if (curr == r && c > curc && linect[r] < curc && c - curc < ccount)
490 case -1: /* error! */
491 write(2, "\r\nInternal cursor error.\r\n", 26);
494 case 0: /* direct cursor motion */
495 tputs(m, abs(curr - r), addbuf);
498 case 1: /* relative to "home" */
499 tputs(HO, r, addbuf);
500 for (i = 0; i < r; i++)
502 for (i = 0; i < c; i++)
503 tputs(ND, 1, addbuf);
506 case 2: /* CR and down and over */
508 for (i = 0; i < r - curr; i++)
510 for (i = 0; i < c; i++)
511 tputs(ND, 1, addbuf);
514 case 3: /* down and over */
515 for (i = 0; i < r - curr; i++)
517 for (i = 0; i < c - curc; i++)
518 tputs(ND, 1, addbuf);
521 case 4: /* down and back */
522 for (i = 0; i < r - curr; i++)
524 for (i = 0; i < curc - c; i++)
528 case 5: /* CR and up and over */
530 for (i = 0; i < curr - r; i++)
531 tputs(UP, 1, addbuf);
532 for (i = 0; i < c; i++)
533 tputs(ND, 1, addbuf);
536 case 6: /* up and over */
537 for (i = 0; i < curr - r; i++)
538 tputs(UP, 1, addbuf);
539 for (i = 0; i < c - curc; i++)
540 tputs(ND, 1, addbuf);
543 case 7: /* up and back */
544 for (i = 0; i < curr - r; i++)
545 tputs(UP, 1, addbuf);
546 for (i = 0; i < curc - c; i++) {
548 tputs(BC, 1, addbuf);
554 case 8: /* safe space */
555 for (i = 0; i < c - curc; i++)
571 /* double space if can't clear */
576 curr = curc = 0; /* fix position markers */
578 for (i = 0; i < 24; i++) /* clear line counts */
580 buffnum = -1; /* ignore leftover buffer contents */
581 tputs(CL, CO, addbuf); /* put CL in buffer */
584 /* input is character to output */
588 int sp; /* counts spaces in a tab */
590 if (c == '\007') { /* bells go in blindly */
596 * process tabs, use spaces if the the tab should be erasing things,
597 * otherwise use cursor movement routines. Note this does not use
598 * hardware tabs at all.
601 sp = (curc + 8) & (~7); /* compute spaces */
602 /* check line length */
603 if (linect[curr] >= curc || sp < 4) {
604 for (; sp > curc; sp--)
606 curc = sp; /* fix curc */
611 /* do newline be calling newline */
616 /* ignore any other control chars */
621 * if an erasing space or non-space, just add it to buffer. Otherwise
622 * use cursor movement routine, so that multiple spaces will be grouped
625 if (c > ' ' || linect[curr] >= curc) {
626 newpos(); /* make sure position correct */
627 addbuf(c); /* add character to buffer */
628 /* fix line length */
629 if (c == ' ' && linect[curr] == curc)
632 if (linect[curr] < curc)
634 curc++; /* fix curc */
636 /* use cursor movement routine */
637 curmove(curr, curc + 1);
646 tputs(CD, CO - curr, addbuf);
647 for (i = curr; i < LI; i++)
651 curmove(i = curr, 0);
653 while (curr < LI - 1) {
654 curmove(curr + 1, 0);
655 if (linect[curr] > -1)
666 if (curc > linect[curr])
670 tputs(CE, 1, addbuf);
671 linect[curr] = curc - 1;
674 while (linect[curr] > c) {
679 curmove(curr, c + 1);
690 curmove(curr + 1, 0);
694 getcaps(const char *s)
696 char *code; /* two letter code */
697 char ***cap; /* pointer to cap string */
698 char *bufp; /* pointer to cap buffer */
699 char tentry[1024]; /* temporary uncoded caps buffer */
701 tgetent(tentry, s); /* get uncoded termcap entry */
703 LI = tgetnum("li"); /* get number of lines */
706 CO = tgetnum("co"); /* get number of columns */
710 bufp = tbuf; /* get padding character */
711 tgetstr("pc", &bufp);
717 bufp = tbuf; /* get string entries */
719 for (code = tcap; *code; code += 2)
720 **cap++ = (char *)tgetstr(code, &bufp);
722 /* get pertinent lengths */
733 if (LI < 24 || CO < 72 || !(CL && UP && ND))
735 linect = calloc(LI + 1, sizeof(int));