1 /****************************************************************************
2 * Copyright (c) 1998-2002,2003 Free Software Foundation, Inc. *
4 * Permission is hereby granted, free of charge, to any person obtaining a *
5 * copy of this software and associated documentation files (the *
6 * "Software"), to deal in the Software without restriction, including *
7 * without limitation the rights to use, copy, modify, merge, publish, *
8 * distribute, distribute with modifications, sublicense, and/or sell *
9 * copies of the Software, and to permit persons to whom the Software is *
10 * furnished to do so, subject to the following conditions: *
12 * The above copyright notice and this permission notice shall be included *
13 * in all copies or substantial portions of the Software. *
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
16 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
17 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
18 * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
19 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
20 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
21 * THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
23 * Except as contained in this notice, the name(s) of the above copyright *
24 * holders shall not be used in advertising or otherwise to promote the *
25 * sale, use or other dealings in this Software without prior written *
27 ****************************************************************************/
29 /****************************************************************************
30 * Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 *
31 * and: Eric S. Raymond <esr@snark.thyrsus.com> *
32 * and: Thomas E. Dickey 1996-2003 *
33 ****************************************************************************/
36 * alloc_entry.c -- allocation functions for terminfo entries
46 #include <curses.priv.h>
49 #include <term_entry.h>
51 MODULE_ID("$Id: alloc_entry.c,v 1.40 2003/11/08 21:29:54 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(TERMTYPE * const tp)
63 /* initialize a terminal type data block */
68 stringbuf = (char *) malloc(MAX_STRTAB);
71 tp->num_Booleans = BOOLCOUNT;
72 tp->num_Numbers = NUMCOUNT;
73 tp->num_Strings = STRCOUNT;
78 if (tp->Booleans == 0)
79 tp->Booleans = typeMalloc(char, BOOLCOUNT);
81 tp->Numbers = typeMalloc(short, NUMCOUNT);
83 tp->Strings = typeMalloc(char *, STRCOUNT);
85 for_each_boolean(i, tp)
86 tp->Booleans[i] = FALSE;
88 for_each_number(i, tp)
89 tp->Numbers[i] = ABSENT_NUMERIC;
91 for_each_string(i, tp)
92 tp->Strings[i] = ABSENT_STRING;
97 NCURSES_EXPORT(ENTRY *)
98 _nc_copy_entry(ENTRY * oldp)
100 ENTRY *newp = typeCalloc(ENTRY, 1);
104 _nc_copy_termtype(&(newp->tterm), &(oldp->tterm));
109 NCURSES_EXPORT(char *)
110 _nc_save_str(const char *const string)
111 /* save a copy of string in the string buffer */
113 size_t old_next_free = next_free;
114 size_t len = strlen(string) + 1;
116 if (next_free + len < MAX_STRTAB) {
117 strcpy(&stringbuf[next_free], string);
118 DEBUG(7, ("Saved string %s", _nc_visbuf(string)));
119 DEBUG(7, ("at location %d", (int) next_free));
122 return (stringbuf + old_next_free);
126 _nc_wrap_entry(ENTRY * const ep, bool copy_strings)
127 /* copy the string parts to allocated storage, preserving pointers to it */
129 int offsets[MAX_ENTRY_SIZE / 2], useoffsets[MAX_USES];
131 unsigned nuses = ep->nuses;
132 TERMTYPE *tp = &(ep->tterm);
135 next_free = 0; /* clear static storage */
137 /* copy term_names, Strings, uses */
138 tp->term_names = _nc_save_str(tp->term_names);
139 for_each_string(i, tp) {
140 if (tp->Strings[i] != ABSENT_STRING &&
141 tp->Strings[i] != CANCELLED_STRING) {
142 tp->Strings[i] = _nc_save_str(tp->Strings[i]);
146 for (i = 0; i < nuses; i++) {
147 if (ep->uses[i].name == 0) {
148 ep->uses[i].name = _nc_save_str(ep->uses[i].name);
155 n = tp->term_names - stringbuf;
156 for_each_string(i, &(ep->tterm)) {
157 if (tp->Strings[i] == ABSENT_STRING)
158 offsets[i] = ABSENT_OFFSET;
159 else if (tp->Strings[i] == CANCELLED_STRING)
160 offsets[i] = CANCELLED_OFFSET;
162 offsets[i] = tp->Strings[i] - stringbuf;
165 for (i = 0; i < nuses; i++) {
166 if (ep->uses[i].name == 0)
167 useoffsets[i] = ABSENT_OFFSET;
169 useoffsets[i] = ep->uses[i].name - stringbuf;
172 if ((tp->str_table = typeMalloc(char, next_free)) == (char *) 0)
173 _nc_err_abort(MSG_NO_MEMORY);
174 (void) memcpy(tp->str_table, stringbuf, next_free);
176 tp->term_names = tp->str_table + n;
177 for_each_string(i, &(ep->tterm)) {
178 if (offsets[i] == ABSENT_OFFSET)
179 tp->Strings[i] = ABSENT_STRING;
180 else if (offsets[i] == CANCELLED_OFFSET)
181 tp->Strings[i] = CANCELLED_STRING;
183 tp->Strings[i] = tp->str_table + offsets[i];
188 if ((n = NUM_EXT_NAMES(tp)) != 0) {
190 for (i = 0; i < n; i++) {
191 length += strlen(tp->ext_Names[i]) + 1;
192 offsets[i] = tp->ext_Names[i] - stringbuf;
194 if ((tp->ext_str_table = typeMalloc(char, length)) == 0)
195 _nc_err_abort(MSG_NO_MEMORY);
196 for (i = 0, length = 0; i < n; i++) {
197 tp->ext_Names[i] = tp->ext_str_table + length;
198 strcpy(tp->ext_Names[i], stringbuf + offsets[i]);
199 length += strlen(tp->ext_Names[i]) + 1;
205 for (i = 0; i < nuses; i++) {
206 if (useoffsets[i] == ABSENT_OFFSET)
207 ep->uses[i].name = 0;
209 ep->uses[i].name = (tp->str_table + useoffsets[i]);
214 _nc_merge_entry(TERMTYPE * const to, TERMTYPE * const from)
215 /* merge capabilities from `from' entry into `to' entry */
220 _nc_align_termtype(to, from);
222 for_each_boolean(i, from) {
223 if (to->Booleans[i] != CANCELLED_BOOLEAN) {
224 int mergebool = from->Booleans[i];
226 if (mergebool == CANCELLED_BOOLEAN)
227 to->Booleans[i] = FALSE;
228 else if (mergebool == TRUE)
229 to->Booleans[i] = mergebool;
233 for_each_number(i, from) {
234 if (to->Numbers[i] != CANCELLED_NUMERIC) {
235 int mergenum = from->Numbers[i];
237 if (mergenum == CANCELLED_NUMERIC)
238 to->Numbers[i] = ABSENT_NUMERIC;
239 else if (mergenum != ABSENT_NUMERIC)
240 to->Numbers[i] = mergenum;
245 * Note: the copies of strings this makes don't have their own
246 * storage. This is OK right now, but will be a problem if we
247 * we ever want to deallocate entries.
249 for_each_string(i, from) {
250 if (to->Strings[i] != CANCELLED_STRING) {
251 char *mergestring = from->Strings[i];
253 if (mergestring == CANCELLED_STRING)
254 to->Strings[i] = ABSENT_STRING;
255 else if (mergestring != ABSENT_STRING)
256 to->Strings[i] = mergestring;