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