curses.c revision 1.27 1 1.27 roy /* $NetBSD: curses.c,v 1.27 2017/01/30 14:55:58 roy 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.27 roy __RCSID("$NetBSD: curses.c,v 1.27 2017/01/30 14:55:58 roy 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.25 roy int TABSIZE; /* Size of a tab. */
71 1.13 jdc int COLORS; /* Maximum colors on the screen */
72 1.20 jdc int COLOR_PAIRS = 0; /* Maximum color pairs on the screen */
73 1.3 mycroft int My_term = 0; /* Use Def_term regardless. */
74 1.17 jdc const char *Def_term = "unknown"; /* Default terminal type. */
75 1.17 jdc char __GT; /* Gtty indicates tabs. */
76 1.17 jdc char __NONL; /* Term can't hack LF doing a CR. */
77 1.17 jdc char __UPPERCASE; /* Terminal is uppercase only. */
78 1.22 blymn
79 1.22 blymn #ifdef HAVE_WCHAR
80 1.22 blymn /*
81 1.22 blymn * Copy the non-spacing character list (src_nsp) to the given character,
82 1.22 blymn * allocate or free storage as required.
83 1.22 blymn */
84 1.22 blymn int
85 1.22 blymn _cursesi_copy_nsp(nschar_t *src_nsp, struct __ldata *ch)
86 1.22 blymn {
87 1.22 blymn nschar_t *np, *tnp, *pnp;
88 1.22 blymn
89 1.22 blymn pnp = NULL;
90 1.22 blymn np = src_nsp;
91 1.22 blymn if (np) {
92 1.22 blymn tnp = ch->nsp;
93 1.22 blymn while (np) {
94 1.22 blymn if (tnp) {
95 1.22 blymn tnp->ch = np->ch;
96 1.22 blymn pnp = tnp;
97 1.22 blymn tnp = tnp->next;
98 1.22 blymn } else {
99 1.26 christos tnp = malloc(sizeof(nschar_t));
100 1.22 blymn if (!tnp)
101 1.22 blymn return ERR;
102 1.22 blymn tnp->ch = np->ch;
103 1.22 blymn pnp->next = tnp;
104 1.22 blymn tnp->next = NULL;
105 1.22 blymn pnp = tnp;
106 1.22 blymn tnp = NULL;
107 1.22 blymn }
108 1.22 blymn np = np->next;
109 1.22 blymn }
110 1.22 blymn np = tnp;
111 1.22 blymn if (np) {
112 1.22 blymn pnp->next = NULL;
113 1.22 blymn __cursesi_free_nsp(np);
114 1.22 blymn }
115 1.22 blymn } else {
116 1.22 blymn if (ch->nsp) {
117 1.22 blymn __cursesi_free_nsp(ch->nsp);
118 1.22 blymn ch->nsp = NULL;
119 1.22 blymn }
120 1.22 blymn }
121 1.22 blymn
122 1.22 blymn return OK;
123 1.22 blymn }
124 1.22 blymn
125 1.22 blymn /*
126 1.22 blymn * Free the storage associated with a non-spacing character - traverse the
127 1.22 blymn * linked list until all storage is done.
128 1.22 blymn */
129 1.22 blymn void
130 1.22 blymn __cursesi_free_nsp(nschar_t *inp)
131 1.22 blymn {
132 1.22 blymn nschar_t *tnp, *np;
133 1.22 blymn
134 1.22 blymn np = inp;
135 1.22 blymn if (np) {
136 1.22 blymn while (np) {
137 1.22 blymn tnp = np->next;
138 1.22 blymn free(np);
139 1.22 blymn np = tnp;
140 1.22 blymn }
141 1.22 blymn }
142 1.22 blymn }
143 1.22 blymn
144 1.22 blymn /*
145 1.22 blymn * Traverse all the cells in the given window free'ing the non-spacing
146 1.22 blymn * character storage.
147 1.22 blymn */
148 1.22 blymn void
149 1.22 blymn __cursesi_win_free_nsp(WINDOW *win)
150 1.22 blymn {
151 1.22 blymn int i, j;
152 1.22 blymn __LDATA *sp;
153 1.22 blymn
154 1.22 blymn for (i = 0; i < win->maxy; i++) {
155 1.23 roy for (sp = win->alines[i]->line, j = 0; j < win->maxx;
156 1.22 blymn j++, sp++) {
157 1.22 blymn __cursesi_free_nsp(sp->nsp);
158 1.22 blymn }
159 1.22 blymn }
160 1.22 blymn }
161 1.22 blymn
162 1.22 blymn #endif
163