d/freebsd-skq
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
e90c8b37cf
freebsd-skq/contrib/ncurses/progs/infocmp.c

1442 lines
38 KiB
C
Raw Blame History

/****************************************************************************
* Copyright (c) 1998,1999,2000 Free Software Foundation, Inc. *
* *
* Permission is hereby granted, free of charge, to any person obtaining a *
* copy of this software and associated documentation files (the *
* "Software"), to deal in the Software without restriction, including *
* without limitation the rights to use, copy, modify, merge, publish, *
* distribute, distribute with modifications, sublicense, and/or sell *
* copies of the Software, and to permit persons to whom the Software is *
* furnished to do so, subject to the following conditions: *
* *
* The above copyright notice and this permission notice shall be included *
* in all copies or substantial portions of the Software. *
* *
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
* IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
* OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
* THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
* *
* Except as contained in this notice, the name(s) of the above copyright *
* holders shall not be used in advertising or otherwise to promote the *
* sale, use or other dealings in this Software without prior written *
* authorization. *
****************************************************************************/
/****************************************************************************
* Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 *
* and: Eric S. Raymond <esr@snark.thyrsus.com> *
****************************************************************************/
/*
* infocmp.c -- decompile an entry, or compare two entries
* written by Eric S. Raymond
*/
#include <progs.priv.h>
#include <term_entry.h>
#include <dump_entry.h>
MODULE_ID("$Id: infocmp.c,v 1.57 2000/10/01 01:26:25 tom Exp $")
#define L_CURL "{"
#define R_CURL "}"
#define MAXTERMS 32 /* max # terminal arguments we can handle */
#define MAX_STRING 1024 /* maximum formatted string */
const char *_nc_progname = "infocmp";
typedef char path[PATH_MAX];
/***************************************************************************
*
* The following control variables, together with the contents of the
* terminfo entries, completely determine the actions of the program.
*
***************************************************************************/
static char *tname[MAXTERMS]; /* terminal type names */
static ENTRY entries[MAXTERMS]; /* terminfo entries */
static int termcount; /* count of terminal entries */
static bool limited = TRUE; /* "-r" option is not set */
static bool quiet = FALSE;
static const char *bool_sep = ":";
static const char *s_absent = "NULL";
static const char *s_cancel = "NULL";
static const char *tversion; /* terminfo version selected */
static int itrace; /* trace flag for debugging */
static int mwidth = 60;
static int numbers = 0; /* format "%'char'" to/from "%{number}" */
static int outform = F_TERMINFO; /* output format */
static int sortmode; /* sort_mode */
/* main comparison mode */
static int compare;
#define C_DEFAULT 0 /* don't force comparison mode */
#define C_DIFFERENCE 1 /* list differences between two terminals */
#define C_COMMON 2 /* list common capabilities */
#define C_NAND 3 /* list capabilities in neither terminal */
#define C_USEALL 4 /* generate relative use-form entry */
static bool ignorepads; /* ignore pad prefixes when diffing */
#if NO_LEAKS
#undef ExitProgram
static void
ExitProgram(int code) GCC_NORETURN;
/* prototype is to get gcc to accept the noreturn attribute */
static void
ExitProgram(int code)
{
while (termcount-- > 0)
_nc_free_termtype(&entries[termcount].tterm);
_nc_leaks_dump_entry();
_nc_free_and_exit(code);
}
#endif
static char *
canonical_name(char *ptr, char *buf)
/* extract the terminal type's primary name */
{
char *bp;
(void) strcpy(buf, ptr);
if ((bp = strchr(buf, '|')) != 0)
*bp = '\0';
return (buf);
}
/***************************************************************************
*
* Predicates for dump function
*
***************************************************************************/
static int
capcmp(int idx, const char *s, const char *t)
/* capability comparison function */
{
if (!VALID_STRING(s) && !VALID_STRING(t))
return (s != t);
else if (!VALID_STRING(s) || !VALID_STRING(t))
return (1);
if ((idx == acs_chars_index) || !ignorepads)
return (strcmp(s, t));
else
return (_nc_capcmp(s, t));
}
static int
use_predicate(int type, int idx)
/* predicate function to use for use decompilation */
{
ENTRY *ep;
switch (type) {
case BOOLEAN:
{
int is_set = FALSE;
/*
* This assumes that multiple use entries are supposed
* to contribute the logical or of their boolean capabilities.
* This is true if we take the semantics of multiple uses to
* be 'each capability gets the first non-default value found
* in the sequence of use entries'.
*
* Note that cancelled or absent booleans are stored as FALSE,
* unlike numbers and strings, whose cancelled/absent state is
* recorded in the terminfo database.
*/
for (ep = &entries[1]; ep < entries + termcount; ep++)
if (ep->tterm.Booleans[idx] == TRUE) {
is_set = entries[0].tterm.Booleans[idx];
break;
}
if (is_set != entries[0].tterm.Booleans[idx])
return (!is_set);
else
return (FAIL);
}
case NUMBER:
{
int value = ABSENT_NUMERIC;
/*
* We take the semantics of multiple uses to be 'each
* capability gets the first non-default value found
* in the sequence of use entries'.
*/
for (ep = &entries[1]; ep < entries + termcount; ep++)
if (VALID_NUMERIC(ep->tterm.Numbers[idx])) {
value = ep->tterm.Numbers[idx];
break;
}
if (value != entries[0].tterm.Numbers[idx])
return (value != ABSENT_NUMERIC);
else
return (FAIL);
}
case STRING:
{
char *termstr, *usestr = ABSENT_STRING;
termstr = entries[0].tterm.Strings[idx];
/*
* We take the semantics of multiple uses to be 'each
* capability gets the first non-default value found
* in the sequence of use entries'.
*/
for (ep = &entries[1]; ep < entries + termcount; ep++)
if (ep->tterm.Strings[idx]) {
usestr = ep->tterm.Strings[idx];
break;
}
if (usestr == ABSENT_STRING && termstr == ABSENT_STRING)
return (FAIL);
else if (!usestr || !termstr || capcmp(idx, usestr, termstr))
return (TRUE);
else
return (FAIL);
}
}
return (FALSE); /* pacify compiler */
}
static bool
useeq(ENTRY * e1, ENTRY * e2)
/* are the use references in two entries equivalent? */
{
int i, j;
if (e1->nuses != e2->nuses)
return (FALSE);
/* Ugh...this is quadratic again */
for (i = 0; i < e1->nuses; i++) {
bool foundmatch = FALSE;
/* search second entry for given use reference */
for (j = 0; j < e2->nuses; j++)
if (!strcmp(e1->uses[i].name, e2->uses[j].name)) {
foundmatch = TRUE;
break;
}
if (!foundmatch)
return (FALSE);
}
return (TRUE);
}
static bool
entryeq(TERMTYPE * t1, TERMTYPE * t2)
/* are two entries equivalent? */
{
int i;
for (i = 0; i < NUM_BOOLEANS(t1); i++)
if (t1->Booleans[i] != t2->Booleans[i])
return (FALSE);
for (i = 0; i < NUM_NUMBERS(t1); i++)
if (t1->Numbers[i] != t2->Numbers[i])
return (FALSE);
for (i = 0; i < NUM_STRINGS(t1); i++)
if (capcmp(i, t1->Strings[i], t2->Strings[i]))
return (FALSE);
return (TRUE);
}
#define TIC_EXPAND(result) _nc_tic_expand(result, outform==F_TERMINFO, numbers)
static void
print_uses(ENTRY * ep, FILE * fp)
/* print an entry's use references */
{
int i;
if (!ep->nuses)
fputs("NULL", fp);
else
for (i = 0; i < ep->nuses; i++) {
fputs(ep->uses[i].name, fp);
if (i < ep->nuses - 1)
fputs(" ", fp);
}
}
static const char *
dump_boolean(int val)
/* display the value of a boolean capability */
{
switch (val) {
case ABSENT_BOOLEAN:
return (s_absent);
case CANCELLED_BOOLEAN:
return (s_cancel);
case FALSE:
return ("F");
case TRUE:
return ("T");
default:
return ("?");
}
}
static void
dump_numeric(int val, char *buf)
/* display the value of a boolean capability */
{
switch (val) {
case ABSENT_NUMERIC:
strcpy(buf, s_absent);
break;
case CANCELLED_NUMERIC:
strcpy(buf, s_cancel);
break;
default:
sprintf(buf, "%d", val);
break;
}
}
static void
dump_string(char *val, char *buf)
/* display the value of a string capability */
{
if (val == ABSENT_STRING)
strcpy(buf, s_absent);
else if (val == CANCELLED_STRING)
strcpy(buf, s_cancel);
else {
sprintf(buf, "'%.*s'", MAX_STRING - 3, TIC_EXPAND(val));
}
}
static void
compare_predicate(int type, int idx, const char *name)
/* predicate function to use for entry difference reports */
{
register ENTRY *e1 = &entries[0];
register ENTRY *e2 = &entries[1];
char buf1[MAX_STRING], buf2[MAX_STRING];
int b1, b2;
int n1, n2;
char *s1, *s2;
switch (type) {
case CMP_BOOLEAN:
b1 = e1->tterm.Booleans[idx];
b2 = e2->tterm.Booleans[idx];
switch (compare) {
case C_DIFFERENCE:
if (!(b1 == ABSENT_BOOLEAN && b2 == ABSENT_BOOLEAN) && b1 != b2)
(void) printf("\t%s: %s%s%s.\n",
name,
dump_boolean(b1),
bool_sep,
dump_boolean(b2));
break;
case C_COMMON:
if (b1 == b2 && b1 != ABSENT_BOOLEAN)
(void) printf("\t%s= %s.\n", name, dump_boolean(b1));
break;
case C_NAND:
if (b1 == ABSENT_BOOLEAN && b2 == ABSENT_BOOLEAN)
(void) printf("\t!%s.\n", name);
break;
}
break;
case CMP_NUMBER:
n1 = e1->tterm.Numbers[idx];
n2 = e2->tterm.Numbers[idx];
dump_numeric(n1, buf1);
dump_numeric(n2, buf2);
switch (compare) {
case C_DIFFERENCE:
if (!((n1 == ABSENT_NUMERIC && n2 == ABSENT_NUMERIC)) && n1 != n2)
(void) printf("\t%s: %s, %s.\n", name, buf1, buf2);
break;
case C_COMMON:
if (n1 != ABSENT_NUMERIC && n2 != ABSENT_NUMERIC && n1 == n2)
(void) printf("\t%s= %s.\n", name, buf1);
break;
case C_NAND:
if (n1 == ABSENT_NUMERIC && n2 == ABSENT_NUMERIC)
(void) printf("\t!%s.\n", name);
break;
}
break;
case CMP_STRING:
s1 = e1->tterm.Strings[idx];
s2 = e2->tterm.Strings[idx];
switch (compare) {
case C_DIFFERENCE:
if (capcmp(idx, s1, s2)) {
dump_string(s1, buf1);
dump_string(s2, buf2);
if (strcmp(buf1, buf2))
(void) printf("\t%s: %s, %s.\n", name, buf1, buf2);
}
break;
case C_COMMON:
if (s1 && s2 && !capcmp(idx, s1, s2))
(void) printf("\t%s= '%s'.\n", name, TIC_EXPAND(s1));
break;
case C_NAND:
if (!s1 && !s2)
(void) printf("\t!%s.\n", name);
break;
}
break;
case CMP_USE:
/* unlike the other modes, this compares *all* use entries */
switch (compare) {
case C_DIFFERENCE:
if (!useeq(e1, e2)) {
(void) fputs("\tuse: ", stdout);
print_uses(e1, stdout);
fputs(", ", stdout);
print_uses(e2, stdout);
fputs(".\n", stdout);
}
break;
case C_COMMON:
if (e1->nuses && e2->nuses && useeq(e1, e2)) {
(void) fputs("\tuse: ", stdout);
print_uses(e1, stdout);
fputs(".\n", stdout);
}
break;
case C_NAND:
if (!e1->nuses && !e2->nuses)
(void) printf("\t!use.\n");
break;
}
}
}
/***************************************************************************
*
* Init string analysis
*
***************************************************************************/
typedef struct {
const char *from;
const char *to;
} assoc;
static const assoc std_caps[] =
{
/* these are specified by X.364 and iBCS2 */
{"\033c", "RIS"}, /* full reset */
{"\0337", "SC"}, /* save cursor */
{"\0338", "RC"}, /* restore cursor */
{"\033[r", "RSR"}, /* not an X.364 mnemonic */
{"\033[m", "SGR0"}, /* not an X.364 mnemonic */
{"\033[2J", "ED2"}, /* clear page */
/* this group is specified by ISO 2022 */
{"\033(0", "ISO DEC G0"}, /* enable DEC graphics for G0 */
{"\033(A", "ISO UK G0"}, /* enable UK chars for G0 */
{"\033(B", "ISO US G0"}, /* enable US chars for G0 */
{"\033)0", "ISO DEC G1"}, /* enable DEC graphics for G1 */
{"\033)A", "ISO UK G1"}, /* enable UK chars for G1 */
{"\033)B", "ISO US G1"}, /* enable US chars for G1 */
/* these are DEC private modes widely supported by emulators */
{"\033=", "DECPAM"}, /* application keypad mode */
{"\033>", "DECPNM"}, /* normal keypad mode */
{"\033<", "DECANSI"}, /* enter ANSI mode */
{(char *) 0, (char *) 0}
};
static const assoc private_modes[] =
/* DEC \E[ ... [hl] modes recognized by many emulators */
{
{"1", "CKM"}, /* application cursor keys */
{"2", "ANM"}, /* set VT52 mode */
{"3", "COLM"}, /* 132-column mode */
{"4", "SCLM"}, /* smooth scroll */
{"5", "SCNM"}, /* reverse video mode */
{"6", "OM"}, /* origin mode */
{"7", "AWM"}, /* wraparound mode */
{"8", "ARM"}, /* auto-repeat mode */
{(char *) 0, (char *) 0}
};
static const assoc ecma_highlights[] =
/* recognize ECMA attribute sequences */
{
{"0", "NORMAL"}, /* normal */
{"1", "+BOLD"}, /* bold on */
{"2", "+DIM"}, /* dim on */
{"3", "+ITALIC"}, /* italic on */
{"4", "+UNDERLINE"}, /* underline on */
{"5", "+BLINK"}, /* blink on */
{"6", "+FASTBLINK"}, /* fastblink on */
{"7", "+REVERSE"}, /* reverse on */
{"8", "+INVISIBLE"}, /* invisible on */
{"9", "+DELETED"}, /* deleted on */
{"10", "MAIN-FONT"}, /* select primary font */
{"11", "ALT-FONT-1"}, /* select alternate font 1 */
{"12", "ALT-FONT-2"}, /* select alternate font 2 */
{"13", "ALT-FONT-3"}, /* select alternate font 3 */
{"14", "ALT-FONT-4"}, /* select alternate font 4 */
{"15", "ALT-FONT-5"}, /* select alternate font 5 */
{"16", "ALT-FONT-6"}, /* select alternate font 6 */
{"17", "ALT-FONT-7"}, /* select alternate font 7 */
{"18", "ALT-FONT-1"}, /* select alternate font 1 */
{"19", "ALT-FONT-1"}, /* select alternate font 1 */
{"20", "FRAKTUR"}, /* Fraktur font */
{"21", "DOUBLEUNDER"}, /* double underline */
{"22", "-DIM"}, /* dim off */
{"23", "-ITALIC"}, /* italic off */
{"24", "-UNDERLINE"}, /* underline off */
{"25", "-BLINK"}, /* blink off */
{"26", "-FASTBLINK"}, /* fastblink off */
{"27", "-REVERSE"}, /* reverse off */
{"28", "-INVISIBLE"}, /* invisible off */
{"29", "-DELETED"}, /* deleted off */
{(char *) 0, (char *) 0}
};
static void
analyze_string(const char *name, const char *cap, TERMTYPE * tp)
{
char buf[MAX_TERMINFO_LENGTH];
char buf2[MAX_TERMINFO_LENGTH];
const char *sp, *ep;
const assoc *ap;
if (cap == ABSENT_STRING || cap == CANCELLED_STRING)
return;
(void) printf("%s: ", name);
buf[0] = '\0';
for (sp = cap; *sp; sp++) {
int i;
size_t len = 0;
const char *expansion = 0;
/* first, check other capabilities in this entry */
for (i = 0; i < STRCOUNT; i++) {
char *cp = tp->Strings[i];
/* don't use soft-key capabilities */
if (strnames[i][0] == 'k' && strnames[i][0] == 'f')
continue;
if (cp != ABSENT_STRING && cp != CANCELLED_STRING && cp[0] && cp
!= cap) {
len = strlen(cp);
(void) strncpy(buf2, sp, len);
buf2[len] = '\0';
if (_nc_capcmp(cp, buf2))
continue;
#define ISRS(s) (!strncmp((s), "is", 2) || !strncmp((s), "rs", 2))
/*
* Theoretically we just passed the test for translation
* (equality once the padding is stripped). However, there
* are a few more hoops that need to be jumped so that
* identical pairs of initialization and reset strings
* don't just refer to each other.
*/
if (ISRS(name) || ISRS(strnames[i]))
if (cap < cp)
continue;
#undef ISRS
expansion = strnames[i];
break;
}
}
/* now check the standard capabilities */
if (!expansion)
for (ap = std_caps; ap->from; ap++) {
len = strlen(ap->from);
if (strncmp(ap->from, sp, len) == 0) {
expansion = ap->to;
break;
}
}
/* now check for private-mode sequences */
if (!expansion
&& sp[0] == '\033' && sp[1] == '[' && sp[2] == '?'
&& (len = strspn(sp + 3, "0123456789;"))
&& ((sp[3 + len] == 'h') || (sp[3 + len] == 'l'))) {
char buf3[MAX_TERMINFO_LENGTH];
(void) strcpy(buf2, (sp[3 + len] == 'h') ? "DEC+" : "DEC-");
(void) strncpy(buf3, sp + 3, len);
len += 4;
buf3[len] = '\0';
ep = strtok(buf3, ";");
do {
bool found = FALSE;
for (ap = private_modes; ap->from; ap++) {
size_t tlen = strlen(ap->from);
if (strncmp(ap->from, ep, tlen) == 0) {
(void) strcat(buf2, ap->to);
found = TRUE;
break;
}
}
if (!found)
(void) strcat(buf2, ep);
(void) strcat(buf2, ";");
} while
((ep = strtok((char *) 0, ";")));
buf2[strlen(buf2) - 1] = '\0';
expansion = buf2;
}
/* now check for ECMA highlight sequences */
if (!expansion
&& sp[0] == '\033' && sp[1] == '['
&& (len = strspn(sp + 2, "0123456789;"))
&& sp[2 + len] == 'm') {
char buf3[MAX_TERMINFO_LENGTH];
(void) strcpy(buf2, "SGR:");
(void) strncpy(buf3, sp + 2, len);
len += 3;
buf3[len] = '\0';
ep = strtok(buf3, ";");
do {
bool found = FALSE;
for (ap = ecma_highlights; ap->from; ap++) {
size_t tlen = strlen(ap->from);
if (strncmp(ap->from, ep, tlen) == 0) {
(void) strcat(buf2, ap->to);
found = TRUE;
break;
}
}
if (!found)
(void) strcat(buf2, ep);
(void) strcat(buf2, ";");
} while
((ep = strtok((char *) 0, ";")));
buf2[strlen(buf2) - 1] = '\0';
expansion = buf2;
}
/* now check for scroll region reset */
if (!expansion) {
(void) sprintf(buf2, "\033[1;%dr", tp->Numbers[2]);
len = strlen(buf2);
if (strncmp(buf2, sp, len) == 0)
expansion = "RSR";
}
/* now check for home-down */
if (!expansion) {
(void) sprintf(buf2, "\033[%d;1H", tp->Numbers[2]);
len = strlen(buf2);
if (strncmp(buf2, sp, len) == 0)
expansion = "LL";
}
/* now look at the expansion we got, if any */
if (expansion) {
(void) sprintf(buf + strlen(buf), "{%s}", expansion);
sp += len - 1;
continue;
} else {
/* couldn't match anything */
buf2[0] = *sp;
buf2[1] = '\0';
(void) strcat(buf, TIC_EXPAND(buf2));
}
}
(void) printf("%s\n", buf);
}
/***************************************************************************
*
* File comparison
*
***************************************************************************/
static void
file_comparison(int argc, char *argv[])
{
#define MAXCOMPARE 2
/* someday we may allow comparisons on more files */
int filecount = 0;
ENTRY *heads[MAXCOMPARE];
ENTRY *tails[MAXCOMPARE];
ENTRY *qp, *rp;
int i, n;
dump_init((char *) 0, F_LITERAL, S_TERMINFO, 0, itrace, FALSE);
for (n = 0; n < argc && n < MAXCOMPARE; n++) {
if (freopen(argv[n], "r", stdin) == 0)
_nc_err_abort("Can't open %s", argv[n]);
_nc_head = _nc_tail = 0;
/* parse entries out of the source file */
_nc_set_source(argv[n]);
_nc_read_entry_source(stdin, NULL, TRUE, FALSE, NULLHOOK);
if (itrace)
(void) fprintf(stderr, "Resolving file %d...\n", n - 0);
/* maybe do use resolution */
if (!_nc_resolve_uses(!limited)) {
(void) fprintf(stderr,
"There are unresolved use entries in %s:\n",
argv[n]);
for_entry_list(qp) {
if (qp->nuses) {
(void) fputs(qp->tterm.term_names, stderr);
(void) fputc('\n', stderr);
}
}
exit(EXIT_FAILURE);
}
heads[filecount] = _nc_head;
tails[filecount] = _nc_tail;
filecount++;
}
/* OK, all entries are in core. Ready to do the comparison */
if (itrace)
(void) fprintf(stderr, "Entries are now in core...\n");
/* The entry-matching loop. Sigh, this is intrinsically quadratic. */
for (qp = heads[0]; qp; qp = qp->next) {
for (rp = heads[1]; rp; rp = rp->next)
if (_nc_entry_match(qp->tterm.term_names, rp->tterm.term_names)) {
if (qp->ncrosslinks < MAX_CROSSLINKS)
qp->crosslinks[qp->ncrosslinks] = rp;
qp->ncrosslinks++;
if (rp->ncrosslinks < MAX_CROSSLINKS)
rp->crosslinks[rp->ncrosslinks] = qp;
rp->ncrosslinks++;
}
}
/* now we have two circular lists with crosslinks */
if (itrace)
(void) fprintf(stderr, "Name matches are done...\n");
for (qp = heads[0]; qp; qp = qp->next) {
if (qp->ncrosslinks > 1) {
(void) fprintf(stderr,
"%s in file 1 (%s) has %d matches in file 2 (%s):\n",
_nc_first_name(qp->tterm.term_names),
argv[0],
qp->ncrosslinks,
argv[1]);
for (i = 0; i < qp->ncrosslinks; i++)
(void) fprintf(stderr,
"\t%s\n",
_nc_first_name((qp->crosslinks[i])->tterm.term_names));
}
}
for (rp = heads[1]; rp; rp = rp->next) {
if (rp->ncrosslinks > 1) {
(void) fprintf(stderr,
"%s in file 2 (%s) has %d matches in file 1 (%s):\n",
_nc_first_name(rp->tterm.term_names),
argv[1],
rp->ncrosslinks,
argv[0]);
for (i = 0; i < rp->ncrosslinks; i++)
(void) fprintf(stderr,
"\t%s\n",
_nc_first_name((rp->crosslinks[i])->tterm.term_names));
}
}
(void) printf("In file 1 (%s) only:\n", argv[0]);
for (qp = heads[0]; qp; qp = qp->next)
if (qp->ncrosslinks == 0)
(void) printf("\t%s\n",
_nc_first_name(qp->tterm.term_names));
(void) printf("In file 2 (%s) only:\n", argv[1]);
for (rp = heads[1]; rp; rp = rp->next)
if (rp->ncrosslinks == 0)
(void) printf("\t%s\n",
_nc_first_name(rp->tterm.term_names));
(void) printf("The following entries are equivalent:\n");
for (qp = heads[0]; qp; qp = qp->next) {
rp = qp->crosslinks[0];
if (qp->ncrosslinks == 1) {
rp = qp->crosslinks[0];
repair_acsc(&qp->tterm);
repair_acsc(&rp->tterm);
#if NCURSES_XNAMES
_nc_align_termtype(&qp->tterm, &rp->tterm);
#endif
if (entryeq(&qp->tterm, &rp->tterm) && useeq(qp, rp)) {
char name1[NAMESIZE], name2[NAMESIZE];
(void) canonical_name(qp->tterm.term_names, name1);
(void) canonical_name(rp->tterm.term_names, name2);
(void) printf("%s = %s\n", name1, name2);
}
}
}
(void) printf("Differing entries:\n");
termcount = 2;
for (qp = heads[0]; qp; qp = qp->next) {
if (qp->ncrosslinks == 1) {
rp = qp->crosslinks[0];
#if NCURSES_XNAMES
/* sorry - we have to do this on each pass */
_nc_align_termtype(&qp->tterm, &rp->tterm);
#endif
if (!(entryeq(&qp->tterm, &rp->tterm) && useeq(qp, rp))) {
char name1[NAMESIZE], name2[NAMESIZE];
entries[0] = *qp;
entries[1] = *rp;
(void) canonical_name(qp->tterm.term_names, name1);
(void) canonical_name(rp->tterm.term_names, name2);
switch (compare) {
case C_DIFFERENCE:
if (itrace)
(void) fprintf(stderr,
"infocmp: dumping differences\n");
(void) printf("comparing %s to %s.\n", name1, name2);
compare_entry(compare_predicate, &entries->tterm, quiet);
break;
case C_COMMON:
if (itrace)
(void) fprintf(stderr,
"infocmp: dumping common capabilities\n");
(void) printf("comparing %s to %s.\n", name1, name2);
compare_entry(compare_predicate, &entries->tterm, quiet);
break;
case C_NAND:
if (itrace)
(void) fprintf(stderr,
"infocmp: dumping differences\n");
(void) printf("comparing %s to %s.\n", name1, name2);
compare_entry(compare_predicate, &entries->tterm, quiet);
break;
}
}
}
}
}
static void
usage(void)
{
static const char *tbl[] =
{
"Usage: infocmp [options] [-A directory] [-B directory] [termname...]"
,""
,"Options:"
," -1 print single-column"
," -C use termcap-names"
," -F compare terminfo-files"
," -I use terminfo-names"
," -L use long names"
," -R subset (see manpage)"
," -T eliminate size limits (test)"
," -V print version"
#if NCURSES_XNAMES
," -a with -F, list commented-out caps"
#endif
," -c list common capabilities"
," -d list different capabilities"
," -e format output for C initializer"
," -E format output as C tables"
," -f with -1, format complex strings"
," -G format %{number} to %'char'"
," -g format %'char' to %{number}"
," -i analyze initialization/reset"
," -l output terminfo names"
," -n list capabilities in neither"
," -p ignore padding specifiers"
," -q brief listing, removes headers"
," -r with -C, output in termcap form"
," -r with -F, resolve use-references"
," -s [d|i|l|c] sort fields"
," -u produce source with 'use='"
," -v number (verbose)"
," -w number (width)"
};
const size_t first = 3;
const size_t last = SIZEOF(tbl);
const size_t left = (last - first + 1) / 2 + first;
size_t n;
for (n = 0; n < left; n++) {
size_t m = (n < first) ? last : n + left - first;
if (m < last)
fprintf(stderr, "%-40.40s%s\n", tbl[n], tbl[m]);
else
fprintf(stderr, "%s\n", tbl[n]);
}
exit(EXIT_FAILURE);
}
static char *
name_initializer(const char *type)
{
static char *initializer;
char *s;
if (initializer == 0)
initializer = (char *) malloc(strlen(entries->tterm.term_names) + 20);
(void) sprintf(initializer, "%s_data_%s", type, entries->tterm.term_names);
for (s = initializer; *s != 0 && *s != '|'; s++) {
if (!isalnum(*s))
*s = '_';
}
*s = 0;
return initializer;
}
/* dump C initializers for the terminal type */
static void
dump_initializers(TERMTYPE * term)
{
int n;
const char *str = 0;
int size;
(void) printf("static char %s[] = %s\n", name_initializer("bool"), L_CURL);
for_each_boolean(n, term) {
switch ((int) (term->Booleans[n])) {
case TRUE:
str = "TRUE";
break;
case FALSE:
str = "FALSE";
break;
case ABSENT_BOOLEAN:
str = "ABSENT_BOOLEAN";
break;
case CANCELLED_BOOLEAN:
str = "CANCELLED_BOOLEAN";
break;
}
(void) printf("\t/* %3d: %-8s */\t%s,\n",
n, ExtBoolname(term, n, boolnames), str);
}
(void) printf("%s;\n", R_CURL);
(void) printf("static short %s[] = %s\n", name_initializer("number"), L_CURL);
for_each_number(n, term) {
char buf[BUFSIZ];
switch (term->Numbers[n]) {
case ABSENT_NUMERIC:
str = "ABSENT_NUMERIC";
break;
case CANCELLED_NUMERIC:
str = "CANCELLED_NUMERIC";
break;
default:
sprintf(buf, "%d", term->Numbers[n]);
str = buf;
break;
}
(void) printf("\t/* %3d: %-8s */\t%s,\n", n,
ExtNumname(term, n, numnames), str);
}
(void) printf("%s;\n", R_CURL);
size = sizeof(TERMTYPE)
+ (NUM_BOOLEANS(term) * sizeof(term->Booleans[0]))
+ (NUM_NUMBERS(term) * sizeof(term->Numbers[0]));
(void) printf("static char * %s[] = %s\n", name_initializer("string"), L_CURL);
for_each_string(n, term) {
char buf[MAX_STRING], *sp, *tp;
if (term->Strings[n] == ABSENT_STRING)
str = "ABSENT_STRING";
else if (term->Strings[n] == CANCELLED_STRING)
str = "CANCELLED_STRING";
else {
tp = buf;
*tp++ = '"';
for (sp = term->Strings[n];
*sp != 0 && (tp - buf) < MAX_STRING - 6;
sp++) {
if (isascii(*sp) && isprint(*sp) && *sp != '\\' && *sp != '"')
*tp++ = *sp;
else {
(void) sprintf(tp, "\\%03o", *sp & 0xff);
tp += 4;
}
}
*tp++ = '"';
*tp = '\0';
size += (strlen(term->Strings[n]) + 1);
str = buf;
}
#if NCURSES_XNAMES
if (n == STRCOUNT) {
(void) printf("%s;\n", R_CURL);
(void) printf("static char * %s[] = %s\n",
name_initializer("string_ext"), L_CURL);
}
#endif
(void) printf("\t/* %3d: %-8s */\t%s,\n", n,
ExtStrname(term, n, strnames), str);
}
(void) printf("%s;\n", R_CURL);
}
/* dump C initializers for the terminal type */
static void
dump_termtype(TERMTYPE * term)
{
(void) printf("\t%s\n\t\t\"%s\",\n", L_CURL, term->term_names);
(void) printf("\t\t(char *)0,\t/* pointer to string table */\n");
(void) printf("\t\t%s,\n", name_initializer("bool"));
(void) printf("\t\t%s,\n", name_initializer("number"));
(void) printf("\t\t%s,\n", name_initializer("string"));
#if NCURSES_XNAMES
(void) printf("#if NCURSES_XNAMES\n");
(void) printf("\t\t(char *)0,\t/* pointer to extended string table */\n");
(void) printf("\t\t%s,\t/* ...corresponding names */\n",
(NUM_STRINGS(term) != STRCOUNT)
? name_initializer("string_ext")
: "(char **)0");
(void) printf("\t\t%d,\t\t/* count total Booleans */\n", NUM_BOOLEANS(term));
(void) printf("\t\t%d,\t\t/* count total Numbers */\n", NUM_NUMBERS(term));
(void) printf("\t\t%d,\t\t/* count total Strings */\n", NUM_STRINGS(term));
(void) printf("\t\t%d,\t\t/* count extensions to Booleans */\n",
NUM_BOOLEANS(term) - BOOLCOUNT);
(void) printf("\t\t%d,\t\t/* count extensions to Numbers */\n",
NUM_NUMBERS(term) - NUMCOUNT);
(void) printf("\t\t%d,\t\t/* count extensions to Strings */\n",
NUM_STRINGS(term) - STRCOUNT);
(void) printf("#endif /* NCURSES_XNAMES */\n");
#endif /* NCURSES_XNAMES */
(void) printf("\t%s\n", R_CURL);
}
static int
optarg_to_number(void)
{
char *temp = 0;
long value = strtol(optarg, &temp, 0);
if (temp == 0 || temp == optarg || *temp != 0) {
fprintf(stderr, "Expected a number, not \"%s\"\n", optarg);
exit(EXIT_FAILURE);
}
return (int) value;
}
/***************************************************************************
*
* Main sequence
*
***************************************************************************/
int
main(int argc, char *argv[])
{
char *terminal, *firstdir, *restdir;
/* Avoid "local data >32k" error with mwcc */
/* Also avoid overflowing smaller stacks on systems like AmigaOS */
path *tfile = (path *) malloc(sizeof(path) * MAXTERMS);
int c, i, len;
bool formatted = FALSE;
bool filecompare = FALSE;
int initdump = 0;
bool init_analyze = FALSE;
if ((terminal = getenv("TERM")) == 0) {
(void) fprintf(stderr,
"infocmp: environment variable TERM not set\n");
return EXIT_FAILURE;
}
/* where is the terminfo database location going to default to? */
restdir = firstdir = 0;
while ((c = getopt(argc, argv, "adeEcCfFGgIinlLpqrR:s:uv:Vw:A:B:1T")) != EOF)
switch (c) {
#if NCURSES_XNAMES
case 'a':
_nc_disable_period = TRUE;
use_extended_names(TRUE);
break;
#endif
case 'd':
compare = C_DIFFERENCE;
break;
case 'e':
initdump |= 1;
break;
case 'E':
initdump |= 2;
break;
case 'c':
compare = C_COMMON;
break;
case 'C':
outform = F_TERMCAP;
tversion = "BSD";
if (sortmode == S_DEFAULT)
sortmode = S_TERMCAP;
break;
case 'f':
formatted = TRUE;
break;
case 'G':
numbers = 1;
break;
case 'g':
numbers = -1;
break;
case 'F':
filecompare = TRUE;
break;
case 'I':
outform = F_TERMINFO;
if (sortmode == S_DEFAULT)
sortmode = S_VARIABLE;
tversion = 0;
break;
case 'i':
init_analyze = TRUE;
break;
case 'l':
outform = F_TERMINFO;
break;
case 'L':
outform = F_VARIABLE;
if (sortmode == S_DEFAULT)
sortmode = S_VARIABLE;
break;
case 'n':
compare = C_NAND;
break;
case 'p':
ignorepads = TRUE;
break;
case 'q':
quiet = TRUE;
s_absent = "-";
s_cancel = "@";
bool_sep = ", ";
break;
case 'r':
tversion = 0;
limited = FALSE;
break;
case 'R':
tversion = optarg;
break;
case 's':
if (*optarg == 'd')
sortmode = S_NOSORT;
else if (*optarg == 'i')
sortmode = S_TERMINFO;
else if (*optarg == 'l')
sortmode = S_VARIABLE;
else if (*optarg == 'c')
sortmode = S_TERMCAP;
else {
(void) fprintf(stderr,
"infocmp: unknown sort mode\n");
return EXIT_FAILURE;
}
break;
case 'u':
compare = C_USEALL;
break;
case 'v':
itrace = optarg_to_number();
set_trace_level(itrace);
break;
case 'V':
puts(curses_version());
ExitProgram(EXIT_SUCCESS);
case 'w':
mwidth = optarg_to_number();
break;
case 'A':
firstdir = optarg;
break;
case 'B':
restdir = optarg;
break;
case '1':
mwidth = 0;
break;
case 'T':
limited = FALSE;
break;
default:
usage();
}
/* by default, sort by terminfo name */
if (sortmode == S_DEFAULT)
sortmode = S_TERMINFO;
/* set up for display */
dump_init(tversion, outform, sortmode, mwidth, itrace, formatted);
/* make sure we have at least one terminal name to work with */
if (optind >= argc)
argv[argc++] = terminal;
/* if user is after a comparison, make sure we have two entries */
if (compare != C_DEFAULT && optind >= argc - 1)
argv[argc++] = terminal;
/* exactly two terminal names with no options means do -d */
if (argc - optind == 2 && compare == C_DEFAULT)
compare = C_DIFFERENCE;
if (!filecompare) {
/* grab the entries */
termcount = 0;
for (; optind < argc; optind++) {
if (termcount >= MAXTERMS) {
(void) fprintf(stderr,
"infocmp: too many terminal type arguments\n");
return EXIT_FAILURE;
} else {
const char *directory = termcount ? restdir : firstdir;
int status;
tname[termcount] = argv[optind];
if (directory) {
(void) sprintf(tfile[termcount], "%s/%c/%s",
directory,
*argv[optind], argv[optind]);
if (itrace)
(void) fprintf(stderr,
"infocmp: reading entry %s from file %s\n",
argv[optind], tfile[termcount]);
status = _nc_read_file_entry(tfile[termcount],
&entries[termcount].tterm);
} else {
if (itrace)
(void) fprintf(stderr,
"infocmp: reading entry %s from system directories %s\n",
argv[optind], tname[termcount]);
status = _nc_read_entry(tname[termcount],
tfile[termcount],
&entries[termcount].tterm);
directory = TERMINFO; /* for error message */
}
if (status <= 0) {
(void) fprintf(stderr,
"infocmp: couldn't open terminfo file %s.\n",
tfile[termcount]);
return EXIT_FAILURE;
}
repair_acsc(&entries[termcount].tterm);
termcount++;
}
}
#if NCURSES_XNAMES
if (termcount > 1)
_nc_align_termtype(&entries[0].tterm, &entries[1].tterm);
#endif
/* dump as C initializer for the terminal type */
if (initdump) {
if (initdump & 1)
dump_termtype(&entries[0].tterm);
if (initdump & 2)
dump_initializers(&entries[0].tterm);
ExitProgram(EXIT_SUCCESS);
}
/* analyze the init strings */
if (init_analyze) {
#undef CUR
#define CUR entries[0].tterm.
analyze_string("is1", init_1string, &entries[0].tterm);
analyze_string("is2", init_2string, &entries[0].tterm);
analyze_string("is3", init_3string, &entries[0].tterm);
analyze_string("rs1", reset_1string, &entries[0].tterm);
analyze_string("rs2", reset_2string, &entries[0].tterm);
analyze_string("rs3", reset_3string, &entries[0].tterm);
analyze_string("smcup", enter_ca_mode, &entries[0].tterm);
analyze_string("rmcup", exit_ca_mode, &entries[0].tterm);
#undef CUR
ExitProgram(EXIT_SUCCESS);
}
/*
* Here's where the real work gets done
*/
switch (compare) {
case C_DEFAULT:
if (itrace)
(void) fprintf(stderr,
"infocmp: about to dump %s\n",
tname[0]);
(void) printf("#\tReconstructed via infocmp from file: %s\n",
tfile[0]);
len = dump_entry(&entries[0].tterm, limited, numbers, NULL);
putchar('\n');
if (itrace)
(void) fprintf(stderr, "infocmp: length %d\n", len);
break;
case C_DIFFERENCE:
if (itrace)
(void) fprintf(stderr, "infocmp: dumping differences\n");
(void) printf("comparing %s to %s.\n", tname[0], tname[1]);
compare_entry(compare_predicate, &entries->tterm, quiet);
break;
case C_COMMON:
if (itrace)
(void) fprintf(stderr,
"infocmp: dumping common capabilities\n");
(void) printf("comparing %s to %s.\n", tname[0], tname[1]);
compare_entry(compare_predicate, &entries->tterm, quiet);
break;
case C_NAND:
if (itrace)
(void) fprintf(stderr,
"infocmp: dumping differences\n");
(void) printf("comparing %s to %s.\n", tname[0], tname[1]);
compare_entry(compare_predicate, &entries->tterm, quiet);
break;
case C_USEALL:
if (itrace)
(void) fprintf(stderr, "infocmp: dumping use entry\n");
len = dump_entry(&entries[0].tterm, limited, numbers, use_predicate);
for (i = 1; i < termcount; i++)
len += dump_uses(tname[i], !(outform == F_TERMCAP || outform
== F_TCONVERR));
putchar('\n');
if (itrace)
(void) fprintf(stderr, "infocmp: length %d\n", len);
break;
}
} else if (compare == C_USEALL)
(void) fprintf(stderr, "Sorry, -u doesn't work with -F\n");
else if (compare == C_DEFAULT)
(void) fprintf(stderr, "Use `tic -[CI] <file>' for this.\n");
else if (argc - optind != 2)
(void) fprintf(stderr,
"File comparison needs exactly two file arguments.\n");
else
file_comparison(argc - optind, argv + optind);
ExitProgram(EXIT_SUCCESS);
}
/* infocmp.c ends here */
Reference in New Issue View Git Blame Copy Permalink