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