1998-03-01 12:21:12 +08:00
|
|
|
/****************************************************************************
|
2022-02-27 09:00:55 +08:00
|
|
|
* Copyright 2020-2021,2022 Thomas E. Dickey *
|
2020-02-12 17:50:22 +08:00
|
|
|
* Copyright 1998-2016,2017 Free Software Foundation, Inc. *
|
1998-03-01 12:21:12 +08:00
|
|
|
* *
|
|
|
|
* 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> *
|
2005-10-10 02:41:57 +08:00
|
|
|
* and: Thomas E. Dickey 1996-on *
|
1998-03-01 12:21:12 +08:00
|
|
|
****************************************************************************/
|
1997-05-15 12:00:00 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* infocmp.c -- decompile an entry, or compare two entries
|
|
|
|
* written by Eric S. Raymond
|
2007-07-29 08:27:12 +08:00
|
|
|
* and Thomas E Dickey
|
1997-05-15 12:00:00 +08:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <progs.priv.h>
|
|
|
|
|
|
|
|
#include <dump_entry.h>
|
|
|
|
|
2022-09-25 08:12:05 +08:00
|
|
|
MODULE_ID("$Id: infocmp.c,v 1.156 2022/09/24 10:13:06 tom Exp $")
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
#define MAX_STRING 1024 /* maximum formatted string */
|
1997-05-15 12:00:00 +08:00
|
|
|
|
|
|
|
const char *_nc_progname = "infocmp";
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
typedef char path[PATH_MAX];
|
1997-05-15 12:00:00 +08:00
|
|
|
|
|
|
|
/***************************************************************************
|
|
|
|
*
|
|
|
|
* The following control variables, together with the contents of the
|
|
|
|
* terminfo entries, completely determine the actions of the program.
|
|
|
|
*
|
|
|
|
***************************************************************************/
|
|
|
|
|
2007-07-29 08:27:12 +08:00
|
|
|
static ENTRY *entries; /* terminfo entries */
|
1997-05-15 12:00:00 +08:00
|
|
|
static int termcount; /* count of terminal entries */
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
static bool limited = TRUE; /* "-r" option is not set */
|
|
|
|
static bool quiet = FALSE;
|
2005-10-10 02:41:57 +08:00
|
|
|
static bool literal = FALSE;
|
2000-07-09 10:46:08 +08:00
|
|
|
static const char *bool_sep = ":";
|
|
|
|
static const char *s_absent = "NULL";
|
|
|
|
static const char *s_cancel = "NULL";
|
1997-05-15 12:00:00 +08:00
|
|
|
static const char *tversion; /* terminfo version selected */
|
2011-05-15 08:38:25 +08:00
|
|
|
static unsigned itrace; /* trace flag for debugging */
|
1997-05-15 12:00:00 +08:00
|
|
|
static int mwidth = 60;
|
2011-08-08 06:43:00 +08:00
|
|
|
static int mheight = 65535;
|
2000-07-09 10:46:08 +08:00
|
|
|
static int numbers = 0; /* format "%'char'" to/from "%{number}" */
|
2000-10-21 12:42:11 +08:00
|
|
|
static int outform = F_TERMINFO; /* output format */
|
2000-07-09 10:46:08 +08:00
|
|
|
static int sortmode; /* sort_mode */
|
1997-05-15 12:00:00 +08:00
|
|
|
|
|
|
|
/* 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
|
2012-06-03 08:52:00 +08:00
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
ENTRY *head;
|
|
|
|
ENTRY *tail;
|
|
|
|
} ENTERED;
|
|
|
|
|
|
|
|
static ENTERED *entered;
|
|
|
|
|
1997-05-15 12:00:00 +08:00
|
|
|
#undef ExitProgram
|
2021-03-21 09:09:34 +08:00
|
|
|
static GCC_NORETURN void ExitProgram(int code);
|
2000-07-09 10:46:08 +08:00
|
|
|
/* prototype is to get gcc to accept the noreturn attribute */
|
2005-10-10 02:41:57 +08:00
|
|
|
static void
|
|
|
|
ExitProgram(int code)
|
1997-05-15 12:00:00 +08:00
|
|
|
{
|
2012-06-03 08:52:00 +08:00
|
|
|
int n;
|
|
|
|
|
|
|
|
for (n = 0; n < termcount; ++n) {
|
|
|
|
ENTRY *new_head = _nc_head;
|
|
|
|
ENTRY *new_tail = _nc_tail;
|
|
|
|
_nc_head = entered[n].head;
|
|
|
|
_nc_tail = entered[n].tail;
|
|
|
|
_nc_free_entries(entered[n].head);
|
|
|
|
_nc_head = new_head;
|
|
|
|
_nc_tail = new_tail;
|
|
|
|
}
|
2000-07-09 10:46:08 +08:00
|
|
|
_nc_leaks_dump_entry();
|
2007-07-29 08:27:12 +08:00
|
|
|
free(entries);
|
2012-06-03 08:52:00 +08:00
|
|
|
free(entered);
|
2007-02-04 09:44:56 +08:00
|
|
|
_nc_free_tic(code);
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2012-10-28 07:06:26 +08:00
|
|
|
static void
|
|
|
|
failed(const char *s)
|
|
|
|
{
|
|
|
|
perror(s);
|
|
|
|
ExitProgram(EXIT_FAILURE);
|
|
|
|
}
|
|
|
|
|
2022-03-06 10:01:23 +08:00
|
|
|
static void
|
2022-02-27 09:00:55 +08:00
|
|
|
canonical_name(char *source, char *target)
|
1997-05-15 12:00:00 +08:00
|
|
|
/* extract the terminal type's primary name */
|
|
|
|
{
|
2022-02-27 09:00:55 +08:00
|
|
|
int limit = NAMESIZE;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2022-02-27 09:00:55 +08:00
|
|
|
while (--limit > 0) {
|
|
|
|
char ch = *source++;
|
|
|
|
if (ch == '|')
|
|
|
|
break;
|
|
|
|
*target++ = ch;
|
|
|
|
}
|
|
|
|
*target = '\0';
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
2017-02-19 10:52:26 +08:00
|
|
|
static bool
|
|
|
|
no_boolean(int value)
|
|
|
|
{
|
|
|
|
bool result = (value == ABSENT_BOOLEAN);
|
|
|
|
if (!strcmp(s_absent, s_cancel))
|
|
|
|
result = !VALID_BOOLEAN(value);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool
|
|
|
|
no_numeric(int value)
|
|
|
|
{
|
|
|
|
bool result = (value == ABSENT_NUMERIC);
|
|
|
|
if (!strcmp(s_absent, s_cancel))
|
|
|
|
result = !VALID_NUMERIC(value);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool
|
|
|
|
no_string(char *value)
|
|
|
|
{
|
|
|
|
bool result = (value == ABSENT_STRING);
|
|
|
|
if (!strcmp(s_absent, s_cancel))
|
|
|
|
result = !VALID_STRING(value);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
1997-05-15 12:00:00 +08:00
|
|
|
/***************************************************************************
|
|
|
|
*
|
|
|
|
* Predicates for dump function
|
|
|
|
*
|
|
|
|
***************************************************************************/
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
static int
|
2005-10-10 02:41:57 +08:00
|
|
|
capcmp(PredIdx idx, const char *s, const char *t)
|
1997-05-15 12:00:00 +08:00
|
|
|
/* capability comparison function */
|
|
|
|
{
|
|
|
|
if (!VALID_STRING(s) && !VALID_STRING(t))
|
2000-07-09 10:46:08 +08:00
|
|
|
return (s != t);
|
1997-05-15 12:00:00 +08:00
|
|
|
else if (!VALID_STRING(s) || !VALID_STRING(t))
|
2000-07-09 10:46:08 +08:00
|
|
|
return (1);
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
if ((idx == acs_chars_index) || !ignorepads)
|
|
|
|
return (strcmp(s, t));
|
1997-05-15 12:00:00 +08:00
|
|
|
else
|
2000-07-09 10:46:08 +08:00
|
|
|
return (_nc_capcmp(s, t));
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
static int
|
2005-10-10 02:41:57 +08:00
|
|
|
use_predicate(unsigned type, PredIdx idx)
|
1997-05-15 12:00:00 +08:00
|
|
|
/* predicate function to use for use decompilation */
|
|
|
|
{
|
2000-07-09 10:46:08 +08:00
|
|
|
ENTRY *ep;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
switch (type) {
|
|
|
|
case BOOLEAN:
|
1997-05-15 12:00:00 +08:00
|
|
|
{
|
2000-07-09 10:46:08 +08:00
|
|
|
int is_set = FALSE;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
/*
|
|
|
|
* 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;
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
2000-07-09 10:46:08 +08:00
|
|
|
if (is_set != entries[0].tterm.Booleans[idx])
|
|
|
|
return (!is_set);
|
|
|
|
else
|
|
|
|
return (FAIL);
|
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case NUMBER:
|
|
|
|
{
|
|
|
|
int value = ABSENT_NUMERIC;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
/*
|
|
|
|
* 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;
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
if (usestr == ABSENT_STRING && termstr == ABSENT_STRING)
|
|
|
|
return (FAIL);
|
|
|
|
else if (!usestr || !termstr || capcmp(idx, usestr, termstr))
|
|
|
|
return (TRUE);
|
|
|
|
else
|
|
|
|
return (FAIL);
|
|
|
|
}
|
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
return (FALSE); /* pacify compiler */
|
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
static bool
|
|
|
|
useeq(ENTRY * e1, ENTRY * e2)
|
|
|
|
/* are the use references in two entries equivalent? */
|
|
|
|
{
|
2008-08-17 09:51:55 +08:00
|
|
|
unsigned i, j;
|
2000-07-09 10:46:08 +08:00
|
|
|
|
|
|
|
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;
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
if (!foundmatch)
|
|
|
|
return (FALSE);
|
|
|
|
}
|
|
|
|
|
|
|
|
return (TRUE);
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
static bool
|
2017-04-16 09:08:25 +08:00
|
|
|
entryeq(TERMTYPE2 *t1, TERMTYPE2 *t2)
|
2000-07-09 10:46:08 +08:00
|
|
|
/* are two entries equivalent? */
|
1997-05-15 12:00:00 +08:00
|
|
|
{
|
2004-02-09 10:15:26 +08:00
|
|
|
unsigned i;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
1999-10-24 12:32:42 +08:00
|
|
|
for (i = 0; i < NUM_BOOLEANS(t1); i++)
|
1997-05-15 12:00:00 +08:00
|
|
|
if (t1->Booleans[i] != t2->Booleans[i])
|
2000-07-09 10:46:08 +08:00
|
|
|
return (FALSE);
|
1997-05-15 12:00:00 +08:00
|
|
|
|
1999-10-24 12:32:42 +08:00
|
|
|
for (i = 0; i < NUM_NUMBERS(t1); i++)
|
1997-05-15 12:00:00 +08:00
|
|
|
if (t1->Numbers[i] != t2->Numbers[i])
|
2000-07-09 10:46:08 +08:00
|
|
|
return (FALSE);
|
1997-05-15 12:00:00 +08:00
|
|
|
|
1999-10-24 12:32:42 +08:00
|
|
|
for (i = 0; i < NUM_STRINGS(t1); i++)
|
2005-10-10 02:41:57 +08:00
|
|
|
if (capcmp((PredIdx) i, t1->Strings[i], t2->Strings[i]))
|
2000-07-09 10:46:08 +08:00
|
|
|
return (FALSE);
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
return (TRUE);
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
1999-10-24 12:32:42 +08:00
|
|
|
#define TIC_EXPAND(result) _nc_tic_expand(result, outform==F_TERMINFO, numbers)
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
static void
|
2004-02-09 10:15:26 +08:00
|
|
|
print_uses(ENTRY * ep, FILE *fp)
|
2000-07-09 10:46:08 +08:00
|
|
|
/* print an entry's use references */
|
1997-05-15 12:00:00 +08:00
|
|
|
{
|
2021-04-04 09:13:05 +08:00
|
|
|
if (!ep->nuses) {
|
2000-07-09 10:46:08 +08:00
|
|
|
fputs("NULL", fp);
|
2021-04-04 09:13:05 +08:00
|
|
|
} else {
|
|
|
|
unsigned i;
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
for (i = 0; i < ep->nuses; i++) {
|
|
|
|
fputs(ep->uses[i].name, fp);
|
|
|
|
if (i < ep->nuses - 1)
|
|
|
|
fputs(" ", fp);
|
|
|
|
}
|
2021-04-04 09:13:05 +08:00
|
|
|
}
|
2000-07-09 10:46:08 +08:00
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
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 ("?");
|
|
|
|
}
|
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
static void
|
|
|
|
dump_numeric(int val, char *buf)
|
2017-02-19 10:52:26 +08:00
|
|
|
/* display the value of a numeric capability */
|
2000-07-09 10:46:08 +08:00
|
|
|
{
|
|
|
|
switch (val) {
|
|
|
|
case ABSENT_NUMERIC:
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_STRCPY(buf, s_absent, MAX_STRING);
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
|
|
|
case CANCELLED_NUMERIC:
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_STRCPY(buf, s_cancel, MAX_STRING);
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
|
|
|
default:
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_SPRINTF(buf, _nc_SLIMIT(MAX_STRING) "%d", val);
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
static void
|
|
|
|
dump_string(char *val, char *buf)
|
|
|
|
/* display the value of a string capability */
|
|
|
|
{
|
|
|
|
if (val == ABSENT_STRING)
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_STRCPY(buf, s_absent, MAX_STRING);
|
2000-07-09 10:46:08 +08:00
|
|
|
else if (val == CANCELLED_STRING)
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_STRCPY(buf, s_cancel, MAX_STRING);
|
2000-07-09 10:46:08 +08:00
|
|
|
else {
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_SPRINTF(buf, _nc_SLIMIT(MAX_STRING)
|
|
|
|
"'%.*s'", MAX_STRING - 3, TIC_EXPAND(val));
|
2000-07-09 10:46:08 +08:00
|
|
|
}
|
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2012-05-27 07:58:56 +08:00
|
|
|
/*
|
|
|
|
* Show "comparing..." message for the given terminal names.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
show_comparing(char **names)
|
|
|
|
{
|
|
|
|
if (itrace) {
|
|
|
|
switch (compare) {
|
|
|
|
case C_DIFFERENCE:
|
|
|
|
(void) fprintf(stderr, "%s: dumping differences\n", _nc_progname);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case C_COMMON:
|
|
|
|
(void) fprintf(stderr, "%s: dumping common capabilities\n", _nc_progname);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case C_NAND:
|
|
|
|
(void) fprintf(stderr, "%s: dumping differences\n", _nc_progname);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (*names) {
|
|
|
|
printf("comparing %s", *names++);
|
|
|
|
if (*names) {
|
|
|
|
printf(" to %s", *names++);
|
|
|
|
while (*names) {
|
|
|
|
printf(", %s", *names++);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
printf(".\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-04-08 08:45:28 +08:00
|
|
|
/*
|
|
|
|
* ncurses stores two types of non-standard capabilities:
|
2021-06-20 08:21:42 +08:00
|
|
|
* a) capabilities listed past the "STOP-HERE" comment in the Caps file.
|
2012-04-08 08:45:28 +08:00
|
|
|
* These are used in the terminfo source file to provide data for termcaps,
|
|
|
|
* e.g., when there is no equivalent capability in terminfo, as well as for
|
|
|
|
* widely-used non-standard capabilities.
|
|
|
|
* b) user-definable capabilities, via "tic -x".
|
|
|
|
*
|
|
|
|
* However, if "-x" is omitted from the tic command, both types of
|
|
|
|
* non-standard capability are not loaded into the terminfo database. This
|
|
|
|
* macro is used for limit-checks against the symbols that tic uses to omit
|
|
|
|
* the two types of non-standard entry.
|
|
|
|
*/
|
2013-06-09 09:17:29 +08:00
|
|
|
#if NCURSES_XNAMES
|
2012-04-08 08:45:28 +08:00
|
|
|
#define check_user_definable(n,limit) if (!_nc_user_definable && (n) > (limit)) break
|
2013-06-09 09:17:29 +08:00
|
|
|
#else
|
|
|
|
#define check_user_definable(n,limit) if ((n) > (limit)) break
|
|
|
|
#endif
|
2012-04-08 08:45:28 +08:00
|
|
|
|
2012-05-27 07:58:56 +08:00
|
|
|
/*
|
|
|
|
* Use these macros to simplify loops on C_COMMON and C_NAND:
|
|
|
|
*/
|
|
|
|
#define for_each_entry() while (entries[extra].tterm.term_names)
|
|
|
|
#define next_entry (&(entries[extra++].tterm))
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
static void
|
2005-10-10 02:41:57 +08:00
|
|
|
compare_predicate(PredType type, PredIdx idx, const char *name)
|
2000-07-09 10:46:08 +08:00
|
|
|
/* predicate function to use for entry difference reports */
|
|
|
|
{
|
2012-05-27 07:58:56 +08:00
|
|
|
ENTRY *e1 = &entries[0];
|
|
|
|
ENTRY *e2 = &entries[1];
|
|
|
|
char buf1[MAX_STRING];
|
|
|
|
char buf2[MAX_STRING];
|
2000-07-09 10:46:08 +08:00
|
|
|
int b1, b2;
|
|
|
|
int n1, n2;
|
|
|
|
char *s1, *s2;
|
2012-05-27 07:58:56 +08:00
|
|
|
bool found;
|
|
|
|
int extra = 1;
|
2000-07-09 10:46:08 +08:00
|
|
|
|
|
|
|
switch (type) {
|
|
|
|
case CMP_BOOLEAN:
|
2012-04-08 08:45:28 +08:00
|
|
|
check_user_definable(idx, BOOLWRITE);
|
2000-07-09 10:46:08 +08:00
|
|
|
b1 = e1->tterm.Booleans[idx];
|
|
|
|
switch (compare) {
|
|
|
|
case C_DIFFERENCE:
|
2012-05-27 07:58:56 +08:00
|
|
|
b2 = next_entry->Booleans[idx];
|
2017-02-19 10:52:26 +08:00
|
|
|
if (!(no_boolean(b1) && no_boolean(b2)) && (b1 != b2))
|
2000-07-09 10:46:08 +08:00
|
|
|
(void) printf("\t%s: %s%s%s.\n",
|
2000-10-21 12:42:11 +08:00
|
|
|
name,
|
|
|
|
dump_boolean(b1),
|
|
|
|
bool_sep,
|
|
|
|
dump_boolean(b2));
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case C_COMMON:
|
2012-05-27 07:58:56 +08:00
|
|
|
if (b1 != ABSENT_BOOLEAN) {
|
|
|
|
found = TRUE;
|
|
|
|
for_each_entry() {
|
|
|
|
b2 = next_entry->Booleans[idx];
|
|
|
|
if (b1 != b2) {
|
|
|
|
found = FALSE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (found) {
|
|
|
|
(void) printf("\t%s= %s.\n", name, dump_boolean(b1));
|
|
|
|
}
|
|
|
|
}
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
|
|
|
|
|
|
|
case C_NAND:
|
2012-05-27 07:58:56 +08:00
|
|
|
if (b1 == ABSENT_BOOLEAN) {
|
|
|
|
found = TRUE;
|
|
|
|
for_each_entry() {
|
|
|
|
b2 = next_entry->Booleans[idx];
|
|
|
|
if (b1 != b2) {
|
|
|
|
found = FALSE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (found) {
|
|
|
|
(void) printf("\t!%s.\n", name);
|
|
|
|
}
|
|
|
|
}
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
break;
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case CMP_NUMBER:
|
2012-04-08 08:45:28 +08:00
|
|
|
check_user_definable(idx, NUMWRITE);
|
2000-07-09 10:46:08 +08:00
|
|
|
n1 = e1->tterm.Numbers[idx];
|
|
|
|
switch (compare) {
|
|
|
|
case C_DIFFERENCE:
|
2012-05-27 07:58:56 +08:00
|
|
|
n2 = next_entry->Numbers[idx];
|
2017-02-19 10:52:26 +08:00
|
|
|
if (!(no_numeric(n1) && no_numeric(n2)) && n1 != n2) {
|
2012-05-27 07:58:56 +08:00
|
|
|
dump_numeric(n1, buf1);
|
|
|
|
dump_numeric(n2, buf2);
|
2000-07-09 10:46:08 +08:00
|
|
|
(void) printf("\t%s: %s, %s.\n", name, buf1, buf2);
|
2012-05-27 07:58:56 +08:00
|
|
|
}
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case C_COMMON:
|
2012-05-27 07:58:56 +08:00
|
|
|
if (n1 != ABSENT_NUMERIC) {
|
|
|
|
found = TRUE;
|
|
|
|
for_each_entry() {
|
|
|
|
n2 = next_entry->Numbers[idx];
|
|
|
|
if (n1 != n2) {
|
|
|
|
found = FALSE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (found) {
|
|
|
|
dump_numeric(n1, buf1);
|
|
|
|
(void) printf("\t%s= %s.\n", name, buf1);
|
|
|
|
}
|
|
|
|
}
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case C_NAND:
|
2012-05-27 07:58:56 +08:00
|
|
|
if (n1 == ABSENT_NUMERIC) {
|
|
|
|
found = TRUE;
|
|
|
|
for_each_entry() {
|
|
|
|
n2 = next_entry->Numbers[idx];
|
|
|
|
if (n1 != n2) {
|
|
|
|
found = FALSE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (found) {
|
|
|
|
(void) printf("\t!%s.\n", name);
|
|
|
|
}
|
|
|
|
}
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case CMP_STRING:
|
2012-04-08 08:45:28 +08:00
|
|
|
check_user_definable(idx, STRWRITE);
|
2000-07-09 10:46:08 +08:00
|
|
|
s1 = e1->tterm.Strings[idx];
|
|
|
|
switch (compare) {
|
|
|
|
case C_DIFFERENCE:
|
2012-05-27 07:58:56 +08:00
|
|
|
s2 = next_entry->Strings[idx];
|
2017-02-19 10:52:26 +08:00
|
|
|
if (!(no_string(s1) && no_string(s2)) && capcmp(idx, s1, s2)) {
|
2000-07-09 10:46:08 +08:00
|
|
|
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:
|
2012-05-27 07:58:56 +08:00
|
|
|
if (s1 != ABSENT_STRING) {
|
|
|
|
found = TRUE;
|
|
|
|
for_each_entry() {
|
|
|
|
s2 = next_entry->Strings[idx];
|
|
|
|
if (capcmp(idx, s1, s2) != 0) {
|
|
|
|
found = FALSE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (found) {
|
|
|
|
(void) printf("\t%s= '%s'.\n", name, TIC_EXPAND(s1));
|
|
|
|
}
|
|
|
|
}
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
|
|
|
|
|
|
|
case C_NAND:
|
2012-05-27 07:58:56 +08:00
|
|
|
if (s1 == ABSENT_STRING) {
|
|
|
|
found = TRUE;
|
|
|
|
for_each_entry() {
|
|
|
|
s2 = next_entry->Strings[idx];
|
|
|
|
if (s2 != s1) {
|
|
|
|
found = FALSE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (found) {
|
|
|
|
(void) printf("\t!%s.\n", name);
|
|
|
|
}
|
|
|
|
}
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
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:
|
2012-05-27 07:58:56 +08:00
|
|
|
if (e1->nuses) {
|
|
|
|
found = TRUE;
|
|
|
|
for_each_entry() {
|
|
|
|
e2 = &entries[extra++];
|
|
|
|
if (e2->nuses != e1->nuses || !useeq(e1, e2)) {
|
|
|
|
found = FALSE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (found) {
|
|
|
|
(void) fputs("\tuse: ", stdout);
|
|
|
|
print_uses(e1, stdout);
|
|
|
|
fputs(".\n", stdout);
|
|
|
|
}
|
2000-07-09 10:46:08 +08:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case C_NAND:
|
2012-05-27 07:58:56 +08:00
|
|
|
if (!e1->nuses) {
|
2012-06-09 08:43:33 +08:00
|
|
|
found = TRUE;
|
2012-05-27 07:58:56 +08:00
|
|
|
for_each_entry() {
|
|
|
|
e2 = &entries[extra++];
|
|
|
|
if (e2->nuses != e1->nuses) {
|
|
|
|
found = FALSE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (found) {
|
|
|
|
(void) printf("\t!use.\n");
|
|
|
|
}
|
|
|
|
}
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/***************************************************************************
|
|
|
|
*
|
|
|
|
* Init string analysis
|
|
|
|
*
|
|
|
|
***************************************************************************/
|
|
|
|
|
2015-04-05 07:57:48 +08:00
|
|
|
#define DATA(from, to) { { from }, { to } }
|
|
|
|
#define DATAX() DATA("", "")
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
typedef struct {
|
2015-04-05 07:57:48 +08:00
|
|
|
const char from[4];
|
|
|
|
const char to[12];
|
2000-07-09 10:46:08 +08:00
|
|
|
} assoc;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
|
|
|
static const assoc std_caps[] =
|
|
|
|
{
|
|
|
|
/* these are specified by X.364 and iBCS2 */
|
2015-04-05 07:57:48 +08:00
|
|
|
DATA("\033c", "RIS"), /* full reset */
|
|
|
|
DATA("\0337", "SC"), /* save cursor */
|
|
|
|
DATA("\0338", "RC"), /* restore cursor */
|
|
|
|
DATA("\033[r", "RSR"), /* not an X.364 mnemonic */
|
|
|
|
DATA("\033[m", "SGR0"), /* not an X.364 mnemonic */
|
|
|
|
DATA("\033[2J", "ED2"), /* clear page */
|
1997-05-15 12:00:00 +08:00
|
|
|
|
|
|
|
/* this group is specified by ISO 2022 */
|
2015-04-05 07:57:48 +08:00
|
|
|
DATA("\033(0", "ISO DEC G0"), /* enable DEC graphics for G0 */
|
|
|
|
DATA("\033(A", "ISO UK G0"), /* enable UK chars for G0 */
|
|
|
|
DATA("\033(B", "ISO US G0"), /* enable US chars for G0 */
|
|
|
|
DATA("\033)0", "ISO DEC G1"), /* enable DEC graphics for G1 */
|
|
|
|
DATA("\033)A", "ISO UK G1"), /* enable UK chars for G1 */
|
|
|
|
DATA("\033)B", "ISO US G1"), /* enable US chars for G1 */
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2005-10-10 02:41:57 +08:00
|
|
|
/* these are DEC private controls widely supported by emulators */
|
2015-04-05 07:57:48 +08:00
|
|
|
DATA("\033=", "DECPAM"), /* application keypad mode */
|
|
|
|
DATA("\033>", "DECPNM"), /* normal keypad mode */
|
|
|
|
DATA("\033<", "DECANSI"), /* enter ANSI mode */
|
|
|
|
DATA("\033[!p", "DECSTR"), /* soft reset */
|
|
|
|
DATA("\033 F", "S7C1T"), /* 7-bit controls */
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2015-04-05 07:57:48 +08:00
|
|
|
DATAX()
|
1997-05-15 12:00:00 +08:00
|
|
|
};
|
|
|
|
|
2005-10-10 02:41:57 +08:00
|
|
|
static const assoc std_modes[] =
|
|
|
|
/* ECMA \E[ ... [hl] modes recognized by many emulators */
|
|
|
|
{
|
2015-04-05 07:57:48 +08:00
|
|
|
DATA("2", "AM"), /* keyboard action mode */
|
|
|
|
DATA("4", "IRM"), /* insert/replace mode */
|
|
|
|
DATA("12", "SRM"), /* send/receive mode */
|
|
|
|
DATA("20", "LNM"), /* linefeed mode */
|
|
|
|
DATAX()
|
2005-10-10 02:41:57 +08:00
|
|
|
};
|
|
|
|
|
1997-05-15 12:00:00 +08:00
|
|
|
static const assoc private_modes[] =
|
|
|
|
/* DEC \E[ ... [hl] modes recognized by many emulators */
|
|
|
|
{
|
2015-04-05 07:57:48 +08:00
|
|
|
DATA("1", "CKM"), /* application cursor keys */
|
|
|
|
DATA("2", "ANM"), /* set VT52 mode */
|
|
|
|
DATA("3", "COLM"), /* 132-column mode */
|
|
|
|
DATA("4", "SCLM"), /* smooth scroll */
|
|
|
|
DATA("5", "SCNM"), /* reverse video mode */
|
|
|
|
DATA("6", "OM"), /* origin mode */
|
|
|
|
DATA("7", "AWM"), /* wraparound mode */
|
|
|
|
DATA("8", "ARM"), /* auto-repeat mode */
|
|
|
|
DATAX()
|
1997-05-15 12:00:00 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
static const assoc ecma_highlights[] =
|
|
|
|
/* recognize ECMA attribute sequences */
|
|
|
|
{
|
2015-04-05 07:57:48 +08:00
|
|
|
DATA("0", "NORMAL"), /* normal */
|
|
|
|
DATA("1", "+BOLD"), /* bold on */
|
|
|
|
DATA("2", "+DIM"), /* dim on */
|
|
|
|
DATA("3", "+ITALIC"), /* italic on */
|
|
|
|
DATA("4", "+UNDERLINE"), /* underline on */
|
|
|
|
DATA("5", "+BLINK"), /* blink on */
|
|
|
|
DATA("6", "+FASTBLINK"), /* fastblink on */
|
|
|
|
DATA("7", "+REVERSE"), /* reverse on */
|
|
|
|
DATA("8", "+INVISIBLE"), /* invisible on */
|
|
|
|
DATA("9", "+DELETED"), /* deleted on */
|
|
|
|
DATA("10", "MAIN-FONT"), /* select primary font */
|
|
|
|
DATA("11", "ALT-FONT-1"), /* select alternate font 1 */
|
|
|
|
DATA("12", "ALT-FONT-2"), /* select alternate font 2 */
|
|
|
|
DATA("13", "ALT-FONT-3"), /* select alternate font 3 */
|
|
|
|
DATA("14", "ALT-FONT-4"), /* select alternate font 4 */
|
|
|
|
DATA("15", "ALT-FONT-5"), /* select alternate font 5 */
|
|
|
|
DATA("16", "ALT-FONT-6"), /* select alternate font 6 */
|
|
|
|
DATA("17", "ALT-FONT-7"), /* select alternate font 7 */
|
|
|
|
DATA("18", "ALT-FONT-1"), /* select alternate font 1 */
|
|
|
|
DATA("19", "ALT-FONT-1"), /* select alternate font 1 */
|
|
|
|
DATA("20", "FRAKTUR"), /* Fraktur font */
|
|
|
|
DATA("21", "DOUBLEUNDER"), /* double underline */
|
|
|
|
DATA("22", "-DIM"), /* dim off */
|
|
|
|
DATA("23", "-ITALIC"), /* italic off */
|
|
|
|
DATA("24", "-UNDERLINE"), /* underline off */
|
|
|
|
DATA("25", "-BLINK"), /* blink off */
|
|
|
|
DATA("26", "-FASTBLINK"), /* fastblink off */
|
|
|
|
DATA("27", "-REVERSE"), /* reverse off */
|
|
|
|
DATA("28", "-INVISIBLE"), /* invisible off */
|
|
|
|
DATA("29", "-DELETED"), /* deleted off */
|
|
|
|
DATAX()
|
1997-05-15 12:00:00 +08:00
|
|
|
};
|
|
|
|
|
2015-04-05 07:57:48 +08:00
|
|
|
#undef DATA
|
|
|
|
|
2005-10-10 02:41:57 +08:00
|
|
|
static int
|
|
|
|
skip_csi(const char *cap)
|
|
|
|
{
|
|
|
|
int result = 0;
|
|
|
|
if (cap[0] == '\033' && cap[1] == '[')
|
|
|
|
result = 2;
|
|
|
|
else if (UChar(cap[0]) == 0233)
|
|
|
|
result = 1;
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2006-12-18 12:32:42 +08:00
|
|
|
static bool
|
2011-05-15 08:38:25 +08:00
|
|
|
same_param(const char *table, const char *param, size_t length)
|
2006-12-18 12:32:42 +08:00
|
|
|
{
|
|
|
|
bool result = FALSE;
|
|
|
|
if (strncmp(table, param, length) == 0) {
|
|
|
|
result = !isdigit(UChar(param[length]));
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
static char *
|
|
|
|
lookup_params(const assoc * table, char *dst, char *src)
|
|
|
|
{
|
2008-08-05 09:06:16 +08:00
|
|
|
char *result = 0;
|
2006-12-18 12:32:42 +08:00
|
|
|
const char *ep = strtok(src, ";");
|
|
|
|
|
2008-08-05 09:06:16 +08:00
|
|
|
if (ep != 0) {
|
|
|
|
const assoc *ap;
|
2006-12-18 12:32:42 +08:00
|
|
|
|
2008-08-05 09:06:16 +08:00
|
|
|
do {
|
|
|
|
bool found = FALSE;
|
2006-12-18 12:32:42 +08:00
|
|
|
|
2015-04-05 07:57:48 +08:00
|
|
|
for (ap = table; ap->from[0]; ap++) {
|
2008-08-05 09:06:16 +08:00
|
|
|
size_t tlen = strlen(ap->from);
|
|
|
|
|
|
|
|
if (same_param(ap->from, ep, tlen)) {
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_STRCAT(dst, ap->to, MAX_TERMINFO_LENGTH);
|
2008-08-05 09:06:16 +08:00
|
|
|
found = TRUE;
|
|
|
|
break;
|
|
|
|
}
|
2006-12-18 12:32:42 +08:00
|
|
|
}
|
|
|
|
|
2008-08-05 09:06:16 +08:00
|
|
|
if (!found)
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_STRCAT(dst, ep, MAX_TERMINFO_LENGTH);
|
|
|
|
_nc_STRCAT(dst, ";", MAX_TERMINFO_LENGTH);
|
2008-08-05 09:06:16 +08:00
|
|
|
} while
|
|
|
|
((ep = strtok((char *) 0, ";")));
|
2006-12-18 12:32:42 +08:00
|
|
|
|
2008-08-05 09:06:16 +08:00
|
|
|
dst[strlen(dst) - 1] = '\0';
|
2006-12-18 12:32:42 +08:00
|
|
|
|
2008-08-05 09:06:16 +08:00
|
|
|
result = dst;
|
|
|
|
}
|
|
|
|
return result;
|
2006-12-18 12:32:42 +08:00
|
|
|
}
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
static void
|
2017-04-16 09:08:25 +08:00
|
|
|
analyze_string(const char *name, const char *cap, TERMTYPE2 *tp)
|
1997-05-15 12:00:00 +08:00
|
|
|
{
|
2000-07-09 10:46:08 +08:00
|
|
|
char buf2[MAX_TERMINFO_LENGTH];
|
2006-12-18 12:32:42 +08:00
|
|
|
const char *sp;
|
2000-07-09 10:46:08 +08:00
|
|
|
const assoc *ap;
|
2005-10-10 02:41:57 +08:00
|
|
|
int tp_lines = tp->Numbers[2];
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2013-11-17 08:20:49 +08:00
|
|
|
if (!VALID_STRING(cap))
|
1997-05-15 12:00:00 +08:00
|
|
|
return;
|
|
|
|
(void) printf("%s: ", name);
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
for (sp = cap; *sp; sp++) {
|
|
|
|
int i;
|
2005-10-10 02:41:57 +08:00
|
|
|
int csi;
|
2000-07-09 10:46:08 +08:00
|
|
|
size_t len = 0;
|
2006-12-18 12:32:42 +08:00
|
|
|
size_t next;
|
1997-05-15 12:00:00 +08:00
|
|
|
const char *expansion = 0;
|
2006-12-18 12:32:42 +08:00
|
|
|
char buf3[MAX_TERMINFO_LENGTH];
|
1997-05-15 12:00:00 +08:00
|
|
|
|
|
|
|
/* first, check other capabilities in this entry */
|
2000-07-09 10:46:08 +08:00
|
|
|
for (i = 0; i < STRCOUNT; i++) {
|
|
|
|
char *cp = tp->Strings[i];
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2013-11-17 08:20:49 +08:00
|
|
|
/* don't use function-key capabilities */
|
2021-03-21 09:09:34 +08:00
|
|
|
if (strnames[i] == NULL)
|
|
|
|
continue;
|
2013-11-17 08:20:49 +08:00
|
|
|
if (strnames[i][0] == 'k' && strnames[i][1] == 'f')
|
1997-05-15 12:00:00 +08:00
|
|
|
continue;
|
|
|
|
|
2013-11-17 08:20:49 +08:00
|
|
|
if (VALID_STRING(cp) &&
|
|
|
|
cp[0] != '\0' &&
|
|
|
|
cp != cap) {
|
1997-05-15 12:00:00 +08:00
|
|
|
len = strlen(cp);
|
2016-09-11 09:24:00 +08:00
|
|
|
_nc_STRNCPY(buf2, sp, len);
|
1997-05-15 12:00:00 +08:00
|
|
|
buf2[len] = '\0';
|
|
|
|
|
|
|
|
if (_nc_capcmp(cp, buf2))
|
|
|
|
continue;
|
|
|
|
|
2013-12-15 10:33:31 +08:00
|
|
|
#define ISRS(s) (!strncmp((s), "is", (size_t) 2) || !strncmp((s), "rs", (size_t) 2))
|
1997-05-15 12:00:00 +08:00
|
|
|
/*
|
|
|
|
* 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 */
|
2005-10-10 02:41:57 +08:00
|
|
|
if (!expansion) {
|
|
|
|
csi = skip_csi(sp);
|
2015-04-05 07:57:48 +08:00
|
|
|
for (ap = std_caps; ap->from[0]; ap++) {
|
2008-08-17 09:51:55 +08:00
|
|
|
size_t adj = (size_t) (csi ? 2 : 0);
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2005-10-10 02:41:57 +08:00
|
|
|
len = strlen(ap->from);
|
2006-12-18 12:32:42 +08:00
|
|
|
if (csi && skip_csi(ap->from) != csi)
|
|
|
|
continue;
|
2005-10-10 02:41:57 +08:00
|
|
|
if (len > adj
|
|
|
|
&& strncmp(ap->from + adj, sp + csi, len - adj) == 0) {
|
1997-05-15 12:00:00 +08:00
|
|
|
expansion = ap->to;
|
2005-10-10 02:41:57 +08:00
|
|
|
len -= adj;
|
2008-08-05 09:06:16 +08:00
|
|
|
len += (size_t) csi;
|
1997-05-15 12:00:00 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2005-10-10 02:41:57 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* now check for standard-mode sequences */
|
|
|
|
if (!expansion
|
|
|
|
&& (csi = skip_csi(sp)) != 0
|
2014-02-02 08:11:40 +08:00
|
|
|
&& (len = (strspn) (sp + csi, "0123456789;"))
|
2008-08-05 09:06:16 +08:00
|
|
|
&& (len < sizeof(buf3))
|
|
|
|
&& (next = (size_t) csi + len)
|
2006-12-18 12:32:42 +08:00
|
|
|
&& ((sp[next] == 'h') || (sp[next] == 'l'))) {
|
2005-10-10 02:41:57 +08:00
|
|
|
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_STRCPY(buf2,
|
|
|
|
((sp[next] == 'h')
|
|
|
|
? "ECMA+"
|
|
|
|
: "ECMA-"),
|
|
|
|
sizeof(buf2));
|
2016-09-11 09:24:00 +08:00
|
|
|
_nc_STRNCPY(buf3, sp + csi, len);
|
2005-10-10 02:41:57 +08:00
|
|
|
buf3[len] = '\0';
|
|
|
|
|
2006-12-18 12:32:42 +08:00
|
|
|
expansion = lookup_params(std_modes, buf2, buf3);
|
2005-10-10 02:41:57 +08:00
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
|
|
|
|
/* now check for private-mode sequences */
|
|
|
|
if (!expansion
|
2005-10-10 02:41:57 +08:00
|
|
|
&& (csi = skip_csi(sp)) != 0
|
|
|
|
&& sp[csi] == '?'
|
2014-02-02 08:11:40 +08:00
|
|
|
&& (len = (strspn) (sp + csi + 1, "0123456789;"))
|
2008-08-05 09:06:16 +08:00
|
|
|
&& (len < sizeof(buf3))
|
|
|
|
&& (next = (size_t) csi + 1 + len)
|
2006-12-18 12:32:42 +08:00
|
|
|
&& ((sp[next] == 'h') || (sp[next] == 'l'))) {
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_STRCPY(buf2,
|
|
|
|
((sp[next] == 'h')
|
|
|
|
? "DEC+"
|
|
|
|
: "DEC-"),
|
|
|
|
sizeof(buf2));
|
2016-09-11 09:24:00 +08:00
|
|
|
_nc_STRNCPY(buf3, sp + csi + 1, len);
|
1997-05-15 12:00:00 +08:00
|
|
|
buf3[len] = '\0';
|
|
|
|
|
2006-12-18 12:32:42 +08:00
|
|
|
expansion = lookup_params(private_modes, buf2, buf3);
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* now check for ECMA highlight sequences */
|
|
|
|
if (!expansion
|
2005-10-10 02:41:57 +08:00
|
|
|
&& (csi = skip_csi(sp)) != 0
|
2014-02-02 08:11:40 +08:00
|
|
|
&& (len = (strspn) (sp + csi, "0123456789;")) != 0
|
2008-08-05 09:06:16 +08:00
|
|
|
&& (len < sizeof(buf3))
|
|
|
|
&& (next = (size_t) csi + len)
|
2006-12-18 12:32:42 +08:00
|
|
|
&& sp[next] == 'm') {
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_STRCPY(buf2, "SGR:", sizeof(buf2));
|
2016-09-11 09:24:00 +08:00
|
|
|
_nc_STRNCPY(buf3, sp + csi, len);
|
1997-05-15 12:00:00 +08:00
|
|
|
buf3[len] = '\0';
|
2008-08-05 09:06:16 +08:00
|
|
|
len += (size_t) csi + 1;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2006-12-18 12:32:42 +08:00
|
|
|
expansion = lookup_params(ecma_highlights, buf2, buf3);
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
2005-10-10 02:41:57 +08:00
|
|
|
|
|
|
|
if (!expansion
|
|
|
|
&& (csi = skip_csi(sp)) != 0
|
|
|
|
&& sp[csi] == 'm') {
|
2008-08-05 09:06:16 +08:00
|
|
|
len = (size_t) csi + 1;
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_STRCPY(buf2, "SGR:", sizeof(buf2));
|
|
|
|
_nc_STRCAT(buf2, ecma_highlights[0].to, sizeof(buf2));
|
2005-10-10 02:41:57 +08:00
|
|
|
expansion = buf2;
|
|
|
|
}
|
|
|
|
|
1997-05-15 12:00:00 +08:00
|
|
|
/* now check for scroll region reset */
|
2005-10-10 02:41:57 +08:00
|
|
|
if (!expansion
|
|
|
|
&& (csi = skip_csi(sp)) != 0) {
|
|
|
|
if (sp[csi] == 'r') {
|
1997-05-15 12:00:00 +08:00
|
|
|
expansion = "RSR";
|
2005-10-10 02:41:57 +08:00
|
|
|
len = 1;
|
|
|
|
} else {
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_SPRINTF(buf2, _nc_SLIMIT(sizeof(buf2)) "1;%dr", tp_lines);
|
2005-10-10 02:41:57 +08:00
|
|
|
len = strlen(buf2);
|
|
|
|
if (strncmp(buf2, sp + csi, len) == 0)
|
|
|
|
expansion = "RSR";
|
|
|
|
}
|
2008-08-05 09:06:16 +08:00
|
|
|
len += (size_t) csi;
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* now check for home-down */
|
2005-10-10 02:41:57 +08:00
|
|
|
if (!expansion
|
|
|
|
&& (csi = skip_csi(sp)) != 0) {
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_SPRINTF(buf2, _nc_SLIMIT(sizeof(buf2)) "%d;1H", tp_lines);
|
1997-05-15 12:00:00 +08:00
|
|
|
len = strlen(buf2);
|
2005-10-10 02:41:57 +08:00
|
|
|
if (strncmp(buf2, sp + csi, len) == 0) {
|
2000-07-09 10:46:08 +08:00
|
|
|
expansion = "LL";
|
2005-10-10 02:41:57 +08:00
|
|
|
} else {
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_SPRINTF(buf2, _nc_SLIMIT(sizeof(buf2)) "%dH", tp_lines);
|
2005-10-10 02:41:57 +08:00
|
|
|
len = strlen(buf2);
|
|
|
|
if (strncmp(buf2, sp + csi, len) == 0) {
|
|
|
|
expansion = "LL";
|
|
|
|
}
|
|
|
|
}
|
2008-08-05 09:06:16 +08:00
|
|
|
len += (size_t) csi;
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* now look at the expansion we got, if any */
|
2000-07-09 10:46:08 +08:00
|
|
|
if (expansion) {
|
2008-08-05 09:06:16 +08:00
|
|
|
printf("{%s}", expansion);
|
1997-05-15 12:00:00 +08:00
|
|
|
sp += len - 1;
|
2000-07-09 10:46:08 +08:00
|
|
|
} else {
|
1997-05-15 12:00:00 +08:00
|
|
|
/* couldn't match anything */
|
|
|
|
buf2[0] = *sp;
|
|
|
|
buf2[1] = '\0';
|
2008-08-05 09:06:16 +08:00
|
|
|
fputs(TIC_EXPAND(buf2), stdout);
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
}
|
2008-08-05 09:06:16 +08:00
|
|
|
putchar('\n');
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/***************************************************************************
|
|
|
|
*
|
|
|
|
* File comparison
|
|
|
|
*
|
|
|
|
***************************************************************************/
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
static void
|
|
|
|
file_comparison(int argc, char *argv[])
|
1997-05-15 12:00:00 +08:00
|
|
|
{
|
|
|
|
#define MAXCOMPARE 2
|
|
|
|
/* someday we may allow comparisons on more files */
|
2000-07-09 10:46:08 +08:00
|
|
|
int filecount = 0;
|
|
|
|
ENTRY *heads[MAXCOMPARE];
|
|
|
|
ENTRY *qp, *rp;
|
|
|
|
int i, n;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2008-08-05 09:06:16 +08:00
|
|
|
memset(heads, 0, sizeof(heads));
|
2016-10-02 09:31:28 +08:00
|
|
|
dump_init((char *) 0, F_LITERAL, S_TERMINFO,
|
|
|
|
FALSE, 0, 65535, itrace, FALSE, FALSE, FALSE);
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
for (n = 0; n < argc && n < MAXCOMPARE; n++) {
|
|
|
|
if (freopen(argv[n], "r", stdin) == 0)
|
1997-05-15 12:00:00 +08:00
|
|
|
_nc_err_abort("Can't open %s", argv[n]);
|
|
|
|
|
2012-06-03 08:52:00 +08:00
|
|
|
#if NO_LEAKS
|
|
|
|
entered[n].head = _nc_head;
|
|
|
|
entered[n].tail = _nc_tail;
|
|
|
|
#endif
|
2000-07-09 10:46:08 +08:00
|
|
|
_nc_head = _nc_tail = 0;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
|
|
|
/* parse entries out of the source file */
|
|
|
|
_nc_set_source(argv[n]);
|
2005-10-10 02:41:57 +08:00
|
|
|
_nc_read_entry_source(stdin, NULL, TRUE, literal, NULLHOOK);
|
1997-05-15 12:00:00 +08:00
|
|
|
|
|
|
|
if (itrace)
|
2000-07-09 10:46:08 +08:00
|
|
|
(void) fprintf(stderr, "Resolving file %d...\n", n - 0);
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
/* maybe do use resolution */
|
2005-10-10 02:41:57 +08:00
|
|
|
if (!_nc_resolve_uses2(!limited, literal)) {
|
1997-05-15 12:00:00 +08:00
|
|
|
(void) fprintf(stderr,
|
2000-10-21 12:42:11 +08:00
|
|
|
"There are unresolved use entries in %s:\n",
|
|
|
|
argv[n]);
|
2000-07-09 10:46:08 +08:00
|
|
|
for_entry_list(qp) {
|
|
|
|
if (qp->nuses) {
|
1997-05-15 12:00:00 +08:00
|
|
|
(void) fputs(qp->tterm.term_names, stderr);
|
|
|
|
(void) fputc('\n', stderr);
|
|
|
|
}
|
2000-07-09 10:46:08 +08:00
|
|
|
}
|
2004-02-09 10:15:26 +08:00
|
|
|
ExitProgram(EXIT_FAILURE);
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
heads[filecount] = _nc_head;
|
|
|
|
filecount++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* OK, all entries are in core. Ready to do the comparison */
|
|
|
|
if (itrace)
|
|
|
|
(void) fprintf(stderr, "Entries are now in core...\n");
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
/* The entry-matching loop. Sigh, this is intrinsically quadratic. */
|
|
|
|
for (qp = heads[0]; qp; qp = qp->next) {
|
1997-05-15 12:00:00 +08:00
|
|
|
for (rp = heads[1]; rp; rp = rp->next)
|
2000-07-09 10:46:08 +08:00
|
|
|
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++;
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* now we have two circular lists with crosslinks */
|
|
|
|
if (itrace)
|
|
|
|
(void) fprintf(stderr, "Name matches are done...\n");
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
for (qp = heads[0]; qp; qp = qp->next) {
|
|
|
|
if (qp->ncrosslinks > 1) {
|
1997-05-15 12:00:00 +08:00
|
|
|
(void) fprintf(stderr,
|
2000-10-21 12:42:11 +08:00
|
|
|
"%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]);
|
2000-07-09 10:46:08 +08:00
|
|
|
for (i = 0; i < qp->ncrosslinks; i++)
|
1997-05-15 12:00:00 +08:00
|
|
|
(void) fprintf(stderr,
|
2000-10-21 12:42:11 +08:00
|
|
|
"\t%s\n",
|
|
|
|
_nc_first_name((qp->crosslinks[i])->tterm.term_names));
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
2000-07-09 10:46:08 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
for (rp = heads[1]; rp; rp = rp->next) {
|
|
|
|
if (rp->ncrosslinks > 1) {
|
1997-05-15 12:00:00 +08:00
|
|
|
(void) fprintf(stderr,
|
2000-10-21 12:42:11 +08:00
|
|
|
"%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]);
|
2000-07-09 10:46:08 +08:00
|
|
|
for (i = 0; i < rp->ncrosslinks; i++)
|
1997-05-15 12:00:00 +08:00
|
|
|
(void) fprintf(stderr,
|
2000-10-21 12:42:11 +08:00
|
|
|
"\t%s\n",
|
|
|
|
_nc_first_name((rp->crosslinks[i])->tterm.term_names));
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
2000-07-09 10:46:08 +08:00
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
|
|
|
|
(void) printf("In file 1 (%s) only:\n", argv[0]);
|
|
|
|
for (qp = heads[0]; qp; qp = qp->next)
|
2000-07-09 10:46:08 +08:00
|
|
|
if (qp->ncrosslinks == 0)
|
1997-05-15 12:00:00 +08:00
|
|
|
(void) printf("\t%s\n",
|
2000-10-21 12:42:11 +08:00
|
|
|
_nc_first_name(qp->tterm.term_names));
|
1997-05-15 12:00:00 +08:00
|
|
|
|
|
|
|
(void) printf("In file 2 (%s) only:\n", argv[1]);
|
|
|
|
for (rp = heads[1]; rp; rp = rp->next)
|
2000-07-09 10:46:08 +08:00
|
|
|
if (rp->ncrosslinks == 0)
|
1997-05-15 12:00:00 +08:00
|
|
|
(void) printf("\t%s\n",
|
2000-10-21 12:42:11 +08:00
|
|
|
_nc_first_name(rp->tterm.term_names));
|
1997-05-15 12:00:00 +08:00
|
|
|
|
|
|
|
(void) printf("The following entries are equivalent:\n");
|
2000-07-09 10:46:08 +08:00
|
|
|
for (qp = heads[0]; qp; qp = qp->next) {
|
|
|
|
if (qp->ncrosslinks == 1) {
|
|
|
|
rp = qp->crosslinks[0];
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
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];
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2022-03-06 10:01:23 +08:00
|
|
|
canonical_name(qp->tterm.term_names, name1);
|
|
|
|
canonical_name(rp->tterm.term_names, name2);
|
2000-07-09 10:46:08 +08:00
|
|
|
|
|
|
|
(void) printf("%s = %s\n", name1, name2);
|
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
(void) printf("Differing entries:\n");
|
|
|
|
termcount = 2;
|
2000-07-09 10:46:08 +08:00
|
|
|
for (qp = heads[0]; qp; qp = qp->next) {
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
if (qp->ncrosslinks == 1) {
|
|
|
|
rp = qp->crosslinks[0];
|
1999-10-24 12:32:42 +08:00
|
|
|
#if NCURSES_XNAMES
|
2000-07-09 10:46:08 +08:00
|
|
|
/* sorry - we have to do this on each pass */
|
1999-10-24 12:32:42 +08:00
|
|
|
_nc_align_termtype(&qp->tterm, &rp->tterm);
|
|
|
|
#endif
|
2000-07-09 10:46:08 +08:00
|
|
|
if (!(entryeq(&qp->tterm, &rp->tterm) && useeq(qp, rp))) {
|
|
|
|
char name1[NAMESIZE], name2[NAMESIZE];
|
2012-05-27 07:58:56 +08:00
|
|
|
char *names[3];
|
|
|
|
|
|
|
|
names[0] = name1;
|
|
|
|
names[1] = name2;
|
|
|
|
names[2] = 0;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
entries[0] = *qp;
|
|
|
|
entries[1] = *rp;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2022-03-06 10:01:23 +08:00
|
|
|
canonical_name(qp->tterm.term_names, name1);
|
|
|
|
canonical_name(rp->tterm.term_names, name2);
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
switch (compare) {
|
|
|
|
case C_DIFFERENCE:
|
2012-05-27 07:58:56 +08:00
|
|
|
show_comparing(names);
|
2000-07-09 10:46:08 +08:00
|
|
|
compare_entry(compare_predicate, &entries->tterm, quiet);
|
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case C_COMMON:
|
2012-05-27 07:58:56 +08:00
|
|
|
show_comparing(names);
|
2000-07-09 10:46:08 +08:00
|
|
|
compare_entry(compare_predicate, &entries->tterm, quiet);
|
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case C_NAND:
|
2012-05-27 07:58:56 +08:00
|
|
|
show_comparing(names);
|
2000-07-09 10:46:08 +08:00
|
|
|
compare_entry(compare_predicate, &entries->tterm, quiet);
|
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
static void
|
|
|
|
usage(void)
|
1997-05-15 12:00:00 +08:00
|
|
|
{
|
2015-04-05 07:57:48 +08:00
|
|
|
#define DATA(s) s "\n"
|
|
|
|
static const char head[] =
|
|
|
|
{
|
|
|
|
DATA("Usage: infocmp [options] [-A directory] [-B directory] [termname...]")
|
|
|
|
DATA("")
|
|
|
|
DATA("Options:")
|
|
|
|
};
|
|
|
|
#undef DATA
|
2020-07-12 08:25:08 +08:00
|
|
|
/* length is given here so the compiler can make everything readonly */
|
2015-04-05 07:57:48 +08:00
|
|
|
#define DATA(s) s
|
2020-07-12 08:25:08 +08:00
|
|
|
static const char options[][46] =
|
2000-07-09 10:46:08 +08:00
|
|
|
{
|
2015-04-05 07:57:48 +08:00
|
|
|
" -0 print single-row"
|
2000-07-09 10:46:08 +08:00
|
|
|
," -1 print single-column"
|
|
|
|
," -C use termcap-names"
|
2015-08-23 08:47:10 +08:00
|
|
|
," -D print database locations"
|
|
|
|
," -E format output as C tables"
|
2000-07-09 10:46:08 +08:00
|
|
|
," -F compare terminfo-files"
|
2015-08-23 08:47:10 +08:00
|
|
|
," -G format %{number} to %'char'"
|
2000-07-09 10:46:08 +08:00
|
|
|
," -I use terminfo-names"
|
2015-08-23 08:47:10 +08:00
|
|
|
," -K use termcap-names and BSD syntax"
|
2000-07-09 10:46:08 +08:00
|
|
|
," -L use long names"
|
|
|
|
," -R subset (see manpage)"
|
|
|
|
," -T eliminate size limits (test)"
|
2015-04-05 07:57:48 +08:00
|
|
|
," -U do not post-process entries"
|
2000-07-09 10:46:08 +08:00
|
|
|
," -V print version"
|
2016-10-02 09:31:28 +08:00
|
|
|
," -W wrap long strings per -w[n]"
|
2000-07-09 10:46:08 +08:00
|
|
|
#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"
|
|
|
|
," -f with -1, format complex strings"
|
|
|
|
," -g format %'char' to %{number}"
|
|
|
|
," -i analyze initialization/reset"
|
|
|
|
," -l output terminfo names"
|
|
|
|
," -n list capabilities in neither"
|
|
|
|
," -p ignore padding specifiers"
|
2015-09-06 09:23:48 +08:00
|
|
|
," -Q number dump compiled description"
|
2000-07-09 10:46:08 +08:00
|
|
|
," -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"
|
2002-10-13 11:35:53 +08:00
|
|
|
#if NCURSES_XNAMES
|
|
|
|
," -t suppress commented-out capabilities"
|
|
|
|
#endif
|
2000-07-09 10:46:08 +08:00
|
|
|
," -u produce source with 'use='"
|
|
|
|
," -v number (verbose)"
|
|
|
|
," -w number (width)"
|
2005-10-10 02:41:57 +08:00
|
|
|
#if NCURSES_XNAMES
|
2015-04-05 07:57:48 +08:00
|
|
|
," -x unknown capabilities are user-defined"
|
2005-10-10 02:41:57 +08:00
|
|
|
#endif
|
2000-07-09 10:46:08 +08:00
|
|
|
};
|
2015-04-05 07:57:48 +08:00
|
|
|
#undef DATA
|
|
|
|
const size_t last = SIZEOF(options);
|
|
|
|
const size_t left = (last + 1) / 2;
|
2000-07-09 10:46:08 +08:00
|
|
|
size_t n;
|
|
|
|
|
2015-04-05 07:57:48 +08:00
|
|
|
fputs(head, stderr);
|
2000-07-09 10:46:08 +08:00
|
|
|
for (n = 0; n < left; n++) {
|
2015-04-05 07:57:48 +08:00
|
|
|
size_t m = n + left;
|
2000-07-09 10:46:08 +08:00
|
|
|
if (m < last)
|
2015-04-05 07:57:48 +08:00
|
|
|
fprintf(stderr, "%-40.40s%s\n", options[n], options[m]);
|
2000-07-09 10:46:08 +08:00
|
|
|
else
|
2015-04-05 07:57:48 +08:00
|
|
|
fprintf(stderr, "%s\n", options[n]);
|
2000-07-09 10:46:08 +08:00
|
|
|
}
|
2004-02-09 10:15:26 +08:00
|
|
|
ExitProgram(EXIT_FAILURE);
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
static char *
|
2002-10-13 11:35:53 +08:00
|
|
|
any_initializer(const char *fmt, const char *type)
|
1999-10-24 12:32:42 +08:00
|
|
|
{
|
|
|
|
static char *initializer;
|
2012-02-26 09:59:00 +08:00
|
|
|
static size_t need;
|
1999-10-24 12:32:42 +08:00
|
|
|
char *s;
|
|
|
|
|
2012-02-26 09:59:00 +08:00
|
|
|
if (initializer == 0) {
|
|
|
|
need = (strlen(entries->tterm.term_names)
|
|
|
|
+ strlen(type)
|
|
|
|
+ strlen(fmt));
|
ncurses 5.9 - patch 20121117
> fixes based on Coverity report:
+ add missing braces around FreeAndNull in two places.
+ various fixes in test/ncurses.c
+ improve limit-checks in tinfo/make_hash.c, tinfo/read_entry.c
+ correct malloc size in progs/infocmp.c
+ guard against negative array indices in test/knight.c
+ fix off-by-one limit check in test/color_name.h
+ add null-pointer check in progs/tabs.c, test/bs.c, test/demo_forms.c,
test/inchs.c
+ fix memory-leak in tinfo/lib_setup.c, progs/toe.c,
test/clip_printw.c, test/demo_menus.c
+ delete unused windows in test/chgat.c, test/clip_printw.c,
test/insdelln.c, test/newdemo.c on error-return.
2012-11-18 10:58:41 +08:00
|
|
|
initializer = (char *) malloc(need + 1);
|
2012-10-28 07:06:26 +08:00
|
|
|
if (initializer == 0)
|
|
|
|
failed("any_initializer");
|
2012-02-26 09:59:00 +08:00
|
|
|
}
|
1999-10-24 12:32:42 +08:00
|
|
|
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_STRCPY(initializer, entries->tterm.term_names, need);
|
2000-07-09 10:46:08 +08:00
|
|
|
for (s = initializer; *s != 0 && *s != '|'; s++) {
|
2002-10-13 11:35:53 +08:00
|
|
|
if (!isalnum(UChar(*s)))
|
1999-10-24 12:32:42 +08:00
|
|
|
*s = '_';
|
|
|
|
}
|
|
|
|
*s = 0;
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_SPRINTF(s, _nc_SLIMIT(need) fmt, type);
|
1999-10-24 12:32:42 +08:00
|
|
|
return initializer;
|
|
|
|
}
|
|
|
|
|
2002-10-13 11:35:53 +08:00
|
|
|
static char *
|
|
|
|
name_initializer(const char *type)
|
|
|
|
{
|
|
|
|
return any_initializer("_%s_data", type);
|
|
|
|
}
|
|
|
|
|
|
|
|
static char *
|
|
|
|
string_variable(const char *type)
|
|
|
|
{
|
|
|
|
return any_initializer("_s_%s", type);
|
|
|
|
}
|
|
|
|
|
1999-10-24 12:32:42 +08:00
|
|
|
/* dump C initializers for the terminal type */
|
2000-07-09 10:46:08 +08:00
|
|
|
static void
|
2017-04-16 09:08:25 +08:00
|
|
|
dump_initializers(TERMTYPE2 *term)
|
1999-10-24 12:32:42 +08:00
|
|
|
{
|
2004-02-09 10:15:26 +08:00
|
|
|
unsigned n;
|
2002-10-13 11:35:53 +08:00
|
|
|
const char *str = 0;
|
|
|
|
|
|
|
|
printf("\nstatic char %s[] = \"%s\";\n\n",
|
|
|
|
name_initializer("alias"), entries->tterm.term_names);
|
|
|
|
|
|
|
|
for_each_string(n, term) {
|
|
|
|
if (VALID_STRING(term->Strings[n])) {
|
2021-04-04 09:13:05 +08:00
|
|
|
char buf[MAX_STRING], *sp, *tp;
|
|
|
|
|
2002-10-13 11:35:53 +08:00
|
|
|
tp = buf;
|
2012-03-11 09:59:25 +08:00
|
|
|
#define TP_LIMIT ((MAX_STRING - 5) - (size_t)(tp - buf))
|
2002-10-13 11:35:53 +08:00
|
|
|
*tp++ = '"';
|
|
|
|
for (sp = term->Strings[n];
|
2012-03-11 09:59:25 +08:00
|
|
|
*sp != 0 && TP_LIMIT > 2;
|
2002-10-13 11:35:53 +08:00
|
|
|
sp++) {
|
|
|
|
if (isascii(UChar(*sp))
|
|
|
|
&& isprint(UChar(*sp))
|
|
|
|
&& *sp != '\\'
|
|
|
|
&& *sp != '"')
|
|
|
|
*tp++ = *sp;
|
|
|
|
else {
|
2012-03-11 09:59:25 +08:00
|
|
|
_nc_SPRINTF(tp, _nc_SLIMIT(TP_LIMIT) "\\%03o", UChar(*sp));
|
2002-10-13 11:35:53 +08:00
|
|
|
tp += 4;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
*tp++ = '"';
|
|
|
|
*tp = '\0';
|
|
|
|
(void) printf("static char %-20s[] = %s;\n",
|
2011-05-15 08:38:25 +08:00
|
|
|
string_variable(ExtStrname(term, (int) n, strnames)),
|
|
|
|
buf);
|
2002-10-13 11:35:53 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
printf("\n");
|
1999-10-24 12:32:42 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
(void) printf("static char %s[] = %s\n", name_initializer("bool"), L_CURL);
|
1999-10-24 12:32:42 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
for_each_boolean(n, term) {
|
|
|
|
switch ((int) (term->Booleans[n])) {
|
1999-10-24 12:32:42 +08:00
|
|
|
case TRUE:
|
|
|
|
str = "TRUE";
|
|
|
|
break;
|
|
|
|
|
|
|
|
case FALSE:
|
|
|
|
str = "FALSE";
|
|
|
|
break;
|
|
|
|
|
|
|
|
case ABSENT_BOOLEAN:
|
|
|
|
str = "ABSENT_BOOLEAN";
|
|
|
|
break;
|
|
|
|
|
|
|
|
case CANCELLED_BOOLEAN:
|
|
|
|
str = "CANCELLED_BOOLEAN";
|
|
|
|
break;
|
|
|
|
}
|
2005-10-10 02:41:57 +08:00
|
|
|
(void) printf("\t/* %3u: %-8s */\t%s,\n",
|
2011-05-15 08:38:25 +08:00
|
|
|
n, ExtBoolname(term, (int) n, boolnames), str);
|
1999-10-24 12:32:42 +08:00
|
|
|
}
|
|
|
|
(void) printf("%s;\n", R_CURL);
|
|
|
|
|
|
|
|
(void) printf("static short %s[] = %s\n", name_initializer("number"), L_CURL);
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
for_each_number(n, term) {
|
|
|
|
char buf[BUFSIZ];
|
|
|
|
switch (term->Numbers[n]) {
|
1999-10-24 12:32:42 +08:00
|
|
|
case ABSENT_NUMERIC:
|
|
|
|
str = "ABSENT_NUMERIC";
|
|
|
|
break;
|
|
|
|
case CANCELLED_NUMERIC:
|
|
|
|
str = "CANCELLED_NUMERIC";
|
|
|
|
break;
|
|
|
|
default:
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf)) "%d", term->Numbers[n]);
|
1999-10-24 12:32:42 +08:00
|
|
|
str = buf;
|
|
|
|
break;
|
|
|
|
}
|
2005-10-10 02:41:57 +08:00
|
|
|
(void) printf("\t/* %3u: %-8s */\t%s,\n", n,
|
2011-05-15 08:38:25 +08:00
|
|
|
ExtNumname(term, (int) n, numnames), str);
|
1999-10-24 12:32:42 +08:00
|
|
|
}
|
|
|
|
(void) printf("%s;\n", R_CURL);
|
|
|
|
|
|
|
|
(void) printf("static char * %s[] = %s\n", name_initializer("string"), L_CURL);
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
for_each_string(n, term) {
|
1999-10-24 12:32:42 +08:00
|
|
|
|
|
|
|
if (term->Strings[n] == ABSENT_STRING)
|
|
|
|
str = "ABSENT_STRING";
|
|
|
|
else if (term->Strings[n] == CANCELLED_STRING)
|
|
|
|
str = "CANCELLED_STRING";
|
2000-07-09 10:46:08 +08:00
|
|
|
else {
|
2011-05-15 08:38:25 +08:00
|
|
|
str = string_variable(ExtStrname(term, (int) n, strnames));
|
1999-10-24 12:32:42 +08:00
|
|
|
}
|
2005-10-10 02:41:57 +08:00
|
|
|
(void) printf("\t/* %3u: %-8s */\t%s,\n", n,
|
2011-05-15 08:38:25 +08:00
|
|
|
ExtStrname(term, (int) n, strnames), str);
|
1999-10-24 12:32:42 +08:00
|
|
|
}
|
|
|
|
(void) printf("%s;\n", R_CURL);
|
2002-10-13 11:35:53 +08:00
|
|
|
|
|
|
|
#if NCURSES_XNAMES
|
|
|
|
if ((NUM_BOOLEANS(term) != BOOLCOUNT)
|
|
|
|
|| (NUM_NUMBERS(term) != NUMCOUNT)
|
|
|
|
|| (NUM_STRINGS(term) != STRCOUNT)) {
|
|
|
|
(void) printf("static char * %s[] = %s\n",
|
|
|
|
name_initializer("string_ext"), L_CURL);
|
|
|
|
for (n = BOOLCOUNT; n < NUM_BOOLEANS(term); ++n) {
|
2005-10-10 02:41:57 +08:00
|
|
|
(void) printf("\t/* %3u: bool */\t\"%s\",\n",
|
2011-05-15 08:38:25 +08:00
|
|
|
n, ExtBoolname(term, (int) n, boolnames));
|
2002-10-13 11:35:53 +08:00
|
|
|
}
|
|
|
|
for (n = NUMCOUNT; n < NUM_NUMBERS(term); ++n) {
|
2005-10-10 02:41:57 +08:00
|
|
|
(void) printf("\t/* %3u: num */\t\"%s\",\n",
|
2011-05-15 08:38:25 +08:00
|
|
|
n, ExtNumname(term, (int) n, numnames));
|
2002-10-13 11:35:53 +08:00
|
|
|
}
|
|
|
|
for (n = STRCOUNT; n < NUM_STRINGS(term); ++n) {
|
2005-10-10 02:41:57 +08:00
|
|
|
(void) printf("\t/* %3u: str */\t\"%s\",\n",
|
2011-05-15 08:38:25 +08:00
|
|
|
n, ExtStrname(term, (int) n, strnames));
|
2002-10-13 11:35:53 +08:00
|
|
|
}
|
|
|
|
(void) printf("%s;\n", R_CURL);
|
|
|
|
}
|
|
|
|
#endif
|
1999-10-24 12:32:42 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* dump C initializers for the terminal type */
|
2000-07-09 10:46:08 +08:00
|
|
|
static void
|
2017-04-16 09:08:25 +08:00
|
|
|
dump_termtype(TERMTYPE2 *term)
|
1999-10-24 12:32:42 +08:00
|
|
|
{
|
2002-10-13 11:35:53 +08:00
|
|
|
(void) printf("\t%s\n\t\t%s,\n", L_CURL, name_initializer("alias"));
|
1999-10-24 12:32:42 +08:00
|
|
|
(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",
|
2002-10-13 11:35:53 +08:00
|
|
|
((NUM_BOOLEANS(term) != BOOLCOUNT)
|
|
|
|
|| (NUM_NUMBERS(term) != NUMCOUNT)
|
|
|
|
|| (NUM_STRINGS(term) != STRCOUNT))
|
2000-10-21 12:42:11 +08:00
|
|
|
? name_initializer("string_ext")
|
|
|
|
: "(char **)0");
|
1999-10-24 12:32:42 +08:00
|
|
|
|
|
|
|
(void) printf("\t\t%d,\t\t/* count total Booleans */\n", NUM_BOOLEANS(term));
|
2000-07-09 10:46:08 +08:00
|
|
|
(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));
|
1999-10-24 12:32:42 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
(void) printf("\t\t%d,\t\t/* count extensions to Booleans */\n",
|
2000-10-21 12:42:11 +08:00
|
|
|
NUM_BOOLEANS(term) - BOOLCOUNT);
|
2000-07-09 10:46:08 +08:00
|
|
|
(void) printf("\t\t%d,\t\t/* count extensions to Numbers */\n",
|
2000-10-21 12:42:11 +08:00
|
|
|
NUM_NUMBERS(term) - NUMCOUNT);
|
2000-07-09 10:46:08 +08:00
|
|
|
(void) printf("\t\t%d,\t\t/* count extensions to Strings */\n",
|
2000-10-21 12:42:11 +08:00
|
|
|
NUM_STRINGS(term) - STRCOUNT);
|
1999-10-24 12:32:42 +08:00
|
|
|
|
|
|
|
(void) printf("#endif /* NCURSES_XNAMES */\n");
|
2008-01-20 08:51:10 +08:00
|
|
|
#else
|
|
|
|
(void) term;
|
1999-10-24 12:32:42 +08:00
|
|
|
#endif /* NCURSES_XNAMES */
|
|
|
|
(void) printf("\t%s\n", R_CURL);
|
|
|
|
}
|
|
|
|
|
2000-10-21 12:42:11 +08:00
|
|
|
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);
|
2004-02-09 10:15:26 +08:00
|
|
|
ExitProgram(EXIT_FAILURE);
|
2000-10-21 12:42:11 +08:00
|
|
|
}
|
|
|
|
return (int) value;
|
|
|
|
}
|
|
|
|
|
2004-02-09 10:15:26 +08:00
|
|
|
static char *
|
|
|
|
terminal_env(void)
|
|
|
|
{
|
|
|
|
char *terminal;
|
|
|
|
|
|
|
|
if ((terminal = getenv("TERM")) == 0) {
|
|
|
|
(void) fprintf(stderr,
|
2007-07-29 08:27:12 +08:00
|
|
|
"%s: environment variable TERM not set\n",
|
|
|
|
_nc_progname);
|
2004-02-09 10:15:26 +08:00
|
|
|
exit(EXIT_FAILURE);
|
|
|
|
}
|
|
|
|
return terminal;
|
|
|
|
}
|
|
|
|
|
2011-12-18 08:13:30 +08:00
|
|
|
/*
|
|
|
|
* Show the databases that infocmp knows about. The location to which it writes is
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
show_databases(void)
|
|
|
|
{
|
|
|
|
DBDIRS state;
|
|
|
|
int offset;
|
|
|
|
const char *path2;
|
|
|
|
|
|
|
|
_nc_first_db(&state, &offset);
|
|
|
|
while ((path2 = _nc_next_db(&state, &offset)) != 0) {
|
|
|
|
printf("%s\n", path2);
|
|
|
|
}
|
|
|
|
_nc_last_db();
|
|
|
|
}
|
|
|
|
|
1997-05-15 12:00:00 +08:00
|
|
|
/***************************************************************************
|
|
|
|
*
|
|
|
|
* Main sequence
|
|
|
|
*
|
|
|
|
***************************************************************************/
|
|
|
|
|
2009-12-06 09:32:45 +08:00
|
|
|
#if NO_LEAKS
|
|
|
|
#define MAIN_LEAKS() \
|
2021-06-13 09:18:49 +08:00
|
|
|
_nc_free_termtype2(&entries[0].tterm); \
|
|
|
|
_nc_free_termtype2(&entries[1].tterm); \
|
2009-12-06 09:32:45 +08:00
|
|
|
free(myargv); \
|
|
|
|
free(tfile); \
|
|
|
|
free(tname)
|
|
|
|
#else
|
|
|
|
#define MAIN_LEAKS() /* nothing */
|
|
|
|
#endif
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
int
|
|
|
|
main(int argc, char *argv[])
|
1997-05-15 12:00:00 +08:00
|
|
|
{
|
2000-07-09 10:46:08 +08:00
|
|
|
/* Avoid "local data >32k" error with mwcc */
|
|
|
|
/* Also avoid overflowing smaller stacks on systems like AmigaOS */
|
2007-07-29 08:27:12 +08:00
|
|
|
path *tfile = 0;
|
|
|
|
char **tname = 0;
|
2011-05-15 08:38:25 +08:00
|
|
|
size_t maxterms;
|
2007-07-29 08:27:12 +08:00
|
|
|
|
2007-08-13 00:31:21 +08:00
|
|
|
char **myargv;
|
|
|
|
|
2007-07-29 08:27:12 +08:00
|
|
|
char *firstdir, *restdir;
|
2021-04-18 09:15:31 +08:00
|
|
|
int c;
|
2000-07-09 10:46:08 +08:00
|
|
|
bool formatted = FALSE;
|
|
|
|
bool filecompare = FALSE;
|
|
|
|
int initdump = 0;
|
|
|
|
bool init_analyze = FALSE;
|
2002-10-13 11:35:53 +08:00
|
|
|
bool suppress_untranslatable = FALSE;
|
2015-09-06 09:23:48 +08:00
|
|
|
int quickdump = 0;
|
2016-10-02 09:31:28 +08:00
|
|
|
bool wrap_strings = FALSE;
|
2000-07-09 10:46:08 +08:00
|
|
|
|
|
|
|
/* where is the terminfo database location going to default to? */
|
|
|
|
restdir = firstdir = 0;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2005-10-10 02:41:57 +08:00
|
|
|
#if NCURSES_XNAMES
|
|
|
|
use_extended_names(FALSE);
|
|
|
|
#endif
|
ncurses 5.9 - patch 20110730
+ modify configure script and makefiles in c++ and progs to allow the
directory used for rpath option to be overridden, e.g., to work
around updates to the variables used by tic during an install.
+ add -K option to tic/infocmp, to provide stricter BSD-compatibility
for termcap output.
+ add _nc_strict_bsd variable in tic library which controls the
"strict" BSD termcap compatibility from 20110723, plus these
features:
+ allow escapes such as "\8" and "\9" when reading termcap
+ disallow "\a", "\e", "\l", "\s" and "\:" escapes when reading
termcap files, passing through "a", "e", etc.
+ expand "\:" as "\072" on output.
+ modify _nc_get_token() to reset the token's string value in case
there is a string-typed token lacking the "=" marker.
+ fix a few memory leaks in _nc_tgetent.
+ fix a few places where reading from a termcap file could refer to
freed memory.
+ add an overflow check when converting terminfo/termcap numeric
values, since terminfo stores those in a short, and they must be
positive.
+ correct internal variables used for translating to termcap "%>"
feature, and translating from termcap %B to terminfo, needed by
tctest (cf: 19991211).
+ amend a minor fix to acsc when loading a termcap file to separate it
from warnings needed for tic (cf: 20040710)
+ modify logic in _nc_read_entry() and _nc_read_tic_entry() to allow
a termcap file to be handled via TERMINFO_DIRS.
+ modify _nc_infotocap() to include non-mandatory padding when
translating to termcap.
+ modify _nc_read_termcap_entry(), passing a flag in the case where
getcap is used, to reduce interactive warning messages.
2011-07-31 09:15:59 +08:00
|
|
|
_nc_strict_bsd = 0;
|
2005-10-10 02:41:57 +08:00
|
|
|
|
2007-07-29 08:27:12 +08:00
|
|
|
_nc_progname = _nc_rootname(argv[0]);
|
|
|
|
|
2007-08-13 00:31:21 +08:00
|
|
|
/* make sure we have enough space to add two terminal entries */
|
2008-08-17 09:51:55 +08:00
|
|
|
myargv = typeCalloc(char *, (size_t) (argc + 3));
|
2012-10-28 07:06:26 +08:00
|
|
|
if (myargv == 0)
|
|
|
|
failed("myargv");
|
|
|
|
|
2008-08-05 09:06:16 +08:00
|
|
|
memcpy(myargv, argv, (sizeof(char *) * (size_t) argc));
|
2007-08-13 00:31:21 +08:00
|
|
|
argv = myargv;
|
|
|
|
|
2002-10-13 11:35:53 +08:00
|
|
|
while ((c = getopt(argc,
|
|
|
|
argv,
|
2016-10-02 09:31:28 +08:00
|
|
|
"01A:aB:CcDdEeFfGgIiKLlnpQ:qR:rs:TtUuVv:Ww:x")) != -1) {
|
2000-07-09 10:46:08 +08:00
|
|
|
switch (c) {
|
2011-08-08 06:43:00 +08:00
|
|
|
case '0':
|
|
|
|
mwidth = 65535;
|
|
|
|
mheight = 1;
|
|
|
|
break;
|
|
|
|
|
2002-10-13 11:35:53 +08:00
|
|
|
case '1':
|
|
|
|
mwidth = 0;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 'A':
|
|
|
|
firstdir = optarg;
|
|
|
|
break;
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
#if NCURSES_XNAMES
|
|
|
|
case 'a':
|
|
|
|
_nc_disable_period = TRUE;
|
|
|
|
use_extended_names(TRUE);
|
|
|
|
break;
|
|
|
|
#endif
|
2002-10-13 11:35:53 +08:00
|
|
|
case 'B':
|
|
|
|
restdir = optarg;
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
ncurses 5.9 - patch 20110730
+ modify configure script and makefiles in c++ and progs to allow the
directory used for rpath option to be overridden, e.g., to work
around updates to the variables used by tic during an install.
+ add -K option to tic/infocmp, to provide stricter BSD-compatibility
for termcap output.
+ add _nc_strict_bsd variable in tic library which controls the
"strict" BSD termcap compatibility from 20110723, plus these
features:
+ allow escapes such as "\8" and "\9" when reading termcap
+ disallow "\a", "\e", "\l", "\s" and "\:" escapes when reading
termcap files, passing through "a", "e", etc.
+ expand "\:" as "\072" on output.
+ modify _nc_get_token() to reset the token's string value in case
there is a string-typed token lacking the "=" marker.
+ fix a few memory leaks in _nc_tgetent.
+ fix a few places where reading from a termcap file could refer to
freed memory.
+ add an overflow check when converting terminfo/termcap numeric
values, since terminfo stores those in a short, and they must be
positive.
+ correct internal variables used for translating to termcap "%>"
feature, and translating from termcap %B to terminfo, needed by
tctest (cf: 19991211).
+ amend a minor fix to acsc when loading a termcap file to separate it
from warnings needed for tic (cf: 20040710)
+ modify logic in _nc_read_entry() and _nc_read_tic_entry() to allow
a termcap file to be handled via TERMINFO_DIRS.
+ modify _nc_infotocap() to include non-mandatory padding when
translating to termcap.
+ modify _nc_read_termcap_entry(), passing a flag in the case where
getcap is used, to reduce interactive warning messages.
2011-07-31 09:15:59 +08:00
|
|
|
case 'K':
|
|
|
|
_nc_strict_bsd = 1;
|
|
|
|
/* FALLTHRU */
|
2002-10-13 11:35:53 +08:00
|
|
|
case 'C':
|
|
|
|
outform = F_TERMCAP;
|
|
|
|
tversion = "BSD";
|
|
|
|
if (sortmode == S_DEFAULT)
|
|
|
|
sortmode = S_TERMCAP;
|
|
|
|
break;
|
|
|
|
|
2011-12-18 08:13:30 +08:00
|
|
|
case 'D':
|
|
|
|
show_databases();
|
|
|
|
ExitProgram(EXIT_SUCCESS);
|
|
|
|
break;
|
|
|
|
|
2002-10-13 11:35:53 +08:00
|
|
|
case 'c':
|
|
|
|
compare = C_COMMON;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 'd':
|
|
|
|
compare = C_DIFFERENCE;
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
1999-10-24 12:32:42 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case 'E':
|
|
|
|
initdump |= 2;
|
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2002-10-13 11:35:53 +08:00
|
|
|
case 'e':
|
|
|
|
initdump |= 1;
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2002-10-13 11:35:53 +08:00
|
|
|
case 'F':
|
|
|
|
filecompare = TRUE;
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case 'f':
|
|
|
|
formatted = TRUE;
|
|
|
|
break;
|
1999-10-24 12:32:42 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case 'G':
|
|
|
|
numbers = 1;
|
|
|
|
break;
|
1999-10-24 12:32:42 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case 'g':
|
|
|
|
numbers = -1;
|
|
|
|
break;
|
1999-10-24 12:32:42 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case 'I':
|
|
|
|
outform = F_TERMINFO;
|
|
|
|
if (sortmode == S_DEFAULT)
|
|
|
|
sortmode = S_VARIABLE;
|
|
|
|
tversion = 0;
|
|
|
|
break;
|
1998-03-01 12:21:12 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case 'i':
|
|
|
|
init_analyze = TRUE;
|
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case 'L':
|
|
|
|
outform = F_VARIABLE;
|
|
|
|
if (sortmode == S_DEFAULT)
|
|
|
|
sortmode = S_VARIABLE;
|
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2002-10-13 11:35:53 +08:00
|
|
|
case 'l':
|
|
|
|
outform = F_TERMINFO;
|
|
|
|
break;
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case 'n':
|
|
|
|
compare = C_NAND;
|
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case 'p':
|
|
|
|
ignorepads = TRUE;
|
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2015-09-06 09:23:48 +08:00
|
|
|
case 'Q':
|
|
|
|
quickdump = optarg_to_number();
|
|
|
|
break;
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case 'q':
|
|
|
|
quiet = TRUE;
|
|
|
|
s_absent = "-";
|
|
|
|
s_cancel = "@";
|
|
|
|
bool_sep = ", ";
|
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2002-10-13 11:35:53 +08:00
|
|
|
case 'R':
|
|
|
|
tversion = optarg;
|
|
|
|
break;
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case 'r':
|
|
|
|
tversion = 0;
|
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
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,
|
2007-07-29 08:27:12 +08:00
|
|
|
"%s: unknown sort mode\n",
|
|
|
|
_nc_progname);
|
2006-12-18 12:32:42 +08:00
|
|
|
ExitProgram(EXIT_FAILURE);
|
2000-07-09 10:46:08 +08:00
|
|
|
}
|
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2002-10-13 11:35:53 +08:00
|
|
|
case 'T':
|
|
|
|
limited = FALSE;
|
|
|
|
break;
|
|
|
|
|
|
|
|
#if NCURSES_XNAMES
|
|
|
|
case 't':
|
|
|
|
_nc_disable_period = FALSE;
|
|
|
|
suppress_untranslatable = TRUE;
|
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
|
2005-10-10 02:41:57 +08:00
|
|
|
case 'U':
|
|
|
|
literal = TRUE;
|
|
|
|
break;
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case 'u':
|
|
|
|
compare = C_USEALL;
|
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2002-10-13 11:35:53 +08:00
|
|
|
case 'V':
|
|
|
|
puts(curses_version());
|
|
|
|
ExitProgram(EXIT_SUCCESS);
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case 'v':
|
2011-05-15 08:38:25 +08:00
|
|
|
itrace = (unsigned) optarg_to_number();
|
2022-09-04 07:59:18 +08:00
|
|
|
use_verbosity(itrace);
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2016-10-02 09:31:28 +08:00
|
|
|
case 'W':
|
|
|
|
wrap_strings = TRUE;
|
|
|
|
break;
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
case 'w':
|
2000-10-21 12:42:11 +08:00
|
|
|
mwidth = optarg_to_number();
|
2000-07-09 10:46:08 +08:00
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2005-10-10 02:41:57 +08:00
|
|
|
#if NCURSES_XNAMES
|
|
|
|
case 'x':
|
|
|
|
use_extended_names(TRUE);
|
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
default:
|
|
|
|
usage();
|
|
|
|
}
|
2006-12-18 12:32:42 +08:00
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2011-05-15 08:38:25 +08:00
|
|
|
maxterms = (size_t) (argc + 2 - optind);
|
2012-10-28 07:06:26 +08:00
|
|
|
if ((tfile = typeMalloc(path, maxterms)) == 0)
|
|
|
|
failed("tfile");
|
|
|
|
if ((tname = typeCalloc(char *, maxterms)) == 0)
|
|
|
|
failed("tname");
|
|
|
|
if ((entries = typeCalloc(ENTRY, maxterms)) == 0)
|
|
|
|
failed("entries");
|
2012-06-03 08:52:00 +08:00
|
|
|
#if NO_LEAKS
|
2012-10-28 07:06:26 +08:00
|
|
|
if ((entered = typeCalloc(ENTERED, maxterms)) == 0)
|
|
|
|
failed("entered");
|
2012-06-03 08:52:00 +08:00
|
|
|
#endif
|
2007-07-29 08:27:12 +08:00
|
|
|
|
|
|
|
if (tfile == 0
|
|
|
|
|| tname == 0
|
|
|
|
|| entries == 0) {
|
|
|
|
fprintf(stderr, "%s: not enough memory\n", _nc_progname);
|
|
|
|
ExitProgram(EXIT_FAILURE);
|
|
|
|
}
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
/* by default, sort by terminfo name */
|
|
|
|
if (sortmode == S_DEFAULT)
|
|
|
|
sortmode = S_TERMINFO;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
/* make sure we have at least one terminal name to work with */
|
|
|
|
if (optind >= argc)
|
2004-02-09 10:15:26 +08:00
|
|
|
argv[argc++] = terminal_env();
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
/* if user is after a comparison, make sure we have two entries */
|
|
|
|
if (compare != C_DEFAULT && optind >= argc - 1)
|
2004-02-09 10:15:26 +08:00
|
|
|
argv[argc++] = terminal_env();
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2012-05-27 07:58:56 +08:00
|
|
|
/* exactly one terminal name with no options means display it */
|
2000-07-09 10:46:08 +08:00
|
|
|
/* exactly two terminal names with no options means do -d */
|
2012-05-27 07:58:56 +08:00
|
|
|
if (compare == C_DEFAULT) {
|
|
|
|
switch (argc - optind) {
|
|
|
|
default:
|
|
|
|
fprintf(stderr, "%s: too many names to compare\n", _nc_progname);
|
|
|
|
ExitProgram(EXIT_FAILURE);
|
|
|
|
case 1:
|
|
|
|
break;
|
|
|
|
case 2:
|
|
|
|
compare = C_DIFFERENCE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* set up for display */
|
2016-10-02 09:31:28 +08:00
|
|
|
dump_init(tversion, outform, sortmode,
|
|
|
|
wrap_strings, mwidth, mheight, itrace,
|
2015-09-06 09:23:48 +08:00
|
|
|
formatted, FALSE, quickdump);
|
2000-07-09 10:46:08 +08:00
|
|
|
|
|
|
|
if (!filecompare) {
|
|
|
|
/* grab the entries */
|
|
|
|
termcount = 0;
|
|
|
|
for (; optind < argc; optind++) {
|
2007-07-29 08:27:12 +08:00
|
|
|
const char *directory = termcount ? restdir : firstdir;
|
|
|
|
int status;
|
2000-07-09 10:46:08 +08:00
|
|
|
|
2007-07-29 08:27:12 +08:00
|
|
|
tname[termcount] = argv[optind];
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2007-07-29 08:27:12 +08:00
|
|
|
if (directory) {
|
2013-05-26 08:59:52 +08:00
|
|
|
#if NCURSES_USE_DATABASE
|
2007-11-18 10:09:05 +08:00
|
|
|
#if MIXEDCASE_FILENAMES
|
|
|
|
#define LEAF_FMT "%c"
|
|
|
|
#else
|
|
|
|
#define LEAF_FMT "%02x"
|
|
|
|
#endif
|
2012-02-26 09:59:00 +08:00
|
|
|
_nc_SPRINTF(tfile[termcount],
|
|
|
|
_nc_SLIMIT(sizeof(path))
|
|
|
|
"%s/" LEAF_FMT "/%s",
|
|
|
|
directory,
|
|
|
|
UChar(*argv[optind]), argv[optind]);
|
2007-07-29 08:27:12 +08:00
|
|
|
if (itrace)
|
|
|
|
(void) fprintf(stderr,
|
|
|
|
"%s: reading entry %s from file %s\n",
|
|
|
|
_nc_progname,
|
|
|
|
argv[optind], tfile[termcount]);
|
2000-07-09 10:46:08 +08:00
|
|
|
|
2007-07-29 08:27:12 +08:00
|
|
|
status = _nc_read_file_entry(tfile[termcount],
|
|
|
|
&entries[termcount].tterm);
|
2006-12-18 12:32:42 +08:00
|
|
|
#else
|
2007-07-29 08:27:12 +08:00
|
|
|
(void) fprintf(stderr, "%s: terminfo files not supported\n",
|
|
|
|
_nc_progname);
|
2009-12-06 09:32:45 +08:00
|
|
|
MAIN_LEAKS();
|
2007-07-29 08:27:12 +08:00
|
|
|
ExitProgram(EXIT_FAILURE);
|
2006-12-18 12:32:42 +08:00
|
|
|
#endif
|
2007-07-29 08:27:12 +08:00
|
|
|
} else {
|
|
|
|
if (itrace)
|
2000-07-09 10:46:08 +08:00
|
|
|
(void) fprintf(stderr,
|
2007-07-29 08:27:12 +08:00
|
|
|
"%s: reading entry %s from database\n",
|
|
|
|
_nc_progname,
|
|
|
|
tname[termcount]);
|
|
|
|
|
2017-04-16 09:08:25 +08:00
|
|
|
status = _nc_read_entry2(tname[termcount],
|
2020-07-12 08:25:08 +08:00
|
|
|
tfile[termcount],
|
|
|
|
&entries[termcount].tterm);
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
2007-07-29 08:27:12 +08:00
|
|
|
|
|
|
|
if (status <= 0) {
|
|
|
|
(void) fprintf(stderr,
|
|
|
|
"%s: couldn't open terminfo file %s.\n",
|
|
|
|
_nc_progname,
|
|
|
|
tfile[termcount]);
|
2009-12-06 09:32:45 +08:00
|
|
|
MAIN_LEAKS();
|
2007-07-29 08:27:12 +08:00
|
|
|
ExitProgram(EXIT_FAILURE);
|
|
|
|
}
|
|
|
|
repair_acsc(&entries[termcount].tterm);
|
|
|
|
termcount++;
|
2000-07-09 10:46:08 +08:00
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
|
1999-10-24 12:32:42 +08:00
|
|
|
#if NCURSES_XNAMES
|
2000-07-09 10:46:08 +08:00
|
|
|
if (termcount > 1)
|
|
|
|
_nc_align_termtype(&entries[0].tterm, &entries[1].tterm);
|
1999-10-24 12:32:42 +08:00
|
|
|
#endif
|
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
/* 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);
|
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-07-09 10:46:08 +08:00
|
|
|
/* analyze the init strings */
|
2006-12-18 12:32:42 +08:00
|
|
|
else if (init_analyze) {
|
1997-05-15 12:00:00 +08:00
|
|
|
#undef CUR
|
2000-07-09 10:46:08 +08:00
|
|
|
#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);
|
2015-05-24 08:58:47 +08:00
|
|
|
analyze_string("smkx", keypad_xmit, &entries[0].tterm);
|
|
|
|
analyze_string("rmkx", keypad_local, &entries[0].tterm);
|
1997-05-15 12:00:00 +08:00
|
|
|
#undef CUR
|
2006-12-18 12:32:42 +08:00
|
|
|
} else {
|
2021-04-18 09:15:31 +08:00
|
|
|
int i;
|
|
|
|
int len;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2006-12-18 12:32:42 +08:00
|
|
|
/*
|
|
|
|
* Here's where the real work gets done
|
|
|
|
*/
|
|
|
|
switch (compare) {
|
|
|
|
case C_DEFAULT:
|
|
|
|
if (itrace)
|
|
|
|
(void) fprintf(stderr,
|
2007-07-29 08:27:12 +08:00
|
|
|
"%s: about to dump %s\n",
|
|
|
|
_nc_progname,
|
2006-12-18 12:32:42 +08:00
|
|
|
tname[0]);
|
2015-09-06 09:23:48 +08:00
|
|
|
if (!quiet)
|
|
|
|
(void)
|
2016-09-11 09:24:00 +08:00
|
|
|
printf("#\tReconstructed via infocmp from file: %s\n",
|
|
|
|
tfile[0]);
|
2006-12-18 12:32:42 +08:00
|
|
|
dump_entry(&entries[0].tterm,
|
|
|
|
suppress_untranslatable,
|
|
|
|
limited,
|
|
|
|
numbers,
|
|
|
|
NULL);
|
|
|
|
len = show_entry();
|
|
|
|
if (itrace)
|
2007-07-29 08:27:12 +08:00
|
|
|
(void) fprintf(stderr, "%s: length %d\n", _nc_progname, len);
|
2006-12-18 12:32:42 +08:00
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2006-12-18 12:32:42 +08:00
|
|
|
case C_DIFFERENCE:
|
2012-05-27 07:58:56 +08:00
|
|
|
show_comparing(tname);
|
2006-12-18 12:32:42 +08:00
|
|
|
compare_entry(compare_predicate, &entries->tterm, quiet);
|
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2006-12-18 12:32:42 +08:00
|
|
|
case C_COMMON:
|
2012-05-27 07:58:56 +08:00
|
|
|
show_comparing(tname);
|
2006-12-18 12:32:42 +08:00
|
|
|
compare_entry(compare_predicate, &entries->tterm, quiet);
|
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2006-12-18 12:32:42 +08:00
|
|
|
case C_NAND:
|
2012-05-27 07:58:56 +08:00
|
|
|
show_comparing(tname);
|
2006-12-18 12:32:42 +08:00
|
|
|
compare_entry(compare_predicate, &entries->tterm, quiet);
|
|
|
|
break;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2006-12-18 12:32:42 +08:00
|
|
|
case C_USEALL:
|
|
|
|
if (itrace)
|
2007-07-29 08:27:12 +08:00
|
|
|
(void) fprintf(stderr, "%s: dumping use entry\n", _nc_progname);
|
2006-12-18 12:32:42 +08:00
|
|
|
dump_entry(&entries[0].tterm,
|
|
|
|
suppress_untranslatable,
|
|
|
|
limited,
|
|
|
|
numbers,
|
|
|
|
use_predicate);
|
|
|
|
for (i = 1; i < termcount; i++)
|
|
|
|
dump_uses(tname[i], !(outform == F_TERMCAP
|
|
|
|
|| outform == F_TCONVERR));
|
|
|
|
len = show_entry();
|
|
|
|
if (itrace)
|
2007-07-29 08:27:12 +08:00
|
|
|
(void) fprintf(stderr, "%s: length %d\n", _nc_progname, len);
|
2006-12-18 12:32:42 +08:00
|
|
|
break;
|
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
2012-05-27 07:58:56 +08:00
|
|
|
} else if (compare == C_USEALL) {
|
2000-07-09 10:46:08 +08:00
|
|
|
(void) fprintf(stderr, "Sorry, -u doesn't work with -F\n");
|
2012-05-27 07:58:56 +08:00
|
|
|
} else if (compare == C_DEFAULT) {
|
2000-07-09 10:46:08 +08:00
|
|
|
(void) fprintf(stderr, "Use `tic -[CI] <file>' for this.\n");
|
2012-05-27 07:58:56 +08:00
|
|
|
} else if (argc - optind != 2) {
|
2000-07-09 10:46:08 +08:00
|
|
|
(void) fprintf(stderr,
|
2000-10-21 12:42:11 +08:00
|
|
|
"File comparison needs exactly two file arguments.\n");
|
2012-05-27 07:58:56 +08:00
|
|
|
} else {
|
2000-07-09 10:46:08 +08:00
|
|
|
file_comparison(argc - optind, argv + optind);
|
2012-05-27 07:58:56 +08:00
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2009-12-06 09:32:45 +08:00
|
|
|
MAIN_LEAKS();
|
2000-07-09 10:46:08 +08:00
|
|
|
ExitProgram(EXIT_SUCCESS);
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* infocmp.c ends here */
|