10e3d5408SPeter Wemm /****************************************************************************
24a1a9510SRong-En Fan * Copyright 2018-2019,2020 Thomas E. Dickey *
30e3d5408SPeter Wemm * Copyright 1999-2016,2017 Free Software Foundation, Inc. *
40e3d5408SPeter Wemm * *
50e3d5408SPeter Wemm * Permission is hereby granted, free of charge, to any person obtaining a *
60e3d5408SPeter Wemm * copy of this software and associated documentation files (the *
70e3d5408SPeter Wemm * "Software"), to deal in the Software without restriction, including *
80e3d5408SPeter Wemm * without limitation the rights to use, copy, modify, merge, publish, *
90e3d5408SPeter Wemm * distribute, distribute with modifications, sublicense, and/or sell *
100e3d5408SPeter Wemm * copies of the Software, and to permit persons to whom the Software is *
110e3d5408SPeter Wemm * furnished to do so, subject to the following conditions: *
120e3d5408SPeter Wemm * *
130e3d5408SPeter Wemm * The above copyright notice and this permission notice shall be included *
140e3d5408SPeter Wemm * in all copies or substantial portions of the Software. *
150e3d5408SPeter Wemm * *
160e3d5408SPeter Wemm * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
170e3d5408SPeter Wemm * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
180e3d5408SPeter Wemm * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
190e3d5408SPeter Wemm * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
200e3d5408SPeter Wemm * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
210e3d5408SPeter Wemm * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
220e3d5408SPeter Wemm * THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
230e3d5408SPeter Wemm * *
240e3d5408SPeter Wemm * Except as contained in this notice, the name(s) of the above copyright *
250e3d5408SPeter Wemm * holders shall not be used in advertising or otherwise to promote the *
260e3d5408SPeter Wemm * sale, use or other dealings in this Software without prior written *
270e3d5408SPeter Wemm * authorization. *
280e3d5408SPeter Wemm ****************************************************************************/
290e3d5408SPeter Wemm
304a1a9510SRong-En Fan /****************************************************************************
310e3d5408SPeter Wemm * Author: Thomas E. Dickey <dickey@clark.net> 1999-on *
320e3d5408SPeter Wemm ****************************************************************************/
330e3d5408SPeter Wemm
340e3d5408SPeter Wemm /*
350e3d5408SPeter Wemm * align_ttype.c -- functions for TERMTYPE
360e3d5408SPeter Wemm *
370e3d5408SPeter Wemm * _nc_align_termtype()
380e3d5408SPeter Wemm * _nc_copy_termtype()
390e3d5408SPeter Wemm *
400e3d5408SPeter Wemm */
410e3d5408SPeter Wemm
420e3d5408SPeter Wemm #include <curses.priv.h>
430e3d5408SPeter Wemm
440e3d5408SPeter Wemm #include <tic.h>
450e3d5408SPeter Wemm
464a1a9510SRong-En Fan MODULE_ID("$Id: alloc_ttype.c,v 1.33 2020/02/02 23:34:34 tom Exp $")
470e3d5408SPeter Wemm
480e3d5408SPeter Wemm #if NCURSES_XNAMES
490e3d5408SPeter Wemm /*
500e3d5408SPeter Wemm * Merge the a/b lists into dst. Both a/b are sorted (see _nc_extend_names()),
510e3d5408SPeter Wemm * so we do not have to worry about order dependencies.
520e3d5408SPeter Wemm */
5315589c42SPeter Wemm static int
merge_names(char ** dst,char ** a,int na,char ** b,int nb)5415589c42SPeter Wemm merge_names(char **dst, char **a, int na, char **b, int nb)
550e3d5408SPeter Wemm {
560e3d5408SPeter Wemm int n = 0;
5718259542SPeter Wemm while (na > 0 && nb > 0) {
580e3d5408SPeter Wemm int cmp = strcmp(*a, *b);
590e3d5408SPeter Wemm if (cmp < 0) {
600e3d5408SPeter Wemm dst[n++] = *a++;
610e3d5408SPeter Wemm na--;
620e3d5408SPeter Wemm } else if (cmp > 0) {
630e3d5408SPeter Wemm dst[n++] = *b++;
640e3d5408SPeter Wemm nb--;
650e3d5408SPeter Wemm } else {
660e3d5408SPeter Wemm dst[n++] = *a;
670e3d5408SPeter Wemm a++, b++;
680e3d5408SPeter Wemm na--, nb--;
690e3d5408SPeter Wemm }
700e3d5408SPeter Wemm }
710e3d5408SPeter Wemm while (na-- > 0) {
720e3d5408SPeter Wemm dst[n++] = *a++;
730e3d5408SPeter Wemm }
740e3d5408SPeter Wemm while (nb-- > 0) {
750e3d5408SPeter Wemm dst[n++] = *b++;
760e3d5408SPeter Wemm }
770e3d5408SPeter Wemm DEBUG(4, ("merge_names -> %d", n));
780e3d5408SPeter Wemm return n;
790e3d5408SPeter Wemm }
800e3d5408SPeter Wemm
8115589c42SPeter Wemm static bool
find_name(char ** table,int item,int length,const char * name)8215589c42SPeter Wemm find_name(char **table, int item, int length, const char *name)
830e3d5408SPeter Wemm {
840e3d5408SPeter Wemm int n;
850e3d5408SPeter Wemm int result = -1;
860e3d5408SPeter Wemm
870e3d5408SPeter Wemm for (n = item; n < length; ++n) {
880e3d5408SPeter Wemm if (!strcmp(table[n], name)) {
890e3d5408SPeter Wemm DEBUG(4, ("found name '%s' @%d", name, n));
900e3d5408SPeter Wemm result = n;
910e3d5408SPeter Wemm break;
920e3d5408SPeter Wemm }
930e3d5408SPeter Wemm }
9415589c42SPeter Wemm if (result < 0) {
954a1a9510SRong-En Fan DEBUG(4, ("did not find name '%s'", name));
964a1a9510SRong-En Fan }
974a1a9510SRong-En Fan return (result >= 0);
984a1a9510SRong-En Fan }
990e3d5408SPeter Wemm
1000e3d5408SPeter Wemm #define EXTEND_NUM(num, ext) \
1010e3d5408SPeter Wemm DEBUG(4, ("extending " #num " from %d to %d", \
1020e3d5408SPeter Wemm to->num, (unsigned short) (to->num + (ext - to->ext)))); \
1030e3d5408SPeter Wemm to->num = (unsigned short) (to->num + (ext - to->ext))
1040e3d5408SPeter Wemm
1054a1a9510SRong-En Fan static void
realign_data(TERMTYPE2 * to,char ** ext_Names,int ext_Booleans,int ext_Numbers,int ext_Strings)1060e3d5408SPeter Wemm realign_data(TERMTYPE2 *to, char **ext_Names,
1070e3d5408SPeter Wemm int ext_Booleans,
1080e3d5408SPeter Wemm int ext_Numbers,
1090e3d5408SPeter Wemm int ext_Strings)
1100e3d5408SPeter Wemm {
1110e3d5408SPeter Wemm int n, m, base;
1120e3d5408SPeter Wemm int to_Booleans = to->ext_Booleans;
1130e3d5408SPeter Wemm int to_Numbers = to->ext_Numbers;
1140e3d5408SPeter Wemm int to_Strings = to->ext_Strings;
1150e3d5408SPeter Wemm int to1, to2, from;
1160e3d5408SPeter Wemm
1170e3d5408SPeter Wemm DEBUG(4, ("realign_data %d/%d/%d vs %d/%d/%d",
1180e3d5408SPeter Wemm ext_Booleans,
1190e3d5408SPeter Wemm ext_Numbers,
1200e3d5408SPeter Wemm ext_Strings,
1210e3d5408SPeter Wemm to->ext_Booleans,
1220e3d5408SPeter Wemm to->ext_Numbers,
1230e3d5408SPeter Wemm to->ext_Strings));
1240e3d5408SPeter Wemm
1250e3d5408SPeter Wemm if (to->ext_Booleans != ext_Booleans) {
1260e3d5408SPeter Wemm to1 = 0;
1270e3d5408SPeter Wemm to2 = to_Booleans + to1;
1280e3d5408SPeter Wemm from = 0;
1290e3d5408SPeter Wemm EXTEND_NUM(num_Booleans, ext_Booleans);
1300e3d5408SPeter Wemm TYPE_REALLOC(NCURSES_SBOOL, to->num_Booleans, to->Booleans);
1310e3d5408SPeter Wemm for (n = to->ext_Booleans - 1,
1320e3d5408SPeter Wemm m = ext_Booleans - 1,
1330e3d5408SPeter Wemm base = to->num_Booleans - (m + 1); m >= 0; m--) {
1340e3d5408SPeter Wemm if (find_name(to->ext_Names, to1, to2, ext_Names[m + from])) {
1350e3d5408SPeter Wemm to->Booleans[base + m] = to->Booleans[base + n--];
1360e3d5408SPeter Wemm } else {
1370e3d5408SPeter Wemm to->Booleans[base + m] = FALSE;
1380e3d5408SPeter Wemm }
1390e3d5408SPeter Wemm }
1400e3d5408SPeter Wemm to->ext_Booleans = UShort(ext_Booleans);
1410e3d5408SPeter Wemm }
1420e3d5408SPeter Wemm
1430e3d5408SPeter Wemm if (to->ext_Numbers != ext_Numbers) {
1440e3d5408SPeter Wemm to1 = to_Booleans;
1450e3d5408SPeter Wemm to2 = to_Numbers + to1;
1460e3d5408SPeter Wemm from = ext_Booleans;
1470e3d5408SPeter Wemm EXTEND_NUM(num_Numbers, ext_Numbers);
1480e3d5408SPeter Wemm TYPE_REALLOC(NCURSES_INT2, to->num_Numbers, to->Numbers);
1490e3d5408SPeter Wemm for (n = to->ext_Numbers - 1,
15015589c42SPeter Wemm m = ext_Numbers - 1,
15115589c42SPeter Wemm base = to->num_Numbers - (m + 1); m >= 0; m--) {
1520e3d5408SPeter Wemm if (find_name(to->ext_Names, to1, to2, ext_Names[m + from])) {
1530e3d5408SPeter Wemm to->Numbers[base + m] = to->Numbers[base + n--];
1540e3d5408SPeter Wemm } else {
1550e3d5408SPeter Wemm to->Numbers[base + m] = ABSENT_NUMERIC;
1560e3d5408SPeter Wemm }
1570e3d5408SPeter Wemm }
1580e3d5408SPeter Wemm to->ext_Numbers = UShort(ext_Numbers);
1590e3d5408SPeter Wemm }
1600e3d5408SPeter Wemm
1610e3d5408SPeter Wemm if (to->ext_Strings != ext_Strings) {
1620e3d5408SPeter Wemm to1 = to_Booleans + to_Numbers;
1630e3d5408SPeter Wemm to2 = to_Strings + to1;
1640e3d5408SPeter Wemm from = ext_Booleans + ext_Numbers;
1650e3d5408SPeter Wemm EXTEND_NUM(num_Strings, ext_Strings);
1660e3d5408SPeter Wemm TYPE_REALLOC(char *, to->num_Strings, to->Strings);
1670e3d5408SPeter Wemm for (n = to->ext_Strings - 1,
1680e3d5408SPeter Wemm m = ext_Strings - 1,
1690e3d5408SPeter Wemm base = to->num_Strings - (m + 1); m >= 0; m--) {
1700e3d5408SPeter Wemm if (find_name(to->ext_Names, to1, to2, ext_Names[m + from])) {
1710e3d5408SPeter Wemm to->Strings[base + m] = to->Strings[base + n--];
1720e3d5408SPeter Wemm } else {
1730e3d5408SPeter Wemm to->Strings[base + m] = ABSENT_STRING;
1740e3d5408SPeter Wemm }
17515589c42SPeter Wemm }
17615589c42SPeter Wemm to->ext_Strings = UShort(ext_Strings);
1770e3d5408SPeter Wemm }
1780e3d5408SPeter Wemm }
1790e3d5408SPeter Wemm
1800e3d5408SPeter Wemm /*
1810e3d5408SPeter Wemm * Returns the first index in ext_Names[] for the given token-type
1820e3d5408SPeter Wemm */
1830e3d5408SPeter Wemm static unsigned
_nc_first_ext_name(TERMTYPE2 * tp,int token_type)1840e3d5408SPeter Wemm _nc_first_ext_name(TERMTYPE2 *tp, int token_type)
1850e3d5408SPeter Wemm {
1860e3d5408SPeter Wemm unsigned first;
1870e3d5408SPeter Wemm
1880e3d5408SPeter Wemm switch (token_type) {
1890e3d5408SPeter Wemm case BOOLEAN:
1900e3d5408SPeter Wemm first = 0;
1910e3d5408SPeter Wemm break;
1920e3d5408SPeter Wemm case NUMBER:
1930e3d5408SPeter Wemm first = tp->ext_Booleans;
1940e3d5408SPeter Wemm break;
1950e3d5408SPeter Wemm case STRING:
1960e3d5408SPeter Wemm first = (unsigned) (tp->ext_Booleans + tp->ext_Numbers);
1970e3d5408SPeter Wemm break;
19815589c42SPeter Wemm default:
19915589c42SPeter Wemm first = 0;
2000e3d5408SPeter Wemm break;
2010e3d5408SPeter Wemm }
2020e3d5408SPeter Wemm return first;
2030e3d5408SPeter Wemm }
2040e3d5408SPeter Wemm
2050e3d5408SPeter Wemm /*
2060e3d5408SPeter Wemm * Returns the last index in ext_Names[] for the given token-type
2070e3d5408SPeter Wemm */
2080e3d5408SPeter Wemm static unsigned
_nc_last_ext_name(TERMTYPE2 * tp,int token_type)2090e3d5408SPeter Wemm _nc_last_ext_name(TERMTYPE2 *tp, int token_type)
2100e3d5408SPeter Wemm {
2110e3d5408SPeter Wemm unsigned last;
2120e3d5408SPeter Wemm
2130e3d5408SPeter Wemm switch (token_type) {
2140e3d5408SPeter Wemm case BOOLEAN:
2150e3d5408SPeter Wemm last = tp->ext_Booleans;
2160e3d5408SPeter Wemm break;
21715589c42SPeter Wemm case NUMBER:
21815589c42SPeter Wemm last = (unsigned) (tp->ext_Booleans + tp->ext_Numbers);
2190e3d5408SPeter Wemm break;
2200e3d5408SPeter Wemm default:
2210e3d5408SPeter Wemm case STRING:
2220e3d5408SPeter Wemm last = NUM_EXT_NAMES(tp);
2230e3d5408SPeter Wemm break;
2240e3d5408SPeter Wemm }
2250e3d5408SPeter Wemm return last;
2260e3d5408SPeter Wemm }
2270e3d5408SPeter Wemm
2280e3d5408SPeter Wemm /*
2290e3d5408SPeter Wemm * Lookup an entry from extended-names, returning -1 if not found
2300e3d5408SPeter Wemm */
2310e3d5408SPeter Wemm static int
_nc_find_ext_name(TERMTYPE2 * tp,char * name,int token_type)2320e3d5408SPeter Wemm _nc_find_ext_name(TERMTYPE2 *tp, char *name, int token_type)
2330e3d5408SPeter Wemm {
2340e3d5408SPeter Wemm unsigned j;
2350e3d5408SPeter Wemm unsigned first = _nc_first_ext_name(tp, token_type);
2360e3d5408SPeter Wemm unsigned last = _nc_last_ext_name(tp, token_type);
2370e3d5408SPeter Wemm
2380e3d5408SPeter Wemm for (j = first; j < last; j++) {
2390e3d5408SPeter Wemm if (!strcmp(name, tp->ext_Names[j])) {
24018259542SPeter Wemm return (int) j;
24115589c42SPeter Wemm }
2420e3d5408SPeter Wemm }
2430e3d5408SPeter Wemm return -1;
2440e3d5408SPeter Wemm }
2450e3d5408SPeter Wemm
2460e3d5408SPeter Wemm /*
2470e3d5408SPeter Wemm * Translate an index into ext_Names[] into the corresponding index into data
2480e3d5408SPeter Wemm * (e.g., Booleans[]).
2490e3d5408SPeter Wemm */
2500e3d5408SPeter Wemm static int
_nc_ext_data_index(TERMTYPE2 * tp,int n,int token_type)2510e3d5408SPeter Wemm _nc_ext_data_index(TERMTYPE2 *tp, int n, int token_type)
2520e3d5408SPeter Wemm {
2530e3d5408SPeter Wemm switch (token_type) {
2540e3d5408SPeter Wemm case BOOLEAN:
2550e3d5408SPeter Wemm n += (tp->num_Booleans - tp->ext_Booleans);
2560e3d5408SPeter Wemm break;
2570e3d5408SPeter Wemm case NUMBER:
2580e3d5408SPeter Wemm n += (tp->num_Numbers - tp->ext_Numbers)
2590e3d5408SPeter Wemm - (tp->ext_Booleans);
2600e3d5408SPeter Wemm break;
2610e3d5408SPeter Wemm default:
2620e3d5408SPeter Wemm case STRING:
2630e3d5408SPeter Wemm n += (tp->num_Strings - tp->ext_Strings)
2640e3d5408SPeter Wemm - (tp->ext_Booleans + tp->ext_Numbers);
2650e3d5408SPeter Wemm }
2660e3d5408SPeter Wemm return n;
2670e3d5408SPeter Wemm }
2680e3d5408SPeter Wemm
2690e3d5408SPeter Wemm /*
2700e3d5408SPeter Wemm * Adjust tables to remove (not free) an extended name and its corresponding
2710e3d5408SPeter Wemm * data.
2720e3d5408SPeter Wemm */
2730e3d5408SPeter Wemm static bool
_nc_del_ext_name(TERMTYPE2 * tp,char * name,int token_type)2740e3d5408SPeter Wemm _nc_del_ext_name(TERMTYPE2 *tp, char *name, int token_type)
27518259542SPeter Wemm {
2760e3d5408SPeter Wemm int first;
27718259542SPeter Wemm
2780e3d5408SPeter Wemm if ((first = _nc_find_ext_name(tp, name, token_type)) >= 0) {
2790e3d5408SPeter Wemm int j;
2800e3d5408SPeter Wemm int last = (int) NUM_EXT_NAMES(tp) - 1;
2810e3d5408SPeter Wemm
2820e3d5408SPeter Wemm for (j = first; j < last; j++) {
2830e3d5408SPeter Wemm tp->ext_Names[j] = tp->ext_Names[j + 1];
28415589c42SPeter Wemm }
28515589c42SPeter Wemm first = _nc_ext_data_index(tp, first, token_type);
2860e3d5408SPeter Wemm switch (token_type) {
2870e3d5408SPeter Wemm case BOOLEAN:
2880e3d5408SPeter Wemm last = tp->num_Booleans - 1;
2890e3d5408SPeter Wemm for (j = first; j < last; j++)
2900e3d5408SPeter Wemm tp->Booleans[j] = tp->Booleans[j + 1];
2910e3d5408SPeter Wemm tp->ext_Booleans--;
2920e3d5408SPeter Wemm tp->num_Booleans--;
2930e3d5408SPeter Wemm break;
2940e3d5408SPeter Wemm case NUMBER:
2950e3d5408SPeter Wemm last = tp->num_Numbers - 1;
2964a1a9510SRong-En Fan for (j = first; j < last; j++)
2970e3d5408SPeter Wemm tp->Numbers[j] = tp->Numbers[j + 1];
2980e3d5408SPeter Wemm tp->ext_Numbers--;
2990e3d5408SPeter Wemm tp->num_Numbers--;
3000e3d5408SPeter Wemm break;
3010e3d5408SPeter Wemm case STRING:
3020e3d5408SPeter Wemm last = tp->num_Strings - 1;
3030e3d5408SPeter Wemm for (j = first; j < last; j++)
3040e3d5408SPeter Wemm tp->Strings[j] = tp->Strings[j + 1];
3050e3d5408SPeter Wemm tp->ext_Strings--;
3064a1a9510SRong-En Fan tp->num_Strings--;
3070e3d5408SPeter Wemm break;
3080e3d5408SPeter Wemm }
3090e3d5408SPeter Wemm return TRUE;
3100e3d5408SPeter Wemm }
3110e3d5408SPeter Wemm return FALSE;
3124a1a9510SRong-En Fan }
3130e3d5408SPeter Wemm
3140e3d5408SPeter Wemm /*
3150e3d5408SPeter Wemm * Adjust tables to insert an extended name, making room for new data. The
3160e3d5408SPeter Wemm * index into the corresponding data array is returned.
3170e3d5408SPeter Wemm */
3180e3d5408SPeter Wemm static int
_nc_ins_ext_name(TERMTYPE2 * tp,char * name,int token_type)3190e3d5408SPeter Wemm _nc_ins_ext_name(TERMTYPE2 *tp, char *name, int token_type)
3200e3d5408SPeter Wemm {
3210e3d5408SPeter Wemm unsigned first = _nc_first_ext_name(tp, token_type);
3220e3d5408SPeter Wemm unsigned last = _nc_last_ext_name(tp, token_type);
3230e3d5408SPeter Wemm unsigned total = NUM_EXT_NAMES(tp) + 1;
3240e3d5408SPeter Wemm unsigned j, k;
3250e3d5408SPeter Wemm
3260e3d5408SPeter Wemm for (j = first; j < last; j++) {
3270e3d5408SPeter Wemm int cmp = strcmp(name, tp->ext_Names[j]);
3280e3d5408SPeter Wemm if (cmp == 0)
3290e3d5408SPeter Wemm /* already present */
3300e3d5408SPeter Wemm return _nc_ext_data_index(tp, (int) j, token_type);
3310e3d5408SPeter Wemm if (cmp < 0) {
3320e3d5408SPeter Wemm break;
3330e3d5408SPeter Wemm }
3340e3d5408SPeter Wemm }
3350e3d5408SPeter Wemm
3360e3d5408SPeter Wemm TYPE_REALLOC(char *, total, tp->ext_Names);
3370e3d5408SPeter Wemm for (k = total - 1; k > j; k--)
3380e3d5408SPeter Wemm tp->ext_Names[k] = tp->ext_Names[k - 1];
33915589c42SPeter Wemm tp->ext_Names[j] = name;
34015589c42SPeter Wemm j = (unsigned) _nc_ext_data_index(tp, (int) j, token_type);
3410e3d5408SPeter Wemm
3420e3d5408SPeter Wemm switch (token_type) {
3430e3d5408SPeter Wemm case BOOLEAN:
3440e3d5408SPeter Wemm tp->ext_Booleans++;
3450e3d5408SPeter Wemm tp->num_Booleans++;
3460e3d5408SPeter Wemm TYPE_REALLOC(NCURSES_SBOOL, tp->num_Booleans, tp->Booleans);
3470e3d5408SPeter Wemm for (k = (unsigned) (tp->num_Booleans - 1); k > j; k--)
3480e3d5408SPeter Wemm tp->Booleans[k] = tp->Booleans[k - 1];
3490e3d5408SPeter Wemm break;
3500e3d5408SPeter Wemm case NUMBER:
3510e3d5408SPeter Wemm tp->ext_Numbers++;
35218259542SPeter Wemm tp->num_Numbers++;
35318259542SPeter Wemm TYPE_REALLOC(NCURSES_INT2, tp->num_Numbers, tp->Numbers);
3540e3d5408SPeter Wemm for (k = (unsigned) (tp->num_Numbers - 1); k > j; k--)
3550e3d5408SPeter Wemm tp->Numbers[k] = tp->Numbers[k - 1];
35618259542SPeter Wemm break;
35718259542SPeter Wemm case STRING:
35818259542SPeter Wemm tp->ext_Strings++;
35915589c42SPeter Wemm tp->num_Strings++;
36015589c42SPeter Wemm TYPE_REALLOC(char *, tp->num_Strings, tp->Strings);
36118259542SPeter Wemm for (k = (unsigned) (tp->num_Strings - 1); k > j; k--)
36218259542SPeter Wemm tp->Strings[k] = tp->Strings[k - 1];
3630e3d5408SPeter Wemm break;
3640e3d5408SPeter Wemm }
36518259542SPeter Wemm return (int) j;
36618259542SPeter Wemm }
36718259542SPeter Wemm
3680e3d5408SPeter Wemm /*
3690e3d5408SPeter Wemm * Look for strings that are marked cancelled, which happen to be the same name
3700e3d5408SPeter Wemm * as a boolean or number. We'll get this as a special case when we get a
3710e3d5408SPeter Wemm * cancellation of a name that is inherited from another entry.
3720e3d5408SPeter Wemm */
3730e3d5408SPeter Wemm static void
adjust_cancels(TERMTYPE2 * to,TERMTYPE2 * from)3740e3d5408SPeter Wemm adjust_cancels(TERMTYPE2 *to, TERMTYPE2 *from)
3757a69bbfbSPeter Wemm {
3764a1a9510SRong-En Fan int first = to->ext_Booleans + to->ext_Numbers;
3770e3d5408SPeter Wemm int last = first + to->ext_Strings;
3780e3d5408SPeter Wemm int j, k;
3790e3d5408SPeter Wemm
3800e3d5408SPeter Wemm for (j = first; j < last;) {
3810e3d5408SPeter Wemm char *name = to->ext_Names[j];
3820e3d5408SPeter Wemm int j_str = to->num_Strings - first - to->ext_Strings;
3830e3d5408SPeter Wemm
3844a1a9510SRong-En Fan if (to->Strings[j + j_str] == CANCELLED_STRING) {
3850e3d5408SPeter Wemm if (_nc_find_ext_name(from, to->ext_Names[j], BOOLEAN) >= 0) {
38615589c42SPeter Wemm if (_nc_del_ext_name(to, name, STRING)
38715589c42SPeter Wemm || _nc_del_ext_name(to, name, NUMBER)) {
3880e3d5408SPeter Wemm k = _nc_ins_ext_name(to, name, BOOLEAN);
3890e3d5408SPeter Wemm to->Booleans[k] = FALSE;
3900e3d5408SPeter Wemm } else {
3910e3d5408SPeter Wemm j++;
3920e3d5408SPeter Wemm }
3930e3d5408SPeter Wemm } else if (_nc_find_ext_name(from, to->ext_Names[j], NUMBER) >= 0) {
3940e3d5408SPeter Wemm if (_nc_del_ext_name(to, name, STRING)
3950e3d5408SPeter Wemm || _nc_del_ext_name(to, name, BOOLEAN)) {
3960e3d5408SPeter Wemm k = _nc_ins_ext_name(to, name, NUMBER);
3970e3d5408SPeter Wemm to->Numbers[k] = CANCELLED_NUMERIC;
3980e3d5408SPeter Wemm } else {
3990e3d5408SPeter Wemm j++;
4000e3d5408SPeter Wemm }
4010e3d5408SPeter Wemm } else if (_nc_find_ext_name(from, to->ext_Names[j], STRING) >= 0) {
4020e3d5408SPeter Wemm if (_nc_del_ext_name(to, name, NUMBER)
4030e3d5408SPeter Wemm || _nc_del_ext_name(to, name, BOOLEAN)) {
4040e3d5408SPeter Wemm k = _nc_ins_ext_name(to, name, STRING);
4050e3d5408SPeter Wemm to->Strings[k] = CANCELLED_STRING;
4060e3d5408SPeter Wemm } else {
4070e3d5408SPeter Wemm j++;
4080e3d5408SPeter Wemm }
4090e3d5408SPeter Wemm } else {
4100e3d5408SPeter Wemm j++;
4110e3d5408SPeter Wemm }
4120e3d5408SPeter Wemm } else {
4130e3d5408SPeter Wemm j++;
4140e3d5408SPeter Wemm }
4150e3d5408SPeter Wemm }
4160e3d5408SPeter Wemm }
4170e3d5408SPeter Wemm
4180e3d5408SPeter Wemm NCURSES_EXPORT(void)
_nc_align_termtype(TERMTYPE2 * to,TERMTYPE2 * from)4190e3d5408SPeter Wemm _nc_align_termtype(TERMTYPE2 *to, TERMTYPE2 *from)
4200e3d5408SPeter Wemm {
4210e3d5408SPeter Wemm int na;
4220e3d5408SPeter Wemm int nb;
4230e3d5408SPeter Wemm char **ext_Names;
4240e3d5408SPeter Wemm
4250e3d5408SPeter Wemm na = to ? ((int) NUM_EXT_NAMES(to)) : 0;
4260e3d5408SPeter Wemm nb = from ? ((int) NUM_EXT_NAMES(from)) : 0;
4270e3d5408SPeter Wemm
4280e3d5408SPeter Wemm DEBUG(2, ("align_termtype to(%d:%s), from(%d:%s)",
4290e3d5408SPeter Wemm na, to ? NonNull(to->term_names) : "?",
4300e3d5408SPeter Wemm nb, from ? NonNull(from->term_names) : "?"));
4310e3d5408SPeter Wemm
4320e3d5408SPeter Wemm if (na != 0 || nb != 0) {
4330e3d5408SPeter Wemm int ext_Booleans, ext_Numbers, ext_Strings;
4340e3d5408SPeter Wemm bool used_ext_Names = FALSE;
4350e3d5408SPeter Wemm
4360e3d5408SPeter Wemm if ((na == nb) /* check if the arrays are equivalent */
4370e3d5408SPeter Wemm &&(to->ext_Booleans == from->ext_Booleans)
4380e3d5408SPeter Wemm && (to->ext_Numbers == from->ext_Numbers)
4390e3d5408SPeter Wemm && (to->ext_Strings == from->ext_Strings)) {
4400e3d5408SPeter Wemm int n;
4410e3d5408SPeter Wemm bool same;
4420e3d5408SPeter Wemm
4430e3d5408SPeter Wemm for (n = 0, same = TRUE; n < na; n++) {
44415589c42SPeter Wemm if (strcmp(to->ext_Names[n], from->ext_Names[n])) {
4450e3d5408SPeter Wemm same = FALSE;
44615589c42SPeter Wemm break;
44715589c42SPeter Wemm }
4484a1a9510SRong-En Fan }
4490e3d5408SPeter Wemm if (same)
4500e3d5408SPeter Wemm return;
4510e3d5408SPeter Wemm }
4520e3d5408SPeter Wemm /*
4530e3d5408SPeter Wemm * This is where we pay for having a simple extension representation.
4540e3d5408SPeter Wemm * Allocate a new ext_Names array and merge the two ext_Names arrays
45515589c42SPeter Wemm * into it, updating to's counts for booleans, etc. Fortunately we do
45615589c42SPeter Wemm * this only for the terminfo compiler (tic) and comparer (infocmp).
4570e3d5408SPeter Wemm */
4584a1a9510SRong-En Fan TYPE_MALLOC(char *, (size_t)(na + nb), ext_Names);
4594a1a9510SRong-En Fan
4600e3d5408SPeter Wemm if (to->ext_Strings && (from->ext_Booleans + from->ext_Numbers))
4610e3d5408SPeter Wemm adjust_cancels(to, from);
4620e3d5408SPeter Wemm
4630e3d5408SPeter Wemm if (from->ext_Strings && (to->ext_Booleans + to->ext_Numbers))
4647a69bbfbSPeter Wemm adjust_cancels(from, to);
4654a1a9510SRong-En Fan
4660e3d5408SPeter Wemm ext_Booleans = merge_names(ext_Names,
4674a1a9510SRong-En Fan to->ext_Names,
4680e3d5408SPeter Wemm to->ext_Booleans,
4690e3d5408SPeter Wemm from->ext_Names,
4704a1a9510SRong-En Fan from->ext_Booleans);
4710e3d5408SPeter Wemm ext_Numbers = merge_names(ext_Names + ext_Booleans,
4720e3d5408SPeter Wemm to->ext_Names
4730e3d5408SPeter Wemm + to->ext_Booleans,
4740e3d5408SPeter Wemm to->ext_Numbers,
4750e3d5408SPeter Wemm from->ext_Names
4760e3d5408SPeter Wemm + from->ext_Booleans,
4770e3d5408SPeter Wemm from->ext_Numbers);
4780e3d5408SPeter Wemm ext_Strings = merge_names(ext_Names + ext_Numbers + ext_Booleans,
4790e3d5408SPeter Wemm to->ext_Names
4800e3d5408SPeter Wemm + to->ext_Booleans
4810e3d5408SPeter Wemm + to->ext_Numbers,
4820e3d5408SPeter Wemm to->ext_Strings,
4830e3d5408SPeter Wemm from->ext_Names
4840e3d5408SPeter Wemm + from->ext_Booleans
4850e3d5408SPeter Wemm + from->ext_Numbers,
4860e3d5408SPeter Wemm from->ext_Strings);
4870e3d5408SPeter Wemm /*
4880e3d5408SPeter Wemm * Now we must reallocate the Booleans, etc., to allow the data to be
4890e3d5408SPeter Wemm * overlaid.
49015589c42SPeter Wemm */
49115589c42SPeter Wemm if (na != (ext_Booleans + ext_Numbers + ext_Strings)) {
4920e3d5408SPeter Wemm realign_data(to, ext_Names, ext_Booleans, ext_Numbers, ext_Strings);
4930e3d5408SPeter Wemm FreeIfNeeded(to->ext_Names);
4940e3d5408SPeter Wemm to->ext_Names = ext_Names;
4950e3d5408SPeter Wemm DEBUG(2, ("realigned %d extended names for '%s' (to)",
496 NUM_EXT_NAMES(to), to->term_names));
497 used_ext_Names = TRUE;
498 }
499 if (nb != (ext_Booleans + ext_Numbers + ext_Strings)) {
500 nb = (ext_Booleans + ext_Numbers + ext_Strings);
501 realign_data(from, ext_Names, ext_Booleans, ext_Numbers, ext_Strings);
502 TYPE_REALLOC(char *, (size_t) nb, from->ext_Names);
503 memcpy(from->ext_Names, ext_Names, sizeof(char *) * (size_t) nb);
504 DEBUG(2, ("realigned %d extended names for '%s' (from)",
505 NUM_EXT_NAMES(from), from->term_names));
506 }
507 if (!used_ext_Names)
508 free(ext_Names);
509 }
510 }
511 #endif
512
513 #define srcINT 1
514 #define dstINT 2
515
516 /*
517 * TERMTYPE and TERMTYPE2 differ only with regard to the values in Numbers.
518 * Use 'mode' to decide which to use.
519 */
520 static void
copy_termtype(TERMTYPE2 * dst,const TERMTYPE2 * src,int mode)521 copy_termtype(TERMTYPE2 *dst, const TERMTYPE2 *src, int mode)
522 {
523 #if NCURSES_XNAMES || NCURSES_EXT_NUMBERS
524 unsigned i;
525 #endif
526 #if NCURSES_EXT_NUMBERS
527 short *oldptr = 0;
528 int *newptr = 0;
529 #endif
530
531 DEBUG(2, ("copy_termtype"));
532 *dst = *src; /* ...to copy the sizes and string-tables */
533
534 TYPE_MALLOC(NCURSES_SBOOL, NUM_BOOLEANS(dst), dst->Booleans);
535 TYPE_MALLOC(char *, NUM_STRINGS(dst), dst->Strings);
536
537 memcpy(dst->Booleans,
538 src->Booleans,
539 NUM_BOOLEANS(dst) * sizeof(dst->Booleans[0]));
540 memcpy(dst->Strings,
541 src->Strings,
542 NUM_STRINGS(dst) * sizeof(dst->Strings[0]));
543
544 #if NCURSES_EXT_NUMBERS
545 if ((mode & dstINT) == 0) {
546 DEBUG(2, ("...convert int ->short"));
547 TYPE_MALLOC(short, NUM_NUMBERS(dst), oldptr);
548 ((TERMTYPE *) dst)->Numbers = oldptr;
549 } else {
550 DEBUG(2, ("...copy without changing size"));
551 TYPE_MALLOC(int, NUM_NUMBERS(dst), newptr);
552 dst->Numbers = newptr;
553 }
554 if ((mode == srcINT) && (oldptr != 0)) {
555 DEBUG(2, ("...copy int ->short"));
556 for (i = 0; i < NUM_NUMBERS(dst); ++i) {
557 if (src->Numbers[i] > MAX_OF_TYPE(short)) {
558 oldptr[i] = MAX_OF_TYPE(short);
559 } else {
560 oldptr[i] = (short) src->Numbers[i];
561 }
562 }
563 } else if ((mode == dstINT) && (newptr != 0)) {
564 DEBUG(2, ("...copy short ->int"));
565 for (i = 0; i < NUM_NUMBERS(dst); ++i) {
566 newptr[i] = ((const short *) (src->Numbers))[i];
567 }
568 } else {
569 DEBUG(2, ("...copy %s without change",
570 (mode & dstINT)
571 ? "int"
572 : "short"));
573 memcpy(dst->Numbers,
574 src->Numbers,
575 NUM_NUMBERS(dst) * ((mode & dstINT)
576 ? sizeof(int)
577 : sizeof(short)));
578 }
579 #else
580 (void) mode;
581 TYPE_MALLOC(short, NUM_NUMBERS(dst), dst->Numbers);
582 memcpy(dst->Numbers,
583 src->Numbers,
584 NUM_NUMBERS(dst) * sizeof(dst->Numbers[0]));
585 #endif
586
587 /* FIXME: we probably should also copy str_table and ext_str_table,
588 * but tic and infocmp are not written to exploit that (yet).
589 */
590
591 #if NCURSES_XNAMES
592 if ((i = NUM_EXT_NAMES(src)) != 0) {
593 TYPE_MALLOC(char *, i, dst->ext_Names);
594 memcpy(dst->ext_Names, src->ext_Names, i * sizeof(char *));
595 } else {
596 dst->ext_Names = 0;
597 }
598 #endif
599 }
600
601 /*
602 * This entrypoint is used by tack 1.07
603 */
604 NCURSES_EXPORT(void)
_nc_copy_termtype(TERMTYPE * dst,const TERMTYPE * src)605 _nc_copy_termtype(TERMTYPE *dst, const TERMTYPE *src)
606 {
607 DEBUG(2, ("_nc_copy_termtype..."));
608 copy_termtype((TERMTYPE2 *) dst, (const TERMTYPE2 *) src, 0);
609 }
610
611 #if NCURSES_EXT_NUMBERS
612 NCURSES_EXPORT(void)
_nc_copy_termtype2(TERMTYPE2 * dst,const TERMTYPE2 * src)613 _nc_copy_termtype2(TERMTYPE2 *dst, const TERMTYPE2 *src)
614 {
615 DEBUG(2, ("_nc_copy_termtype2..."));
616 copy_termtype(dst, src, srcINT | dstINT);
617 }
618
619 /*
620 * Use this for exporting the internal TERMTYPE2 to the legacy format used via
621 * the CUR macro by applications.
622 */
623 NCURSES_EXPORT(void)
_nc_export_termtype2(TERMTYPE * dst,const TERMTYPE2 * src)624 _nc_export_termtype2(TERMTYPE *dst, const TERMTYPE2 *src)
625 {
626 DEBUG(2, ("_nc_export_termtype2..."));
627 copy_termtype((TERMTYPE2 *) dst, src, srcINT);
628 }
629 #endif /* NCURSES_EXT_NUMBERS */
630