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