infocmp.c revision 1.18 
1/*	$OpenBSD: infocmp.c,v 1.18 2006/12/06 04:59:58 ray Exp $	*/
2
3/****************************************************************************
4 * Copyright (c) 1998,1999,2000 Free Software Foundation, Inc.              *
5 *                                                                          *
6 * Permission is hereby granted, free of charge, to any person obtaining a  *
7 * copy of this software and associated documentation files (the            *
8 * "Software"), to deal in the Software without restriction, including      *
9 * without limitation the rights to use, copy, modify, merge, publish,      *
10 * distribute, distribute with modifications, sublicense, and/or sell       *
11 * copies of the Software, and to permit persons to whom the Software is    *
12 * furnished to do so, subject to the following conditions:                 *
13 *                                                                          *
14 * The above copyright notice and this permission notice shall be included  *
15 * in all copies or substantial portions of the Software.                   *
16 *                                                                          *
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS  *
18 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF               *
19 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.   *
20 * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,   *
21 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR    *
22 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR    *
23 * THE USE OR OTHER DEALINGS IN THE SOFTWARE.                               *
24 *                                                                          *
25 * Except as contained in this notice, the name(s) of the above copyright   *
26 * holders shall not be used in advertising or otherwise to promote the     *
27 * sale, use or other dealings in this Software without prior written       *
28 * authorization.                                                           *
29 ****************************************************************************/
30
31/****************************************************************************
32 *  Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995               *
33 *     and: Eric S. Raymond <esr@snark.thyrsus.com>                         *
34 ****************************************************************************/
35
36/*
37 *	infocmp.c -- decompile an entry, or compare two entries
38 *		written by Eric S. Raymond
39 */
40
41#include <progs.priv.h>
42
43#include <term_entry.h>
44#include <dump_entry.h>
45
46MODULE_ID("$From: infocmp.c,v 1.60 2001/02/24 22:03:12 tom Exp $")
47
48#define L_CURL "{"
49#define R_CURL "}"
50
51#define MAXTERMS	32	/* max # terminal arguments we can handle */
52#define MAX_STRING	1024	/* maximum formatted string */
53
54const char *_nc_progname = "infocmp";
55
56typedef char path[PATH_MAX];
57
58/***************************************************************************
59 *
60 * The following control variables, together with the contents of the
61 * terminfo entries, completely determine the actions of the program.
62 *
63 ***************************************************************************/
64
65static char *tname[MAXTERMS];	/* terminal type names */
66static ENTRY entries[MAXTERMS];	/* terminfo entries */
67static int termcount;		/* count of terminal entries */
68
69static bool limited = TRUE;	/* "-r" option is not set */
70static bool quiet = FALSE;
71static const char *bool_sep = ":";
72static const char *s_absent = "NULL";
73static const char *s_cancel = "NULL";
74static const char *tversion;	/* terminfo version selected */
75static int itrace;		/* trace flag for debugging */
76static int mwidth = 60;
77static int numbers = 0;		/* format "%'char'" to/from "%{number}" */
78static int outform = F_TERMINFO;	/* output format */
79static int sortmode;		/* sort_mode */
80
81/* main comparison mode */
82static int compare;
83#define C_DEFAULT	0	/* don't force comparison mode */
84#define C_DIFFERENCE	1	/* list differences between two terminals */
85#define C_COMMON	2	/* list common capabilities */
86#define C_NAND		3	/* list capabilities in neither terminal */
87#define C_USEALL	4	/* generate relative use-form entry */
88static bool ignorepads;		/* ignore pad prefixes when diffing */
89
90#if NO_LEAKS
91#undef ExitProgram
92static void
93ExitProgram(int code) GCC_NORETURN;
94/* prototype is to get gcc to accept the noreturn attribute */
95     static void
96       ExitProgram(int code)
97{
98    while (termcount-- > 0)
99	_nc_free_termtype(&entries[termcount].tterm);
100    _nc_leaks_dump_entry();
101    _nc_free_and_exit(code);
102}
103#endif
104
105static char *
106canonical_name(char *ptr, char *buf, size_t bufl)
107/* extract the terminal type's primary name */
108{
109    char *bp;
110
111    (void) strlcpy(buf, ptr, bufl);
112    if ((bp = strchr(buf, '|')) != 0)
113	*bp = '\0';
114
115    return (buf);
116}
117
118/***************************************************************************
119 *
120 * Predicates for dump function
121 *
122 ***************************************************************************/
123
124static int
125capcmp(int idx, const char *s, const char *t)
126/* capability comparison function */
127{
128    if (!VALID_STRING(s) && !VALID_STRING(t))
129	return (s != t);
130    else if (!VALID_STRING(s) || !VALID_STRING(t))
131	return (1);
132
133    if ((idx == acs_chars_index) || !ignorepads)
134	return (strcmp(s, t));
135    else
136	return (_nc_capcmp(s, t));
137}
138
139static int
140use_predicate(int type, int idx)
141/* predicate function to use for use decompilation */
142{
143    ENTRY *ep;
144
145    switch (type) {
146    case BOOLEAN:
147	{
148	    int is_set = FALSE;
149
150	    /*
151	     * This assumes that multiple use entries are supposed
152	     * to contribute the logical or of their boolean capabilities.
153	     * This is true if we take the semantics of multiple uses to
154	     * be 'each capability gets the first non-default value found
155	     * in the sequence of use entries'.
156	     *
157	     * Note that cancelled or absent booleans are stored as FALSE,
158	     * unlike numbers and strings, whose cancelled/absent state is
159	     * recorded in the terminfo database.
160	     */
161	    for (ep = &entries[1]; ep < entries + termcount; ep++)
162		if (ep->tterm.Booleans[idx] == TRUE) {
163		    is_set = entries[0].tterm.Booleans[idx];
164		    break;
165		}
166	    if (is_set != entries[0].tterm.Booleans[idx])
167		return (!is_set);
168	    else
169		return (FAIL);
170	}
171
172    case NUMBER:
173	{
174	    int value = ABSENT_NUMERIC;
175
176	    /*
177	     * We take the semantics of multiple uses to be 'each
178	     * capability gets the first non-default value found
179	     * in the sequence of use entries'.
180	     */
181	    for (ep = &entries[1]; ep < entries + termcount; ep++)
182		if (VALID_NUMERIC(ep->tterm.Numbers[idx])) {
183		    value = ep->tterm.Numbers[idx];
184		    break;
185		}
186
187	    if (value != entries[0].tterm.Numbers[idx])
188		return (value != ABSENT_NUMERIC);
189	    else
190		return (FAIL);
191	}
192
193    case STRING:
194	{
195	    char *termstr, *usestr = ABSENT_STRING;
196
197	    termstr = entries[0].tterm.Strings[idx];
198
199	    /*
200	     * We take the semantics of multiple uses to be 'each
201	     * capability gets the first non-default value found
202	     * in the sequence of use entries'.
203	     */
204	    for (ep = &entries[1]; ep < entries + termcount; ep++)
205		if (ep->tterm.Strings[idx]) {
206		    usestr = ep->tterm.Strings[idx];
207		    break;
208		}
209
210	    if (usestr == ABSENT_STRING && termstr == ABSENT_STRING)
211		return (FAIL);
212	    else if (!usestr || !termstr || capcmp(idx, usestr, termstr))
213		return (TRUE);
214	    else
215		return (FAIL);
216	}
217    }
218
219    return (FALSE);		/* pacify compiler */
220}
221
222static bool
223useeq(ENTRY * e1, ENTRY * e2)
224/* are the use references in two entries equivalent? */
225{
226    int i, j;
227
228    if (e1->nuses != e2->nuses)
229	return (FALSE);
230
231    /* Ugh...this is quadratic again */
232    for (i = 0; i < e1->nuses; i++) {
233	bool foundmatch = FALSE;
234
235	/* search second entry for given use reference */
236	for (j = 0; j < e2->nuses; j++)
237	    if (!strcmp(e1->uses[i].name, e2->uses[j].name)) {
238		foundmatch = TRUE;
239		break;
240	    }
241
242	if (!foundmatch)
243	    return (FALSE);
244    }
245
246    return (TRUE);
247}
248
249static bool
250entryeq(TERMTYPE * t1, TERMTYPE * t2)
251/* are two entries equivalent? */
252{
253    int i;
254
255    for (i = 0; i < NUM_BOOLEANS(t1); i++)
256	if (t1->Booleans[i] != t2->Booleans[i])
257	    return (FALSE);
258
259    for (i = 0; i < NUM_NUMBERS(t1); i++)
260	if (t1->Numbers[i] != t2->Numbers[i])
261	    return (FALSE);
262
263    for (i = 0; i < NUM_STRINGS(t1); i++)
264	if (capcmp(i, t1->Strings[i], t2->Strings[i]))
265	    return (FALSE);
266
267    return (TRUE);
268}
269
270#define TIC_EXPAND(result) _nc_tic_expand(result, outform==F_TERMINFO, numbers)
271
272static void
273print_uses(ENTRY * ep, FILE * fp)
274/* print an entry's use references */
275{
276    int i;
277
278    if (!ep->nuses)
279	fputs("NULL", fp);
280    else
281	for (i = 0; i < ep->nuses; i++) {
282	    fputs(ep->uses[i].name, fp);
283	    if (i < ep->nuses - 1)
284		fputs(" ", fp);
285	}
286}
287
288static const char *
289dump_boolean(int val)
290/* display the value of a boolean capability */
291{
292    switch (val) {
293    case ABSENT_BOOLEAN:
294	return (s_absent);
295    case CANCELLED_BOOLEAN:
296	return (s_cancel);
297    case FALSE:
298	return ("F");
299    case TRUE:
300	return ("T");
301    default:
302	return ("?");
303    }
304}
305
306static void
307dump_numeric(int val, char *buf, size_t bufl)
308/* display the value of a boolean capability */
309{
310    switch (val) {
311    case ABSENT_NUMERIC:
312	strlcpy(buf, s_absent, bufl);
313	break;
314    case CANCELLED_NUMERIC:
315	strlcpy(buf, s_cancel, bufl);
316	break;
317    default:
318	snprintf(buf, bufl, "%d", val);
319	break;
320    }
321}
322
323static void
324dump_string(char *val, char *buf, size_t bufl)
325/* display the value of a string capability */
326{
327    if (val == ABSENT_STRING)
328	strlcpy(buf, s_absent, bufl);
329    else if (val == CANCELLED_STRING)
330	strlcpy(buf, s_cancel, bufl);
331    else {
332	snprintf(buf, bufl, "'%.*s'", MAX_STRING - 3, TIC_EXPAND(val));
333    }
334}
335
336static void
337compare_predicate(int type, int idx, const char *name)
338/* predicate function to use for entry difference reports */
339{
340    ENTRY *e1 = &entries[0];
341    ENTRY *e2 = &entries[1];
342    char buf1[MAX_STRING], buf2[MAX_STRING];
343    int b1, b2;
344    int n1, n2;
345    char *s1, *s2;
346
347    switch (type) {
348    case CMP_BOOLEAN:
349	b1 = e1->tterm.Booleans[idx];
350	b2 = e2->tterm.Booleans[idx];
351	switch (compare) {
352	case C_DIFFERENCE:
353	    if (!(b1 == ABSENT_BOOLEAN && b2 == ABSENT_BOOLEAN) && b1 != b2)
354		(void) printf("\t%s: %s%s%s.\n",
355			      name,
356			      dump_boolean(b1),
357			      bool_sep,
358			      dump_boolean(b2));
359	    break;
360
361	case C_COMMON:
362	    if (b1 == b2 && b1 != ABSENT_BOOLEAN)
363		(void) printf("\t%s= %s.\n", name, dump_boolean(b1));
364	    break;
365
366	case C_NAND:
367	    if (b1 == ABSENT_BOOLEAN && b2 == ABSENT_BOOLEAN)
368		(void) printf("\t!%s.\n", name);
369	    break;
370	}
371	break;
372
373    case CMP_NUMBER:
374	n1 = e1->tterm.Numbers[idx];
375	n2 = e2->tterm.Numbers[idx];
376	dump_numeric(n1, buf1, sizeof buf1);
377	dump_numeric(n2, buf2, sizeof buf2);
378	switch (compare) {
379	case C_DIFFERENCE:
380	    if (!((n1 == ABSENT_NUMERIC && n2 == ABSENT_NUMERIC)) && n1 != n2)
381		(void) printf("\t%s: %s, %s.\n", name, buf1, buf2);
382	    break;
383
384	case C_COMMON:
385	    if (n1 != ABSENT_NUMERIC && n2 != ABSENT_NUMERIC && n1 == n2)
386		(void) printf("\t%s= %s.\n", name, buf1);
387	    break;
388
389	case C_NAND:
390	    if (n1 == ABSENT_NUMERIC && n2 == ABSENT_NUMERIC)
391		(void) printf("\t!%s.\n", name);
392	    break;
393	}
394	break;
395
396    case CMP_STRING:
397	s1 = e1->tterm.Strings[idx];
398	s2 = e2->tterm.Strings[idx];
399	switch (compare) {
400	case C_DIFFERENCE:
401	    if (capcmp(idx, s1, s2)) {
402		dump_string(s1, buf1, sizeof buf1);
403		dump_string(s2, buf2, sizeof buf2);
404		if (strcmp(buf1, buf2))
405		    (void) printf("\t%s: %s, %s.\n", name, buf1, buf2);
406	    }
407	    break;
408
409	case C_COMMON:
410	    if (s1 && s2 && !capcmp(idx, s1, s2))
411		(void) printf("\t%s= '%s'.\n", name, TIC_EXPAND(s1));
412	    break;
413
414	case C_NAND:
415	    if (!s1 && !s2)
416		(void) printf("\t!%s.\n", name);
417	    break;
418	}
419	break;
420
421    case CMP_USE:
422	/* unlike the other modes, this compares *all* use entries */
423	switch (compare) {
424	case C_DIFFERENCE:
425	    if (!useeq(e1, e2)) {
426		(void) fputs("\tuse: ", stdout);
427		print_uses(e1, stdout);
428		fputs(", ", stdout);
429		print_uses(e2, stdout);
430		fputs(".\n", stdout);
431	    }
432	    break;
433
434	case C_COMMON:
435	    if (e1->nuses && e2->nuses && useeq(e1, e2)) {
436		(void) fputs("\tuse: ", stdout);
437		print_uses(e1, stdout);
438		fputs(".\n", stdout);
439	    }
440	    break;
441
442	case C_NAND:
443	    if (!e1->nuses && !e2->nuses)
444		(void) printf("\t!use.\n");
445	    break;
446	}
447    }
448}
449
450/***************************************************************************
451 *
452 * Init string analysis
453 *
454 ***************************************************************************/
455
456typedef struct {
457    const char *from;
458    const char *to;
459} assoc;
460
461static const assoc std_caps[] =
462{
463    /* these are specified by X.364 and iBCS2 */
464    {"\033c", "RIS"},		/* full reset */
465    {"\0337", "SC"},		/* save cursor */
466    {"\0338", "RC"},		/* restore cursor */
467    {"\033[r", "RSR"},		/* not an X.364 mnemonic */
468    {"\033[m", "SGR0"},		/* not an X.364 mnemonic */
469    {"\033[2J", "ED2"},		/* clear page */
470
471    /* this group is specified by ISO 2022 */
472    {"\033(0", "ISO DEC G0"},	/* enable DEC graphics for G0 */
473    {"\033(A", "ISO UK G0"},	/* enable UK chars for G0 */
474    {"\033(B", "ISO US G0"},	/* enable US chars for G0 */
475    {"\033)0", "ISO DEC G1"},	/* enable DEC graphics for G1 */
476    {"\033)A", "ISO UK G1"},	/* enable UK chars for G1 */
477    {"\033)B", "ISO US G1"},	/* enable US chars for G1 */
478
479    /* these are DEC private modes widely supported by emulators */
480    {"\033=", "DECPAM"},	/* application keypad mode */
481    {"\033>", "DECPNM"},	/* normal keypad mode */
482    {"\033<", "DECANSI"},	/* enter ANSI mode */
483
484    {(char *) 0, (char *) 0}
485};
486
487static const assoc private_modes[] =
488/* DEC \E[ ... [hl] modes recognized by many emulators */
489{
490    {"1", "CKM"},		/* application cursor keys */
491    {"2", "ANM"},		/* set VT52 mode */
492    {"3", "COLM"},		/* 132-column mode */
493    {"4", "SCLM"},		/* smooth scroll */
494    {"5", "SCNM"},		/* reverse video mode */
495    {"6", "OM"},		/* origin mode */
496    {"7", "AWM"},		/* wraparound mode */
497    {"8", "ARM"},		/* auto-repeat mode */
498    {(char *) 0, (char *) 0}
499};
500
501static const assoc ecma_highlights[] =
502/* recognize ECMA attribute sequences */
503{
504    {"0", "NORMAL"},		/* normal */
505    {"1", "+BOLD"},		/* bold on */
506    {"2", "+DIM"},		/* dim on */
507    {"3", "+ITALIC"},		/* italic on */
508    {"4", "+UNDERLINE"},	/* underline on */
509    {"5", "+BLINK"},		/* blink on */
510    {"6", "+FASTBLINK"},	/* fastblink on */
511    {"7", "+REVERSE"},		/* reverse on */
512    {"8", "+INVISIBLE"},	/* invisible on */
513    {"9", "+DELETED"},		/* deleted on */
514    {"10", "MAIN-FONT"},	/* select primary font */
515    {"11", "ALT-FONT-1"},	/* select alternate font 1 */
516    {"12", "ALT-FONT-2"},	/* select alternate font 2 */
517    {"13", "ALT-FONT-3"},	/* select alternate font 3 */
518    {"14", "ALT-FONT-4"},	/* select alternate font 4 */
519    {"15", "ALT-FONT-5"},	/* select alternate font 5 */
520    {"16", "ALT-FONT-6"},	/* select alternate font 6 */
521    {"17", "ALT-FONT-7"},	/* select alternate font 7 */
522    {"18", "ALT-FONT-1"},	/* select alternate font 1 */
523    {"19", "ALT-FONT-1"},	/* select alternate font 1 */
524    {"20", "FRAKTUR"},		/* Fraktur font */
525    {"21", "DOUBLEUNDER"},	/* double underline */
526    {"22", "-DIM"},		/* dim off */
527    {"23", "-ITALIC"},		/* italic off */
528    {"24", "-UNDERLINE"},	/* underline off */
529    {"25", "-BLINK"},		/* blink off */
530    {"26", "-FASTBLINK"},	/* fastblink off */
531    {"27", "-REVERSE"},		/* reverse off */
532    {"28", "-INVISIBLE"},	/* invisible off */
533    {"29", "-DELETED"},		/* deleted off */
534    {(char *) 0, (char *) 0}
535};
536
537static void
538analyze_string(const char *name, const char *cap, TERMTYPE * tp)
539{
540    char buf[MAX_TERMINFO_LENGTH];
541    char buf2[MAX_TERMINFO_LENGTH];
542    const char *sp, *ep;
543    const assoc *ap;
544
545    if (cap == ABSENT_STRING || cap == CANCELLED_STRING)
546	return;
547    (void) printf("%s: ", name);
548
549    buf[0] = '\0';
550    for (sp = cap; *sp; sp++) {
551	int i;
552	size_t len = 0;
553	const char *expansion = 0;
554
555	/* first, check other capabilities in this entry */
556	for (i = 0; i < STRCOUNT; i++) {
557	    char *cp = tp->Strings[i];
558
559	    /* don't use soft-key capabilities */
560	    if (strnames[i][0] == 'k' && strnames[i][0] == 'f')
561		continue;
562
563	    if (cp != ABSENT_STRING && cp != CANCELLED_STRING && cp[0] && cp
564		!= cap) {
565		len = strlen(cp);
566		(void) strncpy(buf2, sp, len);
567		buf2[len] = '\0';
568
569		if (_nc_capcmp(cp, buf2))
570		    continue;
571
572#define ISRS(s)	(!strncmp((s), "is", 2) || !strncmp((s), "rs", 2))
573		/*
574		 * Theoretically we just passed the test for translation
575		 * (equality once the padding is stripped).  However, there
576		 * are a few more hoops that need to be jumped so that
577		 * identical pairs of initialization and reset strings
578		 * don't just refer to each other.
579		 */
580		if (ISRS(name) || ISRS(strnames[i]))
581		    if (cap < cp)
582			continue;
583#undef ISRS
584
585		expansion = strnames[i];
586		break;
587	    }
588	}
589
590	/* now check the standard capabilities */
591	if (!expansion)
592	    for (ap = std_caps; ap->from; ap++) {
593		len = strlen(ap->from);
594
595		if (strncmp(ap->from, sp, len) == 0) {
596		    expansion = ap->to;
597		    break;
598		}
599	    }
600
601	/* now check for private-mode sequences */
602	if (!expansion
603	    && sp[0] == '\033' && sp[1] == '[' && sp[2] == '?'
604	    && (len = strspn(sp + 3, "0123456789;"))
605	    && ((sp[3 + len] == 'h') || (sp[3 + len] == 'l'))) {
606	    char buf3[MAX_TERMINFO_LENGTH];
607
608	    (void) strlcpy(buf2, (sp[3 + len] == 'h') ? "DEC+" : "DEC-",
609		sizeof buf2);
610	    (void) strncpy(buf3, sp + 3, len);
611	    len += 4;
612	    buf3[len] = '\0';
613
614	    ep = strtok(buf3, ";");
615	    do {
616		bool found = FALSE;
617
618		for (ap = private_modes; ap->from; ap++) {
619		    size_t tlen = strlen(ap->from);
620
621		    if (strncmp(ap->from, ep, tlen) == 0) {
622			(void) strlcat(buf2, ap->to, sizeof buf2);
623			found = TRUE;
624			break;
625		    }
626		}
627
628		if (!found)
629		    (void) strlcat(buf2, ep, sizeof buf2);
630		(void) strlcat(buf2, ";", sizeof buf2);
631	    } while
632		((ep = strtok((char *) 0, ";")));
633	    if (buf2[0] != '\0' && buf2[strlen(buf2) - 1] == ';')
634		    buf2[strlen(buf2) - 1] = '\0';
635	    expansion = buf2;
636	}
637
638	/* now check for ECMA highlight sequences */
639	if (!expansion
640	    && sp[0] == '\033' && sp[1] == '['
641	    && (len = strspn(sp + 2, "0123456789;"))
642	    && sp[2 + len] == 'm') {
643	    char buf3[MAX_TERMINFO_LENGTH];
644
645	    (void) strlcpy(buf2, "SGR:", sizeof buf2);
646	    (void) strncpy(buf3, sp + 2, len);
647	    len += 3;
648	    buf3[len] = '\0';
649
650	    ep = strtok(buf3, ";");
651	    do {
652		bool found = FALSE;
653
654		for (ap = ecma_highlights; ap->from; ap++) {
655		    size_t tlen = strlen(ap->from);
656
657		    if (strncmp(ap->from, ep, tlen) == 0) {
658			(void) strlcat(buf2, ap->to, sizeof buf2);
659			found = TRUE;
660			break;
661		    }
662		}
663
664		if (!found)
665		    (void) strlcat(buf2, ep, sizeof buf2);
666		(void) strlcat(buf2, ";", sizeof buf2);
667	    } while
668		((ep = strtok((char *) 0, ";")));
669
670	    if (buf2[0] != '\0' && buf2[strlen(buf2) - 1] == ';')
671		    buf2[strlen(buf2) - 1] = '\0';
672	    expansion = buf2;
673	}
674	/* now check for scroll region reset */
675	if (!expansion) {
676	    (void) snprintf(buf2, sizeof buf2, "\033[1;%dr", tp->Numbers[2]);
677	    len = strlen(buf2);
678	    if (strncmp(buf2, sp, len) == 0)
679		expansion = "RSR";
680	}
681
682	/* now check for home-down */
683	if (!expansion) {
684	    (void) snprintf(buf2, sizeof buf2, "\033[%d;1H", tp->Numbers[2]);
685	    len = strlen(buf2);
686	    if (strncmp(buf2, sp, len) == 0)
687		expansion = "LL";
688	}
689
690	/* now look at the expansion we got, if any */
691	if (expansion) {
692	    (void) snprintf(buf + strlen(buf), sizeof buf - strlen(buf),
693		"{%s}", expansion);
694	    sp += len - 1;
695	    continue;
696	} else {
697	    /* couldn't match anything */
698	    buf2[0] = *sp;
699	    buf2[1] = '\0';
700	    (void) strlcat(buf, TIC_EXPAND(buf2), sizeof buf);
701	}
702    }
703    (void) printf("%s\n", buf);
704}
705
706/***************************************************************************
707 *
708 * File comparison
709 *
710 ***************************************************************************/
711
712static void
713file_comparison(int argc, char *argv[])
714{
715#define MAXCOMPARE	2
716    /* someday we may allow comparisons on more files */
717    int filecount = 0;
718    ENTRY *heads[MAXCOMPARE];
719    ENTRY *qp, *rp;
720    int i, n;
721
722    dump_init((char *) 0, F_LITERAL, S_TERMINFO, 0, itrace, FALSE);
723
724    for (n = 0; n < argc && n < MAXCOMPARE; n++) {
725	if (freopen(argv[n], "r", stdin) == 0)
726	    _nc_err_abort("Can't open %s", argv[n]);
727
728	_nc_head = _nc_tail = 0;
729
730	/* parse entries out of the source file */
731	_nc_set_source(argv[n]);
732	_nc_read_entry_source(stdin, NULL, TRUE, FALSE, NULLHOOK);
733
734	if (itrace)
735	    (void) fprintf(stderr, "Resolving file %d...\n", n - 0);
736
737	/* maybe do use resolution */
738	if (!_nc_resolve_uses(!limited)) {
739	    (void) fprintf(stderr,
740			   "There are unresolved use entries in %s:\n",
741			   argv[n]);
742	    for_entry_list(qp) {
743		if (qp->nuses) {
744		    (void) fputs(qp->tterm.term_names, stderr);
745		    (void) fputc('\n', stderr);
746		}
747	    }
748	    exit(EXIT_FAILURE);
749	}
750
751	heads[filecount] = _nc_head;
752	filecount++;
753    }
754
755    /* OK, all entries are in core.  Ready to do the comparison */
756    if (itrace)
757	(void) fprintf(stderr, "Entries are now in core...\n");
758
759    /* The entry-matching loop. Sigh, this is intrinsically quadratic. */
760    for (qp = heads[0]; qp; qp = qp->next) {
761	for (rp = heads[1]; rp; rp = rp->next)
762	    if (_nc_entry_match(qp->tterm.term_names, rp->tterm.term_names)) {
763		if (qp->ncrosslinks < MAX_CROSSLINKS)
764		    qp->crosslinks[qp->ncrosslinks] = rp;
765		qp->ncrosslinks++;
766
767		if (rp->ncrosslinks < MAX_CROSSLINKS)
768		    rp->crosslinks[rp->ncrosslinks] = qp;
769		rp->ncrosslinks++;
770	    }
771    }
772
773    /* now we have two circular lists with crosslinks */
774    if (itrace)
775	(void) fprintf(stderr, "Name matches are done...\n");
776
777    for (qp = heads[0]; qp; qp = qp->next) {
778	if (qp->ncrosslinks > 1) {
779	    (void) fprintf(stderr,
780			   "%s in file 1 (%s) has %d matches in file 2 (%s):\n",
781			   _nc_first_name(qp->tterm.term_names),
782			   argv[0],
783			   qp->ncrosslinks,
784			   argv[1]);
785	    for (i = 0; i < qp->ncrosslinks; i++)
786		(void) fprintf(stderr,
787			       "\t%s\n",
788			       _nc_first_name((qp->crosslinks[i])->tterm.term_names));
789	}
790    }
791
792    for (rp = heads[1]; rp; rp = rp->next) {
793	if (rp->ncrosslinks > 1) {
794	    (void) fprintf(stderr,
795			   "%s in file 2 (%s) has %d matches in file 1 (%s):\n",
796			   _nc_first_name(rp->tterm.term_names),
797			   argv[1],
798			   rp->ncrosslinks,
799			   argv[0]);
800	    for (i = 0; i < rp->ncrosslinks; i++)
801		(void) fprintf(stderr,
802			       "\t%s\n",
803			       _nc_first_name((rp->crosslinks[i])->tterm.term_names));
804	}
805    }
806
807    (void) printf("In file 1 (%s) only:\n", argv[0]);
808    for (qp = heads[0]; qp; qp = qp->next)
809	if (qp->ncrosslinks == 0)
810	    (void) printf("\t%s\n",
811			  _nc_first_name(qp->tterm.term_names));
812
813    (void) printf("In file 2 (%s) only:\n", argv[1]);
814    for (rp = heads[1]; rp; rp = rp->next)
815	if (rp->ncrosslinks == 0)
816	    (void) printf("\t%s\n",
817			  _nc_first_name(rp->tterm.term_names));
818
819    (void) printf("The following entries are equivalent:\n");
820    for (qp = heads[0]; qp; qp = qp->next) {
821	rp = qp->crosslinks[0];
822
823	if (qp->ncrosslinks == 1) {
824	    rp = qp->crosslinks[0];
825
826	    repair_acsc(&qp->tterm);
827	    repair_acsc(&rp->tterm);
828#if NCURSES_XNAMES
829	    _nc_align_termtype(&qp->tterm, &rp->tterm);
830#endif
831	    if (entryeq(&qp->tterm, &rp->tterm) && useeq(qp, rp)) {
832		char name1[NAMESIZE], name2[NAMESIZE];
833
834		(void) canonical_name(qp->tterm.term_names, name1, sizeof name1);
835		(void) canonical_name(rp->tterm.term_names, name2, sizeof name2);
836
837		(void) printf("%s = %s\n", name1, name2);
838	    }
839	}
840    }
841
842    (void) printf("Differing entries:\n");
843    termcount = 2;
844    for (qp = heads[0]; qp; qp = qp->next) {
845
846	if (qp->ncrosslinks == 1) {
847	    rp = qp->crosslinks[0];
848#if NCURSES_XNAMES
849	    /* sorry - we have to do this on each pass */
850	    _nc_align_termtype(&qp->tterm, &rp->tterm);
851#endif
852	    if (!(entryeq(&qp->tterm, &rp->tterm) && useeq(qp, rp))) {
853		char name1[NAMESIZE], name2[NAMESIZE];
854
855		entries[0] = *qp;
856		entries[1] = *rp;
857
858		(void) canonical_name(qp->tterm.term_names, name1, sizeof name1);
859		(void) canonical_name(rp->tterm.term_names, name2, sizeof name2);
860
861		switch (compare) {
862		case C_DIFFERENCE:
863		    if (itrace)
864			(void) fprintf(stderr,
865				       "infocmp: dumping differences\n");
866		    (void) printf("comparing %s to %s.\n", name1, name2);
867		    compare_entry(compare_predicate, &entries->tterm, quiet);
868		    break;
869
870		case C_COMMON:
871		    if (itrace)
872			(void) fprintf(stderr,
873				       "infocmp: dumping common capabilities\n");
874		    (void) printf("comparing %s to %s.\n", name1, name2);
875		    compare_entry(compare_predicate, &entries->tterm, quiet);
876		    break;
877
878		case C_NAND:
879		    if (itrace)
880			(void) fprintf(stderr,
881				       "infocmp: dumping differences\n");
882		    (void) printf("comparing %s to %s.\n", name1, name2);
883		    compare_entry(compare_predicate, &entries->tterm, quiet);
884		    break;
885
886		}
887	    }
888	}
889    }
890}
891
892static void
893usage(void)
894{
895    static const char *tbl[] =
896    {
897	"Usage: infocmp [options] [-A directory] [-B directory] [termname...]"
898	,""
899	,"Options:"
900	,"  -1    print single-column"
901	,"  -C    use termcap-names"
902	,"  -F    compare terminfo-files"
903	,"  -I    use terminfo-names"
904	,"  -L    use long names"
905	,"  -R subset (see manpage)"
906	,"  -T    eliminate size limits (test)"
907	,"  -V    print version"
908#if NCURSES_XNAMES
909	,"  -a    with -F, list commented-out caps"
910#endif
911	,"  -c    list common capabilities"
912	,"  -d    list different capabilities"
913	,"  -e    format output for C initializer"
914	,"  -E    format output as C tables"
915	,"  -f    with -1, format complex strings"
916	,"  -G    format %{number} to %'char'"
917	,"  -g    format %'char' to %{number}"
918	,"  -i    analyze initialization/reset"
919	,"  -l    output terminfo names"
920	,"  -n    list capabilities in neither"
921	,"  -p    ignore padding specifiers"
922	,"  -q    brief listing, removes headers"
923	,"  -r    with -C, output in termcap form"
924	,"  -r    with -F, resolve use-references"
925	,"  -s [d|i|l|c] sort fields"
926	,"  -u    produce source with 'use='"
927	,"  -v number  (verbose)"
928	,"  -w number  (width)"
929    };
930    const size_t first = 3;
931    const size_t last = SIZEOF(tbl);
932    const size_t left = (last - first + 1) / 2 + first;
933    size_t n;
934
935    for (n = 0; n < left; n++) {
936	size_t m = (n < first) ? last : n + left - first;
937	if (m < last)
938	    fprintf(stderr, "%-40.40s%s\n", tbl[n], tbl[m]);
939	else
940	    fprintf(stderr, "%s\n", tbl[n]);
941    }
942    exit(EXIT_FAILURE);
943}
944
945static char *
946name_initializer(const char *type)
947{
948    static char *initializer;
949    static size_t len;
950    char *s;
951
952    if (initializer == 0) {
953	len = strlen(entries->tterm.term_names) + 20;
954	initializer = (char *) malloc(len);
955    }
956
957    (void) snprintf(initializer, len, "%s_data_%s", type, entries->tterm.term_names);
958    for (s = initializer; *s != 0 && *s != '|'; s++) {
959	if (!isalnum(CharOf(*s)))
960	    *s = '_';
961    }
962    *s = 0;
963    return initializer;
964}
965
966/* dump C initializers for the terminal type */
967static void
968dump_initializers(TERMTYPE * term)
969{
970    int n;
971    const char *str = 0;
972    int size;
973
974    (void) printf("static char %s[] = %s\n", name_initializer("bool"), L_CURL);
975
976    for_each_boolean(n, term) {
977	switch ((int) (term->Booleans[n])) {
978	case TRUE:
979	    str = "TRUE";
980	    break;
981
982	case FALSE:
983	    str = "FALSE";
984	    break;
985
986	case ABSENT_BOOLEAN:
987	    str = "ABSENT_BOOLEAN";
988	    break;
989
990	case CANCELLED_BOOLEAN:
991	    str = "CANCELLED_BOOLEAN";
992	    break;
993	}
994	(void) printf("\t/* %3d: %-8s */\t%s,\n",
995		      n, ExtBoolname(term, n, boolnames), str);
996    }
997    (void) printf("%s;\n", R_CURL);
998
999    (void) printf("static short %s[] = %s\n", name_initializer("number"), L_CURL);
1000
1001    for_each_number(n, term) {
1002	char buf[BUFSIZ];
1003	switch (term->Numbers[n]) {
1004	case ABSENT_NUMERIC:
1005	    str = "ABSENT_NUMERIC";
1006	    break;
1007	case CANCELLED_NUMERIC:
1008	    str = "CANCELLED_NUMERIC";
1009	    break;
1010	default:
1011	    snprintf(buf, sizeof buf, "%d", term->Numbers[n]);
1012	    str = buf;
1013	    break;
1014	}
1015	(void) printf("\t/* %3d: %-8s */\t%s,\n", n,
1016		      ExtNumname(term, n, numnames), str);
1017    }
1018    (void) printf("%s;\n", R_CURL);
1019
1020    size = sizeof(TERMTYPE)
1021	+ (NUM_BOOLEANS(term) * sizeof(term->Booleans[0]))
1022	+ (NUM_NUMBERS(term) * sizeof(term->Numbers[0]));
1023
1024    (void) printf("static char * %s[] = %s\n", name_initializer("string"), L_CURL);
1025
1026    for_each_string(n, term) {
1027	char buf[MAX_STRING], *sp, *tp;
1028
1029	if (term->Strings[n] == ABSENT_STRING)
1030	    str = "ABSENT_STRING";
1031	else if (term->Strings[n] == CANCELLED_STRING)
1032	    str = "CANCELLED_STRING";
1033	else {
1034	    tp = buf;
1035	    *tp++ = '"';
1036	    for (sp = term->Strings[n];
1037		 *sp != 0 && (tp - buf) < MAX_STRING - 6;
1038		 sp++) {
1039		if (isascii(CharOf(*sp))
1040		    && isprint(CharOf(*sp))
1041		    && *sp != '\\'
1042		    && *sp != '"')
1043		    *tp++ = *sp;
1044		else {
1045		    (void) snprintf(tp, buf + sizeof buf - tp, "\\%03o", CharOf(*sp));
1046		    tp += 4;
1047		}
1048	    }
1049	    *tp++ = '"';
1050	    *tp = '\0';
1051	    size += (strlen(term->Strings[n]) + 1);
1052	    str = buf;
1053	}
1054#if NCURSES_XNAMES
1055	if (n == STRCOUNT) {
1056	    (void) printf("%s;\n", R_CURL);
1057
1058	    (void) printf("static char * %s[] = %s\n",
1059			  name_initializer("string_ext"), L_CURL);
1060	}
1061#endif
1062	(void) printf("\t/* %3d: %-8s */\t%s,\n", n,
1063		      ExtStrname(term, n, strnames), str);
1064    }
1065    (void) printf("%s;\n", R_CURL);
1066}
1067
1068/* dump C initializers for the terminal type */
1069static void
1070dump_termtype(TERMTYPE * term)
1071{
1072    (void) printf("\t%s\n\t\t\"%s\",\n", L_CURL, term->term_names);
1073    (void) printf("\t\t(char *)0,\t/* pointer to string table */\n");
1074
1075    (void) printf("\t\t%s,\n", name_initializer("bool"));
1076    (void) printf("\t\t%s,\n", name_initializer("number"));
1077
1078    (void) printf("\t\t%s,\n", name_initializer("string"));
1079
1080#if NCURSES_XNAMES
1081    (void) printf("#if NCURSES_XNAMES\n");
1082    (void) printf("\t\t(char *)0,\t/* pointer to extended string table */\n");
1083    (void) printf("\t\t%s,\t/* ...corresponding names */\n",
1084		  (NUM_STRINGS(term) != STRCOUNT)
1085		  ? name_initializer("string_ext")
1086		  : "(char **)0");
1087
1088    (void) printf("\t\t%d,\t\t/* count total Booleans */\n", NUM_BOOLEANS(term));
1089    (void) printf("\t\t%d,\t\t/* count total Numbers */\n", NUM_NUMBERS(term));
1090    (void) printf("\t\t%d,\t\t/* count total Strings */\n", NUM_STRINGS(term));
1091
1092    (void) printf("\t\t%d,\t\t/* count extensions to Booleans */\n",
1093		  NUM_BOOLEANS(term) - BOOLCOUNT);
1094    (void) printf("\t\t%d,\t\t/* count extensions to Numbers */\n",
1095		  NUM_NUMBERS(term) - NUMCOUNT);
1096    (void) printf("\t\t%d,\t\t/* count extensions to Strings */\n",
1097		  NUM_STRINGS(term) - STRCOUNT);
1098
1099    (void) printf("#endif /* NCURSES_XNAMES */\n");
1100#endif /* NCURSES_XNAMES */
1101    (void) printf("\t%s\n", R_CURL);
1102}
1103
1104static int
1105optarg_to_number(void)
1106{
1107    char *temp = 0;
1108    long value = strtol(optarg, &temp, 0);
1109
1110    if (temp == 0 || temp == optarg || *temp != 0) {
1111	fprintf(stderr, "Expected a number, not \"%s\"\n", optarg);
1112	exit(EXIT_FAILURE);
1113    }
1114    return (int) value;
1115}
1116
1117/***************************************************************************
1118 *
1119 * Main sequence
1120 *
1121 ***************************************************************************/
1122
1123int
1124main(int argc, char *argv[])
1125{
1126    char *terminal, *firstdir, *restdir;
1127    /* Avoid "local data >32k" error with mwcc */
1128    /* Also avoid overflowing smaller stacks on systems like AmigaOS */
1129    size_t tlen = sizeof(path) * MAXTERMS;
1130    path *tfile = (path *) malloc(tlen);
1131    int c, i, len;
1132    bool formatted = FALSE;
1133    bool filecompare = FALSE;
1134    int initdump = 0;
1135    bool init_analyze = FALSE;
1136
1137    if ((terminal = getenv("TERM")) == 0) {
1138	(void) fprintf(stderr,
1139		       "infocmp: environment variable TERM not set\n");
1140	return EXIT_FAILURE;
1141    }
1142
1143    /* where is the terminfo database location going to default to? */
1144    restdir = firstdir = 0;
1145
1146    while ((c = getopt(argc, argv, "adeEcCfFGgIinlLpqrR:s:uv:Vw:A:B:1T")) != -1)
1147	switch (c) {
1148#if NCURSES_XNAMES
1149	case 'a':
1150	    _nc_disable_period = TRUE;
1151	    use_extended_names(TRUE);
1152	    break;
1153#endif
1154	case 'd':
1155	    compare = C_DIFFERENCE;
1156	    break;
1157
1158	case 'e':
1159	    initdump |= 1;
1160	    break;
1161
1162	case 'E':
1163	    initdump |= 2;
1164	    break;
1165
1166	case 'c':
1167	    compare = C_COMMON;
1168	    break;
1169
1170	case 'C':
1171	    outform = F_TERMCAP;
1172	    tversion = "BSD";
1173	    if (sortmode == S_DEFAULT)
1174		sortmode = S_TERMCAP;
1175	    break;
1176
1177	case 'f':
1178	    formatted = TRUE;
1179	    break;
1180
1181	case 'G':
1182	    numbers = 1;
1183	    break;
1184
1185	case 'g':
1186	    numbers = -1;
1187	    break;
1188
1189	case 'F':
1190	    filecompare = TRUE;
1191	    break;
1192
1193	case 'I':
1194	    outform = F_TERMINFO;
1195	    if (sortmode == S_DEFAULT)
1196		sortmode = S_VARIABLE;
1197	    tversion = 0;
1198	    break;
1199
1200	case 'i':
1201	    init_analyze = TRUE;
1202	    break;
1203
1204	case 'l':
1205	    outform = F_TERMINFO;
1206	    break;
1207
1208	case 'L':
1209	    outform = F_VARIABLE;
1210	    if (sortmode == S_DEFAULT)
1211		sortmode = S_VARIABLE;
1212	    break;
1213
1214	case 'n':
1215	    compare = C_NAND;
1216	    break;
1217
1218	case 'p':
1219	    ignorepads = TRUE;
1220	    break;
1221
1222	case 'q':
1223	    quiet = TRUE;
1224	    s_absent = "-";
1225	    s_cancel = "@";
1226	    bool_sep = ", ";
1227	    break;
1228
1229	case 'r':
1230	    tversion = 0;
1231	    limited = FALSE;
1232	    break;
1233
1234	case 'R':
1235	    tversion = optarg;
1236	    break;
1237
1238	case 's':
1239	    if (*optarg == 'd')
1240		sortmode = S_NOSORT;
1241	    else if (*optarg == 'i')
1242		sortmode = S_TERMINFO;
1243	    else if (*optarg == 'l')
1244		sortmode = S_VARIABLE;
1245	    else if (*optarg == 'c')
1246		sortmode = S_TERMCAP;
1247	    else {
1248		(void) fprintf(stderr,
1249			       "infocmp: unknown sort mode\n");
1250		return EXIT_FAILURE;
1251	    }
1252	    break;
1253
1254	case 'u':
1255	    compare = C_USEALL;
1256	    break;
1257
1258	case 'v':
1259	    itrace = optarg_to_number();
1260	    set_trace_level(itrace);
1261	    break;
1262
1263	case 'V':
1264	    puts(curses_version());
1265	    ExitProgram(EXIT_SUCCESS);
1266
1267	case 'w':
1268	    mwidth = optarg_to_number();
1269	    break;
1270
1271	case 'A':
1272	    firstdir = optarg;
1273	    break;
1274
1275	case 'B':
1276	    restdir = optarg;
1277	    break;
1278
1279	case '1':
1280	    mwidth = 0;
1281	    break;
1282
1283	case 'T':
1284	    limited = FALSE;
1285	    break;
1286	default:
1287	    usage();
1288	}
1289
1290    /* by default, sort by terminfo name */
1291    if (sortmode == S_DEFAULT)
1292	sortmode = S_TERMINFO;
1293
1294    /* set up for display */
1295    dump_init(tversion, outform, sortmode, mwidth, itrace, formatted);
1296
1297    /* make sure we have at least one terminal name to work with */
1298    if (optind >= argc)
1299	argv[argc++] = terminal;
1300
1301    /* if user is after a comparison, make sure we have two entries */
1302    if (compare != C_DEFAULT && optind >= argc - 1)
1303	argv[argc++] = terminal;
1304
1305    /* exactly two terminal names with no options means do -d */
1306    if (argc - optind == 2 && compare == C_DEFAULT)
1307	compare = C_DIFFERENCE;
1308
1309    if (!filecompare) {
1310	/* grab the entries */
1311	termcount = 0;
1312	for (; optind < argc; optind++) {
1313	    if (termcount >= MAXTERMS) {
1314		(void) fprintf(stderr,
1315			       "infocmp: too many terminal type arguments\n");
1316		return EXIT_FAILURE;
1317	    } else {
1318		const char *directory = termcount ? restdir : firstdir;
1319		int status;
1320
1321		tname[termcount] = argv[optind];
1322
1323		if (directory) {
1324		    (void) snprintf(tfile[termcount],
1325				    tlen - termcount,
1326				   "%s/%c/%s",
1327				   directory,
1328				   *argv[optind], argv[optind]);
1329		    if (itrace)
1330			(void) fprintf(stderr,
1331				       "infocmp: reading entry %s from file %s\n",
1332				       argv[optind], tfile[termcount]);
1333
1334		    status = _nc_read_file_entry(tfile[termcount],
1335						 &entries[termcount].tterm);
1336		} else {
1337		    if (itrace)
1338			(void) fprintf(stderr,
1339				       "infocmp: reading entry %s from system directories %s\n",
1340				       argv[optind], tname[termcount]);
1341
1342		    status = _nc_read_entry(tname[termcount],
1343					    tfile[termcount],
1344					    &entries[termcount].tterm);
1345		    directory = TERMINFO;	/* for error message */
1346		}
1347
1348		if (status <= 0) {
1349		    (void) fprintf(stderr,
1350				   "infocmp: couldn't open terminfo file %s.\n",
1351				   tfile[termcount]);
1352		    return EXIT_FAILURE;
1353		}
1354		repair_acsc(&entries[termcount].tterm);
1355		termcount++;
1356	    }
1357	}
1358
1359#if NCURSES_XNAMES
1360	if (termcount > 1)
1361	    _nc_align_termtype(&entries[0].tterm, &entries[1].tterm);
1362#endif
1363
1364	/* dump as C initializer for the terminal type */
1365	if (initdump) {
1366	    if (initdump & 1)
1367		dump_termtype(&entries[0].tterm);
1368	    if (initdump & 2)
1369		dump_initializers(&entries[0].tterm);
1370	    ExitProgram(EXIT_SUCCESS);
1371	}
1372
1373	/* analyze the init strings */
1374	if (init_analyze) {
1375#undef CUR
1376#define CUR	entries[0].tterm.
1377	    analyze_string("is1", init_1string, &entries[0].tterm);
1378	    analyze_string("is2", init_2string, &entries[0].tterm);
1379	    analyze_string("is3", init_3string, &entries[0].tterm);
1380	    analyze_string("rs1", reset_1string, &entries[0].tterm);
1381	    analyze_string("rs2", reset_2string, &entries[0].tterm);
1382	    analyze_string("rs3", reset_3string, &entries[0].tterm);
1383	    analyze_string("smcup", enter_ca_mode, &entries[0].tterm);
1384	    analyze_string("rmcup", exit_ca_mode, &entries[0].tterm);
1385#undef CUR
1386	    ExitProgram(EXIT_SUCCESS);
1387	}
1388
1389	/*
1390	 * Here's where the real work gets done
1391	 */
1392	switch (compare) {
1393	case C_DEFAULT:
1394	    if (itrace)
1395		(void) fprintf(stderr,
1396			       "infocmp: about to dump %s\n",
1397			       tname[0]);
1398	    (void) printf("#\tReconstructed via infocmp from file: %s\n",
1399			  tfile[0]);
1400	    len = dump_entry(&entries[0].tterm, limited, numbers, NULL);
1401	    putchar('\n');
1402	    if (itrace)
1403		(void) fprintf(stderr, "infocmp: length %d\n", len);
1404	    break;
1405
1406	case C_DIFFERENCE:
1407	    if (itrace)
1408		(void) fprintf(stderr, "infocmp: dumping differences\n");
1409	    (void) printf("comparing %s to %s.\n", tname[0], tname[1]);
1410	    compare_entry(compare_predicate, &entries->tterm, quiet);
1411	    break;
1412
1413	case C_COMMON:
1414	    if (itrace)
1415		(void) fprintf(stderr,
1416			       "infocmp: dumping common capabilities\n");
1417	    (void) printf("comparing %s to %s.\n", tname[0], tname[1]);
1418	    compare_entry(compare_predicate, &entries->tterm, quiet);
1419	    break;
1420
1421	case C_NAND:
1422	    if (itrace)
1423		(void) fprintf(stderr,
1424			       "infocmp: dumping differences\n");
1425	    (void) printf("comparing %s to %s.\n", tname[0], tname[1]);
1426	    compare_entry(compare_predicate, &entries->tterm, quiet);
1427	    break;
1428
1429	case C_USEALL:
1430	    if (itrace)
1431		(void) fprintf(stderr, "infocmp: dumping use entry\n");
1432	    len = dump_entry(&entries[0].tterm, limited, numbers, use_predicate);
1433	    for (i = 1; i < termcount; i++)
1434		len += dump_uses(tname[i], !(outform == F_TERMCAP || outform
1435					     == F_TCONVERR));
1436	    putchar('\n');
1437	    if (itrace)
1438		(void) fprintf(stderr, "infocmp: length %d\n", len);
1439	    break;
1440	}
1441    } else if (compare == C_USEALL)
1442	(void) fprintf(stderr, "Sorry, -u doesn't work with -F\n");
1443    else if (compare == C_DEFAULT)
1444	(void) fprintf(stderr, "Use `tic -[CI] <file>' for this.\n");
1445    else if (argc - optind != 2)
1446	(void) fprintf(stderr,
1447		       "File comparison needs exactly two file arguments.\n");
1448    else
1449	file_comparison(argc - optind, argv + optind);
1450
1451    ExitProgram(EXIT_SUCCESS);
1452}
1453
1454/* infocmp.c ends here */
1455