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 * toe.c --- table of entries report generator
39 #include <progs.priv.h>
44 #include <hashed_db.h>
47 MODULE_ID("$Id: toe.c,v 1.64 2012/01/01 02:56:17 tom Exp $")
49 #define isDotname(name) (!strcmp(name, ".") || !strcmp(name, ".."))
53 unsigned long checksum;
58 const char *_nc_progname;
60 static TERMDATA *ptr_termdata; /* array of terminal data */
61 static size_t use_termdata; /* actual usage in ptr_termdata[] */
62 static size_t len_termdata; /* allocated size of ptr_termdata[] */
66 static void ExitProgram(int code) GCC_NORETURN;
70 _nc_free_entries(_nc_head);
75 static void failed(const char *) GCC_NORETURN;
78 failed(const char *msg)
81 ExitProgram(EXIT_FAILURE);
85 strmalloc(const char *value)
87 char *result = strdup(value);
97 size_t want = use_termdata + 1;
99 if (want >= len_termdata) {
100 len_termdata = (2 * want) + 10;
101 ptr_termdata = typeRealloc(TERMDATA, len_termdata, ptr_termdata);
104 return ptr_termdata + use_termdata++;
108 compare_termdata(const void *a, const void *b)
110 const TERMDATA *p = (const TERMDATA *) a;
111 const TERMDATA *q = (const TERMDATA *) b;
112 int result = strcmp(p->term_name, q->term_name);
115 result = (p->db_index - q->db_index);
121 * Sort the array of TERMDATA and print it. If more than one database is being
122 * reported, add a column to show which database has a given entry.
125 show_termdata(int eargc, char **eargv)
132 for (j = 0; j < eargc; ++j) {
133 for (k = 0; k <= j; ++k) {
137 printf("%s\n", eargv[j]);
140 if (use_termdata > 1)
141 qsort(ptr_termdata, use_termdata, sizeof(TERMDATA), compare_termdata);
142 for (n = 0; n < use_termdata; ++n) {
145 * If there is more than one database, show how they differ.
148 unsigned long check = 0;
151 for (; k < ptr_termdata[n].db_index; ++k) {
156 * If this is the first entry, or its checksum differs
157 * from the first entry's checksum, print "*". Otherwise
158 * it looks enough like a duplicate to print "+".
160 printf("%c-", ((check == 0
161 || (check != ptr_termdata[n].checksum))
164 check = ptr_termdata[n].checksum;
167 if ((n + 1) >= use_termdata
168 || strcmp(ptr_termdata[n].term_name,
169 ptr_termdata[n + 1].term_name)) {
174 for (; k < eargc; ++k) {
180 (void) printf("%-10s\t%s\n",
181 ptr_termdata[n].term_name,
182 ptr_termdata[n].description);
190 if (ptr_termdata != 0) {
191 while (use_termdata != 0) {
193 free(ptr_termdata[use_termdata].term_name);
194 free(ptr_termdata[use_termdata].description);
204 allocArgv(size_t count)
206 char **result = typeCalloc(char *, count + 1);
208 failed("realloc eargv");
215 freeArgv(char **argv)
219 while (argv[count]) {
228 make_db_name(char *dst, const char *src, unsigned limit)
230 static const char suffix[] = DBM_SUFFIX;
233 unsigned lens = sizeof(suffix) - 1;
234 unsigned size = strlen(src);
235 unsigned need = lens + size;
239 && !strcmp(src + size - lens, suffix))
240 (void) strcpy(dst, src);
242 (void) sprintf(dst, "%s%s", src, suffix);
249 typedef void (DescHook) (int /* db_index */ ,
251 const char * /* term_name */ ,
252 TERMTYPE * /* term */ );
255 term_description(TERMTYPE *tp)
259 if ((desc = strrchr(tp->term_names, '|')) == 0 || *++desc == '\0')
260 desc = "(No description)";
265 /* display a description for the type */
267 deschook(int db_index, int db_limit, const char *term_name, TERMTYPE *tp)
271 (void) printf("%-10s\t%s\n", term_name, term_description(tp));
275 string_sum(const char *value)
277 unsigned long result = 0;
279 if ((intptr_t) value == (intptr_t) (-1)) {
283 result += UChar(*value);
291 checksum_of(TERMTYPE *tp)
293 unsigned long result = string_sum(tp->term_names);
296 for (i = 0; i < NUM_BOOLEANS(tp); i++) {
297 result += (tp->Booleans[i]);
299 for (i = 0; i < NUM_NUMBERS(tp); i++) {
300 result += (tp->Numbers[i]);
302 for (i = 0; i < NUM_STRINGS(tp); i++) {
303 result += string_sum(tp->Strings[i]);
308 /* collect data, to sort before display */
310 sorthook(int db_index, int db_limit, const char *term_name, TERMTYPE *tp)
312 TERMDATA *data = new_termdata();
314 data->db_index = db_index;
315 data->checksum = ((db_limit > 1) ? checksum_of(tp) : 0);
316 data->term_name = strmalloc(term_name);
317 data->description = strmalloc(term_description(tp));
322 show_termcap(int db_index, int db_limit, char *buffer, DescHook hook)
325 char *next = strchr(buffer, ':');
332 last = strrchr(buffer, '|');
336 memset(&data, 0, sizeof(data));
337 data.term_names = strmalloc(buffer);
338 while ((next = strtok(list, "|")) != 0) {
340 hook(db_index, db_limit, next, &data);
343 free(data.term_names);
348 typelist(int eargc, char *eargv[],
351 /* apply a function to each entry in given terminfo directories */
355 for (i = 0; i < eargc; i++) {
357 if (_nc_is_dir_path(eargv[i])) {
362 if ((termdir = opendir(eargv[i])) == 0) {
363 (void) fflush(stdout);
364 (void) fprintf(stderr,
365 "%s: can't open terminfo directory %s\n",
366 _nc_progname, eargv[i]);
371 (void) printf("#\n#%s:\n#\n", eargv[i]);
373 while ((subdir = readdir(termdir)) != 0) {
374 size_t len = NAMLEN(subdir);
375 size_t cwd_len = len + strlen(eargv[i]) + 3;
376 char name_1[PATH_MAX];
380 cwd_buf = typeRealloc(char, cwd_len, cwd_buf);
382 failed("realloc cwd_buf");
384 assert(cwd_buf != 0);
386 strncpy(name_1, subdir->d_name, len)[len] = '\0';
387 if (isDotname(name_1))
390 (void) sprintf(cwd_buf, "%s/%.*s/", eargv[i], (int) len, name_1);
391 if (chdir(cwd_buf) != 0)
394 entrydir = opendir(".");
399 while ((entry = readdir(entrydir)) != 0) {
400 char name_2[PATH_MAX];
406 strncpy(name_2, entry->d_name, len)[len] = '\0';
407 if (isDotname(name_2) || !_nc_is_file_path(name_2))
410 status = _nc_read_file_entry(name_2, <erm);
412 (void) fflush(stdout);
413 (void) fprintf(stderr,
414 "%s: couldn't open terminfo file %s.\n",
415 _nc_progname, name_2);
416 return (EXIT_FAILURE);
419 /* only visit things once, by primary name */
420 cn = _nc_first_name(lterm.term_names);
421 if (!strcmp(cn, name_2)) {
422 /* apply the selected hook function */
423 hook(i, eargc, cn, <erm);
425 _nc_free_termtype(<erm);
437 char filename[PATH_MAX];
440 (void) printf("#\n#%s:\n#\n", eargv[i]);
442 if (make_db_name(filename, eargv[i], sizeof(filename))) {
443 if ((capdbp = _nc_db_open(filename, FALSE)) != 0) {
447 code = _nc_db_first(capdbp, &key, &data);
454 if (_nc_db_have_data(&key, &data, &have, &used)) {
455 if (_nc_read_termtype(<erm, have, used) > 0) {
456 /* only visit things once, by primary name */
457 cn = _nc_first_name(lterm.term_names);
458 /* apply the selected hook function */
459 hook(i, eargc, cn, <erm);
460 _nc_free_termtype(<erm);
463 code = _nc_db_next(capdbp, &key, &data);
466 _nc_db_close(capdbp);
476 CGETENT_CONST char *db_array[2];
480 (void) printf("#\n#%s:\n#\n", eargv[i]);
482 db_array[0] = eargv[i];
485 if (cgetfirst(&buffer, db_array) > 0) {
486 show_termcap(i, eargc, buffer, hook);
488 while (cgetnext(&buffer, db_array) > 0) {
489 show_termcap(i, eargc, buffer, hook);
497 /* scan termcap text-file only */
498 if (_nc_is_file_path(eargv[i])) {
503 (void) printf("#\n#%s:\n#\n", eargv[i]);
505 if ((fp = fopen(eargv[i], "r")) != 0) {
506 while (fgets(buffer, sizeof(buffer), fp) != 0) {
509 if (isspace(*buffer))
511 show_termcap(i, eargc, buffer, hook);
520 if (hook == sorthook) {
521 show_termdata(eargc, eargv);
525 return (EXIT_SUCCESS);
531 (void) fprintf(stderr, "usage: %s [-ahsuUV] [-v n] [file...]\n", _nc_progname);
532 ExitProgram(EXIT_FAILURE);
536 main(int argc, char *argv[])
538 bool all_dirs = FALSE;
539 bool direct_dependencies = FALSE;
540 bool invert_dependencies = FALSE;
542 char *report_file = 0;
545 int this_opt, last_opt = '?';
547 DescHook *hook = deschook;
549 _nc_progname = _nc_rootname(argv[0]);
551 while ((this_opt = getopt(argc, argv, "0123456789ahsu:vU:V")) != -1) {
552 /* handle optional parameter */
553 if (isdigit(this_opt)) {
556 v_opt = (unsigned) (this_opt - '0');
559 if (isdigit(last_opt))
563 v_opt += (unsigned) (this_opt - '0');
579 direct_dependencies = TRUE;
580 report_file = optarg;
586 invert_dependencies = TRUE;
587 report_file = optarg;
590 puts(curses_version());
591 ExitProgram(EXIT_SUCCESS);
596 set_trace_level(v_opt);
598 if (report_file != 0) {
599 if (freopen(report_file, "r", stdin) == 0) {
600 (void) fflush(stdout);
601 fprintf(stderr, "%s: can't open %s\n", _nc_progname, report_file);
602 ExitProgram(EXIT_FAILURE);
605 /* parse entries out of the source file */
606 _nc_set_source(report_file);
607 _nc_read_entry_source(stdin, 0, FALSE, FALSE, NULLHOOK);
610 /* maybe we want a direct-dependency listing? */
611 if (direct_dependencies) {
618 (void) printf("%s:", _nc_first_name(qp->tterm.term_names));
619 for (j = 0; j < qp->nuses; j++)
620 (void) printf(" %s", qp->uses[j].name);
625 ExitProgram(EXIT_SUCCESS);
628 /* maybe we want a reverse-dependency listing? */
629 if (invert_dependencies) {
639 for (i = 0; i < rp->nuses; i++)
640 if (_nc_name_match(qp->tterm.term_names,
641 rp->uses[i].name, "|")) {
642 if (matchcount++ == 0)
644 _nc_first_name(qp->tterm.term_names));
646 _nc_first_name(rp->tterm.term_names));
653 ExitProgram(EXIT_SUCCESS);
657 * If we get this far, user wants a simple terminal type listing.
660 code = typelist(argc - optind, argv + optind, header, hook);
661 } else if (all_dirs) {
669 for (pass = 0; pass < 2; ++pass) {
672 _nc_first_db(&state, &offset);
673 while ((path = _nc_next_db(&state, &offset)) != 0) {
675 eargv[count] = strmalloc(path);
680 eargv = allocArgv(count);
682 code = typelist((int) count, eargv, header, hook);
690 char **eargv = allocArgv(2);
693 _nc_first_db(&state, &offset);
694 if ((path = _nc_next_db(&state, &offset)) != 0) {
695 eargv[count++] = strmalloc(path);
698 code = typelist((int) count, eargv, header, hook);