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