1 /****************************************************************************
2 * Copyright (c) 1998-2010,2011 Free Software Foundation, Inc. *
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: *
12 * The above copyright notice and this permission notice shall be included *
13 * in all copies or substantial portions of the Software. *
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. *
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 *
27 ****************************************************************************/
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 ****************************************************************************/
36 * tic.c --- Main program for terminfo compiler
41 #include <progs.priv.h>
44 #include <dump_entry.h>
45 #include <transform.h>
47 MODULE_ID("$Id: tic.c,v 1.147 2011/02/12 18:39:08 tom Exp $")
49 const char *_nc_progname = "tic";
53 static bool capdump = FALSE; /* running as infotocap? */
54 static bool infodump = FALSE; /* running as captoinfo? */
55 static bool showsummary = FALSE;
56 static const char *to_remove;
58 static void (*save_check_termtype) (TERMTYPE *, bool);
59 static void check_termtype(TERMTYPE *tt, bool);
61 static const char usage_string[] = "\
90 free_namelist(char **src)
94 for (n = 0; src[n] != 0; ++n)
102 cleanup(char **namelst GCC_UNUSED)
105 free_namelist(namelst);
109 if (to_remove != 0) {
119 failed(const char *msg)
122 cleanup((char **) 0);
123 ExitProgram(EXIT_FAILURE);
129 static const char *const tbl[] =
132 " -1 format translation output one capability per line",
134 " -a retain commented-out capabilities (sets -x also)",
136 " -C translate entries to termcap source form",
137 " -c check only, validate input without compiling or translating",
138 " -e<names> translate/compile only entries named by comma-separated list",
139 " -f format complex strings for readability",
140 " -G format %{number} to %'char'",
141 " -g format %'char' to %{number}",
142 " -I translate entries to terminfo source form",
143 " -L translate entries to full terminfo source form",
144 " -N disable smart defaults for source translation",
145 " -o<dir> set output directory for compiled entry writes",
146 " -R<name> restrict translation to given terminfo/termcap version",
147 " -r force resolution of all use entries in source translation",
148 " -s print summary statistics",
149 " -T remove size-restrictions on compiled description",
151 " -t suppress commented-out capabilities",
153 " -U suppress post-processing of entries",
155 " -v[n] set verbosity level",
156 " -w[n] set format width for translation output",
158 " -x treat unknown capabilities as user-defined",
162 " <file> file to translate or compile"
166 fprintf(stderr, "Usage: %s %s\n", _nc_progname, usage_string);
167 for (j = 0; j < SIZEOF(tbl); j++) {
168 fputs(tbl[j], stderr);
171 ExitProgram(EXIT_FAILURE);
176 #define S_QUOTE '\'';
184 char result[MAX_ENTRY_SIZE];
187 * Look for strings that contain %{number}, convert them to %'char',
188 * which is shorter and runs a little faster.
190 for (n = 0; n < STRCOUNT; n++) {
191 s = ep->tterm.Strings[n];
193 && strchr(s, L_BRACE) != 0) {
196 while ((ch = *t++) != 0) {
200 } else if ((ch == '%')
201 && (*t == L_BRACE)) {
203 long value = strtol(t + 1, &v, 0);
207 && value != '\\' /* FIXME */
209 && isprint((int) value)) {
218 if (strlen(result) < strlen(s))
223 _nc_set_type(_nc_first_name(ep->tterm.term_names));
224 _nc_curr_line = ep->startline;
225 _nc_write_entry(&ep->tterm);
229 immedhook(ENTRY * ep GCC_UNUSED)
230 /* write out entries with no use capabilities immediately to save storage */
234 * This is strictly a core-economy kluge. The really clean way to handle
235 * compilation is to slurp the whole file into core and then do all the
236 * name-collision checks and entry writes in one swell foop. But the
237 * terminfo master file is large enough that some core-poor systems swap
238 * like crazy when you compile it this way...there have been reports of
239 * this process taking *three hours*, rather than the twenty seconds or
240 * less typical on my development box.
242 * So. This hook *immediately* writes out the referenced entry if it
243 * has no use capabilities. The compiler main loop refrains from
244 * adding the entry to the in-core list when this hook fires. If some
245 * other entry later needs to reference an entry that got written
246 * immediately, that's OK; the resolution code will fetch it off disk
247 * when it can't find it in core.
249 * Name collisions will still be detected, just not as cleanly. The
250 * write_entry() code complains before overwriting an entry that
251 * postdates the time of tic's first call to write_entry(). Thus
252 * it will complain about overwriting entries newly made during the
253 * tic run, but not about overwriting ones that predate it.
255 * The reason this is a hook, and not in line with the rest of the
256 * compiler code, is that the support for termcap fallback cannot assume
257 * it has anywhere to spool out these entries!
259 * The _nc_set_type() call here requires a compensating one in
262 * If you define HAVE_BIG_CORE, you'll disable this kluge. This will
263 * make tic a bit faster (because the resolution code won't have to do
264 * disk I/O nearly as often).
266 if (ep->nuses == 0) {
267 int oldline = _nc_curr_line;
270 _nc_curr_line = oldline;
271 free(ep->tterm.str_table);
274 #endif /* HAVE_BIG_CORE */
280 /* emit a comment char, translating terminfo names to termcap names */
282 static bool in_name = FALSE;
283 static size_t have, used;
284 static char *namebuf, *suffix;
287 if (used + 1 >= have) {
289 namebuf = typeRealloc(char, have, namebuf);
290 suffix = typeRealloc(char, have, suffix);
292 if (c == '\n' || c == '@') {
293 namebuf[used++] = '\0';
295 (void) fputs(namebuf, stdout);
298 } else if (c != '>') {
299 namebuf[used++] = (char) c;
300 } else { /* ah! candidate name! */
302 NCURSES_CONST char *tp;
304 namebuf[used++] = '\0';
308 if ((up = strchr(namebuf, '#')) != 0
309 || (up = strchr(namebuf, '=')) != 0
310 || ((up = strchr(namebuf, '@')) != 0 && up[1] == '>')) {
311 (void) strcpy(suffix, up);
315 if ((tp = nametrans(namebuf)) != 0) {
317 (void) fputs(tp, stdout);
318 (void) fputs(suffix, stdout);
321 /* couldn't find a translation, just dump the name */
323 (void) fputs(namebuf, stdout);
324 (void) fputs(suffix, stdout);
338 /* Returns a string, stripped of leading/trailing whitespace */
342 while (isspace(UChar(*src)))
348 if ((dst = strdup(src)) == NULL)
354 while (--len != 0 && isspace(UChar(dst[len])))
362 open_input(const char *filename)
364 FILE *fp = fopen(filename, "r");
368 fprintf(stderr, "%s: Can't open %s\n", _nc_progname, filename);
369 ExitProgram(EXIT_FAILURE);
371 if (fstat(fileno(fp), &sb) < 0
372 || (sb.st_mode & S_IFMT) != S_IFREG) {
373 fprintf(stderr, "%s: %s is not a file\n", _nc_progname, filename);
374 ExitProgram(EXIT_FAILURE);
379 /* Parse the "-e" option-value into a list of names */
381 make_namelist(char *src)
386 unsigned pass, n, nn;
391 } else if (strchr(src, '/') != 0) { /* a filename */
392 FILE *fp = open_input(src);
394 for (pass = 1; pass <= 2; pass++) {
396 while (fgets(buffer, sizeof(buffer), fp) != 0) {
397 if ((s = stripped(buffer)) != 0) {
406 dst = typeCalloc(char *, nn + 1);
411 } else { /* literal list of names */
412 for (pass = 1; pass <= 2; pass++) {
413 for (n = nn = 0, base = src;; n++) {
415 if (mark == ',' || mark == '\0') {
420 if ((s = stripped(base)) != 0)
429 dst = typeCalloc(char *, nn + 1);
432 if (showsummary && (dst != 0)) {
433 fprintf(log_fp, "Entries that will be compiled:\n");
434 for (n = 0; dst[n] != 0; n++)
435 fprintf(log_fp, "%u:%s\n", n + 1, dst[n]);
441 matches(char **needle, const char *haystack)
442 /* does entry in needle list match |-separated field in haystack? */
448 for (n = 0; needle[n] != 0; n++) {
449 if (_nc_name_match(haystack, needle[n], "|")) {
460 open_tempfile(char *name)
464 int fd = mkstemp(name);
466 result = fdopen(fd, "w");
468 if (tmpnam(name) != 0)
469 result = fopen(name, "w");
475 main(int argc, char *argv[])
477 char my_tmpname[PATH_MAX];
478 int v_opt = -1, debug_level;
479 int smart_defaults = TRUE;
483 int this_opt, last_opt = '?';
485 int outform = F_TERMINFO; /* output format */
486 int sortmode = S_TERMINFO; /* sort_mode */
489 bool formatted = FALSE; /* reformat complex strings? */
490 bool literal = FALSE; /* suppress post-processing? */
491 int numbers = 0; /* format "%'char'" to/from "%{number}" */
492 bool forceresolve = FALSE; /* force resolution */
494 char *tversion = (char *) NULL;
495 const char *source_file = "terminfo";
497 char *outdir = (char *) NULL;
498 bool check_only = FALSE;
499 bool suppress_untranslatable = FALSE;
503 _nc_progname = _nc_rootname(argv[0]);
505 if ((infodump = same_program(_nc_progname, PROG_CAPTOINFO)) != FALSE) {
506 outform = F_TERMINFO;
507 sortmode = S_TERMINFO;
509 if ((capdump = same_program(_nc_progname, PROG_INFOTOCAP)) != FALSE) {
511 sortmode = S_TERMCAP;
514 use_extended_names(FALSE);
518 * Processing arguments is a little complicated, since someone made a
519 * design decision to allow the numeric values for -w, -v options to
522 while ((this_opt = getopt(argc, argv,
523 "0123456789CILNR:TUVace:fGgo:rstvwx")) != -1) {
524 if (isdigit(this_opt)) {
527 v_opt = (v_opt * 10) + (this_opt - '0');
530 width = (width * 10) + (this_opt - '0');
544 sortmode = S_TERMCAP;
548 outform = F_TERMINFO;
549 sortmode = S_TERMINFO;
553 outform = F_VARIABLE;
554 sortmode = S_VARIABLE;
557 smart_defaults = FALSE;
570 puts(curses_version());
572 ExitProgram(EXIT_SUCCESS);
577 namelst = make_namelist(optarg);
605 _nc_disable_period = FALSE;
606 suppress_untranslatable = TRUE;
609 _nc_disable_period = TRUE;
612 use_extended_names(TRUE);
621 debug_level = (v_opt > 0) ? v_opt : (v_opt == 0);
622 set_trace_level(debug_level);
625 save_check_termtype = _nc_check_termtype2;
626 _nc_check_termtype2 = check_termtype;
630 * Aaargh! immedhook seriously hoses us!
632 * One problem with immedhook is it means we can't do -e. Problem
633 * is that we can't guarantee that for each terminal listed, all the
634 * terminals it depends on will have been kept in core for reference
635 * resolution -- in fact it's certain the primitive types at the end
636 * of reference chains *won't* be in core unless they were explicitly
637 * in the select list themselves.
639 if (namelst && (!infodump && !capdump)) {
640 (void) fprintf(stderr,
641 "Sorry, -e can't be used without -I or -C\n");
643 ExitProgram(EXIT_FAILURE);
645 #endif /* HAVE_BIG_CORE */
648 source_file = argv[optind++];
651 "%s: Too many file names. Usage:\n\t%s %s",
655 ExitProgram(EXIT_FAILURE);
658 if (infodump == TRUE) {
659 /* captoinfo's no-argument case */
660 source_file = "/etc/termcap";
661 if ((termcap = getenv("TERMCAP")) != 0
662 && (namelst = make_namelist(getenv("TERM"))) != 0) {
663 if (access(termcap, F_OK) == 0) {
665 source_file = termcap;
666 } else if ((tmp_fp = open_tempfile(strcpy(my_tmpname,
669 source_file = my_tmpname;
670 fprintf(tmp_fp, "%s\n", termcap);
672 tmp_fp = open_input(source_file);
673 to_remove = source_file;
681 "%s: File name needed. Usage:\n\t%s %s",
686 ExitProgram(EXIT_FAILURE);
691 tmp_fp = open_input(source_file);
698 sortmode, width, debug_level, formatted);
702 sortmode, width, debug_level, FALSE);
704 /* parse entries out of the source file */
705 _nc_set_source(source_file);
707 if (!(check_only || infodump || capdump))
708 _nc_set_writedir(outdir);
709 #endif /* HAVE_BIG_CORE */
710 _nc_read_entry_source(tmp_fp, (char *) NULL,
711 !smart_defaults || literal, FALSE,
712 ((check_only || infodump || capdump)
716 /* do use resolution */
717 if (check_only || (!infodump && !capdump) || forceresolve) {
718 if (!_nc_resolve_uses2(TRUE, literal) && !check_only) {
720 ExitProgram(EXIT_FAILURE);
725 if (check_only && (capdump || infodump)) {
727 if (matches(namelst, qp->tterm.term_names)) {
728 int len = fmt_entry(&qp->tterm, NULL, FALSE, TRUE, infodump, numbers);
730 if (len > (infodump ? MAX_TERMINFO_LENGTH : MAX_TERMCAP_LENGTH))
731 (void) fprintf(stderr,
732 "warning: resolved %s entry is %d bytes long\n",
733 _nc_first_name(qp->tterm.term_names),
739 /* write or dump all entries */
741 if (!infodump && !capdump) {
742 _nc_set_writedir(outdir);
744 if (matches(namelst, qp->tterm.term_names))
748 /* this is in case infotocap() generates warnings */
749 _nc_curr_col = _nc_curr_line = -1;
752 if (matches(namelst, qp->tterm.term_names)) {
753 int j = qp->cend - qp->cstart;
756 /* this is in case infotocap() generates warnings */
757 _nc_set_type(_nc_first_name(qp->tterm.term_names));
759 (void) fseek(tmp_fp, qp->cstart, SEEK_SET);
762 (void) putchar(fgetc(tmp_fp));
764 put_translate(fgetc(tmp_fp));
767 repair_acsc(&qp->tterm);
768 dump_entry(&qp->tterm, suppress_untranslatable,
769 limited, numbers, NULL);
770 for (j = 0; j < (int) qp->nuses; j++)
771 dump_uses(qp->uses[j].name, !capdump);
773 if (debug_level != 0 && !limited)
774 printf("# length=%d\n", len);
777 if (!namelst && _nc_tail) {
779 bool in_comment = FALSE;
780 bool trailing_comment = FALSE;
782 (void) fseek(tmp_fp, _nc_tail->cend, SEEK_SET);
783 while ((c = fgetc(tmp_fp)) != EOF) {
786 trailing_comment = TRUE;
793 && (in_comment || (oldc == '\n' && c == '\n')))
801 /* Show the directory into which entries were written, and the total
805 && (!(check_only || infodump || capdump))) {
806 int total = _nc_tic_written();
808 fprintf(log_fp, "%d entries written to %s\n",
810 _nc_tic_dir((char *) 0));
812 fprintf(log_fp, "No entries written\n");
815 ExitProgram(EXIT_SUCCESS);
819 * This bit of legerdemain turns all the terminfo variable names into
820 * references to locations in the arrays Booleans, Numbers, and Strings ---
821 * precisely what's needed (see comp_parse.c).
827 * Check if the alternate character-set capabilities are consistent.
830 check_acs(TERMTYPE *tp)
832 if (VALID_STRING(acs_chars)) {
833 const char *boxes = "lmkjtuvwqxn";
839 memset(mapped, 0, sizeof(mapped));
840 for (p = acs_chars; *p != '\0'; p += 2) {
842 _nc_warning("acsc has odd number of characters");
845 mapped[UChar(p[0])] = p[1];
848 if (mapped[UChar('I')] && !mapped[UChar('i')]) {
849 _nc_warning("acsc refers to 'I', which is probably an error");
852 for (p = boxes, q = missing; *p != '\0'; ++p) {
853 if (!mapped[UChar(p[0])]) {
859 assert(strlen(missing) <= strlen(boxes));
860 if (*missing != '\0' && strcmp(missing, boxes)) {
861 _nc_warning("acsc is missing some line-drawing mapping: %s", missing);
867 * Check if the color capabilities are consistent
870 check_colors(TERMTYPE *tp)
872 if ((max_colors > 0) != (max_pairs > 0)
873 || ((max_colors > max_pairs) && (initialize_pair == 0)))
874 _nc_warning("inconsistent values for max_colors (%d) and max_pairs (%d)",
875 max_colors, max_pairs);
877 PAIRED(set_foreground, set_background);
878 PAIRED(set_a_foreground, set_a_background);
879 PAIRED(set_color_pair, initialize_pair);
881 if (VALID_STRING(set_foreground)
882 && VALID_STRING(set_a_foreground)
883 && !_nc_capcmp(set_foreground, set_a_foreground))
884 _nc_warning("expected setf/setaf to be different");
886 if (VALID_STRING(set_background)
887 && VALID_STRING(set_a_background)
888 && !_nc_capcmp(set_background, set_a_background))
889 _nc_warning("expected setb/setab to be different");
891 /* see: has_colors() */
892 if (VALID_NUMERIC(max_colors) && VALID_NUMERIC(max_pairs)
893 && (((set_foreground != NULL)
894 && (set_background != NULL))
895 || ((set_a_foreground != NULL)
896 && (set_a_background != NULL))
897 || set_color_pair)) {
898 if (!VALID_STRING(orig_pair) && !VALID_STRING(orig_colors))
899 _nc_warning("expected either op/oc string for resetting colors");
904 keypad_final(const char *string)
908 if (VALID_STRING(string)
909 && *string++ == '\033'
911 && strlen(string) == 1) {
919 keypad_index(const char *string)
922 const char *list = "PQRSwxymtuvlqrsPpn"; /* app-keypad except "Enter" */
926 if ((ch = keypad_final(string)) != '\0') {
927 test = strchr(list, ch);
929 result = (test - list);
935 * list[] is down, up, left, right
936 * "left" may be ^H rather than \E[D
937 * "down" may be ^J rather than \E[B
938 * But up/right are generally consistently escape sequences for ANSI terminals.
941 check_ansi_cursor(char *list[4])
948 bool repeated = FALSE;
950 for (j = 0; j < 4; ++j) {
952 for (k = 0; k < j; ++k) {
954 && !strcmp(list[j], list[k])) {
955 char *value = _nc_tic_expand(list[k], TRUE, 0);
956 _nc_warning("repeated cursor control %s\n", value);
964 if (UChar(up[0]) == '\033') {
970 } else if (UChar(up[0]) == UChar('\233')) {
975 while (up[suffix] && isdigit(UChar(up[suffix])))
978 if (prefix && up[suffix] == 'A') {
980 if (!strcmp(list[0], "\n"))
982 if (!strcmp(list[2], "\b"))
985 for (j = 0; j < 4; ++j) {
986 if (skip[j] || strlen(list[j]) == 1)
988 if (memcmp(list[j], up, prefix)) {
989 char *value = _nc_tic_expand(list[j], TRUE, 0);
990 _nc_warning("inconsistent prefix for %s\n", value);
993 if (strlen(list[j]) < suffix) {
994 char *value = _nc_tic_expand(list[j], TRUE, 0);
995 _nc_warning("inconsistent length for %s, expected %d\n",
996 value, (int) suffix + 1);
1000 if (list[j][suffix] != want) {
1001 char *value = _nc_tic_expand(list[j], TRUE, 0);
1002 _nc_warning("inconsistent suffix for %s, expected %c, have %c\n",
1003 value, want, list[j][suffix]);
1010 #define EXPECTED(name) if (!PRESENT(name)) _nc_warning("expected " #name)
1013 check_cursor(TERMTYPE *tp)
1018 /* if we have a parameterized form, then the non-parameterized is easy */
1019 ANDMISSING(parm_down_cursor, cursor_down);
1020 ANDMISSING(parm_up_cursor, cursor_up);
1021 ANDMISSING(parm_left_cursor, cursor_left);
1022 ANDMISSING(parm_right_cursor, cursor_right);
1024 /* Given any of a set of cursor movement, the whole set should be present.
1025 * Technically this is not true (we could use cursor_address to fill in
1026 * unsupported controls), but it is likely.
1029 if (PRESENT(parm_down_cursor)) {
1030 list[count++] = parm_down_cursor;
1032 if (PRESENT(parm_up_cursor)) {
1033 list[count++] = parm_up_cursor;
1035 if (PRESENT(parm_left_cursor)) {
1036 list[count++] = parm_left_cursor;
1038 if (PRESENT(parm_right_cursor)) {
1039 list[count++] = parm_right_cursor;
1042 check_ansi_cursor(list);
1043 } else if (count != 0) {
1044 EXPECTED(parm_down_cursor);
1045 EXPECTED(parm_up_cursor);
1046 EXPECTED(parm_left_cursor);
1047 EXPECTED(parm_right_cursor);
1051 if (PRESENT(cursor_down)) {
1052 list[count++] = cursor_down;
1054 if (PRESENT(cursor_up)) {
1055 list[count++] = cursor_up;
1057 if (PRESENT(cursor_left)) {
1058 list[count++] = cursor_left;
1060 if (PRESENT(cursor_right)) {
1061 list[count++] = cursor_right;
1064 check_ansi_cursor(list);
1065 } else if (count != 0) {
1067 if (PRESENT(cursor_down) && strcmp(cursor_down, "\n"))
1069 if (PRESENT(cursor_left) && strcmp(cursor_left, "\b"))
1071 if (PRESENT(cursor_up) && strlen(cursor_up) > 1)
1073 if (PRESENT(cursor_right) && strlen(cursor_right) > 1)
1076 EXPECTED(cursor_down);
1077 EXPECTED(cursor_up);
1078 EXPECTED(cursor_left);
1079 EXPECTED(cursor_right);
1086 * Do a quick sanity-check for vt100-style keypads to see if the 5-key keypad
1087 * is mapped inconsistently.
1090 check_keypad(TERMTYPE *tp)
1094 if (VALID_STRING(key_a1) &&
1095 VALID_STRING(key_a3) &&
1096 VALID_STRING(key_b2) &&
1097 VALID_STRING(key_c1) &&
1098 VALID_STRING(key_c3)) {
1099 char final[MAX_KP + 1];
1106 final[0] = keypad_final(key_a1);
1107 final[1] = keypad_final(key_a3);
1108 final[2] = keypad_final(key_b2);
1109 final[3] = keypad_final(key_c1);
1110 final[4] = keypad_final(key_c3);
1113 /* special case: legacy coding using 1,2,3,0,. on the bottom */
1114 assert(strlen(final) <= MAX_KP);
1115 if (!strcmp(final, "qsrpn"))
1118 list[0] = keypad_index(key_a1);
1119 list[1] = keypad_index(key_a3);
1120 list[2] = keypad_index(key_b2);
1121 list[3] = keypad_index(key_c1);
1122 list[4] = keypad_index(key_c3);
1124 /* check that they're all vt100 keys */
1125 for (j = 0; j < MAX_KP; ++j) {
1131 /* check if they're all in increasing order */
1132 for (j = 1; j < MAX_KP; ++j) {
1133 if (list[j] > list[j - 1]) {
1137 if (increase != (MAX_KP - 1)) {
1140 for (j = 0, last = -1; j < MAX_KP; ++j) {
1141 for (k = 0, kk = -1, test = 100; k < 5; ++k) {
1142 if (list[k] > last &&
1149 assert(strlen(show) < (MAX_KP * 4));
1152 strcat(show, " ka1");
1155 strcat(show, " ka3");
1158 strcat(show, " kb2");
1161 strcat(show, " kc1");
1164 strcat(show, " kc3");
1169 _nc_warning("vt100 keypad order inconsistent: %s", show);
1172 } else if (VALID_STRING(key_a1) ||
1173 VALID_STRING(key_a3) ||
1174 VALID_STRING(key_b2) ||
1175 VALID_STRING(key_c1) ||
1176 VALID_STRING(key_c3)) {
1178 if (keypad_index(key_a1) >= 0)
1179 strcat(show, " ka1");
1180 if (keypad_index(key_a3) >= 0)
1181 strcat(show, " ka3");
1182 if (keypad_index(key_b2) >= 0)
1183 strcat(show, " kb2");
1184 if (keypad_index(key_c1) >= 0)
1185 strcat(show, " kc1");
1186 if (keypad_index(key_c3) >= 0)
1187 strcat(show, " kc3");
1189 _nc_warning("vt100 keypad map incomplete:%s", show);
1194 check_printer(TERMTYPE *tp)
1196 PAIRED(enter_doublewide_mode, exit_doublewide_mode);
1197 PAIRED(enter_italics_mode, exit_italics_mode);
1198 PAIRED(enter_leftward_mode, exit_leftward_mode);
1199 PAIRED(enter_micro_mode, exit_micro_mode);
1200 PAIRED(enter_shadow_mode, exit_shadow_mode);
1201 PAIRED(enter_subscript_mode, exit_subscript_mode);
1202 PAIRED(enter_superscript_mode, exit_superscript_mode);
1203 PAIRED(enter_upward_mode, exit_upward_mode);
1205 ANDMISSING(start_char_set_def, stop_char_set_def);
1207 /* if we have a parameterized form, then the non-parameterized is easy */
1208 ANDMISSING(set_bottom_margin_parm, set_bottom_margin);
1209 ANDMISSING(set_left_margin_parm, set_left_margin);
1210 ANDMISSING(set_right_margin_parm, set_right_margin);
1211 ANDMISSING(set_top_margin_parm, set_top_margin);
1213 ANDMISSING(parm_down_micro, micro_down);
1214 ANDMISSING(parm_left_micro, micro_left);
1215 ANDMISSING(parm_right_micro, micro_right);
1216 ANDMISSING(parm_up_micro, micro_up);
1220 * Returns the expected number of parameters for the given capability.
1223 expected_params(const char *name)
1226 static const struct {
1230 { "S0", 1 }, /* 'screen' extension */
1283 { "smgbp", 1 }, /* 2 if smgtp is not given */
1298 int result = 0; /* function-keys, etc., use none */
1300 for (n = 0; n < SIZEOF(table); n++) {
1301 if (!strcmp(name, table[n].name)) {
1302 result = table[n].count;
1311 * Make a quick sanity check for the parameters which are used in the given
1312 * strings. If there are no "%p" tokens, then there should be no other "%"
1316 check_params(TERMTYPE *tp, const char *name, char *value)
1318 int expected = expected_params(name);
1324 #ifdef set_top_margin_parm
1325 if (!strcmp(name, "smgbp")
1326 && set_top_margin_parm == 0)
1330 for (n = 0; n < 10; n++)
1336 _nc_warning("expected character after %% in %s", name);
1338 } else if (*s == 'p') {
1339 if (*++s == '\0' || !isdigit((int) *s)) {
1340 _nc_warning("expected digit after %%p in %s", name);
1354 _nc_warning("%s refers to parameter 0 (%%p0), which is not allowed", name);
1356 if (value == set_attributes || expected < 0) {
1358 } else if (expected != actual) {
1359 _nc_warning("%s uses %d parameters, expected %d", name,
1361 for (n = 1; n < actual; n++) {
1363 _nc_warning("%s omits parameter %d", name, n);
1371 while (*s == '/' || isdigit(UChar(*s)))
1377 * Skip a delay altogether, e.g., when comparing a simple string to sgr,
1378 * the latter may have a worst-case delay on the end.
1381 ignore_delays(char *s)
1414 * An sgr string may contain several settings other than the one we're
1415 * interested in, essentially sgr0 + rmacs + whatever. As long as the
1416 * "whatever" is contained in the sgr string, that is close enough for our
1420 similar_sgr(int num, char *a, char *b)
1422 static const char *names[] =
1444 _nc_warning("Did not find delay %s", _nc_visbuf(b));
1446 _nc_warning("checking sgr(%s) %s\n\tcompare to %s\n\tunmatched %s",
1447 names[num], _nc_visbuf2(1, base_a),
1448 _nc_visbuf2(2, base_b),
1452 } else if (delaying) {
1455 } else if ((*b == '0' || (*b == ';')) && *a == 'm') {
1477 /* ignore delays on the end of the string */
1478 a = ignore_delays(a);
1479 return ((num != 0) || (*a == 0));
1483 check_sgr(TERMTYPE *tp, char *zero, int num, char *cap, const char *name)
1488 test = TPARM_9(set_attributes,
1500 if (!similar_sgr(num, test, cap)) {
1501 _nc_warning("%s differs from sgr(%d)\n\t%s=%s\n\tsgr(%d)=%s",
1503 name, _nc_visbuf2(1, cap),
1504 num, _nc_visbuf2(2, test));
1506 } else if (_nc_capcmp(test, zero)) {
1507 _nc_warning("sgr(%d) present, but not %s", num, name);
1509 } else if (PRESENT(cap)) {
1510 _nc_warning("sgr(%d) missing, but %s present", num, name);
1513 _nc_warning("stack error in sgr(%d) string", num);
1517 #define CHECK_SGR(num,name) check_sgr(tp, zero, num, name, #name)
1521 * If tic is compiled with TRACE, we'll be able to see the output from the
1522 * DEBUG() macro. But since it doesn't use traceon(), it always goes to
1523 * the standard error. Use this function to make it simpler to follow the
1524 * resulting debug traces.
1527 show_where(unsigned level)
1529 if (_nc_tracing >= DEBUG_LEVEL(level)) {
1531 _nc_get_type(my_name);
1532 _tracef("\"%s\", line %d, '%s'",
1534 _nc_curr_line, my_name);
1539 #define show_where(level) /* nothing */
1542 /* other sanity-checks (things that we don't want in the normal
1543 * logic that reads a terminfo entry)
1546 check_termtype(TERMTYPE *tp, bool literal)
1548 bool conflict = FALSE;
1550 char fkeys[STRCOUNT];
1553 * A terminal entry may contain more than one keycode assigned to
1554 * a given string (e.g., KEY_END and KEY_LL). But curses will only
1555 * return one (the last one assigned).
1557 if (!(_nc_syntax == SYN_TERMCAP && capdump)) {
1558 memset(fkeys, 0, sizeof(fkeys));
1559 for (j = 0; _nc_tinfo_fkeys[j].code; j++) {
1560 char *a = tp->Strings[_nc_tinfo_fkeys[j].offset];
1562 if (!VALID_STRING(a))
1564 for (k = j + 1; _nc_tinfo_fkeys[k].code; k++) {
1565 char *b = tp->Strings[_nc_tinfo_fkeys[k].offset];
1566 if (!VALID_STRING(b)
1569 if (!_nc_capcmp(a, b)) {
1574 _nc_warning("Conflicting key definitions (using the last)");
1577 fprintf(stderr, "... %s is the same as %s",
1578 keyname((int) _nc_tinfo_fkeys[j].code),
1579 keyname((int) _nc_tinfo_fkeys[k].code));
1582 fprintf(stderr, ", %s",
1583 keyname((int) _nc_tinfo_fkeys[k].code));
1588 fprintf(stderr, "\n");
1592 for (j = 0; j < NUM_STRINGS(tp); j++) {
1593 char *a = tp->Strings[j];
1594 if (VALID_STRING(a))
1595 check_params(tp, ExtStrname(tp, j, strnames), a);
1605 * These may be mismatched because the terminal description relies on
1606 * restoring the cursor visibility by resetting it.
1608 ANDMISSING(cursor_invisible, cursor_normal);
1609 ANDMISSING(cursor_visible, cursor_normal);
1611 if (PRESENT(cursor_visible) && PRESENT(cursor_normal)
1612 && !_nc_capcmp(cursor_visible, cursor_normal))
1613 _nc_warning("cursor_visible is same as cursor_normal");
1616 * From XSI & O'Reilly, we gather that sc/rc are required if csr is
1617 * given, because the cursor position after the scrolling operation is
1618 * performed is undefined.
1620 ANDMISSING(change_scroll_region, save_cursor);
1621 ANDMISSING(change_scroll_region, restore_cursor);
1624 * If we can clear tabs, we should be able to initialize them.
1626 ANDMISSING(clear_all_tabs, set_tab);
1628 if (PRESENT(set_attributes)) {
1632 if (PRESENT(exit_attribute_mode)) {
1633 zero = strdup(CHECK_SGR(0, exit_attribute_mode));
1635 zero = strdup(TPARM_9(set_attributes, 0, 0, 0, 0, 0, 0, 0, 0, 0));
1638 _nc_warning("stack error in sgr(0) string");
1641 CHECK_SGR(1, enter_standout_mode);
1642 CHECK_SGR(2, enter_underline_mode);
1643 CHECK_SGR(3, enter_reverse_mode);
1644 CHECK_SGR(4, enter_blink_mode);
1645 CHECK_SGR(5, enter_dim_mode);
1646 CHECK_SGR(6, enter_bold_mode);
1647 CHECK_SGR(7, enter_secure_mode);
1648 CHECK_SGR(8, enter_protected_mode);
1649 CHECK_SGR(9, enter_alt_charset_mode);
1652 _nc_warning("sgr(0) did not return a value");
1654 } else if (PRESENT(exit_attribute_mode) &&
1655 set_attributes != CANCELLED_STRING) {
1656 if (_nc_syntax == SYN_TERMINFO)
1657 _nc_warning("missing sgr string");
1660 if (PRESENT(exit_attribute_mode)) {
1661 char *check_sgr0 = _nc_trim_sgr0(tp);
1663 if (check_sgr0 == 0 || *check_sgr0 == '\0') {
1664 _nc_warning("trimmed sgr0 is empty");
1667 if (check_sgr0 != exit_attribute_mode) {
1669 ("will trim sgr0\n\toriginal sgr0=%s\n\ttrimmed sgr0=%s",
1670 _nc_visbuf2(1, exit_attribute_mode),
1671 _nc_visbuf2(2, check_sgr0)));
1675 ("will not trim sgr0\n\toriginal sgr0=%s",
1676 _nc_visbuf(exit_attribute_mode)));
1682 if (!auto_right_margin) {
1684 ("can write to lower-right directly"));
1685 } else if (PRESENT(enter_am_mode) && PRESENT(exit_am_mode)) {
1687 ("can write to lower-right by suppressing automargin"));
1688 } else if ((PRESENT(enter_insert_mode) && PRESENT(exit_insert_mode))
1689 || PRESENT(insert_character) || PRESENT(parm_ich)) {
1691 ("can write to lower-right by using inserts"));
1694 ("cannot write to lower-right"));
1699 * Some standard applications (e.g., vi) and some non-curses
1700 * applications (e.g., jove) get confused if we have both ich1 and
1701 * smir/rmir. Let's be nice and warn about that, too, even though
1702 * ncurses handles it.
1704 if ((PRESENT(enter_insert_mode) || PRESENT(exit_insert_mode))
1705 && PRESENT(parm_ich)) {
1706 _nc_warning("non-curses applications may be confused by ich1 with smir/rmir");
1710 * Finally, do the non-verbose checks
1712 if (save_check_termtype != 0)
1713 save_check_termtype(tp, literal);