1 /****************************************************************************
2 * Copyright 2018-2020,2021 Thomas E. Dickey *
3 * Copyright 1998-2016,2017 Free Software Foundation, Inc. *
5 * Permission is hereby granted, free of charge, to any person obtaining a *
6 * copy of this software and associated documentation files (the *
7 * "Software"), to deal in the Software without restriction, including *
8 * without limitation the rights to use, copy, modify, merge, publish, *
9 * distribute, distribute with modifications, sublicense, and/or sell *
10 * copies of the Software, and to permit persons to whom the Software is *
11 * furnished to do so, subject to the following conditions: *
13 * The above copyright notice and this permission notice shall be included *
14 * in all copies or substantial portions of the Software. *
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
17 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
18 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
19 * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
20 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
21 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
22 * THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
24 * Except as contained in this notice, the name(s) of the above copyright *
25 * holders shall not be used in advertising or otherwise to promote the *
26 * sale, use or other dealings in this Software without prior written *
28 ****************************************************************************/
30 /****************************************************************************
31 * Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 *
32 * and: Eric S. Raymond <esr@snark.thyrsus.com> *
33 * and: Thomas E. Dickey 1996-on *
34 ****************************************************************************/
37 * parse_entry.c -- compile one terminfo or termcap entry
39 * Get an exact in-core representation of an entry. Don't
40 * try to resolve use or tc capabilities, that is someone
41 * else's job. Depends on the lexical analyzer to get tokens
42 * from the input stream.
45 #define __INTERNAL_CAPS_VISIBLE
46 #include <curses.priv.h>
51 MODULE_ID("$Id: parse_entry.c,v 1.102 2021/09/04 10:54:35 tom Exp $")
54 static short const parametrized[] =
57 #include <parametrized.h>
60 static void postprocess_termcap(TERMTYPE2 *, bool);
61 static void postprocess_terminfo(TERMTYPE2 *);
62 static struct name_table_entry const *lookup_fullname(const char *name);
66 static struct name_table_entry const *
67 _nc_extend_names(ENTRY * entryp, const char *name, int token_type)
69 static struct name_table_entry temp;
70 TERMTYPE2 *tp = &(entryp->tterm);
74 unsigned first, last, n;
80 last = tp->ext_Booleans;
81 offset = tp->ext_Booleans;
82 tindex = tp->num_Booleans;
85 first = tp->ext_Booleans;
86 last = tp->ext_Numbers + first;
87 offset = (unsigned) (tp->ext_Booleans + tp->ext_Numbers);
88 tindex = tp->num_Numbers;
91 first = (unsigned) (tp->ext_Booleans + tp->ext_Numbers);
92 last = tp->ext_Strings + first;
93 offset = (unsigned) (tp->ext_Booleans + tp->ext_Numbers + tp->ext_Strings);
94 tindex = tp->num_Strings;
97 actual = NUM_EXT_NAMES(tp);
98 for (n = 0; n < actual; n++) {
99 if (!strcmp(name, tp->ext_Names[n])) {
100 if (n > (unsigned) (tp->ext_Booleans + tp->ext_Numbers)) {
102 } else if (n > tp->ext_Booleans) {
105 token_type = BOOLEAN;
107 return _nc_extend_names(entryp, name, token_type);
110 /* Well, we are given a cancel for a name that we don't recognize */
111 return _nc_extend_names(entryp, name, STRING);
116 /* Adjust the 'offset' (insertion-point) to keep the lists of extended
119 for (n = first, found = FALSE; n < last; n++) {
120 int cmp = strcmp(tp->ext_Names[n], name);
126 switch (token_type) {
141 #define for_each_value(max) \
142 for (last = (unsigned) (max - 1); last > tindex; last--)
145 switch (token_type) {
149 TYPE_REALLOC(NCURSES_SBOOL, tp->num_Booleans, tp->Booleans);
150 for_each_value(tp->num_Booleans)
151 tp->Booleans[last] = tp->Booleans[last - 1];
156 TYPE_REALLOC(NCURSES_INT2, tp->num_Numbers, tp->Numbers);
157 for_each_value(tp->num_Numbers)
158 tp->Numbers[last] = tp->Numbers[last - 1];
163 TYPE_REALLOC(char *, tp->num_Strings, tp->Strings);
164 for_each_value(tp->num_Strings)
165 tp->Strings[last] = tp->Strings[last - 1];
168 actual = NUM_EXT_NAMES(tp);
169 TYPE_REALLOC(char *, actual, tp->ext_Names);
170 while (--actual > offset)
171 tp->ext_Names[actual] = tp->ext_Names[actual - 1];
172 tp->ext_Names[offset] = _nc_save_str(name);
175 temp.nte_name = tp->ext_Names[offset];
176 temp.nte_type = token_type;
177 temp.nte_index = (short) tindex;
186 const char *result = "unknown";
187 if (mask & (1 << BOOLEAN)) {
189 } else if (mask & (1 << NUMBER)) {
191 } else if (mask & (1 << STRING)) {
198 expected_type(const char *name, int token_type, bool silent)
200 struct user_table_entry const *entry = _nc_find_user_entry(name);
202 if ((entry != 0) && (token_type != CANCEL)) {
203 int have_type = (1 << token_type);
204 if (!(entry->ute_type & have_type)) {
206 _nc_warning("expected %s-type for %s, have %s",
207 usertype2s(entry->ute_type),
209 usertype2s(have_type));
215 #endif /* NCURSES_XNAMES */
218 valid_entryname(const char *name)
222 while ((ch = UChar(*name++)) != '\0') {
223 if (ch <= ' ' || ch > '~' || ch == '/') {
233 * _nc_parse_entry(entry, literal, silent)
235 * Compile one entry. Doesn't try to resolve use or tc capabilities.
237 * found-forward-use = FALSE
238 * re-initialise internal arrays
240 * if the token was not a name in column 1, complain and die
241 * save names in entry's string table
242 * while (get_token() is not EOF and not NAMES)
243 * check for existence and type-correctness
244 * enter cap into structure
246 * save string in entry's string table
250 #define BAD_TC_USAGE if (!bad_tc_usage) \
251 { bad_tc_usage = TRUE; \
252 _nc_warning("Legacy termcap allows only a trailing tc= clause"); }
254 #define MAX_NUMBER MAX_OF_TYPE(NCURSES_INT2)
257 _nc_parse_entry(ENTRY * entryp, int literal, bool silent)
260 struct name_table_entry const *entry_ptr;
263 bool bad_tc_usage = FALSE;
265 token_type = _nc_get_token(silent);
267 if (token_type == EOF)
269 if (token_type != NAMES)
270 _nc_err_abort("Entry does not start with terminal names in column one");
272 _nc_init_entry(entryp);
274 entryp->cstart = _nc_comment_start;
275 entryp->cend = _nc_comment_end;
276 entryp->startline = _nc_start_line;
277 DEBUG(2, ("Comment range is %ld to %ld", entryp->cstart, entryp->cend));
280 * Strip off the 2-character termcap name, if present. Originally termcap
281 * used that as an indexing aid. We can retain 2-character terminfo names,
282 * but note that they would be lost if we translate to/from termcap. This
283 * feature is supposedly obsolete since "newer" BSD implementations do not
284 * use it; however our reference for this feature is SunOS 4.x, which
285 * implemented it. Note that the resulting terminal type was never the
286 * 2-character name, but was instead the first alias after that.
288 #define ok_TC2(s) (isgraph(UChar(s)) && (s) != '|')
289 ptr = _nc_curr_token.tk_name;
290 if (_nc_syntax == SYN_TERMCAP
292 && !_nc_user_definable
295 if (ok_TC2(ptr[0]) && ok_TC2(ptr[1]) && (ptr[2] == '|')) {
297 _nc_curr_token.tk_name[2] = '\0';
301 entryp->tterm.str_table = entryp->tterm.term_names = _nc_save_str(ptr);
303 if (entryp->tterm.str_table == 0)
306 DEBUG(1, ("Starting '%s'", ptr));
309 * We do this because the one-token lookahead in the parse loop
310 * results in the terminal type getting prematurely set to correspond
311 * to that of the next entry.
313 name = _nc_first_name(entryp->tterm.term_names);
314 if (!valid_entryname(name)) {
315 _nc_warning("invalid entry name \"%s\"", name);
320 /* check for overly-long names and aliases */
321 for (base = entryp->tterm.term_names; (ptr = strchr(base, '|')) != 0;
323 if (ptr - base > MAX_ALIAS) {
324 _nc_warning("%s `%.*s' may be too long",
325 (base == entryp->tterm.term_names)
328 (int) (ptr - base), base);
334 for (token_type = _nc_get_token(silent);
335 token_type != EOF && token_type != NAMES;
336 token_type = _nc_get_token(silent)) {
337 bool is_use = (strcmp(_nc_curr_token.tk_name, "use") == 0);
338 bool is_tc = !is_use && (strcmp(_nc_curr_token.tk_name, "tc") == 0);
339 if (is_use || is_tc) {
340 if (!VALID_STRING(_nc_curr_token.tk_valstring)
341 || _nc_curr_token.tk_valstring[0] == '\0') {
342 _nc_warning("missing name for use-clause");
344 } else if (!valid_entryname(_nc_curr_token.tk_valstring)) {
345 _nc_warning("invalid name for use-clause \"%s\"",
346 _nc_curr_token.tk_valstring);
348 } else if (entryp->nuses >= MAX_USES) {
349 _nc_warning("too many use-clauses, ignored \"%s\"",
350 _nc_curr_token.tk_valstring);
353 entryp->uses[entryp->nuses].name = _nc_save_str(_nc_curr_token.tk_valstring);
354 entryp->uses[entryp->nuses].line = _nc_curr_line;
356 if (entryp->nuses > 1 && is_tc) {
360 /* normal token lookup */
361 entry_ptr = _nc_find_entry(_nc_curr_token.tk_name,
362 _nc_get_hash_table(_nc_syntax));
365 * Our kluge to handle aliasing. The reason it is done
366 * this ugly way, with a linear search, is so the hashing
367 * machinery doesn't have to be made really complicated
368 * (also we get better warnings this way). No point in
369 * making this case fast, aliased caps aren't common now
370 * and will get rarer.
372 if (entry_ptr == NOTFOUND) {
373 const struct alias *ap;
375 if (_nc_syntax == SYN_TERMCAP) {
376 if (entryp->nuses != 0) {
379 for (ap = _nc_get_alias_table(TRUE); ap->from; ap++)
380 if (strcmp(ap->from, _nc_curr_token.tk_name) == 0) {
381 if (ap->to == (char *) 0) {
382 _nc_warning("%s (%s termcap extension) ignored",
383 ap->from, ap->source);
387 entry_ptr = _nc_find_entry(ap->to,
388 _nc_get_hash_table(TRUE));
389 if (entry_ptr && !silent)
390 _nc_warning("%s (%s termcap extension) aliased to %s",
391 ap->from, ap->source, ap->to);
394 } else { /* if (_nc_syntax == SYN_TERMINFO) */
395 for (ap = _nc_get_alias_table(FALSE); ap->from; ap++)
396 if (strcmp(ap->from, _nc_curr_token.tk_name) == 0) {
397 if (ap->to == (char *) 0) {
398 _nc_warning("%s (%s terminfo extension) ignored",
399 ap->from, ap->source);
403 entry_ptr = _nc_find_entry(ap->to,
404 _nc_get_hash_table(FALSE));
405 if (entry_ptr && !silent)
406 _nc_warning("%s (%s terminfo extension) aliased to %s",
407 ap->from, ap->source, ap->to);
411 if (entry_ptr == NOTFOUND) {
412 entry_ptr = lookup_fullname(_nc_curr_token.tk_name);
418 * If we have extended-names active, we will automatically
419 * define a name based on its context.
421 if (entry_ptr == NOTFOUND
422 && _nc_user_definable) {
423 if (expected_type(_nc_curr_token.tk_name, token_type, silent)) {
424 if ((entry_ptr = _nc_extend_names(entryp,
425 _nc_curr_token.tk_name,
427 if (_nc_tracing >= DEBUG_LEVEL(1)) {
428 _nc_warning("extended capability '%s'",
429 _nc_curr_token.tk_name);
433 /* ignore it: we have already printed error message */
437 #endif /* NCURSES_XNAMES */
439 /* can't find this cap name, not even as an alias */
440 if (entry_ptr == NOTFOUND) {
442 _nc_warning("unknown capability '%s'",
443 _nc_curr_token.tk_name);
447 /* deal with bad type/value combinations. */
448 if (token_type == CANCEL) {
450 * Prefer terminfo in this (long-obsolete) ambiguity:
452 if (!strcmp("ma", _nc_curr_token.tk_name)) {
453 entry_ptr = _nc_find_type_entry("ma", NUMBER,
455 assert(entry_ptr != 0);
457 } else if (entry_ptr->nte_type != token_type) {
459 * Nasty special cases here handle situations in which type
460 * information can resolve name clashes. Normal lookup
461 * finds the last instance in the capability table of a
462 * given name, regardless of type. find_type_entry looks
463 * for a first matching instance with given type. So as
464 * long as all ambiguous names occur in pairs of distinct
465 * type, this will do the job.
468 if (token_type == NUMBER
469 && !strcmp("ma", _nc_curr_token.tk_name)) {
470 /* tell max_attributes from arrow_key_map */
471 entry_ptr = _nc_find_type_entry("ma", NUMBER,
473 assert(entry_ptr != 0);
475 } else if (token_type == STRING
476 && !strcmp("MT", _nc_curr_token.tk_name)) {
477 /* map terminfo's string MT to MT */
478 entry_ptr = _nc_find_type_entry("MT", STRING,
480 assert(entry_ptr != 0);
482 } else if (token_type == BOOLEAN
483 && entry_ptr->nte_type == STRING) {
484 /* treat strings without following "=" as empty strings */
487 /* we couldn't recover; skip this token */
489 const char *type_name;
490 switch (entry_ptr->nte_type) {
492 type_name = "boolean";
495 type_name = "string";
498 type_name = "numeric";
501 type_name = "unknown";
504 _nc_warning("wrong type used for %s capability '%s'",
505 type_name, _nc_curr_token.tk_name);
511 /* now we know that the type/value combination is OK */
512 switch (token_type) {
514 switch (entry_ptr->nte_type) {
516 entryp->tterm.Booleans[entry_ptr->nte_index] = CANCELLED_BOOLEAN;
520 entryp->tterm.Numbers[entry_ptr->nte_index] = CANCELLED_NUMERIC;
524 entryp->tterm.Strings[entry_ptr->nte_index] = CANCELLED_STRING;
530 entryp->tterm.Booleans[entry_ptr->nte_index] = TRUE;
534 #if !NCURSES_EXT_NUMBERS
535 if (_nc_curr_token.tk_valnumber > MAX_NUMBER) {
536 entryp->tterm.Numbers[entry_ptr->nte_index] = MAX_NUMBER;
540 entryp->tterm.Numbers[entry_ptr->nte_index] =
541 (NCURSES_INT2) _nc_curr_token.tk_valnumber;
546 ptr = _nc_curr_token.tk_valstring;
547 if (_nc_syntax == SYN_TERMCAP) {
548 int n = entry_ptr->nte_index;
549 ptr = _nc_captoinfo(_nc_curr_token.tk_name,
551 (n < (int) SIZEOF(parametrized))
555 entryp->tterm.Strings[entry_ptr->nte_index] = _nc_save_str(ptr);
560 _nc_warning("unknown token type");
561 _nc_panic_mode((char) ((_nc_syntax == SYN_TERMCAP) ? ':' : ','));
564 } /* end else cur_token.name != "use" */
566 continue; /* cannot have a label w/o statement */
567 } /* endwhile (not EOF and not NAMES) */
569 _nc_push_token(token_type);
570 _nc_set_type(_nc_first_name(entryp->tterm.term_names));
573 * Try to deduce as much as possible from extension capabilities
574 * (this includes obsolete BSD capabilities). Sigh...it would be more
575 * space-efficient to call this after use resolution, but it has
576 * to be done before entry allocation is wrapped up.
579 if (_nc_syntax == SYN_TERMCAP) {
580 bool has_base_entry = FALSE;
583 * Don't insert defaults if this is a `+' entry meant only
584 * for inclusion in other entries (not sure termcap ever
585 * had these, actually).
587 if (strchr(entryp->tterm.term_names, '+')) {
588 has_base_entry = TRUE;
592 * Otherwise, look for a base entry that will already
593 * have picked up defaults via translation.
595 for (i = 0; i < entryp->nuses; i++) {
596 if (entryp->uses[i].name != 0
597 && !strchr(entryp->uses[i].name, '+'))
598 has_base_entry = TRUE;
602 postprocess_termcap(&entryp->tterm, has_base_entry);
604 postprocess_terminfo(&entryp->tterm);
606 _nc_wrap_entry(entryp, FALSE);
612 _nc_capcmp(const char *s, const char *t)
613 /* compare two string capabilities, stripping out padding */
615 bool ok_s = VALID_STRING(s);
616 bool ok_t = VALID_STRING(t);
620 if (s[0] == '$' && s[1] == '<') {
622 if (!(isdigit(UChar(*s))
632 if (t[0] == '$' && t[1] == '<') {
634 if (!(isdigit(UChar(*t))
644 /* we've now pushed s and t past any padding they pointed at */
646 if (*s == '\0' && *t == '\0')
652 /* else *s == *t but one is not NUL, so continue */
655 } else if (ok_s || ok_t) {
662 append_acs0(string_desc * dst, int code, char *src, size_t off)
664 if (src != 0 && off < strlen(src)) {
666 temp[0] = (char) code;
669 _nc_safe_strcat(dst, temp);
674 append_acs(string_desc * dst, int code, char *src)
676 if (VALID_STRING(src) && strlen(src) == 1) {
677 append_acs0(dst, code, src, 0);
682 * The ko capability, if present, consists of a comma-separated capability
683 * list. For each capability, we may assume there is a keycap that sends the
684 * string which is the value of that capability.
686 #define DATA(from, to) { { from }, { to } }
691 static assoc const ko_xlate[] =
693 DATA("al", "kil1"), /* insert line key -> KEY_IL */
694 DATA("bt", "kcbt"), /* back tab -> KEY_BTAB */
695 DATA("cd", "ked"), /* clear-to-eos key -> KEY_EOL */
696 DATA("ce", "kel"), /* clear-to-eol key -> KEY_EOS */
697 DATA("cl", "kclr"), /* clear key -> KEY_CLEAR */
698 DATA("ct", "tbc"), /* clear all tabs -> KEY_CATAB */
699 DATA("dc", "kdch1"), /* delete char -> KEY_DC */
700 DATA("dl", "kdl1"), /* delete line -> KEY_DL */
701 DATA("do", "kcud1"), /* down key -> KEY_DOWN */
702 DATA("ei", "krmir"), /* exit insert key -> KEY_EIC */
703 DATA("ho", "khome"), /* home key -> KEY_HOME */
704 DATA("ic", "kich1"), /* insert char key -> KEY_IC */
705 DATA("im", "kIC"), /* insert-mode key -> KEY_SIC */
706 DATA("le", "kcub1"), /* le key -> KEY_LEFT */
707 DATA("nd", "kcuf1"), /* nd key -> KEY_RIGHT */
708 DATA("nl", "kent"), /* new line key -> KEY_ENTER */
709 DATA("st", "khts"), /* set-tab key -> KEY_STAB */
711 DATA("up", "kcuu1"), /* up-arrow key -> KEY_UP */
715 * This routine fills in string caps that either had defaults under
716 * termcap or can be manufactured from obsolete termcap capabilities.
717 * It was lifted from Ross Ridge's mytinfo package.
720 static const char C_CR[] = "\r";
721 static const char C_LF[] = "\n";
722 static const char C_BS[] = "\b";
723 static const char C_HT[] = "\t";
726 * This bit of legerdemain turns all the terminfo variable names into
727 * references to locations in the arrays Booleans, Numbers, and Strings ---
728 * precisely what's needed.
735 postprocess_termcap(TERMTYPE2 *tp, bool has_base)
737 char buf[MAX_LINE * 2 + 2];
741 * TERMCAP DEFAULTS AND OBSOLETE-CAPABILITY TRANSLATIONS
743 * This first part of the code is the functional inverse of the
744 * fragment in capdefaults.c.
745 * ----------------------------------------------------------------------
748 /* if there was a tc entry, assume we picked up defaults via that */
750 if (WANTED(init_3string) && PRESENT(termcap_init2))
751 init_3string = _nc_save_str(termcap_init2);
753 if (WANTED(reset_2string) && PRESENT(termcap_reset))
754 reset_2string = _nc_save_str(termcap_reset);
756 if (WANTED(carriage_return)) {
757 if (carriage_return_delay > 0) {
758 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
759 "%s$<%d>", C_CR, carriage_return_delay);
760 carriage_return = _nc_save_str(buf);
762 carriage_return = _nc_save_str(C_CR);
764 if (WANTED(cursor_left)) {
765 if (backspace_delay > 0) {
766 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
767 "%s$<%d>", C_BS, backspace_delay);
768 cursor_left = _nc_save_str(buf);
769 } else if (backspaces_with_bs == 1)
770 cursor_left = _nc_save_str(C_BS);
771 else if (PRESENT(backspace_if_not_bs))
772 cursor_left = backspace_if_not_bs;
774 /* vi doesn't use "do", but it does seem to use nl (or '\n') instead */
775 if (WANTED(cursor_down)) {
776 if (PRESENT(linefeed_if_not_lf))
777 cursor_down = linefeed_if_not_lf;
778 else if (linefeed_is_newline != 1) {
779 if (new_line_delay > 0) {
780 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
781 "%s$<%d>", C_LF, new_line_delay);
782 cursor_down = _nc_save_str(buf);
784 cursor_down = _nc_save_str(C_LF);
787 if (WANTED(scroll_forward) && crt_no_scrolling != 1) {
788 if (PRESENT(linefeed_if_not_lf))
789 cursor_down = linefeed_if_not_lf;
790 else if (linefeed_is_newline != 1) {
791 if (new_line_delay > 0) {
792 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
793 "%s$<%d>", C_LF, new_line_delay);
794 scroll_forward = _nc_save_str(buf);
796 scroll_forward = _nc_save_str(C_LF);
799 if (WANTED(newline)) {
800 if (linefeed_is_newline == 1) {
801 if (new_line_delay > 0) {
802 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
803 "%s$<%d>", C_LF, new_line_delay);
804 newline = _nc_save_str(buf);
806 newline = _nc_save_str(C_LF);
807 } else if (PRESENT(carriage_return) && PRESENT(scroll_forward)) {
808 _nc_str_init(&result, buf, sizeof(buf));
809 if (_nc_safe_strcat(&result, carriage_return)
810 && _nc_safe_strcat(&result, scroll_forward))
811 newline = _nc_save_str(buf);
812 } else if (PRESENT(carriage_return) && PRESENT(cursor_down)) {
813 _nc_str_init(&result, buf, sizeof(buf));
814 if (_nc_safe_strcat(&result, carriage_return)
815 && _nc_safe_strcat(&result, cursor_down))
816 newline = _nc_save_str(buf);
822 * Inverse of capdefaults.c code ends here.
823 * ----------------------------------------------------------------------
825 * TERMCAP-TO TERMINFO MAPPINGS FOR SOURCE TRANSLATION
827 * These translations will *not* be inverted by tgetent().
832 * We wait until now to decide if we've got a working cr because even
833 * one that doesn't work can be used for newline. Unfortunately the
834 * space allocated for it is wasted.
836 if (return_does_clr_eol == 1 || no_correctly_working_cr == 1)
837 carriage_return = ABSENT_STRING;
840 * Supposedly most termcap entries have ta now and '\t' is no longer a
841 * default, but it doesn't seem to be true...
844 if (horizontal_tab_delay > 0) {
845 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
846 "%s$<%d>", C_HT, horizontal_tab_delay);
847 tab = _nc_save_str(buf);
849 tab = _nc_save_str(C_HT);
851 if (init_tabs == ABSENT_NUMERIC && has_hardware_tabs == TRUE)
855 * Assume we can beep with ^G unless we're given bl@.
858 bell = _nc_save_str("\007");
862 * Translate the old termcap :pt: capability to it#8 + ht=\t
864 if (has_hardware_tabs == TRUE) {
865 if (init_tabs != 8 && init_tabs != ABSENT_NUMERIC)
866 _nc_warning("hardware tabs with a width other than 8: %d", init_tabs);
868 if (PRESENT(tab) && _nc_capcmp(tab, C_HT))
869 _nc_warning("hardware tabs with a non-^I tab string %s",
873 tab = _nc_save_str(C_HT);
879 * Now translate the ko capability, if there is one. This
880 * isn't from mytinfo...
882 if (PRESENT(other_non_function_keys)) {
885 struct name_table_entry const *from_ptr;
886 struct name_table_entry const *to_ptr;
887 char buf2[MAX_TERMINFO_LENGTH];
890 /* we're going to use this for a special case later */
891 dp = strchr(other_non_function_keys, 'i');
892 foundim = (dp != 0) && (dp[1] == 'm');
894 /* look at each comma-separated capability in the ko string... */
895 for (base = other_non_function_keys;
896 (cp = strchr(base, ',')) != 0;
898 size_t len = (unsigned) (cp - base);
902 for (n = 0; n < SIZEOF(ko_xlate); ++n) {
903 if (len == strlen(ko_xlate[n].from)
904 && strncmp(ko_xlate[n].from, base, len) == 0) {
910 _nc_warning("unknown capability `%.*s' in ko string",
913 } else if (ap->to[0] == '\0') /* ignore it */
916 /* now we know we found a match in ko_table, so... */
918 from_ptr = _nc_find_entry(ap->from, _nc_get_hash_table(TRUE));
919 to_ptr = _nc_find_entry(ap->to, _nc_get_hash_table(FALSE));
921 if (!from_ptr || !to_ptr) /* should never happen! */
922 _nc_err_abort("ko translation table is invalid, I give up");
924 if (WANTED(tp->Strings[from_ptr->nte_index])) {
925 _nc_warning("no value for ko capability %s", ap->from);
929 if (tp->Strings[to_ptr->nte_index]) {
930 const char *s = tp->Strings[from_ptr->nte_index];
931 const char *t = tp->Strings[to_ptr->nte_index];
932 /* There's no point in warning about it if it is the same
933 * string; that's just an inefficiency.
935 if (VALID_STRING(s) && VALID_STRING(t) && strcmp(s, t) != 0)
936 _nc_warning("%s (%s) already has an explicit value %s, ignoring ko",
937 ap->to, ap->from, t);
942 * The magic moment -- copy the mapped key string over,
943 * stripping out padding.
945 bp = tp->Strings[from_ptr->nte_index];
946 if (VALID_STRING(bp)) {
947 for (dp = buf2; *bp; bp++) {
948 if (bp[0] == '$' && bp[1] == '<') {
949 while (*bp && *bp != '>') {
957 tp->Strings[to_ptr->nte_index] = _nc_save_str(buf2);
959 tp->Strings[to_ptr->nte_index] = bp;
964 * Note: ko=im and ko=ic both want to grab the `Insert'
965 * keycap. There's a kich1 but no ksmir, so the ic capability
966 * got mapped to kich1 and im to kIC to avoid a collision.
967 * If the description has im but not ic, hack kIC back to kich1.
969 if (foundim && WANTED(key_ic) && PRESENT(key_sic)) {
971 key_sic = ABSENT_STRING;
977 if (WANTED(key_backspace))
978 key_backspace = _nc_save_str(C_BS);
979 if (WANTED(key_left))
980 key_left = _nc_save_str(C_BS);
981 if (WANTED(key_down))
982 key_down = _nc_save_str(C_LF);
987 * Translate XENIX forms characters.
989 if (PRESENT(acs_ulcorner) ||
990 PRESENT(acs_llcorner) ||
991 PRESENT(acs_urcorner) ||
992 PRESENT(acs_lrcorner) ||
997 PRESENT(acs_hline) ||
998 PRESENT(acs_vline) ||
1000 char buf2[MAX_TERMCAP_LENGTH];
1002 _nc_str_init(&result, buf2, sizeof(buf2));
1003 _nc_safe_strcat(&result, acs_chars);
1005 append_acs(&result, 'j', acs_lrcorner);
1006 append_acs(&result, 'k', acs_urcorner);
1007 append_acs(&result, 'l', acs_ulcorner);
1008 append_acs(&result, 'm', acs_llcorner);
1009 append_acs(&result, 'n', acs_plus);
1010 append_acs(&result, 'q', acs_hline);
1011 append_acs(&result, 't', acs_ltee);
1012 append_acs(&result, 'u', acs_rtee);
1013 append_acs(&result, 'v', acs_btee);
1014 append_acs(&result, 'w', acs_ttee);
1015 append_acs(&result, 'x', acs_vline);
1018 acs_chars = _nc_save_str(buf2);
1019 _nc_warning("acsc string synthesized from XENIX capabilities");
1021 } else if (acs_chars == ABSENT_STRING
1022 && PRESENT(enter_alt_charset_mode)
1023 && PRESENT(exit_alt_charset_mode)) {
1024 acs_chars = _nc_save_str(VT_ACSC);
1029 postprocess_terminfo(TERMTYPE2 *tp)
1032 * TERMINFO-TO-TERMINFO MAPPINGS FOR SOURCE TRANSLATION
1033 * ----------------------------------------------------------------------
1037 * Translate AIX forms characters.
1039 if (PRESENT(box_chars_1)) {
1040 char buf2[MAX_TERMCAP_LENGTH];
1043 _nc_str_init(&result, buf2, sizeof(buf2));
1044 _nc_safe_strcat(&result, acs_chars);
1046 append_acs0(&result, 'l', box_chars_1, 0); /* ACS_ULCORNER */
1047 append_acs0(&result, 'q', box_chars_1, 1); /* ACS_HLINE */
1048 append_acs0(&result, 'k', box_chars_1, 2); /* ACS_URCORNER */
1049 append_acs0(&result, 'x', box_chars_1, 3); /* ACS_VLINE */
1050 append_acs0(&result, 'j', box_chars_1, 4); /* ACS_LRCORNER */
1051 append_acs0(&result, 'm', box_chars_1, 5); /* ACS_LLCORNER */
1052 append_acs0(&result, 'w', box_chars_1, 6); /* ACS_TTEE */
1053 append_acs0(&result, 'u', box_chars_1, 7); /* ACS_RTEE */
1054 append_acs0(&result, 'v', box_chars_1, 8); /* ACS_BTEE */
1055 append_acs0(&result, 't', box_chars_1, 9); /* ACS_LTEE */
1056 append_acs0(&result, 'n', box_chars_1, 10); /* ACS_PLUS */
1059 acs_chars = _nc_save_str(buf2);
1060 _nc_warning("acsc string synthesized from AIX capabilities");
1061 box_chars_1 = ABSENT_STRING;
1065 * ----------------------------------------------------------------------
1070 * Do a linear search through the terminfo tables to find a given full-name.
1071 * We don't expect to do this often, so there's no hashing function.
1073 * In effect, this scans through the 3 lists of full-names, and looks them
1074 * up in _nc_info_table, which is organized so that the nte_index fields are
1075 * sorted, but the nte_type fields are not necessarily grouped together.
1077 static struct name_table_entry const *
1078 lookup_fullname(const char *find)
1084 NCURSES_CONST char *const *names;
1100 for (count = 0; names[count] != 0; count++) {
1101 if (!strcmp(names[count], find)) {
1102 struct name_table_entry const *entry_ptr = _nc_get_table(FALSE);
1103 while (entry_ptr->nte_type != state
1104 || entry_ptr->nte_index != count)
1112 /* parse_entry.c ends here */