1 /****************************************************************************
2 * Copyright (c) 1999-2013,2016 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>
45 MODULE_ID("$Id: alloc_ttype.c,v 1.28 2016/05/28 23:22:52 tom Exp $")
49 * Merge the a/b lists into dst. Both a/b are sorted (see _nc_extend_names()),
50 * so we do not have to worry about order dependencies.
53 merge_names(char **dst, char **a, int na, char **b, int nb)
56 while (na > 0 && nb > 0) {
57 int cmp = strcmp(*a, *b);
64 } else if (cmp == 0) {
76 DEBUG(4, ("merge_names -> %d", n));
81 find_name(char **table, int length, char *name)
83 while (length-- > 0) {
84 if (!strcmp(*table++, name)) {
85 DEBUG(4, ("found name '%s'", name));
89 DEBUG(4, ("did not find name '%s'", name));
93 #define EXTEND_NUM(num, ext) \
94 to->num = (unsigned short) (to->num + (ext - to->ext))
97 realign_data(TERMTYPE *to, char **ext_Names,
103 int limit = (to->ext_Booleans + to->ext_Numbers + to->ext_Strings);
105 if (to->ext_Booleans != ext_Booleans) {
106 EXTEND_NUM(num_Booleans, ext_Booleans);
107 TYPE_REALLOC(NCURSES_SBOOL, to->num_Booleans, to->Booleans);
108 for (n = to->ext_Booleans - 1,
109 m = ext_Booleans - 1,
110 base = to->num_Booleans - (m + 1); m >= 0; m--) {
111 if (find_name(to->ext_Names, limit, ext_Names[m])) {
112 to->Booleans[base + m] = to->Booleans[base + n--];
114 to->Booleans[base + m] = FALSE;
117 to->ext_Booleans = UShort(ext_Booleans);
120 if (to->ext_Numbers != ext_Numbers) {
121 EXTEND_NUM(num_Numbers, ext_Numbers);
122 TYPE_REALLOC(short, to->num_Numbers, to->Numbers);
123 for (n = to->ext_Numbers - 1,
125 base = to->num_Numbers - (m + 1); m >= 0; m--) {
126 if (find_name(to->ext_Names, limit, ext_Names[m + ext_Booleans])) {
127 to->Numbers[base + m] = to->Numbers[base + n--];
129 to->Numbers[base + m] = ABSENT_NUMERIC;
132 to->ext_Numbers = UShort(ext_Numbers);
134 if (to->ext_Strings != ext_Strings) {
135 EXTEND_NUM(num_Strings, ext_Strings);
136 TYPE_REALLOC(char *, to->num_Strings, to->Strings);
137 for (n = to->ext_Strings - 1,
139 base = to->num_Strings - (m + 1); m >= 0; m--) {
140 if (find_name(to->ext_Names, limit, ext_Names[m + ext_Booleans + ext_Numbers])) {
141 to->Strings[base + m] = to->Strings[base + n--];
143 to->Strings[base + m] = ABSENT_STRING;
146 to->ext_Strings = UShort(ext_Strings);
151 * Returns the first index in ext_Names[] for the given token-type
154 _nc_first_ext_name(TERMTYPE *tp, int token_type)
158 switch (token_type) {
163 first = tp->ext_Booleans;
166 first = (unsigned) (tp->ext_Booleans + tp->ext_Numbers);
176 * Returns the last index in ext_Names[] for the given token-type
179 _nc_last_ext_name(TERMTYPE *tp, int token_type)
183 switch (token_type) {
185 last = tp->ext_Booleans;
188 last = (unsigned) (tp->ext_Booleans + tp->ext_Numbers);
192 last = NUM_EXT_NAMES(tp);
199 * Lookup an entry from extended-names, returning -1 if not found
202 _nc_find_ext_name(TERMTYPE *tp, char *name, int token_type)
205 unsigned first = _nc_first_ext_name(tp, token_type);
206 unsigned last = _nc_last_ext_name(tp, token_type);
208 for (j = first; j < last; j++) {
209 if (!strcmp(name, tp->ext_Names[j])) {
217 * Translate an index into ext_Names[] into the corresponding index into data
218 * (e.g., Booleans[]).
221 _nc_ext_data_index(TERMTYPE *tp, int n, int token_type)
223 switch (token_type) {
225 n += (tp->num_Booleans - tp->ext_Booleans);
228 n += (tp->num_Numbers - tp->ext_Numbers)
229 - (tp->ext_Booleans);
233 n += (tp->num_Strings - tp->ext_Strings)
234 - (tp->ext_Booleans + tp->ext_Numbers);
240 * Adjust tables to remove (not free) an extended name and its corresponding
244 _nc_del_ext_name(TERMTYPE *tp, char *name, int token_type)
248 if ((first = _nc_find_ext_name(tp, name, token_type)) >= 0) {
250 int last = (int) NUM_EXT_NAMES(tp) - 1;
252 for (j = first; j < last; j++) {
253 tp->ext_Names[j] = tp->ext_Names[j + 1];
255 first = _nc_ext_data_index(tp, first, token_type);
256 switch (token_type) {
258 last = tp->num_Booleans - 1;
259 for (j = first; j < last; j++)
260 tp->Booleans[j] = tp->Booleans[j + 1];
265 last = tp->num_Numbers - 1;
266 for (j = first; j < last; j++)
267 tp->Numbers[j] = tp->Numbers[j + 1];
272 last = tp->num_Strings - 1;
273 for (j = first; j < last; j++)
274 tp->Strings[j] = tp->Strings[j + 1];
285 * Adjust tables to insert an extended name, making room for new data. The
286 * index into the corresponding data array is returned.
289 _nc_ins_ext_name(TERMTYPE *tp, char *name, int token_type)
291 unsigned first = _nc_first_ext_name(tp, token_type);
292 unsigned last = _nc_last_ext_name(tp, token_type);
293 unsigned total = NUM_EXT_NAMES(tp) + 1;
296 for (j = first; j < last; j++) {
297 int cmp = strcmp(name, tp->ext_Names[j]);
299 /* already present */
300 return _nc_ext_data_index(tp, (int) j, token_type);
306 TYPE_REALLOC(char *, total, tp->ext_Names);
307 for (k = total - 1; k > j; k--)
308 tp->ext_Names[k] = tp->ext_Names[k - 1];
309 tp->ext_Names[j] = name;
310 j = (unsigned) _nc_ext_data_index(tp, (int) j, token_type);
312 switch (token_type) {
316 TYPE_REALLOC(NCURSES_SBOOL, tp->num_Booleans, tp->Booleans);
317 for (k = (unsigned) (tp->num_Booleans - 1); k > j; k--)
318 tp->Booleans[k] = tp->Booleans[k - 1];
323 TYPE_REALLOC(short, tp->num_Numbers, tp->Numbers);
324 for (k = (unsigned) (tp->num_Numbers - 1); k > j; k--)
325 tp->Numbers[k] = tp->Numbers[k - 1];
330 TYPE_REALLOC(char *, tp->num_Strings, tp->Strings);
331 for (k = (unsigned) (tp->num_Strings - 1); k > j; k--)
332 tp->Strings[k] = tp->Strings[k - 1];
339 * Look for strings that are marked cancelled, which happen to be the same name
340 * as a boolean or number. We'll get this as a special case when we get a
341 * cancellation of a name that is inherited from another entry.
344 adjust_cancels(TERMTYPE *to, TERMTYPE *from)
346 int first = to->ext_Booleans + to->ext_Numbers;
347 int last = first + to->ext_Strings;
350 for (j = first; j < last;) {
351 char *name = to->ext_Names[j];
352 int j_str = to->num_Strings - first - to->ext_Strings;
354 if (to->Strings[j + j_str] == CANCELLED_STRING) {
355 if (_nc_find_ext_name(from, to->ext_Names[j], BOOLEAN) >= 0) {
356 if (_nc_del_ext_name(to, name, STRING)
357 || _nc_del_ext_name(to, name, NUMBER)) {
358 k = _nc_ins_ext_name(to, name, BOOLEAN);
359 to->Booleans[k] = FALSE;
363 } else if (_nc_find_ext_name(from, to->ext_Names[j], NUMBER) >= 0) {
364 if (_nc_del_ext_name(to, name, STRING)
365 || _nc_del_ext_name(to, name, BOOLEAN)) {
366 k = _nc_ins_ext_name(to, name, NUMBER);
367 to->Numbers[k] = CANCELLED_NUMERIC;
371 } else if (_nc_find_ext_name(from, to->ext_Names[j], STRING) >= 0) {
372 if (_nc_del_ext_name(to, name, NUMBER)
373 || _nc_del_ext_name(to, name, BOOLEAN)) {
374 k = _nc_ins_ext_name(to, name, STRING);
375 to->Strings[k] = CANCELLED_STRING;
389 _nc_align_termtype(TERMTYPE *to, TERMTYPE *from)
391 int na = (int) NUM_EXT_NAMES(to);
392 int nb = (int) NUM_EXT_NAMES(from);
395 DEBUG(2, ("align_termtype to(%d:%s), from(%d:%s)", na, to->term_names,
396 nb, from->term_names));
398 if (na != 0 || nb != 0) {
399 int ext_Booleans, ext_Numbers, ext_Strings;
400 bool used_ext_Names = FALSE;
402 if ((na == nb) /* check if the arrays are equivalent */
403 &&(to->ext_Booleans == from->ext_Booleans)
404 && (to->ext_Numbers == from->ext_Numbers)
405 && (to->ext_Strings == from->ext_Strings)) {
409 for (n = 0, same = TRUE; n < na; n++) {
410 if (strcmp(to->ext_Names[n], from->ext_Names[n])) {
419 * This is where we pay for having a simple extension representation.
420 * Allocate a new ext_Names array and merge the two ext_Names arrays
421 * into it, updating to's counts for booleans, etc. Fortunately we do
422 * this only for the terminfo compiler (tic) and comparer (infocmp).
424 TYPE_MALLOC(char *, (size_t)(na + nb), ext_Names);
426 if (to->ext_Strings && (from->ext_Booleans + from->ext_Numbers))
427 adjust_cancels(to, from);
429 if (from->ext_Strings && (to->ext_Booleans + to->ext_Numbers))
430 adjust_cancels(from, to);
432 ext_Booleans = merge_names(ext_Names,
437 ext_Numbers = merge_names(ext_Names + ext_Booleans,
442 + from->ext_Booleans,
444 ext_Strings = merge_names(ext_Names + ext_Numbers + ext_Booleans,
454 * Now we must reallocate the Booleans, etc., to allow the data to be
457 if (na != (ext_Booleans + ext_Numbers + ext_Strings)) {
458 realign_data(to, ext_Names, ext_Booleans, ext_Numbers, ext_Strings);
459 FreeIfNeeded(to->ext_Names);
460 to->ext_Names = ext_Names;
461 DEBUG(2, ("realigned %d extended names for '%s' (to)",
462 NUM_EXT_NAMES(to), to->term_names));
463 used_ext_Names = TRUE;
465 if (nb != (ext_Booleans + ext_Numbers + ext_Strings)) {
466 nb = (ext_Booleans + ext_Numbers + ext_Strings);
467 realign_data(from, ext_Names, ext_Booleans, ext_Numbers, ext_Strings);
468 TYPE_REALLOC(char *, (size_t) nb, from->ext_Names);
469 memcpy(from->ext_Names, ext_Names, sizeof(char *) * (size_t) nb);
470 DEBUG(2, ("realigned %d extended names for '%s' (from)",
471 NUM_EXT_NAMES(from), from->term_names));
480 _nc_copy_termtype(TERMTYPE *dst, const TERMTYPE *src)
486 *dst = *src; /* ...to copy the sizes and string-tables */
488 TYPE_MALLOC(NCURSES_SBOOL, NUM_BOOLEANS(dst), dst->Booleans);
489 TYPE_MALLOC(short, NUM_NUMBERS(dst), dst->Numbers);
490 TYPE_MALLOC(char *, NUM_STRINGS(dst), dst->Strings);
492 memcpy(dst->Booleans,
494 NUM_BOOLEANS(dst) * sizeof(dst->Booleans[0]));
497 NUM_NUMBERS(dst) * sizeof(dst->Numbers[0]));
500 NUM_STRINGS(dst) * sizeof(dst->Strings[0]));
502 /* FIXME: we probably should also copy str_table and ext_str_table,
503 * but tic and infocmp are not written to exploit that (yet).
507 if ((i = NUM_EXT_NAMES(src)) != 0) {
508 TYPE_MALLOC(char *, i, dst->ext_Names);
509 memcpy(dst->ext_Names, src->ext_Names, i * sizeof(char *));