xref: /netbsd-src/lib/libcurses/curses.c (revision 5f2f42719cd62ff11fd913b40b7ce19f07c4fd25)
1 /*	$NetBSD: curses.c,v 1.30 2022/05/03 07:25:34 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.30 2022/05/03 07:25:34 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 (!xnp && !ynp)
96 		return 1;
97 
98 	if ((xnp && !ynp) || (!xnp && ynp))
99 		return 0;
100 
101 	while (xnp && ynp) {
102 		if (xnp->ch != ynp->ch)
103 			return 0;
104 		xnp = xnp->next;
105 		ynp = ynp->next;
106 	}
107 
108 	return !xnp && !ynp;
109 #else
110 	return ret;
111 #endif /* HAVE_WCHAR */
112 }
113 
114 #ifdef HAVE_WCHAR
115 /*
116  * Copy a complex character from source to destination.
117  *
118  */
119 void
120 _cursesi_copy_wchar(__LDATA *src, __LDATA *dest)
121 {
122 	dest->ch = src->ch;
123 	dest->attr = src->attr;
124 	dest->cflags = src->cflags;
125 	dest->wcols = src->wcols;
126 	_cursesi_copy_nsp(src->nsp, dest);
127 }
128 
129 /*
130  * Copy the non-spacing character list (src_nsp) to the given character,
131  * allocate or free storage as required.
132  */
133 int
134 _cursesi_copy_nsp(nschar_t *src_nsp, struct __ldata *ch)
135 {
136 	nschar_t *np, *tnp, *pnp;
137 
138 	pnp = NULL;
139 	np = src_nsp;
140 	if (np) {
141 		tnp = ch->nsp;
142 		while (np) {
143 			if (tnp) {
144 				tnp->ch = np->ch;
145 				pnp = tnp;
146 				tnp = tnp->next;
147 			} else {
148 				tnp = malloc(sizeof(nschar_t));
149 				if (!tnp)
150 					return ERR;
151 				tnp->ch = np->ch;
152 				pnp->next = tnp;
153 				tnp->next = NULL;
154 				pnp = tnp;
155 				tnp = NULL;
156 			}
157 			np = np->next;
158 		}
159                 np = tnp;
160 		if (np) {
161 			pnp->next = NULL;
162 			__cursesi_free_nsp(np);
163 		}
164 	} else {
165 		if (ch->nsp) {
166 			__cursesi_free_nsp(ch->nsp);
167 			ch->nsp = NULL;
168 		}
169 	}
170 
171 	return OK;
172 }
173 
174 /*
175  * Free the storage associated with a non-spacing character - traverse the
176  * linked list until all storage is done.
177  */
178 void
179 __cursesi_free_nsp(nschar_t *inp)
180 {
181 	nschar_t *tnp, *np;
182 
183 	np = inp;
184 	if (np) {
185 		while (np) {
186 			tnp = np->next;
187 			free(np);
188 			np = tnp;
189 		}
190 	}
191 }
192 
193 /*
194  * Traverse all the cells in the given window free'ing the non-spacing
195  * character storage.
196  */
197 void
198 __cursesi_win_free_nsp(WINDOW *win)
199 {
200 	int     i, j;
201 	__LDATA *sp;
202 
203 	for (i = 0; i < win->maxy; i++) {
204 		for (sp = win->alines[i]->line, j = 0; j < win->maxx;
205 		     j++, sp++) {
206 			__cursesi_free_nsp(sp->nsp);
207 		}
208 	}
209 }
210 
211 #endif
212