1 /****************************************************************************
2 * Copyright (c) 1998-2016,2017 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.86 2017/06/28 00:53:12 tom Exp $")
53 static short const parametrized[] =
56 #include <parametrized.h>
59 static void postprocess_termcap(TERMTYPE2 *, bool);
60 static void postprocess_terminfo(TERMTYPE2 *);
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 TERMTYPE2 *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(NCURSES_INT2, 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(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);
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 #define ok_TC2(s) (isgraph(UChar(s)) && (s) != '|')
240 ptr = _nc_curr_token.tk_name;
241 if (_nc_syntax == SYN_TERMCAP
243 && !_nc_user_definable
246 if (ok_TC2(ptr[0]) && ok_TC2(ptr[1]) && (ptr[2] == '|')) {
248 _nc_curr_token.tk_name[2] = '\0';
252 entryp->tterm.str_table = entryp->tterm.term_names = _nc_save_str(ptr);
254 if (entryp->tterm.str_table == 0)
257 DEBUG(1, ("Starting '%s'", ptr));
260 * We do this because the one-token lookahead in the parse loop
261 * results in the terminal type getting prematurely set to correspond
262 * to that of the next entry.
264 _nc_set_type(_nc_first_name(entryp->tterm.term_names));
266 /* check for overly-long names and aliases */
267 for (base = entryp->tterm.term_names; (ptr = strchr(base, '|')) != 0;
269 if (ptr - base > MAX_ALIAS) {
270 _nc_warning("%s `%.*s' may be too long",
271 (base == entryp->tterm.term_names)
274 (int) (ptr - base), base);
280 for (token_type = _nc_get_token(silent);
281 token_type != EOF && token_type != NAMES;
282 token_type = _nc_get_token(silent)) {
283 bool is_use = (strcmp(_nc_curr_token.tk_name, "use") == 0);
284 bool is_tc = !is_use && (strcmp(_nc_curr_token.tk_name, "tc") == 0);
285 if (is_use || is_tc) {
286 entryp->uses[entryp->nuses].name = _nc_save_str(_nc_curr_token.tk_valstring);
287 entryp->uses[entryp->nuses].line = _nc_curr_line;
288 if (VALID_STRING(entryp->uses[entryp->nuses].name)) {
290 if (entryp->nuses > 1 && is_tc) {
295 /* normal token lookup */
296 entry_ptr = _nc_find_entry(_nc_curr_token.tk_name,
297 _nc_get_hash_table(_nc_syntax));
300 * Our kluge to handle aliasing. The reason it's done
301 * this ugly way, with a linear search, is so the hashing
302 * machinery doesn't have to be made really complicated
303 * (also we get better warnings this way). No point in
304 * making this case fast, aliased caps aren't common now
305 * and will get rarer.
307 if (entry_ptr == NOTFOUND) {
308 const struct alias *ap;
310 if (_nc_syntax == SYN_TERMCAP) {
311 if (entryp->nuses != 0) {
314 for (ap = _nc_get_alias_table(TRUE); ap->from; ap++)
315 if (strcmp(ap->from, _nc_curr_token.tk_name) == 0) {
316 if (ap->to == (char *) 0) {
317 _nc_warning("%s (%s termcap extension) ignored",
318 ap->from, ap->source);
322 entry_ptr = _nc_find_entry(ap->to,
323 _nc_get_hash_table(TRUE));
324 if (entry_ptr && !silent)
325 _nc_warning("%s (%s termcap extension) aliased to %s",
326 ap->from, ap->source, ap->to);
329 } else { /* if (_nc_syntax == SYN_TERMINFO) */
330 for (ap = _nc_get_alias_table(FALSE); ap->from; ap++)
331 if (strcmp(ap->from, _nc_curr_token.tk_name) == 0) {
332 if (ap->to == (char *) 0) {
333 _nc_warning("%s (%s terminfo extension) ignored",
334 ap->from, ap->source);
338 entry_ptr = _nc_find_entry(ap->to,
339 _nc_get_hash_table(FALSE));
340 if (entry_ptr && !silent)
341 _nc_warning("%s (%s terminfo extension) aliased to %s",
342 ap->from, ap->source, ap->to);
346 if (entry_ptr == NOTFOUND) {
347 entry_ptr = lookup_fullname(_nc_curr_token.tk_name);
353 * If we have extended-names active, we will automatically
354 * define a name based on its context.
356 if (entry_ptr == NOTFOUND
357 && _nc_user_definable
358 && (entry_ptr = _nc_extend_names(entryp,
359 _nc_curr_token.tk_name,
361 if (_nc_tracing >= DEBUG_LEVEL(1))
362 _nc_warning("extended capability '%s'", _nc_curr_token.tk_name);
364 #endif /* NCURSES_XNAMES */
366 /* can't find this cap name, not even as an alias */
367 if (entry_ptr == NOTFOUND) {
369 _nc_warning("unknown capability '%s'",
370 _nc_curr_token.tk_name);
374 /* deal with bad type/value combinations. */
375 if (token_type == CANCEL) {
377 * Prefer terminfo in this (long-obsolete) ambiguity:
379 if (!strcmp("ma", _nc_curr_token.tk_name)) {
380 entry_ptr = _nc_find_type_entry("ma", NUMBER,
382 assert(entry_ptr != 0);
384 } else if (entry_ptr->nte_type != token_type) {
386 * Nasty special cases here handle situations in which type
387 * information can resolve name clashes. Normal lookup
388 * finds the last instance in the capability table of a
389 * given name, regardless of type. find_type_entry looks
390 * for a first matching instance with given type. So as
391 * long as all ambiguous names occur in pairs of distinct
392 * type, this will do the job.
395 if (token_type == NUMBER
396 && !strcmp("ma", _nc_curr_token.tk_name)) {
397 /* tell max_attributes from arrow_key_map */
398 entry_ptr = _nc_find_type_entry("ma", NUMBER,
400 assert(entry_ptr != 0);
402 } else if (token_type == STRING
403 && !strcmp("MT", _nc_curr_token.tk_name)) {
404 /* map terminfo's string MT to MT */
405 entry_ptr = _nc_find_type_entry("MT", STRING,
407 assert(entry_ptr != 0);
409 } else if (token_type == BOOLEAN
410 && entry_ptr->nte_type == STRING) {
411 /* treat strings without following "=" as empty strings */
414 /* we couldn't recover; skip this token */
416 const char *type_name;
417 switch (entry_ptr->nte_type) {
419 type_name = "boolean";
422 type_name = "string";
425 type_name = "numeric";
428 type_name = "unknown";
431 _nc_warning("wrong type used for %s capability '%s'",
432 type_name, _nc_curr_token.tk_name);
438 /* now we know that the type/value combination is OK */
439 switch (token_type) {
441 switch (entry_ptr->nte_type) {
443 entryp->tterm.Booleans[entry_ptr->nte_index] = CANCELLED_BOOLEAN;
447 entryp->tterm.Numbers[entry_ptr->nte_index] = CANCELLED_NUMERIC;
451 entryp->tterm.Strings[entry_ptr->nte_index] = CANCELLED_STRING;
457 entryp->tterm.Booleans[entry_ptr->nte_index] = TRUE;
461 if (_nc_curr_token.tk_valnumber > MAX_NUMBER) {
462 entryp->tterm.Numbers[entry_ptr->nte_index] = MAX_NUMBER;
464 entryp->tterm.Numbers[entry_ptr->nte_index] =
465 (short) _nc_curr_token.tk_valnumber;
470 ptr = _nc_curr_token.tk_valstring;
471 if (_nc_syntax == SYN_TERMCAP)
472 ptr = _nc_captoinfo(_nc_curr_token.tk_name,
474 parametrized[entry_ptr->nte_index]);
475 entryp->tterm.Strings[entry_ptr->nte_index] = _nc_save_str(ptr);
480 _nc_warning("unknown token type");
481 _nc_panic_mode((char) ((_nc_syntax == SYN_TERMCAP) ? ':' : ','));
484 } /* end else cur_token.name != "use" */
486 continue; /* cannot have a label w/o statement */
487 } /* endwhile (not EOF and not NAMES) */
489 _nc_push_token(token_type);
490 _nc_set_type(_nc_first_name(entryp->tterm.term_names));
493 * Try to deduce as much as possible from extension capabilities
494 * (this includes obsolete BSD capabilities). Sigh...it would be more
495 * space-efficient to call this after use resolution, but it has
496 * to be done before entry allocation is wrapped up.
499 if (_nc_syntax == SYN_TERMCAP) {
500 bool has_base_entry = FALSE;
503 * Don't insert defaults if this is a `+' entry meant only
504 * for inclusion in other entries (not sure termcap ever
505 * had these, actually).
507 if (strchr(entryp->tterm.term_names, '+')) {
508 has_base_entry = TRUE;
512 * Otherwise, look for a base entry that will already
513 * have picked up defaults via translation.
515 for (i = 0; i < entryp->nuses; i++)
516 if (!strchr((char *) entryp->uses[i].name, '+'))
517 has_base_entry = TRUE;
520 postprocess_termcap(&entryp->tterm, has_base_entry);
522 postprocess_terminfo(&entryp->tterm);
524 _nc_wrap_entry(entryp, FALSE);
530 _nc_capcmp(const char *s, const char *t)
531 /* compare two string capabilities, stripping out padding */
533 bool ok_s = VALID_STRING(s);
534 bool ok_t = VALID_STRING(t);
538 if (s[0] == '$' && s[1] == '<') {
540 if (!(isdigit(UChar(*s))
550 if (t[0] == '$' && t[1] == '<') {
552 if (!(isdigit(UChar(*t))
562 /* we've now pushed s and t past any padding they pointed at */
564 if (*s == '\0' && *t == '\0')
570 /* else *s == *t but one is not NUL, so continue */
573 } else if (ok_s || ok_t) {
580 append_acs0(string_desc * dst, int code, int src)
584 temp[0] = (char) code;
585 temp[1] = (char) src;
587 _nc_safe_strcat(dst, temp);
592 append_acs(string_desc * dst, int code, char *src)
594 if (VALID_STRING(src) && strlen(src) == 1) {
595 append_acs0(dst, code, *src);
600 * The ko capability, if present, consists of a comma-separated capability
601 * list. For each capability, we may assume there is a keycap that sends the
602 * string which is the value of that capability.
604 #define DATA(from, to) { { from }, { to } }
609 static assoc const ko_xlate[] =
611 DATA("al", "kil1"), /* insert line key -> KEY_IL */
612 DATA("bt", "kcbt"), /* back tab -> KEY_BTAB */
613 DATA("cd", "ked"), /* clear-to-eos key -> KEY_EOL */
614 DATA("ce", "kel"), /* clear-to-eol key -> KEY_EOS */
615 DATA("cl", "kclr"), /* clear key -> KEY_CLEAR */
616 DATA("ct", "tbc"), /* clear all tabs -> KEY_CATAB */
617 DATA("dc", "kdch1"), /* delete char -> KEY_DC */
618 DATA("dl", "kdl1"), /* delete line -> KEY_DL */
619 DATA("do", "kcud1"), /* down key -> KEY_DOWN */
620 DATA("ei", "krmir"), /* exit insert key -> KEY_EIC */
621 DATA("ho", "khome"), /* home key -> KEY_HOME */
622 DATA("ic", "kich1"), /* insert char key -> KEY_IC */
623 DATA("im", "kIC"), /* insert-mode key -> KEY_SIC */
624 DATA("le", "kcub1"), /* le key -> KEY_LEFT */
625 DATA("nd", "kcuf1"), /* nd key -> KEY_RIGHT */
626 DATA("nl", "kent"), /* new line key -> KEY_ENTER */
627 DATA("st", "khts"), /* set-tab key -> KEY_STAB */
629 DATA("up", "kcuu1"), /* up-arrow key -> KEY_UP */
633 * This routine fills in string caps that either had defaults under
634 * termcap or can be manufactured from obsolete termcap capabilities.
635 * It was lifted from Ross Ridge's mytinfo package.
638 static const char C_CR[] = "\r";
639 static const char C_LF[] = "\n";
640 static const char C_BS[] = "\b";
641 static const char C_HT[] = "\t";
644 * Note that WANTED and PRESENT are not simple inverses! If a capability
645 * has been explicitly cancelled, it's not considered WANTED.
647 #define WANTED(s) ((s) == ABSENT_STRING)
648 #define PRESENT(s) (((s) != ABSENT_STRING) && ((s) != CANCELLED_STRING))
651 * This bit of legerdemain turns all the terminfo variable names into
652 * references to locations in the arrays Booleans, Numbers, and Strings ---
653 * precisely what's needed.
660 postprocess_termcap(TERMTYPE2 *tp, bool has_base)
662 char buf[MAX_LINE * 2 + 2];
666 * TERMCAP DEFAULTS AND OBSOLETE-CAPABILITY TRANSLATIONS
668 * This first part of the code is the functional inverse of the
669 * fragment in capdefaults.c.
670 * ----------------------------------------------------------------------
673 /* if there was a tc entry, assume we picked up defaults via that */
675 if (WANTED(init_3string) && termcap_init2)
676 init_3string = _nc_save_str(termcap_init2);
678 if (WANTED(reset_2string) && termcap_reset)
679 reset_2string = _nc_save_str(termcap_reset);
681 if (WANTED(carriage_return)) {
682 if (carriage_return_delay > 0) {
683 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
684 "%s$<%d>", C_CR, carriage_return_delay);
685 carriage_return = _nc_save_str(buf);
687 carriage_return = _nc_save_str(C_CR);
689 if (WANTED(cursor_left)) {
690 if (backspace_delay > 0) {
691 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
692 "%s$<%d>", C_BS, backspace_delay);
693 cursor_left = _nc_save_str(buf);
694 } else if (backspaces_with_bs == 1)
695 cursor_left = _nc_save_str(C_BS);
696 else if (PRESENT(backspace_if_not_bs))
697 cursor_left = backspace_if_not_bs;
699 /* vi doesn't use "do", but it does seem to use nl (or '\n') instead */
700 if (WANTED(cursor_down)) {
701 if (PRESENT(linefeed_if_not_lf))
702 cursor_down = linefeed_if_not_lf;
703 else if (linefeed_is_newline != 1) {
704 if (new_line_delay > 0) {
705 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
706 "%s$<%d>", C_LF, new_line_delay);
707 cursor_down = _nc_save_str(buf);
709 cursor_down = _nc_save_str(C_LF);
712 if (WANTED(scroll_forward) && crt_no_scrolling != 1) {
713 if (PRESENT(linefeed_if_not_lf))
714 cursor_down = linefeed_if_not_lf;
715 else if (linefeed_is_newline != 1) {
716 if (new_line_delay > 0) {
717 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
718 "%s$<%d>", C_LF, new_line_delay);
719 scroll_forward = _nc_save_str(buf);
721 scroll_forward = _nc_save_str(C_LF);
724 if (WANTED(newline)) {
725 if (linefeed_is_newline == 1) {
726 if (new_line_delay > 0) {
727 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
728 "%s$<%d>", C_LF, new_line_delay);
729 newline = _nc_save_str(buf);
731 newline = _nc_save_str(C_LF);
732 } else if (PRESENT(carriage_return) && PRESENT(scroll_forward)) {
733 _nc_str_init(&result, buf, sizeof(buf));
734 if (_nc_safe_strcat(&result, carriage_return)
735 && _nc_safe_strcat(&result, scroll_forward))
736 newline = _nc_save_str(buf);
737 } else if (PRESENT(carriage_return) && PRESENT(cursor_down)) {
738 _nc_str_init(&result, buf, sizeof(buf));
739 if (_nc_safe_strcat(&result, carriage_return)
740 && _nc_safe_strcat(&result, cursor_down))
741 newline = _nc_save_str(buf);
747 * Inverse of capdefaults.c code ends here.
748 * ----------------------------------------------------------------------
750 * TERMCAP-TO TERMINFO MAPPINGS FOR SOURCE TRANSLATION
752 * These translations will *not* be inverted by tgetent().
757 * We wait until now to decide if we've got a working cr because even
758 * one that doesn't work can be used for newline. Unfortunately the
759 * space allocated for it is wasted.
761 if (return_does_clr_eol == 1 || no_correctly_working_cr == 1)
762 carriage_return = ABSENT_STRING;
765 * Supposedly most termcap entries have ta now and '\t' is no longer a
766 * default, but it doesn't seem to be true...
769 if (horizontal_tab_delay > 0) {
770 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf))
771 "%s$<%d>", C_HT, horizontal_tab_delay);
772 tab = _nc_save_str(buf);
774 tab = _nc_save_str(C_HT);
776 if (init_tabs == ABSENT_NUMERIC && has_hardware_tabs == TRUE)
780 * Assume we can beep with ^G unless we're given bl@.
783 bell = _nc_save_str("\007");
787 * Translate the old termcap :pt: capability to it#8 + ht=\t
789 if (has_hardware_tabs == TRUE) {
790 if (init_tabs != 8 && init_tabs != ABSENT_NUMERIC)
791 _nc_warning("hardware tabs with a width other than 8: %d", init_tabs);
793 if (tab && _nc_capcmp(tab, C_HT))
794 _nc_warning("hardware tabs with a non-^I tab string %s",
798 tab = _nc_save_str(C_HT);
804 * Now translate the ko capability, if there is one. This
805 * isn't from mytinfo...
807 if (PRESENT(other_non_function_keys)) {
810 struct name_table_entry const *from_ptr;
811 struct name_table_entry const *to_ptr;
812 char buf2[MAX_TERMINFO_LENGTH];
815 /* we're going to use this for a special case later */
816 dp = strchr(other_non_function_keys, 'i');
817 foundim = (dp != 0) && (dp[1] == 'm');
819 /* look at each comma-separated capability in the ko string... */
820 for (base = other_non_function_keys;
821 (cp = strchr(base, ',')) != 0;
823 size_t len = (unsigned) (cp - base);
827 for (n = 0; n < SIZEOF(ko_xlate); ++n) {
828 if (len == strlen(ko_xlate[n].from)
829 && strncmp(ko_xlate[n].from, base, len) == 0) {
835 _nc_warning("unknown capability `%.*s' in ko string",
838 } else if (ap->to[0] == '\0') /* ignore it */
841 /* now we know we found a match in ko_table, so... */
843 from_ptr = _nc_find_entry(ap->from, _nc_get_hash_table(TRUE));
844 to_ptr = _nc_find_entry(ap->to, _nc_get_hash_table(FALSE));
846 if (!from_ptr || !to_ptr) /* should never happen! */
847 _nc_err_abort("ko translation table is invalid, I give up");
849 if (WANTED(tp->Strings[from_ptr->nte_index])) {
850 _nc_warning("no value for ko capability %s", ap->from);
854 if (tp->Strings[to_ptr->nte_index]) {
855 const char *s = tp->Strings[from_ptr->nte_index];
856 const char *t = tp->Strings[to_ptr->nte_index];
857 /* There's no point in warning about it if it's the same
858 * string; that's just an inefficiency.
860 if (VALID_STRING(s) && VALID_STRING(t) && strcmp(s, t) != 0)
861 _nc_warning("%s (%s) already has an explicit value %s, ignoring ko",
862 ap->to, ap->from, t);
867 * The magic moment -- copy the mapped key string over,
868 * stripping out padding.
870 for (dp = buf2, bp = tp->Strings[from_ptr->nte_index]; *bp; bp++) {
871 if (bp[0] == '$' && bp[1] == '<') {
872 while (*bp && *bp != '>') {
880 tp->Strings[to_ptr->nte_index] = _nc_save_str(buf2);
884 * Note: ko=im and ko=ic both want to grab the `Insert'
885 * keycap. There's a kich1 but no ksmir, so the ic capability
886 * got mapped to kich1 and im to kIC to avoid a collision.
887 * If the description has im but not ic, hack kIC back to kich1.
889 if (foundim && WANTED(key_ic) && key_sic) {
891 key_sic = ABSENT_STRING;
897 if (WANTED(key_backspace))
898 key_backspace = _nc_save_str(C_BS);
899 if (WANTED(key_left))
900 key_left = _nc_save_str(C_BS);
901 if (WANTED(key_down))
902 key_down = _nc_save_str(C_LF);
907 * Translate XENIX forms characters.
909 if (PRESENT(acs_ulcorner) ||
910 PRESENT(acs_llcorner) ||
911 PRESENT(acs_urcorner) ||
912 PRESENT(acs_lrcorner) ||
917 PRESENT(acs_hline) ||
918 PRESENT(acs_vline) ||
920 char buf2[MAX_TERMCAP_LENGTH];
922 _nc_str_init(&result, buf2, sizeof(buf2));
923 _nc_safe_strcat(&result, acs_chars);
925 append_acs(&result, 'j', acs_lrcorner);
926 append_acs(&result, 'k', acs_urcorner);
927 append_acs(&result, 'l', acs_ulcorner);
928 append_acs(&result, 'm', acs_llcorner);
929 append_acs(&result, 'n', acs_plus);
930 append_acs(&result, 'q', acs_hline);
931 append_acs(&result, 't', acs_ltee);
932 append_acs(&result, 'u', acs_rtee);
933 append_acs(&result, 'v', acs_btee);
934 append_acs(&result, 'w', acs_ttee);
935 append_acs(&result, 'x', acs_vline);
938 acs_chars = _nc_save_str(buf2);
939 _nc_warning("acsc string synthesized from XENIX capabilities");
941 } else if (acs_chars == 0
942 && enter_alt_charset_mode != 0
943 && exit_alt_charset_mode != 0) {
944 acs_chars = _nc_save_str(VT_ACSC);
949 postprocess_terminfo(TERMTYPE2 *tp)
952 * TERMINFO-TO-TERMINFO MAPPINGS FOR SOURCE TRANSLATION
953 * ----------------------------------------------------------------------
957 * Translate AIX forms characters.
959 if (PRESENT(box_chars_1)) {
960 char buf2[MAX_TERMCAP_LENGTH];
963 _nc_str_init(&result, buf2, sizeof(buf2));
964 _nc_safe_strcat(&result, acs_chars);
966 append_acs0(&result, 'l', box_chars_1[0]); /* ACS_ULCORNER */
967 append_acs0(&result, 'q', box_chars_1[1]); /* ACS_HLINE */
968 append_acs0(&result, 'k', box_chars_1[2]); /* ACS_URCORNER */
969 append_acs0(&result, 'x', box_chars_1[3]); /* ACS_VLINE */
970 append_acs0(&result, 'j', box_chars_1[4]); /* ACS_LRCORNER */
971 append_acs0(&result, 'm', box_chars_1[5]); /* ACS_LLCORNER */
972 append_acs0(&result, 'w', box_chars_1[6]); /* ACS_TTEE */
973 append_acs0(&result, 'u', box_chars_1[7]); /* ACS_RTEE */
974 append_acs0(&result, 'v', box_chars_1[8]); /* ACS_BTEE */
975 append_acs0(&result, 't', box_chars_1[9]); /* ACS_LTEE */
976 append_acs0(&result, 'n', box_chars_1[10]); /* ACS_PLUS */
979 acs_chars = _nc_save_str(buf2);
980 _nc_warning("acsc string synthesized from AIX capabilities");
981 box_chars_1 = ABSENT_STRING;
985 * ----------------------------------------------------------------------
990 * Do a linear search through the terminfo tables to find a given full-name.
991 * We don't expect to do this often, so there's no hashing function.
993 * In effect, this scans through the 3 lists of full-names, and looks them
994 * up in _nc_info_table, which is organized so that the nte_index fields are
995 * sorted, but the nte_type fields are not necessarily grouped together.
997 static struct name_table_entry const *
998 lookup_fullname(const char *find)
1004 NCURSES_CONST char *const *names;
1020 for (count = 0; names[count] != 0; count++) {
1021 if (!strcmp(names[count], find)) {
1022 struct name_table_entry const *entry_ptr = _nc_get_table(FALSE);
1023 while (entry_ptr->nte_type != state
1024 || entry_ptr->nte_index != count)
1032 /* parse_entry.c ends here */