version 1.13, 2011/11/14 10:07:06 |
version 1.15, 2011/11/20 15:43:14 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
|
* Copyright (c) 2011 Ingo Schwarze <schwarze@openbsd.org> |
* |
* |
* Permission to use, copy, modify, and distribute this software for any |
* Permission to use, copy, modify, and distribute this software for any |
* purpose with or without fee is hereby granted, provided that the above |
* purpose with or without fee is hereby granted, provided that the above |
|
|
#include "apropos_db.h" |
#include "apropos_db.h" |
#include "mandoc.h" |
#include "mandoc.h" |
|
|
|
/* |
|
* List of paths to be searched for manual databases. |
|
*/ |
|
struct manpaths { |
|
int sz; |
|
char **paths; |
|
}; |
|
|
static int cmp(const void *, const void *); |
static int cmp(const void *, const void *); |
static void list(struct rec *, size_t, void *); |
static void list(struct res *, size_t, void *); |
|
static int manpath_add(struct manpaths *, const char *); |
|
static int manpath_parse(struct manpaths *, char *); |
static void usage(void); |
static void usage(void); |
|
|
static char *progname; |
static char *progname; |
Line 37 static char *progname; |
|
Line 48 static char *progname; |
|
int |
int |
main(int argc, char *argv[]) |
main(int argc, char *argv[]) |
{ |
{ |
int ch; |
int i, ch, rc; |
size_t sz; |
struct manpaths paths; |
char *buf; |
size_t terms; |
struct opts opts; |
struct opts opts; |
struct expr *e; |
struct expr *e; |
extern int optind; |
extern int optind; |
extern char *optarg; |
extern char *optarg; |
|
|
memset(&opts, 0, sizeof(struct opts)); |
|
|
|
progname = strrchr(argv[0], '/'); |
progname = strrchr(argv[0], '/'); |
if (progname == NULL) |
if (progname == NULL) |
progname = argv[0]; |
progname = argv[0]; |
else |
else |
++progname; |
++progname; |
|
|
while (-1 != (ch = getopt(argc, argv, "S:s:"))) |
memset(&paths, 0, sizeof(struct manpaths)); |
|
memset(&opts, 0, sizeof(struct opts)); |
|
|
|
e = NULL; |
|
rc = 0; |
|
|
|
while (-1 != (ch = getopt(argc, argv, "m:S:s:"))) |
switch (ch) { |
switch (ch) { |
|
case ('m'): |
|
if ( ! manpath_parse(&paths, optarg)) |
|
goto out; |
|
break; |
case ('S'): |
case ('S'): |
opts.arch = optarg; |
opts.arch = optarg; |
break; |
break; |
Line 63 main(int argc, char *argv[]) |
|
Line 82 main(int argc, char *argv[]) |
|
break; |
break; |
default: |
default: |
usage(); |
usage(); |
return(EXIT_FAILURE); |
goto out; |
} |
} |
|
|
argc -= optind; |
argc -= optind; |
argv += optind; |
argv += optind; |
|
|
if (0 == argc) |
if (0 == argc) { |
return(EXIT_SUCCESS); |
rc = 1; |
|
goto out; |
/* |
|
* Collapse expressions into a single string. |
|
* First count up the contained strings, adding a space at the |
|
* end of each (plus nil-terminator). Then merge. |
|
*/ |
|
|
|
for (sz = 0, ch = 0; ch < argc; ch++) |
|
sz += strlen(argv[ch]) + 1; |
|
|
|
buf = mandoc_malloc(++sz); |
|
|
|
for (*buf = '\0', ch = 0; ch < argc; ch++) { |
|
strlcat(buf, argv[ch], sz); |
|
strlcat(buf, " ", sz); |
|
} |
} |
|
|
buf[sz - 2] = '\0'; |
if (0 == paths.sz && ! manpath_add(&paths, ".")) |
|
goto out; |
|
|
if (NULL == (e = exprcomp(buf))) { |
if (NULL == (e = exprcomp(argc, argv, &terms))) { |
|
/* FIXME: be more specific about this. */ |
fprintf(stderr, "Bad expression\n"); |
fprintf(stderr, "Bad expression\n"); |
free(buf); |
goto out; |
return(EXIT_FAILURE); |
|
} |
} |
|
|
free(buf); |
rc = apropos_search |
|
(paths.sz, paths.paths, |
|
&opts, e, terms, NULL, list); |
|
|
/* |
/* FIXME: report an error based on ch. */ |
* Configure databases. |
|
* The keyword database is a btree that allows for duplicate |
|
* entries. |
|
* The index database is a recno. |
|
*/ |
|
|
|
apropos_search(&opts, e, NULL, list); |
out: |
|
for (i = 0; i < paths.sz; i++) |
|
free(paths.paths[i]); |
|
|
|
free(paths.paths); |
exprfree(e); |
exprfree(e); |
return(EXIT_SUCCESS); |
|
|
return(rc ? EXIT_SUCCESS : EXIT_FAILURE); |
} |
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static void |
static void |
list(struct rec *res, size_t sz, void *arg) |
list(struct res *res, size_t sz, void *arg) |
{ |
{ |
int i; |
int i; |
|
|
qsort(res, sz, sizeof(struct rec), cmp); |
qsort(res, sz, sizeof(struct res), cmp); |
|
|
for (i = 0; i < (int)sz; i++) |
for (i = 0; i < (int)sz; i++) |
printf("%s(%s%s%s) - %s\n", res[i].title, |
printf("%s(%s%s%s) - %s\n", res[i].title, |
|
|
cmp(const void *p1, const void *p2) |
cmp(const void *p1, const void *p2) |
{ |
{ |
|
|
return(strcmp(((const struct rec *)p1)->title, |
return(strcmp(((const struct res *)p1)->title, |
((const struct rec *)p2)->title)); |
((const struct res *)p2)->title)); |
} |
} |
|
|
static void |
static void |
|
|
{ |
{ |
|
|
fprintf(stderr, "usage: %s " |
fprintf(stderr, "usage: %s " |
"[-I] " |
"[-m dirs] " |
"[-S arch] " |
"[-S arch] " |
"[-s section] " |
"[-s section] " |
"EXPR\n", |
"expression...\n", progname); |
progname); |
} |
|
|
|
/* |
|
* Parse a FULL pathname from a colon-separated list of arrays. |
|
*/ |
|
static int |
|
manpath_parse(struct manpaths *dirs, char *path) |
|
{ |
|
char *dir; |
|
|
|
for (dir = strtok(path, ":"); dir; dir = strtok(NULL, ":")) |
|
if ( ! manpath_add(dirs, dir)) |
|
return(0); |
|
|
|
return(1); |
|
} |
|
|
|
/* |
|
* Add a directory to the array. |
|
* Grow the array one-by-one for simplicity's sake. |
|
* Return 0 if the directory is not a real path. |
|
*/ |
|
static int |
|
manpath_add(struct manpaths *dirs, const char *dir) |
|
{ |
|
char buf[PATH_MAX]; |
|
char *cp; |
|
|
|
if (NULL == (cp = realpath(dir, buf))) { |
|
fprintf(stderr, "%s: Invalid path\n", dir); |
|
return(0); |
|
} |
|
|
|
dirs->paths = mandoc_realloc |
|
(dirs->paths, |
|
((size_t)dirs->sz + 1) * sizeof(char *)); |
|
|
|
dirs->paths[dirs->sz++] = mandoc_strdup(cp); |
|
return(1); |
} |
} |