1 /****************************************************************************
2 * Copyright (c) 1998-2012,2016 Free Software Foundation, Inc. *
4 * Permission is hereby granted, free of charge, to any person obtaining a *
5 * copy of this software and associated documentation files (the *
6 * "Software"), to deal in the Software without restriction, including *
7 * without limitation the rights to use, copy, modify, merge, publish, *
8 * distribute, distribute with modifications, sublicense, and/or sell *
9 * copies of the Software, and to permit persons to whom the Software is *
10 * furnished to do so, subject to the following conditions: *
12 * The above copyright notice and this permission notice shall be included *
13 * in all copies or substantial portions of the Software. *
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
16 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
17 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
18 * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
19 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
20 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
21 * THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
23 * Except as contained in this notice, the name(s) of the above copyright *
24 * holders shall not be used in advertising or otherwise to promote the *
25 * sale, use or other dealings in this Software without prior written *
27 ****************************************************************************/
29 /****************************************************************************
30 * Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 *
31 * and: Eric S. Raymond <esr@snark.thyrsus.com> *
32 * and: Thomas E. Dickey 1996-on *
33 ****************************************************************************/
36 * parse_entry.c -- compile one terminfo or termcap entry
38 * Get an exact in-core representation of an entry. Don't
39 * try to resolve use or tc capabilities, that is someone
40 * else's job. Depends on the lexical analyzer to get tokens
41 * from the input stream.
44 #define __INTERNAL_CAPS_VISIBLE
45 #include <curses.priv.h>
50 MODULE_ID("$Id: parse_entry.c,v 1.81 2016/05/28 23:22:52 tom Exp $")
53 static short const parametrized[] =
56 #include <parametrized.h>
59 static void postprocess_termcap(TERMTYPE *, bool);
60 static void postprocess_terminfo(TERMTYPE *);
61 static struct name_table_entry const *lookup_fullname(const char *name);
65 static struct name_table_entry const *
66 _nc_extend_names(ENTRY * entryp, char *name, int token_type)
68 static struct name_table_entry temp;
69 TERMTYPE *tp = &(entryp->tterm);
73 unsigned first, last, n;
79 last = tp->ext_Booleans;
80 offset = tp->ext_Booleans;
81 tindex = tp->num_Booleans;
84 first = tp->ext_Booleans;
85 last = tp->ext_Numbers + first;
86 offset = (unsigned) (tp->ext_Booleans + tp->ext_Numbers);
87 tindex = tp->num_Numbers;
90 first = (unsigned) (tp->ext_Booleans + tp->ext_Numbers);
91 last = tp->ext_Strings + first;
92 offset = (unsigned) (tp->ext_Booleans + tp->ext_Numbers + tp->ext_Strings);
93 tindex = tp->num_Strings;
96 actual = NUM_EXT_NAMES(tp);
97 for (n = 0; n < actual; n++) {
98 if (!strcmp(name, tp->ext_Names[n])) {
99 if (n > (unsigned) (tp->ext_Booleans + tp->ext_Numbers)) {
101 } else if (n > tp->ext_Booleans) {
104 token_type = BOOLEAN;
106 return _nc_extend_names(entryp, name, token_type);
109 /* Well, we are given a cancel for a name that we don't recognize */
110 return _nc_extend_names(entryp, name, STRING);
115 /* Adjust the 'offset' (insertion-point) to keep the lists of extended
118 for (n = first, found = FALSE; n < last; n++) {
119 int cmp = strcmp(tp->ext_Names[n], name);
125 switch (token_type) {
140 #define for_each_value(max) \
141 for (last = (unsigned) (max - 1); last > tindex; last--)
144 switch (token_type) {
148 TYPE_REALLOC(NCURSES_SBOOL, tp->num_Booleans, tp->Booleans);
149 for_each_value(tp->num_Booleans)
150 tp->Booleans[last] = tp->Booleans[last - 1];
155 TYPE_REALLOC(short, tp->num_Numbers, tp->Numbers);
156 for_each_value(tp->num_Numbers)
157 tp->Numbers[last] = tp->Numbers[last - 1];
162 TYPE_REALLOC(char *, tp->num_Strings, tp->Strings);
163 for_each_value(tp->num_Strings)
164 tp->Strings[last] = tp->Strings[last - 1];
167 actual = NUM_EXT_NAMES(tp);
168 TYPE_REALLOC(char *, actual, tp->ext_Names);
169 while (--actual > offset)
170 tp->ext_Names[actual] = tp->ext_Names[actual - 1];
171 tp->ext_Names[offset] = _nc_save_str(name);
174 temp.nte_name = tp->ext_Names[offset];
175 temp.nte_type = token_type;
176 temp.nte_index = (short) tindex;
181 #endif /* NCURSES_XNAMES */
185 * _nc_parse_entry(entry, literal, silent)
187 * Compile one entry. Doesn't try to resolve use or tc capabilities.
189 * found-forward-use = FALSE
190 * re-initialise internal arrays
192 * if the token was not a name in column 1, complain and die
193 * save names in entry's string table
194 * while (get_token() is not EOF and not NAMES)
195 * check for existence and type-correctness
196 * enter cap into structure
198 * save string in entry's string table
202 #define BAD_TC_USAGE if (!bad_tc_usage) \
203 { bad_tc_usage = TRUE; \
204 _nc_warning("Legacy termcap allows only a trailing tc= clause"); }
206 #define MAX_NUMBER 0x7fff /* positive shorts only */
209 _nc_parse_entry(struct entry *entryp, int literal, bool silent)
212 struct name_table_entry const *entry_ptr;
214 bool bad_tc_usage = FALSE;
216 token_type = _nc_get_token(silent);
218 if (token_type == EOF)
220 if (token_type != NAMES)
221 _nc_err_abort("Entry does not start with terminal names in column one");
223 _nc_init_entry(&entryp->tterm);
225 entryp->cstart = _nc_comment_start;
226 entryp->cend = _nc_comment_end;
227 entryp->startline = _nc_start_line;
228 DEBUG(2, ("Comment range is %ld to %ld", entryp->cstart, entryp->cend));
231 * Strip off the 2-character termcap name, if present. Originally termcap
232 * used that as an indexing aid. We can retain 2-character terminfo names,
233 * but note that they would be lost if we translate to/from termcap. This
234 * feature is supposedly obsolete since "newer" BSD implementations do not
235 * use it; however our reference for this feature is SunOS 4.x, which
236 * implemented it. Note that the resulting terminal type was never the
237 * 2-character name, but was instead the first alias after that.
239 ptr = _nc_curr_token.tk_name;
240 if (_nc_syntax == SYN_TERMCAP
242 && !_nc_user_definable
247 _nc_curr_token.tk_name[2] = '\0';
251 entryp->tterm.str_table = entryp->tterm.term_names = _nc_save_str(ptr);
253 if (entryp->tterm.str_table == 0)
256 DEBUG(1, ("Starting '%s'", ptr));
259 * We do this because the one-token lookahead in the parse loop
260 * results in the terminal type getting prematurely set to correspond
261 * to that of the next entry.
263 _nc_set_type(_nc_first_name(entryp->tterm.term_names));
265 /* check for overly-long names and aliases */
266 for (base = entryp->tterm.term_names; (ptr = strchr(base, '|')) != 0;
268 if (ptr - base > MAX_ALIAS) {
269 _nc_warning("%s `%.*s' may be too long",
270 (base == entryp->tterm.term_names)
273 (int) (ptr - base), base);
279 for (token_type = _nc_get_token(silent);
280 token_type != EOF && token_type != NAMES;
281 token_type = _nc_get_token(silent)) {
282 bool is_use = (strcmp(_nc_curr_token.tk_name, "use") == 0);
283 bool is_tc = !is_use && (strcmp(_nc_curr_token.tk_name, "tc") == 0);
284 if (is_use || is_tc) {
285 entryp->uses[entryp->nuses].name = _nc_save_str(_nc_curr_token.tk_valstring);
286 entryp->uses[entryp->nuses].line = _nc_curr_line;
288 if (entryp->nuses > 1 && is_tc) {
292 /* normal token lookup */
293 entry_ptr = _nc_find_entry(_nc_curr_token.tk_name,
294 _nc_get_hash_table(_nc_syntax));
297 * Our kluge to handle aliasing. The reason it's done
298 * this ugly way, with a linear search, is so the hashing
299 * machinery doesn't have to be made really complicated
300 * (also we get better warnings this way). No point in
301 * making this case fast, aliased caps aren't common now
302 * and will get rarer.
304 if (entry_ptr == NOTFOUND) {
305 const struct alias *ap;
307 if (_nc_syntax == SYN_TERMCAP) {
308 if (entryp->nuses != 0) {
311 for (ap = _nc_get_alias_table(TRUE); ap->from; ap++)
312 if (strcmp(ap->from, _nc_curr_token.tk_name) == 0) {
313 if (ap->to == (char *) 0) {
314 _nc_warning("%s (%s termcap extension) ignored",
315 ap->from, ap->source);
319 entry_ptr = _nc_find_entry(ap->to,
320 _nc_get_hash_table(TRUE));
321 if (entry_ptr && !silent)
322 _nc_warning("%s (%s termcap extension) aliased to %s",
323 ap->from, ap->source, ap->to);
326 } else { /* if (_nc_syntax == SYN_TERMINFO) */
327 for (ap = _nc_get_alias_table(FALSE); ap->from; ap++)
328 if (strcmp(ap->from, _nc_curr_token.tk_name) == 0) {
329 if (ap->to == (char *) 0) {
330 _nc_warning("%s (%s terminfo extension) ignored",
331 ap->from, ap->source);
335 entry_ptr = _nc_find_entry(ap->to,
336 _nc_get_hash_table(FALSE));
337 if (entry_ptr && !silent)
338 _nc_warning("%s (%s terminfo extension) aliased to %s",
339 ap->from, ap->source, ap->to);
343 if (entry_ptr == NOTFOUND) {
344 entry_ptr = lookup_fullname(_nc_curr_token.tk_name);
350 * If we have extended-names active, we will automatically
351 * define a name based on its context.
353 if (entry_ptr == NOTFOUND
354 && _nc_user_definable
355 && (entry_ptr = _nc_extend_names(entryp,
356 _nc_curr_token.tk_name,
358 if (_nc_tracing >= DEBUG_LEVEL(1))
359 _nc_warning("extended capability '%s'", _nc_curr_token.tk_name);
361 #endif /* NCURSES_XNAMES */
363 /* can't find this cap name, not even as an alias */
364 if (entry_ptr == NOTFOUND) {
366 _nc_warning("unknown capability '%s'",
367 _nc_curr_token.tk_name);
371 /* deal with bad type/value combinations. */
372 if (token_type != CANCEL && entry_ptr->nte_type != token_type) {
374 * Nasty special cases here handle situations in which type
375 * information can resolve name clashes. Normal lookup
376 * finds the last instance in the capability table of a
377 * given name, regardless of type. find_type_entry looks
378 * for a first matching instance with given type. So as
379 * long as all ambiguous names occur in pairs of distinct
380 * type, this will do the job.
383 if (token_type == NUMBER
384 && !strcmp("ma", _nc_curr_token.tk_name)) {
385 /* tell max_attributes from arrow_key_map */
386 entry_ptr = _nc_find_type_entry("ma", NUMBER,
388 assert(entry_ptr != 0);
390 } else if (token_type == STRING
391 && !strcmp("MT", _nc_curr_token.tk_name)) {
392 /* map terminfo's string MT to MT */
393 entry_ptr = _nc_find_type_entry("MT", STRING,
395 assert(entry_ptr != 0);
397 } else if (token_type == BOOLEAN
398 && entry_ptr->nte_type == STRING) {
399 /* treat strings without following "=" as empty strings */
402 /* we couldn't recover; skip this token */
404 const char *type_name;
405 switch (entry_ptr->nte_type) {
407 type_name = "boolean";
410 type_name = "string";
413 type_name = "numeric";
416 type_name = "unknown";
419 _nc_warning("wrong type used for %s capability '%s'",
420 type_name, _nc_curr_token.tk_name);
426 /* now we know that the type/value combination is OK */
427 switch (token_type) {
429 switch (entry_ptr->nte_type) {
431 entryp->tterm.Booleans[entry_ptr->nte_index] = CANCELLED_BOOLEAN;
435 entryp->tterm.Numbers[entry_ptr->nte_index] = CANCELLED_NUMERIC;
439 entryp->tterm.Strings[entry_ptr->nte_index] = CANCELLED_STRING;
445 entryp->tterm.Booleans[entry_ptr->nte_index] = TRUE;
449 if (_nc_curr_token.tk_valnumber > MAX_NUMBER) {
450 entryp->tterm.Numbers[entry_ptr->nte_index] = MAX_NUMBER;
452 entryp->tterm.Numbers[entry_ptr->nte_index] =
453 (short) _nc_curr_token.tk_valnumber;
458 ptr = _nc_curr_token.tk_valstring;
459 if (_nc_syntax == SYN_TERMCAP)
460 ptr = _nc_captoinfo(_nc_curr_token.tk_name,
462 parametrized[entry_ptr->nte_index]);
463 entryp->tterm.Strings[entry_ptr->nte_index] = _nc_save_str(ptr);
468 _nc_warning("unknown token type");
469 _nc_panic_mode((char) ((_nc_syntax == SYN_TERMCAP) ? ':' : ','));
472 } /* end else cur_token.name != "use" */
474 continue; /* cannot have a label w/o statement */
475 } /* endwhile (not EOF and not NAMES) */
477 _nc_push_token(token_type);
478 _nc_set_type(_nc_first_name(entryp->tterm.term_names));
481 * Try to deduce as much as possible from extension capabilities
482 * (this includes obsolete BSD capabilities). Sigh...it would be more
483 * space-efficient to call this after use resolution, but it has
484 * to be done before entry allocation is wrapped up.
487 if (_nc_syntax == SYN_TERMCAP) {
488 bool has_base_entry = FALSE;
491 * Don't insert defaults if this is a `+' entry meant only
492 * for inclusion in other entries (not sure termcap ever
493 * had these, actually).
495 if (strchr(entryp->tterm.term_names, '+')) {
496 has_base_entry = TRUE;
500 * Otherwise, look for a base entry that will already
501 * have picked up defaults via translation.
503 for (i = 0; i < entryp->nuses; i++)
504 if (!strchr((char *) entryp->uses[i].name, '+'))
505 has_base_entry = TRUE;
508 postprocess_termcap(&entryp->tterm, has_base_entry);
510 postprocess_terminfo(&entryp->tterm);
512 _nc_wrap_entry(entryp, FALSE);
518 _nc_capcmp(const char *s, const char *t)
519 /* compare two string capabilities, stripping out padding */
521 if (!VALID_STRING(s) && !VALID_STRING(t))
523 else if (!VALID_STRING(s) || !VALID_STRING(t))
527 if (s[0] == '$' && s[1] == '<') {
529 if (!(isdigit(UChar(*s))
537 if (t[0] == '$' && t[1] == '<') {
539 if (!(isdigit(UChar(*t))
547 /* we've now pushed s and t past any padding they were pointing at */
549 if (*s == '\0' && *t == '\0')
555 /* else *s == *t but one is not NUL, so continue */
561 append_acs0(string_desc * dst, int code, int src)
565 temp[0] = (char) code;
566 temp[1] = (char) src;
568 _nc_safe_strcat(dst, temp);
573 append_acs(string_desc * dst, int code, char *src)
575 if (src != 0 && strlen(src) == 1) {
576 append_acs0(dst, code, *src);
581 * The ko capability, if present, consists of a comma-separated capability
582 * list. For each capability, we may assume there is a keycap that sends the
583 * string which is the value of that capability.
585 #define DATA(from, to) { { from }, { to } }
590 static assoc const ko_xlate[] =
592 DATA("al", "kil1"), /* insert line key -> KEY_IL */
593 DATA("bt", "kcbt"), /* back tab -> KEY_BTAB */
594 DATA("cd", "ked"), /* clear-to-eos key -> KEY_EOL */
595 DATA("ce", "kel"), /* clear-to-eol key -> KEY_EOS */
596 DATA("cl", "kclr"), /* clear key -> KEY_CLEAR */
597 DATA("ct", "tbc"), /* clear all tabs -> KEY_CATAB */
598 DATA("dc", "kdch1"), /* delete char -> KEY_DC */
599 DATA("dl", "kdl1"), /* delete line -> KEY_DL */
600 DATA("do", "kcud1"), /* down key -> KEY_DOWN */
601 DATA("ei", "krmir"), /* exit insert key -> KEY_EIC */
602 DATA("ho", "khome"), /* home key -> KEY_HOME */
603 DATA("ic", "kich1"), /* insert char key -> KEY_IC */
604 DATA("im", "kIC"), /* insert-mode key -> KEY_SIC */
605 DATA("le", "kcub1"), /* le key -> KEY_LEFT */
606 DATA("nd", "kcuf1"), /* nd key -> KEY_RIGHT */
607 DATA("nl", "kent"), /* new line key -> KEY_ENTER */
608 DATA("st", "khts"), /* set-tab key -> KEY_STAB */
610 DATA("up", "kcuu1"), /* up-arrow key -> KEY_UP */
614 * This routine fills in string caps that either had defaults under
615 * termcap or can be manufactured from obsolete termcap capabilities.
616 * It was lifted from Ross Ridge's mytinfo package.
619 static const char C_CR[] = "\r";
620 static const char C_LF[] = "\n";
621 static const char C_BS[] = "\b";
622 static const char C_HT[] = "\t";
625 * Note that WANTED and PRESENT are not simple inverses! If a capability
626 * has been explicitly cancelled, it's not considered WANTED.
628 #define WANTED(s) ((s) == ABSENT_STRING)
629 #define PRESENT(s) (((s) != ABSENT_STRING) && ((s) != CANCELLED_STRING))
632 * This bit of legerdemain turns all the terminfo variable names into
633 * references to locations in the arrays Booleans, Numbers, and Strings ---
634 * precisely what's needed.
641 postprocess_termcap(TERMTYPE *tp, bool has_base)
643 char buf[MAX_LINE * 2 + 2];
647 * TERMCAP DEFAULTS AND OBSOLETE-CAPABILITY TRANSLATIONS
649 * This first part of the code is the functional inverse of the
650 * fragment in capdefaults.c.
651 * ----------------------------------------------------------------------
654 /* if there was a tc entry, assume we picked up defaults via that */
656 if (WANTED(init_3string) && termcap_init2)
657 init_3string = _nc_save_str(termcap_init2);
659 if (WANTED(reset_2string) && termcap_reset)
660 reset_2string = _nc_save_str(termcap_reset);
662 if (WANTED(carriage_return)) {
663 if (carriage_return_delay > 0) {
664 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
665 "%s$<%d>", C_CR, carriage_return_delay);
666 carriage_return = _nc_save_str(buf);
668 carriage_return = _nc_save_str(C_CR);
670 if (WANTED(cursor_left)) {
671 if (backspace_delay > 0) {
672 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
673 "%s$<%d>", C_BS, backspace_delay);
674 cursor_left = _nc_save_str(buf);
675 } else if (backspaces_with_bs == 1)
676 cursor_left = _nc_save_str(C_BS);
677 else if (PRESENT(backspace_if_not_bs))
678 cursor_left = backspace_if_not_bs;
680 /* vi doesn't use "do", but it does seem to use nl (or '\n') instead */
681 if (WANTED(cursor_down)) {
682 if (PRESENT(linefeed_if_not_lf))
683 cursor_down = linefeed_if_not_lf;
684 else if (linefeed_is_newline != 1) {
685 if (new_line_delay > 0) {
686 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
687 "%s$<%d>", C_LF, new_line_delay);
688 cursor_down = _nc_save_str(buf);
690 cursor_down = _nc_save_str(C_LF);
693 if (WANTED(scroll_forward) && crt_no_scrolling != 1) {
694 if (PRESENT(linefeed_if_not_lf))
695 cursor_down = linefeed_if_not_lf;
696 else if (linefeed_is_newline != 1) {
697 if (new_line_delay > 0) {
698 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
699 "%s$<%d>", C_LF, new_line_delay);
700 scroll_forward = _nc_save_str(buf);
702 scroll_forward = _nc_save_str(C_LF);
705 if (WANTED(newline)) {
706 if (linefeed_is_newline == 1) {
707 if (new_line_delay > 0) {
708 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
709 "%s$<%d>", C_LF, new_line_delay);
710 newline = _nc_save_str(buf);
712 newline = _nc_save_str(C_LF);
713 } else if (PRESENT(carriage_return) && PRESENT(scroll_forward)) {
714 _nc_str_init(&result, buf, sizeof(buf));
715 if (_nc_safe_strcat(&result, carriage_return)
716 && _nc_safe_strcat(&result, scroll_forward))
717 newline = _nc_save_str(buf);
718 } else if (PRESENT(carriage_return) && PRESENT(cursor_down)) {
719 _nc_str_init(&result, buf, sizeof(buf));
720 if (_nc_safe_strcat(&result, carriage_return)
721 && _nc_safe_strcat(&result, cursor_down))
722 newline = _nc_save_str(buf);
728 * Inverse of capdefaults.c code ends here.
729 * ----------------------------------------------------------------------
731 * TERMCAP-TO TERMINFO MAPPINGS FOR SOURCE TRANSLATION
733 * These translations will *not* be inverted by tgetent().
738 * We wait until now to decide if we've got a working cr because even
739 * one that doesn't work can be used for newline. Unfortunately the
740 * space allocated for it is wasted.
742 if (return_does_clr_eol == 1 || no_correctly_working_cr == 1)
743 carriage_return = ABSENT_STRING;
746 * Supposedly most termcap entries have ta now and '\t' is no longer a
747 * default, but it doesn't seem to be true...
750 if (horizontal_tab_delay > 0) {
751 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
752 "%s$<%d>", C_HT, horizontal_tab_delay);
753 tab = _nc_save_str(buf);
755 tab = _nc_save_str(C_HT);
757 if (init_tabs == ABSENT_NUMERIC && has_hardware_tabs == TRUE)
761 * Assume we can beep with ^G unless we're given bl@.
764 bell = _nc_save_str("\007");
768 * Translate the old termcap :pt: capability to it#8 + ht=\t
770 if (has_hardware_tabs == TRUE) {
771 if (init_tabs != 8 && init_tabs != ABSENT_NUMERIC)
772 _nc_warning("hardware tabs with a width other than 8: %d", init_tabs);
774 if (tab && _nc_capcmp(tab, C_HT))
775 _nc_warning("hardware tabs with a non-^I tab string %s",
779 tab = _nc_save_str(C_HT);
785 * Now translate the ko capability, if there is one. This
786 * isn't from mytinfo...
788 if (PRESENT(other_non_function_keys)) {
791 struct name_table_entry const *from_ptr;
792 struct name_table_entry const *to_ptr;
793 char buf2[MAX_TERMINFO_LENGTH];
796 /* we're going to use this for a special case later */
797 dp = strchr(other_non_function_keys, 'i');
798 foundim = (dp != 0) && (dp[1] == 'm');
800 /* look at each comma-separated capability in the ko string... */
801 for (base = other_non_function_keys;
802 (cp = strchr(base, ',')) != 0;
804 size_t len = (unsigned) (cp - base);
808 for (n = 0; n < SIZEOF(ko_xlate); ++n) {
809 if (len == strlen(ko_xlate[n].from)
810 && strncmp(ko_xlate[n].from, base, len) == 0) {
816 _nc_warning("unknown capability `%.*s' in ko string",
819 } else if (ap->to[0] == '\0') /* ignore it */
822 /* now we know we found a match in ko_table, so... */
824 from_ptr = _nc_find_entry(ap->from, _nc_get_hash_table(TRUE));
825 to_ptr = _nc_find_entry(ap->to, _nc_get_hash_table(FALSE));
827 if (!from_ptr || !to_ptr) /* should never happen! */
828 _nc_err_abort("ko translation table is invalid, I give up");
830 if (WANTED(tp->Strings[from_ptr->nte_index])) {
831 _nc_warning("no value for ko capability %s", ap->from);
835 if (tp->Strings[to_ptr->nte_index]) {
836 /* There's no point in warning about it if it's the same
837 * string; that's just an inefficiency.
840 tp->Strings[from_ptr->nte_index],
841 tp->Strings[to_ptr->nte_index]) != 0)
842 _nc_warning("%s (%s) already has an explicit value %s, ignoring ko",
844 _nc_visbuf(tp->Strings[to_ptr->nte_index]));
849 * The magic moment -- copy the mapped key string over,
850 * stripping out padding.
852 for (dp = buf2, bp = tp->Strings[from_ptr->nte_index]; *bp; bp++) {
853 if (bp[0] == '$' && bp[1] == '<') {
854 while (*bp && *bp != '>') {
862 tp->Strings[to_ptr->nte_index] = _nc_save_str(buf2);
866 * Note: ko=im and ko=ic both want to grab the `Insert'
867 * keycap. There's a kich1 but no ksmir, so the ic capability
868 * got mapped to kich1 and im to kIC to avoid a collision.
869 * If the description has im but not ic, hack kIC back to kich1.
871 if (foundim && WANTED(key_ic) && key_sic) {
873 key_sic = ABSENT_STRING;
879 if (WANTED(key_backspace))
880 key_backspace = _nc_save_str(C_BS);
881 if (WANTED(key_left))
882 key_left = _nc_save_str(C_BS);
883 if (WANTED(key_down))
884 key_down = _nc_save_str(C_LF);
889 * Translate XENIX forms characters.
891 if (PRESENT(acs_ulcorner) ||
892 PRESENT(acs_llcorner) ||
893 PRESENT(acs_urcorner) ||
894 PRESENT(acs_lrcorner) ||
899 PRESENT(acs_hline) ||
900 PRESENT(acs_vline) ||
902 char buf2[MAX_TERMCAP_LENGTH];
904 _nc_str_init(&result, buf2, sizeof(buf2));
905 _nc_safe_strcat(&result, acs_chars);
907 append_acs(&result, 'j', acs_lrcorner);
908 append_acs(&result, 'k', acs_urcorner);
909 append_acs(&result, 'l', acs_ulcorner);
910 append_acs(&result, 'm', acs_llcorner);
911 append_acs(&result, 'n', acs_plus);
912 append_acs(&result, 'q', acs_hline);
913 append_acs(&result, 't', acs_ltee);
914 append_acs(&result, 'u', acs_rtee);
915 append_acs(&result, 'v', acs_btee);
916 append_acs(&result, 'w', acs_ttee);
917 append_acs(&result, 'x', acs_vline);
920 acs_chars = _nc_save_str(buf2);
921 _nc_warning("acsc string synthesized from XENIX capabilities");
923 } else if (acs_chars == 0
924 && enter_alt_charset_mode != 0
925 && exit_alt_charset_mode != 0) {
926 acs_chars = _nc_save_str(VT_ACSC);
931 postprocess_terminfo(TERMTYPE *tp)
934 * TERMINFO-TO-TERMINFO MAPPINGS FOR SOURCE TRANSLATION
935 * ----------------------------------------------------------------------
939 * Translate AIX forms characters.
941 if (PRESENT(box_chars_1)) {
942 char buf2[MAX_TERMCAP_LENGTH];
945 _nc_str_init(&result, buf2, sizeof(buf2));
946 _nc_safe_strcat(&result, acs_chars);
948 append_acs0(&result, 'l', box_chars_1[0]); /* ACS_ULCORNER */
949 append_acs0(&result, 'q', box_chars_1[1]); /* ACS_HLINE */
950 append_acs0(&result, 'k', box_chars_1[2]); /* ACS_URCORNER */
951 append_acs0(&result, 'x', box_chars_1[3]); /* ACS_VLINE */
952 append_acs0(&result, 'j', box_chars_1[4]); /* ACS_LRCORNER */
953 append_acs0(&result, 'm', box_chars_1[5]); /* ACS_LLCORNER */
954 append_acs0(&result, 'w', box_chars_1[6]); /* ACS_TTEE */
955 append_acs0(&result, 'u', box_chars_1[7]); /* ACS_RTEE */
956 append_acs0(&result, 'v', box_chars_1[8]); /* ACS_BTEE */
957 append_acs0(&result, 't', box_chars_1[9]); /* ACS_LTEE */
958 append_acs0(&result, 'n', box_chars_1[10]); /* ACS_PLUS */
961 acs_chars = _nc_save_str(buf2);
962 _nc_warning("acsc string synthesized from AIX capabilities");
963 box_chars_1 = ABSENT_STRING;
967 * ----------------------------------------------------------------------
972 * Do a linear search through the terminfo tables to find a given full-name.
973 * We don't expect to do this often, so there's no hashing function.
975 * In effect, this scans through the 3 lists of full-names, and looks them
976 * up in _nc_info_table, which is organized so that the nte_index fields are
977 * sorted, but the nte_type fields are not necessarily grouped together.
979 static struct name_table_entry const *
980 lookup_fullname(const char *find)
986 NCURSES_CONST char *const *names;
1002 for (count = 0; names[count] != 0; count++) {
1003 if (!strcmp(names[count], find)) {
1004 struct name_table_entry const *entry_ptr = _nc_get_table(FALSE);
1005 while (entry_ptr->nte_type != state
1006 || entry_ptr->nte_index != count)
1014 /* parse_entry.c ends here */