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