1 /****************************************************************************
2 * Copyright 2020 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.144 2020/02/02 23:34:34 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 void ExitProgram(int code) GCC_NORETURN;
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 *ptr, char *buf)
129 /* extract the terminal type's primary name */
133 _nc_STRCPY(buf, ptr, NAMESIZE);
134 if ((bp = strchr(buf, '|')) != 0)
141 no_boolean(int value)
143 bool result = (value == ABSENT_BOOLEAN);
144 if (!strcmp(s_absent, s_cancel))
145 result = !VALID_BOOLEAN(value);
150 no_numeric(int value)
152 bool result = (value == ABSENT_NUMERIC);
153 if (!strcmp(s_absent, s_cancel))
154 result = !VALID_NUMERIC(value);
159 no_string(char *value)
161 bool result = (value == ABSENT_STRING);
162 if (!strcmp(s_absent, s_cancel))
163 result = !VALID_STRING(value);
167 /***************************************************************************
169 * Predicates for dump function
171 ***************************************************************************/
174 capcmp(PredIdx idx, const char *s, const char *t)
175 /* capability comparison function */
177 if (!VALID_STRING(s) && !VALID_STRING(t))
179 else if (!VALID_STRING(s) || !VALID_STRING(t))
182 if ((idx == acs_chars_index) || !ignorepads)
183 return (strcmp(s, t));
185 return (_nc_capcmp(s, t));
189 use_predicate(unsigned type, PredIdx idx)
190 /* predicate function to use for use decompilation */
200 * This assumes that multiple use entries are supposed
201 * to contribute the logical or of their boolean capabilities.
202 * This is true if we take the semantics of multiple uses to
203 * be 'each capability gets the first non-default value found
204 * in the sequence of use entries'.
206 * Note that cancelled or absent booleans are stored as FALSE,
207 * unlike numbers and strings, whose cancelled/absent state is
208 * recorded in the terminfo database.
210 for (ep = &entries[1]; ep < entries + termcount; ep++)
211 if (ep->tterm.Booleans[idx] == TRUE) {
212 is_set = entries[0].tterm.Booleans[idx];
215 if (is_set != entries[0].tterm.Booleans[idx])
223 int value = ABSENT_NUMERIC;
226 * We take the semantics of multiple uses to be 'each
227 * capability gets the first non-default value found
228 * in the sequence of use entries'.
230 for (ep = &entries[1]; ep < entries + termcount; ep++)
231 if (VALID_NUMERIC(ep->tterm.Numbers[idx])) {
232 value = ep->tterm.Numbers[idx];
236 if (value != entries[0].tterm.Numbers[idx])
237 return (value != ABSENT_NUMERIC);
244 char *termstr, *usestr = ABSENT_STRING;
246 termstr = entries[0].tterm.Strings[idx];
249 * We take the semantics of multiple uses to be 'each
250 * capability gets the first non-default value found
251 * in the sequence of use entries'.
253 for (ep = &entries[1]; ep < entries + termcount; ep++)
254 if (ep->tterm.Strings[idx]) {
255 usestr = ep->tterm.Strings[idx];
259 if (usestr == ABSENT_STRING && termstr == ABSENT_STRING)
261 else if (!usestr || !termstr || capcmp(idx, usestr, termstr))
268 return (FALSE); /* pacify compiler */
272 useeq(ENTRY * e1, ENTRY * e2)
273 /* are the use references in two entries equivalent? */
277 if (e1->nuses != e2->nuses)
280 /* Ugh...this is quadratic again */
281 for (i = 0; i < e1->nuses; i++) {
282 bool foundmatch = FALSE;
284 /* search second entry for given use reference */
285 for (j = 0; j < e2->nuses; j++)
286 if (!strcmp(e1->uses[i].name, e2->uses[j].name)) {
299 entryeq(TERMTYPE2 *t1, TERMTYPE2 *t2)
300 /* are two entries equivalent? */
304 for (i = 0; i < NUM_BOOLEANS(t1); i++)
305 if (t1->Booleans[i] != t2->Booleans[i])
308 for (i = 0; i < NUM_NUMBERS(t1); i++)
309 if (t1->Numbers[i] != t2->Numbers[i])
312 for (i = 0; i < NUM_STRINGS(t1); i++)
313 if (capcmp((PredIdx) i, t1->Strings[i], t2->Strings[i]))
319 #define TIC_EXPAND(result) _nc_tic_expand(result, outform==F_TERMINFO, numbers)
322 print_uses(ENTRY * ep, FILE *fp)
323 /* print an entry's use references */
330 for (i = 0; i < ep->nuses; i++) {
331 fputs(ep->uses[i].name, fp);
332 if (i < ep->nuses - 1)
338 dump_boolean(int val)
339 /* display the value of a boolean capability */
344 case CANCELLED_BOOLEAN:
356 dump_numeric(int val, char *buf)
357 /* display the value of a numeric capability */
361 _nc_STRCPY(buf, s_absent, MAX_STRING);
363 case CANCELLED_NUMERIC:
364 _nc_STRCPY(buf, s_cancel, MAX_STRING);
367 _nc_SPRINTF(buf, _nc_SLIMIT(MAX_STRING) "%d", val);
373 dump_string(char *val, char *buf)
374 /* display the value of a string capability */
376 if (val == ABSENT_STRING)
377 _nc_STRCPY(buf, s_absent, MAX_STRING);
378 else if (val == CANCELLED_STRING)
379 _nc_STRCPY(buf, s_cancel, MAX_STRING);
381 _nc_SPRINTF(buf, _nc_SLIMIT(MAX_STRING)
382 "'%.*s'", MAX_STRING - 3, TIC_EXPAND(val));
387 * Show "comparing..." message for the given terminal names.
390 show_comparing(char **names)
395 (void) fprintf(stderr, "%s: dumping differences\n", _nc_progname);
399 (void) fprintf(stderr, "%s: dumping common capabilities\n", _nc_progname);
403 (void) fprintf(stderr, "%s: dumping differences\n", _nc_progname);
408 printf("comparing %s", *names++);
410 printf(" to %s", *names++);
412 printf(", %s", *names++);
420 * ncurses stores two types of non-standard capabilities:
421 * a) capabilities listed past the "STOP-HERE" comment in the Caps file.
422 * These are used in the terminfo source file to provide data for termcaps,
423 * e.g., when there is no equivalent capability in terminfo, as well as for
424 * widely-used non-standard capabilities.
425 * b) user-definable capabilities, via "tic -x".
427 * However, if "-x" is omitted from the tic command, both types of
428 * non-standard capability are not loaded into the terminfo database. This
429 * macro is used for limit-checks against the symbols that tic uses to omit
430 * the two types of non-standard entry.
433 #define check_user_definable(n,limit) if (!_nc_user_definable && (n) > (limit)) break
435 #define check_user_definable(n,limit) if ((n) > (limit)) break
439 * Use these macros to simplify loops on C_COMMON and C_NAND:
441 #define for_each_entry() while (entries[extra].tterm.term_names)
442 #define next_entry (&(entries[extra++].tterm))
445 compare_predicate(PredType type, PredIdx idx, const char *name)
446 /* predicate function to use for entry difference reports */
448 ENTRY *e1 = &entries[0];
449 ENTRY *e2 = &entries[1];
450 char buf1[MAX_STRING];
451 char buf2[MAX_STRING];
460 check_user_definable(idx, BOOLWRITE);
461 b1 = e1->tterm.Booleans[idx];
464 b2 = next_entry->Booleans[idx];
465 if (!(no_boolean(b1) && no_boolean(b2)) && (b1 != b2))
466 (void) printf("\t%s: %s%s%s.\n",
474 if (b1 != ABSENT_BOOLEAN) {
477 b2 = next_entry->Booleans[idx];
484 (void) printf("\t%s= %s.\n", name, dump_boolean(b1));
490 if (b1 == ABSENT_BOOLEAN) {
493 b2 = next_entry->Booleans[idx];
500 (void) printf("\t!%s.\n", name);
508 check_user_definable(idx, NUMWRITE);
509 n1 = e1->tterm.Numbers[idx];
512 n2 = next_entry->Numbers[idx];
513 if (!(no_numeric(n1) && no_numeric(n2)) && n1 != n2) {
514 dump_numeric(n1, buf1);
515 dump_numeric(n2, buf2);
516 (void) printf("\t%s: %s, %s.\n", name, buf1, buf2);
521 if (n1 != ABSENT_NUMERIC) {
524 n2 = next_entry->Numbers[idx];
531 dump_numeric(n1, buf1);
532 (void) printf("\t%s= %s.\n", name, buf1);
538 if (n1 == ABSENT_NUMERIC) {
541 n2 = next_entry->Numbers[idx];
548 (void) printf("\t!%s.\n", name);
556 check_user_definable(idx, STRWRITE);
557 s1 = e1->tterm.Strings[idx];
560 s2 = next_entry->Strings[idx];
561 if (!(no_string(s1) && no_string(s2)) && capcmp(idx, s1, s2)) {
562 dump_string(s1, buf1);
563 dump_string(s2, buf2);
564 if (strcmp(buf1, buf2))
565 (void) printf("\t%s: %s, %s.\n", name, buf1, buf2);
570 if (s1 != ABSENT_STRING) {
573 s2 = next_entry->Strings[idx];
574 if (capcmp(idx, s1, s2) != 0) {
580 (void) printf("\t%s= '%s'.\n", name, TIC_EXPAND(s1));
586 if (s1 == ABSENT_STRING) {
589 s2 = next_entry->Strings[idx];
596 (void) printf("\t!%s.\n", name);
604 /* unlike the other modes, this compares *all* use entries */
607 if (!useeq(e1, e2)) {
608 (void) fputs("\tuse: ", stdout);
609 print_uses(e1, stdout);
611 print_uses(e2, stdout);
612 fputs(".\n", stdout);
620 e2 = &entries[extra++];
621 if (e2->nuses != e1->nuses || !useeq(e1, e2)) {
627 (void) fputs("\tuse: ", stdout);
628 print_uses(e1, stdout);
629 fputs(".\n", stdout);
638 e2 = &entries[extra++];
639 if (e2->nuses != e1->nuses) {
645 (void) printf("\t!use.\n");
653 /***************************************************************************
655 * Init string analysis
657 ***************************************************************************/
659 #define DATA(from, to) { { from }, { to } }
660 #define DATAX() DATA("", "")
667 static const assoc std_caps[] =
669 /* these are specified by X.364 and iBCS2 */
670 DATA("\033c", "RIS"), /* full reset */
671 DATA("\0337", "SC"), /* save cursor */
672 DATA("\0338", "RC"), /* restore cursor */
673 DATA("\033[r", "RSR"), /* not an X.364 mnemonic */
674 DATA("\033[m", "SGR0"), /* not an X.364 mnemonic */
675 DATA("\033[2J", "ED2"), /* clear page */
677 /* this group is specified by ISO 2022 */
678 DATA("\033(0", "ISO DEC G0"), /* enable DEC graphics for G0 */
679 DATA("\033(A", "ISO UK G0"), /* enable UK chars for G0 */
680 DATA("\033(B", "ISO US G0"), /* enable US chars for G0 */
681 DATA("\033)0", "ISO DEC G1"), /* enable DEC graphics for G1 */
682 DATA("\033)A", "ISO UK G1"), /* enable UK chars for G1 */
683 DATA("\033)B", "ISO US G1"), /* enable US chars for G1 */
685 /* these are DEC private controls widely supported by emulators */
686 DATA("\033=", "DECPAM"), /* application keypad mode */
687 DATA("\033>", "DECPNM"), /* normal keypad mode */
688 DATA("\033<", "DECANSI"), /* enter ANSI mode */
689 DATA("\033[!p", "DECSTR"), /* soft reset */
690 DATA("\033 F", "S7C1T"), /* 7-bit controls */
695 static const assoc std_modes[] =
696 /* ECMA \E[ ... [hl] modes recognized by many emulators */
698 DATA("2", "AM"), /* keyboard action mode */
699 DATA("4", "IRM"), /* insert/replace mode */
700 DATA("12", "SRM"), /* send/receive mode */
701 DATA("20", "LNM"), /* linefeed mode */
705 static const assoc private_modes[] =
706 /* DEC \E[ ... [hl] modes recognized by many emulators */
708 DATA("1", "CKM"), /* application cursor keys */
709 DATA("2", "ANM"), /* set VT52 mode */
710 DATA("3", "COLM"), /* 132-column mode */
711 DATA("4", "SCLM"), /* smooth scroll */
712 DATA("5", "SCNM"), /* reverse video mode */
713 DATA("6", "OM"), /* origin mode */
714 DATA("7", "AWM"), /* wraparound mode */
715 DATA("8", "ARM"), /* auto-repeat mode */
719 static const assoc ecma_highlights[] =
720 /* recognize ECMA attribute sequences */
722 DATA("0", "NORMAL"), /* normal */
723 DATA("1", "+BOLD"), /* bold on */
724 DATA("2", "+DIM"), /* dim on */
725 DATA("3", "+ITALIC"), /* italic on */
726 DATA("4", "+UNDERLINE"), /* underline on */
727 DATA("5", "+BLINK"), /* blink on */
728 DATA("6", "+FASTBLINK"), /* fastblink on */
729 DATA("7", "+REVERSE"), /* reverse on */
730 DATA("8", "+INVISIBLE"), /* invisible on */
731 DATA("9", "+DELETED"), /* deleted on */
732 DATA("10", "MAIN-FONT"), /* select primary font */
733 DATA("11", "ALT-FONT-1"), /* select alternate font 1 */
734 DATA("12", "ALT-FONT-2"), /* select alternate font 2 */
735 DATA("13", "ALT-FONT-3"), /* select alternate font 3 */
736 DATA("14", "ALT-FONT-4"), /* select alternate font 4 */
737 DATA("15", "ALT-FONT-5"), /* select alternate font 5 */
738 DATA("16", "ALT-FONT-6"), /* select alternate font 6 */
739 DATA("17", "ALT-FONT-7"), /* select alternate font 7 */
740 DATA("18", "ALT-FONT-1"), /* select alternate font 1 */
741 DATA("19", "ALT-FONT-1"), /* select alternate font 1 */
742 DATA("20", "FRAKTUR"), /* Fraktur font */
743 DATA("21", "DOUBLEUNDER"), /* double underline */
744 DATA("22", "-DIM"), /* dim off */
745 DATA("23", "-ITALIC"), /* italic off */
746 DATA("24", "-UNDERLINE"), /* underline off */
747 DATA("25", "-BLINK"), /* blink off */
748 DATA("26", "-FASTBLINK"), /* fastblink off */
749 DATA("27", "-REVERSE"), /* reverse off */
750 DATA("28", "-INVISIBLE"), /* invisible off */
751 DATA("29", "-DELETED"), /* deleted off */
758 skip_csi(const char *cap)
761 if (cap[0] == '\033' && cap[1] == '[')
763 else if (UChar(cap[0]) == 0233)
769 same_param(const char *table, const char *param, size_t length)
772 if (strncmp(table, param, length) == 0) {
773 result = !isdigit(UChar(param[length]));
779 lookup_params(const assoc * table, char *dst, char *src)
782 const char *ep = strtok(src, ";");
790 for (ap = table; ap->from[0]; ap++) {
791 size_t tlen = strlen(ap->from);
793 if (same_param(ap->from, ep, tlen)) {
794 _nc_STRCAT(dst, ap->to, MAX_TERMINFO_LENGTH);
801 _nc_STRCAT(dst, ep, MAX_TERMINFO_LENGTH);
802 _nc_STRCAT(dst, ";", MAX_TERMINFO_LENGTH);
804 ((ep = strtok((char *) 0, ";")));
806 dst[strlen(dst) - 1] = '\0';
814 analyze_string(const char *name, const char *cap, TERMTYPE2 *tp)
816 char buf2[MAX_TERMINFO_LENGTH];
819 int tp_lines = tp->Numbers[2];
821 if (!VALID_STRING(cap))
823 (void) printf("%s: ", name);
825 for (sp = cap; *sp; sp++) {
830 const char *expansion = 0;
831 char buf3[MAX_TERMINFO_LENGTH];
833 /* first, check other capabilities in this entry */
834 for (i = 0; i < STRCOUNT; i++) {
835 char *cp = tp->Strings[i];
837 /* don't use function-key capabilities */
838 if (strnames[i][0] == 'k' && strnames[i][1] == 'f')
841 if (VALID_STRING(cp) &&
845 _nc_STRNCPY(buf2, sp, len);
848 if (_nc_capcmp(cp, buf2))
851 #define ISRS(s) (!strncmp((s), "is", (size_t) 2) || !strncmp((s), "rs", (size_t) 2))
853 * Theoretically we just passed the test for translation
854 * (equality once the padding is stripped). However, there
855 * are a few more hoops that need to be jumped so that
856 * identical pairs of initialization and reset strings
857 * don't just refer to each other.
859 if (ISRS(name) || ISRS(strnames[i]))
864 expansion = strnames[i];
869 /* now check the standard capabilities */
872 for (ap = std_caps; ap->from[0]; ap++) {
873 size_t adj = (size_t) (csi ? 2 : 0);
875 len = strlen(ap->from);
876 if (csi && skip_csi(ap->from) != csi)
879 && strncmp(ap->from + adj, sp + csi, len - adj) == 0) {
888 /* now check for standard-mode sequences */
890 && (csi = skip_csi(sp)) != 0
891 && (len = (strspn) (sp + csi, "0123456789;"))
892 && (len < sizeof(buf3))
893 && (next = (size_t) csi + len)
894 && ((sp[next] == 'h') || (sp[next] == 'l'))) {
901 _nc_STRNCPY(buf3, sp + csi, len);
903 len += (size_t) csi + 1;
905 expansion = lookup_params(std_modes, buf2, buf3);
908 /* now check for private-mode sequences */
910 && (csi = skip_csi(sp)) != 0
912 && (len = (strspn) (sp + csi + 1, "0123456789;"))
913 && (len < sizeof(buf3))
914 && (next = (size_t) csi + 1 + len)
915 && ((sp[next] == 'h') || (sp[next] == 'l'))) {
922 _nc_STRNCPY(buf3, sp + csi + 1, len);
924 len += (size_t) csi + 2;
926 expansion = lookup_params(private_modes, buf2, buf3);
929 /* now check for ECMA highlight sequences */
931 && (csi = skip_csi(sp)) != 0
932 && (len = (strspn) (sp + csi, "0123456789;")) != 0
933 && (len < sizeof(buf3))
934 && (next = (size_t) csi + len)
935 && sp[next] == 'm') {
937 _nc_STRCPY(buf2, "SGR:", sizeof(buf2));
938 _nc_STRNCPY(buf3, sp + csi, len);
940 len += (size_t) csi + 1;
942 expansion = lookup_params(ecma_highlights, buf2, buf3);
946 && (csi = skip_csi(sp)) != 0
948 len = (size_t) csi + 1;
949 _nc_STRCPY(buf2, "SGR:", sizeof(buf2));
950 _nc_STRCAT(buf2, ecma_highlights[0].to, sizeof(buf2));
954 /* now check for scroll region reset */
956 && (csi = skip_csi(sp)) != 0) {
957 if (sp[csi] == 'r') {
961 _nc_SPRINTF(buf2, _nc_SLIMIT(sizeof(buf2)) "1;%dr", tp_lines);
963 if (strncmp(buf2, sp + csi, len) == 0)
969 /* now check for home-down */
971 && (csi = skip_csi(sp)) != 0) {
972 _nc_SPRINTF(buf2, _nc_SLIMIT(sizeof(buf2)) "%d;1H", tp_lines);
974 if (strncmp(buf2, sp + csi, len) == 0) {
977 _nc_SPRINTF(buf2, _nc_SLIMIT(sizeof(buf2)) "%dH", tp_lines);
979 if (strncmp(buf2, sp + csi, len) == 0) {
986 /* now look at the expansion we got, if any */
988 printf("{%s}", expansion);
991 /* couldn't match anything */
994 fputs(TIC_EXPAND(buf2), stdout);
1000 /***************************************************************************
1004 ***************************************************************************/
1007 file_comparison(int argc, char *argv[])
1009 #define MAXCOMPARE 2
1010 /* someday we may allow comparisons on more files */
1012 ENTRY *heads[MAXCOMPARE];
1016 memset(heads, 0, sizeof(heads));
1017 dump_init((char *) 0, F_LITERAL, S_TERMINFO,
1018 FALSE, 0, 65535, itrace, FALSE, FALSE, FALSE);
1020 for (n = 0; n < argc && n < MAXCOMPARE; n++) {
1021 if (freopen(argv[n], "r", stdin) == 0)
1022 _nc_err_abort("Can't open %s", argv[n]);
1025 entered[n].head = _nc_head;
1026 entered[n].tail = _nc_tail;
1028 _nc_head = _nc_tail = 0;
1030 /* parse entries out of the source file */
1031 _nc_set_source(argv[n]);
1032 _nc_read_entry_source(stdin, NULL, TRUE, literal, NULLHOOK);
1035 (void) fprintf(stderr, "Resolving file %d...\n", n - 0);
1037 /* maybe do use resolution */
1038 if (!_nc_resolve_uses2(!limited, literal)) {
1039 (void) fprintf(stderr,
1040 "There are unresolved use entries in %s:\n",
1042 for_entry_list(qp) {
1044 (void) fputs(qp->tterm.term_names, stderr);
1045 (void) fputc('\n', stderr);
1048 ExitProgram(EXIT_FAILURE);
1051 heads[filecount] = _nc_head;
1055 /* OK, all entries are in core. Ready to do the comparison */
1057 (void) fprintf(stderr, "Entries are now in core...\n");
1059 /* The entry-matching loop. Sigh, this is intrinsically quadratic. */
1060 for (qp = heads[0]; qp; qp = qp->next) {
1061 for (rp = heads[1]; rp; rp = rp->next)
1062 if (_nc_entry_match(qp->tterm.term_names, rp->tterm.term_names)) {
1063 if (qp->ncrosslinks < MAX_CROSSLINKS)
1064 qp->crosslinks[qp->ncrosslinks] = rp;
1067 if (rp->ncrosslinks < MAX_CROSSLINKS)
1068 rp->crosslinks[rp->ncrosslinks] = qp;
1073 /* now we have two circular lists with crosslinks */
1075 (void) fprintf(stderr, "Name matches are done...\n");
1077 for (qp = heads[0]; qp; qp = qp->next) {
1078 if (qp->ncrosslinks > 1) {
1079 (void) fprintf(stderr,
1080 "%s in file 1 (%s) has %d matches in file 2 (%s):\n",
1081 _nc_first_name(qp->tterm.term_names),
1085 for (i = 0; i < qp->ncrosslinks; i++)
1086 (void) fprintf(stderr,
1088 _nc_first_name((qp->crosslinks[i])->tterm.term_names));
1092 for (rp = heads[1]; rp; rp = rp->next) {
1093 if (rp->ncrosslinks > 1) {
1094 (void) fprintf(stderr,
1095 "%s in file 2 (%s) has %d matches in file 1 (%s):\n",
1096 _nc_first_name(rp->tterm.term_names),
1100 for (i = 0; i < rp->ncrosslinks; i++)
1101 (void) fprintf(stderr,
1103 _nc_first_name((rp->crosslinks[i])->tterm.term_names));
1107 (void) printf("In file 1 (%s) only:\n", argv[0]);
1108 for (qp = heads[0]; qp; qp = qp->next)
1109 if (qp->ncrosslinks == 0)
1110 (void) printf("\t%s\n",
1111 _nc_first_name(qp->tterm.term_names));
1113 (void) printf("In file 2 (%s) only:\n", argv[1]);
1114 for (rp = heads[1]; rp; rp = rp->next)
1115 if (rp->ncrosslinks == 0)
1116 (void) printf("\t%s\n",
1117 _nc_first_name(rp->tterm.term_names));
1119 (void) printf("The following entries are equivalent:\n");
1120 for (qp = heads[0]; qp; qp = qp->next) {
1121 if (qp->ncrosslinks == 1) {
1122 rp = qp->crosslinks[0];
1124 repair_acsc(&qp->tterm);
1125 repair_acsc(&rp->tterm);
1127 _nc_align_termtype(&qp->tterm, &rp->tterm);
1129 if (entryeq(&qp->tterm, &rp->tterm) && useeq(qp, rp)) {
1130 char name1[NAMESIZE], name2[NAMESIZE];
1132 (void) canonical_name(qp->tterm.term_names, name1);
1133 (void) canonical_name(rp->tterm.term_names, name2);
1135 (void) printf("%s = %s\n", name1, name2);
1140 (void) printf("Differing entries:\n");
1142 for (qp = heads[0]; qp; qp = qp->next) {
1144 if (qp->ncrosslinks == 1) {
1145 rp = qp->crosslinks[0];
1147 /* sorry - we have to do this on each pass */
1148 _nc_align_termtype(&qp->tterm, &rp->tterm);
1150 if (!(entryeq(&qp->tterm, &rp->tterm) && useeq(qp, rp))) {
1151 char name1[NAMESIZE], name2[NAMESIZE];
1161 (void) canonical_name(qp->tterm.term_names, name1);
1162 (void) canonical_name(rp->tterm.term_names, name2);
1166 show_comparing(names);
1167 compare_entry(compare_predicate, &entries->tterm, quiet);
1171 show_comparing(names);
1172 compare_entry(compare_predicate, &entries->tterm, quiet);
1176 show_comparing(names);
1177 compare_entry(compare_predicate, &entries->tterm, quiet);
1189 #define DATA(s) s "\n"
1190 static const char head[] =
1192 DATA("Usage: infocmp [options] [-A directory] [-B directory] [termname...]")
1198 static const char options[][45] =
1200 " -0 print single-row"
1201 ," -1 print single-column"
1202 ," -C use termcap-names"
1203 ," -D print database locations"
1204 ," -E format output as C tables"
1205 ," -F compare terminfo-files"
1206 ," -G format %{number} to %'char'"
1207 ," -I use terminfo-names"
1208 ," -K use termcap-names and BSD syntax"
1209 ," -L use long names"
1210 ," -R subset (see manpage)"
1211 ," -T eliminate size limits (test)"
1212 ," -U do not post-process entries"
1213 ," -V print version"
1214 ," -W wrap long strings per -w[n]"
1216 ," -a with -F, list commented-out caps"
1218 ," -c list common capabilities"
1219 ," -d list different capabilities"
1220 ," -e format output for C initializer"
1221 ," -f with -1, format complex strings"
1222 ," -g format %'char' to %{number}"
1223 ," -i analyze initialization/reset"
1224 ," -l output terminfo names"
1225 ," -n list capabilities in neither"
1226 ," -p ignore padding specifiers"
1227 ," -Q number dump compiled description"
1228 ," -q brief listing, removes headers"
1229 ," -r with -C, output in termcap form"
1230 ," -r with -F, resolve use-references"
1231 ," -s [d|i|l|c] sort fields"
1233 ," -t suppress commented-out capabilities"
1235 ," -u produce source with 'use='"
1236 ," -v number (verbose)"
1237 ," -w number (width)"
1239 ," -x unknown capabilities are user-defined"
1243 const size_t last = SIZEOF(options);
1244 const size_t left = (last + 1) / 2;
1247 fputs(head, stderr);
1248 for (n = 0; n < left; n++) {
1249 size_t m = n + left;
1251 fprintf(stderr, "%-40.40s%s\n", options[n], options[m]);
1253 fprintf(stderr, "%s\n", options[n]);
1255 ExitProgram(EXIT_FAILURE);
1259 any_initializer(const char *fmt, const char *type)
1261 static char *initializer;
1265 if (initializer == 0) {
1266 need = (strlen(entries->tterm.term_names)
1269 initializer = (char *) malloc(need + 1);
1270 if (initializer == 0)
1271 failed("any_initializer");
1274 _nc_STRCPY(initializer, entries->tterm.term_names, need);
1275 for (s = initializer; *s != 0 && *s != '|'; s++) {
1276 if (!isalnum(UChar(*s)))
1280 _nc_SPRINTF(s, _nc_SLIMIT(need) fmt, type);
1285 name_initializer(const char *type)
1287 return any_initializer("_%s_data", type);
1291 string_variable(const char *type)
1293 return any_initializer("_s_%s", type);
1296 /* dump C initializers for the terminal type */
1298 dump_initializers(TERMTYPE2 *term)
1301 const char *str = 0;
1303 printf("\nstatic char %s[] = \"%s\";\n\n",
1304 name_initializer("alias"), entries->tterm.term_names);
1306 for_each_string(n, term) {
1307 char buf[MAX_STRING], *sp, *tp;
1309 if (VALID_STRING(term->Strings[n])) {
1311 #define TP_LIMIT ((MAX_STRING - 5) - (size_t)(tp - buf))
1313 for (sp = term->Strings[n];
1314 *sp != 0 && TP_LIMIT > 2;
1316 if (isascii(UChar(*sp))
1317 && isprint(UChar(*sp))
1322 _nc_SPRINTF(tp, _nc_SLIMIT(TP_LIMIT) "\\%03o", UChar(*sp));
1328 (void) printf("static char %-20s[] = %s;\n",
1329 string_variable(ExtStrname(term, (int) n, strnames)),
1335 (void) printf("static char %s[] = %s\n", name_initializer("bool"), L_CURL);
1337 for_each_boolean(n, term) {
1338 switch ((int) (term->Booleans[n])) {
1347 case ABSENT_BOOLEAN:
1348 str = "ABSENT_BOOLEAN";
1351 case CANCELLED_BOOLEAN:
1352 str = "CANCELLED_BOOLEAN";
1355 (void) printf("\t/* %3u: %-8s */\t%s,\n",
1356 n, ExtBoolname(term, (int) n, boolnames), str);
1358 (void) printf("%s;\n", R_CURL);
1360 (void) printf("static short %s[] = %s\n", name_initializer("number"), L_CURL);
1362 for_each_number(n, term) {
1364 switch (term->Numbers[n]) {
1365 case ABSENT_NUMERIC:
1366 str = "ABSENT_NUMERIC";
1368 case CANCELLED_NUMERIC:
1369 str = "CANCELLED_NUMERIC";
1372 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf)) "%d", term->Numbers[n]);
1376 (void) printf("\t/* %3u: %-8s */\t%s,\n", n,
1377 ExtNumname(term, (int) n, numnames), str);
1379 (void) printf("%s;\n", R_CURL);
1381 (void) printf("static char * %s[] = %s\n", name_initializer("string"), L_CURL);
1383 for_each_string(n, term) {
1385 if (term->Strings[n] == ABSENT_STRING)
1386 str = "ABSENT_STRING";
1387 else if (term->Strings[n] == CANCELLED_STRING)
1388 str = "CANCELLED_STRING";
1390 str = string_variable(ExtStrname(term, (int) n, strnames));
1392 (void) printf("\t/* %3u: %-8s */\t%s,\n", n,
1393 ExtStrname(term, (int) n, strnames), str);
1395 (void) printf("%s;\n", R_CURL);
1398 if ((NUM_BOOLEANS(term) != BOOLCOUNT)
1399 || (NUM_NUMBERS(term) != NUMCOUNT)
1400 || (NUM_STRINGS(term) != STRCOUNT)) {
1401 (void) printf("static char * %s[] = %s\n",
1402 name_initializer("string_ext"), L_CURL);
1403 for (n = BOOLCOUNT; n < NUM_BOOLEANS(term); ++n) {
1404 (void) printf("\t/* %3u: bool */\t\"%s\",\n",
1405 n, ExtBoolname(term, (int) n, boolnames));
1407 for (n = NUMCOUNT; n < NUM_NUMBERS(term); ++n) {
1408 (void) printf("\t/* %3u: num */\t\"%s\",\n",
1409 n, ExtNumname(term, (int) n, numnames));
1411 for (n = STRCOUNT; n < NUM_STRINGS(term); ++n) {
1412 (void) printf("\t/* %3u: str */\t\"%s\",\n",
1413 n, ExtStrname(term, (int) n, strnames));
1415 (void) printf("%s;\n", R_CURL);
1420 /* dump C initializers for the terminal type */
1422 dump_termtype(TERMTYPE2 *term)
1424 (void) printf("\t%s\n\t\t%s,\n", L_CURL, name_initializer("alias"));
1425 (void) printf("\t\t(char *)0,\t/* pointer to string table */\n");
1427 (void) printf("\t\t%s,\n", name_initializer("bool"));
1428 (void) printf("\t\t%s,\n", name_initializer("number"));
1430 (void) printf("\t\t%s,\n", name_initializer("string"));
1433 (void) printf("#if NCURSES_XNAMES\n");
1434 (void) printf("\t\t(char *)0,\t/* pointer to extended string table */\n");
1435 (void) printf("\t\t%s,\t/* ...corresponding names */\n",
1436 ((NUM_BOOLEANS(term) != BOOLCOUNT)
1437 || (NUM_NUMBERS(term) != NUMCOUNT)
1438 || (NUM_STRINGS(term) != STRCOUNT))
1439 ? name_initializer("string_ext")
1442 (void) printf("\t\t%d,\t\t/* count total Booleans */\n", NUM_BOOLEANS(term));
1443 (void) printf("\t\t%d,\t\t/* count total Numbers */\n", NUM_NUMBERS(term));
1444 (void) printf("\t\t%d,\t\t/* count total Strings */\n", NUM_STRINGS(term));
1446 (void) printf("\t\t%d,\t\t/* count extensions to Booleans */\n",
1447 NUM_BOOLEANS(term) - BOOLCOUNT);
1448 (void) printf("\t\t%d,\t\t/* count extensions to Numbers */\n",
1449 NUM_NUMBERS(term) - NUMCOUNT);
1450 (void) printf("\t\t%d,\t\t/* count extensions to Strings */\n",
1451 NUM_STRINGS(term) - STRCOUNT);
1453 (void) printf("#endif /* NCURSES_XNAMES */\n");
1456 #endif /* NCURSES_XNAMES */
1457 (void) printf("\t%s\n", R_CURL);
1461 optarg_to_number(void)
1464 long value = strtol(optarg, &temp, 0);
1466 if (temp == 0 || temp == optarg || *temp != 0) {
1467 fprintf(stderr, "Expected a number, not \"%s\"\n", optarg);
1468 ExitProgram(EXIT_FAILURE);
1478 if ((terminal = getenv("TERM")) == 0) {
1479 (void) fprintf(stderr,
1480 "%s: environment variable TERM not set\n",
1488 * Show the databases that infocmp knows about. The location to which it writes is
1491 show_databases(void)
1497 _nc_first_db(&state, &offset);
1498 while ((path2 = _nc_next_db(&state, &offset)) != 0) {
1499 printf("%s\n", path2);
1504 /***************************************************************************
1508 ***************************************************************************/
1511 #define MAIN_LEAKS() \
1516 #define MAIN_LEAKS() /* nothing */
1520 main(int argc, char *argv[])
1522 /* Avoid "local data >32k" error with mwcc */
1523 /* Also avoid overflowing smaller stacks on systems like AmigaOS */
1530 char *firstdir, *restdir;
1532 bool formatted = FALSE;
1533 bool filecompare = FALSE;
1535 bool init_analyze = FALSE;
1536 bool suppress_untranslatable = FALSE;
1538 bool wrap_strings = FALSE;
1540 /* where is the terminfo database location going to default to? */
1541 restdir = firstdir = 0;
1544 use_extended_names(FALSE);
1548 _nc_progname = _nc_rootname(argv[0]);
1550 /* make sure we have enough space to add two terminal entries */
1551 myargv = typeCalloc(char *, (size_t) (argc + 3));
1555 memcpy(myargv, argv, (sizeof(char *) * (size_t) argc));
1558 while ((c = getopt(argc,
1560 "01A:aB:CcDdEeFfGgIiKLlnpQ:qR:rs:TtUuVv:Ww:x")) != -1) {
1577 _nc_disable_period = TRUE;
1578 use_extended_names(TRUE);
1589 outform = F_TERMCAP;
1591 if (sortmode == S_DEFAULT)
1592 sortmode = S_TERMCAP;
1597 ExitProgram(EXIT_SUCCESS);
1605 compare = C_DIFFERENCE;
1633 outform = F_TERMINFO;
1634 if (sortmode == S_DEFAULT)
1635 sortmode = S_VARIABLE;
1640 init_analyze = TRUE;
1644 outform = F_VARIABLE;
1645 if (sortmode == S_DEFAULT)
1646 sortmode = S_VARIABLE;
1650 outform = F_TERMINFO;
1662 quickdump = optarg_to_number();
1682 sortmode = S_NOSORT;
1683 else if (*optarg == 'i')
1684 sortmode = S_TERMINFO;
1685 else if (*optarg == 'l')
1686 sortmode = S_VARIABLE;
1687 else if (*optarg == 'c')
1688 sortmode = S_TERMCAP;
1690 (void) fprintf(stderr,
1691 "%s: unknown sort mode\n",
1693 ExitProgram(EXIT_FAILURE);
1703 _nc_disable_period = FALSE;
1704 suppress_untranslatable = TRUE;
1717 puts(curses_version());
1718 ExitProgram(EXIT_SUCCESS);
1721 itrace = (unsigned) optarg_to_number();
1722 set_trace_level(itrace);
1726 wrap_strings = TRUE;
1730 mwidth = optarg_to_number();
1735 use_extended_names(TRUE);
1744 maxterms = (size_t) (argc + 2 - optind);
1745 if ((tfile = typeMalloc(path, maxterms)) == 0)
1747 if ((tname = typeCalloc(char *, maxterms)) == 0)
1749 if ((entries = typeCalloc(ENTRY, maxterms)) == 0)
1752 if ((entered = typeCalloc(ENTERED, maxterms)) == 0)
1759 fprintf(stderr, "%s: not enough memory\n", _nc_progname);
1760 ExitProgram(EXIT_FAILURE);
1763 /* by default, sort by terminfo name */
1764 if (sortmode == S_DEFAULT)
1765 sortmode = S_TERMINFO;
1767 /* make sure we have at least one terminal name to work with */
1769 argv[argc++] = terminal_env();
1771 /* if user is after a comparison, make sure we have two entries */
1772 if (compare != C_DEFAULT && optind >= argc - 1)
1773 argv[argc++] = terminal_env();
1775 /* exactly one terminal name with no options means display it */
1776 /* exactly two terminal names with no options means do -d */
1777 if (compare == C_DEFAULT) {
1778 switch (argc - optind) {
1780 fprintf(stderr, "%s: too many names to compare\n", _nc_progname);
1781 ExitProgram(EXIT_FAILURE);
1785 compare = C_DIFFERENCE;
1790 /* set up for display */
1791 dump_init(tversion, outform, sortmode,
1792 wrap_strings, mwidth, mheight, itrace,
1793 formatted, FALSE, quickdump);
1796 /* grab the entries */
1798 for (; optind < argc; optind++) {
1799 const char *directory = termcount ? restdir : firstdir;
1802 tname[termcount] = argv[optind];
1805 #if NCURSES_USE_DATABASE
1806 #if MIXEDCASE_FILENAMES
1807 #define LEAF_FMT "%c"
1809 #define LEAF_FMT "%02x"
1811 _nc_SPRINTF(tfile[termcount],
1812 _nc_SLIMIT(sizeof(path))
1813 "%s/" LEAF_FMT "/%s",
1815 UChar(*argv[optind]), argv[optind]);
1817 (void) fprintf(stderr,
1818 "%s: reading entry %s from file %s\n",
1820 argv[optind], tfile[termcount]);
1822 status = _nc_read_file_entry(tfile[termcount],
1823 &entries[termcount].tterm);
1825 (void) fprintf(stderr, "%s: terminfo files not supported\n",
1828 ExitProgram(EXIT_FAILURE);
1832 (void) fprintf(stderr,
1833 "%s: reading entry %s from database\n",
1837 status = _nc_read_entry2(tname[termcount],
1839 &entries[termcount].tterm);
1843 (void) fprintf(stderr,
1844 "%s: couldn't open terminfo file %s.\n",
1848 ExitProgram(EXIT_FAILURE);
1850 repair_acsc(&entries[termcount].tterm);
1856 _nc_align_termtype(&entries[0].tterm, &entries[1].tterm);
1859 /* dump as C initializer for the terminal type */
1862 dump_termtype(&entries[0].tterm);
1864 dump_initializers(&entries[0].tterm);
1867 /* analyze the init strings */
1868 else if (init_analyze) {
1870 #define CUR entries[0].tterm.
1871 analyze_string("is1", init_1string, &entries[0].tterm);
1872 analyze_string("is2", init_2string, &entries[0].tterm);
1873 analyze_string("is3", init_3string, &entries[0].tterm);
1874 analyze_string("rs1", reset_1string, &entries[0].tterm);
1875 analyze_string("rs2", reset_2string, &entries[0].tterm);
1876 analyze_string("rs3", reset_3string, &entries[0].tterm);
1877 analyze_string("smcup", enter_ca_mode, &entries[0].tterm);
1878 analyze_string("rmcup", exit_ca_mode, &entries[0].tterm);
1879 analyze_string("smkx", keypad_xmit, &entries[0].tterm);
1880 analyze_string("rmkx", keypad_local, &entries[0].tterm);
1885 * Here's where the real work gets done
1890 (void) fprintf(stderr,
1891 "%s: about to dump %s\n",
1896 printf("#\tReconstructed via infocmp from file: %s\n",
1898 dump_entry(&entries[0].tterm,
1899 suppress_untranslatable,
1905 (void) fprintf(stderr, "%s: length %d\n", _nc_progname, len);
1909 show_comparing(tname);
1910 compare_entry(compare_predicate, &entries->tterm, quiet);
1914 show_comparing(tname);
1915 compare_entry(compare_predicate, &entries->tterm, quiet);
1919 show_comparing(tname);
1920 compare_entry(compare_predicate, &entries->tterm, quiet);
1925 (void) fprintf(stderr, "%s: dumping use entry\n", _nc_progname);
1926 dump_entry(&entries[0].tterm,
1927 suppress_untranslatable,
1931 for (i = 1; i < termcount; i++)
1932 dump_uses(tname[i], !(outform == F_TERMCAP
1933 || outform == F_TCONVERR));
1936 (void) fprintf(stderr, "%s: length %d\n", _nc_progname, len);
1940 } else if (compare == C_USEALL) {
1941 (void) fprintf(stderr, "Sorry, -u doesn't work with -F\n");
1942 } else if (compare == C_DEFAULT) {
1943 (void) fprintf(stderr, "Use `tic -[CI] <file>' for this.\n");
1944 } else if (argc - optind != 2) {
1945 (void) fprintf(stderr,
1946 "File comparison needs exactly two file arguments.\n");
1948 file_comparison(argc - optind, argv + optind);
1952 ExitProgram(EXIT_SUCCESS);
1955 /* infocmp.c ends here */