1 /****************************************************************************
2 * Copyright 2020,2021 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.151 2021/06/17 21:11:08 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 *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)
339 dump_boolean(int val)
340 /* display the value of a boolean capability */
345 case CANCELLED_BOOLEAN:
357 dump_numeric(int val, char *buf)
358 /* display the value of a numeric capability */
362 _nc_STRCPY(buf, s_absent, MAX_STRING);
364 case CANCELLED_NUMERIC:
365 _nc_STRCPY(buf, s_cancel, MAX_STRING);
368 _nc_SPRINTF(buf, _nc_SLIMIT(MAX_STRING) "%d", val);
374 dump_string(char *val, char *buf)
375 /* display the value of a string capability */
377 if (val == ABSENT_STRING)
378 _nc_STRCPY(buf, s_absent, MAX_STRING);
379 else if (val == CANCELLED_STRING)
380 _nc_STRCPY(buf, s_cancel, MAX_STRING);
382 _nc_SPRINTF(buf, _nc_SLIMIT(MAX_STRING)
383 "'%.*s'", MAX_STRING - 3, TIC_EXPAND(val));
388 * Show "comparing..." message for the given terminal names.
391 show_comparing(char **names)
396 (void) fprintf(stderr, "%s: dumping differences\n", _nc_progname);
400 (void) fprintf(stderr, "%s: dumping common capabilities\n", _nc_progname);
404 (void) fprintf(stderr, "%s: dumping differences\n", _nc_progname);
409 printf("comparing %s", *names++);
411 printf(" to %s", *names++);
413 printf(", %s", *names++);
421 * ncurses stores two types of non-standard capabilities:
422 * a) capabilities listed past the "STOP-HERE" comment in the Caps file.
423 * These are used in the terminfo source file to provide data for termcaps,
424 * e.g., when there is no equivalent capability in terminfo, as well as for
425 * widely-used non-standard capabilities.
426 * b) user-definable capabilities, via "tic -x".
428 * However, if "-x" is omitted from the tic command, both types of
429 * non-standard capability are not loaded into the terminfo database. This
430 * macro is used for limit-checks against the symbols that tic uses to omit
431 * the two types of non-standard entry.
434 #define check_user_definable(n,limit) if (!_nc_user_definable && (n) > (limit)) break
436 #define check_user_definable(n,limit) if ((n) > (limit)) break
440 * Use these macros to simplify loops on C_COMMON and C_NAND:
442 #define for_each_entry() while (entries[extra].tterm.term_names)
443 #define next_entry (&(entries[extra++].tterm))
446 compare_predicate(PredType type, PredIdx idx, const char *name)
447 /* predicate function to use for entry difference reports */
449 ENTRY *e1 = &entries[0];
450 ENTRY *e2 = &entries[1];
451 char buf1[MAX_STRING];
452 char buf2[MAX_STRING];
461 check_user_definable(idx, BOOLWRITE);
462 b1 = e1->tterm.Booleans[idx];
465 b2 = next_entry->Booleans[idx];
466 if (!(no_boolean(b1) && no_boolean(b2)) && (b1 != b2))
467 (void) printf("\t%s: %s%s%s.\n",
475 if (b1 != ABSENT_BOOLEAN) {
478 b2 = next_entry->Booleans[idx];
485 (void) printf("\t%s= %s.\n", name, dump_boolean(b1));
491 if (b1 == ABSENT_BOOLEAN) {
494 b2 = next_entry->Booleans[idx];
501 (void) printf("\t!%s.\n", name);
509 check_user_definable(idx, NUMWRITE);
510 n1 = e1->tterm.Numbers[idx];
513 n2 = next_entry->Numbers[idx];
514 if (!(no_numeric(n1) && no_numeric(n2)) && n1 != n2) {
515 dump_numeric(n1, buf1);
516 dump_numeric(n2, buf2);
517 (void) printf("\t%s: %s, %s.\n", name, buf1, buf2);
522 if (n1 != ABSENT_NUMERIC) {
525 n2 = next_entry->Numbers[idx];
532 dump_numeric(n1, buf1);
533 (void) printf("\t%s= %s.\n", name, buf1);
539 if (n1 == ABSENT_NUMERIC) {
542 n2 = next_entry->Numbers[idx];
549 (void) printf("\t!%s.\n", name);
557 check_user_definable(idx, STRWRITE);
558 s1 = e1->tterm.Strings[idx];
561 s2 = next_entry->Strings[idx];
562 if (!(no_string(s1) && no_string(s2)) && capcmp(idx, s1, s2)) {
563 dump_string(s1, buf1);
564 dump_string(s2, buf2);
565 if (strcmp(buf1, buf2))
566 (void) printf("\t%s: %s, %s.\n", name, buf1, buf2);
571 if (s1 != ABSENT_STRING) {
574 s2 = next_entry->Strings[idx];
575 if (capcmp(idx, s1, s2) != 0) {
581 (void) printf("\t%s= '%s'.\n", name, TIC_EXPAND(s1));
587 if (s1 == ABSENT_STRING) {
590 s2 = next_entry->Strings[idx];
597 (void) printf("\t!%s.\n", name);
605 /* unlike the other modes, this compares *all* use entries */
608 if (!useeq(e1, e2)) {
609 (void) fputs("\tuse: ", stdout);
610 print_uses(e1, stdout);
612 print_uses(e2, stdout);
613 fputs(".\n", stdout);
621 e2 = &entries[extra++];
622 if (e2->nuses != e1->nuses || !useeq(e1, e2)) {
628 (void) fputs("\tuse: ", stdout);
629 print_uses(e1, stdout);
630 fputs(".\n", stdout);
639 e2 = &entries[extra++];
640 if (e2->nuses != e1->nuses) {
646 (void) printf("\t!use.\n");
654 /***************************************************************************
656 * Init string analysis
658 ***************************************************************************/
660 #define DATA(from, to) { { from }, { to } }
661 #define DATAX() DATA("", "")
668 static const assoc std_caps[] =
670 /* these are specified by X.364 and iBCS2 */
671 DATA("\033c", "RIS"), /* full reset */
672 DATA("\0337", "SC"), /* save cursor */
673 DATA("\0338", "RC"), /* restore cursor */
674 DATA("\033[r", "RSR"), /* not an X.364 mnemonic */
675 DATA("\033[m", "SGR0"), /* not an X.364 mnemonic */
676 DATA("\033[2J", "ED2"), /* clear page */
678 /* this group is specified by ISO 2022 */
679 DATA("\033(0", "ISO DEC G0"), /* enable DEC graphics for G0 */
680 DATA("\033(A", "ISO UK G0"), /* enable UK chars for G0 */
681 DATA("\033(B", "ISO US G0"), /* enable US chars for G0 */
682 DATA("\033)0", "ISO DEC G1"), /* enable DEC graphics for G1 */
683 DATA("\033)A", "ISO UK G1"), /* enable UK chars for G1 */
684 DATA("\033)B", "ISO US G1"), /* enable US chars for G1 */
686 /* these are DEC private controls widely supported by emulators */
687 DATA("\033=", "DECPAM"), /* application keypad mode */
688 DATA("\033>", "DECPNM"), /* normal keypad mode */
689 DATA("\033<", "DECANSI"), /* enter ANSI mode */
690 DATA("\033[!p", "DECSTR"), /* soft reset */
691 DATA("\033 F", "S7C1T"), /* 7-bit controls */
696 static const assoc std_modes[] =
697 /* ECMA \E[ ... [hl] modes recognized by many emulators */
699 DATA("2", "AM"), /* keyboard action mode */
700 DATA("4", "IRM"), /* insert/replace mode */
701 DATA("12", "SRM"), /* send/receive mode */
702 DATA("20", "LNM"), /* linefeed mode */
706 static const assoc private_modes[] =
707 /* DEC \E[ ... [hl] modes recognized by many emulators */
709 DATA("1", "CKM"), /* application cursor keys */
710 DATA("2", "ANM"), /* set VT52 mode */
711 DATA("3", "COLM"), /* 132-column mode */
712 DATA("4", "SCLM"), /* smooth scroll */
713 DATA("5", "SCNM"), /* reverse video mode */
714 DATA("6", "OM"), /* origin mode */
715 DATA("7", "AWM"), /* wraparound mode */
716 DATA("8", "ARM"), /* auto-repeat mode */
720 static const assoc ecma_highlights[] =
721 /* recognize ECMA attribute sequences */
723 DATA("0", "NORMAL"), /* normal */
724 DATA("1", "+BOLD"), /* bold on */
725 DATA("2", "+DIM"), /* dim on */
726 DATA("3", "+ITALIC"), /* italic on */
727 DATA("4", "+UNDERLINE"), /* underline on */
728 DATA("5", "+BLINK"), /* blink on */
729 DATA("6", "+FASTBLINK"), /* fastblink on */
730 DATA("7", "+REVERSE"), /* reverse on */
731 DATA("8", "+INVISIBLE"), /* invisible on */
732 DATA("9", "+DELETED"), /* deleted on */
733 DATA("10", "MAIN-FONT"), /* select primary font */
734 DATA("11", "ALT-FONT-1"), /* select alternate font 1 */
735 DATA("12", "ALT-FONT-2"), /* select alternate font 2 */
736 DATA("13", "ALT-FONT-3"), /* select alternate font 3 */
737 DATA("14", "ALT-FONT-4"), /* select alternate font 4 */
738 DATA("15", "ALT-FONT-5"), /* select alternate font 5 */
739 DATA("16", "ALT-FONT-6"), /* select alternate font 6 */
740 DATA("17", "ALT-FONT-7"), /* select alternate font 7 */
741 DATA("18", "ALT-FONT-1"), /* select alternate font 1 */
742 DATA("19", "ALT-FONT-1"), /* select alternate font 1 */
743 DATA("20", "FRAKTUR"), /* Fraktur font */
744 DATA("21", "DOUBLEUNDER"), /* double underline */
745 DATA("22", "-DIM"), /* dim off */
746 DATA("23", "-ITALIC"), /* italic off */
747 DATA("24", "-UNDERLINE"), /* underline off */
748 DATA("25", "-BLINK"), /* blink off */
749 DATA("26", "-FASTBLINK"), /* fastblink off */
750 DATA("27", "-REVERSE"), /* reverse off */
751 DATA("28", "-INVISIBLE"), /* invisible off */
752 DATA("29", "-DELETED"), /* deleted off */
759 skip_csi(const char *cap)
762 if (cap[0] == '\033' && cap[1] == '[')
764 else if (UChar(cap[0]) == 0233)
770 same_param(const char *table, const char *param, size_t length)
773 if (strncmp(table, param, length) == 0) {
774 result = !isdigit(UChar(param[length]));
780 lookup_params(const assoc * table, char *dst, char *src)
783 const char *ep = strtok(src, ";");
791 for (ap = table; ap->from[0]; ap++) {
792 size_t tlen = strlen(ap->from);
794 if (same_param(ap->from, ep, tlen)) {
795 _nc_STRCAT(dst, ap->to, MAX_TERMINFO_LENGTH);
802 _nc_STRCAT(dst, ep, MAX_TERMINFO_LENGTH);
803 _nc_STRCAT(dst, ";", MAX_TERMINFO_LENGTH);
805 ((ep = strtok((char *) 0, ";")));
807 dst[strlen(dst) - 1] = '\0';
815 analyze_string(const char *name, const char *cap, TERMTYPE2 *tp)
817 char buf2[MAX_TERMINFO_LENGTH];
820 int tp_lines = tp->Numbers[2];
822 if (!VALID_STRING(cap))
824 (void) printf("%s: ", name);
826 for (sp = cap; *sp; sp++) {
831 const char *expansion = 0;
832 char buf3[MAX_TERMINFO_LENGTH];
834 /* first, check other capabilities in this entry */
835 for (i = 0; i < STRCOUNT; i++) {
836 char *cp = tp->Strings[i];
838 /* don't use function-key capabilities */
839 if (strnames[i] == NULL)
841 if (strnames[i][0] == 'k' && strnames[i][1] == 'f')
844 if (VALID_STRING(cp) &&
848 _nc_STRNCPY(buf2, sp, len);
851 if (_nc_capcmp(cp, buf2))
854 #define ISRS(s) (!strncmp((s), "is", (size_t) 2) || !strncmp((s), "rs", (size_t) 2))
856 * Theoretically we just passed the test for translation
857 * (equality once the padding is stripped). However, there
858 * are a few more hoops that need to be jumped so that
859 * identical pairs of initialization and reset strings
860 * don't just refer to each other.
862 if (ISRS(name) || ISRS(strnames[i]))
867 expansion = strnames[i];
872 /* now check the standard capabilities */
875 for (ap = std_caps; ap->from[0]; ap++) {
876 size_t adj = (size_t) (csi ? 2 : 0);
878 len = strlen(ap->from);
879 if (csi && skip_csi(ap->from) != csi)
882 && strncmp(ap->from + adj, sp + csi, len - adj) == 0) {
891 /* now check for standard-mode sequences */
893 && (csi = skip_csi(sp)) != 0
894 && (len = (strspn) (sp + csi, "0123456789;"))
895 && (len < sizeof(buf3))
896 && (next = (size_t) csi + len)
897 && ((sp[next] == 'h') || (sp[next] == 'l'))) {
904 _nc_STRNCPY(buf3, sp + csi, len);
906 len += (size_t) csi + 1;
908 expansion = lookup_params(std_modes, buf2, buf3);
911 /* now check for private-mode sequences */
913 && (csi = skip_csi(sp)) != 0
915 && (len = (strspn) (sp + csi + 1, "0123456789;"))
916 && (len < sizeof(buf3))
917 && (next = (size_t) csi + 1 + len)
918 && ((sp[next] == 'h') || (sp[next] == 'l'))) {
925 _nc_STRNCPY(buf3, sp + csi + 1, len);
927 len += (size_t) csi + 2;
929 expansion = lookup_params(private_modes, buf2, buf3);
932 /* now check for ECMA highlight sequences */
934 && (csi = skip_csi(sp)) != 0
935 && (len = (strspn) (sp + csi, "0123456789;")) != 0
936 && (len < sizeof(buf3))
937 && (next = (size_t) csi + len)
938 && sp[next] == 'm') {
940 _nc_STRCPY(buf2, "SGR:", sizeof(buf2));
941 _nc_STRNCPY(buf3, sp + csi, len);
943 len += (size_t) csi + 1;
945 expansion = lookup_params(ecma_highlights, buf2, buf3);
949 && (csi = skip_csi(sp)) != 0
951 len = (size_t) csi + 1;
952 _nc_STRCPY(buf2, "SGR:", sizeof(buf2));
953 _nc_STRCAT(buf2, ecma_highlights[0].to, sizeof(buf2));
957 /* now check for scroll region reset */
959 && (csi = skip_csi(sp)) != 0) {
960 if (sp[csi] == 'r') {
964 _nc_SPRINTF(buf2, _nc_SLIMIT(sizeof(buf2)) "1;%dr", tp_lines);
966 if (strncmp(buf2, sp + csi, len) == 0)
972 /* now check for home-down */
974 && (csi = skip_csi(sp)) != 0) {
975 _nc_SPRINTF(buf2, _nc_SLIMIT(sizeof(buf2)) "%d;1H", tp_lines);
977 if (strncmp(buf2, sp + csi, len) == 0) {
980 _nc_SPRINTF(buf2, _nc_SLIMIT(sizeof(buf2)) "%dH", tp_lines);
982 if (strncmp(buf2, sp + csi, len) == 0) {
989 /* now look at the expansion we got, if any */
991 printf("{%s}", expansion);
994 /* couldn't match anything */
997 fputs(TIC_EXPAND(buf2), stdout);
1003 /***************************************************************************
1007 ***************************************************************************/
1010 file_comparison(int argc, char *argv[])
1012 #define MAXCOMPARE 2
1013 /* someday we may allow comparisons on more files */
1015 ENTRY *heads[MAXCOMPARE];
1019 memset(heads, 0, sizeof(heads));
1020 dump_init((char *) 0, F_LITERAL, S_TERMINFO,
1021 FALSE, 0, 65535, itrace, FALSE, FALSE, FALSE);
1023 for (n = 0; n < argc && n < MAXCOMPARE; n++) {
1024 if (freopen(argv[n], "r", stdin) == 0)
1025 _nc_err_abort("Can't open %s", argv[n]);
1028 entered[n].head = _nc_head;
1029 entered[n].tail = _nc_tail;
1031 _nc_head = _nc_tail = 0;
1033 /* parse entries out of the source file */
1034 _nc_set_source(argv[n]);
1035 _nc_read_entry_source(stdin, NULL, TRUE, literal, NULLHOOK);
1038 (void) fprintf(stderr, "Resolving file %d...\n", n - 0);
1040 /* maybe do use resolution */
1041 if (!_nc_resolve_uses2(!limited, literal)) {
1042 (void) fprintf(stderr,
1043 "There are unresolved use entries in %s:\n",
1045 for_entry_list(qp) {
1047 (void) fputs(qp->tterm.term_names, stderr);
1048 (void) fputc('\n', stderr);
1051 ExitProgram(EXIT_FAILURE);
1054 heads[filecount] = _nc_head;
1058 /* OK, all entries are in core. Ready to do the comparison */
1060 (void) fprintf(stderr, "Entries are now in core...\n");
1062 /* The entry-matching loop. Sigh, this is intrinsically quadratic. */
1063 for (qp = heads[0]; qp; qp = qp->next) {
1064 for (rp = heads[1]; rp; rp = rp->next)
1065 if (_nc_entry_match(qp->tterm.term_names, rp->tterm.term_names)) {
1066 if (qp->ncrosslinks < MAX_CROSSLINKS)
1067 qp->crosslinks[qp->ncrosslinks] = rp;
1070 if (rp->ncrosslinks < MAX_CROSSLINKS)
1071 rp->crosslinks[rp->ncrosslinks] = qp;
1076 /* now we have two circular lists with crosslinks */
1078 (void) fprintf(stderr, "Name matches are done...\n");
1080 for (qp = heads[0]; qp; qp = qp->next) {
1081 if (qp->ncrosslinks > 1) {
1082 (void) fprintf(stderr,
1083 "%s in file 1 (%s) has %d matches in file 2 (%s):\n",
1084 _nc_first_name(qp->tterm.term_names),
1088 for (i = 0; i < qp->ncrosslinks; i++)
1089 (void) fprintf(stderr,
1091 _nc_first_name((qp->crosslinks[i])->tterm.term_names));
1095 for (rp = heads[1]; rp; rp = rp->next) {
1096 if (rp->ncrosslinks > 1) {
1097 (void) fprintf(stderr,
1098 "%s in file 2 (%s) has %d matches in file 1 (%s):\n",
1099 _nc_first_name(rp->tterm.term_names),
1103 for (i = 0; i < rp->ncrosslinks; i++)
1104 (void) fprintf(stderr,
1106 _nc_first_name((rp->crosslinks[i])->tterm.term_names));
1110 (void) printf("In file 1 (%s) only:\n", argv[0]);
1111 for (qp = heads[0]; qp; qp = qp->next)
1112 if (qp->ncrosslinks == 0)
1113 (void) printf("\t%s\n",
1114 _nc_first_name(qp->tterm.term_names));
1116 (void) printf("In file 2 (%s) only:\n", argv[1]);
1117 for (rp = heads[1]; rp; rp = rp->next)
1118 if (rp->ncrosslinks == 0)
1119 (void) printf("\t%s\n",
1120 _nc_first_name(rp->tterm.term_names));
1122 (void) printf("The following entries are equivalent:\n");
1123 for (qp = heads[0]; qp; qp = qp->next) {
1124 if (qp->ncrosslinks == 1) {
1125 rp = qp->crosslinks[0];
1127 repair_acsc(&qp->tterm);
1128 repair_acsc(&rp->tterm);
1130 _nc_align_termtype(&qp->tterm, &rp->tterm);
1132 if (entryeq(&qp->tterm, &rp->tterm) && useeq(qp, rp)) {
1133 char name1[NAMESIZE], name2[NAMESIZE];
1135 (void) canonical_name(qp->tterm.term_names, name1);
1136 (void) canonical_name(rp->tterm.term_names, name2);
1138 (void) printf("%s = %s\n", name1, name2);
1143 (void) printf("Differing entries:\n");
1145 for (qp = heads[0]; qp; qp = qp->next) {
1147 if (qp->ncrosslinks == 1) {
1148 rp = qp->crosslinks[0];
1150 /* sorry - we have to do this on each pass */
1151 _nc_align_termtype(&qp->tterm, &rp->tterm);
1153 if (!(entryeq(&qp->tterm, &rp->tterm) && useeq(qp, rp))) {
1154 char name1[NAMESIZE], name2[NAMESIZE];
1164 (void) canonical_name(qp->tterm.term_names, name1);
1165 (void) canonical_name(rp->tterm.term_names, name2);
1169 show_comparing(names);
1170 compare_entry(compare_predicate, &entries->tterm, quiet);
1174 show_comparing(names);
1175 compare_entry(compare_predicate, &entries->tterm, quiet);
1179 show_comparing(names);
1180 compare_entry(compare_predicate, &entries->tterm, quiet);
1192 #define DATA(s) s "\n"
1193 static const char head[] =
1195 DATA("Usage: infocmp [options] [-A directory] [-B directory] [termname...]")
1200 /* length is given here so the compiler can make everything readonly */
1202 static const char options[][46] =
1204 " -0 print single-row"
1205 ," -1 print single-column"
1206 ," -C use termcap-names"
1207 ," -D print database locations"
1208 ," -E format output as C tables"
1209 ," -F compare terminfo-files"
1210 ," -G format %{number} to %'char'"
1211 ," -I use terminfo-names"
1212 ," -K use termcap-names and BSD syntax"
1213 ," -L use long names"
1214 ," -R subset (see manpage)"
1215 ," -T eliminate size limits (test)"
1216 ," -U do not post-process entries"
1217 ," -V print version"
1218 ," -W wrap long strings per -w[n]"
1220 ," -a with -F, list commented-out caps"
1222 ," -c list common capabilities"
1223 ," -d list different capabilities"
1224 ," -e format output for C initializer"
1225 ," -f with -1, format complex strings"
1226 ," -g format %'char' to %{number}"
1227 ," -i analyze initialization/reset"
1228 ," -l output terminfo names"
1229 ," -n list capabilities in neither"
1230 ," -p ignore padding specifiers"
1231 ," -Q number dump compiled description"
1232 ," -q brief listing, removes headers"
1233 ," -r with -C, output in termcap form"
1234 ," -r with -F, resolve use-references"
1235 ," -s [d|i|l|c] sort fields"
1237 ," -t suppress commented-out capabilities"
1239 ," -u produce source with 'use='"
1240 ," -v number (verbose)"
1241 ," -w number (width)"
1243 ," -x unknown capabilities are user-defined"
1247 const size_t last = SIZEOF(options);
1248 const size_t left = (last + 1) / 2;
1251 fputs(head, stderr);
1252 for (n = 0; n < left; n++) {
1253 size_t m = n + left;
1255 fprintf(stderr, "%-40.40s%s\n", options[n], options[m]);
1257 fprintf(stderr, "%s\n", options[n]);
1259 ExitProgram(EXIT_FAILURE);
1263 any_initializer(const char *fmt, const char *type)
1265 static char *initializer;
1269 if (initializer == 0) {
1270 need = (strlen(entries->tterm.term_names)
1273 initializer = (char *) malloc(need + 1);
1274 if (initializer == 0)
1275 failed("any_initializer");
1278 _nc_STRCPY(initializer, entries->tterm.term_names, need);
1279 for (s = initializer; *s != 0 && *s != '|'; s++) {
1280 if (!isalnum(UChar(*s)))
1284 _nc_SPRINTF(s, _nc_SLIMIT(need) fmt, type);
1289 name_initializer(const char *type)
1291 return any_initializer("_%s_data", type);
1295 string_variable(const char *type)
1297 return any_initializer("_s_%s", type);
1300 /* dump C initializers for the terminal type */
1302 dump_initializers(TERMTYPE2 *term)
1305 const char *str = 0;
1307 printf("\nstatic char %s[] = \"%s\";\n\n",
1308 name_initializer("alias"), entries->tterm.term_names);
1310 for_each_string(n, term) {
1311 if (VALID_STRING(term->Strings[n])) {
1312 char buf[MAX_STRING], *sp, *tp;
1315 #define TP_LIMIT ((MAX_STRING - 5) - (size_t)(tp - buf))
1317 for (sp = term->Strings[n];
1318 *sp != 0 && TP_LIMIT > 2;
1320 if (isascii(UChar(*sp))
1321 && isprint(UChar(*sp))
1326 _nc_SPRINTF(tp, _nc_SLIMIT(TP_LIMIT) "\\%03o", UChar(*sp));
1332 (void) printf("static char %-20s[] = %s;\n",
1333 string_variable(ExtStrname(term, (int) n, strnames)),
1339 (void) printf("static char %s[] = %s\n", name_initializer("bool"), L_CURL);
1341 for_each_boolean(n, term) {
1342 switch ((int) (term->Booleans[n])) {
1351 case ABSENT_BOOLEAN:
1352 str = "ABSENT_BOOLEAN";
1355 case CANCELLED_BOOLEAN:
1356 str = "CANCELLED_BOOLEAN";
1359 (void) printf("\t/* %3u: %-8s */\t%s,\n",
1360 n, ExtBoolname(term, (int) n, boolnames), str);
1362 (void) printf("%s;\n", R_CURL);
1364 (void) printf("static short %s[] = %s\n", name_initializer("number"), L_CURL);
1366 for_each_number(n, term) {
1368 switch (term->Numbers[n]) {
1369 case ABSENT_NUMERIC:
1370 str = "ABSENT_NUMERIC";
1372 case CANCELLED_NUMERIC:
1373 str = "CANCELLED_NUMERIC";
1376 _nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf)) "%d", term->Numbers[n]);
1380 (void) printf("\t/* %3u: %-8s */\t%s,\n", n,
1381 ExtNumname(term, (int) n, numnames), str);
1383 (void) printf("%s;\n", R_CURL);
1385 (void) printf("static char * %s[] = %s\n", name_initializer("string"), L_CURL);
1387 for_each_string(n, term) {
1389 if (term->Strings[n] == ABSENT_STRING)
1390 str = "ABSENT_STRING";
1391 else if (term->Strings[n] == CANCELLED_STRING)
1392 str = "CANCELLED_STRING";
1394 str = string_variable(ExtStrname(term, (int) n, strnames));
1396 (void) printf("\t/* %3u: %-8s */\t%s,\n", n,
1397 ExtStrname(term, (int) n, strnames), str);
1399 (void) printf("%s;\n", R_CURL);
1402 if ((NUM_BOOLEANS(term) != BOOLCOUNT)
1403 || (NUM_NUMBERS(term) != NUMCOUNT)
1404 || (NUM_STRINGS(term) != STRCOUNT)) {
1405 (void) printf("static char * %s[] = %s\n",
1406 name_initializer("string_ext"), L_CURL);
1407 for (n = BOOLCOUNT; n < NUM_BOOLEANS(term); ++n) {
1408 (void) printf("\t/* %3u: bool */\t\"%s\",\n",
1409 n, ExtBoolname(term, (int) n, boolnames));
1411 for (n = NUMCOUNT; n < NUM_NUMBERS(term); ++n) {
1412 (void) printf("\t/* %3u: num */\t\"%s\",\n",
1413 n, ExtNumname(term, (int) n, numnames));
1415 for (n = STRCOUNT; n < NUM_STRINGS(term); ++n) {
1416 (void) printf("\t/* %3u: str */\t\"%s\",\n",
1417 n, ExtStrname(term, (int) n, strnames));
1419 (void) printf("%s;\n", R_CURL);
1424 /* dump C initializers for the terminal type */
1426 dump_termtype(TERMTYPE2 *term)
1428 (void) printf("\t%s\n\t\t%s,\n", L_CURL, name_initializer("alias"));
1429 (void) printf("\t\t(char *)0,\t/* pointer to string table */\n");
1431 (void) printf("\t\t%s,\n", name_initializer("bool"));
1432 (void) printf("\t\t%s,\n", name_initializer("number"));
1434 (void) printf("\t\t%s,\n", name_initializer("string"));
1437 (void) printf("#if NCURSES_XNAMES\n");
1438 (void) printf("\t\t(char *)0,\t/* pointer to extended string table */\n");
1439 (void) printf("\t\t%s,\t/* ...corresponding names */\n",
1440 ((NUM_BOOLEANS(term) != BOOLCOUNT)
1441 || (NUM_NUMBERS(term) != NUMCOUNT)
1442 || (NUM_STRINGS(term) != STRCOUNT))
1443 ? name_initializer("string_ext")
1446 (void) printf("\t\t%d,\t\t/* count total Booleans */\n", NUM_BOOLEANS(term));
1447 (void) printf("\t\t%d,\t\t/* count total Numbers */\n", NUM_NUMBERS(term));
1448 (void) printf("\t\t%d,\t\t/* count total Strings */\n", NUM_STRINGS(term));
1450 (void) printf("\t\t%d,\t\t/* count extensions to Booleans */\n",
1451 NUM_BOOLEANS(term) - BOOLCOUNT);
1452 (void) printf("\t\t%d,\t\t/* count extensions to Numbers */\n",
1453 NUM_NUMBERS(term) - NUMCOUNT);
1454 (void) printf("\t\t%d,\t\t/* count extensions to Strings */\n",
1455 NUM_STRINGS(term) - STRCOUNT);
1457 (void) printf("#endif /* NCURSES_XNAMES */\n");
1460 #endif /* NCURSES_XNAMES */
1461 (void) printf("\t%s\n", R_CURL);
1465 optarg_to_number(void)
1468 long value = strtol(optarg, &temp, 0);
1470 if (temp == 0 || temp == optarg || *temp != 0) {
1471 fprintf(stderr, "Expected a number, not \"%s\"\n", optarg);
1472 ExitProgram(EXIT_FAILURE);
1482 if ((terminal = getenv("TERM")) == 0) {
1483 (void) fprintf(stderr,
1484 "%s: environment variable TERM not set\n",
1492 * Show the databases that infocmp knows about. The location to which it writes is
1495 show_databases(void)
1501 _nc_first_db(&state, &offset);
1502 while ((path2 = _nc_next_db(&state, &offset)) != 0) {
1503 printf("%s\n", path2);
1508 /***************************************************************************
1512 ***************************************************************************/
1515 #define MAIN_LEAKS() \
1516 _nc_free_termtype2(&entries[0].tterm); \
1517 _nc_free_termtype2(&entries[1].tterm); \
1522 #define MAIN_LEAKS() /* nothing */
1526 main(int argc, char *argv[])
1528 /* Avoid "local data >32k" error with mwcc */
1529 /* Also avoid overflowing smaller stacks on systems like AmigaOS */
1536 char *firstdir, *restdir;
1538 bool formatted = FALSE;
1539 bool filecompare = FALSE;
1541 bool init_analyze = FALSE;
1542 bool suppress_untranslatable = FALSE;
1544 bool wrap_strings = FALSE;
1546 /* where is the terminfo database location going to default to? */
1547 restdir = firstdir = 0;
1550 use_extended_names(FALSE);
1554 _nc_progname = _nc_rootname(argv[0]);
1556 /* make sure we have enough space to add two terminal entries */
1557 myargv = typeCalloc(char *, (size_t) (argc + 3));
1561 memcpy(myargv, argv, (sizeof(char *) * (size_t) argc));
1564 while ((c = getopt(argc,
1566 "01A:aB:CcDdEeFfGgIiKLlnpQ:qR:rs:TtUuVv:Ww:x")) != -1) {
1583 _nc_disable_period = TRUE;
1584 use_extended_names(TRUE);
1595 outform = F_TERMCAP;
1597 if (sortmode == S_DEFAULT)
1598 sortmode = S_TERMCAP;
1603 ExitProgram(EXIT_SUCCESS);
1611 compare = C_DIFFERENCE;
1639 outform = F_TERMINFO;
1640 if (sortmode == S_DEFAULT)
1641 sortmode = S_VARIABLE;
1646 init_analyze = TRUE;
1650 outform = F_VARIABLE;
1651 if (sortmode == S_DEFAULT)
1652 sortmode = S_VARIABLE;
1656 outform = F_TERMINFO;
1668 quickdump = optarg_to_number();
1688 sortmode = S_NOSORT;
1689 else if (*optarg == 'i')
1690 sortmode = S_TERMINFO;
1691 else if (*optarg == 'l')
1692 sortmode = S_VARIABLE;
1693 else if (*optarg == 'c')
1694 sortmode = S_TERMCAP;
1696 (void) fprintf(stderr,
1697 "%s: unknown sort mode\n",
1699 ExitProgram(EXIT_FAILURE);
1709 _nc_disable_period = FALSE;
1710 suppress_untranslatable = TRUE;
1723 puts(curses_version());
1724 ExitProgram(EXIT_SUCCESS);
1727 itrace = (unsigned) optarg_to_number();
1728 set_trace_level(itrace);
1732 wrap_strings = TRUE;
1736 mwidth = optarg_to_number();
1741 use_extended_names(TRUE);
1750 maxterms = (size_t) (argc + 2 - optind);
1751 if ((tfile = typeMalloc(path, maxterms)) == 0)
1753 if ((tname = typeCalloc(char *, maxterms)) == 0)
1755 if ((entries = typeCalloc(ENTRY, maxterms)) == 0)
1758 if ((entered = typeCalloc(ENTERED, maxterms)) == 0)
1765 fprintf(stderr, "%s: not enough memory\n", _nc_progname);
1766 ExitProgram(EXIT_FAILURE);
1769 /* by default, sort by terminfo name */
1770 if (sortmode == S_DEFAULT)
1771 sortmode = S_TERMINFO;
1773 /* make sure we have at least one terminal name to work with */
1775 argv[argc++] = terminal_env();
1777 /* if user is after a comparison, make sure we have two entries */
1778 if (compare != C_DEFAULT && optind >= argc - 1)
1779 argv[argc++] = terminal_env();
1781 /* exactly one terminal name with no options means display it */
1782 /* exactly two terminal names with no options means do -d */
1783 if (compare == C_DEFAULT) {
1784 switch (argc - optind) {
1786 fprintf(stderr, "%s: too many names to compare\n", _nc_progname);
1787 ExitProgram(EXIT_FAILURE);
1791 compare = C_DIFFERENCE;
1796 /* set up for display */
1797 dump_init(tversion, outform, sortmode,
1798 wrap_strings, mwidth, mheight, itrace,
1799 formatted, FALSE, quickdump);
1802 /* grab the entries */
1804 for (; optind < argc; optind++) {
1805 const char *directory = termcount ? restdir : firstdir;
1808 tname[termcount] = argv[optind];
1811 #if NCURSES_USE_DATABASE
1812 #if MIXEDCASE_FILENAMES
1813 #define LEAF_FMT "%c"
1815 #define LEAF_FMT "%02x"
1817 _nc_SPRINTF(tfile[termcount],
1818 _nc_SLIMIT(sizeof(path))
1819 "%s/" LEAF_FMT "/%s",
1821 UChar(*argv[optind]), argv[optind]);
1823 (void) fprintf(stderr,
1824 "%s: reading entry %s from file %s\n",
1826 argv[optind], tfile[termcount]);
1828 status = _nc_read_file_entry(tfile[termcount],
1829 &entries[termcount].tterm);
1831 (void) fprintf(stderr, "%s: terminfo files not supported\n",
1834 ExitProgram(EXIT_FAILURE);
1838 (void) fprintf(stderr,
1839 "%s: reading entry %s from database\n",
1843 status = _nc_read_entry2(tname[termcount],
1845 &entries[termcount].tterm);
1849 (void) fprintf(stderr,
1850 "%s: couldn't open terminfo file %s.\n",
1854 ExitProgram(EXIT_FAILURE);
1856 repair_acsc(&entries[termcount].tterm);
1862 _nc_align_termtype(&entries[0].tterm, &entries[1].tterm);
1865 /* dump as C initializer for the terminal type */
1868 dump_termtype(&entries[0].tterm);
1870 dump_initializers(&entries[0].tterm);
1873 /* analyze the init strings */
1874 else if (init_analyze) {
1876 #define CUR entries[0].tterm.
1877 analyze_string("is1", init_1string, &entries[0].tterm);
1878 analyze_string("is2", init_2string, &entries[0].tterm);
1879 analyze_string("is3", init_3string, &entries[0].tterm);
1880 analyze_string("rs1", reset_1string, &entries[0].tterm);
1881 analyze_string("rs2", reset_2string, &entries[0].tterm);
1882 analyze_string("rs3", reset_3string, &entries[0].tterm);
1883 analyze_string("smcup", enter_ca_mode, &entries[0].tterm);
1884 analyze_string("rmcup", exit_ca_mode, &entries[0].tterm);
1885 analyze_string("smkx", keypad_xmit, &entries[0].tterm);
1886 analyze_string("rmkx", keypad_local, &entries[0].tterm);
1893 * Here's where the real work gets done
1898 (void) fprintf(stderr,
1899 "%s: about to dump %s\n",
1904 printf("#\tReconstructed via infocmp from file: %s\n",
1906 dump_entry(&entries[0].tterm,
1907 suppress_untranslatable,
1913 (void) fprintf(stderr, "%s: length %d\n", _nc_progname, len);
1917 show_comparing(tname);
1918 compare_entry(compare_predicate, &entries->tterm, quiet);
1922 show_comparing(tname);
1923 compare_entry(compare_predicate, &entries->tterm, quiet);
1927 show_comparing(tname);
1928 compare_entry(compare_predicate, &entries->tterm, quiet);
1933 (void) fprintf(stderr, "%s: dumping use entry\n", _nc_progname);
1934 dump_entry(&entries[0].tterm,
1935 suppress_untranslatable,
1939 for (i = 1; i < termcount; i++)
1940 dump_uses(tname[i], !(outform == F_TERMCAP
1941 || outform == F_TCONVERR));
1944 (void) fprintf(stderr, "%s: length %d\n", _nc_progname, len);
1948 } else if (compare == C_USEALL) {
1949 (void) fprintf(stderr, "Sorry, -u doesn't work with -F\n");
1950 } else if (compare == C_DEFAULT) {
1951 (void) fprintf(stderr, "Use `tic -[CI] <file>' for this.\n");
1952 } else if (argc - optind != 2) {
1953 (void) fprintf(stderr,
1954 "File comparison needs exactly two file arguments.\n");
1956 file_comparison(argc - optind, argv + optind);
1960 ExitProgram(EXIT_SUCCESS);
1963 /* infocmp.c ends here */