1 /****************************************************************************
2 * Copyright (c) 1998,2000 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 ****************************************************************************/
35 * alloc_entry.c -- allocation functions for terminfo entries
45 #include <curses.priv.h>
48 #include <term_entry.h>
50 MODULE_ID("$Id: alloc_entry.c,v 1.32 2000/03/12 00:16:31 tom Exp $")
52 #define ABSENT_OFFSET -1
53 #define CANCELLED_OFFSET -2
55 #define MAX_STRTAB 4096 /* documented maximum entry size */
57 static char stringbuf[MAX_STRTAB]; /* buffer for string capabilities */
58 static size_t next_free; /* next free character in stringbuf */
61 _nc_init_entry(TERMTYPE * const tp)
62 /* initialize a terminal type data block */
67 tp->num_Booleans = BOOLCOUNT;
68 tp->num_Numbers = NUMCOUNT;
69 tp->num_Strings = STRCOUNT;
74 if (tp->Booleans == 0)
75 tp->Booleans = typeMalloc(char, BOOLCOUNT);
77 tp->Numbers = typeMalloc(short, NUMCOUNT);
79 tp->Strings = typeMalloc(char *, STRCOUNT);
81 for_each_boolean(i, tp)
82 tp->Booleans[i] = FALSE;
84 for_each_number(i, tp)
85 tp->Numbers[i] = ABSENT_NUMERIC;
87 for_each_string(i, tp)
88 tp->Strings[i] = ABSENT_STRING;
94 _nc_copy_entry(ENTRY * oldp)
96 ENTRY *newp = typeCalloc(ENTRY, 1);
100 _nc_copy_termtype(&(newp->tterm), &(oldp->tterm));
106 _nc_save_str(const char *const string)
107 /* save a copy of string in the string buffer */
109 size_t old_next_free = next_free;
110 size_t len = strlen(string) + 1;
112 if (next_free + len < MAX_STRTAB) {
113 strcpy(&stringbuf[next_free], string);
114 DEBUG(7, ("Saved string %s", _nc_visbuf(string)));
115 DEBUG(7, ("at location %d", (int) next_free));
118 return (stringbuf + old_next_free);
122 _nc_wrap_entry(ENTRY * const ep)
123 /* copy the string parts to allocated storage, preserving pointers to it */
125 int offsets[MAX_ENTRY_SIZE / 2], useoffsets[MAX_USES];
127 TERMTYPE *tp = &(ep->tterm);
129 n = tp->term_names - stringbuf;
130 for_each_string(i, &(ep->tterm)) {
131 if (tp->Strings[i] == ABSENT_STRING)
132 offsets[i] = ABSENT_OFFSET;
133 else if (tp->Strings[i] == CANCELLED_STRING)
134 offsets[i] = CANCELLED_OFFSET;
136 offsets[i] = tp->Strings[i] - stringbuf;
139 for (i = 0; i < ep->nuses; i++) {
140 if (ep->uses[i].name == 0)
141 useoffsets[i] = ABSENT_OFFSET;
143 useoffsets[i] = ep->uses[i].name - stringbuf;
146 if ((tp->str_table = typeMalloc(char, next_free)) == (char *) 0)
147 _nc_err_abort("Out of memory");
148 (void) memcpy(tp->str_table, stringbuf, next_free);
150 tp->term_names = tp->str_table + n;
151 for_each_string(i, &(ep->tterm)) {
152 if (offsets[i] == ABSENT_OFFSET)
153 tp->Strings[i] = ABSENT_STRING;
154 else if (offsets[i] == CANCELLED_OFFSET)
155 tp->Strings[i] = CANCELLED_STRING;
157 tp->Strings[i] = tp->str_table + offsets[i];
161 if ((n = NUM_EXT_NAMES(tp)) != 0) {
163 for (i = 0; i < n; i++) {
164 length += strlen(tp->ext_Names[i]) + 1;
165 offsets[i] = tp->ext_Names[i] - stringbuf;
167 if ((tp->ext_str_table = typeMalloc(char, length)) == 0)
168 _nc_err_abort("Out of memory");
169 for (i = 0, length = 0; i < n; i++) {
170 tp->ext_Names[i] = tp->ext_str_table + length;
171 strcpy(tp->ext_Names[i], stringbuf + offsets[i]);
172 length += strlen(tp->ext_Names[i]) + 1;
177 for (i = 0; i < ep->nuses; i++) {
178 if (useoffsets[i] == ABSENT_OFFSET)
179 ep->uses[i].name = 0;
181 ep->uses[i].name = (tp->str_table + useoffsets[i]);
186 _nc_merge_entry(TERMTYPE * const to, TERMTYPE * const from)
187 /* merge capabilities from `from' entry into `to' entry */
192 _nc_align_termtype(to, from);
194 for_each_boolean(i, from) {
195 int mergebool = from->Booleans[i];
197 if (mergebool == CANCELLED_BOOLEAN)
198 to->Booleans[i] = FALSE;
199 else if (mergebool == TRUE)
200 to->Booleans[i] = mergebool;
203 for_each_number(i, from) {
204 int mergenum = from->Numbers[i];
206 if (mergenum == CANCELLED_NUMERIC)
207 to->Numbers[i] = ABSENT_NUMERIC;
208 else if (mergenum != ABSENT_NUMERIC)
209 to->Numbers[i] = mergenum;
213 * Note: the copies of strings this makes don't have their own
214 * storage. This is OK right now, but will be a problem if we
215 * we ever want to deallocate entries.
217 for_each_string(i, from) {
218 char *mergestring = from->Strings[i];
220 if (mergestring == CANCELLED_STRING)
221 to->Strings[i] = ABSENT_STRING;
222 else if (mergestring != ABSENT_STRING)
223 to->Strings[i] = mergestring;