1 /****************************************************************************
2 * Copyright 2018-2021,2022 Thomas E. Dickey *
3 * Copyright 1998-2013,2017 Free Software Foundation, Inc. *
5 * Permission is hereby granted, free of charge, to any person obtaining a *
6 * copy of this software and associated documentation files (the *
7 * "Software"), to deal in the Software without restriction, including *
8 * without limitation the rights to use, copy, modify, merge, publish, *
9 * distribute, distribute with modifications, sublicense, and/or sell *
10 * copies of the Software, and to permit persons to whom the Software is *
11 * furnished to do so, subject to the following conditions: *
13 * The above copyright notice and this permission notice shall be included *
14 * in all copies or substantial portions of the Software. *
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
17 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
18 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
19 * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
20 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
21 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
22 * THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
24 * Except as contained in this notice, the name(s) of the above copyright *
25 * holders shall not be used in advertising or otherwise to promote the *
26 * sale, use or other dealings in this Software without prior written *
28 ****************************************************************************/
30 /****************************************************************************
31 * Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 *
32 * and: Eric S. Raymond <esr@snark.thyrsus.com> *
33 * and: Thomas E. Dickey 1996-on *
34 ****************************************************************************/
37 * alloc_entry.c -- allocation functions for terminfo entries
47 #include <curses.priv.h>
51 MODULE_ID("$Id: alloc_entry.c,v 1.68 2022/02/26 22:19:31 tom Exp $")
53 #define ABSENT_OFFSET -1
54 #define CANCELLED_OFFSET -2
56 #define MAX_STRTAB 4096 /* documented maximum entry size */
58 static char *stringbuf; /* buffer for string capabilities */
59 static size_t next_free; /* next free character in stringbuf */
62 _nc_init_entry(ENTRY * const tp)
63 /* initialize a terminal type data block */
67 if (stringbuf != NULL) {
68 FreeAndNull(stringbuf);
72 _nc_err_abort("_nc_init_entry called without initialization");
76 if (stringbuf == NULL)
77 TYPE_MALLOC(char, (size_t) MAX_STRTAB, stringbuf);
81 _nc_init_termtype(&(tp->tterm));
84 NCURSES_EXPORT(ENTRY *)
85 _nc_copy_entry(ENTRY * oldp)
87 ENTRY *newp = typeCalloc(ENTRY, 1);
91 _nc_copy_termtype2(&(newp->tterm), &(oldp->tterm));
96 /* save a copy of string in the string buffer */
97 NCURSES_EXPORT(char *)
98 _nc_save_str(const char *string)
101 size_t old_next_free = next_free;
104 if (stringbuf != NULL) {
105 if (!VALID_STRING(string))
107 len = strlen(string) + 1;
109 if (len == 1 && next_free != 0) {
111 * Cheat a little by making an empty string point to the end of the
114 if (next_free < MAX_STRTAB) {
115 result = (stringbuf + next_free - 1);
117 } else if (next_free + len < MAX_STRTAB) {
118 _nc_STRCPY(&stringbuf[next_free], string, MAX_STRTAB);
119 DEBUG(7, ("Saved string %s", _nc_visbuf(string)));
120 DEBUG(7, ("at location %d", (int) next_free));
122 result = (stringbuf + old_next_free);
124 _nc_warning("Too much data, some is lost: %s", string);
131 _nc_wrap_entry(ENTRY * const ep, bool copy_strings)
132 /* copy the string parts to allocated storage, preserving pointers to it */
134 int offsets[MAX_ENTRY_SIZE / sizeof(short)];
135 int useoffsets[MAX_USES];
140 if (ep == NULL || stringbuf == NULL)
141 _nc_err_abort("_nc_wrap_entry called without initialization");
146 next_free = 0; /* clear static storage */
148 /* copy term_names, Strings, uses */
149 tp->term_names = _nc_save_str(tp->term_names);
150 for_each_string(i, tp) {
151 if (tp->Strings[i] != ABSENT_STRING &&
152 tp->Strings[i] != CANCELLED_STRING) {
153 tp->Strings[i] = _nc_save_str(tp->Strings[i]);
157 for (i = 0; i < nuses; i++) {
158 if (ep->uses[i].name == 0) {
159 ep->uses[i].name = _nc_save_str(ep->uses[i].name);
166 assert(tp->term_names >= stringbuf);
167 n = (unsigned) (tp->term_names - stringbuf);
168 for_each_string(i, &(ep->tterm)) {
169 if (i < SIZEOF(offsets)) {
170 if (tp->Strings[i] == ABSENT_STRING) {
171 offsets[i] = ABSENT_OFFSET;
172 } else if (tp->Strings[i] == CANCELLED_STRING) {
173 offsets[i] = CANCELLED_OFFSET;
175 offsets[i] = (int) (tp->Strings[i] - stringbuf);
180 for (i = 0; i < nuses; i++) {
181 if (ep->uses[i].name == 0)
182 useoffsets[i] = ABSENT_OFFSET;
184 useoffsets[i] = (int) (ep->uses[i].name - stringbuf);
187 TYPE_MALLOC(char, next_free, tp->str_table);
188 (void) memcpy(tp->str_table, stringbuf, next_free);
190 tp->term_names = tp->str_table + n;
191 for_each_string(i, &(ep->tterm)) {
192 if (i < SIZEOF(offsets)) {
193 if (offsets[i] == ABSENT_OFFSET) {
194 tp->Strings[i] = ABSENT_STRING;
195 } else if (offsets[i] == CANCELLED_OFFSET) {
196 tp->Strings[i] = CANCELLED_STRING;
198 tp->Strings[i] = tp->str_table + offsets[i];
205 if ((n = (unsigned) NUM_EXT_NAMES(tp)) != 0) {
206 if (n < SIZEOF(offsets)) {
209 for (i = 0; i < n; i++) {
210 length += strlen(tp->ext_Names[i]) + 1;
211 offsets[i] = (int) (tp->ext_Names[i] - stringbuf);
213 TYPE_MALLOC(char, length, tp->ext_str_table);
214 for (i = 0, offset = 0; i < n; i++) {
215 tp->ext_Names[i] = tp->ext_str_table + offset;
216 _nc_STRCPY(tp->ext_Names[i],
217 stringbuf + offsets[i],
219 offset += strlen(tp->ext_Names[i]) + 1;
226 for (i = 0; i < nuses; i++) {
227 if (useoffsets[i] == ABSENT_OFFSET)
228 ep->uses[i].name = 0;
230 ep->uses[i].name = (tp->str_table + useoffsets[i]);
235 _nc_merge_entry(ENTRY * const target, ENTRY * const source)
236 /* merge capabilities from `from' entry into `to' entry */
238 TERMTYPE2 *to = &(target->tterm);
239 TERMTYPE2 *from = &(source->tterm);
245 if (source == 0 || from == 0 || target == 0 || to == 0)
249 _nc_copy_termtype2(©, from);
251 _nc_align_termtype(to, from);
253 for_each_boolean(i, from) {
254 if (to->Booleans[i] != (NCURSES_SBOOL) CANCELLED_BOOLEAN) {
255 int mergebool = from->Booleans[i];
257 if (mergebool == CANCELLED_BOOLEAN)
258 to->Booleans[i] = FALSE;
259 else if (mergebool == TRUE)
260 to->Booleans[i] = (NCURSES_SBOOL) mergebool;
264 for_each_number(i, from) {
265 if (to->Numbers[i] != CANCELLED_NUMERIC) {
266 int mergenum = from->Numbers[i];
268 if (mergenum == CANCELLED_NUMERIC)
269 to->Numbers[i] = ABSENT_NUMERIC;
270 else if (mergenum != ABSENT_NUMERIC)
271 to->Numbers[i] = (NCURSES_INT2) mergenum;
276 * Note: the copies of strings this makes don't have their own
277 * storage. This is OK right now, but will be a problem if we
278 * we ever want to deallocate entries.
280 for_each_string(i, from) {
281 if (to->Strings[i] != CANCELLED_STRING) {
282 char *mergestring = from->Strings[i];
284 if (mergestring == CANCELLED_STRING)
285 to->Strings[i] = ABSENT_STRING;
286 else if (mergestring != ABSENT_STRING)
287 to->Strings[i] = mergestring;
291 /* Discard the data allocated in _nc_copy_termtype2, but do not use
292 * _nc_free_termtype2 because that frees the string-table (which is
293 * not allocated by _nc_copy_termtype2).
298 free(copy.ext_Names);
304 _nc_alloc_entry_leaks(void)
306 if (stringbuf != NULL) {
307 FreeAndNull(stringbuf);