1 /****************************************************************************
2 * Copyright (c) 1999-2006,2008 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: Thomas E. Dickey <dickey@clark.net> 1999-on *
31 ****************************************************************************/
34 * align_ttype.c -- functions for TERMTYPE
36 * _nc_align_termtype()
41 #include <curses.priv.h>
44 #include <term_entry.h>
46 MODULE_ID("$Id: alloc_ttype.c,v 1.17 2008/10/12 16:12:00 tom Exp $")
50 * Merge the a/b lists into dst. Both a/b are sorted (see _nc_extend_names()),
51 * so we do not have to worry about order dependencies.
54 merge_names(char **dst, char **a, int na, char **b, int nb)
57 while (na > 0 && nb > 0) {
58 int cmp = strcmp(*a, *b);
65 } else if (cmp == 0) {
77 DEBUG(4, ("merge_names -> %d", n));
82 find_name(char **table, int length, char *name)
84 while (length-- > 0) {
85 if (!strcmp(*table++, name)) {
86 DEBUG(4, ("found name '%s'", name));
90 DEBUG(4, ("did not find name '%s'", name));
95 realign_data(TERMTYPE *to, char **ext_Names,
101 int limit = (to->ext_Booleans + to->ext_Numbers + to->ext_Strings);
103 if (to->ext_Booleans != ext_Booleans) {
104 to->num_Booleans += (ext_Booleans - to->ext_Booleans);
105 to->Booleans = typeRealloc(NCURSES_SBOOL, to->num_Booleans, to->Booleans);
106 for (n = to->ext_Booleans - 1,
107 m = ext_Booleans - 1,
108 base = to->num_Booleans - (m + 1); m >= 0; m--) {
109 if (find_name(to->ext_Names, limit, ext_Names[m])) {
110 to->Booleans[base + m] = to->Booleans[base + n--];
112 to->Booleans[base + m] = FALSE;
115 to->ext_Booleans = ext_Booleans;
117 if (to->ext_Numbers != ext_Numbers) {
118 to->num_Numbers += (ext_Numbers - to->ext_Numbers);
119 to->Numbers = typeRealloc(short, to->num_Numbers, to->Numbers);
120 for (n = to->ext_Numbers - 1,
122 base = to->num_Numbers - (m + 1); m >= 0; m--) {
123 if (find_name(to->ext_Names, limit, ext_Names[m + ext_Booleans])) {
124 to->Numbers[base + m] = to->Numbers[base + n--];
126 to->Numbers[base + m] = ABSENT_NUMERIC;
129 to->ext_Numbers = ext_Numbers;
131 if (to->ext_Strings != ext_Strings) {
132 to->num_Strings += (ext_Strings - to->ext_Strings);
133 to->Strings = typeRealloc(char *, to->num_Strings, to->Strings);
134 for (n = to->ext_Strings - 1,
136 base = to->num_Strings - (m + 1); m >= 0; m--) {
137 if (find_name(to->ext_Names, limit, ext_Names[m + ext_Booleans + ext_Numbers])) {
138 to->Strings[base + m] = to->Strings[base + n--];
140 to->Strings[base + m] = ABSENT_STRING;
143 to->ext_Strings = ext_Strings;
148 * Returns the first index in ext_Names[] for the given token-type
151 _nc_first_ext_name(TERMTYPE *tp, int token_type)
155 switch (token_type) {
160 first = tp->ext_Booleans;
163 first = tp->ext_Booleans + tp->ext_Numbers;
173 * Returns the last index in ext_Names[] for the given token-type
176 _nc_last_ext_name(TERMTYPE *tp, int token_type)
180 switch (token_type) {
182 last = tp->ext_Booleans;
185 last = tp->ext_Booleans + tp->ext_Numbers;
189 last = NUM_EXT_NAMES(tp);
196 * Lookup an entry from extended-names, returning -1 if not found
199 _nc_find_ext_name(TERMTYPE *tp, char *name, int token_type)
202 unsigned first = _nc_first_ext_name(tp, token_type);
203 unsigned last = _nc_last_ext_name(tp, token_type);
205 for (j = first; j < last; j++) {
206 if (!strcmp(name, tp->ext_Names[j])) {
214 * Translate an index into ext_Names[] into the corresponding index into data
215 * (e.g., Booleans[]).
218 _nc_ext_data_index(TERMTYPE *tp, int n, int token_type)
220 switch (token_type) {
222 n += (tp->num_Booleans - tp->ext_Booleans);
225 n += (tp->num_Numbers - tp->ext_Numbers)
226 - (tp->ext_Booleans);
230 n += (tp->num_Strings - tp->ext_Strings)
231 - (tp->ext_Booleans + tp->ext_Numbers);
237 * Adjust tables to remove (not free) an extended name and its corresponding
241 _nc_del_ext_name(TERMTYPE *tp, char *name, int token_type)
246 if ((first = _nc_find_ext_name(tp, name, token_type)) >= 0) {
247 last = NUM_EXT_NAMES(tp) - 1;
248 for (j = first; j < last; j++) {
249 tp->ext_Names[j] = tp->ext_Names[j + 1];
251 first = _nc_ext_data_index(tp, first, token_type);
252 switch (token_type) {
254 last = tp->num_Booleans - 1;
255 for (j = first; j < last; j++)
256 tp->Booleans[j] = tp->Booleans[j + 1];
257 tp->ext_Booleans -= 1;
258 tp->num_Booleans -= 1;
261 last = tp->num_Numbers - 1;
262 for (j = first; j < last; j++)
263 tp->Numbers[j] = tp->Numbers[j + 1];
264 tp->ext_Numbers -= 1;
265 tp->num_Numbers -= 1;
268 last = tp->num_Strings - 1;
269 for (j = first; j < last; j++)
270 tp->Strings[j] = tp->Strings[j + 1];
271 tp->ext_Strings -= 1;
272 tp->num_Strings -= 1;
281 * Adjust tables to insert an extended name, making room for new data. The
282 * index into the corresponding data array is returned.
285 _nc_ins_ext_name(TERMTYPE *tp, char *name, int token_type)
287 unsigned first = _nc_first_ext_name(tp, token_type);
288 unsigned last = _nc_last_ext_name(tp, token_type);
289 unsigned total = NUM_EXT_NAMES(tp) + 1;
292 for (j = first; j < last; j++) {
293 int cmp = strcmp(name, tp->ext_Names[j]);
295 /* already present */
296 return _nc_ext_data_index(tp, (int) j, token_type);
302 tp->ext_Names = typeRealloc(char *, total, tp->ext_Names);
303 for (k = total - 1; k > j; k--)
304 tp->ext_Names[k] = tp->ext_Names[k - 1];
305 tp->ext_Names[j] = name;
306 j = _nc_ext_data_index(tp, (int) j, token_type);
308 switch (token_type) {
310 tp->ext_Booleans += 1;
311 tp->num_Booleans += 1;
312 tp->Booleans = typeRealloc(NCURSES_SBOOL, tp->num_Booleans, tp->Booleans);
313 for (k = tp->num_Booleans - 1; k > j; k--)
314 tp->Booleans[k] = tp->Booleans[k - 1];
317 tp->ext_Numbers += 1;
318 tp->num_Numbers += 1;
319 tp->Numbers = typeRealloc(short, tp->num_Numbers, tp->Numbers);
320 for (k = tp->num_Numbers - 1; k > j; k--)
321 tp->Numbers[k] = tp->Numbers[k - 1];
324 tp->ext_Strings += 1;
325 tp->num_Strings += 1;
326 tp->Strings = typeRealloc(char *, tp->num_Strings, tp->Strings);
327 for (k = tp->num_Strings - 1; k > j; k--)
328 tp->Strings[k] = tp->Strings[k - 1];
335 * Look for strings that are marked cancelled, which happen to be the same name
336 * as a boolean or number. We'll get this as a special case when we get a
337 * cancellation of a name that is inherited from another entry.
340 adjust_cancels(TERMTYPE *to, TERMTYPE *from)
342 int first = to->ext_Booleans + to->ext_Numbers;
343 int last = first + to->ext_Strings;
346 for (j = first; j < last;) {
347 char *name = to->ext_Names[j];
348 unsigned j_str = to->num_Strings - first - to->ext_Strings;
350 if (to->Strings[j + j_str] == CANCELLED_STRING) {
351 if ((k = _nc_find_ext_name(from, to->ext_Names[j], BOOLEAN)) >= 0) {
352 if (_nc_del_ext_name(to, name, STRING)
353 || _nc_del_ext_name(to, name, NUMBER)) {
354 k = _nc_ins_ext_name(to, name, BOOLEAN);
355 to->Booleans[k] = FALSE;
359 } else if ((k = _nc_find_ext_name(from, to->ext_Names[j],
361 if (_nc_del_ext_name(to, name, STRING)
362 || _nc_del_ext_name(to, name, BOOLEAN)) {
363 k = _nc_ins_ext_name(to, name, NUMBER);
364 to->Numbers[k] = CANCELLED_NUMERIC;
368 } else if ((k = _nc_find_ext_name(from, to->ext_Names[j],
370 if (_nc_del_ext_name(to, name, NUMBER)
371 || _nc_del_ext_name(to, name, BOOLEAN)) {
372 k = _nc_ins_ext_name(to, name, STRING);
373 to->Strings[k] = CANCELLED_STRING;
387 _nc_align_termtype(TERMTYPE *to, TERMTYPE *from)
389 int na = NUM_EXT_NAMES(to);
390 int nb = NUM_EXT_NAMES(from);
394 int ext_Booleans, ext_Numbers, ext_Strings;
395 bool used_ext_Names = FALSE;
397 DEBUG(2, ("align_termtype to(%d:%s), from(%d:%s)", na, to->term_names,
398 nb, from->term_names));
400 if (na != 0 || nb != 0) {
401 if ((na == nb) /* check if the arrays are equivalent */
402 &&(to->ext_Booleans == from->ext_Booleans)
403 && (to->ext_Numbers == from->ext_Numbers)
404 && (to->ext_Strings == from->ext_Strings)) {
405 for (n = 0, same = TRUE; n < na; n++) {
406 if (strcmp(to->ext_Names[n], from->ext_Names[n])) {
415 * This is where we pay for having a simple extension representation.
416 * Allocate a new ext_Names array and merge the two ext_Names arrays
417 * into it, updating to's counts for booleans, etc. Fortunately we do
418 * this only for the terminfo compiler (tic) and comparer (infocmp).
420 ext_Names = typeMalloc(char *, na + nb);
422 if (to->ext_Strings && (from->ext_Booleans + from->ext_Numbers))
423 adjust_cancels(to, from);
425 if (from->ext_Strings && (to->ext_Booleans + to->ext_Numbers))
426 adjust_cancels(from, to);
428 ext_Booleans = merge_names(ext_Names,
433 ext_Numbers = merge_names(ext_Names + ext_Booleans,
438 + from->ext_Booleans,
440 ext_Strings = merge_names(ext_Names + ext_Numbers + ext_Booleans,
450 * Now we must reallocate the Booleans, etc., to allow the data to be
453 if (na != (ext_Booleans + ext_Numbers + ext_Strings)) {
454 realign_data(to, ext_Names, ext_Booleans, ext_Numbers, ext_Strings);
455 FreeIfNeeded(to->ext_Names);
456 to->ext_Names = ext_Names;
457 DEBUG(2, ("realigned %d extended names for '%s' (to)",
458 NUM_EXT_NAMES(to), to->term_names));
459 used_ext_Names = TRUE;
461 if (nb != (ext_Booleans + ext_Numbers + ext_Strings)) {
462 nb = (ext_Booleans + ext_Numbers + ext_Strings);
463 realign_data(from, ext_Names, ext_Booleans, ext_Numbers, ext_Strings);
464 from->ext_Names = typeRealloc(char *, nb, from->ext_Names);
465 memcpy(from->ext_Names, ext_Names, sizeof(char *) * nb);
466 DEBUG(2, ("realigned %d extended names for '%s' (from)",
467 NUM_EXT_NAMES(from), from->term_names));
476 _nc_copy_termtype(TERMTYPE *dst, TERMTYPE *src)
480 *dst = *src; /* ...to copy the sizes and string-tables */
481 dst->Booleans = typeMalloc(NCURSES_SBOOL, NUM_BOOLEANS(dst));
482 dst->Numbers = typeMalloc(short, NUM_NUMBERS(dst));
483 dst->Strings = typeMalloc(char *, NUM_STRINGS(dst));
485 /* FIXME: use memcpy for these and similar loops */
486 for_each_boolean(i, dst)
487 dst->Booleans[i] = src->Booleans[i];
488 for_each_number(i, dst)
489 dst->Numbers[i] = src->Numbers[i];
490 for_each_string(i, dst)
491 dst->Strings[i] = src->Strings[i];
493 /* FIXME: we probably should also copy str_table and ext_str_table,
494 * but tic and infocmp are not written to exploit that (yet).
498 if ((i = NUM_EXT_NAMES(src)) != 0) {
499 dst->ext_Names = typeMalloc(char *, i);
500 memcpy(dst->ext_Names, src->ext_Names, i * sizeof(char *));