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.151 2011/07/30 21:49:32 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[] = "\
91 free_namelist(char **src)
95 for (n = 0; src[n] != 0; ++n)
103 cleanup(char **namelst GCC_UNUSED)
106 free_namelist(namelst);
110 if (to_remove != 0) {
120 failed(const char *msg)
123 cleanup((char **) 0);
124 ExitProgram(EXIT_FAILURE);
130 static const char *const tbl[] =
133 " -1 format translation output one capability per line",
135 " -a retain commented-out capabilities (sets -x also)",
137 " -K translate entries to termcap source form with BSD syntax",
138 " -C translate entries to termcap source form",
139 " -c check only, validate input without compiling or translating",
140 " -e<names> translate/compile only entries named by comma-separated list",
141 " -f format complex strings for readability",
142 " -G format %{number} to %'char'",
143 " -g format %'char' to %{number}",
144 " -I translate entries to terminfo source form",
145 " -L translate entries to full terminfo source form",
146 " -N disable smart defaults for source translation",
147 " -o<dir> set output directory for compiled entry writes",
148 " -R<name> restrict translation to given terminfo/termcap version",
149 " -r force resolution of all use entries in source translation",
150 " -s print summary statistics",
151 " -T remove size-restrictions on compiled description",
153 " -t suppress commented-out capabilities",
155 " -U suppress post-processing of entries",
157 " -v[n] set verbosity level",
158 " -w[n] set format width for translation output",
160 " -x treat unknown capabilities as user-defined",
164 " <file> file to translate or compile"
168 fprintf(stderr, "Usage: %s %s\n", _nc_progname, usage_string);
169 for (j = 0; j < SIZEOF(tbl); j++) {
170 fputs(tbl[j], stderr);
173 ExitProgram(EXIT_FAILURE);
178 #define S_QUOTE '\'';
186 char result[MAX_ENTRY_SIZE];
189 * Look for strings that contain %{number}, convert them to %'char',
190 * which is shorter and runs a little faster.
192 for (n = 0; n < STRCOUNT; n++) {
193 s = ep->tterm.Strings[n];
195 && strchr(s, L_BRACE) != 0) {
198 while ((ch = *t++) != 0) {
202 } else if ((ch == '%')
203 && (*t == L_BRACE)) {
205 long value = strtol(t + 1, &v, 0);
209 && value != '\\' /* FIXME */
211 && isprint((int) value)) {
220 if (strlen(result) < strlen(s))
225 _nc_set_type(_nc_first_name(ep->tterm.term_names));
226 _nc_curr_line = (int) ep->startline;
227 _nc_write_entry(&ep->tterm);
231 immedhook(ENTRY * ep GCC_UNUSED)
232 /* write out entries with no use capabilities immediately to save storage */
236 * This is strictly a core-economy kluge. The really clean way to handle
237 * compilation is to slurp the whole file into core and then do all the
238 * name-collision checks and entry writes in one swell foop. But the
239 * terminfo master file is large enough that some core-poor systems swap
240 * like crazy when you compile it this way...there have been reports of
241 * this process taking *three hours*, rather than the twenty seconds or
242 * less typical on my development box.
244 * So. This hook *immediately* writes out the referenced entry if it
245 * has no use capabilities. The compiler main loop refrains from
246 * adding the entry to the in-core list when this hook fires. If some
247 * other entry later needs to reference an entry that got written
248 * immediately, that's OK; the resolution code will fetch it off disk
249 * when it can't find it in core.
251 * Name collisions will still be detected, just not as cleanly. The
252 * write_entry() code complains before overwriting an entry that
253 * postdates the time of tic's first call to write_entry(). Thus
254 * it will complain about overwriting entries newly made during the
255 * tic run, but not about overwriting ones that predate it.
257 * The reason this is a hook, and not in line with the rest of the
258 * compiler code, is that the support for termcap fallback cannot assume
259 * it has anywhere to spool out these entries!
261 * The _nc_set_type() call here requires a compensating one in
264 * If you define HAVE_BIG_CORE, you'll disable this kluge. This will
265 * make tic a bit faster (because the resolution code won't have to do
266 * disk I/O nearly as often).
268 if (ep->nuses == 0) {
269 int oldline = _nc_curr_line;
272 _nc_curr_line = oldline;
273 free(ep->tterm.str_table);
276 #endif /* HAVE_BIG_CORE */
282 /* emit a comment char, translating terminfo names to termcap names */
284 static bool in_name = FALSE;
285 static size_t have, used;
286 static char *namebuf, *suffix;
289 if (used + 1 >= have) {
291 namebuf = typeRealloc(char, have, namebuf);
292 suffix = typeRealloc(char, have, suffix);
294 if (c == '\n' || c == '@') {
295 namebuf[used++] = '\0';
297 (void) fputs(namebuf, stdout);
300 } else if (c != '>') {
301 namebuf[used++] = (char) c;
302 } else { /* ah! candidate name! */
304 NCURSES_CONST char *tp;
306 namebuf[used++] = '\0';
310 if ((up = strchr(namebuf, '#')) != 0
311 || (up = strchr(namebuf, '=')) != 0
312 || ((up = strchr(namebuf, '@')) != 0 && up[1] == '>')) {
313 (void) strcpy(suffix, up);
317 if ((tp = nametrans(namebuf)) != 0) {
319 (void) fputs(tp, stdout);
320 (void) fputs(suffix, stdout);
323 /* couldn't find a translation, just dump the name */
325 (void) fputs(namebuf, stdout);
326 (void) fputs(suffix, stdout);
340 /* Returns a string, stripped of leading/trailing whitespace */
346 while (isspace(UChar(*src)))
352 if ((dst = strdup(src)) == NULL) {
356 while (--len != 0 && isspace(UChar(dst[len])))
364 open_input(const char *filename)
366 FILE *fp = fopen(filename, "r");
370 fprintf(stderr, "%s: Can't open %s\n", _nc_progname, filename);
371 ExitProgram(EXIT_FAILURE);
373 if (fstat(fileno(fp), &sb) < 0
374 || (sb.st_mode & S_IFMT) != S_IFREG) {
375 fprintf(stderr, "%s: %s is not a file\n", _nc_progname, filename);
376 ExitProgram(EXIT_FAILURE);
381 /* Parse the "-e" option-value into a list of names */
383 make_namelist(char *src)
388 unsigned pass, n, nn;
393 } else if (strchr(src, '/') != 0) { /* a filename */
394 FILE *fp = open_input(src);
396 for (pass = 1; pass <= 2; pass++) {
398 while (fgets(buffer, sizeof(buffer), fp) != 0) {
399 if ((s = stripped(buffer)) != 0) {
408 dst = typeCalloc(char *, nn + 1);
413 } else { /* literal list of names */
414 for (pass = 1; pass <= 2; pass++) {
415 for (n = nn = 0, base = src;; n++) {
417 if (mark == ',' || mark == '\0') {
422 if ((s = stripped(base)) != 0)
431 dst = typeCalloc(char *, nn + 1);
434 if (showsummary && (dst != 0)) {
435 fprintf(log_fp, "Entries that will be compiled:\n");
436 for (n = 0; dst[n] != 0; n++)
437 fprintf(log_fp, "%u:%s\n", n + 1, dst[n]);
443 matches(char **needle, const char *haystack)
444 /* does entry in needle list match |-separated field in haystack? */
450 for (n = 0; needle[n] != 0; n++) {
451 if (_nc_name_match(haystack, needle[n], "|")) {
462 open_tempfile(char *name)
466 int fd = mkstemp(name);
468 result = fdopen(fd, "w");
470 if (tmpnam(name) != 0)
471 result = fopen(name, "w");
477 main(int argc, char *argv[])
479 char my_tmpname[PATH_MAX];
481 unsigned debug_level;
482 int smart_defaults = TRUE;
486 int this_opt, last_opt = '?';
488 int outform = F_TERMINFO; /* output format */
489 int sortmode = S_TERMINFO; /* sort_mode */
492 bool formatted = FALSE; /* reformat complex strings? */
493 bool literal = FALSE; /* suppress post-processing? */
494 int numbers = 0; /* format "%'char'" to/from "%{number}" */
495 bool forceresolve = FALSE; /* force resolution */
497 char *tversion = (char *) NULL;
498 const char *source_file = "terminfo";
500 char *outdir = (char *) NULL;
501 bool check_only = FALSE;
502 bool suppress_untranslatable = FALSE;
506 _nc_progname = _nc_rootname(argv[0]);
508 if ((infodump = same_program(_nc_progname, PROG_CAPTOINFO)) != FALSE) {
509 outform = F_TERMINFO;
510 sortmode = S_TERMINFO;
512 if ((capdump = same_program(_nc_progname, PROG_INFOTOCAP)) != FALSE) {
514 sortmode = S_TERMCAP;
517 use_extended_names(FALSE);
522 * Processing arguments is a little complicated, since someone made a
523 * design decision to allow the numeric values for -w, -v options to
526 while ((this_opt = getopt(argc, argv,
527 "0123456789CIKLNR:TUVace:fGgo:rstvwx")) != -1) {
528 if (isdigit(this_opt)) {
531 v_opt = (v_opt * 10) + (this_opt - '0');
534 width = (width * 10) + (this_opt - '0');
551 sortmode = S_TERMCAP;
555 outform = F_TERMINFO;
556 sortmode = S_TERMINFO;
560 outform = F_VARIABLE;
561 sortmode = S_VARIABLE;
564 smart_defaults = FALSE;
577 puts(curses_version());
579 ExitProgram(EXIT_SUCCESS);
584 namelst = make_namelist(optarg);
612 _nc_disable_period = FALSE;
613 suppress_untranslatable = TRUE;
616 _nc_disable_period = TRUE;
619 use_extended_names(TRUE);
628 debug_level = (unsigned) ((v_opt > 0) ? v_opt : (v_opt == 0));
629 set_trace_level(debug_level);
632 save_check_termtype = _nc_check_termtype2;
633 _nc_check_termtype2 = check_termtype;
637 * Aaargh! immedhook seriously hoses us!
639 * One problem with immedhook is it means we can't do -e. Problem
640 * is that we can't guarantee that for each terminal listed, all the
641 * terminals it depends on will have been kept in core for reference
642 * resolution -- in fact it's certain the primitive types at the end
643 * of reference chains *won't* be in core unless they were explicitly
644 * in the select list themselves.
646 if (namelst && (!infodump && !capdump)) {
647 (void) fprintf(stderr,
648 "Sorry, -e can't be used without -I or -C\n");
650 ExitProgram(EXIT_FAILURE);
652 #endif /* HAVE_BIG_CORE */
655 source_file = argv[optind++];
658 "%s: Too many file names. Usage:\n\t%s %s",
662 ExitProgram(EXIT_FAILURE);
665 if (infodump == TRUE) {
666 /* captoinfo's no-argument case */
667 source_file = "/etc/termcap";
668 if ((termcap = getenv("TERMCAP")) != 0
669 && (namelst = make_namelist(getenv("TERM"))) != 0) {
670 if (access(termcap, F_OK) == 0) {
672 source_file = termcap;
673 } else if ((tmp_fp = open_tempfile(strcpy(my_tmpname,
676 source_file = my_tmpname;
677 fprintf(tmp_fp, "%s\n", termcap);
679 tmp_fp = open_input(source_file);
680 to_remove = source_file;
688 "%s: File name needed. Usage:\n\t%s %s",
693 ExitProgram(EXIT_FAILURE);
698 tmp_fp = open_input(source_file);
705 sortmode, width, debug_level, formatted);
709 sortmode, width, debug_level, FALSE);
711 /* parse entries out of the source file */
712 _nc_set_source(source_file);
714 if (!(check_only || infodump || capdump))
715 _nc_set_writedir(outdir);
716 #endif /* HAVE_BIG_CORE */
717 _nc_read_entry_source(tmp_fp, (char *) NULL,
718 !smart_defaults || literal, FALSE,
719 ((check_only || infodump || capdump)
723 /* do use resolution */
724 if (check_only || (!infodump && !capdump) || forceresolve) {
725 if (!_nc_resolve_uses2(TRUE, literal) && !check_only) {
727 ExitProgram(EXIT_FAILURE);
732 if (check_only && (capdump || infodump)) {
734 if (matches(namelst, qp->tterm.term_names)) {
735 int len = fmt_entry(&qp->tterm, NULL, FALSE, TRUE, infodump, numbers);
737 if (len > (infodump ? MAX_TERMINFO_LENGTH : MAX_TERMCAP_LENGTH))
738 (void) fprintf(stderr,
739 "warning: resolved %s entry is %d bytes long\n",
740 _nc_first_name(qp->tterm.term_names),
746 /* write or dump all entries */
748 if (!infodump && !capdump) {
749 _nc_set_writedir(outdir);
751 if (matches(namelst, qp->tterm.term_names))
755 /* this is in case infotocap() generates warnings */
756 _nc_curr_col = _nc_curr_line = -1;
759 if (matches(namelst, qp->tterm.term_names)) {
760 long j = qp->cend - qp->cstart;
763 /* this is in case infotocap() generates warnings */
764 _nc_set_type(_nc_first_name(qp->tterm.term_names));
766 (void) fseek(tmp_fp, qp->cstart, SEEK_SET);
769 (void) putchar(fgetc(tmp_fp));
771 put_translate(fgetc(tmp_fp));
774 repair_acsc(&qp->tterm);
775 dump_entry(&qp->tterm, suppress_untranslatable,
776 limited, numbers, NULL);
777 for (j = 0; j < (long) qp->nuses; j++)
778 dump_uses(qp->uses[j].name, !capdump);
780 if (debug_level != 0 && !limited)
781 printf("# length=%d\n", len);
784 if (!namelst && _nc_tail) {
786 bool in_comment = FALSE;
787 bool trailing_comment = FALSE;
789 (void) fseek(tmp_fp, _nc_tail->cend, SEEK_SET);
790 while ((c = fgetc(tmp_fp)) != EOF) {
793 trailing_comment = TRUE;
800 && (in_comment || (oldc == '\n' && c == '\n')))
808 /* Show the directory into which entries were written, and the total
812 && (!(check_only || infodump || capdump))) {
813 int total = _nc_tic_written();
815 fprintf(log_fp, "%d entries written to %s\n",
817 _nc_tic_dir((char *) 0));
819 fprintf(log_fp, "No entries written\n");
822 ExitProgram(EXIT_SUCCESS);
826 * This bit of legerdemain turns all the terminfo variable names into
827 * references to locations in the arrays Booleans, Numbers, and Strings ---
828 * precisely what's needed (see comp_parse.c).
834 * Check if the alternate character-set capabilities are consistent.
837 check_acs(TERMTYPE *tp)
839 if (VALID_STRING(acs_chars)) {
840 const char *boxes = "lmkjtuvwqxn";
846 memset(mapped, 0, sizeof(mapped));
847 for (p = acs_chars; *p != '\0'; p += 2) {
849 _nc_warning("acsc has odd number of characters");
852 mapped[UChar(p[0])] = p[1];
855 if (mapped[UChar('I')] && !mapped[UChar('i')]) {
856 _nc_warning("acsc refers to 'I', which is probably an error");
859 for (p = boxes, q = missing; *p != '\0'; ++p) {
860 if (!mapped[UChar(p[0])]) {
866 assert(strlen(missing) <= strlen(boxes));
867 if (*missing != '\0' && strcmp(missing, boxes)) {
868 _nc_warning("acsc is missing some line-drawing mapping: %s", missing);
874 * Check if the color capabilities are consistent
877 check_colors(TERMTYPE *tp)
879 if ((max_colors > 0) != (max_pairs > 0)
880 || ((max_colors > max_pairs) && (initialize_pair == 0)))
881 _nc_warning("inconsistent values for max_colors (%d) and max_pairs (%d)",
882 max_colors, max_pairs);
884 PAIRED(set_foreground, set_background);
885 PAIRED(set_a_foreground, set_a_background);
886 PAIRED(set_color_pair, initialize_pair);
888 if (VALID_STRING(set_foreground)
889 && VALID_STRING(set_a_foreground)
890 && !_nc_capcmp(set_foreground, set_a_foreground))
891 _nc_warning("expected setf/setaf to be different");
893 if (VALID_STRING(set_background)
894 && VALID_STRING(set_a_background)
895 && !_nc_capcmp(set_background, set_a_background))
896 _nc_warning("expected setb/setab to be different");
898 /* see: has_colors() */
899 if (VALID_NUMERIC(max_colors) && VALID_NUMERIC(max_pairs)
900 && (((set_foreground != NULL)
901 && (set_background != NULL))
902 || ((set_a_foreground != NULL)
903 && (set_a_background != NULL))
904 || set_color_pair)) {
905 if (!VALID_STRING(orig_pair) && !VALID_STRING(orig_colors))
906 _nc_warning("expected either op/oc string for resetting colors");
911 keypad_final(const char *string)
915 if (VALID_STRING(string)
916 && *string++ == '\033'
918 && strlen(string) == 1) {
926 keypad_index(const char *string)
929 const char *list = "PQRSwxymtuvlqrsPpn"; /* app-keypad except "Enter" */
933 if ((ch = keypad_final(string)) != '\0') {
934 test = strchr(list, ch);
936 result = (long) (test - list);
942 * list[] is down, up, left, right
943 * "left" may be ^H rather than \E[D
944 * "down" may be ^J rather than \E[B
945 * But up/right are generally consistently escape sequences for ANSI terminals.
948 check_ansi_cursor(char *list[4])
955 bool repeated = FALSE;
957 for (j = 0; j < 4; ++j) {
959 for (k = 0; k < j; ++k) {
961 && !strcmp(list[j], list[k])) {
962 char *value = _nc_tic_expand(list[k], TRUE, 0);
963 _nc_warning("repeated cursor control %s\n", value);
971 if (UChar(up[0]) == '\033') {
977 } else if (UChar(up[0]) == UChar('\233')) {
982 while (up[suffix] && isdigit(UChar(up[suffix])))
985 if (prefix && up[suffix] == 'A') {
987 if (!strcmp(list[0], "\n"))
989 if (!strcmp(list[2], "\b"))
992 for (j = 0; j < 4; ++j) {
993 if (skip[j] || strlen(list[j]) == 1)
995 if (memcmp(list[j], up, prefix)) {
996 char *value = _nc_tic_expand(list[j], TRUE, 0);
997 _nc_warning("inconsistent prefix for %s\n", value);
1000 if (strlen(list[j]) < suffix) {
1001 char *value = _nc_tic_expand(list[j], TRUE, 0);
1002 _nc_warning("inconsistent length for %s, expected %d\n",
1003 value, (int) suffix + 1);
1007 if (list[j][suffix] != want) {
1008 char *value = _nc_tic_expand(list[j], TRUE, 0);
1009 _nc_warning("inconsistent suffix for %s, expected %c, have %c\n",
1010 value, want, list[j][suffix]);
1017 #define EXPECTED(name) if (!PRESENT(name)) _nc_warning("expected " #name)
1020 check_cursor(TERMTYPE *tp)
1025 /* if we have a parameterized form, then the non-parameterized is easy */
1026 ANDMISSING(parm_down_cursor, cursor_down);
1027 ANDMISSING(parm_up_cursor, cursor_up);
1028 ANDMISSING(parm_left_cursor, cursor_left);
1029 ANDMISSING(parm_right_cursor, cursor_right);
1031 /* Given any of a set of cursor movement, the whole set should be present.
1032 * Technically this is not true (we could use cursor_address to fill in
1033 * unsupported controls), but it is likely.
1036 if (PRESENT(parm_down_cursor)) {
1037 list[count++] = parm_down_cursor;
1039 if (PRESENT(parm_up_cursor)) {
1040 list[count++] = parm_up_cursor;
1042 if (PRESENT(parm_left_cursor)) {
1043 list[count++] = parm_left_cursor;
1045 if (PRESENT(parm_right_cursor)) {
1046 list[count++] = parm_right_cursor;
1049 check_ansi_cursor(list);
1050 } else if (count != 0) {
1051 EXPECTED(parm_down_cursor);
1052 EXPECTED(parm_up_cursor);
1053 EXPECTED(parm_left_cursor);
1054 EXPECTED(parm_right_cursor);
1058 if (PRESENT(cursor_down)) {
1059 list[count++] = cursor_down;
1061 if (PRESENT(cursor_up)) {
1062 list[count++] = cursor_up;
1064 if (PRESENT(cursor_left)) {
1065 list[count++] = cursor_left;
1067 if (PRESENT(cursor_right)) {
1068 list[count++] = cursor_right;
1071 check_ansi_cursor(list);
1072 } else if (count != 0) {
1074 if (PRESENT(cursor_down) && strcmp(cursor_down, "\n"))
1076 if (PRESENT(cursor_left) && strcmp(cursor_left, "\b"))
1078 if (PRESENT(cursor_up) && strlen(cursor_up) > 1)
1080 if (PRESENT(cursor_right) && strlen(cursor_right) > 1)
1083 EXPECTED(cursor_down);
1084 EXPECTED(cursor_up);
1085 EXPECTED(cursor_left);
1086 EXPECTED(cursor_right);
1093 * Do a quick sanity-check for vt100-style keypads to see if the 5-key keypad
1094 * is mapped inconsistently.
1097 check_keypad(TERMTYPE *tp)
1101 if (VALID_STRING(key_a1) &&
1102 VALID_STRING(key_a3) &&
1103 VALID_STRING(key_b2) &&
1104 VALID_STRING(key_c1) &&
1105 VALID_STRING(key_c3)) {
1106 char final[MAX_KP + 1];
1113 final[0] = keypad_final(key_a1);
1114 final[1] = keypad_final(key_a3);
1115 final[2] = keypad_final(key_b2);
1116 final[3] = keypad_final(key_c1);
1117 final[4] = keypad_final(key_c3);
1120 /* special case: legacy coding using 1,2,3,0,. on the bottom */
1121 assert(strlen(final) <= MAX_KP);
1122 if (!strcmp(final, "qsrpn"))
1125 list[0] = keypad_index(key_a1);
1126 list[1] = keypad_index(key_a3);
1127 list[2] = keypad_index(key_b2);
1128 list[3] = keypad_index(key_c1);
1129 list[4] = keypad_index(key_c3);
1131 /* check that they're all vt100 keys */
1132 for (j = 0; j < MAX_KP; ++j) {
1138 /* check if they're all in increasing order */
1139 for (j = 1; j < MAX_KP; ++j) {
1140 if (list[j] > list[j - 1]) {
1144 if (increase != (MAX_KP - 1)) {
1147 for (j = 0, last = -1; j < MAX_KP; ++j) {
1148 for (k = 0, kk = -1, test = 100; k < 5; ++k) {
1149 if (list[k] > last &&
1156 assert(strlen(show) < (MAX_KP * 4));
1159 strcat(show, " ka1");
1162 strcat(show, " ka3");
1165 strcat(show, " kb2");
1168 strcat(show, " kc1");
1171 strcat(show, " kc3");
1176 _nc_warning("vt100 keypad order inconsistent: %s", show);
1179 } else if (VALID_STRING(key_a1) ||
1180 VALID_STRING(key_a3) ||
1181 VALID_STRING(key_b2) ||
1182 VALID_STRING(key_c1) ||
1183 VALID_STRING(key_c3)) {
1185 if (keypad_index(key_a1) >= 0)
1186 strcat(show, " ka1");
1187 if (keypad_index(key_a3) >= 0)
1188 strcat(show, " ka3");
1189 if (keypad_index(key_b2) >= 0)
1190 strcat(show, " kb2");
1191 if (keypad_index(key_c1) >= 0)
1192 strcat(show, " kc1");
1193 if (keypad_index(key_c3) >= 0)
1194 strcat(show, " kc3");
1196 _nc_warning("vt100 keypad map incomplete:%s", show);
1201 check_printer(TERMTYPE *tp)
1203 PAIRED(enter_doublewide_mode, exit_doublewide_mode);
1204 PAIRED(enter_italics_mode, exit_italics_mode);
1205 PAIRED(enter_leftward_mode, exit_leftward_mode);
1206 PAIRED(enter_micro_mode, exit_micro_mode);
1207 PAIRED(enter_shadow_mode, exit_shadow_mode);
1208 PAIRED(enter_subscript_mode, exit_subscript_mode);
1209 PAIRED(enter_superscript_mode, exit_superscript_mode);
1210 PAIRED(enter_upward_mode, exit_upward_mode);
1212 ANDMISSING(start_char_set_def, stop_char_set_def);
1214 /* if we have a parameterized form, then the non-parameterized is easy */
1215 ANDMISSING(set_bottom_margin_parm, set_bottom_margin);
1216 ANDMISSING(set_left_margin_parm, set_left_margin);
1217 ANDMISSING(set_right_margin_parm, set_right_margin);
1218 ANDMISSING(set_top_margin_parm, set_top_margin);
1220 ANDMISSING(parm_down_micro, micro_down);
1221 ANDMISSING(parm_left_micro, micro_left);
1222 ANDMISSING(parm_right_micro, micro_right);
1223 ANDMISSING(parm_up_micro, micro_up);
1227 * Returns the expected number of parameters for the given capability.
1230 expected_params(const char *name)
1233 static const struct {
1237 { "S0", 1 }, /* 'screen' extension */
1290 { "smgbp", 1 }, /* 2 if smgtp is not given */
1305 int result = 0; /* function-keys, etc., use none */
1307 for (n = 0; n < SIZEOF(table); n++) {
1308 if (!strcmp(name, table[n].name)) {
1309 result = table[n].count;
1318 * Make a quick sanity check for the parameters which are used in the given
1319 * strings. If there are no "%p" tokens, then there should be no other "%"
1323 check_params(TERMTYPE *tp, const char *name, char *value)
1325 int expected = expected_params(name);
1331 #ifdef set_top_margin_parm
1332 if (!strcmp(name, "smgbp")
1333 && set_top_margin_parm == 0)
1337 for (n = 0; n < 10; n++)
1343 _nc_warning("expected character after %% in %s", name);
1345 } else if (*s == 'p') {
1346 if (*++s == '\0' || !isdigit((int) *s)) {
1347 _nc_warning("expected digit after %%p in %s", name);
1361 _nc_warning("%s refers to parameter 0 (%%p0), which is not allowed", name);
1363 if (value == set_attributes || expected < 0) {
1365 } else if (expected != actual) {
1366 _nc_warning("%s uses %d parameters, expected %d", name,
1368 for (n = 1; n < actual; n++) {
1370 _nc_warning("%s omits parameter %d", name, n);
1378 while (*s == '/' || isdigit(UChar(*s)))
1384 * Skip a delay altogether, e.g., when comparing a simple string to sgr,
1385 * the latter may have a worst-case delay on the end.
1388 ignore_delays(char *s)
1421 * An sgr string may contain several settings other than the one we're
1422 * interested in, essentially sgr0 + rmacs + whatever. As long as the
1423 * "whatever" is contained in the sgr string, that is close enough for our
1427 similar_sgr(int num, char *a, char *b)
1429 static const char *names[] =
1451 _nc_warning("Did not find delay %s", _nc_visbuf(b));
1453 _nc_warning("checking sgr(%s) %s\n\tcompare to %s\n\tunmatched %s",
1454 names[num], _nc_visbuf2(1, base_a),
1455 _nc_visbuf2(2, base_b),
1459 } else if (delaying) {
1462 } else if ((*b == '0' || (*b == ';')) && *a == 'm') {
1484 /* ignore delays on the end of the string */
1485 a = ignore_delays(a);
1486 return ((num != 0) || (*a == 0));
1490 check_sgr(TERMTYPE *tp, char *zero, int num, char *cap, const char *name)
1495 test = TPARM_9(set_attributes,
1507 if (!similar_sgr(num, test, cap)) {
1508 _nc_warning("%s differs from sgr(%d)\n\t%s=%s\n\tsgr(%d)=%s",
1510 name, _nc_visbuf2(1, cap),
1511 num, _nc_visbuf2(2, test));
1513 } else if (_nc_capcmp(test, zero)) {
1514 _nc_warning("sgr(%d) present, but not %s", num, name);
1516 } else if (PRESENT(cap)) {
1517 _nc_warning("sgr(%d) missing, but %s present", num, name);
1520 _nc_warning("stack error in sgr(%d) string", num);
1524 #define CHECK_SGR(num,name) check_sgr(tp, zero, num, name, #name)
1528 * If tic is compiled with TRACE, we'll be able to see the output from the
1529 * DEBUG() macro. But since it doesn't use traceon(), it always goes to
1530 * the standard error. Use this function to make it simpler to follow the
1531 * resulting debug traces.
1534 show_where(unsigned level)
1536 if (_nc_tracing >= DEBUG_LEVEL(level)) {
1538 _nc_get_type(my_name);
1539 _tracef("\"%s\", line %d, '%s'",
1541 _nc_curr_line, my_name);
1546 #define show_where(level) /* nothing */
1549 /* other sanity-checks (things that we don't want in the normal
1550 * logic that reads a terminfo entry)
1553 check_termtype(TERMTYPE *tp, bool literal)
1555 bool conflict = FALSE;
1557 char fkeys[STRCOUNT];
1560 * A terminal entry may contain more than one keycode assigned to
1561 * a given string (e.g., KEY_END and KEY_LL). But curses will only
1562 * return one (the last one assigned).
1564 if (!(_nc_syntax == SYN_TERMCAP && capdump)) {
1565 memset(fkeys, 0, sizeof(fkeys));
1566 for (j = 0; _nc_tinfo_fkeys[j].code; j++) {
1567 char *a = tp->Strings[_nc_tinfo_fkeys[j].offset];
1569 if (!VALID_STRING(a))
1571 for (k = j + 1; _nc_tinfo_fkeys[k].code; k++) {
1572 char *b = tp->Strings[_nc_tinfo_fkeys[k].offset];
1573 if (!VALID_STRING(b)
1576 if (!_nc_capcmp(a, b)) {
1581 _nc_warning("Conflicting key definitions (using the last)");
1584 fprintf(stderr, "... %s is the same as %s",
1585 keyname((int) _nc_tinfo_fkeys[j].code),
1586 keyname((int) _nc_tinfo_fkeys[k].code));
1589 fprintf(stderr, ", %s",
1590 keyname((int) _nc_tinfo_fkeys[k].code));
1595 fprintf(stderr, "\n");
1599 for (j = 0; j < NUM_STRINGS(tp); j++) {
1600 char *a = tp->Strings[j];
1601 if (VALID_STRING(a))
1602 check_params(tp, ExtStrname(tp, (int) j, strnames), a);
1612 * These may be mismatched because the terminal description relies on
1613 * restoring the cursor visibility by resetting it.
1615 ANDMISSING(cursor_invisible, cursor_normal);
1616 ANDMISSING(cursor_visible, cursor_normal);
1618 if (PRESENT(cursor_visible) && PRESENT(cursor_normal)
1619 && !_nc_capcmp(cursor_visible, cursor_normal))
1620 _nc_warning("cursor_visible is same as cursor_normal");
1623 * From XSI & O'Reilly, we gather that sc/rc are required if csr is
1624 * given, because the cursor position after the scrolling operation is
1625 * performed is undefined.
1627 ANDMISSING(change_scroll_region, save_cursor);
1628 ANDMISSING(change_scroll_region, restore_cursor);
1631 * If we can clear tabs, we should be able to initialize them.
1633 ANDMISSING(clear_all_tabs, set_tab);
1635 if (PRESENT(set_attributes)) {
1639 if (PRESENT(exit_attribute_mode)) {
1640 zero = strdup(CHECK_SGR(0, exit_attribute_mode));
1642 zero = strdup(TPARM_9(set_attributes, 0, 0, 0, 0, 0, 0, 0, 0, 0));
1645 _nc_warning("stack error in sgr(0) string");
1648 CHECK_SGR(1, enter_standout_mode);
1649 CHECK_SGR(2, enter_underline_mode);
1650 CHECK_SGR(3, enter_reverse_mode);
1651 CHECK_SGR(4, enter_blink_mode);
1652 CHECK_SGR(5, enter_dim_mode);
1653 CHECK_SGR(6, enter_bold_mode);
1654 CHECK_SGR(7, enter_secure_mode);
1655 CHECK_SGR(8, enter_protected_mode);
1656 CHECK_SGR(9, enter_alt_charset_mode);
1659 _nc_warning("sgr(0) did not return a value");
1661 } else if (PRESENT(exit_attribute_mode) &&
1662 set_attributes != CANCELLED_STRING) {
1663 if (_nc_syntax == SYN_TERMINFO)
1664 _nc_warning("missing sgr string");
1667 if (PRESENT(exit_attribute_mode)) {
1668 char *check_sgr0 = _nc_trim_sgr0(tp);
1670 if (check_sgr0 == 0 || *check_sgr0 == '\0') {
1671 _nc_warning("trimmed sgr0 is empty");
1674 if (check_sgr0 != exit_attribute_mode) {
1676 ("will trim sgr0\n\toriginal sgr0=%s\n\ttrimmed sgr0=%s",
1677 _nc_visbuf2(1, exit_attribute_mode),
1678 _nc_visbuf2(2, check_sgr0)));
1682 ("will not trim sgr0\n\toriginal sgr0=%s",
1683 _nc_visbuf(exit_attribute_mode)));
1689 if (!auto_right_margin) {
1691 ("can write to lower-right directly"));
1692 } else if (PRESENT(enter_am_mode) && PRESENT(exit_am_mode)) {
1694 ("can write to lower-right by suppressing automargin"));
1695 } else if ((PRESENT(enter_insert_mode) && PRESENT(exit_insert_mode))
1696 || PRESENT(insert_character) || PRESENT(parm_ich)) {
1698 ("can write to lower-right by using inserts"));
1701 ("cannot write to lower-right"));
1706 * Some standard applications (e.g., vi) and some non-curses
1707 * applications (e.g., jove) get confused if we have both ich1 and
1708 * smir/rmir. Let's be nice and warn about that, too, even though
1709 * ncurses handles it.
1711 if ((PRESENT(enter_insert_mode) || PRESENT(exit_insert_mode))
1712 && PRESENT(parm_ich)) {
1713 _nc_warning("non-curses applications may be confused by ich1 with smir/rmir");
1717 * Finally, do the non-verbose checks
1719 if (save_check_termtype != 0)
1720 save_check_termtype(tp, literal);