1 /****************************************************************************
2 * Copyright (c) 1998-2012,2013 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 ****************************************************************************/
35 #define __INTERNAL_CAPS_VISIBLE
36 #include <progs.priv.h>
38 #include "dump_entry.h"
39 #include "termsort.c" /* this C file is generated */
40 #include <parametrized.h> /* so is this */
42 MODULE_ID("$Id: dump_entry.c,v 1.107 2013/03/17 00:27:15 tom Exp $")
45 #define DISCARD(string) string = ABSENT_STRING
46 #define PRINTF (void) printf
48 #define OkIndex(index,array) ((int)(index) >= 0 && (int)(index) < (int) SIZEOF(array))
56 static int tversion; /* terminfo version */
57 static int outform; /* output format to use */
58 static int sortmode; /* sort mode to use */
59 static int width = 60; /* max line width for listings */
60 static int height = 65535; /* max number of lines for listings */
61 static int column; /* current column, limited by 'width' */
62 static int oldcol; /* last value of column before wrap */
63 static bool pretty; /* true if we format if-then-else strings */
65 static char *save_sgr;
70 /* indirection pointers for implementing sort and display modes */
71 static const PredIdx *bool_indirect, *num_indirect, *str_indirect;
72 static NCURSES_CONST char *const *bool_names;
73 static NCURSES_CONST char *const *num_names;
74 static NCURSES_CONST char *const *str_names;
76 static const char *separator, *trailer;
78 /* cover various ports and variants of terminfo */
79 #define V_ALLCAPS 0 /* all capabilities (SVr4, XSI, ncurses) */
80 #define V_SVR1 1 /* SVR1, Ultrix */
81 #define V_HPUX 2 /* HP/UX */
82 #define V_AIX 3 /* AIX */
83 #define V_BSD 4 /* BSD */
86 #define OBSOLETE(n) (!_nc_user_definable && (n[0] == 'O' && n[1] == 'T'))
88 #define OBSOLETE(n) (n[0] == 'O' && n[1] == 'T')
91 #define isObsolete(f,n) ((f == F_TERMINFO || f == F_VARIABLE) && OBSOLETE(n))
94 #define BoolIndirect(j) ((j >= BOOLCOUNT) ? (j) : ((sortmode == S_NOSORT) ? j : bool_indirect[j]))
95 #define NumIndirect(j) ((j >= NUMCOUNT) ? (j) : ((sortmode == S_NOSORT) ? j : num_indirect[j]))
96 #define StrIndirect(j) ((j >= STRCOUNT) ? (j) : ((sortmode == S_NOSORT) ? j : str_indirect[j]))
98 #define BoolIndirect(j) ((sortmode == S_NOSORT) ? (j) : bool_indirect[j])
99 #define NumIndirect(j) ((sortmode == S_NOSORT) ? (j) : num_indirect[j])
100 #define StrIndirect(j) ((sortmode == S_NOSORT) ? (j) : str_indirect[j])
103 static void failed(const char *) GCC_NORETURN;
106 failed(const char *s)
109 ExitProgram(EXIT_FAILURE);
113 strncpy_DYN(DYNBUF * dst, const char *src, size_t need)
115 size_t want = need + dst->used + 1;
116 if (want > dst->size) {
117 dst->size += (want + 1024); /* be generous */
118 dst->text = typeRealloc(char, dst->size, dst->text);
120 failed("strncpy_DYN");
122 (void) strncpy(dst->text + dst->used, src, need);
124 dst->text[dst->used] = 0;
128 strcpy_DYN(DYNBUF * dst, const char *src)
134 strncpy_DYN(dst, src, strlen(src));
150 _nc_leaks_dump_entry(void)
157 #define NameTrans(check,result) \
158 if (OkIndex(np->nte_index, check) \
159 && check[np->nte_index]) \
160 return (result[np->nte_index])
163 nametrans(const char *name)
164 /* translate a capability name from termcap to terminfo */
166 const struct name_table_entry *np;
168 if ((np = _nc_find_entry(name, _nc_get_hash_table(0))) != 0)
169 switch (np->nte_type) {
171 NameTrans(bool_from_termcap, boolcodes);
175 NameTrans(num_from_termcap, numcodes);
179 NameTrans(str_from_termcap, strcodes);
187 dump_init(const char *version,
194 /* set up for entry display */
202 tversion = V_ALLCAPS;
203 else if (!strcmp(version, "SVr1") || !strcmp(version, "SVR1")
204 || !strcmp(version, "Ultrix"))
206 else if (!strcmp(version, "HP"))
208 else if (!strcmp(version, "AIX"))
210 else if (!strcmp(version, "BSD"))
213 tversion = V_ALLCAPS;
215 /* implement display modes */
216 switch (outform = mode) {
219 bool_names = boolnames;
220 num_names = numnames;
221 str_names = strnames;
222 separator = (twidth > 0 && theight > 1) ? ", " : ",";
227 bool_names = boolfnames;
228 num_names = numfnames;
229 str_names = strfnames;
230 separator = (twidth > 0 && theight > 1) ? ", " : ",";
236 bool_names = boolcodes;
237 num_names = numcodes;
238 str_names = strcodes;
244 /* implement sort modes */
245 switch (sortmode = sort) {
248 (void) fprintf(stderr,
249 "%s: sorting by term structure order\n", _nc_progname);
254 (void) fprintf(stderr,
255 "%s: sorting by terminfo name order\n", _nc_progname);
256 bool_indirect = bool_terminfo_sort;
257 num_indirect = num_terminfo_sort;
258 str_indirect = str_terminfo_sort;
263 (void) fprintf(stderr,
264 "%s: sorting by C variable order\n", _nc_progname);
265 bool_indirect = bool_variable_sort;
266 num_indirect = num_variable_sort;
267 str_indirect = str_variable_sort;
272 (void) fprintf(stderr,
273 "%s: sorting by termcap name order\n", _nc_progname);
274 bool_indirect = bool_termcap_sort;
275 num_indirect = num_termcap_sort;
276 str_indirect = str_termcap_sort;
281 (void) fprintf(stderr,
282 "%s: width = %d, tversion = %d, outform = %d\n",
283 _nc_progname, width, tversion, outform);
286 static TERMTYPE *cur_type;
289 dump_predicate(PredType type, PredIdx idx)
290 /* predicate function to use for ordinary decompilation */
294 return (cur_type->Booleans[idx] == FALSE)
295 ? FAIL : cur_type->Booleans[idx];
298 return (cur_type->Numbers[idx] == ABSENT_NUMERIC)
299 ? FAIL : cur_type->Numbers[idx];
302 return (cur_type->Strings[idx] != ABSENT_STRING)
306 return (FALSE); /* pacify compiler */
309 static void set_obsolete_termcaps(TERMTYPE *tp);
311 /* is this the index of a function key string? */
312 #define FNKEY(i) (((i)<= 65 && (i)>= 75) || ((i)<= 216 && (i)>= 268))
315 * If we configure with a different Caps file, the offsets into the arrays
316 * will change. So we use an address expression.
318 #define BOOL_IDX(name) (PredType) (&(name) - &(CUR Booleans[0]))
319 #define NUM_IDX(name) (PredType) (&(name) - &(CUR Numbers[0]))
320 #define STR_IDX(name) (PredType) (&(name) - &(CUR Strings[0]))
323 version_filter(PredType type, PredIdx idx)
324 /* filter out capabilities we may want to suppress */
327 case V_ALLCAPS: /* SVr4, XSI Curses */
330 case V_SVR1: /* System V Release 1, Ultrix */
333 return ((idx <= BOOL_IDX(xon_xoff)) ? TRUE : FALSE);
335 return ((idx <= NUM_IDX(width_status_line)) ? TRUE : FALSE);
337 return ((idx <= STR_IDX(prtr_non)) ? TRUE : FALSE);
341 case V_HPUX: /* Hewlett-Packard */
344 return ((idx <= BOOL_IDX(xon_xoff)) ? TRUE : FALSE);
346 return ((idx <= NUM_IDX(label_width)) ? TRUE : FALSE);
348 if (idx <= STR_IDX(prtr_non))
350 else if (FNKEY(idx)) /* function keys */
352 else if (idx == STR_IDX(plab_norm)
353 || idx == STR_IDX(label_on)
354 || idx == STR_IDX(label_off))
361 case V_AIX: /* AIX */
364 return ((idx <= BOOL_IDX(xon_xoff)) ? TRUE : FALSE);
366 return ((idx <= NUM_IDX(width_status_line)) ? TRUE : FALSE);
368 if (idx <= STR_IDX(prtr_non))
370 else if (FNKEY(idx)) /* function keys */
377 #define is_termcap(type) (OkIndex(idx, type##_from_termcap) && \
378 type##_from_termcap[idx])
380 case V_BSD: /* BSD */
383 return is_termcap(bool);
385 return is_termcap(num);
387 return is_termcap(str);
392 return (FALSE); /* pacify the compiler */
398 while (outbuf.used > 0 && outbuf.text[outbuf.used - 1] == ' ')
399 outbuf.text[--outbuf.used] = '\0';
407 strcpy_DYN(&outbuf, trailer);
412 wrap_concat(const char *src)
414 size_t need = strlen(src);
415 size_t want = strlen(separator) + need;
418 && column + (int) want > width) {
421 strcpy_DYN(&outbuf, src);
422 strcpy_DYN(&outbuf, separator);
423 column += (int) need;
426 #define IGNORE_SEP_TRAIL(first,last,sep_trail) \
427 if ((size_t)(last - first) > sizeof(sep_trail)-1 \
428 && !strncmp(first, sep_trail, sizeof(sep_trail)-1)) \
429 first += sizeof(sep_trail)-2
431 /* Returns the nominal length of the buffer assuming it is termcap format,
432 * i.e., the continuation sequence is treated as a single character ":".
434 * There are several implementations of termcap which read the text into a
435 * fixed-size buffer. Generally they strip the newlines from the text, but may
436 * not do it until after the buffer is read. Also, "tc=" resolution may be
437 * expanded in the same buffer. This function is useful for measuring the size
438 * of the best fixed-buffer implementation; the worst case may be much worse.
440 #ifdef TEST_TERMCAP_LENGTH
442 termcap_length(const char *src)
444 static const char pattern[] = ":\\\n\t:";
447 const char *const t = src + strlen(src);
449 while (*src != '\0') {
450 IGNORE_SEP_TRAIL(src, t, pattern);
457 #define termcap_length(src) strlen(src)
461 indent_DYN(DYNBUF * buffer, int level)
465 for (n = 0; n < level; n++)
466 strncpy_DYN(buffer, "\t", 1);
470 has_params(const char *src)
473 int len = (int) strlen(src);
478 for (n = 0; n < len - 1; ++n) {
479 if (!strncmp(src + n, "%p", 2)) {
481 } else if (!strncmp(src + n, "%;", 2)) {
488 result = ((len > 50) && params);
494 fmt_complex(TERMTYPE *tterm, const char *capability, char *src, int level)
496 bool percent = FALSE;
497 bool params = has_params(src);
499 while (*src != '\0') {
503 strncpy_DYN(&tmpbuf, src++, 1);
509 case 't': /* "then" */
510 case 'e': /* "else" */
513 tmpbuf.text[tmpbuf.used - 1] = '\n';
514 /* treat a "%e" as else-if, on the same level */
516 indent_DYN(&tmpbuf, level);
517 strncpy_DYN(&tmpbuf, "%", 1);
518 strncpy_DYN(&tmpbuf, src, 1);
520 params = has_params(src);
521 if (!params && *src != '\0' && *src != '%') {
522 strncpy_DYN(&tmpbuf, "\n", 1);
523 indent_DYN(&tmpbuf, level + 1);
526 indent_DYN(&tmpbuf, level + 1);
527 strncpy_DYN(&tmpbuf, "%", 1);
528 strncpy_DYN(&tmpbuf, src, 1);
530 src = fmt_complex(tterm, capability, src, level + 1);
531 if (*src != '\0' && *src != '%') {
532 strncpy_DYN(&tmpbuf, "\n", 1);
533 indent_DYN(&tmpbuf, level + 1);
535 } else if (level == 1) {
536 _nc_warning("%s: %%%c without %%? in %s",
537 _nc_first_name(tterm->term_names),
544 case ';': /* "endif" */
548 tmpbuf.text[tmpbuf.used - 1] = '\n';
549 indent_DYN(&tmpbuf, level);
550 strncpy_DYN(&tmpbuf, "%", 1);
551 strncpy_DYN(&tmpbuf, src++, 1);
554 && (strchr("?e;", src[1])) == 0) {
555 tmpbuf.text[tmpbuf.used++] = '\n';
556 indent_DYN(&tmpbuf, level);
560 _nc_warning("%s: %%; without %%? in %s",
561 _nc_first_name(tterm->term_names),
566 if (percent && params) {
567 tmpbuf.text[tmpbuf.used - 1] = '\n';
568 indent_DYN(&tmpbuf, level + 1);
569 strncpy_DYN(&tmpbuf, "%", 1);
575 strncpy_DYN(&tmpbuf, "\\s", 2);
582 strncpy_DYN(&tmpbuf, src++, 1);
587 #define SAME_CAP(n,cap) (&tterm->Strings[n] == &cap)
591 fmt_entry(TERMTYPE *tterm,
594 bool suppress_untranslatable,
599 char buffer[MAX_TERMINFO_LENGTH + EXTRA_CAP];
601 NCURSES_CONST char *name;
603 PredIdx num_bools = 0;
604 PredIdx num_values = 0;
605 PredIdx num_strings = 0;
608 #define WRAP_CONCAT \
609 wrap_concat(buffer); \
612 len = 12; /* terminfo file-header */
616 pred = dump_predicate;
619 strcpy_DYN(&outbuf, 0);
621 column = INDENT; /* FIXME: workaround to prevent empty lines */
623 strcpy_DYN(&outbuf, tterm->term_names);
626 * Colon is legal in terminfo descriptions, but not in termcap.
629 char *p = outbuf.text;
637 strcpy_DYN(&outbuf, separator);
638 column = (int) outbuf.used;
643 for_each_boolean(j, tterm) {
645 name = ExtBoolname(tterm, (int) i, bool_names);
646 assert(strlen(name) < sizeof(buffer) - EXTRA_CAP);
648 if (!version_filter(BOOLEAN, i))
650 else if (isObsolete(outform, name))
653 predval = pred(BOOLEAN, i);
654 if (predval != FAIL) {
655 _nc_STRCPY(buffer, name, sizeof(buffer));
657 _nc_STRCAT(buffer, "@", sizeof(buffer));
658 else if (i + 1 > num_bools)
664 if (column != INDENT && height > 1)
667 for_each_number(j, tterm) {
669 name = ExtNumname(tterm, (int) i, num_names);
670 assert(strlen(name) < sizeof(buffer) - EXTRA_CAP);
672 if (!version_filter(NUMBER, i))
674 else if (isObsolete(outform, name))
677 predval = pred(NUMBER, i);
678 if (predval != FAIL) {
679 if (tterm->Numbers[i] < 0) {
680 _nc_SPRINTF(buffer, _nc_SLIMIT(sizeof(buffer))
683 _nc_SPRINTF(buffer, _nc_SLIMIT(sizeof(buffer))
684 "%s#%d", name, tterm->Numbers[i]);
685 if (i + 1 > num_values)
692 if (column != INDENT && height > 1)
695 len += (int) (num_bools
697 + strlen(tterm->term_names) + 1);
703 if (outform == F_TERMCAP) {
704 if (termcap_reset != ABSENT_STRING) {
705 if (init_3string != ABSENT_STRING
706 && !strcmp(init_3string, termcap_reset))
707 DISCARD(init_3string);
709 if (reset_2string != ABSENT_STRING
710 && !strcmp(reset_2string, termcap_reset))
711 DISCARD(reset_2string);
715 for_each_string(j, tterm) {
717 name = ExtStrname(tterm, (int) i, str_names);
718 assert(strlen(name) < sizeof(buffer) - EXTRA_CAP);
720 capability = tterm->Strings[i];
722 if (!version_filter(STRING, i))
724 else if (isObsolete(outform, name))
729 * Extended names can be longer than 2 characters, but termcap programs
730 * cannot read those (filter them out).
732 if (outform == F_TERMCAP && (strlen(name) > 2))
736 if (outform == F_TERMCAP) {
738 * Some older versions of vi want rmir/smir to be defined
739 * for ich/ich1 to work. If they're not defined, force
740 * them to be output as defined and empty.
742 if (PRESENT(insert_character) || PRESENT(parm_ich)) {
743 if (SAME_CAP(i, enter_insert_mode)
744 && enter_insert_mode == ABSENT_STRING) {
745 _nc_STRCPY(buffer, "im=", sizeof(buffer));
750 if (SAME_CAP(i, exit_insert_mode)
751 && exit_insert_mode == ABSENT_STRING) {
752 _nc_STRCPY(buffer, "ei=", sizeof(buffer));
758 * termcap applications such as screen will be confused if sgr0
759 * is translated to a string containing rmacs. Filter that out.
761 if (PRESENT(exit_attribute_mode)) {
762 if (SAME_CAP(i, exit_attribute_mode)) {
764 char *my_sgr = set_attributes;
766 set_attributes = save_sgr;
768 trimmed_sgr0 = _nc_trim_sgr0(tterm);
769 if (strcmp(capability, trimmed_sgr0))
770 capability = trimmed_sgr0;
772 set_attributes = my_sgr;
777 predval = pred(STRING, i);
780 if (predval != FAIL) {
781 if (capability != ABSENT_STRING
782 && i + 1 > num_strings)
785 if (!VALID_STRING(capability)) {
786 _nc_SPRINTF(buffer, _nc_SLIMIT(sizeof(buffer))
789 } else if (outform == F_TERMCAP || outform == F_TCONVERR) {
790 int params = ((i < (int) SIZEOF(parametrized))
793 char *srccap = _nc_tic_expand(capability, TRUE, numbers);
794 char *cv = _nc_infotocap(name, srccap, params);
797 if (outform == F_TCONVERR) {
798 _nc_SPRINTF(buffer, _nc_SLIMIT(sizeof(buffer))
799 "%s=!!! %s WILL NOT CONVERT !!!",
801 } else if (suppress_untranslatable) {
804 char *s = srccap, *d = buffer;
805 _nc_SPRINTF(d, _nc_SLIMIT(sizeof(buffer)) "..%s=", name);
807 while ((*d = *s++) != 0) {
811 } else if (*d == '\\') {
818 _nc_SPRINTF(buffer, _nc_SLIMIT(sizeof(buffer))
821 len += (int) strlen(capability) + 1;
824 char *src = _nc_tic_expand(capability,
825 outform == F_TERMINFO, numbers);
827 strcpy_DYN(&tmpbuf, 0);
828 strcpy_DYN(&tmpbuf, name);
829 strcpy_DYN(&tmpbuf, "=");
831 && (outform == F_TERMINFO
832 || outform == F_VARIABLE)) {
833 fmt_complex(tterm, name, src, 1);
835 strcpy_DYN(&tmpbuf, src);
837 len += (int) strlen(capability) + 1;
838 wrap_concat(tmpbuf.text);
842 /* e.g., trimmed_sgr0 */
843 if (capability != ABSENT_STRING &&
844 capability != CANCELLED_STRING &&
845 capability != tterm->Strings[i])
848 len += (int) (num_strings * 2);
851 * This piece of code should be an effective inverse of the functions
852 * postprocess_terminfo() and postprocess_terminfo() in parse_entry.c.
853 * Much more work should be done on this to support dumping termcaps.
855 if (tversion == V_HPUX) {
856 if (VALID_STRING(memory_lock)) {
857 _nc_SPRINTF(buffer, _nc_SLIMIT(sizeof(buffer))
858 "meml=%s", memory_lock);
861 if (VALID_STRING(memory_unlock)) {
862 _nc_SPRINTF(buffer, _nc_SLIMIT(sizeof(buffer))
863 "memu=%s", memory_unlock);
866 } else if (tversion == V_AIX) {
867 if (VALID_STRING(acs_chars)) {
869 const char *acstrans = "lqkxjmwuvtn";
871 char *tp, *sp, boxchars[11];
874 for (cp = acstrans; *cp; cp++) {
875 sp = strchr(acs_chars, *cp);
886 char *tmp = _nc_tic_expand(boxchars,
887 (outform == F_TERMINFO),
889 _nc_STRCPY(buffer, "box1=", sizeof(buffer));
890 while (*tmp != '\0') {
891 size_t have = strlen(buffer);
892 size_t next = strlen(tmp);
893 size_t want = have + next + 1;
898 * If the expanded string is too long for the buffer,
899 * chop it off and save the location where we chopped it.
901 if (want >= sizeof(buffer)) {
905 _nc_STRCAT(buffer, tmp, sizeof(buffer));
908 * If we chopped the buffer, replace the missing piece and
909 * shift everything to append the remainder.
914 while ((tmp[next] = tmp[last + next]) != '\0') {
927 * kludge: trim off trailer to avoid an extra blank line
928 * in infocmp -u output when there are no string differences
931 bool trimmed = FALSE;
932 j = (PredIdx) outbuf.used;
934 && outbuf.text[j - 1] == '\t'
935 && outbuf.text[j - 2] == '\n') {
939 && outbuf.text[j - 1] == ':'
940 && outbuf.text[j - 2] == '\t'
941 && outbuf.text[j - 3] == '\n'
942 && outbuf.text[j - 4] == '\\') {
947 outbuf.text[outbuf.used] = '\0';
949 strcpy_DYN(&outbuf, " ");
953 fprintf(stderr, "num_bools = %d\n", num_bools);
954 fprintf(stderr, "num_values = %d\n", num_values);
955 fprintf(stderr, "num_strings = %d\n", num_strings);
956 fprintf(stderr, "term_names=%s, len=%d, strlen(outbuf)=%d, outbuf=%s\n",
957 tterm->term_names, len, outbuf.used, outbuf.text);
960 * Here's where we use infodump to trigger a more stringent length check
961 * for termcap-translation purposes.
962 * Return the length of the raw entry, without tc= expansions,
963 * It gives an idea of which entries are deadly to even *scan past*,
964 * as opposed to *use*.
966 return (infodump ? len : (int) termcap_length(outbuf.text));
970 kill_string(TERMTYPE *tterm, char *cap)
973 for (n = 0; n < NUM_STRINGS(tterm); ++n) {
974 if (cap == tterm->Strings[n]) {
975 tterm->Strings[n] = ABSENT_STRING;
983 find_string(TERMTYPE *tterm, char *name)
986 for (n = 0; n < NUM_STRINGS(tterm); ++n) {
987 if (version_filter(STRING, n)
988 && !strcmp(name, strnames[n])) {
989 char *cap = tterm->Strings[n];
990 if (VALID_STRING(cap)) {
996 return ABSENT_STRING;
1000 * This is used to remove function-key labels from a termcap entry to
1004 kill_labels(TERMTYPE *tterm, int target)
1011 for (n = 0; n <= 10; ++n) {
1012 _nc_SPRINTF(name, _nc_SLIMIT(sizeof(name)) "lf%d", n);
1013 if ((cap = find_string(tterm, name)) != ABSENT_STRING
1014 && kill_string(tterm, cap)) {
1015 target -= (int) (strlen(cap) + 5);
1025 * This is used to remove function-key definitions from a termcap entry to
1029 kill_fkeys(TERMTYPE *tterm, int target)
1036 for (n = 60; n >= 0; --n) {
1037 _nc_SPRINTF(name, _nc_SLIMIT(sizeof(name)) "kf%d", n);
1038 if ((cap = find_string(tterm, name)) != ABSENT_STRING
1039 && kill_string(tterm, cap)) {
1040 target -= (int) (strlen(cap) + 5);
1050 * Check if the given acsc string is a 1-1 mapping, i.e., just-like-vt100.
1051 * Also, since this is for termcap, we only care about the line-drawing map.
1053 #define isLine(c) (strchr("lmkjtuvwqxn", c) != 0)
1056 one_one_mapping(const char *mapping)
1060 if (mapping != ABSENT_STRING) {
1062 while (mapping[n] != '\0') {
1063 if (isLine(mapping[n]) &&
1064 mapping[n] != mapping[n + 1]) {
1074 #define FMT_ENTRY() \
1075 fmt_entry(tterm, pred, \
1077 suppress_untranslatable, \
1080 #define SHOW_WHY PRINTF
1083 purged_acs(TERMTYPE *tterm)
1085 bool result = FALSE;
1087 if (VALID_STRING(acs_chars)) {
1088 if (!one_one_mapping(acs_chars)) {
1089 enter_alt_charset_mode = ABSENT_STRING;
1090 exit_alt_charset_mode = ABSENT_STRING;
1091 SHOW_WHY("# (rmacs/smacs removed for consistency)\n");
1099 * Dump a single entry.
1102 dump_entry(TERMTYPE *tterm,
1103 bool suppress_untranslatable,
1108 TERMTYPE save_tterm;
1113 if (outform == F_TERMCAP || outform == F_TCONVERR) {
1114 critlen = MAX_TERMCAP_LENGTH;
1115 legend = "older termcap";
1117 set_obsolete_termcaps(tterm);
1119 critlen = MAX_TERMINFO_LENGTH;
1120 legend = "terminfo";
1124 save_sgr = set_attributes;
1126 if ((FMT_ENTRY() > critlen)
1129 save_tterm = *tterm;
1130 if (!suppress_untranslatable) {
1131 SHOW_WHY("# (untranslatable capabilities removed to fit entry within %d bytes)\n",
1133 suppress_untranslatable = TRUE;
1135 if (FMT_ENTRY() > critlen) {
1137 * We pick on sgr because it's a nice long string capability that
1138 * is really just an optimization hack. Another good candidate is
1139 * acsc since it is both long and unused by BSD termcap.
1141 bool changed = FALSE;
1145 * Extended names are most likely function-key definitions. Drop
1149 for (n = STRCOUNT; n < NUM_STRINGS(tterm); n++) {
1150 const char *name = ExtStrname(tterm, (int) n, strnames);
1152 if (VALID_STRING(tterm->Strings[n])) {
1153 set_attributes = ABSENT_STRING;
1154 /* we remove long names anyway - only report the short */
1155 if (strlen(name) <= 2) {
1156 SHOW_WHY("# (%s removed to fit entry within %d bytes)\n",
1161 if (FMT_ENTRY() <= critlen)
1166 if (VALID_STRING(set_attributes)) {
1167 set_attributes = ABSENT_STRING;
1168 SHOW_WHY("# (sgr removed to fit entry within %d bytes)\n",
1172 if (!changed || (FMT_ENTRY() > critlen)) {
1173 if (purged_acs(tterm)) {
1174 acs_chars = ABSENT_STRING;
1175 SHOW_WHY("# (acsc removed to fit entry within %d bytes)\n",
1180 if (!changed || (FMT_ENTRY() > critlen)) {
1181 int oldversion = tversion;
1184 SHOW_WHY("# (terminfo-only capabilities suppressed to fit entry within %d bytes)\n",
1189 && kill_labels(tterm, len - critlen)) {
1190 SHOW_WHY("# (some labels capabilities suppressed to fit entry within %d bytes)\n",
1195 && kill_fkeys(tterm, len - critlen)) {
1196 SHOW_WHY("# (some function-key capabilities suppressed to fit entry within %d bytes)\n",
1200 if (len > critlen) {
1201 (void) fprintf(stderr,
1202 "warning: %s entry is %d bytes long\n",
1203 _nc_first_name(tterm->term_names),
1205 SHOW_WHY("# WARNING: this entry, %d bytes long, may core-dump %s libraries!\n",
1208 tversion = oldversion;
1210 set_attributes = save_sgr;
1211 *tterm = save_tterm;
1213 } else if (!version_filter(STRING, STR_IDX(acs_chars))) {
1214 save_tterm = *tterm;
1215 if (purged_acs(tterm)) {
1218 *tterm = save_tterm;
1223 dump_uses(const char *name, bool infodump)
1224 /* dump "use=" clauses in the appropriate format */
1226 char buffer[MAX_TERMINFO_LENGTH];
1228 if (outform == F_TERMCAP || outform == F_TCONVERR)
1230 _nc_SPRINTF(buffer, _nc_SLIMIT(sizeof(buffer))
1231 "%s%s", infodump ? "use=" : "tc=", name);
1232 wrap_concat(buffer);
1239 * Trim any remaining whitespace.
1241 if (outbuf.used != 0) {
1242 bool infodump = (outform != F_TERMCAP && outform != F_TCONVERR);
1243 char delim = (char) (infodump ? ',' : ':');
1246 for (j = (int) outbuf.used - 1; j > 0; --j) {
1247 char ch = outbuf.text[j];
1250 } else if (isspace(UChar(ch))) {
1251 outbuf.used = (size_t) j;
1252 } else if (!infodump && ch == '\\') {
1253 outbuf.used = (size_t) j;
1254 } else if (ch == delim && (j == 0 || outbuf.text[j - 1] != '\\')) {
1255 outbuf.used = (size_t) (j + 1);
1260 outbuf.text[outbuf.used] = '\0';
1262 (void) fputs(outbuf.text, stdout);
1264 return (int) outbuf.used;
1268 compare_entry(PredHook hook,
1269 TERMTYPE *tp GCC_UNUSED,
1271 /* compare two entries */
1274 NCURSES_CONST char *name;
1277 fputs(" comparing booleans.\n", stdout);
1278 for_each_boolean(j, tp) {
1279 i = BoolIndirect(j);
1280 name = ExtBoolname(tp, (int) i, bool_names);
1282 if (isObsolete(outform, name))
1285 (*hook) (CMP_BOOLEAN, i, name);
1289 fputs(" comparing numbers.\n", stdout);
1290 for_each_number(j, tp) {
1292 name = ExtNumname(tp, (int) i, num_names);
1294 if (isObsolete(outform, name))
1297 (*hook) (CMP_NUMBER, i, name);
1301 fputs(" comparing strings.\n", stdout);
1302 for_each_string(j, tp) {
1304 name = ExtStrname(tp, (int) i, str_names);
1306 if (isObsolete(outform, name))
1309 (*hook) (CMP_STRING, i, name);
1312 /* (void) fputs(" comparing use entries.\n", stdout); */
1313 (*hook) (CMP_USE, 0, "use");
1317 #define NOTSET(s) ((s) == 0)
1320 * This bit of legerdemain turns all the terminfo variable names into
1321 * references to locations in the arrays Booleans, Numbers, and Strings ---
1322 * precisely what's needed.
1328 set_obsolete_termcaps(TERMTYPE *tp)
1330 #include "capdefaults.c"
1334 * Convert an alternate-character-set string to canonical form: sorted and
1338 repair_acsc(TERMTYPE *tp)
1340 if (VALID_STRING(acs_chars)) {
1346 bool fix_needed = FALSE;
1348 for (n = 0, source = 0; acs_chars[n] != 0; n++) {
1349 target = UChar(acs_chars[n]);
1350 if (source >= target) {
1355 if (acs_chars[n + 1])
1359 memset(mapped, 0, sizeof(mapped));
1360 for (n = 0; acs_chars[n] != 0; n++) {
1361 source = UChar(acs_chars[n]);
1362 if ((target = (unsigned char) acs_chars[n + 1]) != 0) {
1363 mapped[source] = (char) target;
1366 extra = (char) source;
1369 for (n = m = 0; n < sizeof(mapped); n++) {
1371 acs_chars[m++] = (char) n;
1372 acs_chars[m++] = mapped[n];
1376 acs_chars[m++] = extra; /* garbage in, garbage out */