1fdd4e1e0SJan Lentfer /****************************************************************************
2*32bb5217SDaniel Fojt * Copyright 2018-2019,2020 Thomas E. Dickey *
3*32bb5217SDaniel Fojt * Copyright 1998-2016,2017 Free Software Foundation, Inc. *
4fdd4e1e0SJan Lentfer * *
5fdd4e1e0SJan Lentfer * Permission is hereby granted, free of charge, to any person obtaining a *
6fdd4e1e0SJan Lentfer * copy of this software and associated documentation files (the *
7fdd4e1e0SJan Lentfer * "Software"), to deal in the Software without restriction, including *
8fdd4e1e0SJan Lentfer * without limitation the rights to use, copy, modify, merge, publish, *
9fdd4e1e0SJan Lentfer * distribute, distribute with modifications, sublicense, and/or sell *
10fdd4e1e0SJan Lentfer * copies of the Software, and to permit persons to whom the Software is *
11fdd4e1e0SJan Lentfer * furnished to do so, subject to the following conditions: *
12fdd4e1e0SJan Lentfer * *
13fdd4e1e0SJan Lentfer * The above copyright notice and this permission notice shall be included *
14fdd4e1e0SJan Lentfer * in all copies or substantial portions of the Software. *
15fdd4e1e0SJan Lentfer * *
16fdd4e1e0SJan Lentfer * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
17fdd4e1e0SJan Lentfer * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
18fdd4e1e0SJan Lentfer * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
19fdd4e1e0SJan Lentfer * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
20fdd4e1e0SJan Lentfer * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
21fdd4e1e0SJan Lentfer * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
22fdd4e1e0SJan Lentfer * THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
23fdd4e1e0SJan Lentfer * *
24fdd4e1e0SJan Lentfer * Except as contained in this notice, the name(s) of the above copyright *
25fdd4e1e0SJan Lentfer * holders shall not be used in advertising or otherwise to promote the *
26fdd4e1e0SJan Lentfer * sale, use or other dealings in this Software without prior written *
27fdd4e1e0SJan Lentfer * authorization. *
28fdd4e1e0SJan Lentfer ****************************************************************************/
29fdd4e1e0SJan Lentfer
30fdd4e1e0SJan Lentfer /****************************************************************************
31fdd4e1e0SJan Lentfer * Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 *
32fdd4e1e0SJan Lentfer * and: Eric S. Raymond <esr@snark.thyrsus.com> *
331d102085SJan Lentfer * and: Thomas E. Dickey 1996-on *
34fdd4e1e0SJan Lentfer ****************************************************************************/
35fdd4e1e0SJan Lentfer
36fdd4e1e0SJan Lentfer /*
37fdd4e1e0SJan Lentfer * parse_entry.c -- compile one terminfo or termcap entry
38fdd4e1e0SJan Lentfer *
39fdd4e1e0SJan Lentfer * Get an exact in-core representation of an entry. Don't
40fdd4e1e0SJan Lentfer * try to resolve use or tc capabilities, that is someone
41fdd4e1e0SJan Lentfer * else's job. Depends on the lexical analyzer to get tokens
42fdd4e1e0SJan Lentfer * from the input stream.
43fdd4e1e0SJan Lentfer */
44fdd4e1e0SJan Lentfer
45fdd4e1e0SJan Lentfer #define __INTERNAL_CAPS_VISIBLE
46fdd4e1e0SJan Lentfer #include <curses.priv.h>
47fdd4e1e0SJan Lentfer
48fdd4e1e0SJan Lentfer #include <ctype.h>
49fdd4e1e0SJan Lentfer #include <tic.h>
50fdd4e1e0SJan Lentfer
51*32bb5217SDaniel Fojt MODULE_ID("$Id: parse_entry.c,v 1.99 2020/02/02 23:34:34 tom Exp $")
52fdd4e1e0SJan Lentfer
53fdd4e1e0SJan Lentfer #ifdef LINT
54fdd4e1e0SJan Lentfer static short const parametrized[] =
55fdd4e1e0SJan Lentfer {0};
56fdd4e1e0SJan Lentfer #else
57fdd4e1e0SJan Lentfer #include <parametrized.h>
58fdd4e1e0SJan Lentfer #endif
59fdd4e1e0SJan Lentfer
60*32bb5217SDaniel Fojt static void postprocess_termcap(TERMTYPE2 *, bool);
61*32bb5217SDaniel Fojt static void postprocess_terminfo(TERMTYPE2 *);
62fdd4e1e0SJan Lentfer static struct name_table_entry const *lookup_fullname(const char *name);
63fdd4e1e0SJan Lentfer
64fdd4e1e0SJan Lentfer #if NCURSES_XNAMES
65fdd4e1e0SJan Lentfer
66fdd4e1e0SJan Lentfer static struct name_table_entry const *
_nc_extend_names(ENTRY * entryp,const char * name,int token_type)67*32bb5217SDaniel Fojt _nc_extend_names(ENTRY * entryp, const char *name, int token_type)
68fdd4e1e0SJan Lentfer {
69fdd4e1e0SJan Lentfer static struct name_table_entry temp;
70*32bb5217SDaniel Fojt TERMTYPE2 *tp = &(entryp->tterm);
71fdd4e1e0SJan Lentfer unsigned offset = 0;
72fdd4e1e0SJan Lentfer unsigned actual;
73fdd4e1e0SJan Lentfer unsigned tindex;
74fdd4e1e0SJan Lentfer unsigned first, last, n;
75fdd4e1e0SJan Lentfer bool found;
76fdd4e1e0SJan Lentfer
77fdd4e1e0SJan Lentfer switch (token_type) {
78fdd4e1e0SJan Lentfer case BOOLEAN:
79fdd4e1e0SJan Lentfer first = 0;
80fdd4e1e0SJan Lentfer last = tp->ext_Booleans;
81fdd4e1e0SJan Lentfer offset = tp->ext_Booleans;
82fdd4e1e0SJan Lentfer tindex = tp->num_Booleans;
83fdd4e1e0SJan Lentfer break;
84fdd4e1e0SJan Lentfer case NUMBER:
85fdd4e1e0SJan Lentfer first = tp->ext_Booleans;
86fdd4e1e0SJan Lentfer last = tp->ext_Numbers + first;
8700d8f3c4SJohn Marino offset = (unsigned) (tp->ext_Booleans + tp->ext_Numbers);
88fdd4e1e0SJan Lentfer tindex = tp->num_Numbers;
89fdd4e1e0SJan Lentfer break;
90fdd4e1e0SJan Lentfer case STRING:
9100d8f3c4SJohn Marino first = (unsigned) (tp->ext_Booleans + tp->ext_Numbers);
92fdd4e1e0SJan Lentfer last = tp->ext_Strings + first;
9300d8f3c4SJohn Marino offset = (unsigned) (tp->ext_Booleans + tp->ext_Numbers + tp->ext_Strings);
94fdd4e1e0SJan Lentfer tindex = tp->num_Strings;
95fdd4e1e0SJan Lentfer break;
96fdd4e1e0SJan Lentfer case CANCEL:
97fdd4e1e0SJan Lentfer actual = NUM_EXT_NAMES(tp);
98fdd4e1e0SJan Lentfer for (n = 0; n < actual; n++) {
99fdd4e1e0SJan Lentfer if (!strcmp(name, tp->ext_Names[n])) {
100fdd4e1e0SJan Lentfer if (n > (unsigned) (tp->ext_Booleans + tp->ext_Numbers)) {
101fdd4e1e0SJan Lentfer token_type = STRING;
102fdd4e1e0SJan Lentfer } else if (n > tp->ext_Booleans) {
103fdd4e1e0SJan Lentfer token_type = NUMBER;
104fdd4e1e0SJan Lentfer } else {
105fdd4e1e0SJan Lentfer token_type = BOOLEAN;
106fdd4e1e0SJan Lentfer }
107fdd4e1e0SJan Lentfer return _nc_extend_names(entryp, name, token_type);
108fdd4e1e0SJan Lentfer }
109fdd4e1e0SJan Lentfer }
110fdd4e1e0SJan Lentfer /* Well, we are given a cancel for a name that we don't recognize */
111fdd4e1e0SJan Lentfer return _nc_extend_names(entryp, name, STRING);
112fdd4e1e0SJan Lentfer default:
113fdd4e1e0SJan Lentfer return 0;
114fdd4e1e0SJan Lentfer }
115fdd4e1e0SJan Lentfer
116fdd4e1e0SJan Lentfer /* Adjust the 'offset' (insertion-point) to keep the lists of extended
117fdd4e1e0SJan Lentfer * names sorted.
118fdd4e1e0SJan Lentfer */
119fdd4e1e0SJan Lentfer for (n = first, found = FALSE; n < last; n++) {
120fdd4e1e0SJan Lentfer int cmp = strcmp(tp->ext_Names[n], name);
121fdd4e1e0SJan Lentfer if (cmp == 0)
122fdd4e1e0SJan Lentfer found = TRUE;
123fdd4e1e0SJan Lentfer if (cmp >= 0) {
124fdd4e1e0SJan Lentfer offset = n;
125fdd4e1e0SJan Lentfer tindex = n - first;
126fdd4e1e0SJan Lentfer switch (token_type) {
127fdd4e1e0SJan Lentfer case BOOLEAN:
128fdd4e1e0SJan Lentfer tindex += BOOLCOUNT;
129fdd4e1e0SJan Lentfer break;
130fdd4e1e0SJan Lentfer case NUMBER:
131fdd4e1e0SJan Lentfer tindex += NUMCOUNT;
132fdd4e1e0SJan Lentfer break;
133fdd4e1e0SJan Lentfer case STRING:
134fdd4e1e0SJan Lentfer tindex += STRCOUNT;
135fdd4e1e0SJan Lentfer break;
136fdd4e1e0SJan Lentfer }
137fdd4e1e0SJan Lentfer break;
138fdd4e1e0SJan Lentfer }
139fdd4e1e0SJan Lentfer }
14000d8f3c4SJohn Marino
14100d8f3c4SJohn Marino #define for_each_value(max) \
14200d8f3c4SJohn Marino for (last = (unsigned) (max - 1); last > tindex; last--)
14300d8f3c4SJohn Marino
144fdd4e1e0SJan Lentfer if (!found) {
145fdd4e1e0SJan Lentfer switch (token_type) {
146fdd4e1e0SJan Lentfer case BOOLEAN:
14700d8f3c4SJohn Marino tp->ext_Booleans++;
14800d8f3c4SJohn Marino tp->num_Booleans++;
1493468e90cSJohn Marino TYPE_REALLOC(NCURSES_SBOOL, tp->num_Booleans, tp->Booleans);
15000d8f3c4SJohn Marino for_each_value(tp->num_Booleans)
151fdd4e1e0SJan Lentfer tp->Booleans[last] = tp->Booleans[last - 1];
152fdd4e1e0SJan Lentfer break;
153fdd4e1e0SJan Lentfer case NUMBER:
15400d8f3c4SJohn Marino tp->ext_Numbers++;
15500d8f3c4SJohn Marino tp->num_Numbers++;
156*32bb5217SDaniel Fojt TYPE_REALLOC(NCURSES_INT2, tp->num_Numbers, tp->Numbers);
15700d8f3c4SJohn Marino for_each_value(tp->num_Numbers)
158fdd4e1e0SJan Lentfer tp->Numbers[last] = tp->Numbers[last - 1];
159fdd4e1e0SJan Lentfer break;
160fdd4e1e0SJan Lentfer case STRING:
16100d8f3c4SJohn Marino tp->ext_Strings++;
16200d8f3c4SJohn Marino tp->num_Strings++;
1633468e90cSJohn Marino TYPE_REALLOC(char *, tp->num_Strings, tp->Strings);
16400d8f3c4SJohn Marino for_each_value(tp->num_Strings)
165fdd4e1e0SJan Lentfer tp->Strings[last] = tp->Strings[last - 1];
166fdd4e1e0SJan Lentfer break;
167fdd4e1e0SJan Lentfer }
168fdd4e1e0SJan Lentfer actual = NUM_EXT_NAMES(tp);
1693468e90cSJohn Marino TYPE_REALLOC(char *, actual, tp->ext_Names);
170fdd4e1e0SJan Lentfer while (--actual > offset)
171fdd4e1e0SJan Lentfer tp->ext_Names[actual] = tp->ext_Names[actual - 1];
172fdd4e1e0SJan Lentfer tp->ext_Names[offset] = _nc_save_str(name);
173fdd4e1e0SJan Lentfer }
174fdd4e1e0SJan Lentfer
175fdd4e1e0SJan Lentfer temp.nte_name = tp->ext_Names[offset];
176fdd4e1e0SJan Lentfer temp.nte_type = token_type;
17700d8f3c4SJohn Marino temp.nte_index = (short) tindex;
178fdd4e1e0SJan Lentfer temp.nte_link = -1;
179fdd4e1e0SJan Lentfer
180fdd4e1e0SJan Lentfer return &temp;
181fdd4e1e0SJan Lentfer }
182*32bb5217SDaniel Fojt
183*32bb5217SDaniel Fojt static const char *
usertype2s(int mask)184*32bb5217SDaniel Fojt usertype2s(int mask)
185*32bb5217SDaniel Fojt {
186*32bb5217SDaniel Fojt const char *result = "unknown";
187*32bb5217SDaniel Fojt if (mask & (1 << BOOLEAN)) {
188*32bb5217SDaniel Fojt result = "boolean";
189*32bb5217SDaniel Fojt } else if (mask & (1 << NUMBER)) {
190*32bb5217SDaniel Fojt result = "number";
191*32bb5217SDaniel Fojt } else if (mask & (1 << STRING)) {
192*32bb5217SDaniel Fojt result = "string";
193*32bb5217SDaniel Fojt }
194*32bb5217SDaniel Fojt return result;
195*32bb5217SDaniel Fojt }
196*32bb5217SDaniel Fojt
197*32bb5217SDaniel Fojt static bool
expected_type(const char * name,int token_type,bool silent)198*32bb5217SDaniel Fojt expected_type(const char *name, int token_type, bool silent)
199*32bb5217SDaniel Fojt {
200*32bb5217SDaniel Fojt struct user_table_entry const *entry = _nc_find_user_entry(name);
201*32bb5217SDaniel Fojt bool result = TRUE;
202*32bb5217SDaniel Fojt if ((entry != 0) && (token_type != CANCEL)) {
203*32bb5217SDaniel Fojt int have_type = (1 << token_type);
204*32bb5217SDaniel Fojt if (!(entry->ute_type & have_type)) {
205*32bb5217SDaniel Fojt if (!silent)
206*32bb5217SDaniel Fojt _nc_warning("expected %s-type for %s, have %s",
207*32bb5217SDaniel Fojt usertype2s(entry->ute_type),
208*32bb5217SDaniel Fojt name,
209*32bb5217SDaniel Fojt usertype2s(have_type));
210*32bb5217SDaniel Fojt result = FALSE;
211*32bb5217SDaniel Fojt }
212*32bb5217SDaniel Fojt }
213*32bb5217SDaniel Fojt return result;
214*32bb5217SDaniel Fojt }
215fdd4e1e0SJan Lentfer #endif /* NCURSES_XNAMES */
216fdd4e1e0SJan Lentfer
217*32bb5217SDaniel Fojt static bool
valid_entryname(const char * name)218*32bb5217SDaniel Fojt valid_entryname(const char *name)
219*32bb5217SDaniel Fojt {
220*32bb5217SDaniel Fojt bool result = TRUE;
221*32bb5217SDaniel Fojt int ch;
222*32bb5217SDaniel Fojt while ((ch = UChar(*name++)) != '\0') {
223*32bb5217SDaniel Fojt if (ch <= ' ' || ch > '~' || ch == '/') {
224*32bb5217SDaniel Fojt result = FALSE;
225*32bb5217SDaniel Fojt break;
226*32bb5217SDaniel Fojt }
227*32bb5217SDaniel Fojt }
228*32bb5217SDaniel Fojt return result;
229*32bb5217SDaniel Fojt }
230*32bb5217SDaniel Fojt
231fdd4e1e0SJan Lentfer /*
232fdd4e1e0SJan Lentfer * int
233fdd4e1e0SJan Lentfer * _nc_parse_entry(entry, literal, silent)
234fdd4e1e0SJan Lentfer *
235fdd4e1e0SJan Lentfer * Compile one entry. Doesn't try to resolve use or tc capabilities.
236fdd4e1e0SJan Lentfer *
237fdd4e1e0SJan Lentfer * found-forward-use = FALSE
238fdd4e1e0SJan Lentfer * re-initialise internal arrays
239fdd4e1e0SJan Lentfer * get_token();
240fdd4e1e0SJan Lentfer * if the token was not a name in column 1, complain and die
241fdd4e1e0SJan Lentfer * save names in entry's string table
242fdd4e1e0SJan Lentfer * while (get_token() is not EOF and not NAMES)
243fdd4e1e0SJan Lentfer * check for existence and type-correctness
244fdd4e1e0SJan Lentfer * enter cap into structure
245fdd4e1e0SJan Lentfer * if STRING
246fdd4e1e0SJan Lentfer * save string in entry's string table
247fdd4e1e0SJan Lentfer * push back token
248fdd4e1e0SJan Lentfer */
249fdd4e1e0SJan Lentfer
250fdd4e1e0SJan Lentfer #define BAD_TC_USAGE if (!bad_tc_usage) \
251fdd4e1e0SJan Lentfer { bad_tc_usage = TRUE; \
252fdd4e1e0SJan Lentfer _nc_warning("Legacy termcap allows only a trailing tc= clause"); }
253fdd4e1e0SJan Lentfer
254*32bb5217SDaniel Fojt #define MAX_NUMBER MAX_OF_TYPE(NCURSES_INT2)
2553468e90cSJohn Marino
256fdd4e1e0SJan Lentfer NCURSES_EXPORT(int)
_nc_parse_entry(ENTRY * entryp,int literal,bool silent)257*32bb5217SDaniel Fojt _nc_parse_entry(ENTRY * entryp, int literal, bool silent)
258fdd4e1e0SJan Lentfer {
259fdd4e1e0SJan Lentfer int token_type;
260fdd4e1e0SJan Lentfer struct name_table_entry const *entry_ptr;
261fdd4e1e0SJan Lentfer char *ptr, *base;
262*32bb5217SDaniel Fojt const char *name;
263fdd4e1e0SJan Lentfer bool bad_tc_usage = FALSE;
264fdd4e1e0SJan Lentfer
265fdd4e1e0SJan Lentfer token_type = _nc_get_token(silent);
266fdd4e1e0SJan Lentfer
267fdd4e1e0SJan Lentfer if (token_type == EOF)
268fdd4e1e0SJan Lentfer return (EOF);
269fdd4e1e0SJan Lentfer if (token_type != NAMES)
270fdd4e1e0SJan Lentfer _nc_err_abort("Entry does not start with terminal names in column one");
271fdd4e1e0SJan Lentfer
272*32bb5217SDaniel Fojt _nc_init_entry(entryp);
273fdd4e1e0SJan Lentfer
274fdd4e1e0SJan Lentfer entryp->cstart = _nc_comment_start;
275fdd4e1e0SJan Lentfer entryp->cend = _nc_comment_end;
276fdd4e1e0SJan Lentfer entryp->startline = _nc_start_line;
277fdd4e1e0SJan Lentfer DEBUG(2, ("Comment range is %ld to %ld", entryp->cstart, entryp->cend));
278fdd4e1e0SJan Lentfer
279fdd4e1e0SJan Lentfer /*
280fdd4e1e0SJan Lentfer * Strip off the 2-character termcap name, if present. Originally termcap
281fdd4e1e0SJan Lentfer * used that as an indexing aid. We can retain 2-character terminfo names,
282fdd4e1e0SJan Lentfer * but note that they would be lost if we translate to/from termcap. This
283fdd4e1e0SJan Lentfer * feature is supposedly obsolete since "newer" BSD implementations do not
284fdd4e1e0SJan Lentfer * use it; however our reference for this feature is SunOS 4.x, which
285fdd4e1e0SJan Lentfer * implemented it. Note that the resulting terminal type was never the
286fdd4e1e0SJan Lentfer * 2-character name, but was instead the first alias after that.
287fdd4e1e0SJan Lentfer */
288*32bb5217SDaniel Fojt #define ok_TC2(s) (isgraph(UChar(s)) && (s) != '|')
289fdd4e1e0SJan Lentfer ptr = _nc_curr_token.tk_name;
2901d102085SJan Lentfer if (_nc_syntax == SYN_TERMCAP
2911d102085SJan Lentfer #if NCURSES_XNAMES
2921d102085SJan Lentfer && !_nc_user_definable
2931d102085SJan Lentfer #endif
2941d102085SJan Lentfer ) {
295*32bb5217SDaniel Fojt if (ok_TC2(ptr[0]) && ok_TC2(ptr[1]) && (ptr[2] == '|')) {
296fdd4e1e0SJan Lentfer ptr += 3;
297fdd4e1e0SJan Lentfer _nc_curr_token.tk_name[2] = '\0';
298fdd4e1e0SJan Lentfer }
299fdd4e1e0SJan Lentfer }
300fdd4e1e0SJan Lentfer
301fdd4e1e0SJan Lentfer entryp->tterm.str_table = entryp->tterm.term_names = _nc_save_str(ptr);
302fdd4e1e0SJan Lentfer
3031d102085SJan Lentfer if (entryp->tterm.str_table == 0)
3041d102085SJan Lentfer return (ERR);
3051d102085SJan Lentfer
306fdd4e1e0SJan Lentfer DEBUG(1, ("Starting '%s'", ptr));
307fdd4e1e0SJan Lentfer
308fdd4e1e0SJan Lentfer /*
309fdd4e1e0SJan Lentfer * We do this because the one-token lookahead in the parse loop
310fdd4e1e0SJan Lentfer * results in the terminal type getting prematurely set to correspond
311fdd4e1e0SJan Lentfer * to that of the next entry.
312fdd4e1e0SJan Lentfer */
313*32bb5217SDaniel Fojt name = _nc_first_name(entryp->tterm.term_names);
314*32bb5217SDaniel Fojt if (!valid_entryname(name)) {
315*32bb5217SDaniel Fojt _nc_warning("invalid entry name \"%s\"", name);
316*32bb5217SDaniel Fojt name = "invalid";
317*32bb5217SDaniel Fojt }
318*32bb5217SDaniel Fojt _nc_set_type(name);
319fdd4e1e0SJan Lentfer
320fdd4e1e0SJan Lentfer /* check for overly-long names and aliases */
321fdd4e1e0SJan Lentfer for (base = entryp->tterm.term_names; (ptr = strchr(base, '|')) != 0;
322fdd4e1e0SJan Lentfer base = ptr + 1) {
323fdd4e1e0SJan Lentfer if (ptr - base > MAX_ALIAS) {
324fdd4e1e0SJan Lentfer _nc_warning("%s `%.*s' may be too long",
325fdd4e1e0SJan Lentfer (base == entryp->tterm.term_names)
326fdd4e1e0SJan Lentfer ? "primary name"
327fdd4e1e0SJan Lentfer : "alias",
328fdd4e1e0SJan Lentfer (int) (ptr - base), base);
329fdd4e1e0SJan Lentfer }
330fdd4e1e0SJan Lentfer }
331fdd4e1e0SJan Lentfer
332fdd4e1e0SJan Lentfer entryp->nuses = 0;
333fdd4e1e0SJan Lentfer
334fdd4e1e0SJan Lentfer for (token_type = _nc_get_token(silent);
335fdd4e1e0SJan Lentfer token_type != EOF && token_type != NAMES;
336fdd4e1e0SJan Lentfer token_type = _nc_get_token(silent)) {
337fdd4e1e0SJan Lentfer bool is_use = (strcmp(_nc_curr_token.tk_name, "use") == 0);
338fdd4e1e0SJan Lentfer bool is_tc = !is_use && (strcmp(_nc_curr_token.tk_name, "tc") == 0);
339fdd4e1e0SJan Lentfer if (is_use || is_tc) {
340*32bb5217SDaniel Fojt if (!VALID_STRING(_nc_curr_token.tk_valstring)
341*32bb5217SDaniel Fojt || _nc_curr_token.tk_valstring[0] == '\0') {
342*32bb5217SDaniel Fojt _nc_warning("missing name for use-clause");
343*32bb5217SDaniel Fojt continue;
344*32bb5217SDaniel Fojt } else if (!valid_entryname(_nc_curr_token.tk_valstring)) {
345*32bb5217SDaniel Fojt _nc_warning("invalid name for use-clause \"%s\"",
346*32bb5217SDaniel Fojt _nc_curr_token.tk_valstring);
347*32bb5217SDaniel Fojt continue;
348*32bb5217SDaniel Fojt } else if (entryp->nuses >= MAX_USES) {
349*32bb5217SDaniel Fojt _nc_warning("too many use-clauses, ignored \"%s\"",
350*32bb5217SDaniel Fojt _nc_curr_token.tk_valstring);
351*32bb5217SDaniel Fojt continue;
352*32bb5217SDaniel Fojt }
353fdd4e1e0SJan Lentfer entryp->uses[entryp->nuses].name = _nc_save_str(_nc_curr_token.tk_valstring);
354fdd4e1e0SJan Lentfer entryp->uses[entryp->nuses].line = _nc_curr_line;
355fdd4e1e0SJan Lentfer entryp->nuses++;
356fdd4e1e0SJan Lentfer if (entryp->nuses > 1 && is_tc) {
357fdd4e1e0SJan Lentfer BAD_TC_USAGE
358fdd4e1e0SJan Lentfer }
359fdd4e1e0SJan Lentfer } else {
360fdd4e1e0SJan Lentfer /* normal token lookup */
361fdd4e1e0SJan Lentfer entry_ptr = _nc_find_entry(_nc_curr_token.tk_name,
3621d102085SJan Lentfer _nc_get_hash_table(_nc_syntax));
363fdd4e1e0SJan Lentfer
364fdd4e1e0SJan Lentfer /*
365fdd4e1e0SJan Lentfer * Our kluge to handle aliasing. The reason it's done
366fdd4e1e0SJan Lentfer * this ugly way, with a linear search, is so the hashing
367fdd4e1e0SJan Lentfer * machinery doesn't have to be made really complicated
368fdd4e1e0SJan Lentfer * (also we get better warnings this way). No point in
369fdd4e1e0SJan Lentfer * making this case fast, aliased caps aren't common now
370fdd4e1e0SJan Lentfer * and will get rarer.
371fdd4e1e0SJan Lentfer */
372fdd4e1e0SJan Lentfer if (entry_ptr == NOTFOUND) {
373fdd4e1e0SJan Lentfer const struct alias *ap;
374fdd4e1e0SJan Lentfer
375fdd4e1e0SJan Lentfer if (_nc_syntax == SYN_TERMCAP) {
376fdd4e1e0SJan Lentfer if (entryp->nuses != 0) {
377fdd4e1e0SJan Lentfer BAD_TC_USAGE
378fdd4e1e0SJan Lentfer }
3791d102085SJan Lentfer for (ap = _nc_get_alias_table(TRUE); ap->from; ap++)
380fdd4e1e0SJan Lentfer if (strcmp(ap->from, _nc_curr_token.tk_name) == 0) {
381fdd4e1e0SJan Lentfer if (ap->to == (char *) 0) {
382fdd4e1e0SJan Lentfer _nc_warning("%s (%s termcap extension) ignored",
383fdd4e1e0SJan Lentfer ap->from, ap->source);
384fdd4e1e0SJan Lentfer goto nexttok;
385fdd4e1e0SJan Lentfer }
386fdd4e1e0SJan Lentfer
3871d102085SJan Lentfer entry_ptr = _nc_find_entry(ap->to,
3881d102085SJan Lentfer _nc_get_hash_table(TRUE));
389fdd4e1e0SJan Lentfer if (entry_ptr && !silent)
390fdd4e1e0SJan Lentfer _nc_warning("%s (%s termcap extension) aliased to %s",
391fdd4e1e0SJan Lentfer ap->from, ap->source, ap->to);
392fdd4e1e0SJan Lentfer break;
393fdd4e1e0SJan Lentfer }
394fdd4e1e0SJan Lentfer } else { /* if (_nc_syntax == SYN_TERMINFO) */
3951d102085SJan Lentfer for (ap = _nc_get_alias_table(FALSE); ap->from; ap++)
396fdd4e1e0SJan Lentfer if (strcmp(ap->from, _nc_curr_token.tk_name) == 0) {
397fdd4e1e0SJan Lentfer if (ap->to == (char *) 0) {
398fdd4e1e0SJan Lentfer _nc_warning("%s (%s terminfo extension) ignored",
399fdd4e1e0SJan Lentfer ap->from, ap->source);
400fdd4e1e0SJan Lentfer goto nexttok;
401fdd4e1e0SJan Lentfer }
402fdd4e1e0SJan Lentfer
4031d102085SJan Lentfer entry_ptr = _nc_find_entry(ap->to,
4041d102085SJan Lentfer _nc_get_hash_table(FALSE));
405fdd4e1e0SJan Lentfer if (entry_ptr && !silent)
406fdd4e1e0SJan Lentfer _nc_warning("%s (%s terminfo extension) aliased to %s",
407fdd4e1e0SJan Lentfer ap->from, ap->source, ap->to);
408fdd4e1e0SJan Lentfer break;
409fdd4e1e0SJan Lentfer }
410fdd4e1e0SJan Lentfer
411fdd4e1e0SJan Lentfer if (entry_ptr == NOTFOUND) {
412fdd4e1e0SJan Lentfer entry_ptr = lookup_fullname(_nc_curr_token.tk_name);
413fdd4e1e0SJan Lentfer }
414fdd4e1e0SJan Lentfer }
415fdd4e1e0SJan Lentfer }
416fdd4e1e0SJan Lentfer #if NCURSES_XNAMES
417fdd4e1e0SJan Lentfer /*
418fdd4e1e0SJan Lentfer * If we have extended-names active, we will automatically
419fdd4e1e0SJan Lentfer * define a name based on its context.
420fdd4e1e0SJan Lentfer */
421fdd4e1e0SJan Lentfer if (entry_ptr == NOTFOUND
422*32bb5217SDaniel Fojt && _nc_user_definable) {
423*32bb5217SDaniel Fojt if (expected_type(_nc_curr_token.tk_name, token_type, silent)) {
424*32bb5217SDaniel Fojt if ((entry_ptr = _nc_extend_names(entryp,
425fdd4e1e0SJan Lentfer _nc_curr_token.tk_name,
426fdd4e1e0SJan Lentfer token_type)) != 0) {
427*32bb5217SDaniel Fojt if (_nc_tracing >= DEBUG_LEVEL(1)) {
428*32bb5217SDaniel Fojt _nc_warning("extended capability '%s'",
429*32bb5217SDaniel Fojt _nc_curr_token.tk_name);
430*32bb5217SDaniel Fojt }
431*32bb5217SDaniel Fojt }
432*32bb5217SDaniel Fojt } else {
433*32bb5217SDaniel Fojt /* ignore it: we have already printed error message */
434*32bb5217SDaniel Fojt continue;
435*32bb5217SDaniel Fojt }
436fdd4e1e0SJan Lentfer }
437fdd4e1e0SJan Lentfer #endif /* NCURSES_XNAMES */
438fdd4e1e0SJan Lentfer
439fdd4e1e0SJan Lentfer /* can't find this cap name, not even as an alias */
440fdd4e1e0SJan Lentfer if (entry_ptr == NOTFOUND) {
441fdd4e1e0SJan Lentfer if (!silent)
442fdd4e1e0SJan Lentfer _nc_warning("unknown capability '%s'",
443fdd4e1e0SJan Lentfer _nc_curr_token.tk_name);
444fdd4e1e0SJan Lentfer continue;
445fdd4e1e0SJan Lentfer }
446fdd4e1e0SJan Lentfer
447fdd4e1e0SJan Lentfer /* deal with bad type/value combinations. */
448*32bb5217SDaniel Fojt if (token_type == CANCEL) {
449*32bb5217SDaniel Fojt /*
450*32bb5217SDaniel Fojt * Prefer terminfo in this (long-obsolete) ambiguity:
451*32bb5217SDaniel Fojt */
452*32bb5217SDaniel Fojt if (!strcmp("ma", _nc_curr_token.tk_name)) {
453*32bb5217SDaniel Fojt entry_ptr = _nc_find_type_entry("ma", NUMBER,
454*32bb5217SDaniel Fojt _nc_syntax != 0);
455*32bb5217SDaniel Fojt assert(entry_ptr != 0);
456*32bb5217SDaniel Fojt }
457*32bb5217SDaniel Fojt } else if (entry_ptr->nte_type != token_type) {
458fdd4e1e0SJan Lentfer /*
459fdd4e1e0SJan Lentfer * Nasty special cases here handle situations in which type
460fdd4e1e0SJan Lentfer * information can resolve name clashes. Normal lookup
461fdd4e1e0SJan Lentfer * finds the last instance in the capability table of a
462fdd4e1e0SJan Lentfer * given name, regardless of type. find_type_entry looks
463fdd4e1e0SJan Lentfer * for a first matching instance with given type. So as
464fdd4e1e0SJan Lentfer * long as all ambiguous names occur in pairs of distinct
465fdd4e1e0SJan Lentfer * type, this will do the job.
466fdd4e1e0SJan Lentfer */
467fdd4e1e0SJan Lentfer
4681d102085SJan Lentfer if (token_type == NUMBER
4691d102085SJan Lentfer && !strcmp("ma", _nc_curr_token.tk_name)) {
470fdd4e1e0SJan Lentfer /* tell max_attributes from arrow_key_map */
471fdd4e1e0SJan Lentfer entry_ptr = _nc_find_type_entry("ma", NUMBER,
47200d8f3c4SJohn Marino _nc_syntax != 0);
4731d102085SJan Lentfer assert(entry_ptr != 0);
474fdd4e1e0SJan Lentfer
4751d102085SJan Lentfer } else if (token_type == STRING
4761d102085SJan Lentfer && !strcmp("MT", _nc_curr_token.tk_name)) {
477fdd4e1e0SJan Lentfer /* map terminfo's string MT to MT */
478fdd4e1e0SJan Lentfer entry_ptr = _nc_find_type_entry("MT", STRING,
47900d8f3c4SJohn Marino _nc_syntax != 0);
4801d102085SJan Lentfer assert(entry_ptr != 0);
481fdd4e1e0SJan Lentfer
4821d102085SJan Lentfer } else if (token_type == BOOLEAN
4831d102085SJan Lentfer && entry_ptr->nte_type == STRING) {
484fdd4e1e0SJan Lentfer /* treat strings without following "=" as empty strings */
485fdd4e1e0SJan Lentfer token_type = STRING;
4861d102085SJan Lentfer } else {
487fdd4e1e0SJan Lentfer /* we couldn't recover; skip this token */
488fdd4e1e0SJan Lentfer if (!silent) {
489fdd4e1e0SJan Lentfer const char *type_name;
490fdd4e1e0SJan Lentfer switch (entry_ptr->nte_type) {
491fdd4e1e0SJan Lentfer case BOOLEAN:
492fdd4e1e0SJan Lentfer type_name = "boolean";
493fdd4e1e0SJan Lentfer break;
494fdd4e1e0SJan Lentfer case STRING:
495fdd4e1e0SJan Lentfer type_name = "string";
496fdd4e1e0SJan Lentfer break;
497fdd4e1e0SJan Lentfer case NUMBER:
498fdd4e1e0SJan Lentfer type_name = "numeric";
499fdd4e1e0SJan Lentfer break;
500fdd4e1e0SJan Lentfer default:
501fdd4e1e0SJan Lentfer type_name = "unknown";
502fdd4e1e0SJan Lentfer break;
503fdd4e1e0SJan Lentfer }
504fdd4e1e0SJan Lentfer _nc_warning("wrong type used for %s capability '%s'",
505fdd4e1e0SJan Lentfer type_name, _nc_curr_token.tk_name);
506fdd4e1e0SJan Lentfer }
507fdd4e1e0SJan Lentfer continue;
508fdd4e1e0SJan Lentfer }
509fdd4e1e0SJan Lentfer }
510fdd4e1e0SJan Lentfer
511fdd4e1e0SJan Lentfer /* now we know that the type/value combination is OK */
512fdd4e1e0SJan Lentfer switch (token_type) {
513fdd4e1e0SJan Lentfer case CANCEL:
514fdd4e1e0SJan Lentfer switch (entry_ptr->nte_type) {
515fdd4e1e0SJan Lentfer case BOOLEAN:
516fdd4e1e0SJan Lentfer entryp->tterm.Booleans[entry_ptr->nte_index] = CANCELLED_BOOLEAN;
517fdd4e1e0SJan Lentfer break;
518fdd4e1e0SJan Lentfer
519fdd4e1e0SJan Lentfer case NUMBER:
520fdd4e1e0SJan Lentfer entryp->tterm.Numbers[entry_ptr->nte_index] = CANCELLED_NUMERIC;
521fdd4e1e0SJan Lentfer break;
522fdd4e1e0SJan Lentfer
523fdd4e1e0SJan Lentfer case STRING:
524fdd4e1e0SJan Lentfer entryp->tterm.Strings[entry_ptr->nte_index] = CANCELLED_STRING;
525fdd4e1e0SJan Lentfer break;
526fdd4e1e0SJan Lentfer }
527fdd4e1e0SJan Lentfer break;
528fdd4e1e0SJan Lentfer
529fdd4e1e0SJan Lentfer case BOOLEAN:
530fdd4e1e0SJan Lentfer entryp->tterm.Booleans[entry_ptr->nte_index] = TRUE;
531fdd4e1e0SJan Lentfer break;
532fdd4e1e0SJan Lentfer
533fdd4e1e0SJan Lentfer case NUMBER:
534*32bb5217SDaniel Fojt #if !NCURSES_EXT_NUMBERS
5353468e90cSJohn Marino if (_nc_curr_token.tk_valnumber > MAX_NUMBER) {
5363468e90cSJohn Marino entryp->tterm.Numbers[entry_ptr->nte_index] = MAX_NUMBER;
537*32bb5217SDaniel Fojt } else
538*32bb5217SDaniel Fojt #endif
539*32bb5217SDaniel Fojt {
540fdd4e1e0SJan Lentfer entryp->tterm.Numbers[entry_ptr->nte_index] =
541*32bb5217SDaniel Fojt (NCURSES_INT2) _nc_curr_token.tk_valnumber;
5423468e90cSJohn Marino }
543fdd4e1e0SJan Lentfer break;
544fdd4e1e0SJan Lentfer
545fdd4e1e0SJan Lentfer case STRING:
546fdd4e1e0SJan Lentfer ptr = _nc_curr_token.tk_valstring;
547fdd4e1e0SJan Lentfer if (_nc_syntax == SYN_TERMCAP)
548fdd4e1e0SJan Lentfer ptr = _nc_captoinfo(_nc_curr_token.tk_name,
549fdd4e1e0SJan Lentfer ptr,
550fdd4e1e0SJan Lentfer parametrized[entry_ptr->nte_index]);
551fdd4e1e0SJan Lentfer entryp->tterm.Strings[entry_ptr->nte_index] = _nc_save_str(ptr);
552fdd4e1e0SJan Lentfer break;
553fdd4e1e0SJan Lentfer
554fdd4e1e0SJan Lentfer default:
555fdd4e1e0SJan Lentfer if (!silent)
556fdd4e1e0SJan Lentfer _nc_warning("unknown token type");
5571d102085SJan Lentfer _nc_panic_mode((char) ((_nc_syntax == SYN_TERMCAP) ? ':' : ','));
558fdd4e1e0SJan Lentfer continue;
559fdd4e1e0SJan Lentfer }
560fdd4e1e0SJan Lentfer } /* end else cur_token.name != "use" */
561fdd4e1e0SJan Lentfer nexttok:
562fdd4e1e0SJan Lentfer continue; /* cannot have a label w/o statement */
563fdd4e1e0SJan Lentfer } /* endwhile (not EOF and not NAMES) */
564fdd4e1e0SJan Lentfer
565fdd4e1e0SJan Lentfer _nc_push_token(token_type);
566fdd4e1e0SJan Lentfer _nc_set_type(_nc_first_name(entryp->tterm.term_names));
567fdd4e1e0SJan Lentfer
568fdd4e1e0SJan Lentfer /*
569fdd4e1e0SJan Lentfer * Try to deduce as much as possible from extension capabilities
570fdd4e1e0SJan Lentfer * (this includes obsolete BSD capabilities). Sigh...it would be more
571fdd4e1e0SJan Lentfer * space-efficient to call this after use resolution, but it has
572fdd4e1e0SJan Lentfer * to be done before entry allocation is wrapped up.
573fdd4e1e0SJan Lentfer */
574fdd4e1e0SJan Lentfer if (!literal) {
575fdd4e1e0SJan Lentfer if (_nc_syntax == SYN_TERMCAP) {
576fdd4e1e0SJan Lentfer bool has_base_entry = FALSE;
577fdd4e1e0SJan Lentfer
578fdd4e1e0SJan Lentfer /*
579fdd4e1e0SJan Lentfer * Don't insert defaults if this is a `+' entry meant only
580fdd4e1e0SJan Lentfer * for inclusion in other entries (not sure termcap ever
581fdd4e1e0SJan Lentfer * had these, actually).
582fdd4e1e0SJan Lentfer */
583*32bb5217SDaniel Fojt if (strchr(entryp->tterm.term_names, '+')) {
584fdd4e1e0SJan Lentfer has_base_entry = TRUE;
585*32bb5217SDaniel Fojt } else {
586*32bb5217SDaniel Fojt unsigned i;
587fdd4e1e0SJan Lentfer /*
588fdd4e1e0SJan Lentfer * Otherwise, look for a base entry that will already
589fdd4e1e0SJan Lentfer * have picked up defaults via translation.
590fdd4e1e0SJan Lentfer */
591*32bb5217SDaniel Fojt for (i = 0; i < entryp->nuses; i++) {
592*32bb5217SDaniel Fojt if (entryp->uses[i].name != 0
593*32bb5217SDaniel Fojt && !strchr(entryp->uses[i].name, '+'))
594fdd4e1e0SJan Lentfer has_base_entry = TRUE;
595*32bb5217SDaniel Fojt }
596*32bb5217SDaniel Fojt }
597fdd4e1e0SJan Lentfer
598fdd4e1e0SJan Lentfer postprocess_termcap(&entryp->tterm, has_base_entry);
599fdd4e1e0SJan Lentfer } else
600fdd4e1e0SJan Lentfer postprocess_terminfo(&entryp->tterm);
601fdd4e1e0SJan Lentfer }
602fdd4e1e0SJan Lentfer _nc_wrap_entry(entryp, FALSE);
603fdd4e1e0SJan Lentfer
604fdd4e1e0SJan Lentfer return (OK);
605fdd4e1e0SJan Lentfer }
606fdd4e1e0SJan Lentfer
607fdd4e1e0SJan Lentfer NCURSES_EXPORT(int)
_nc_capcmp(const char * s,const char * t)608fdd4e1e0SJan Lentfer _nc_capcmp(const char *s, const char *t)
609fdd4e1e0SJan Lentfer /* compare two string capabilities, stripping out padding */
610fdd4e1e0SJan Lentfer {
611*32bb5217SDaniel Fojt bool ok_s = VALID_STRING(s);
612*32bb5217SDaniel Fojt bool ok_t = VALID_STRING(t);
613fdd4e1e0SJan Lentfer
614*32bb5217SDaniel Fojt if (ok_s && ok_t) {
615fdd4e1e0SJan Lentfer for (;;) {
616fdd4e1e0SJan Lentfer if (s[0] == '$' && s[1] == '<') {
617*32bb5217SDaniel Fojt for (s += 2;; s++) {
618fdd4e1e0SJan Lentfer if (!(isdigit(UChar(*s))
619fdd4e1e0SJan Lentfer || *s == '.'
620fdd4e1e0SJan Lentfer || *s == '*'
621fdd4e1e0SJan Lentfer || *s == '/'
622*32bb5217SDaniel Fojt || *s == '>')) {
623fdd4e1e0SJan Lentfer break;
624fdd4e1e0SJan Lentfer }
625*32bb5217SDaniel Fojt }
626*32bb5217SDaniel Fojt }
627fdd4e1e0SJan Lentfer
628fdd4e1e0SJan Lentfer if (t[0] == '$' && t[1] == '<') {
629*32bb5217SDaniel Fojt for (t += 2;; t++) {
630fdd4e1e0SJan Lentfer if (!(isdigit(UChar(*t))
631fdd4e1e0SJan Lentfer || *t == '.'
632fdd4e1e0SJan Lentfer || *t == '*'
633fdd4e1e0SJan Lentfer || *t == '/'
634*32bb5217SDaniel Fojt || *t == '>')) {
635fdd4e1e0SJan Lentfer break;
636fdd4e1e0SJan Lentfer }
637*32bb5217SDaniel Fojt }
638*32bb5217SDaniel Fojt }
639fdd4e1e0SJan Lentfer
640*32bb5217SDaniel Fojt /* we've now pushed s and t past any padding they pointed at */
641fdd4e1e0SJan Lentfer
642fdd4e1e0SJan Lentfer if (*s == '\0' && *t == '\0')
643fdd4e1e0SJan Lentfer return (0);
644fdd4e1e0SJan Lentfer
645fdd4e1e0SJan Lentfer if (*s != *t)
646fdd4e1e0SJan Lentfer return (*t - *s);
647fdd4e1e0SJan Lentfer
648fdd4e1e0SJan Lentfer /* else *s == *t but one is not NUL, so continue */
649fdd4e1e0SJan Lentfer s++, t++;
650fdd4e1e0SJan Lentfer }
651*32bb5217SDaniel Fojt } else if (ok_s || ok_t) {
652*32bb5217SDaniel Fojt return 1;
653*32bb5217SDaniel Fojt }
654*32bb5217SDaniel Fojt return 0;
655fdd4e1e0SJan Lentfer }
656fdd4e1e0SJan Lentfer
657fdd4e1e0SJan Lentfer static void
append_acs0(string_desc * dst,int code,char * src,size_t off)658*32bb5217SDaniel Fojt append_acs0(string_desc * dst, int code, char *src, size_t off)
659fdd4e1e0SJan Lentfer {
660*32bb5217SDaniel Fojt if (src != 0 && off < strlen(src)) {
661fdd4e1e0SJan Lentfer char temp[3];
6621d102085SJan Lentfer temp[0] = (char) code;
663*32bb5217SDaniel Fojt temp[1] = src[off];
664fdd4e1e0SJan Lentfer temp[2] = 0;
665fdd4e1e0SJan Lentfer _nc_safe_strcat(dst, temp);
666fdd4e1e0SJan Lentfer }
667fdd4e1e0SJan Lentfer }
668fdd4e1e0SJan Lentfer
669fdd4e1e0SJan Lentfer static void
append_acs(string_desc * dst,int code,char * src)670fdd4e1e0SJan Lentfer append_acs(string_desc * dst, int code, char *src)
671fdd4e1e0SJan Lentfer {
672*32bb5217SDaniel Fojt if (VALID_STRING(src) && strlen(src) == 1) {
673*32bb5217SDaniel Fojt append_acs0(dst, code, src, 0);
674fdd4e1e0SJan Lentfer }
675fdd4e1e0SJan Lentfer }
676fdd4e1e0SJan Lentfer
677fdd4e1e0SJan Lentfer /*
678fdd4e1e0SJan Lentfer * The ko capability, if present, consists of a comma-separated capability
679fdd4e1e0SJan Lentfer * list. For each capability, we may assume there is a keycap that sends the
680fdd4e1e0SJan Lentfer * string which is the value of that capability.
681fdd4e1e0SJan Lentfer */
6823468e90cSJohn Marino #define DATA(from, to) { { from }, { to } }
683fdd4e1e0SJan Lentfer typedef struct {
6843468e90cSJohn Marino const char from[3];
6853468e90cSJohn Marino const char to[6];
686fdd4e1e0SJan Lentfer } assoc;
687fdd4e1e0SJan Lentfer static assoc const ko_xlate[] =
688fdd4e1e0SJan Lentfer {
6893468e90cSJohn Marino DATA("al", "kil1"), /* insert line key -> KEY_IL */
6903468e90cSJohn Marino DATA("bt", "kcbt"), /* back tab -> KEY_BTAB */
6913468e90cSJohn Marino DATA("cd", "ked"), /* clear-to-eos key -> KEY_EOL */
6923468e90cSJohn Marino DATA("ce", "kel"), /* clear-to-eol key -> KEY_EOS */
6933468e90cSJohn Marino DATA("cl", "kclr"), /* clear key -> KEY_CLEAR */
6943468e90cSJohn Marino DATA("ct", "tbc"), /* clear all tabs -> KEY_CATAB */
6953468e90cSJohn Marino DATA("dc", "kdch1"), /* delete char -> KEY_DC */
6963468e90cSJohn Marino DATA("dl", "kdl1"), /* delete line -> KEY_DL */
6973468e90cSJohn Marino DATA("do", "kcud1"), /* down key -> KEY_DOWN */
6983468e90cSJohn Marino DATA("ei", "krmir"), /* exit insert key -> KEY_EIC */
6993468e90cSJohn Marino DATA("ho", "khome"), /* home key -> KEY_HOME */
7003468e90cSJohn Marino DATA("ic", "kich1"), /* insert char key -> KEY_IC */
7013468e90cSJohn Marino DATA("im", "kIC"), /* insert-mode key -> KEY_SIC */
7023468e90cSJohn Marino DATA("le", "kcub1"), /* le key -> KEY_LEFT */
7033468e90cSJohn Marino DATA("nd", "kcuf1"), /* nd key -> KEY_RIGHT */
7043468e90cSJohn Marino DATA("nl", "kent"), /* new line key -> KEY_ENTER */
7053468e90cSJohn Marino DATA("st", "khts"), /* set-tab key -> KEY_STAB */
7063468e90cSJohn Marino DATA("ta", ""),
7073468e90cSJohn Marino DATA("up", "kcuu1"), /* up-arrow key -> KEY_UP */
708fdd4e1e0SJan Lentfer };
709fdd4e1e0SJan Lentfer
710fdd4e1e0SJan Lentfer /*
711fdd4e1e0SJan Lentfer * This routine fills in string caps that either had defaults under
712fdd4e1e0SJan Lentfer * termcap or can be manufactured from obsolete termcap capabilities.
713fdd4e1e0SJan Lentfer * It was lifted from Ross Ridge's mytinfo package.
714fdd4e1e0SJan Lentfer */
715fdd4e1e0SJan Lentfer
716fdd4e1e0SJan Lentfer static const char C_CR[] = "\r";
717fdd4e1e0SJan Lentfer static const char C_LF[] = "\n";
718fdd4e1e0SJan Lentfer static const char C_BS[] = "\b";
719fdd4e1e0SJan Lentfer static const char C_HT[] = "\t";
720fdd4e1e0SJan Lentfer
721fdd4e1e0SJan Lentfer /*
722fdd4e1e0SJan Lentfer * This bit of legerdemain turns all the terminfo variable names into
723fdd4e1e0SJan Lentfer * references to locations in the arrays Booleans, Numbers, and Strings ---
724fdd4e1e0SJan Lentfer * precisely what's needed.
725fdd4e1e0SJan Lentfer */
726fdd4e1e0SJan Lentfer
727fdd4e1e0SJan Lentfer #undef CUR
728fdd4e1e0SJan Lentfer #define CUR tp->
729fdd4e1e0SJan Lentfer
730fdd4e1e0SJan Lentfer static void
postprocess_termcap(TERMTYPE2 * tp,bool has_base)731*32bb5217SDaniel Fojt postprocess_termcap(TERMTYPE2 *tp, bool has_base)
732fdd4e1e0SJan Lentfer {
733fdd4e1e0SJan Lentfer char buf[MAX_LINE * 2 + 2];
734fdd4e1e0SJan Lentfer string_desc result;
735fdd4e1e0SJan Lentfer
736fdd4e1e0SJan Lentfer /*
737fdd4e1e0SJan Lentfer * TERMCAP DEFAULTS AND OBSOLETE-CAPABILITY TRANSLATIONS
738fdd4e1e0SJan Lentfer *
739fdd4e1e0SJan Lentfer * This first part of the code is the functional inverse of the
740fdd4e1e0SJan Lentfer * fragment in capdefaults.c.
741fdd4e1e0SJan Lentfer * ----------------------------------------------------------------------
742fdd4e1e0SJan Lentfer */
743fdd4e1e0SJan Lentfer
744fdd4e1e0SJan Lentfer /* if there was a tc entry, assume we picked up defaults via that */
745fdd4e1e0SJan Lentfer if (!has_base) {
746*32bb5217SDaniel Fojt if (WANTED(init_3string) && PRESENT(termcap_init2))
747fdd4e1e0SJan Lentfer init_3string = _nc_save_str(termcap_init2);
748fdd4e1e0SJan Lentfer
749*32bb5217SDaniel Fojt if (WANTED(reset_2string) && PRESENT(termcap_reset))
750fdd4e1e0SJan Lentfer reset_2string = _nc_save_str(termcap_reset);
751fdd4e1e0SJan Lentfer
752fdd4e1e0SJan Lentfer if (WANTED(carriage_return)) {
753fdd4e1e0SJan Lentfer if (carriage_return_delay > 0) {
7543468e90cSJohn Marino _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
7553468e90cSJohn Marino "%s$<%d>", C_CR, carriage_return_delay);
756fdd4e1e0SJan Lentfer carriage_return = _nc_save_str(buf);
757fdd4e1e0SJan Lentfer } else
758fdd4e1e0SJan Lentfer carriage_return = _nc_save_str(C_CR);
759fdd4e1e0SJan Lentfer }
760fdd4e1e0SJan Lentfer if (WANTED(cursor_left)) {
761fdd4e1e0SJan Lentfer if (backspace_delay > 0) {
7623468e90cSJohn Marino _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
7633468e90cSJohn Marino "%s$<%d>", C_BS, backspace_delay);
764fdd4e1e0SJan Lentfer cursor_left = _nc_save_str(buf);
765fdd4e1e0SJan Lentfer } else if (backspaces_with_bs == 1)
766fdd4e1e0SJan Lentfer cursor_left = _nc_save_str(C_BS);
767fdd4e1e0SJan Lentfer else if (PRESENT(backspace_if_not_bs))
768fdd4e1e0SJan Lentfer cursor_left = backspace_if_not_bs;
769fdd4e1e0SJan Lentfer }
77000d8f3c4SJohn Marino /* vi doesn't use "do", but it does seem to use nl (or '\n') instead */
771fdd4e1e0SJan Lentfer if (WANTED(cursor_down)) {
772fdd4e1e0SJan Lentfer if (PRESENT(linefeed_if_not_lf))
773fdd4e1e0SJan Lentfer cursor_down = linefeed_if_not_lf;
774fdd4e1e0SJan Lentfer else if (linefeed_is_newline != 1) {
775fdd4e1e0SJan Lentfer if (new_line_delay > 0) {
7763468e90cSJohn Marino _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
7773468e90cSJohn Marino "%s$<%d>", C_LF, new_line_delay);
778fdd4e1e0SJan Lentfer cursor_down = _nc_save_str(buf);
779fdd4e1e0SJan Lentfer } else
780fdd4e1e0SJan Lentfer cursor_down = _nc_save_str(C_LF);
781fdd4e1e0SJan Lentfer }
782fdd4e1e0SJan Lentfer }
783fdd4e1e0SJan Lentfer if (WANTED(scroll_forward) && crt_no_scrolling != 1) {
784fdd4e1e0SJan Lentfer if (PRESENT(linefeed_if_not_lf))
785fdd4e1e0SJan Lentfer cursor_down = linefeed_if_not_lf;
786fdd4e1e0SJan Lentfer else if (linefeed_is_newline != 1) {
787fdd4e1e0SJan Lentfer if (new_line_delay > 0) {
7883468e90cSJohn Marino _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
7893468e90cSJohn Marino "%s$<%d>", C_LF, new_line_delay);
790fdd4e1e0SJan Lentfer scroll_forward = _nc_save_str(buf);
791fdd4e1e0SJan Lentfer } else
792fdd4e1e0SJan Lentfer scroll_forward = _nc_save_str(C_LF);
793fdd4e1e0SJan Lentfer }
794fdd4e1e0SJan Lentfer }
795fdd4e1e0SJan Lentfer if (WANTED(newline)) {
796fdd4e1e0SJan Lentfer if (linefeed_is_newline == 1) {
797fdd4e1e0SJan Lentfer if (new_line_delay > 0) {
7983468e90cSJohn Marino _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
7993468e90cSJohn Marino "%s$<%d>", C_LF, new_line_delay);
800fdd4e1e0SJan Lentfer newline = _nc_save_str(buf);
801fdd4e1e0SJan Lentfer } else
802fdd4e1e0SJan Lentfer newline = _nc_save_str(C_LF);
803fdd4e1e0SJan Lentfer } else if (PRESENT(carriage_return) && PRESENT(scroll_forward)) {
804fdd4e1e0SJan Lentfer _nc_str_init(&result, buf, sizeof(buf));
805fdd4e1e0SJan Lentfer if (_nc_safe_strcat(&result, carriage_return)
806fdd4e1e0SJan Lentfer && _nc_safe_strcat(&result, scroll_forward))
807fdd4e1e0SJan Lentfer newline = _nc_save_str(buf);
808fdd4e1e0SJan Lentfer } else if (PRESENT(carriage_return) && PRESENT(cursor_down)) {
809fdd4e1e0SJan Lentfer _nc_str_init(&result, buf, sizeof(buf));
810fdd4e1e0SJan Lentfer if (_nc_safe_strcat(&result, carriage_return)
811fdd4e1e0SJan Lentfer && _nc_safe_strcat(&result, cursor_down))
812fdd4e1e0SJan Lentfer newline = _nc_save_str(buf);
813fdd4e1e0SJan Lentfer }
814fdd4e1e0SJan Lentfer }
815fdd4e1e0SJan Lentfer }
816fdd4e1e0SJan Lentfer
817fdd4e1e0SJan Lentfer /*
818fdd4e1e0SJan Lentfer * Inverse of capdefaults.c code ends here.
819fdd4e1e0SJan Lentfer * ----------------------------------------------------------------------
820fdd4e1e0SJan Lentfer *
821fdd4e1e0SJan Lentfer * TERMCAP-TO TERMINFO MAPPINGS FOR SOURCE TRANSLATION
822fdd4e1e0SJan Lentfer *
823fdd4e1e0SJan Lentfer * These translations will *not* be inverted by tgetent().
824fdd4e1e0SJan Lentfer */
825fdd4e1e0SJan Lentfer
826fdd4e1e0SJan Lentfer if (!has_base) {
827fdd4e1e0SJan Lentfer /*
828fdd4e1e0SJan Lentfer * We wait until now to decide if we've got a working cr because even
829fdd4e1e0SJan Lentfer * one that doesn't work can be used for newline. Unfortunately the
830fdd4e1e0SJan Lentfer * space allocated for it is wasted.
831fdd4e1e0SJan Lentfer */
832fdd4e1e0SJan Lentfer if (return_does_clr_eol == 1 || no_correctly_working_cr == 1)
833fdd4e1e0SJan Lentfer carriage_return = ABSENT_STRING;
834fdd4e1e0SJan Lentfer
835fdd4e1e0SJan Lentfer /*
836fdd4e1e0SJan Lentfer * Supposedly most termcap entries have ta now and '\t' is no longer a
837fdd4e1e0SJan Lentfer * default, but it doesn't seem to be true...
838fdd4e1e0SJan Lentfer */
839fdd4e1e0SJan Lentfer if (WANTED(tab)) {
840fdd4e1e0SJan Lentfer if (horizontal_tab_delay > 0) {
8413468e90cSJohn Marino _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
8423468e90cSJohn Marino "%s$<%d>", C_HT, horizontal_tab_delay);
843fdd4e1e0SJan Lentfer tab = _nc_save_str(buf);
844fdd4e1e0SJan Lentfer } else
845fdd4e1e0SJan Lentfer tab = _nc_save_str(C_HT);
846fdd4e1e0SJan Lentfer }
847fdd4e1e0SJan Lentfer if (init_tabs == ABSENT_NUMERIC && has_hardware_tabs == TRUE)
848fdd4e1e0SJan Lentfer init_tabs = 8;
849fdd4e1e0SJan Lentfer
850fdd4e1e0SJan Lentfer /*
851fdd4e1e0SJan Lentfer * Assume we can beep with ^G unless we're given bl@.
852fdd4e1e0SJan Lentfer */
853fdd4e1e0SJan Lentfer if (WANTED(bell))
854fdd4e1e0SJan Lentfer bell = _nc_save_str("\007");
855fdd4e1e0SJan Lentfer }
856fdd4e1e0SJan Lentfer
857fdd4e1e0SJan Lentfer /*
858fdd4e1e0SJan Lentfer * Translate the old termcap :pt: capability to it#8 + ht=\t
859fdd4e1e0SJan Lentfer */
860fdd4e1e0SJan Lentfer if (has_hardware_tabs == TRUE) {
861fdd4e1e0SJan Lentfer if (init_tabs != 8 && init_tabs != ABSENT_NUMERIC)
862fdd4e1e0SJan Lentfer _nc_warning("hardware tabs with a width other than 8: %d", init_tabs);
863fdd4e1e0SJan Lentfer else {
864*32bb5217SDaniel Fojt if (PRESENT(tab) && _nc_capcmp(tab, C_HT))
865fdd4e1e0SJan Lentfer _nc_warning("hardware tabs with a non-^I tab string %s",
866fdd4e1e0SJan Lentfer _nc_visbuf(tab));
867fdd4e1e0SJan Lentfer else {
868fdd4e1e0SJan Lentfer if (WANTED(tab))
869fdd4e1e0SJan Lentfer tab = _nc_save_str(C_HT);
870fdd4e1e0SJan Lentfer init_tabs = 8;
871fdd4e1e0SJan Lentfer }
872fdd4e1e0SJan Lentfer }
873fdd4e1e0SJan Lentfer }
874fdd4e1e0SJan Lentfer /*
875fdd4e1e0SJan Lentfer * Now translate the ko capability, if there is one. This
876fdd4e1e0SJan Lentfer * isn't from mytinfo...
877fdd4e1e0SJan Lentfer */
878fdd4e1e0SJan Lentfer if (PRESENT(other_non_function_keys)) {
87900d8f3c4SJohn Marino char *base;
880fdd4e1e0SJan Lentfer char *bp, *cp, *dp;
881fdd4e1e0SJan Lentfer struct name_table_entry const *from_ptr;
882fdd4e1e0SJan Lentfer struct name_table_entry const *to_ptr;
883fdd4e1e0SJan Lentfer char buf2[MAX_TERMINFO_LENGTH];
884fdd4e1e0SJan Lentfer bool foundim;
885fdd4e1e0SJan Lentfer
886fdd4e1e0SJan Lentfer /* we're going to use this for a special case later */
887fdd4e1e0SJan Lentfer dp = strchr(other_non_function_keys, 'i');
888fdd4e1e0SJan Lentfer foundim = (dp != 0) && (dp[1] == 'm');
889fdd4e1e0SJan Lentfer
890fdd4e1e0SJan Lentfer /* look at each comma-separated capability in the ko string... */
891fdd4e1e0SJan Lentfer for (base = other_non_function_keys;
892fdd4e1e0SJan Lentfer (cp = strchr(base, ',')) != 0;
893fdd4e1e0SJan Lentfer base = cp + 1) {
89400d8f3c4SJohn Marino size_t len = (unsigned) (cp - base);
8953468e90cSJohn Marino size_t n;
8963468e90cSJohn Marino assoc const *ap = 0;
897fdd4e1e0SJan Lentfer
8983468e90cSJohn Marino for (n = 0; n < SIZEOF(ko_xlate); ++n) {
8993468e90cSJohn Marino if (len == strlen(ko_xlate[n].from)
9003468e90cSJohn Marino && strncmp(ko_xlate[n].from, base, len) == 0) {
9013468e90cSJohn Marino ap = ko_xlate + n;
902fdd4e1e0SJan Lentfer break;
9031d102085SJan Lentfer }
9043468e90cSJohn Marino }
9053468e90cSJohn Marino if (ap == 0) {
906fdd4e1e0SJan Lentfer _nc_warning("unknown capability `%.*s' in ko string",
907fdd4e1e0SJan Lentfer (int) len, base);
908fdd4e1e0SJan Lentfer continue;
9093468e90cSJohn Marino } else if (ap->to[0] == '\0') /* ignore it */
910fdd4e1e0SJan Lentfer continue;
911fdd4e1e0SJan Lentfer
912fdd4e1e0SJan Lentfer /* now we know we found a match in ko_table, so... */
913fdd4e1e0SJan Lentfer
9141d102085SJan Lentfer from_ptr = _nc_find_entry(ap->from, _nc_get_hash_table(TRUE));
9151d102085SJan Lentfer to_ptr = _nc_find_entry(ap->to, _nc_get_hash_table(FALSE));
916fdd4e1e0SJan Lentfer
917fdd4e1e0SJan Lentfer if (!from_ptr || !to_ptr) /* should never happen! */
918fdd4e1e0SJan Lentfer _nc_err_abort("ko translation table is invalid, I give up");
919fdd4e1e0SJan Lentfer
920fdd4e1e0SJan Lentfer if (WANTED(tp->Strings[from_ptr->nte_index])) {
921fdd4e1e0SJan Lentfer _nc_warning("no value for ko capability %s", ap->from);
922fdd4e1e0SJan Lentfer continue;
923fdd4e1e0SJan Lentfer }
924fdd4e1e0SJan Lentfer
925fdd4e1e0SJan Lentfer if (tp->Strings[to_ptr->nte_index]) {
926*32bb5217SDaniel Fojt const char *s = tp->Strings[from_ptr->nte_index];
927*32bb5217SDaniel Fojt const char *t = tp->Strings[to_ptr->nte_index];
928fdd4e1e0SJan Lentfer /* There's no point in warning about it if it's the same
929fdd4e1e0SJan Lentfer * string; that's just an inefficiency.
930fdd4e1e0SJan Lentfer */
931*32bb5217SDaniel Fojt if (VALID_STRING(s) && VALID_STRING(t) && strcmp(s, t) != 0)
932fdd4e1e0SJan Lentfer _nc_warning("%s (%s) already has an explicit value %s, ignoring ko",
933*32bb5217SDaniel Fojt ap->to, ap->from, t);
934fdd4e1e0SJan Lentfer continue;
935fdd4e1e0SJan Lentfer }
936fdd4e1e0SJan Lentfer
937fdd4e1e0SJan Lentfer /*
938fdd4e1e0SJan Lentfer * The magic moment -- copy the mapped key string over,
939fdd4e1e0SJan Lentfer * stripping out padding.
940fdd4e1e0SJan Lentfer */
941*32bb5217SDaniel Fojt bp = tp->Strings[from_ptr->nte_index];
942*32bb5217SDaniel Fojt if (VALID_STRING(bp)) {
943*32bb5217SDaniel Fojt for (dp = buf2; *bp; bp++) {
944fdd4e1e0SJan Lentfer if (bp[0] == '$' && bp[1] == '<') {
945fdd4e1e0SJan Lentfer while (*bp && *bp != '>') {
946fdd4e1e0SJan Lentfer ++bp;
947fdd4e1e0SJan Lentfer }
948fdd4e1e0SJan Lentfer } else
949fdd4e1e0SJan Lentfer *dp++ = *bp;
950fdd4e1e0SJan Lentfer }
95100d8f3c4SJohn Marino *dp = '\0';
952fdd4e1e0SJan Lentfer
953fdd4e1e0SJan Lentfer tp->Strings[to_ptr->nte_index] = _nc_save_str(buf2);
954*32bb5217SDaniel Fojt } else {
955*32bb5217SDaniel Fojt tp->Strings[to_ptr->nte_index] = bp;
956*32bb5217SDaniel Fojt }
957fdd4e1e0SJan Lentfer }
958fdd4e1e0SJan Lentfer
959fdd4e1e0SJan Lentfer /*
960fdd4e1e0SJan Lentfer * Note: ko=im and ko=ic both want to grab the `Insert'
961fdd4e1e0SJan Lentfer * keycap. There's a kich1 but no ksmir, so the ic capability
962fdd4e1e0SJan Lentfer * got mapped to kich1 and im to kIC to avoid a collision.
963fdd4e1e0SJan Lentfer * If the description has im but not ic, hack kIC back to kich1.
964fdd4e1e0SJan Lentfer */
965*32bb5217SDaniel Fojt if (foundim && WANTED(key_ic) && PRESENT(key_sic)) {
966fdd4e1e0SJan Lentfer key_ic = key_sic;
967fdd4e1e0SJan Lentfer key_sic = ABSENT_STRING;
968fdd4e1e0SJan Lentfer }
969fdd4e1e0SJan Lentfer }
970fdd4e1e0SJan Lentfer
971fdd4e1e0SJan Lentfer if (!has_base) {
972fdd4e1e0SJan Lentfer if (!hard_copy) {
973fdd4e1e0SJan Lentfer if (WANTED(key_backspace))
974fdd4e1e0SJan Lentfer key_backspace = _nc_save_str(C_BS);
975fdd4e1e0SJan Lentfer if (WANTED(key_left))
976fdd4e1e0SJan Lentfer key_left = _nc_save_str(C_BS);
977fdd4e1e0SJan Lentfer if (WANTED(key_down))
978fdd4e1e0SJan Lentfer key_down = _nc_save_str(C_LF);
979fdd4e1e0SJan Lentfer }
980fdd4e1e0SJan Lentfer }
981fdd4e1e0SJan Lentfer
982fdd4e1e0SJan Lentfer /*
983fdd4e1e0SJan Lentfer * Translate XENIX forms characters.
984fdd4e1e0SJan Lentfer */
985fdd4e1e0SJan Lentfer if (PRESENT(acs_ulcorner) ||
986fdd4e1e0SJan Lentfer PRESENT(acs_llcorner) ||
987fdd4e1e0SJan Lentfer PRESENT(acs_urcorner) ||
988fdd4e1e0SJan Lentfer PRESENT(acs_lrcorner) ||
989fdd4e1e0SJan Lentfer PRESENT(acs_ltee) ||
990fdd4e1e0SJan Lentfer PRESENT(acs_rtee) ||
991fdd4e1e0SJan Lentfer PRESENT(acs_btee) ||
992fdd4e1e0SJan Lentfer PRESENT(acs_ttee) ||
993fdd4e1e0SJan Lentfer PRESENT(acs_hline) ||
994fdd4e1e0SJan Lentfer PRESENT(acs_vline) ||
995fdd4e1e0SJan Lentfer PRESENT(acs_plus)) {
996fdd4e1e0SJan Lentfer char buf2[MAX_TERMCAP_LENGTH];
997fdd4e1e0SJan Lentfer
998fdd4e1e0SJan Lentfer _nc_str_init(&result, buf2, sizeof(buf2));
999fdd4e1e0SJan Lentfer _nc_safe_strcat(&result, acs_chars);
1000fdd4e1e0SJan Lentfer
1001fdd4e1e0SJan Lentfer append_acs(&result, 'j', acs_lrcorner);
1002fdd4e1e0SJan Lentfer append_acs(&result, 'k', acs_urcorner);
1003fdd4e1e0SJan Lentfer append_acs(&result, 'l', acs_ulcorner);
1004fdd4e1e0SJan Lentfer append_acs(&result, 'm', acs_llcorner);
1005fdd4e1e0SJan Lentfer append_acs(&result, 'n', acs_plus);
1006fdd4e1e0SJan Lentfer append_acs(&result, 'q', acs_hline);
1007fdd4e1e0SJan Lentfer append_acs(&result, 't', acs_ltee);
1008fdd4e1e0SJan Lentfer append_acs(&result, 'u', acs_rtee);
1009fdd4e1e0SJan Lentfer append_acs(&result, 'v', acs_btee);
1010fdd4e1e0SJan Lentfer append_acs(&result, 'w', acs_ttee);
1011fdd4e1e0SJan Lentfer append_acs(&result, 'x', acs_vline);
1012fdd4e1e0SJan Lentfer
1013fdd4e1e0SJan Lentfer if (buf2[0]) {
1014fdd4e1e0SJan Lentfer acs_chars = _nc_save_str(buf2);
1015fdd4e1e0SJan Lentfer _nc_warning("acsc string synthesized from XENIX capabilities");
1016fdd4e1e0SJan Lentfer }
1017*32bb5217SDaniel Fojt } else if (acs_chars == ABSENT_STRING
1018*32bb5217SDaniel Fojt && PRESENT(enter_alt_charset_mode)
1019*32bb5217SDaniel Fojt && PRESENT(exit_alt_charset_mode)) {
1020fdd4e1e0SJan Lentfer acs_chars = _nc_save_str(VT_ACSC);
1021fdd4e1e0SJan Lentfer }
1022fdd4e1e0SJan Lentfer }
1023fdd4e1e0SJan Lentfer
1024fdd4e1e0SJan Lentfer static void
postprocess_terminfo(TERMTYPE2 * tp)1025*32bb5217SDaniel Fojt postprocess_terminfo(TERMTYPE2 *tp)
1026fdd4e1e0SJan Lentfer {
1027fdd4e1e0SJan Lentfer /*
1028fdd4e1e0SJan Lentfer * TERMINFO-TO-TERMINFO MAPPINGS FOR SOURCE TRANSLATION
1029fdd4e1e0SJan Lentfer * ----------------------------------------------------------------------
1030fdd4e1e0SJan Lentfer */
1031fdd4e1e0SJan Lentfer
1032fdd4e1e0SJan Lentfer /*
1033fdd4e1e0SJan Lentfer * Translate AIX forms characters.
1034fdd4e1e0SJan Lentfer */
1035fdd4e1e0SJan Lentfer if (PRESENT(box_chars_1)) {
1036fdd4e1e0SJan Lentfer char buf2[MAX_TERMCAP_LENGTH];
1037fdd4e1e0SJan Lentfer string_desc result;
1038fdd4e1e0SJan Lentfer
1039fdd4e1e0SJan Lentfer _nc_str_init(&result, buf2, sizeof(buf2));
1040fdd4e1e0SJan Lentfer _nc_safe_strcat(&result, acs_chars);
1041fdd4e1e0SJan Lentfer
1042*32bb5217SDaniel Fojt append_acs0(&result, 'l', box_chars_1, 0); /* ACS_ULCORNER */
1043*32bb5217SDaniel Fojt append_acs0(&result, 'q', box_chars_1, 1); /* ACS_HLINE */
1044*32bb5217SDaniel Fojt append_acs0(&result, 'k', box_chars_1, 2); /* ACS_URCORNER */
1045*32bb5217SDaniel Fojt append_acs0(&result, 'x', box_chars_1, 3); /* ACS_VLINE */
1046*32bb5217SDaniel Fojt append_acs0(&result, 'j', box_chars_1, 4); /* ACS_LRCORNER */
1047*32bb5217SDaniel Fojt append_acs0(&result, 'm', box_chars_1, 5); /* ACS_LLCORNER */
1048*32bb5217SDaniel Fojt append_acs0(&result, 'w', box_chars_1, 6); /* ACS_TTEE */
1049*32bb5217SDaniel Fojt append_acs0(&result, 'u', box_chars_1, 7); /* ACS_RTEE */
1050*32bb5217SDaniel Fojt append_acs0(&result, 'v', box_chars_1, 8); /* ACS_BTEE */
1051*32bb5217SDaniel Fojt append_acs0(&result, 't', box_chars_1, 9); /* ACS_LTEE */
1052*32bb5217SDaniel Fojt append_acs0(&result, 'n', box_chars_1, 10); /* ACS_PLUS */
1053fdd4e1e0SJan Lentfer
1054fdd4e1e0SJan Lentfer if (buf2[0]) {
1055fdd4e1e0SJan Lentfer acs_chars = _nc_save_str(buf2);
1056fdd4e1e0SJan Lentfer _nc_warning("acsc string synthesized from AIX capabilities");
1057fdd4e1e0SJan Lentfer box_chars_1 = ABSENT_STRING;
1058fdd4e1e0SJan Lentfer }
1059fdd4e1e0SJan Lentfer }
1060fdd4e1e0SJan Lentfer /*
1061fdd4e1e0SJan Lentfer * ----------------------------------------------------------------------
1062fdd4e1e0SJan Lentfer */
1063fdd4e1e0SJan Lentfer }
1064fdd4e1e0SJan Lentfer
1065fdd4e1e0SJan Lentfer /*
1066fdd4e1e0SJan Lentfer * Do a linear search through the terminfo tables to find a given full-name.
1067fdd4e1e0SJan Lentfer * We don't expect to do this often, so there's no hashing function.
1068fdd4e1e0SJan Lentfer *
1069fdd4e1e0SJan Lentfer * In effect, this scans through the 3 lists of full-names, and looks them
1070fdd4e1e0SJan Lentfer * up in _nc_info_table, which is organized so that the nte_index fields are
1071fdd4e1e0SJan Lentfer * sorted, but the nte_type fields are not necessarily grouped together.
1072fdd4e1e0SJan Lentfer */
1073fdd4e1e0SJan Lentfer static struct name_table_entry const *
lookup_fullname(const char * find)1074fdd4e1e0SJan Lentfer lookup_fullname(const char *find)
1075fdd4e1e0SJan Lentfer {
1076fdd4e1e0SJan Lentfer int state = -1;
1077fdd4e1e0SJan Lentfer
1078fdd4e1e0SJan Lentfer for (;;) {
1079fdd4e1e0SJan Lentfer int count = 0;
1080fdd4e1e0SJan Lentfer NCURSES_CONST char *const *names;
1081fdd4e1e0SJan Lentfer
1082fdd4e1e0SJan Lentfer switch (++state) {
1083fdd4e1e0SJan Lentfer case BOOLEAN:
1084fdd4e1e0SJan Lentfer names = boolfnames;
1085fdd4e1e0SJan Lentfer break;
1086fdd4e1e0SJan Lentfer case STRING:
1087fdd4e1e0SJan Lentfer names = strfnames;
1088fdd4e1e0SJan Lentfer break;
1089fdd4e1e0SJan Lentfer case NUMBER:
1090fdd4e1e0SJan Lentfer names = numfnames;
1091fdd4e1e0SJan Lentfer break;
1092fdd4e1e0SJan Lentfer default:
1093fdd4e1e0SJan Lentfer return NOTFOUND;
1094fdd4e1e0SJan Lentfer }
1095fdd4e1e0SJan Lentfer
1096fdd4e1e0SJan Lentfer for (count = 0; names[count] != 0; count++) {
1097fdd4e1e0SJan Lentfer if (!strcmp(names[count], find)) {
1098fdd4e1e0SJan Lentfer struct name_table_entry const *entry_ptr = _nc_get_table(FALSE);
1099fdd4e1e0SJan Lentfer while (entry_ptr->nte_type != state
1100fdd4e1e0SJan Lentfer || entry_ptr->nte_index != count)
1101fdd4e1e0SJan Lentfer entry_ptr++;
1102fdd4e1e0SJan Lentfer return entry_ptr;
1103fdd4e1e0SJan Lentfer }
1104fdd4e1e0SJan Lentfer }
1105fdd4e1e0SJan Lentfer }
1106fdd4e1e0SJan Lentfer }
1107fdd4e1e0SJan Lentfer
1108fdd4e1e0SJan Lentfer /* parse_entry.c ends here */
1109