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