Home | History | Annotate | Line # | Download | only in libcurses
      1 /*	$NetBSD: curses.c,v 1.31 2022/10/19 06:09:27 blymn Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1981, 1993, 1994
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. Neither the name of the University nor the names of its contributors
     16  *    may be used to endorse or promote products derived from this software
     17  *    without specific prior written permission.
     18  *
     19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29  * SUCH DAMAGE.
     30  */
     31 
     32 #include <sys/cdefs.h>
     33 #include <stdlib.h>
     34 #ifndef lint
     35 #if 0
     36 static char sccsid[] = "@(#)curses.c	8.3 (Berkeley) 5/4/94";
     37 #else
     38 __RCSID("$NetBSD: curses.c,v 1.31 2022/10/19 06:09:27 blymn Exp $");
     39 #endif
     40 #endif				/* not lint */
     41 
     42 #include "curses.h"
     43 #include "curses_private.h"
     44 
     45 /* Private. */
     46 int	__echoit = 1;			 /* If stty indicates ECHO. */
     47 int	__pfast;
     48 int	__rawmode = 0;			 /* If stty indicates RAW mode. */
     49 int	__noqch = 0;
     50 					 /* If terminal doesn't have
     51 					 * insert/delete line capabilities
     52 					 * for quick change on refresh.
     53 					 */
     54 char	__CA;
     55 
     56 /*
     57  * Public.
     58  *
     59  * XXX
     60  * UPPERCASE isn't used by libcurses, and is left for backward
     61  * compatibility only.
     62  */
     63 WINDOW	*curscr;			/* Current screen. */
     64 WINDOW	*stdscr;			/* Standard screen. */
     65 WINDOW	*__virtscr;			/* Virtual screen (for doupdate()). */
     66 SCREEN  *_cursesi_screen;               /* the current screen we are using */
     67 volatile bool	 _reentrant;		/* If true, some global vars are ro. */
     68 int	 COLS;				/* Columns on the screen. */
     69 int	 LINES;				/* Lines on the screen. */
     70 int	 ESCDELAY;			/* ms delay between keys for esc seq */
     71 int	 TABSIZE;			/* Size of a tab. */
     72 int	 COLORS;			/* Maximum colors on the screen */
     73 int	 COLOR_PAIRS = 0;		/* Maximum color pairs on the screen */
     74 int	 My_term = 0;			/* Use Def_term regardless. */
     75 const char	*Def_term = "unknown";	/* Default terminal type. */
     76 char	 __GT;				/* Gtty indicates tabs. */
     77 char	 __NONL;			/* Term can't hack LF doing a CR. */
     78 char	 __UPPERCASE;			/* Terminal is uppercase only. */
     79 
     80 /* compare two cells on screen, must have the same foreground/background,
     81  * and for wide characters the same sequence of non-spacing characters
     82  */
     83 int
     84 _cursesi_celleq(__LDATA *x, __LDATA *y)
     85 {
     86 #ifdef HAVE_WCHAR
     87 	nschar_t *xnp = x->nsp, *ynp = y->nsp;
     88 #endif /* HAVE_WCHAR */
     89 	int ret = ( x->ch == y->ch ) && ( x->attr == y->attr );
     90 
     91 #ifdef HAVE_WCHAR
     92 	if (!ret)
     93 		return 0;
     94 
     95 	if ((x->cflags & CA_CONTINUATION) != (y->cflags & CA_CONTINUATION))
     96 		return 0;
     97 
     98 	if (!xnp && !ynp)
     99 		return 1;
    100 
    101 	if ((xnp && !ynp) || (!xnp && ynp))
    102 		return 0;
    103 
    104 	while (xnp && ynp) {
    105 		if (xnp->ch != ynp->ch)
    106 			return 0;
    107 		xnp = xnp->next;
    108 		ynp = ynp->next;
    109 	}
    110 
    111 	return !xnp && !ynp;
    112 #else
    113 	return ret;
    114 #endif /* HAVE_WCHAR */
    115 }
    116 
    117 #ifdef HAVE_WCHAR
    118 /*
    119  * Copy a complex character from source to destination.
    120  *
    121  */
    122 void
    123 _cursesi_copy_wchar(__LDATA *src, __LDATA *dest)
    124 {
    125 	dest->ch = src->ch;
    126 	dest->attr = src->attr;
    127 	dest->cflags = src->cflags;
    128 	dest->wcols = src->wcols;
    129 	_cursesi_copy_nsp(src->nsp, dest);
    130 }
    131 
    132 /*
    133  * Copy the non-spacing character list (src_nsp) to the given character,
    134  * allocate or free storage as required.
    135  */
    136 int
    137 _cursesi_copy_nsp(nschar_t *src_nsp, struct __ldata *ch)
    138 {
    139 	nschar_t *np, *tnp, *pnp;
    140 
    141 	pnp = NULL;
    142 	np = src_nsp;
    143 	if (np) {
    144 		tnp = ch->nsp;
    145 		while (np) {
    146 			if (tnp) {
    147 				tnp->ch = np->ch;
    148 				pnp = tnp;
    149 				tnp = tnp->next;
    150 			} else {
    151 				tnp = malloc(sizeof(nschar_t));
    152 				if (!tnp)
    153 					return ERR;
    154 				tnp->ch = np->ch;
    155 				pnp->next = tnp;
    156 				tnp->next = NULL;
    157 				pnp = tnp;
    158 				tnp = NULL;
    159 			}
    160 			np = np->next;
    161 		}
    162                 np = tnp;
    163 		if (np) {
    164 			pnp->next = NULL;
    165 			__cursesi_free_nsp(np);
    166 		}
    167 	} else {
    168 		if (ch->nsp) {
    169 			__cursesi_free_nsp(ch->nsp);
    170 			ch->nsp = NULL;
    171 		}
    172 	}
    173 
    174 	return OK;
    175 }
    176 
    177 /*
    178  * Free the storage associated with a non-spacing character - traverse the
    179  * linked list until all storage is done.
    180  */
    181 void
    182 __cursesi_free_nsp(nschar_t *inp)
    183 {
    184 	nschar_t *tnp, *np;
    185 
    186 	np = inp;
    187 	if (np) {
    188 		while (np) {
    189 			tnp = np->next;
    190 			free(np);
    191 			np = tnp;
    192 		}
    193 	}
    194 }
    195 
    196 /*
    197  * Traverse all the cells in the given window free'ing the non-spacing
    198  * character storage.
    199  */
    200 void
    201 __cursesi_win_free_nsp(WINDOW *win)
    202 {
    203 	int     i, j;
    204 	__LDATA *sp;
    205 
    206 	for (i = 0; i < win->maxy; i++) {
    207 		for (sp = win->alines[i]->line, j = 0; j < win->maxx;
    208 		     j++, sp++) {
    209 			__cursesi_free_nsp(sp->nsp);
    210 		}
    211 	}
    212 }
    213 
    214 #endif
    215