1 /****************************************************************************
2 * Copyright 2020-2021,2022 Thomas E. Dickey *
3 * Copyright 1998-2016,2017 Free Software Foundation, Inc. *
5 * Permission is hereby granted, free of charge, to any person obtaining a *
6 * copy of this software and associated documentation files (the *
7 * "Software"), to deal in the Software without restriction, including *
8 * without limitation the rights to use, copy, modify, merge, publish, *
9 * distribute, distribute with modifications, sublicense, and/or sell *
10 * copies of the Software, and to permit persons to whom the Software is *
11 * furnished to do so, subject to the following conditions: *
13 * The above copyright notice and this permission notice shall be included *
14 * in all copies or substantial portions of the Software. *
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
17 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
18 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
19 * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
20 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
21 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
22 * THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
24 * Except as contained in this notice, the name(s) of the above copyright *
25 * holders shall not be used in advertising or otherwise to promote the *
26 * sale, use or other dealings in this Software without prior written *
28 ****************************************************************************/
30 /****************************************************************************
31 * Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 *
32 * and: Eric S. Raymond <esr@snark.thyrsus.com> *
33 * and: Thomas E. Dickey 1996-on *
34 ****************************************************************************/
37 * infocmp.c -- decompile an entry, or compare two entries
38 * written by Eric S. Raymond
42 #include <progs.priv.h>
44 #include <dump_entry.h>
46 MODULE_ID("$Id: infocmp.c,v 1.152 2022/02/26 23:25:55 tom Exp $")
48 #define MAX_STRING 1024 /* maximum formatted string */
50 const char *_nc_progname = "infocmp";
52 typedef char path[PATH_MAX];
54 /***************************************************************************
56 * The following control variables, together with the contents of the
57 * terminfo entries, completely determine the actions of the program.
59 ***************************************************************************/
61 static ENTRY *entries; /* terminfo entries */
62 static int termcount; /* count of terminal entries */
64 static bool limited = TRUE; /* "-r" option is not set */
65 static bool quiet = FALSE;
66 static bool literal = FALSE;
67 static const char *bool_sep = ":";
68 static const char *s_absent = "NULL";
69 static const char *s_cancel = "NULL";
70 static const char *tversion; /* terminfo version selected */
71 static unsigned itrace; /* trace flag for debugging */
72 static int mwidth = 60;
73 static int mheight = 65535;
74 static int numbers = 0; /* format "%'char'" to/from "%{number}" */
75 static int outform = F_TERMINFO; /* output format */
76 static int sortmode; /* sort_mode */
78 /* main comparison mode */
80 #define C_DEFAULT 0 /* don't force comparison mode */
81 #define C_DIFFERENCE 1 /* list differences between two terminals */
82 #define C_COMMON 2 /* list common capabilities */
83 #define C_NAND 3 /* list capabilities in neither terminal */
84 #define C_USEALL 4 /* generate relative use-form entry */
85 static bool ignorepads; /* ignore pad prefixes when diffing */
94 static ENTERED *entered;
97 static GCC_NORETURN void ExitProgram(int code);
98 /* prototype is to get gcc to accept the noreturn attribute */
100 ExitProgram(int code)
104 for (n = 0; n < termcount; ++n) {
105 ENTRY *new_head = _nc_head;
106 ENTRY *new_tail = _nc_tail;
107 _nc_head = entered[n].head;
108 _nc_tail = entered[n].tail;
109 _nc_free_entries(entered[n].head);
113 _nc_leaks_dump_entry();
121 failed(const char *s)
124 ExitProgram(EXIT_FAILURE);
128 canonical_name(char *source, char *target)
129 /* extract the terminal type's primary name */
131 int limit = NAMESIZE;
133 while (--limit > 0) {
145 no_boolean(int value)
147 bool result = (value == ABSENT_BOOLEAN);
148 if (!strcmp(s_absent, s_cancel))
149 result = !VALID_BOOLEAN(value);
154 no_numeric(int value)
156 bool result = (value == ABSENT_NUMERIC);
157 if (!strcmp(s_absent, s_cancel))
158 result = !VALID_NUMERIC(value);
163 no_string(char *value)
165 bool result = (value == ABSENT_STRING);
166 if (!strcmp(s_absent, s_cancel))
167 result = !VALID_STRING(value);
171 /***************************************************************************
173 * Predicates for dump function
175 ***************************************************************************/
178 capcmp(PredIdx idx, const char *s, const char *t)
179 /* capability comparison function */
181 if (!VALID_STRING(s) && !VALID_STRING(t))
183 else if (!VALID_STRING(s) || !VALID_STRING(t))
186 if ((idx == acs_chars_index) || !ignorepads)
187 return (strcmp(s, t));
189 return (_nc_capcmp(s, t));
193 use_predicate(unsigned type, PredIdx idx)
194 /* predicate function to use for use decompilation */
204 * This assumes that multiple use entries are supposed
205 * to contribute the logical or of their boolean capabilities.
206 * This is true if we take the semantics of multiple uses to
207 * be 'each capability gets the first non-default value found
208 * in the sequence of use entries'.
210 * Note that cancelled or absent booleans are stored as FALSE,
211 * unlike numbers and strings, whose cancelled/absent state is
212 * recorded in the terminfo database.
214 for (ep = &entries[1]; ep < entries + termcount; ep++)
215 if (ep->tterm.Booleans[idx] == TRUE) {
216 is_set = entries[0].tterm.Booleans[idx];
219 if (is_set != entries[0].tterm.Booleans[idx])
227 int value = ABSENT_NUMERIC;
230 * We take the semantics of multiple uses to be 'each
231 * capability gets the first non-default value found
232 * in the sequence of use entries'.
234 for (ep = &entries[1]; ep < entries + termcount; ep++)
235 if (VALID_NUMERIC(ep->tterm.Numbers[idx])) {
236 value = ep->tterm.Numbers[idx];
240 if (value != entries[0].tterm.Numbers[idx])
241 return (value != ABSENT_NUMERIC);
248 char *termstr, *usestr = ABSENT_STRING;
250 termstr = entries[0].tterm.Strings[idx];
253 * We take the semantics of multiple uses to be 'each
254 * capability gets the first non-default value found
255 * in the sequence of use entries'.
257 for (ep = &entries[1]; ep < entries + termcount; ep++)
258 if (ep->tterm.Strings[idx]) {
259 usestr = ep->tterm.Strings[idx];
263 if (usestr == ABSENT_STRING && termstr == ABSENT_STRING)
265 else if (!usestr || !termstr || capcmp(idx, usestr, termstr))
272 return (FALSE); /* pacify compiler */
276 useeq(ENTRY * e1, ENTRY * e2)
277 /* are the use references in two entries equivalent? */
281 if (e1->nuses != e2->nuses)
284 /* Ugh...this is quadratic again */
285 for (i = 0; i < e1->nuses; i++) {
286 bool foundmatch = FALSE;
288 /* search second entry for given use reference */
289 for (j = 0; j < e2->nuses; j++)
290 if (!strcmp(e1->uses[i].name, e2->uses[j].name)) {
303 entryeq(TERMTYPE2 *t1, TERMTYPE2 *t2)
304 /* are two entries equivalent? */
308 for (i = 0; i < NUM_BOOLEANS(t1); i++)
309 if (t1->Booleans[i] != t2->Booleans[i])
312 for (i = 0; i < NUM_NUMBERS(t1); i++)
313 if (t1->Numbers[i] != t2->Numbers[i])
316 for (i = 0; i < NUM_STRINGS(t1); i++)
317 if (capcmp((PredIdx) i, t1->Strings[i], t2->Strings[i]))
323 #define TIC_EXPAND(result) _nc_tic_expand(result, outform==F_TERMINFO, numbers)
326 print_uses(ENTRY * ep, FILE *fp)
327 /* print an entry's use references */
334 for (i = 0; i < ep->nuses; i++) {
335 fputs(ep->uses[i].name, fp);
336 if (i < ep->nuses - 1)
343 dump_boolean(int val)
344 /* display the value of a boolean capability */
349 case CANCELLED_BOOLEAN:
361 dump_numeric(int val, char *buf)
362 /* display the value of a numeric capability */
366 _nc_STRCPY(buf, s_absent, MAX_STRING);
368 case CANCELLED_NUMERIC:
369 _nc_STRCPY(buf, s_cancel, MAX_STRING);
372 _nc_SPRINTF(buf, _nc_SLIMIT(MAX_STRING) "%d", val);
378 dump_string(char *val, char *buf)
379 /* display the value of a string capability */
381 if (val == ABSENT_STRING)
382 _nc_STRCPY(buf, s_absent, MAX_STRING);
383 else if (val == CANCELLED_STRING)
384 _nc_STRCPY(buf, s_cancel, MAX_STRING);
386 _nc_SPRINTF(buf, _nc_SLIMIT(MAX_STRING)
387 "'%.*s'", MAX_STRING - 3, TIC_EXPAND(val));
392 * Show "comparing..." message for the given terminal names.
395 show_comparing(char **names)
400 (void) fprintf(stderr, "%s: dumping differences\n", _nc_progname);
404 (void) fprintf(stderr, "%s: dumping common capabilities\n", _nc_progname);
408 (void) fprintf(stderr, "%s: dumping differences\n", _nc_progname);
413 printf("comparing %s", *names++);
415 printf(" to %s", *names++);
417 printf(", %s", *names++);
425 * ncurses stores two types of non-standard capabilities:
426 * a) capabilities listed past the "STOP-HERE" comment in the Caps file.
427 * These are used in the terminfo source file to provide data for termcaps,
428 * e.g., when there is no equivalent capability in terminfo, as well as for
429 * widely-used non-standard capabilities.
430 * b) user-definable capabilities, via "tic -x".
432 * However, if "-x" is omitted from the tic command, both types of
433 * non-standard capability are not loaded into the terminfo database. This
434 * macro is used for limit-checks against the symbols that tic uses to omit
435 * the two types of non-standard entry.
438 #define check_user_definable(n,limit) if (!_nc_user_definable && (n) > (limit)) break
440 #define check_user_definable(n,limit) if ((n) > (limit)) break
444 * Use these macros to simplify loops on C_COMMON and C_NAND:
446 #define for_each_entry() while (entries[extra].tterm.term_names)
447 #define next_entry (&(entries[extra++].tterm))
450 compare_predicate(PredType type, PredIdx idx, const char *name)
451 /* predicate function to use for entry difference reports */
453 ENTRY *e1 = &entries[0];
454 ENTRY *e2 = &entries[1];
455 char buf1[MAX_STRING];
456 char buf2[MAX_STRING];
465 check_user_definable(idx, BOOLWRITE);
466 b1 = e1->tterm.Booleans[idx];
469 b2 = next_entry->Booleans[idx];
470 if (!(no_boolean(b1) && no_boolean(b2)) && (b1 != b2))
471 (void) printf("\t%s: %s%s%s.\n",
479 if (b1 != ABSENT_BOOLEAN) {
482 b2 = next_entry->Booleans[idx];
489 (void) printf("\t%s= %s.\n", name, dump_boolean(b1));
495 if (b1 == ABSENT_BOOLEAN) {
498 b2 = next_entry->Booleans[idx];
505 (void) printf("\t!%s.\n", name);
513 check_user_definable(idx, NUMWRITE);
514 n1 = e1->tterm.Numbers[idx];
517 n2 = next_entry->Numbers[idx];
518 if (!(no_numeric(n1) && no_numeric(n2)) && n1 != n2) {
519 dump_numeric(n1, buf1);
520 dump_numeric(n2, buf2);
521 (void) printf("\t%s: %s, %s.\n", name, buf1, buf2);
526 if (n1 != ABSENT_NUMERIC) {
529 n2 = next_entry->Numbers[idx];
536 dump_numeric(n1, buf1);
537 (void) printf("\t%s= %s.\n", name, buf1);
543 if (n1 == ABSENT_NUMERIC) {
546 n2 = next_entry->Numbers[idx];
553 (void) printf("\t!%s.\n", name);
561 check_user_definable(idx, STRWRITE);
562 s1 = e1->tterm.Strings[idx];
565 s2 = next_entry->Strings[idx];
566 if (!(no_string(s1) && no_string(s2)) && capcmp(idx, s1, s2)) {
567 dump_string(s1, buf1);
568 dump_string(s2, buf2);
569 if (strcmp(buf1, buf2))
570 (void) printf("\t%s: %s, %s.\n", name, buf1, buf2);
575 if (s1 != ABSENT_STRING) {
578 s2 = next_entry->Strings[idx];
579 if (capcmp(idx, s1, s2) != 0) {
585 (void) printf("\t%s= '%s'.\n", name, TIC_EXPAND(s1));
591 if (s1 == ABSENT_STRING) {
594 s2 = next_entry->Strings[idx];
601 (void) printf("\t!%s.\n", name);
609 /* unlike the other modes, this compares *all* use entries */
612 if (!useeq(e1, e2)) {
613 (void) fputs("\tuse: ", stdout);
614 print_uses(e1, stdout);
616 print_uses(e2, stdout);
617 fputs(".\n", stdout);
625 e2 = &entries[extra++];
626 if (e2->nuses != e1->nuses || !useeq(e1, e2)) {
632 (void) fputs("\tuse: ", stdout);
633 print_uses(e1, stdout);
634 fputs(".\n", stdout);
643 e2 = &entries[extra++];
644 if (e2->nuses != e1->nuses) {
650 (void) printf("\t!use.\n");
658 /***************************************************************************
660 * Init string analysis
662 ***************************************************************************/
664 #define DATA(from, to) { { from }, { to } }
665 #define DATAX() DATA("", "")
672 static const assoc std_caps[] =
674 /* these are specified by X.364 and iBCS2 */
675 DATA("\033c", "RIS"), /* full reset */
676 DATA("\0337", "SC"), /* save cursor */
677 DATA("\0338", "RC"), /* restore cursor */
678 DATA("\033[r", "RSR"), /* not an X.364 mnemonic */
679 DATA("\033[m", "SGR0"), /* not an X.364 mnemonic */
680 DATA("\033[2J", "ED2"), /* clear page */
682 /* this group is specified by ISO 2022 */
683 DATA("\033(0", "ISO DEC G0"), /* enable DEC graphics for G0 */
684 DATA("\033(A", "ISO UK G0"), /* enable UK chars for G0 */
685 DATA("\033(B", "ISO US G0"), /* enable US chars for G0 */
686 DATA("\033)0", "ISO DEC G1"), /* enable DEC graphics for G1 */
687 DATA("\033)A", "ISO UK G1"), /* enable UK chars for G1 */
688 DATA("\033)B", "ISO US G1"), /* enable US chars for G1 */
690 /* these are DEC private controls widely supported by emulators */
691 DATA("\033=", "DECPAM"), /* application keypad mode */
692 DATA("\033>", "DECPNM"), /* normal keypad mode */
693 DATA("\033<", "DECANSI"), /* enter ANSI mode */
694 DATA("\033[!p", "DECSTR"), /* soft reset */
695 DATA("\033 F", "S7C1T"), /* 7-bit controls */
700 static const assoc std_modes[] =
701 /* ECMA \E[ ... [hl] modes recognized by many emulators */
703 DATA("2", "AM"), /* keyboard action mode */
704 DATA("4", "IRM"), /* insert/replace mode */
705 DATA("12", "SRM"), /* send/receive mode */
706 DATA("20", "LNM"), /* linefeed mode */
710 static const assoc private_modes[] =
711 /* DEC \E[ ... [hl] modes recognized by many emulators */
713 DATA("1", "CKM"), /* application cursor keys */
714 DATA("2", "ANM"), /* set VT52 mode */
715 DATA("3", "COLM"), /* 132-column mode */
716 DATA("4", "SCLM"), /* smooth scroll */
717 DATA("5", "SCNM"), /* reverse video mode */
718 DATA("6", "OM"), /* origin mode */
719 DATA("7", "AWM"), /* wraparound mode */
720 DATA("8", "ARM"), /* auto-repeat mode */
724 static const assoc ecma_highlights[] =
725 /* recognize ECMA attribute sequences */
727 DATA("0", "NORMAL"), /* normal */
728 DATA("1", "+BOLD"), /* bold on */
729 DATA("2", "+DIM"), /* dim on */
730 DATA("3", "+ITALIC"), /* italic on */
731 DATA("4", "+UNDERLINE"), /* underline on */
732 DATA("5", "+BLINK"), /* blink on */
733 DATA("6", "+FASTBLINK"), /* fastblink on */
734 DATA("7", "+REVERSE"), /* reverse on */
735 DATA("8", "+INVISIBLE"), /* invisible on */
736 DATA("9", "+DELETED"), /* deleted on */
737 DATA("10", "MAIN-FONT"), /* select primary font */
738 DATA("11", "ALT-FONT-1"), /* select alternate font 1 */
739 DATA("12", "ALT-FONT-2"), /* select alternate font 2 */
740 DATA("13", "ALT-FONT-3"), /* select alternate font 3 */
741 DATA("14", "ALT-FONT-4"), /* select alternate font 4 */
742 DATA("15", "ALT-FONT-5"), /* select alternate font 5 */
743 DATA("16", "ALT-FONT-6"), /* select alternate font 6 */
744 DATA("17", "ALT-FONT-7"), /* select alternate font 7 */
745 DATA("18", "ALT-FONT-1"), /* select alternate font 1 */
746 DATA("19", "ALT-FONT-1"), /* select alternate font 1 */
747 DATA("20", "FRAKTUR"), /* Fraktur font */
748 DATA("21", "DOUBLEUNDER"), /* double underline */
749 DATA("22", "-DIM"), /* dim off */
750 DATA("23", "-ITALIC"), /* italic off */
751 DATA("24", "-UNDERLINE"), /* underline off */
752 DATA("25", "-BLINK"), /* blink off */
753 DATA("26", "-FASTBLINK"), /* fastblink off */
754 DATA("27", "-REVERSE"), /* reverse off */
755 DATA("28", "-INVISIBLE"), /* invisible off */
756 DATA("29", "-DELETED"), /* deleted off */
763 skip_csi(const char *cap)
766 if (cap[0] == '\033' && cap[1] == '[')
768 else if (UChar(cap[0]) == 0233)
774 same_param(const char *table, const char *param, size_t length)
777 if (strncmp(table, param, length) == 0) {
778 result = !isdigit(UChar(param[length]));
784 lookup_params(const assoc * table, char *dst, char *src)
787 const char *ep = strtok(src, ";");
795 for (ap = table; ap->from[0]; ap++) {
796 size_t tlen = strlen(ap->from);
798 if (same_param(ap->from, ep, tlen)) {
799 _nc_STRCAT(dst, ap->to, MAX_TERMINFO_LENGTH);
806 _nc_STRCAT(dst, ep, MAX_TERMINFO_LENGTH);
807 _nc_STRCAT(dst, ";", MAX_TERMINFO_LENGTH);
809 ((ep = strtok((char *) 0, ";")));
811 dst[strlen(dst) - 1] = '\0';
819 analyze_string(const char *name, const char *cap, TERMTYPE2 *tp)
821 char buf2[MAX_TERMINFO_LENGTH];
824 int tp_lines = tp->Numbers[2];
826 if (!VALID_STRING(cap))
828 (void) printf("%s: ", name);
830 for (sp = cap; *sp; sp++) {
835 const char *expansion = 0;
836 char buf3[MAX_TERMINFO_LENGTH];
838 /* first, check other capabilities in this entry */
839 for (i = 0; i < STRCOUNT; i++) {
840 char *cp = tp->Strings[i];
842 /* don't use function-key capabilities */
843 if (strnames[i] == NULL)
845 if (strnames[i][0] == 'k' && strnames[i][1] == 'f')
848 if (VALID_STRING(cp) &&
852 _nc_STRNCPY(buf2, sp, len);
855 if (_nc_capcmp(cp, buf2))
858 #define ISRS(s) (!strncmp((s), "is", (size_t) 2) || !strncmp((s), "rs", (size_t) 2))
860 * Theoretically we just passed the test for translation
861 * (equality once the padding is stripped). However, there
862 * are a few more hoops that need to be jumped so that
863 * identical pairs of initialization and reset strings
864 * don't just refer to each other.
866 if (ISRS(name) || ISRS(strnames[i]))
871 expansion = strnames[i];
876 /* now check the standard capabilities */
879 for (ap = std_caps; ap->from[0]; ap++) {
880 size_t adj = (size_t) (csi ? 2 : 0);
882 len = strlen(ap->from);
883 if (csi && skip_csi(ap->from) != csi)
886 && strncmp(ap->from + adj, sp + csi, len - adj) == 0) {
895 /* now check for standard-mode sequences */
897 && (csi = skip_csi(sp)) != 0
898 && (len = (strspn) (sp + csi, "0123456789;"))
899 && (len < sizeof(buf3))
900 && (next = (size_t) csi + len)
901 && ((sp[next] == 'h') || (sp[next] == 'l'))) {
908 _nc_STRNCPY(buf3, sp + csi, len);
910 len += (size_t) csi + 1;
912 expansion = lookup_params(std_modes, buf2, buf3);
915 /* now check for private-mode sequences */
917 && (csi = skip_csi(sp)) != 0
919 && (len = (strspn) (sp + csi + 1, "0123456789;"))
920 && (len < sizeof(buf3))
921 && (next = (size_t) csi + 1 + len)
922 && ((sp[next] == 'h') || (sp[next] == 'l'))) {
929 _nc_STRNCPY(buf3, sp + csi + 1, len);
931 len += (size_t) csi + 2;
933 expansion = lookup_params(private_modes, buf2, buf3);
936 /* now check for ECMA highlight sequences */
938 && (csi = skip_csi(sp)) != 0
939 && (len = (strspn) (sp + csi, "0123456789;")) != 0
940 && (len < sizeof(buf3))
941 && (next = (size_t) csi + len)
942 && sp[next] == 'm') {
944 _nc_STRCPY(buf2, "SGR:", sizeof(buf2));
945 _nc_STRNCPY(buf3, sp + csi, len);
947 len += (size_t) csi + 1;
949 expansion = lookup_params(ecma_highlights, buf2, buf3);
953 && (csi = skip_csi(sp)) != 0
955 len = (size_t) csi + 1;
956 _nc_STRCPY(buf2, "SGR:", sizeof(buf2));
957 _nc_STRCAT(buf2, ecma_highlights[0].to, sizeof(buf2));
961 /* now check for scroll region reset */
963 && (csi = skip_csi(sp)) != 0) {
964 if (sp[csi] == 'r') {
968 _nc_SPRINTF(buf2, _nc_SLIMIT(sizeof(buf2)) "1;%dr", tp_lines);
970 if (strncmp(buf2, sp + csi, len) == 0)
976 /* now check for home-down */
978 && (csi = skip_csi(sp)) != 0) {
979 _nc_SPRINTF(buf2, _nc_SLIMIT(sizeof(buf2)) "%d;1H", tp_lines);
981 if (strncmp(buf2, sp + csi, len) == 0) {
984 _nc_SPRINTF(buf2, _nc_SLIMIT(sizeof(buf2)) "%dH", tp_lines);
986 if (strncmp(buf2, sp + csi, len) == 0) {
993 /* now look at the expansion we got, if any */
995 printf("{%s}", expansion);
998 /* couldn't match anything */
1001 fputs(TIC_EXPAND(buf2), stdout);
1007 /***************************************************************************
1011 ***************************************************************************/
1014 file_comparison(int argc, char *argv[])
1016 #define MAXCOMPARE 2
1017 /* someday we may allow comparisons on more files */
1019 ENTRY *heads[MAXCOMPARE];
1023 memset(heads, 0, sizeof(heads));
1024 dump_init((char *) 0, F_LITERAL, S_TERMINFO,
1025 FALSE, 0, 65535, itrace, FALSE, FALSE, FALSE);
1027 for (n = 0; n < argc && n < MAXCOMPARE; n++) {
1028 if (freopen(argv[n], "r", stdin) == 0)
1029 _nc_err_abort("Can't open %s", argv[n]);
1032 entered[n].head = _nc_head;
1033 entered[n].tail = _nc_tail;
1035 _nc_head = _nc_tail = 0;
1037 /* parse entries out of the source file */
1038 _nc_set_source(argv[n]);
1039 _nc_read_entry_source(stdin, NULL, TRUE, literal, NULLHOOK);
1042 (void) fprintf(stderr, "Resolving file %d...\n", n - 0);
1044 /* maybe do use resolution */
1045 if (!_nc_resolve_uses2(!limited, literal)) {
1046 (void) fprintf(stderr,
1047 "There are unresolved use entries in %s:\n",
1049 for_entry_list(qp) {
1051 (void) fputs(qp->tterm.term_names, stderr);
1052 (void) fputc('\n', stderr);
1055 ExitProgram(EXIT_FAILURE);
1058 heads[filecount] = _nc_head;
1062 /* OK, all entries are in core. Ready to do the comparison */
1064 (void) fprintf(stderr, "Entries are now in core...\n");
1066 /* The entry-matching loop. Sigh, this is intrinsically quadratic. */
1067 for (qp = heads[0]; qp; qp = qp->next) {
1068 for (rp = heads[1]; rp; rp = rp->next)
1069 if (_nc_entry_match(qp->tterm.term_names, rp->tterm.term_names)) {
1070 if (qp->ncrosslinks < MAX_CROSSLINKS)
1071 qp->crosslinks[qp->ncrosslinks] = rp;
1074 if (rp->ncrosslinks < MAX_CROSSLINKS)
1075 rp->crosslinks[rp->ncrosslinks] = qp;
1080 /* now we have two circular lists with crosslinks */
1082 (void) fprintf(stderr, "Name matches are done...\n");
1084 for (qp = heads[0]; qp; qp = qp->next) {
1085 if (qp->ncrosslinks > 1) {
1086 (void) fprintf(stderr,
1087 "%s in file 1 (%s) has %d matches in file 2 (%s):\n",
1088 _nc_first_name(qp->tterm.term_names),
1092 for (i = 0; i < qp->ncrosslinks; i++)
1093 (void) fprintf(stderr,
1095 _nc_first_name((qp->crosslinks[i])->tterm.term_names));
1099 for (rp = heads[1]; rp; rp = rp->next) {
1100 if (rp->ncrosslinks > 1) {
1101 (void) fprintf(stderr,
1102 "%s in file 2 (%s) has %d matches in file 1 (%s):\n",
1103 _nc_first_name(rp->tterm.term_names),
1107 for (i = 0; i < rp->ncrosslinks; i++)
1108 (void) fprintf(stderr,
1110 _nc_first_name((rp->crosslinks[i])->tterm.term_names));
1114 (void) printf("In file 1 (%s) only:\n", argv[0]);
1115 for (qp = heads[0]; qp; qp = qp->next)
1116 if (qp->ncrosslinks == 0)
1117 (void) printf("\t%s\n",
1118 _nc_first_name(qp->tterm.term_names));
1120 (void) printf("In file 2 (%s) only:\n", argv[1]);
1121 for (rp = heads[1]; rp; rp = rp->next)
1122 if (rp->ncrosslinks == 0)
1123 (void) printf("\t%s\n",
1124 _nc_first_name(rp->tterm.term_names));
1126 (void) printf("The following entries are equivalent:\n");
1127 for (qp = heads[0]; qp; qp = qp->next) {
1128 if (qp->ncrosslinks == 1) {
1129 rp = qp->crosslinks[0];
1131 repair_acsc(&qp->tterm);
1132 repair_acsc(&rp->tterm);
1134 _nc_align_termtype(&qp->tterm, &rp->tterm);
1136 if (entryeq(&qp->tterm, &rp->tterm) && useeq(qp, rp)) {
1137 char name1[NAMESIZE], name2[NAMESIZE];
1139 (void) canonical_name(qp->tterm.term_names, name1);
1140 (void) canonical_name(rp->tterm.term_names, name2);
1142 (void) printf("%s = %s\n", name1, name2);
1147 (void) printf("Differing entries:\n");
1149 for (qp = heads[0]; qp; qp = qp->next) {
1151 if (qp->ncrosslinks == 1) {
1152 rp = qp->crosslinks[0];
1154 /* sorry - we have to do this on each pass */
1155 _nc_align_termtype(&qp->tterm, &rp->tterm);
1157 if (!(entryeq(&qp->tterm, &rp->tterm) && useeq(qp, rp))) {
1158 char name1[NAMESIZE], name2[NAMESIZE];
1168 (void) canonical_name(qp->tterm.term_names, name1);
1169 (void) canonical_name(rp->tterm.term_names, name2);
1173 show_comparing(names);
1174 compare_entry(compare_predicate, &entries->tterm, quiet);
1178 show_comparing(names);
1179 compare_entry(compare_predicate, &entries->tterm, quiet);
1183 show_comparing(names);
1184 compare_entry(compare_predicate, &entries->tterm, quiet);
1196 #define DATA(s) s "\n"
1197 static const char head[] =
1199 DATA("Usage: infocmp [options] [-A directory] [-B directory] [termname...]")
1204 /* length is given here so the compiler can make everything readonly */
1206 static const char options[][46] =
1208 " -0 print single-row"
1209 ," -1 print single-column"
1210 ," -C use termcap-names"
1211 ," -D print database locations"
1212 ," -E format output as C tables"
1213 ," -F compare terminfo-files"
1214 ," -G format %{number} to %'char'"
1215 ," -I use terminfo-names"
1216 ," -K use termcap-names and BSD syntax"
1217 ," -L use long names"
1218 ," -R subset (see manpage)"
1219 ," -T eliminate size limits (test)"
1220 ," -U do not post-process entries"
1221 ," -V print version"
1222 ," -W wrap long strings per -w[n]"
1224 ," -a with -F, list commented-out caps"
1226 ," -c list common capabilities"
1227 ," -d list different capabilities"
1228 ," -e format output for C initializer"
1229 ," -f with -1, format complex strings"
1230 ," -g format %'char' to %{number}"
1231 ," -i analyze initialization/reset"
1232 ," -l output terminfo names"
1233 ," -n list capabilities in neither"
1234 ," -p ignore padding specifiers"
1235 ," -Q number dump compiled description"
1236 ," -q brief listing, removes headers"
1237 ," -r with -C, output in termcap form"
1238 ," -r with -F, resolve use-references"
1239 ," -s [d|i|l|c] sort fields"
1241 ," -t suppress commented-out capabilities"
1243 ," -u produce source with 'use='"
1244 ," -v number (verbose)"
1245 ," -w number (width)"
1247 ," -x unknown capabilities are user-defined"
1251 const size_t last = SIZEOF(options);
1252 const size_t left = (last + 1) / 2;
1255 fputs(head, stderr);
1256 for (n = 0; n < left; n++) {
1257 size_t m = n + left;
1259 fprintf(stderr, "%-40.40s%s\n", options[n], options[m]);
1261 fprintf(stderr, "%s\n", options[n]);
1263 ExitProgram(EXIT_FAILURE);
1267 any_initializer(const char *fmt, const char *type)
1269 static char *initializer;
1273 if (initializer == 0) {
1274 need = (strlen(entries->tterm.term_names)
1277 initializer = (char *) malloc(need + 1);
1278 if (initializer == 0)
1279 failed("any_initializer");
1282 _nc_STRCPY(initializer, entries->tterm.term_names, need);
1283 for (s = initializer; *s != 0 && *s != '|'; s++) {
1284 if (!isalnum(UChar(*s)))
1288 _nc_SPRINTF(s, _nc_SLIMIT(need) fmt, type);
1293 name_initializer(const char *type)
1295 return any_initializer("_%s_data", type);
1299 string_variable(const char *type)
1301 return any_initializer("_s_%s", type);
1304 /* dump C initializers for the terminal type */
1306 dump_initializers(TERMTYPE2 *term)
1309 const char *str = 0;
1311 printf("\nstatic char %s[] = \"%s\";\n\n",
1312 name_initializer("alias"), entries->tterm.term_names);
1314 for_each_string(n, term) {
1315 if (VALID_STRING(term->Strings[n])) {
1316 char buf[MAX_STRING], *sp, *tp;
1319 #define TP_LIMIT ((MAX_STRING - 5) - (size_t)(tp - buf))
1321 for (sp = term->Strings[n];
1322 *sp != 0 && TP_LIMIT > 2;
1324 if (isascii(UChar(*sp))
1325 && isprint(UChar(*sp))
1330 _nc_SPRINTF(tp, _nc_SLIMIT(TP_LIMIT) "\\%03o", UChar(*sp));
1336 (void) printf("static char %-20s[] = %s;\n",
1337 string_variable(ExtStrname(term, (int) n, strnames)),
1343 (void) printf("static char %s[] = %s\n", name_initializer("bool"), L_CURL);
1345 for_each_boolean(n, term) {
1346 switch ((int) (term->Booleans[n])) {
1355 case ABSENT_BOOLEAN:
1356 str = "ABSENT_BOOLEAN";
1359 case CANCELLED_BOOLEAN:
1360 str = "CANCELLED_BOOLEAN";
1363 (void) printf("\t/* %3u: %-8s */\t%s,\n",
1364 n, ExtBoolname(term, (int) n, boolnames), str);
1366 (void) printf("%s;\n", R_CURL);
1368 (void) printf("static short %s[] = %s\n", name_initializer("number"), L_CURL);
1370 for_each_number(n, term) {
1372 switch (term->Numbers[n]) {
1373 case ABSENT_NUMERIC:
1374 str = "ABSENT_NUMERIC";
1376 case CANCELLED_NUMERIC:
1377 str = "CANCELLED_NUMERIC";
1380 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf)) "%d", term->Numbers[n]);
1384 (void) printf("\t/* %3u: %-8s */\t%s,\n", n,
1385 ExtNumname(term, (int) n, numnames), str);
1387 (void) printf("%s;\n", R_CURL);
1389 (void) printf("static char * %s[] = %s\n", name_initializer("string"), L_CURL);
1391 for_each_string(n, term) {
1393 if (term->Strings[n] == ABSENT_STRING)
1394 str = "ABSENT_STRING";
1395 else if (term->Strings[n] == CANCELLED_STRING)
1396 str = "CANCELLED_STRING";
1398 str = string_variable(ExtStrname(term, (int) n, strnames));
1400 (void) printf("\t/* %3u: %-8s */\t%s,\n", n,
1401 ExtStrname(term, (int) n, strnames), str);
1403 (void) printf("%s;\n", R_CURL);
1406 if ((NUM_BOOLEANS(term) != BOOLCOUNT)
1407 || (NUM_NUMBERS(term) != NUMCOUNT)
1408 || (NUM_STRINGS(term) != STRCOUNT)) {
1409 (void) printf("static char * %s[] = %s\n",
1410 name_initializer("string_ext"), L_CURL);
1411 for (n = BOOLCOUNT; n < NUM_BOOLEANS(term); ++n) {
1412 (void) printf("\t/* %3u: bool */\t\"%s\",\n",
1413 n, ExtBoolname(term, (int) n, boolnames));
1415 for (n = NUMCOUNT; n < NUM_NUMBERS(term); ++n) {
1416 (void) printf("\t/* %3u: num */\t\"%s\",\n",
1417 n, ExtNumname(term, (int) n, numnames));
1419 for (n = STRCOUNT; n < NUM_STRINGS(term); ++n) {
1420 (void) printf("\t/* %3u: str */\t\"%s\",\n",
1421 n, ExtStrname(term, (int) n, strnames));
1423 (void) printf("%s;\n", R_CURL);
1428 /* dump C initializers for the terminal type */
1430 dump_termtype(TERMTYPE2 *term)
1432 (void) printf("\t%s\n\t\t%s,\n", L_CURL, name_initializer("alias"));
1433 (void) printf("\t\t(char *)0,\t/* pointer to string table */\n");
1435 (void) printf("\t\t%s,\n", name_initializer("bool"));
1436 (void) printf("\t\t%s,\n", name_initializer("number"));
1438 (void) printf("\t\t%s,\n", name_initializer("string"));
1441 (void) printf("#if NCURSES_XNAMES\n");
1442 (void) printf("\t\t(char *)0,\t/* pointer to extended string table */\n");
1443 (void) printf("\t\t%s,\t/* ...corresponding names */\n",
1444 ((NUM_BOOLEANS(term) != BOOLCOUNT)
1445 || (NUM_NUMBERS(term) != NUMCOUNT)
1446 || (NUM_STRINGS(term) != STRCOUNT))
1447 ? name_initializer("string_ext")
1450 (void) printf("\t\t%d,\t\t/* count total Booleans */\n", NUM_BOOLEANS(term));
1451 (void) printf("\t\t%d,\t\t/* count total Numbers */\n", NUM_NUMBERS(term));
1452 (void) printf("\t\t%d,\t\t/* count total Strings */\n", NUM_STRINGS(term));
1454 (void) printf("\t\t%d,\t\t/* count extensions to Booleans */\n",
1455 NUM_BOOLEANS(term) - BOOLCOUNT);
1456 (void) printf("\t\t%d,\t\t/* count extensions to Numbers */\n",
1457 NUM_NUMBERS(term) - NUMCOUNT);
1458 (void) printf("\t\t%d,\t\t/* count extensions to Strings */\n",
1459 NUM_STRINGS(term) - STRCOUNT);
1461 (void) printf("#endif /* NCURSES_XNAMES */\n");
1464 #endif /* NCURSES_XNAMES */
1465 (void) printf("\t%s\n", R_CURL);
1469 optarg_to_number(void)
1472 long value = strtol(optarg, &temp, 0);
1474 if (temp == 0 || temp == optarg || *temp != 0) {
1475 fprintf(stderr, "Expected a number, not \"%s\"\n", optarg);
1476 ExitProgram(EXIT_FAILURE);
1486 if ((terminal = getenv("TERM")) == 0) {
1487 (void) fprintf(stderr,
1488 "%s: environment variable TERM not set\n",
1496 * Show the databases that infocmp knows about. The location to which it writes is
1499 show_databases(void)
1505 _nc_first_db(&state, &offset);
1506 while ((path2 = _nc_next_db(&state, &offset)) != 0) {
1507 printf("%s\n", path2);
1512 /***************************************************************************
1516 ***************************************************************************/
1519 #define MAIN_LEAKS() \
1520 _nc_free_termtype2(&entries[0].tterm); \
1521 _nc_free_termtype2(&entries[1].tterm); \
1526 #define MAIN_LEAKS() /* nothing */
1530 main(int argc, char *argv[])
1532 /* Avoid "local data >32k" error with mwcc */
1533 /* Also avoid overflowing smaller stacks on systems like AmigaOS */
1540 char *firstdir, *restdir;
1542 bool formatted = FALSE;
1543 bool filecompare = FALSE;
1545 bool init_analyze = FALSE;
1546 bool suppress_untranslatable = FALSE;
1548 bool wrap_strings = FALSE;
1550 /* where is the terminfo database location going to default to? */
1551 restdir = firstdir = 0;
1554 use_extended_names(FALSE);
1558 _nc_progname = _nc_rootname(argv[0]);
1560 /* make sure we have enough space to add two terminal entries */
1561 myargv = typeCalloc(char *, (size_t) (argc + 3));
1565 memcpy(myargv, argv, (sizeof(char *) * (size_t) argc));
1568 while ((c = getopt(argc,
1570 "01A:aB:CcDdEeFfGgIiKLlnpQ:qR:rs:TtUuVv:Ww:x")) != -1) {
1587 _nc_disable_period = TRUE;
1588 use_extended_names(TRUE);
1599 outform = F_TERMCAP;
1601 if (sortmode == S_DEFAULT)
1602 sortmode = S_TERMCAP;
1607 ExitProgram(EXIT_SUCCESS);
1615 compare = C_DIFFERENCE;
1643 outform = F_TERMINFO;
1644 if (sortmode == S_DEFAULT)
1645 sortmode = S_VARIABLE;
1650 init_analyze = TRUE;
1654 outform = F_VARIABLE;
1655 if (sortmode == S_DEFAULT)
1656 sortmode = S_VARIABLE;
1660 outform = F_TERMINFO;
1672 quickdump = optarg_to_number();
1692 sortmode = S_NOSORT;
1693 else if (*optarg == 'i')
1694 sortmode = S_TERMINFO;
1695 else if (*optarg == 'l')
1696 sortmode = S_VARIABLE;
1697 else if (*optarg == 'c')
1698 sortmode = S_TERMCAP;
1700 (void) fprintf(stderr,
1701 "%s: unknown sort mode\n",
1703 ExitProgram(EXIT_FAILURE);
1713 _nc_disable_period = FALSE;
1714 suppress_untranslatable = TRUE;
1727 puts(curses_version());
1728 ExitProgram(EXIT_SUCCESS);
1731 itrace = (unsigned) optarg_to_number();
1732 set_trace_level(itrace);
1736 wrap_strings = TRUE;
1740 mwidth = optarg_to_number();
1745 use_extended_names(TRUE);
1754 maxterms = (size_t) (argc + 2 - optind);
1755 if ((tfile = typeMalloc(path, maxterms)) == 0)
1757 if ((tname = typeCalloc(char *, maxterms)) == 0)
1759 if ((entries = typeCalloc(ENTRY, maxterms)) == 0)
1762 if ((entered = typeCalloc(ENTERED, maxterms)) == 0)
1769 fprintf(stderr, "%s: not enough memory\n", _nc_progname);
1770 ExitProgram(EXIT_FAILURE);
1773 /* by default, sort by terminfo name */
1774 if (sortmode == S_DEFAULT)
1775 sortmode = S_TERMINFO;
1777 /* make sure we have at least one terminal name to work with */
1779 argv[argc++] = terminal_env();
1781 /* if user is after a comparison, make sure we have two entries */
1782 if (compare != C_DEFAULT && optind >= argc - 1)
1783 argv[argc++] = terminal_env();
1785 /* exactly one terminal name with no options means display it */
1786 /* exactly two terminal names with no options means do -d */
1787 if (compare == C_DEFAULT) {
1788 switch (argc - optind) {
1790 fprintf(stderr, "%s: too many names to compare\n", _nc_progname);
1791 ExitProgram(EXIT_FAILURE);
1795 compare = C_DIFFERENCE;
1800 /* set up for display */
1801 dump_init(tversion, outform, sortmode,
1802 wrap_strings, mwidth, mheight, itrace,
1803 formatted, FALSE, quickdump);
1806 /* grab the entries */
1808 for (; optind < argc; optind++) {
1809 const char *directory = termcount ? restdir : firstdir;
1812 tname[termcount] = argv[optind];
1815 #if NCURSES_USE_DATABASE
1816 #if MIXEDCASE_FILENAMES
1817 #define LEAF_FMT "%c"
1819 #define LEAF_FMT "%02x"
1821 _nc_SPRINTF(tfile[termcount],
1822 _nc_SLIMIT(sizeof(path))
1823 "%s/" LEAF_FMT "/%s",
1825 UChar(*argv[optind]), argv[optind]);
1827 (void) fprintf(stderr,
1828 "%s: reading entry %s from file %s\n",
1830 argv[optind], tfile[termcount]);
1832 status = _nc_read_file_entry(tfile[termcount],
1833 &entries[termcount].tterm);
1835 (void) fprintf(stderr, "%s: terminfo files not supported\n",
1838 ExitProgram(EXIT_FAILURE);
1842 (void) fprintf(stderr,
1843 "%s: reading entry %s from database\n",
1847 status = _nc_read_entry2(tname[termcount],
1849 &entries[termcount].tterm);
1853 (void) fprintf(stderr,
1854 "%s: couldn't open terminfo file %s.\n",
1858 ExitProgram(EXIT_FAILURE);
1860 repair_acsc(&entries[termcount].tterm);
1866 _nc_align_termtype(&entries[0].tterm, &entries[1].tterm);
1869 /* dump as C initializer for the terminal type */
1872 dump_termtype(&entries[0].tterm);
1874 dump_initializers(&entries[0].tterm);
1877 /* analyze the init strings */
1878 else if (init_analyze) {
1880 #define CUR entries[0].tterm.
1881 analyze_string("is1", init_1string, &entries[0].tterm);
1882 analyze_string("is2", init_2string, &entries[0].tterm);
1883 analyze_string("is3", init_3string, &entries[0].tterm);
1884 analyze_string("rs1", reset_1string, &entries[0].tterm);
1885 analyze_string("rs2", reset_2string, &entries[0].tterm);
1886 analyze_string("rs3", reset_3string, &entries[0].tterm);
1887 analyze_string("smcup", enter_ca_mode, &entries[0].tterm);
1888 analyze_string("rmcup", exit_ca_mode, &entries[0].tterm);
1889 analyze_string("smkx", keypad_xmit, &entries[0].tterm);
1890 analyze_string("rmkx", keypad_local, &entries[0].tterm);
1897 * Here's where the real work gets done
1902 (void) fprintf(stderr,
1903 "%s: about to dump %s\n",
1908 printf("#\tReconstructed via infocmp from file: %s\n",
1910 dump_entry(&entries[0].tterm,
1911 suppress_untranslatable,
1917 (void) fprintf(stderr, "%s: length %d\n", _nc_progname, len);
1921 show_comparing(tname);
1922 compare_entry(compare_predicate, &entries->tterm, quiet);
1926 show_comparing(tname);
1927 compare_entry(compare_predicate, &entries->tterm, quiet);
1931 show_comparing(tname);
1932 compare_entry(compare_predicate, &entries->tterm, quiet);
1937 (void) fprintf(stderr, "%s: dumping use entry\n", _nc_progname);
1938 dump_entry(&entries[0].tterm,
1939 suppress_untranslatable,
1943 for (i = 1; i < termcount; i++)
1944 dump_uses(tname[i], !(outform == F_TERMCAP
1945 || outform == F_TCONVERR));
1948 (void) fprintf(stderr, "%s: length %d\n", _nc_progname, len);
1952 } else if (compare == C_USEALL) {
1953 (void) fprintf(stderr, "Sorry, -u doesn't work with -F\n");
1954 } else if (compare == C_DEFAULT) {
1955 (void) fprintf(stderr, "Use `tic -[CI] <file>' for this.\n");
1956 } else if (argc - optind != 2) {
1957 (void) fprintf(stderr,
1958 "File comparison needs exactly two file arguments.\n");
1960 file_comparison(argc - optind, argv + optind);
1964 ExitProgram(EXIT_SUCCESS);
1967 /* infocmp.c ends here */