1 /****************************************************************************
2 * Copyright (c) 1998-2008,2009 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>
49 #include <term_entry.h>
51 MODULE_ID("$Id: parse_entry.c,v 1.71 2009/07/11 18:14:21 tom Exp $")
54 static short const parametrized[] =
57 #include <parametrized.h>
60 static void postprocess_termcap(TERMTYPE *, bool);
61 static void postprocess_terminfo(TERMTYPE *);
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, char *name, int token_type)
69 static struct name_table_entry temp;
70 TERMTYPE *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 tp->Booleans = typeRealloc(NCURSES_SBOOL, tp->num_Booleans, tp->Booleans);
150 for_each_value(tp->num_Booleans)
151 tp->Booleans[last] = tp->Booleans[last - 1];
156 tp->Numbers = typeRealloc(short, tp->num_Numbers, tp->Numbers);
157 for_each_value(tp->num_Numbers)
158 tp->Numbers[last] = tp->Numbers[last - 1];
163 tp->Strings = typeRealloc(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 tp->ext_Names = typeRealloc(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;
182 #endif /* NCURSES_XNAMES */
186 * _nc_parse_entry(entry, literal, silent)
188 * Compile one entry. Doesn't try to resolve use or tc capabilities.
190 * found-forward-use = FALSE
191 * re-initialise internal arrays
193 * if the token was not a name in column 1, complain and die
194 * save names in entry's string table
195 * while (get_token() is not EOF and not NAMES)
196 * check for existence and type-correctness
197 * enter cap into structure
199 * save string in entry's string table
203 #define BAD_TC_USAGE if (!bad_tc_usage) \
204 { bad_tc_usage = TRUE; \
205 _nc_warning("Legacy termcap allows only a trailing tc= clause"); }
208 _nc_parse_entry(struct entry *entryp, int literal, bool silent)
211 struct name_table_entry const *entry_ptr;
213 bool bad_tc_usage = FALSE;
215 token_type = _nc_get_token(silent);
217 if (token_type == EOF)
219 if (token_type != NAMES)
220 _nc_err_abort("Entry does not start with terminal names in column one");
222 _nc_init_entry(&entryp->tterm);
224 entryp->cstart = _nc_comment_start;
225 entryp->cend = _nc_comment_end;
226 entryp->startline = _nc_start_line;
227 DEBUG(2, ("Comment range is %ld to %ld", entryp->cstart, entryp->cend));
230 * Strip off the 2-character termcap name, if present. Originally termcap
231 * used that as an indexing aid. We can retain 2-character terminfo names,
232 * but note that they would be lost if we translate to/from termcap. This
233 * feature is supposedly obsolete since "newer" BSD implementations do not
234 * use it; however our reference for this feature is SunOS 4.x, which
235 * implemented it. Note that the resulting terminal type was never the
236 * 2-character name, but was instead the first alias after that.
238 ptr = _nc_curr_token.tk_name;
239 if (_nc_syntax == SYN_TERMCAP
241 && !_nc_user_definable
246 _nc_curr_token.tk_name[2] = '\0';
250 entryp->tterm.str_table = entryp->tterm.term_names = _nc_save_str(ptr);
252 if (entryp->tterm.str_table == 0)
255 DEBUG(1, ("Starting '%s'", ptr));
258 * We do this because the one-token lookahead in the parse loop
259 * results in the terminal type getting prematurely set to correspond
260 * to that of the next entry.
262 _nc_set_type(_nc_first_name(entryp->tterm.term_names));
264 /* check for overly-long names and aliases */
265 for (base = entryp->tterm.term_names; (ptr = strchr(base, '|')) != 0;
267 if (ptr - base > MAX_ALIAS) {
268 _nc_warning("%s `%.*s' may be too long",
269 (base == entryp->tterm.term_names)
272 (int) (ptr - base), base);
278 for (token_type = _nc_get_token(silent);
279 token_type != EOF && token_type != NAMES;
280 token_type = _nc_get_token(silent)) {
281 bool is_use = (strcmp(_nc_curr_token.tk_name, "use") == 0);
282 bool is_tc = !is_use && (strcmp(_nc_curr_token.tk_name, "tc") == 0);
283 if (is_use || is_tc) {
284 entryp->uses[entryp->nuses].name = _nc_save_str(_nc_curr_token.tk_valstring);
285 entryp->uses[entryp->nuses].line = _nc_curr_line;
287 if (entryp->nuses > 1 && is_tc) {
291 /* normal token lookup */
292 entry_ptr = _nc_find_entry(_nc_curr_token.tk_name,
293 _nc_get_hash_table(_nc_syntax));
296 * Our kluge to handle aliasing. The reason it's done
297 * this ugly way, with a linear search, is so the hashing
298 * machinery doesn't have to be made really complicated
299 * (also we get better warnings this way). No point in
300 * making this case fast, aliased caps aren't common now
301 * and will get rarer.
303 if (entry_ptr == NOTFOUND) {
304 const struct alias *ap;
306 if (_nc_syntax == SYN_TERMCAP) {
307 if (entryp->nuses != 0) {
310 for (ap = _nc_get_alias_table(TRUE); ap->from; ap++)
311 if (strcmp(ap->from, _nc_curr_token.tk_name) == 0) {
312 if (ap->to == (char *) 0) {
313 _nc_warning("%s (%s termcap extension) ignored",
314 ap->from, ap->source);
318 entry_ptr = _nc_find_entry(ap->to,
319 _nc_get_hash_table(TRUE));
320 if (entry_ptr && !silent)
321 _nc_warning("%s (%s termcap extension) aliased to %s",
322 ap->from, ap->source, ap->to);
325 } else { /* if (_nc_syntax == SYN_TERMINFO) */
326 for (ap = _nc_get_alias_table(FALSE); ap->from; ap++)
327 if (strcmp(ap->from, _nc_curr_token.tk_name) == 0) {
328 if (ap->to == (char *) 0) {
329 _nc_warning("%s (%s terminfo extension) ignored",
330 ap->from, ap->source);
334 entry_ptr = _nc_find_entry(ap->to,
335 _nc_get_hash_table(FALSE));
336 if (entry_ptr && !silent)
337 _nc_warning("%s (%s terminfo extension) aliased to %s",
338 ap->from, ap->source, ap->to);
342 if (entry_ptr == NOTFOUND) {
343 entry_ptr = lookup_fullname(_nc_curr_token.tk_name);
349 * If we have extended-names active, we will automatically
350 * define a name based on its context.
352 if (entry_ptr == NOTFOUND
353 && _nc_user_definable
354 && (entry_ptr = _nc_extend_names(entryp,
355 _nc_curr_token.tk_name,
357 if (_nc_tracing >= DEBUG_LEVEL(1))
358 _nc_warning("extended capability '%s'", _nc_curr_token.tk_name);
360 #endif /* NCURSES_XNAMES */
362 /* can't find this cap name, not even as an alias */
363 if (entry_ptr == NOTFOUND) {
365 _nc_warning("unknown capability '%s'",
366 _nc_curr_token.tk_name);
370 /* deal with bad type/value combinations. */
371 if (token_type != CANCEL && entry_ptr->nte_type != token_type) {
373 * Nasty special cases here handle situations in which type
374 * information can resolve name clashes. Normal lookup
375 * finds the last instance in the capability table of a
376 * given name, regardless of type. find_type_entry looks
377 * for a first matching instance with given type. So as
378 * long as all ambiguous names occur in pairs of distinct
379 * type, this will do the job.
382 if (token_type == NUMBER
383 && !strcmp("ma", _nc_curr_token.tk_name)) {
384 /* tell max_attributes from arrow_key_map */
385 entry_ptr = _nc_find_type_entry("ma", NUMBER,
387 assert(entry_ptr != 0);
389 } else if (token_type == STRING
390 && !strcmp("MT", _nc_curr_token.tk_name)) {
391 /* map terminfo's string MT to MT */
392 entry_ptr = _nc_find_type_entry("MT", STRING,
394 assert(entry_ptr != 0);
396 } else if (token_type == BOOLEAN
397 && entry_ptr->nte_type == STRING) {
398 /* treat strings without following "=" as empty strings */
401 /* we couldn't recover; skip this token */
403 const char *type_name;
404 switch (entry_ptr->nte_type) {
406 type_name = "boolean";
409 type_name = "string";
412 type_name = "numeric";
415 type_name = "unknown";
418 _nc_warning("wrong type used for %s capability '%s'",
419 type_name, _nc_curr_token.tk_name);
425 /* now we know that the type/value combination is OK */
426 switch (token_type) {
428 switch (entry_ptr->nte_type) {
430 entryp->tterm.Booleans[entry_ptr->nte_index] = CANCELLED_BOOLEAN;
434 entryp->tterm.Numbers[entry_ptr->nte_index] = CANCELLED_NUMERIC;
438 entryp->tterm.Strings[entry_ptr->nte_index] = CANCELLED_STRING;
444 entryp->tterm.Booleans[entry_ptr->nte_index] = TRUE;
448 entryp->tterm.Numbers[entry_ptr->nte_index] =
449 (short) _nc_curr_token.tk_valnumber;
453 ptr = _nc_curr_token.tk_valstring;
454 if (_nc_syntax == SYN_TERMCAP)
455 ptr = _nc_captoinfo(_nc_curr_token.tk_name,
457 parametrized[entry_ptr->nte_index]);
458 entryp->tterm.Strings[entry_ptr->nte_index] = _nc_save_str(ptr);
463 _nc_warning("unknown token type");
464 _nc_panic_mode((char) ((_nc_syntax == SYN_TERMCAP) ? ':' : ','));
467 } /* end else cur_token.name != "use" */
469 continue; /* cannot have a label w/o statement */
470 } /* endwhile (not EOF and not NAMES) */
472 _nc_push_token(token_type);
473 _nc_set_type(_nc_first_name(entryp->tterm.term_names));
476 * Try to deduce as much as possible from extension capabilities
477 * (this includes obsolete BSD capabilities). Sigh...it would be more
478 * space-efficient to call this after use resolution, but it has
479 * to be done before entry allocation is wrapped up.
482 if (_nc_syntax == SYN_TERMCAP) {
483 bool has_base_entry = FALSE;
487 * Don't insert defaults if this is a `+' entry meant only
488 * for inclusion in other entries (not sure termcap ever
489 * had these, actually).
491 if (strchr(entryp->tterm.term_names, '+'))
492 has_base_entry = TRUE;
495 * Otherwise, look for a base entry that will already
496 * have picked up defaults via translation.
498 for (i = 0; i < entryp->nuses; i++)
499 if (!strchr((char *) entryp->uses[i].name, '+'))
500 has_base_entry = TRUE;
502 postprocess_termcap(&entryp->tterm, has_base_entry);
504 postprocess_terminfo(&entryp->tterm);
506 _nc_wrap_entry(entryp, FALSE);
512 _nc_capcmp(const char *s, const char *t)
513 /* compare two string capabilities, stripping out padding */
521 if (s[0] == '$' && s[1] == '<') {
523 if (!(isdigit(UChar(*s))
531 if (t[0] == '$' && t[1] == '<') {
533 if (!(isdigit(UChar(*t))
541 /* we've now pushed s and t past any padding they were pointing at */
543 if (*s == '\0' && *t == '\0')
549 /* else *s == *t but one is not NUL, so continue */
555 append_acs0(string_desc * dst, int code, int src)
559 temp[0] = (char) code;
560 temp[1] = (char) src;
562 _nc_safe_strcat(dst, temp);
567 append_acs(string_desc * dst, int code, char *src)
569 if (src != 0 && strlen(src) == 1) {
570 append_acs0(dst, code, *src);
575 * The ko capability, if present, consists of a comma-separated capability
576 * list. For each capability, we may assume there is a keycap that sends the
577 * string which is the value of that capability.
583 static assoc const ko_xlate[] =
585 {"al", "kil1"}, /* insert line key -> KEY_IL */
586 {"bt", "kcbt"}, /* back tab -> KEY_BTAB */
587 {"cd", "ked"}, /* clear-to-eos key -> KEY_EOL */
588 {"ce", "kel"}, /* clear-to-eol key -> KEY_EOS */
589 {"cl", "kclr"}, /* clear key -> KEY_CLEAR */
590 {"ct", "tbc"}, /* clear all tabs -> KEY_CATAB */
591 {"dc", "kdch1"}, /* delete char -> KEY_DC */
592 {"dl", "kdl1"}, /* delete line -> KEY_DL */
593 {"do", "kcud1"}, /* down key -> KEY_DOWN */
594 {"ei", "krmir"}, /* exit insert key -> KEY_EIC */
595 {"ho", "khome"}, /* home key -> KEY_HOME */
596 {"ic", "kich1"}, /* insert char key -> KEY_IC */
597 {"im", "kIC"}, /* insert-mode key -> KEY_SIC */
598 {"le", "kcub1"}, /* le key -> KEY_LEFT */
599 {"nd", "kcuf1"}, /* nd key -> KEY_RIGHT */
600 {"nl", "kent"}, /* new line key -> KEY_ENTER */
601 {"st", "khts"}, /* set-tab key -> KEY_STAB */
602 {"ta", CANCELLED_STRING},
603 {"up", "kcuu1"}, /* up-arrow key -> KEY_UP */
604 {(char *) 0, (char *) 0},
608 * This routine fills in string caps that either had defaults under
609 * termcap or can be manufactured from obsolete termcap capabilities.
610 * It was lifted from Ross Ridge's mytinfo package.
613 static const char C_CR[] = "\r";
614 static const char C_LF[] = "\n";
615 static const char C_BS[] = "\b";
616 static const char C_HT[] = "\t";
619 * Note that WANTED and PRESENT are not simple inverses! If a capability
620 * has been explicitly cancelled, it's not considered WANTED.
622 #define WANTED(s) ((s) == ABSENT_STRING)
623 #define PRESENT(s) (((s) != ABSENT_STRING) && ((s) != CANCELLED_STRING))
626 * This bit of legerdemain turns all the terminfo variable names into
627 * references to locations in the arrays Booleans, Numbers, and Strings ---
628 * precisely what's needed.
635 postprocess_termcap(TERMTYPE *tp, bool has_base)
637 char buf[MAX_LINE * 2 + 2];
641 * TERMCAP DEFAULTS AND OBSOLETE-CAPABILITY TRANSLATIONS
643 * This first part of the code is the functional inverse of the
644 * fragment in capdefaults.c.
645 * ----------------------------------------------------------------------
648 /* if there was a tc entry, assume we picked up defaults via that */
650 if (WANTED(init_3string) && termcap_init2)
651 init_3string = _nc_save_str(termcap_init2);
653 if (WANTED(reset_2string) && termcap_reset)
654 reset_2string = _nc_save_str(termcap_reset);
656 if (WANTED(carriage_return)) {
657 if (carriage_return_delay > 0) {
658 sprintf(buf, "%s$<%d>", C_CR, carriage_return_delay);
659 carriage_return = _nc_save_str(buf);
661 carriage_return = _nc_save_str(C_CR);
663 if (WANTED(cursor_left)) {
664 if (backspace_delay > 0) {
665 sprintf(buf, "%s$<%d>", C_BS, backspace_delay);
666 cursor_left = _nc_save_str(buf);
667 } else if (backspaces_with_bs == 1)
668 cursor_left = _nc_save_str(C_BS);
669 else if (PRESENT(backspace_if_not_bs))
670 cursor_left = backspace_if_not_bs;
672 /* vi doesn't use "do", but it does seems to use nl (or '\n') instead */
673 if (WANTED(cursor_down)) {
674 if (PRESENT(linefeed_if_not_lf))
675 cursor_down = linefeed_if_not_lf;
676 else if (linefeed_is_newline != 1) {
677 if (new_line_delay > 0) {
678 sprintf(buf, "%s$<%d>", C_LF, new_line_delay);
679 cursor_down = _nc_save_str(buf);
681 cursor_down = _nc_save_str(C_LF);
684 if (WANTED(scroll_forward) && crt_no_scrolling != 1) {
685 if (PRESENT(linefeed_if_not_lf))
686 cursor_down = linefeed_if_not_lf;
687 else if (linefeed_is_newline != 1) {
688 if (new_line_delay > 0) {
689 sprintf(buf, "%s$<%d>", C_LF, new_line_delay);
690 scroll_forward = _nc_save_str(buf);
692 scroll_forward = _nc_save_str(C_LF);
695 if (WANTED(newline)) {
696 if (linefeed_is_newline == 1) {
697 if (new_line_delay > 0) {
698 sprintf(buf, "%s$<%d>", C_LF, new_line_delay);
699 newline = _nc_save_str(buf);
701 newline = _nc_save_str(C_LF);
702 } else if (PRESENT(carriage_return) && PRESENT(scroll_forward)) {
703 _nc_str_init(&result, buf, sizeof(buf));
704 if (_nc_safe_strcat(&result, carriage_return)
705 && _nc_safe_strcat(&result, scroll_forward))
706 newline = _nc_save_str(buf);
707 } else if (PRESENT(carriage_return) && PRESENT(cursor_down)) {
708 _nc_str_init(&result, buf, sizeof(buf));
709 if (_nc_safe_strcat(&result, carriage_return)
710 && _nc_safe_strcat(&result, cursor_down))
711 newline = _nc_save_str(buf);
717 * Inverse of capdefaults.c code ends here.
718 * ----------------------------------------------------------------------
720 * TERMCAP-TO TERMINFO MAPPINGS FOR SOURCE TRANSLATION
722 * These translations will *not* be inverted by tgetent().
727 * We wait until now to decide if we've got a working cr because even
728 * one that doesn't work can be used for newline. Unfortunately the
729 * space allocated for it is wasted.
731 if (return_does_clr_eol == 1 || no_correctly_working_cr == 1)
732 carriage_return = ABSENT_STRING;
735 * Supposedly most termcap entries have ta now and '\t' is no longer a
736 * default, but it doesn't seem to be true...
739 if (horizontal_tab_delay > 0) {
740 sprintf(buf, "%s$<%d>", C_HT, horizontal_tab_delay);
741 tab = _nc_save_str(buf);
743 tab = _nc_save_str(C_HT);
745 if (init_tabs == ABSENT_NUMERIC && has_hardware_tabs == TRUE)
749 * Assume we can beep with ^G unless we're given bl@.
752 bell = _nc_save_str("\007");
756 * Translate the old termcap :pt: capability to it#8 + ht=\t
758 if (has_hardware_tabs == TRUE) {
759 if (init_tabs != 8 && init_tabs != ABSENT_NUMERIC)
760 _nc_warning("hardware tabs with a width other than 8: %d", init_tabs);
762 if (tab && _nc_capcmp(tab, C_HT))
763 _nc_warning("hardware tabs with a non-^I tab string %s",
767 tab = _nc_save_str(C_HT);
773 * Now translate the ko capability, if there is one. This
774 * isn't from mytinfo...
776 if (PRESENT(other_non_function_keys)) {
777 char *base = other_non_function_keys;
779 struct name_table_entry const *from_ptr;
780 struct name_table_entry const *to_ptr;
782 char buf2[MAX_TERMINFO_LENGTH];
785 /* we're going to use this for a special case later */
786 dp = strchr(other_non_function_keys, 'i');
787 foundim = (dp != 0) && (dp[1] == 'm');
789 /* look at each comma-separated capability in the ko string... */
790 for (base = other_non_function_keys;
791 (cp = strchr(base, ',')) != 0;
793 size_t len = (unsigned) (cp - base);
795 for (ap = ko_xlate; ap->from; ap++) {
796 if (len == strlen(ap->from)
797 && strncmp(ap->from, base, len) == 0)
800 if (!(ap->from && ap->to)) {
801 _nc_warning("unknown capability `%.*s' in ko string",
804 } else if (ap->to == CANCELLED_STRING) /* ignore it */
807 /* now we know we found a match in ko_table, so... */
809 from_ptr = _nc_find_entry(ap->from, _nc_get_hash_table(TRUE));
810 to_ptr = _nc_find_entry(ap->to, _nc_get_hash_table(FALSE));
812 if (!from_ptr || !to_ptr) /* should never happen! */
813 _nc_err_abort("ko translation table is invalid, I give up");
815 if (WANTED(tp->Strings[from_ptr->nte_index])) {
816 _nc_warning("no value for ko capability %s", ap->from);
820 if (tp->Strings[to_ptr->nte_index]) {
821 /* There's no point in warning about it if it's the same
822 * string; that's just an inefficiency.
825 tp->Strings[from_ptr->nte_index],
826 tp->Strings[to_ptr->nte_index]) != 0)
827 _nc_warning("%s (%s) already has an explicit value %s, ignoring ko",
829 _nc_visbuf(tp->Strings[to_ptr->nte_index]));
834 * The magic moment -- copy the mapped key string over,
835 * stripping out padding.
837 for (dp = buf2, bp = tp->Strings[from_ptr->nte_index]; *bp; bp++) {
838 if (bp[0] == '$' && bp[1] == '<') {
839 while (*bp && *bp != '>') {
847 tp->Strings[to_ptr->nte_index] = _nc_save_str(buf2);
851 * Note: ko=im and ko=ic both want to grab the `Insert'
852 * keycap. There's a kich1 but no ksmir, so the ic capability
853 * got mapped to kich1 and im to kIC to avoid a collision.
854 * If the description has im but not ic, hack kIC back to kich1.
856 if (foundim && WANTED(key_ic) && key_sic) {
858 key_sic = ABSENT_STRING;
864 if (WANTED(key_backspace))
865 key_backspace = _nc_save_str(C_BS);
866 if (WANTED(key_left))
867 key_left = _nc_save_str(C_BS);
868 if (WANTED(key_down))
869 key_down = _nc_save_str(C_LF);
874 * Translate XENIX forms characters.
876 if (PRESENT(acs_ulcorner) ||
877 PRESENT(acs_llcorner) ||
878 PRESENT(acs_urcorner) ||
879 PRESENT(acs_lrcorner) ||
884 PRESENT(acs_hline) ||
885 PRESENT(acs_vline) ||
887 char buf2[MAX_TERMCAP_LENGTH];
889 _nc_str_init(&result, buf2, sizeof(buf2));
890 _nc_safe_strcat(&result, acs_chars);
892 append_acs(&result, 'j', acs_lrcorner);
893 append_acs(&result, 'k', acs_urcorner);
894 append_acs(&result, 'l', acs_ulcorner);
895 append_acs(&result, 'm', acs_llcorner);
896 append_acs(&result, 'n', acs_plus);
897 append_acs(&result, 'q', acs_hline);
898 append_acs(&result, 't', acs_ltee);
899 append_acs(&result, 'u', acs_rtee);
900 append_acs(&result, 'v', acs_btee);
901 append_acs(&result, 'w', acs_ttee);
902 append_acs(&result, 'x', acs_vline);
905 acs_chars = _nc_save_str(buf2);
906 _nc_warning("acsc string synthesized from XENIX capabilities");
908 } else if (acs_chars == 0
909 && enter_alt_charset_mode != 0
910 && exit_alt_charset_mode != 0) {
911 acs_chars = _nc_save_str(VT_ACSC);
916 postprocess_terminfo(TERMTYPE *tp)
919 * TERMINFO-TO-TERMINFO MAPPINGS FOR SOURCE TRANSLATION
920 * ----------------------------------------------------------------------
924 * Translate AIX forms characters.
926 if (PRESENT(box_chars_1)) {
927 char buf2[MAX_TERMCAP_LENGTH];
930 _nc_str_init(&result, buf2, sizeof(buf2));
931 _nc_safe_strcat(&result, acs_chars);
933 append_acs0(&result, 'l', box_chars_1[0]); /* ACS_ULCORNER */
934 append_acs0(&result, 'q', box_chars_1[1]); /* ACS_HLINE */
935 append_acs0(&result, 'k', box_chars_1[2]); /* ACS_URCORNER */
936 append_acs0(&result, 'x', box_chars_1[3]); /* ACS_VLINE */
937 append_acs0(&result, 'j', box_chars_1[4]); /* ACS_LRCORNER */
938 append_acs0(&result, 'm', box_chars_1[5]); /* ACS_LLCORNER */
939 append_acs0(&result, 'w', box_chars_1[6]); /* ACS_TTEE */
940 append_acs0(&result, 'u', box_chars_1[7]); /* ACS_RTEE */
941 append_acs0(&result, 'v', box_chars_1[8]); /* ACS_BTEE */
942 append_acs0(&result, 't', box_chars_1[9]); /* ACS_LTEE */
943 append_acs0(&result, 'n', box_chars_1[10]); /* ACS_PLUS */
946 acs_chars = _nc_save_str(buf2);
947 _nc_warning("acsc string synthesized from AIX capabilities");
948 box_chars_1 = ABSENT_STRING;
952 * ----------------------------------------------------------------------
957 * Do a linear search through the terminfo tables to find a given full-name.
958 * We don't expect to do this often, so there's no hashing function.
960 * In effect, this scans through the 3 lists of full-names, and looks them
961 * up in _nc_info_table, which is organized so that the nte_index fields are
962 * sorted, but the nte_type fields are not necessarily grouped together.
964 static struct name_table_entry const *
965 lookup_fullname(const char *find)
971 NCURSES_CONST char *const *names;
987 for (count = 0; names[count] != 0; count++) {
988 if (!strcmp(names[count], find)) {
989 struct name_table_entry const *entry_ptr = _nc_get_table(FALSE);
990 while (entry_ptr->nte_type != state
991 || entry_ptr->nte_index != count)
999 /* parse_entry.c ends here */