1 /**************************************************************************** 2 * Copyright (c) 1998-2005,2006 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 * and: Thomas E. Dickey 1996-on * 33 ****************************************************************************/ 34 35 /* 36 * infocmp.c -- decompile an entry, or compare two entries 37 * written by Eric S. Raymond 38 */ 39 40 #include <progs.priv.h> 41 42 #include <dump_entry.h> 43 44 MODULE_ID("$Id: infocmp.c,v 1.85 2006/08/19 21:20:37 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 bool literal = FALSE; 70 static const char *bool_sep = ":"; 71 static const char *s_absent = "NULL"; 72 static const char *s_cancel = "NULL"; 73 static const char *tversion; /* terminfo version selected */ 74 static int itrace; /* trace flag for debugging */ 75 static int mwidth = 60; 76 static int numbers = 0; /* format "%'char'" to/from "%{number}" */ 77 static int outform = F_TERMINFO; /* output format */ 78 static int sortmode; /* sort_mode */ 79 80 /* main comparison mode */ 81 static int compare; 82 #define C_DEFAULT 0 /* don't force comparison mode */ 83 #define C_DIFFERENCE 1 /* list differences between two terminals */ 84 #define C_COMMON 2 /* list common capabilities */ 85 #define C_NAND 3 /* list capabilities in neither terminal */ 86 #define C_USEALL 4 /* generate relative use-form entry */ 87 static bool ignorepads; /* ignore pad prefixes when diffing */ 88 89 #if NO_LEAKS 90 #undef ExitProgram 91 static void 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(PredIdx 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(unsigned type, PredIdx 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 unsigned 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((PredIdx) 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(PredType type, PredIdx 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 controls widely supported by emulators */ 478 {"\033=", "DECPAM"}, /* application keypad mode */ 479 {"\033>", "DECPNM"}, /* normal keypad mode */ 480 {"\033<", "DECANSI"}, /* enter ANSI mode */ 481 {"\033[!p", "DECSTR"}, /* soft reset */ 482 {"\033 F", "S7C1T"}, /* 7-bit controls */ 483 484 {(char *) 0, (char *) 0} 485 }; 486 487 static const assoc std_modes[] = 488 /* ECMA \E[ ... [hl] modes recognized by many emulators */ 489 { 490 {"2", "AM"}, /* keyboard action mode */ 491 {"4", "IRM"}, /* insert/replace mode */ 492 {"12", "SRM"}, /* send/receive mode */ 493 {"20", "LNM"}, /* linefeed mode */ 494 {(char *) 0, (char *) 0} 495 }; 496 497 static const assoc private_modes[] = 498 /* DEC \E[ ... [hl] modes recognized by many emulators */ 499 { 500 {"1", "CKM"}, /* application cursor keys */ 501 {"2", "ANM"}, /* set VT52 mode */ 502 {"3", "COLM"}, /* 132-column mode */ 503 {"4", "SCLM"}, /* smooth scroll */ 504 {"5", "SCNM"}, /* reverse video mode */ 505 {"6", "OM"}, /* origin mode */ 506 {"7", "AWM"}, /* wraparound mode */ 507 {"8", "ARM"}, /* auto-repeat mode */ 508 {(char *) 0, (char *) 0} 509 }; 510 511 static const assoc ecma_highlights[] = 512 /* recognize ECMA attribute sequences */ 513 { 514 {"0", "NORMAL"}, /* normal */ 515 {"1", "+BOLD"}, /* bold on */ 516 {"2", "+DIM"}, /* dim on */ 517 {"3", "+ITALIC"}, /* italic on */ 518 {"4", "+UNDERLINE"}, /* underline on */ 519 {"5", "+BLINK"}, /* blink on */ 520 {"6", "+FASTBLINK"}, /* fastblink on */ 521 {"7", "+REVERSE"}, /* reverse on */ 522 {"8", "+INVISIBLE"}, /* invisible on */ 523 {"9", "+DELETED"}, /* deleted on */ 524 {"10", "MAIN-FONT"}, /* select primary font */ 525 {"11", "ALT-FONT-1"}, /* select alternate font 1 */ 526 {"12", "ALT-FONT-2"}, /* select alternate font 2 */ 527 {"13", "ALT-FONT-3"}, /* select alternate font 3 */ 528 {"14", "ALT-FONT-4"}, /* select alternate font 4 */ 529 {"15", "ALT-FONT-5"}, /* select alternate font 5 */ 530 {"16", "ALT-FONT-6"}, /* select alternate font 6 */ 531 {"17", "ALT-FONT-7"}, /* select alternate font 7 */ 532 {"18", "ALT-FONT-1"}, /* select alternate font 1 */ 533 {"19", "ALT-FONT-1"}, /* select alternate font 1 */ 534 {"20", "FRAKTUR"}, /* Fraktur font */ 535 {"21", "DOUBLEUNDER"}, /* double underline */ 536 {"22", "-DIM"}, /* dim off */ 537 {"23", "-ITALIC"}, /* italic off */ 538 {"24", "-UNDERLINE"}, /* underline off */ 539 {"25", "-BLINK"}, /* blink off */ 540 {"26", "-FASTBLINK"}, /* fastblink off */ 541 {"27", "-REVERSE"}, /* reverse off */ 542 {"28", "-INVISIBLE"}, /* invisible off */ 543 {"29", "-DELETED"}, /* deleted off */ 544 {(char *) 0, (char *) 0} 545 }; 546 547 static int 548 skip_csi(const char *cap) 549 { 550 int result = 0; 551 if (cap[0] == '\033' && cap[1] == '[') 552 result = 2; 553 else if (UChar(cap[0]) == 0233) 554 result = 1; 555 return result; 556 } 557 558 static bool 559 same_param(const char *table, const char *param, unsigned length) 560 { 561 bool result = FALSE; 562 if (strncmp(table, param, length) == 0) { 563 result = !isdigit(UChar(param[length])); 564 } 565 return result; 566 } 567 568 static char * 569 lookup_params(const assoc * table, char *dst, char *src) 570 { 571 const char *ep = strtok(src, ";"); 572 const assoc *ap; 573 574 do { 575 bool found = FALSE; 576 577 for (ap = table; ap->from; ap++) { 578 size_t tlen = strlen(ap->from); 579 580 if (same_param(ap->from, ep, tlen)) { 581 (void) strcat(dst, ap->to); 582 found = TRUE; 583 break; 584 } 585 } 586 587 if (!found) 588 (void) strcat(dst, ep); 589 (void) strcat(dst, ";"); 590 } while 591 ((ep = strtok((char *) 0, ";"))); 592 593 dst[strlen(dst) - 1] = '\0'; 594 595 return dst; 596 } 597 598 static void 599 analyze_string(const char *name, const char *cap, TERMTYPE *tp) 600 { 601 char buf[MAX_TERMINFO_LENGTH]; 602 char buf2[MAX_TERMINFO_LENGTH]; 603 const char *sp; 604 const assoc *ap; 605 int tp_lines = tp->Numbers[2]; 606 607 if (cap == ABSENT_STRING || cap == CANCELLED_STRING) 608 return; 609 (void) printf("%s: ", name); 610 611 buf[0] = '\0'; 612 for (sp = cap; *sp; sp++) { 613 int i; 614 int csi; 615 size_t len = 0; 616 size_t next; 617 const char *expansion = 0; 618 char buf3[MAX_TERMINFO_LENGTH]; 619 620 /* first, check other capabilities in this entry */ 621 for (i = 0; i < STRCOUNT; i++) { 622 char *cp = tp->Strings[i]; 623 624 /* don't use soft-key capabilities */ 625 if (strnames[i][0] == 'k' && strnames[i][0] == 'f') 626 continue; 627 628 if (cp != ABSENT_STRING && cp != CANCELLED_STRING && cp[0] && cp 629 != cap) { 630 len = strlen(cp); 631 (void) strncpy(buf2, sp, len); 632 buf2[len] = '\0'; 633 634 if (_nc_capcmp(cp, buf2)) 635 continue; 636 637 #define ISRS(s) (!strncmp((s), "is", 2) || !strncmp((s), "rs", 2)) 638 /* 639 * Theoretically we just passed the test for translation 640 * (equality once the padding is stripped). However, there 641 * are a few more hoops that need to be jumped so that 642 * identical pairs of initialization and reset strings 643 * don't just refer to each other. 644 */ 645 if (ISRS(name) || ISRS(strnames[i])) 646 if (cap < cp) 647 continue; 648 #undef ISRS 649 650 expansion = strnames[i]; 651 break; 652 } 653 } 654 655 /* now check the standard capabilities */ 656 if (!expansion) { 657 csi = skip_csi(sp); 658 for (ap = std_caps; ap->from; ap++) { 659 size_t adj = csi ? 2 : 0; 660 661 len = strlen(ap->from); 662 if (csi && skip_csi(ap->from) != csi) 663 continue; 664 if (len > adj 665 && strncmp(ap->from + adj, sp + csi, len - adj) == 0) { 666 expansion = ap->to; 667 len -= adj; 668 len += csi; 669 break; 670 } 671 } 672 } 673 674 /* now check for standard-mode sequences */ 675 if (!expansion 676 && (csi = skip_csi(sp)) != 0 677 && (len = strspn(sp + csi, "0123456789;")) 678 && (next = csi + len) 679 && ((sp[next] == 'h') || (sp[next] == 'l'))) { 680 681 (void) strcpy(buf2, (sp[next] == 'h') ? "ECMA+" : "ECMA-"); 682 (void) strncpy(buf3, sp + csi, len); 683 buf3[len] = '\0'; 684 len += csi + 1; 685 686 expansion = lookup_params(std_modes, buf2, buf3); 687 } 688 689 /* now check for private-mode sequences */ 690 if (!expansion 691 && (csi = skip_csi(sp)) != 0 692 && sp[csi] == '?' 693 && (len = strspn(sp + csi + 1, "0123456789;")) 694 && (next = csi + 1 + len) 695 && ((sp[next] == 'h') || (sp[next] == 'l'))) { 696 697 (void) strcpy(buf2, (sp[next] == 'h') ? "DEC+" : "DEC-"); 698 (void) strncpy(buf3, sp + csi + 1, len); 699 buf3[len] = '\0'; 700 len += csi + 2; 701 702 expansion = lookup_params(private_modes, buf2, buf3); 703 } 704 705 /* now check for ECMA highlight sequences */ 706 if (!expansion 707 && (csi = skip_csi(sp)) != 0 708 && (len = strspn(sp + csi, "0123456789;")) != 0 709 && (next = csi + len) 710 && sp[next] == 'm') { 711 712 (void) strcpy(buf2, "SGR:"); 713 (void) strncpy(buf3, sp + csi, len); 714 buf3[len] = '\0'; 715 len += csi + 1; 716 717 expansion = lookup_params(ecma_highlights, buf2, buf3); 718 } 719 720 if (!expansion 721 && (csi = skip_csi(sp)) != 0 722 && sp[csi] == 'm') { 723 len = csi + 1; 724 (void) strcpy(buf2, "SGR:"); 725 strcat(buf2, ecma_highlights[0].to); 726 expansion = buf2; 727 } 728 729 /* now check for scroll region reset */ 730 if (!expansion 731 && (csi = skip_csi(sp)) != 0) { 732 if (sp[csi] == 'r') { 733 expansion = "RSR"; 734 len = 1; 735 } else { 736 (void) sprintf(buf2, "1;%dr", tp_lines); 737 len = strlen(buf2); 738 if (strncmp(buf2, sp + csi, len) == 0) 739 expansion = "RSR"; 740 } 741 len += csi; 742 } 743 744 /* now check for home-down */ 745 if (!expansion 746 && (csi = skip_csi(sp)) != 0) { 747 (void) sprintf(buf2, "%d;1H", tp_lines); 748 len = strlen(buf2); 749 if (strncmp(buf2, sp + csi, len) == 0) { 750 expansion = "LL"; 751 } else { 752 (void) sprintf(buf2, "%dH", tp_lines); 753 len = strlen(buf2); 754 if (strncmp(buf2, sp + csi, len) == 0) { 755 expansion = "LL"; 756 } 757 } 758 len += csi; 759 } 760 761 /* now look at the expansion we got, if any */ 762 if (expansion) { 763 (void) sprintf(buf + strlen(buf), "{%s}", expansion); 764 sp += len - 1; 765 continue; 766 } else { 767 /* couldn't match anything */ 768 buf2[0] = *sp; 769 buf2[1] = '\0'; 770 (void) strcat(buf, TIC_EXPAND(buf2)); 771 } 772 } 773 (void) printf("%s\n", buf); 774 } 775 776 /*************************************************************************** 777 * 778 * File comparison 779 * 780 ***************************************************************************/ 781 782 static void 783 file_comparison(int argc, char *argv[]) 784 { 785 #define MAXCOMPARE 2 786 /* someday we may allow comparisons on more files */ 787 int filecount = 0; 788 ENTRY *heads[MAXCOMPARE]; 789 ENTRY *qp, *rp; 790 int i, n; 791 792 dump_init((char *) 0, F_LITERAL, S_TERMINFO, 0, itrace, FALSE); 793 794 for (n = 0; n < argc && n < MAXCOMPARE; n++) { 795 if (freopen(argv[n], "r", stdin) == 0) 796 _nc_err_abort("Can't open %s", argv[n]); 797 798 _nc_head = _nc_tail = 0; 799 800 /* parse entries out of the source file */ 801 _nc_set_source(argv[n]); 802 _nc_read_entry_source(stdin, NULL, TRUE, literal, NULLHOOK); 803 804 if (itrace) 805 (void) fprintf(stderr, "Resolving file %d...\n", n - 0); 806 807 /* maybe do use resolution */ 808 if (!_nc_resolve_uses2(!limited, literal)) { 809 (void) fprintf(stderr, 810 "There are unresolved use entries in %s:\n", 811 argv[n]); 812 for_entry_list(qp) { 813 if (qp->nuses) { 814 (void) fputs(qp->tterm.term_names, stderr); 815 (void) fputc('\n', stderr); 816 } 817 } 818 ExitProgram(EXIT_FAILURE); 819 } 820 821 heads[filecount] = _nc_head; 822 filecount++; 823 } 824 825 /* OK, all entries are in core. Ready to do the comparison */ 826 if (itrace) 827 (void) fprintf(stderr, "Entries are now in core...\n"); 828 829 /* The entry-matching loop. Sigh, this is intrinsically quadratic. */ 830 for (qp = heads[0]; qp; qp = qp->next) { 831 for (rp = heads[1]; rp; rp = rp->next) 832 if (_nc_entry_match(qp->tterm.term_names, rp->tterm.term_names)) { 833 if (qp->ncrosslinks < MAX_CROSSLINKS) 834 qp->crosslinks[qp->ncrosslinks] = rp; 835 qp->ncrosslinks++; 836 837 if (rp->ncrosslinks < MAX_CROSSLINKS) 838 rp->crosslinks[rp->ncrosslinks] = qp; 839 rp->ncrosslinks++; 840 } 841 } 842 843 /* now we have two circular lists with crosslinks */ 844 if (itrace) 845 (void) fprintf(stderr, "Name matches are done...\n"); 846 847 for (qp = heads[0]; qp; qp = qp->next) { 848 if (qp->ncrosslinks > 1) { 849 (void) fprintf(stderr, 850 "%s in file 1 (%s) has %d matches in file 2 (%s):\n", 851 _nc_first_name(qp->tterm.term_names), 852 argv[0], 853 qp->ncrosslinks, 854 argv[1]); 855 for (i = 0; i < qp->ncrosslinks; i++) 856 (void) fprintf(stderr, 857 "\t%s\n", 858 _nc_first_name((qp->crosslinks[i])->tterm.term_names)); 859 } 860 } 861 862 for (rp = heads[1]; rp; rp = rp->next) { 863 if (rp->ncrosslinks > 1) { 864 (void) fprintf(stderr, 865 "%s in file 2 (%s) has %d matches in file 1 (%s):\n", 866 _nc_first_name(rp->tterm.term_names), 867 argv[1], 868 rp->ncrosslinks, 869 argv[0]); 870 for (i = 0; i < rp->ncrosslinks; i++) 871 (void) fprintf(stderr, 872 "\t%s\n", 873 _nc_first_name((rp->crosslinks[i])->tterm.term_names)); 874 } 875 } 876 877 (void) printf("In file 1 (%s) only:\n", argv[0]); 878 for (qp = heads[0]; qp; qp = qp->next) 879 if (qp->ncrosslinks == 0) 880 (void) printf("\t%s\n", 881 _nc_first_name(qp->tterm.term_names)); 882 883 (void) printf("In file 2 (%s) only:\n", argv[1]); 884 for (rp = heads[1]; rp; rp = rp->next) 885 if (rp->ncrosslinks == 0) 886 (void) printf("\t%s\n", 887 _nc_first_name(rp->tterm.term_names)); 888 889 (void) printf("The following entries are equivalent:\n"); 890 for (qp = heads[0]; qp; qp = qp->next) { 891 rp = qp->crosslinks[0]; 892 893 if (qp->ncrosslinks == 1) { 894 rp = qp->crosslinks[0]; 895 896 repair_acsc(&qp->tterm); 897 repair_acsc(&rp->tterm); 898 #if NCURSES_XNAMES 899 _nc_align_termtype(&qp->tterm, &rp->tterm); 900 #endif 901 if (entryeq(&qp->tterm, &rp->tterm) && useeq(qp, rp)) { 902 char name1[NAMESIZE], name2[NAMESIZE]; 903 904 (void) canonical_name(qp->tterm.term_names, name1); 905 (void) canonical_name(rp->tterm.term_names, name2); 906 907 (void) printf("%s = %s\n", name1, name2); 908 } 909 } 910 } 911 912 (void) printf("Differing entries:\n"); 913 termcount = 2; 914 for (qp = heads[0]; qp; qp = qp->next) { 915 916 if (qp->ncrosslinks == 1) { 917 rp = qp->crosslinks[0]; 918 #if NCURSES_XNAMES 919 /* sorry - we have to do this on each pass */ 920 _nc_align_termtype(&qp->tterm, &rp->tterm); 921 #endif 922 if (!(entryeq(&qp->tterm, &rp->tterm) && useeq(qp, rp))) { 923 char name1[NAMESIZE], name2[NAMESIZE]; 924 925 entries[0] = *qp; 926 entries[1] = *rp; 927 928 (void) canonical_name(qp->tterm.term_names, name1); 929 (void) canonical_name(rp->tterm.term_names, name2); 930 931 switch (compare) { 932 case C_DIFFERENCE: 933 if (itrace) 934 (void) fprintf(stderr, 935 "infocmp: dumping differences\n"); 936 (void) printf("comparing %s to %s.\n", name1, name2); 937 compare_entry(compare_predicate, &entries->tterm, quiet); 938 break; 939 940 case C_COMMON: 941 if (itrace) 942 (void) fprintf(stderr, 943 "infocmp: dumping common capabilities\n"); 944 (void) printf("comparing %s to %s.\n", name1, name2); 945 compare_entry(compare_predicate, &entries->tterm, quiet); 946 break; 947 948 case C_NAND: 949 if (itrace) 950 (void) fprintf(stderr, 951 "infocmp: dumping differences\n"); 952 (void) printf("comparing %s to %s.\n", name1, name2); 953 compare_entry(compare_predicate, &entries->tterm, quiet); 954 break; 955 956 } 957 } 958 } 959 } 960 } 961 962 static void 963 usage(void) 964 { 965 static const char *tbl[] = 966 { 967 "Usage: infocmp [options] [-A directory] [-B directory] [termname...]" 968 ,"" 969 ,"Options:" 970 ," -1 print single-column" 971 ," -C use termcap-names" 972 ," -F compare terminfo-files" 973 ," -I use terminfo-names" 974 ," -L use long names" 975 ," -R subset (see manpage)" 976 ," -T eliminate size limits (test)" 977 ," -U eliminate post-processing of entries" 978 ," -V print version" 979 #if NCURSES_XNAMES 980 ," -a with -F, list commented-out caps" 981 #endif 982 ," -c list common capabilities" 983 ," -d list different capabilities" 984 ," -e format output for C initializer" 985 ," -E format output as C tables" 986 ," -f with -1, format complex strings" 987 ," -G format %{number} to %'char'" 988 ," -g format %'char' to %{number}" 989 ," -i analyze initialization/reset" 990 ," -l output terminfo names" 991 ," -n list capabilities in neither" 992 ," -p ignore padding specifiers" 993 ," -q brief listing, removes headers" 994 ," -r with -C, output in termcap form" 995 ," -r with -F, resolve use-references" 996 ," -s [d|i|l|c] sort fields" 997 #if NCURSES_XNAMES 998 ," -t suppress commented-out capabilities" 999 #endif 1000 ," -u produce source with 'use='" 1001 ," -v number (verbose)" 1002 ," -w number (width)" 1003 #if NCURSES_XNAMES 1004 ," -x treat unknown capabilities as user-defined" 1005 #endif 1006 }; 1007 const size_t first = 3; 1008 const size_t last = SIZEOF(tbl); 1009 const size_t left = (last - first + 1) / 2 + first; 1010 size_t n; 1011 1012 for (n = 0; n < left; n++) { 1013 size_t m = (n < first) ? last : n + left - first; 1014 if (m < last) 1015 fprintf(stderr, "%-40.40s%s\n", tbl[n], tbl[m]); 1016 else 1017 fprintf(stderr, "%s\n", tbl[n]); 1018 } 1019 ExitProgram(EXIT_FAILURE); 1020 } 1021 1022 static char * 1023 any_initializer(const char *fmt, const char *type) 1024 { 1025 static char *initializer; 1026 char *s; 1027 1028 if (initializer == 0) 1029 initializer = (char *) malloc(strlen(entries->tterm.term_names) + 1030 strlen(type) + strlen(fmt)); 1031 1032 (void) strcpy(initializer, entries->tterm.term_names); 1033 for (s = initializer; *s != 0 && *s != '|'; s++) { 1034 if (!isalnum(UChar(*s))) 1035 *s = '_'; 1036 } 1037 *s = 0; 1038 (void) sprintf(s, fmt, type); 1039 return initializer; 1040 } 1041 1042 static char * 1043 name_initializer(const char *type) 1044 { 1045 return any_initializer("_%s_data", type); 1046 } 1047 1048 static char * 1049 string_variable(const char *type) 1050 { 1051 return any_initializer("_s_%s", type); 1052 } 1053 1054 /* dump C initializers for the terminal type */ 1055 static void 1056 dump_initializers(TERMTYPE *term) 1057 { 1058 unsigned n; 1059 int size; 1060 const char *str = 0; 1061 1062 printf("\nstatic char %s[] = \"%s\";\n\n", 1063 name_initializer("alias"), entries->tterm.term_names); 1064 1065 for_each_string(n, term) { 1066 char buf[MAX_STRING], *sp, *tp; 1067 1068 if (VALID_STRING(term->Strings[n])) { 1069 tp = buf; 1070 *tp++ = '"'; 1071 for (sp = term->Strings[n]; 1072 *sp != 0 && (tp - buf) < MAX_STRING - 6; 1073 sp++) { 1074 if (isascii(UChar(*sp)) 1075 && isprint(UChar(*sp)) 1076 && *sp != '\\' 1077 && *sp != '"') 1078 *tp++ = *sp; 1079 else { 1080 (void) sprintf(tp, "\\%03o", UChar(*sp)); 1081 tp += 4; 1082 } 1083 } 1084 *tp++ = '"'; 1085 *tp = '\0'; 1086 size += (strlen(term->Strings[n]) + 1); 1087 (void) printf("static char %-20s[] = %s;\n", 1088 string_variable(ExtStrname(term, n, strnames)), buf); 1089 } 1090 } 1091 printf("\n"); 1092 1093 (void) printf("static char %s[] = %s\n", name_initializer("bool"), L_CURL); 1094 1095 for_each_boolean(n, term) { 1096 switch ((int) (term->Booleans[n])) { 1097 case TRUE: 1098 str = "TRUE"; 1099 break; 1100 1101 case FALSE: 1102 str = "FALSE"; 1103 break; 1104 1105 case ABSENT_BOOLEAN: 1106 str = "ABSENT_BOOLEAN"; 1107 break; 1108 1109 case CANCELLED_BOOLEAN: 1110 str = "CANCELLED_BOOLEAN"; 1111 break; 1112 } 1113 (void) printf("\t/* %3u: %-8s */\t%s,\n", 1114 n, ExtBoolname(term, n, boolnames), str); 1115 } 1116 (void) printf("%s;\n", R_CURL); 1117 1118 (void) printf("static short %s[] = %s\n", name_initializer("number"), L_CURL); 1119 1120 for_each_number(n, term) { 1121 char buf[BUFSIZ]; 1122 switch (term->Numbers[n]) { 1123 case ABSENT_NUMERIC: 1124 str = "ABSENT_NUMERIC"; 1125 break; 1126 case CANCELLED_NUMERIC: 1127 str = "CANCELLED_NUMERIC"; 1128 break; 1129 default: 1130 sprintf(buf, "%d", term->Numbers[n]); 1131 str = buf; 1132 break; 1133 } 1134 (void) printf("\t/* %3u: %-8s */\t%s,\n", n, 1135 ExtNumname(term, n, numnames), str); 1136 } 1137 (void) printf("%s;\n", R_CURL); 1138 1139 size = (sizeof(TERMTYPE) 1140 + (NUM_BOOLEANS(term) * sizeof(term->Booleans[0])) 1141 + (NUM_NUMBERS(term) * sizeof(term->Numbers[0]))); 1142 1143 (void) printf("static char * %s[] = %s\n", name_initializer("string"), L_CURL); 1144 1145 for_each_string(n, term) { 1146 1147 if (term->Strings[n] == ABSENT_STRING) 1148 str = "ABSENT_STRING"; 1149 else if (term->Strings[n] == CANCELLED_STRING) 1150 str = "CANCELLED_STRING"; 1151 else { 1152 str = string_variable(ExtStrname(term, n, strnames)); 1153 } 1154 (void) printf("\t/* %3u: %-8s */\t%s,\n", n, 1155 ExtStrname(term, n, strnames), str); 1156 } 1157 (void) printf("%s;\n", R_CURL); 1158 1159 #if NCURSES_XNAMES 1160 if ((NUM_BOOLEANS(term) != BOOLCOUNT) 1161 || (NUM_NUMBERS(term) != NUMCOUNT) 1162 || (NUM_STRINGS(term) != STRCOUNT)) { 1163 (void) printf("static char * %s[] = %s\n", 1164 name_initializer("string_ext"), L_CURL); 1165 for (n = BOOLCOUNT; n < NUM_BOOLEANS(term); ++n) { 1166 (void) printf("\t/* %3u: bool */\t\"%s\",\n", 1167 n, ExtBoolname(term, n, boolnames)); 1168 } 1169 for (n = NUMCOUNT; n < NUM_NUMBERS(term); ++n) { 1170 (void) printf("\t/* %3u: num */\t\"%s\",\n", 1171 n, ExtNumname(term, n, numnames)); 1172 } 1173 for (n = STRCOUNT; n < NUM_STRINGS(term); ++n) { 1174 (void) printf("\t/* %3u: str */\t\"%s\",\n", 1175 n, ExtStrname(term, n, strnames)); 1176 } 1177 (void) printf("%s;\n", R_CURL); 1178 } 1179 #endif 1180 } 1181 1182 /* dump C initializers for the terminal type */ 1183 static void 1184 dump_termtype(TERMTYPE *term) 1185 { 1186 (void) printf("\t%s\n\t\t%s,\n", L_CURL, name_initializer("alias")); 1187 (void) printf("\t\t(char *)0,\t/* pointer to string table */\n"); 1188 1189 (void) printf("\t\t%s,\n", name_initializer("bool")); 1190 (void) printf("\t\t%s,\n", name_initializer("number")); 1191 1192 (void) printf("\t\t%s,\n", name_initializer("string")); 1193 1194 #if NCURSES_XNAMES 1195 (void) printf("#if NCURSES_XNAMES\n"); 1196 (void) printf("\t\t(char *)0,\t/* pointer to extended string table */\n"); 1197 (void) printf("\t\t%s,\t/* ...corresponding names */\n", 1198 ((NUM_BOOLEANS(term) != BOOLCOUNT) 1199 || (NUM_NUMBERS(term) != NUMCOUNT) 1200 || (NUM_STRINGS(term) != STRCOUNT)) 1201 ? name_initializer("string_ext") 1202 : "(char **)0"); 1203 1204 (void) printf("\t\t%d,\t\t/* count total Booleans */\n", NUM_BOOLEANS(term)); 1205 (void) printf("\t\t%d,\t\t/* count total Numbers */\n", NUM_NUMBERS(term)); 1206 (void) printf("\t\t%d,\t\t/* count total Strings */\n", NUM_STRINGS(term)); 1207 1208 (void) printf("\t\t%d,\t\t/* count extensions to Booleans */\n", 1209 NUM_BOOLEANS(term) - BOOLCOUNT); 1210 (void) printf("\t\t%d,\t\t/* count extensions to Numbers */\n", 1211 NUM_NUMBERS(term) - NUMCOUNT); 1212 (void) printf("\t\t%d,\t\t/* count extensions to Strings */\n", 1213 NUM_STRINGS(term) - STRCOUNT); 1214 1215 (void) printf("#endif /* NCURSES_XNAMES */\n"); 1216 #endif /* NCURSES_XNAMES */ 1217 (void) printf("\t%s\n", R_CURL); 1218 } 1219 1220 static int 1221 optarg_to_number(void) 1222 { 1223 char *temp = 0; 1224 long value = strtol(optarg, &temp, 0); 1225 1226 if (temp == 0 || temp == optarg || *temp != 0) { 1227 fprintf(stderr, "Expected a number, not \"%s\"\n", optarg); 1228 ExitProgram(EXIT_FAILURE); 1229 } 1230 return (int) value; 1231 } 1232 1233 static char * 1234 terminal_env(void) 1235 { 1236 char *terminal; 1237 1238 if ((terminal = getenv("TERM")) == 0) { 1239 (void) fprintf(stderr, 1240 "infocmp: environment variable TERM not set\n"); 1241 exit(EXIT_FAILURE); 1242 } 1243 return terminal; 1244 } 1245 1246 /*************************************************************************** 1247 * 1248 * Main sequence 1249 * 1250 ***************************************************************************/ 1251 1252 int 1253 main(int argc, char *argv[]) 1254 { 1255 char *firstdir, *restdir; 1256 /* Avoid "local data >32k" error with mwcc */ 1257 /* Also avoid overflowing smaller stacks on systems like AmigaOS */ 1258 path *tfile = (path *) malloc(sizeof(path) * MAXTERMS); 1259 int c, i, len; 1260 bool formatted = FALSE; 1261 bool filecompare = FALSE; 1262 int initdump = 0; 1263 bool init_analyze = FALSE; 1264 bool suppress_untranslatable = FALSE; 1265 1266 /* where is the terminfo database location going to default to? */ 1267 restdir = firstdir = 0; 1268 1269 #if NCURSES_XNAMES 1270 use_extended_names(FALSE); 1271 #endif 1272 1273 while ((c = getopt(argc, 1274 argv, 1275 "1A:aB:CcdEeFfGgIiLlnpqR:rs:TtUuVv:w:x")) != EOF) { 1276 switch (c) { 1277 case '1': 1278 mwidth = 0; 1279 break; 1280 1281 case 'A': 1282 firstdir = optarg; 1283 break; 1284 1285 #if NCURSES_XNAMES 1286 case 'a': 1287 _nc_disable_period = TRUE; 1288 use_extended_names(TRUE); 1289 break; 1290 #endif 1291 case 'B': 1292 restdir = optarg; 1293 break; 1294 1295 case 'C': 1296 outform = F_TERMCAP; 1297 tversion = "BSD"; 1298 if (sortmode == S_DEFAULT) 1299 sortmode = S_TERMCAP; 1300 break; 1301 1302 case 'c': 1303 compare = C_COMMON; 1304 break; 1305 1306 case 'd': 1307 compare = C_DIFFERENCE; 1308 break; 1309 1310 case 'E': 1311 initdump |= 2; 1312 break; 1313 1314 case 'e': 1315 initdump |= 1; 1316 break; 1317 1318 case 'F': 1319 filecompare = TRUE; 1320 break; 1321 1322 case 'f': 1323 formatted = TRUE; 1324 break; 1325 1326 case 'G': 1327 numbers = 1; 1328 break; 1329 1330 case 'g': 1331 numbers = -1; 1332 break; 1333 1334 case 'I': 1335 outform = F_TERMINFO; 1336 if (sortmode == S_DEFAULT) 1337 sortmode = S_VARIABLE; 1338 tversion = 0; 1339 break; 1340 1341 case 'i': 1342 init_analyze = TRUE; 1343 break; 1344 1345 case 'L': 1346 outform = F_VARIABLE; 1347 if (sortmode == S_DEFAULT) 1348 sortmode = S_VARIABLE; 1349 break; 1350 1351 case 'l': 1352 outform = F_TERMINFO; 1353 break; 1354 1355 case 'n': 1356 compare = C_NAND; 1357 break; 1358 1359 case 'p': 1360 ignorepads = TRUE; 1361 break; 1362 1363 case 'q': 1364 quiet = TRUE; 1365 s_absent = "-"; 1366 s_cancel = "@"; 1367 bool_sep = ", "; 1368 break; 1369 1370 case 'R': 1371 tversion = optarg; 1372 break; 1373 1374 case 'r': 1375 tversion = 0; 1376 limited = FALSE; 1377 break; 1378 1379 case 's': 1380 if (*optarg == 'd') 1381 sortmode = S_NOSORT; 1382 else if (*optarg == 'i') 1383 sortmode = S_TERMINFO; 1384 else if (*optarg == 'l') 1385 sortmode = S_VARIABLE; 1386 else if (*optarg == 'c') 1387 sortmode = S_TERMCAP; 1388 else { 1389 (void) fprintf(stderr, 1390 "infocmp: unknown sort mode\n"); 1391 ExitProgram(EXIT_FAILURE); 1392 } 1393 break; 1394 1395 case 'T': 1396 limited = FALSE; 1397 break; 1398 1399 #if NCURSES_XNAMES 1400 case 't': 1401 _nc_disable_period = FALSE; 1402 suppress_untranslatable = TRUE; 1403 break; 1404 #endif 1405 1406 case 'U': 1407 literal = TRUE; 1408 break; 1409 1410 case 'u': 1411 compare = C_USEALL; 1412 break; 1413 1414 case 'V': 1415 puts(curses_version()); 1416 ExitProgram(EXIT_SUCCESS); 1417 1418 case 'v': 1419 itrace = optarg_to_number(); 1420 set_trace_level(itrace); 1421 break; 1422 1423 case 'w': 1424 mwidth = optarg_to_number(); 1425 break; 1426 1427 #if NCURSES_XNAMES 1428 case 'x': 1429 use_extended_names(TRUE); 1430 break; 1431 #endif 1432 1433 default: 1434 usage(); 1435 } 1436 } 1437 1438 /* by default, sort by terminfo name */ 1439 if (sortmode == S_DEFAULT) 1440 sortmode = S_TERMINFO; 1441 1442 /* set up for display */ 1443 dump_init(tversion, outform, sortmode, mwidth, itrace, formatted); 1444 1445 /* make sure we have at least one terminal name to work with */ 1446 if (optind >= argc) 1447 argv[argc++] = terminal_env(); 1448 1449 /* if user is after a comparison, make sure we have two entries */ 1450 if (compare != C_DEFAULT && optind >= argc - 1) 1451 argv[argc++] = terminal_env(); 1452 1453 /* exactly two terminal names with no options means do -d */ 1454 if (argc - optind == 2 && compare == C_DEFAULT) 1455 compare = C_DIFFERENCE; 1456 1457 if (!filecompare) { 1458 /* grab the entries */ 1459 termcount = 0; 1460 for (; optind < argc; optind++) { 1461 if (termcount >= MAXTERMS) { 1462 (void) fprintf(stderr, 1463 "infocmp: too many terminal type arguments\n"); 1464 ExitProgram(EXIT_FAILURE); 1465 } else { 1466 const char *directory = termcount ? restdir : firstdir; 1467 int status; 1468 1469 tname[termcount] = argv[optind]; 1470 1471 if (directory) { 1472 #if USE_DATABASE 1473 (void) sprintf(tfile[termcount], "%s/%c/%s", 1474 directory, 1475 *argv[optind], argv[optind]); 1476 if (itrace) 1477 (void) fprintf(stderr, 1478 "infocmp: reading entry %s from file %s\n", 1479 argv[optind], tfile[termcount]); 1480 1481 status = _nc_read_file_entry(tfile[termcount], 1482 &entries[termcount].tterm); 1483 #else 1484 (void) fprintf(stderr, "terminfo files not supported\n"); 1485 ExitProgram(EXIT_FAILURE); 1486 #endif 1487 } else { 1488 if (itrace) 1489 (void) fprintf(stderr, 1490 "infocmp: reading entry %s from database\n", 1491 tname[termcount]); 1492 1493 status = _nc_read_entry(tname[termcount], 1494 tfile[termcount], 1495 &entries[termcount].tterm); 1496 directory = TERMINFO; /* for error message */ 1497 } 1498 1499 if (status <= 0) { 1500 (void) fprintf(stderr, 1501 "infocmp: couldn't open terminfo file %s.\n", 1502 tfile[termcount]); 1503 ExitProgram(EXIT_FAILURE); 1504 } 1505 repair_acsc(&entries[termcount].tterm); 1506 termcount++; 1507 } 1508 } 1509 1510 #if NCURSES_XNAMES 1511 if (termcount > 1) 1512 _nc_align_termtype(&entries[0].tterm, &entries[1].tterm); 1513 #endif 1514 1515 /* dump as C initializer for the terminal type */ 1516 if (initdump) { 1517 if (initdump & 1) 1518 dump_termtype(&entries[0].tterm); 1519 if (initdump & 2) 1520 dump_initializers(&entries[0].tterm); 1521 } 1522 1523 /* analyze the init strings */ 1524 else if (init_analyze) { 1525 #undef CUR 1526 #define CUR entries[0].tterm. 1527 analyze_string("is1", init_1string, &entries[0].tterm); 1528 analyze_string("is2", init_2string, &entries[0].tterm); 1529 analyze_string("is3", init_3string, &entries[0].tterm); 1530 analyze_string("rs1", reset_1string, &entries[0].tterm); 1531 analyze_string("rs2", reset_2string, &entries[0].tterm); 1532 analyze_string("rs3", reset_3string, &entries[0].tterm); 1533 analyze_string("smcup", enter_ca_mode, &entries[0].tterm); 1534 analyze_string("rmcup", exit_ca_mode, &entries[0].tterm); 1535 #undef CUR 1536 } else { 1537 1538 /* 1539 * Here's where the real work gets done 1540 */ 1541 switch (compare) { 1542 case C_DEFAULT: 1543 if (itrace) 1544 (void) fprintf(stderr, 1545 "infocmp: about to dump %s\n", 1546 tname[0]); 1547 (void) printf("#\tReconstructed via infocmp from file: %s\n", 1548 tfile[0]); 1549 dump_entry(&entries[0].tterm, 1550 suppress_untranslatable, 1551 limited, 1552 numbers, 1553 NULL); 1554 len = show_entry(); 1555 if (itrace) 1556 (void) fprintf(stderr, "infocmp: length %d\n", len); 1557 break; 1558 1559 case C_DIFFERENCE: 1560 if (itrace) 1561 (void) fprintf(stderr, "infocmp: dumping differences\n"); 1562 (void) printf("comparing %s to %s.\n", tname[0], tname[1]); 1563 compare_entry(compare_predicate, &entries->tterm, quiet); 1564 break; 1565 1566 case C_COMMON: 1567 if (itrace) 1568 (void) fprintf(stderr, 1569 "infocmp: dumping common capabilities\n"); 1570 (void) printf("comparing %s to %s.\n", tname[0], tname[1]); 1571 compare_entry(compare_predicate, &entries->tterm, quiet); 1572 break; 1573 1574 case C_NAND: 1575 if (itrace) 1576 (void) fprintf(stderr, 1577 "infocmp: dumping differences\n"); 1578 (void) printf("comparing %s to %s.\n", tname[0], tname[1]); 1579 compare_entry(compare_predicate, &entries->tterm, quiet); 1580 break; 1581 1582 case C_USEALL: 1583 if (itrace) 1584 (void) fprintf(stderr, "infocmp: dumping use entry\n"); 1585 dump_entry(&entries[0].tterm, 1586 suppress_untranslatable, 1587 limited, 1588 numbers, 1589 use_predicate); 1590 for (i = 1; i < termcount; i++) 1591 dump_uses(tname[i], !(outform == F_TERMCAP 1592 || outform == F_TCONVERR)); 1593 len = show_entry(); 1594 if (itrace) 1595 (void) fprintf(stderr, "infocmp: length %d\n", len); 1596 break; 1597 } 1598 } 1599 } else if (compare == C_USEALL) 1600 (void) fprintf(stderr, "Sorry, -u doesn't work with -F\n"); 1601 else if (compare == C_DEFAULT) 1602 (void) fprintf(stderr, "Use `tic -[CI] <file>' for this.\n"); 1603 else if (argc - optind != 2) 1604 (void) fprintf(stderr, 1605 "File comparison needs exactly two file arguments.\n"); 1606 else 1607 file_comparison(argc - optind, argv + optind); 1608 1609 free(tfile); 1610 ExitProgram(EXIT_SUCCESS); 1611 } 1612 1613 /* infocmp.c ends here */ 1614