version 1.11, 2011/11/24 12:54:19 |
version 1.19, 2011/12/01 23:46:26 |
|
|
/* $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 |
|
|
#endif |
#endif |
|
|
#include <sys/param.h> |
#include <sys/param.h> |
|
#include <sys/types.h> |
|
#include <sys/stat.h> |
|
|
#include <assert.h> |
#include <assert.h> |
#include <dirent.h> |
#include <dirent.h> |
|
|
#include <stdint.h> |
#include <stdint.h> |
#include <stdlib.h> |
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
|
#include <unistd.h> |
|
|
|
#include <arpa/inet.h> |
|
|
#ifdef __linux__ |
#ifdef __linux__ |
# include <db_185.h> |
# include <db_185.h> |
#else |
#else |
|
|
#define MANDOC_BUFSZ BUFSIZ |
#define MANDOC_BUFSZ BUFSIZ |
#define MANDOC_SLOP 1024 |
#define MANDOC_SLOP 1024 |
|
|
|
#define MANDOC_SRC 0x1 |
|
#define MANDOC_FORM 0x2 |
|
|
/* Tiny list for files. No need to bring in QUEUE. */ |
/* Tiny list for files. No need to bring in QUEUE. */ |
|
|
struct of { |
struct of { |
char *fname; /* heap-allocated */ |
char *fname; /* heap-allocated */ |
|
char *sec; |
|
char *arch; |
|
char *title; |
|
int src_form; |
struct of *next; /* NULL for last one */ |
struct of *next; /* NULL for last one */ |
struct of *first; /* first in list */ |
struct of *first; /* first in list */ |
}; |
}; |
Line 87 static void dbt_put(DB *, const char *, DBT *, DBT |
|
Line 100 static void dbt_put(DB *, const char *, DBT *, DBT |
|
static void hash_put(DB *, const struct buf *, uint64_t); |
static void hash_put(DB *, const struct buf *, uint64_t); |
static void hash_reset(DB **); |
static void hash_reset(DB **); |
static void index_merge(const struct of *, struct mparse *, |
static void index_merge(const struct of *, struct mparse *, |
struct buf *, struct buf *, |
struct buf *, struct buf *, DB *, |
DB *, DB *, const char *, |
DB *, const char *, DB *, const char *, |
DB *, const char *, int, |
|
recno_t, const recno_t *, size_t); |
recno_t, const recno_t *, size_t); |
static void index_prune(const struct of *, DB *, |
static void index_prune(const struct of *, DB *, |
const char *, DB *, const char *, |
const char *, DB *, const char *, |
int, recno_t *, recno_t **, size_t *); |
recno_t *, recno_t **, size_t *); |
static void ofile_argbuild(char *[], int, int, struct of **); |
static void ofile_argbuild(int, char *[], struct of **); |
static int ofile_dirbuild(const char *, int, struct of **); |
static int ofile_dirbuild(const char *, const char *, |
|
const char *, int, struct of **); |
static void ofile_free(struct of *); |
static void ofile_free(struct of *); |
|
static void pformatted(DB *, struct buf *, struct buf *, |
|
const struct of *); |
static int pman_node(MAN_ARGS); |
static int pman_node(MAN_ARGS); |
static void pmdoc_node(MDOC_ARGS); |
static void pmdoc_node(MDOC_ARGS); |
static void pmdoc_An(MDOC_ARGS); |
static void pmdoc_An(MDOC_ARGS); |
Line 243 static const pmdoc_nf mdocs[MDOC_MAX] = { |
|
Line 258 static const pmdoc_nf mdocs[MDOC_MAX] = { |
|
}; |
}; |
|
|
static const char *progname; |
static const char *progname; |
|
static int use_all; /* Use all directories and files. */ |
|
static int verb; /* Output verbosity level. */ |
|
|
int |
int |
main(int argc, char *argv[]) |
main(int argc, char *argv[]) |
Line 253 main(int argc, char *argv[]) |
|
Line 270 main(int argc, char *argv[]) |
|
const char *dir; |
const char *dir; |
char ibuf[MAXPATHLEN], /* index fname */ |
char ibuf[MAXPATHLEN], /* index fname */ |
fbuf[MAXPATHLEN]; /* btree fname */ |
fbuf[MAXPATHLEN]; /* btree fname */ |
int verb, /* output verbosity */ |
int ch, i, flags; |
ch, i, flags; |
|
DB *idx, /* index database */ |
DB *idx, /* index database */ |
*db, /* keyword database */ |
*db, /* keyword database */ |
*hash; /* temporary keyword hashtable */ |
*hash; /* temporary keyword hashtable */ |
BTREEINFO info; /* btree configuration */ |
BTREEINFO info; /* btree configuration */ |
recno_t maxrec; /* supremum of all records */ |
recno_t maxrec; /* last record number in the index */ |
recno_t *recs; /* buffer of empty records */ |
recno_t *recs; /* the numbers of all empty records */ |
size_t sz1, sz2, |
size_t sz1, sz2, |
recsz, /* buffer size of recs */ |
recsz, /* number of allocated slots in recs */ |
reccur; /* valid number of recs */ |
reccur; /* current number of empty records */ |
struct buf buf, /* keyword buffer */ |
struct buf buf, /* keyword buffer */ |
dbuf; /* description buffer */ |
dbuf; /* description buffer */ |
struct of *of; /* list of files for processing */ |
struct of *of; /* list of files for processing */ |
Line 279 main(int argc, char *argv[]) |
|
Line 295 main(int argc, char *argv[]) |
|
memset(&dirs, 0, sizeof(struct manpaths)); |
memset(&dirs, 0, sizeof(struct manpaths)); |
|
|
verb = 0; |
verb = 0; |
|
use_all = 0; |
of = NULL; |
of = NULL; |
db = idx = NULL; |
db = idx = NULL; |
mp = NULL; |
mp = NULL; |
Line 289 main(int argc, char *argv[]) |
|
Line 306 main(int argc, char *argv[]) |
|
op = OP_NEW; |
op = OP_NEW; |
dir = NULL; |
dir = NULL; |
|
|
while (-1 != (ch = getopt(argc, argv, "d:u:v"))) |
while (-1 != (ch = getopt(argc, argv, "ad:u:v"))) |
switch (ch) { |
switch (ch) { |
|
case ('a'): |
|
use_all = 1; |
|
break; |
case ('d'): |
case ('d'): |
dir = optarg; |
dir = optarg; |
op = OP_UPDATE; |
op = OP_UPDATE; |
Line 347 main(int argc, char *argv[]) |
|
Line 367 main(int argc, char *argv[]) |
|
if (NULL == db) { |
if (NULL == db) { |
perror(fbuf); |
perror(fbuf); |
exit((int)MANDOCLEVEL_SYSERR); |
exit((int)MANDOCLEVEL_SYSERR); |
} else if (NULL == db) { |
} else if (NULL == idx) { |
perror(ibuf); |
perror(ibuf); |
exit((int)MANDOCLEVEL_SYSERR); |
exit((int)MANDOCLEVEL_SYSERR); |
} |
} |
Line 357 main(int argc, char *argv[]) |
|
Line 377 main(int argc, char *argv[]) |
|
printf("%s: Opened\n", ibuf); |
printf("%s: Opened\n", ibuf); |
} |
} |
|
|
ofile_argbuild(argv, argc, verb, &of); |
ofile_argbuild(argc, argv, &of); |
if (NULL == of) |
if (NULL == of) |
goto out; |
goto out; |
|
|
of = of->first; |
of = of->first; |
|
|
index_prune(of, db, fbuf, idx, ibuf, verb, |
index_prune(of, db, fbuf, idx, ibuf, |
&maxrec, &recs, &recsz); |
&maxrec, &recs, &recsz); |
|
|
if (OP_UPDATE == op) |
/* |
index_merge(of, mp, &dbuf, &buf, hash, |
* Go to the root of the respective manual tree |
db, fbuf, idx, ibuf, verb, |
* such that .so links work. In case of failure, |
|
* just prod on, even though .so links won't work. |
|
*/ |
|
|
|
if (OP_UPDATE == op) { |
|
chdir(dir); |
|
index_merge(of, mp, &dbuf, &buf, hash, |
|
db, fbuf, idx, ibuf, |
maxrec, recs, reccur); |
maxrec, recs, reccur); |
|
} |
|
|
goto out; |
goto out; |
} |
} |
Line 400 main(int argc, char *argv[]) |
|
Line 428 main(int argc, char *argv[]) |
|
sz2 = strlcat(ibuf, MANDOC_IDX, MAXPATHLEN); |
sz2 = strlcat(ibuf, MANDOC_IDX, MAXPATHLEN); |
|
|
if (sz1 >= MAXPATHLEN || sz2 >= MAXPATHLEN) { |
if (sz1 >= MAXPATHLEN || sz2 >= MAXPATHLEN) { |
fprintf(stderr, "%s: Path too long\n", |
fprintf(stderr, "%s: Path too long\n", |
dirs.paths[i]); |
dirs.paths[i]); |
exit((int)MANDOCLEVEL_BADARG); |
exit((int)MANDOCLEVEL_BADARG); |
} |
} |
|
|
|
if (db) |
|
(*db->close)(db); |
|
if (idx) |
|
(*idx->close)(idx); |
|
|
db = dbopen(fbuf, flags, 0644, DB_BTREE, &info); |
db = dbopen(fbuf, flags, 0644, DB_BTREE, &info); |
idx = dbopen(ibuf, flags, 0644, DB_RECNO, NULL); |
idx = dbopen(ibuf, flags, 0644, DB_RECNO, NULL); |
|
|
if (NULL == db) { |
if (NULL == db) { |
perror(fbuf); |
perror(fbuf); |
exit((int)MANDOCLEVEL_SYSERR); |
exit((int)MANDOCLEVEL_SYSERR); |
} else if (NULL == db) { |
} else if (NULL == idx) { |
perror(ibuf); |
perror(ibuf); |
exit((int)MANDOCLEVEL_SYSERR); |
exit((int)MANDOCLEVEL_SYSERR); |
} |
} |
Line 424 main(int argc, char *argv[]) |
|
Line 457 main(int argc, char *argv[]) |
|
ofile_free(of); |
ofile_free(of); |
of = NULL; |
of = NULL; |
|
|
if ( ! ofile_dirbuild(dirs.paths[i], verb, &of)) |
if ( ! ofile_dirbuild(dirs.paths[i], NULL, NULL, |
|
0, &of)) |
exit((int)MANDOCLEVEL_SYSERR); |
exit((int)MANDOCLEVEL_SYSERR); |
|
|
if (NULL == of) |
if (NULL == of) |
Line 432 main(int argc, char *argv[]) |
|
Line 466 main(int argc, char *argv[]) |
|
|
|
of = of->first; |
of = of->first; |
|
|
index_merge(of, mp, &dbuf, &buf, hash, db, fbuf, |
/* |
idx, ibuf, verb, maxrec, recs, reccur); |
* Go to the root of the respective manual tree |
|
* such that .so links work. In case of failure, |
|
* just prod on, even though .so links won't work. |
|
*/ |
|
|
|
chdir(dirs.paths[i]); |
|
index_merge(of, mp, &dbuf, &buf, hash, db, fbuf, |
|
idx, ibuf, maxrec, recs, reccur); |
} |
} |
|
|
out: |
out: |
|
|
|
|
void |
void |
index_merge(const struct of *of, struct mparse *mp, |
index_merge(const struct of *of, struct mparse *mp, |
struct buf *dbuf, struct buf *buf, |
struct buf *dbuf, struct buf *buf, DB *hash, |
DB *hash, DB *db, const char *dbf, |
DB *db, const char *dbf, DB *idx, const char *idxf, |
DB *idx, const char *idxf, int verb, |
|
recno_t maxrec, const recno_t *recs, size_t reccur) |
recno_t maxrec, const recno_t *recs, size_t reccur) |
{ |
{ |
recno_t rec; |
recno_t rec; |
Line 474 index_merge(const struct of *of, struct mparse *mp, |
|
Line 514 index_merge(const struct of *of, struct mparse *mp, |
|
|
|
for (rec = 0; of; of = of->next) { |
for (rec = 0; of; of = of->next) { |
fn = of->fname; |
fn = of->fname; |
|
|
|
/* |
|
* Reclaim an empty index record, if available. |
|
*/ |
|
|
if (reccur > 0) { |
if (reccur > 0) { |
--reccur; |
--reccur; |
rec = recs[(int)reccur]; |
rec = recs[(int)reccur]; |
Line 485 index_merge(const struct of *of, struct mparse *mp, |
|
Line 530 index_merge(const struct of *of, struct mparse *mp, |
|
|
|
mparse_reset(mp); |
mparse_reset(mp); |
hash_reset(&hash); |
hash_reset(&hash); |
|
mdoc = NULL; |
|
man = NULL; |
|
|
if (mparse_readfd(mp, -1, fn) >= MANDOCLEVEL_FATAL) { |
/* |
fprintf(stderr, "%s: Parse failure\n", fn); |
* Try interpreting the file as mdoc(7) or man(7) |
continue; |
* source code, unless it is already known to be |
|
* formatted. Fall back to formatted mode. |
|
*/ |
|
|
|
if ((MANDOC_SRC & of->src_form || |
|
! (MANDOC_FORM & of->src_form)) && |
|
MANDOCLEVEL_FATAL > mparse_readfd(mp, -1, fn)) |
|
mparse_result(mp, &mdoc, &man); |
|
|
|
if (NULL != mdoc) { |
|
msec = mdoc_meta(mdoc)->msec; |
|
arch = mdoc_meta(mdoc)->arch; |
|
mtitle = mdoc_meta(mdoc)->title; |
|
} else if (NULL != man) { |
|
msec = man_meta(man)->msec; |
|
arch = NULL; |
|
mtitle = man_meta(man)->title; |
|
} else { |
|
msec = of->sec; |
|
arch = of->arch; |
|
mtitle = of->title; |
} |
} |
|
|
mparse_result(mp, &mdoc, &man); |
/* |
if (NULL == mdoc && NULL == man) |
* By default, skip a file if the manual section |
continue; |
* and architecture given in the file disagree |
|
* with the directory where the file is located. |
|
*/ |
|
|
msec = NULL != mdoc ? |
if (0 == use_all) { |
mdoc_meta(mdoc)->msec : man_meta(man)->msec; |
assert(of->sec); |
mtitle = NULL != mdoc ? |
assert(msec); |
mdoc_meta(mdoc)->title : man_meta(man)->title; |
if (strcmp(msec, of->sec)) |
arch = NULL != mdoc ? |
continue; |
mdoc_meta(mdoc)->arch : NULL; |
|
|
|
|
if (NULL == arch) { |
|
if (NULL != of->arch) |
|
continue; |
|
} else if (NULL == of->arch || |
|
strcmp(arch, of->arch)) |
|
continue; |
|
} |
|
|
if (NULL == arch) |
if (NULL == arch) |
arch = ""; |
arch = ""; |
|
|
/* |
/* |
|
* By default, skip a file if the title given |
|
* in the file disagrees with the file name. |
|
* If both agree, use the file name as the title, |
|
* because the one in the file usually is all caps. |
|
*/ |
|
|
|
assert(of->title); |
|
assert(mtitle); |
|
|
|
if (0 == strcasecmp(mtitle, of->title)) |
|
mtitle = of->title; |
|
else if (0 == use_all) |
|
continue; |
|
|
|
/* |
* The index record value consists of a nil-terminated |
* The index record value consists of a nil-terminated |
* filename, a nil-terminated manual section, and a |
* filename, a nil-terminated manual section, and a |
* nil-terminated description. Since the description |
* nil-terminated description. Since the description |
Line 514 index_merge(const struct of *of, struct mparse *mp, |
|
Line 605 index_merge(const struct of *of, struct mparse *mp, |
|
*/ |
*/ |
|
|
dbuf->len = 0; |
dbuf->len = 0; |
|
buf_append(dbuf, mdoc ? "mdoc" : (man ? "man" : "cat")); |
buf_appendb(dbuf, fn, strlen(fn) + 1); |
buf_appendb(dbuf, fn, strlen(fn) + 1); |
buf_appendb(dbuf, msec, strlen(msec) + 1); |
buf_appendb(dbuf, msec, strlen(msec) + 1); |
buf_appendb(dbuf, mtitle, strlen(mtitle) + 1); |
buf_appendb(dbuf, mtitle, strlen(mtitle) + 1); |
Line 526 index_merge(const struct of *of, struct mparse *mp, |
|
Line 618 index_merge(const struct of *of, struct mparse *mp, |
|
if (mdoc) |
if (mdoc) |
pmdoc_node(hash, buf, dbuf, |
pmdoc_node(hash, buf, dbuf, |
mdoc_node(mdoc), mdoc_meta(mdoc)); |
mdoc_node(mdoc), mdoc_meta(mdoc)); |
else |
else if (man) |
pman_node(hash, buf, dbuf, man_node(man)); |
pman_node(hash, buf, dbuf, man_node(man)); |
|
else |
|
pformatted(hash, buf, dbuf, of); |
|
|
/* |
/* |
* Copy from the in-memory hashtable of pending keywords |
* Copy from the in-memory hashtable of pending keywords |
* into the database. |
* into the database. |
*/ |
*/ |
|
|
vbuf.rec = rec; |
vbuf.rec = htonl(rec); |
seq = R_FIRST; |
seq = R_FIRST; |
while (0 == (ch = (*hash->seq)(hash, &key, &val, seq))) { |
while (0 == (ch = (*hash->seq)(hash, &key, &val, seq))) { |
seq = R_NEXT; |
seq = R_NEXT; |
|
|
vbuf.mask = *(uint64_t *)val.data; |
vbuf.mask = *(uint64_t *)val.data; |
val.size = sizeof(struct db_val); |
val.size = sizeof(struct db_val); |
val.data = &vbuf; |
val.data = &vbuf; |
|
|
if (verb > 1) |
|
printf("%s: Added keyword: %s\n", |
|
fn, (char *)key.data); |
|
dbt_put(db, dbf, &key, &val); |
dbt_put(db, dbf, &key, &val); |
} |
} |
if (ch < 0) { |
if (ch < 0) { |
Line 569 index_merge(const struct of *of, struct mparse *mp, |
|
Line 658 index_merge(const struct of *of, struct mparse *mp, |
|
|
|
if (verb) |
if (verb) |
printf("%s: Added index\n", fn); |
printf("%s: Added index\n", fn); |
|
|
dbt_put(idx, idxf, &key, &val); |
dbt_put(idx, idxf, &key, &val); |
} |
} |
} |
} |
Line 581 index_merge(const struct of *of, struct mparse *mp, |
|
Line 671 index_merge(const struct of *of, struct mparse *mp, |
|
*/ |
*/ |
static void |
static void |
index_prune(const struct of *ofile, DB *db, const char *dbf, |
index_prune(const struct of *ofile, DB *db, const char *dbf, |
DB *idx, const char *idxf, int verb, |
DB *idx, const char *idxf, |
recno_t *maxrec, recno_t **recs, size_t *recsz) |
recno_t *maxrec, recno_t **recs, size_t *recsz) |
{ |
{ |
const struct of *of; |
const struct of *of; |
const char *fn; |
const char *fn, *cp; |
struct db_val *vbuf; |
struct db_val *vbuf; |
unsigned seq, sseq; |
unsigned seq, sseq; |
DBT key, val; |
DBT key, val; |
Line 597 index_prune(const struct of *ofile, DB *db, const char |
|
Line 687 index_prune(const struct of *ofile, DB *db, const char |
|
while (0 == (ch = (*idx->seq)(idx, &key, &val, seq))) { |
while (0 == (ch = (*idx->seq)(idx, &key, &val, seq))) { |
seq = R_NEXT; |
seq = R_NEXT; |
*maxrec = *(recno_t *)key.data; |
*maxrec = *(recno_t *)key.data; |
if (0 == val.size) { |
cp = val.data; |
if (reccur >= *recsz) { |
|
*recsz += MANDOC_SLOP; |
|
*recs = mandoc_realloc(*recs, |
|
*recsz * sizeof(recno_t)); |
|
} |
|
(*recs)[(int)reccur] = *maxrec; |
|
reccur++; |
|
continue; |
|
} |
|
|
|
fn = (char *)val.data; |
/* Deleted records are zero-sized. Skip them. */ |
|
|
|
if (0 == val.size) |
|
goto cont; |
|
|
|
/* |
|
* Make sure we're sane. |
|
* Read past our mdoc/man/cat type to the next string, |
|
* then make sure it's bounded by a NUL. |
|
* Failing any of these, we go into our error handler. |
|
*/ |
|
|
|
if (NULL == (fn = memchr(cp, '\0', val.size))) |
|
break; |
|
if (++fn - cp >= (int)val.size) |
|
break; |
|
if (NULL == memchr(fn, '\0', val.size - (fn - cp))) |
|
break; |
|
|
|
/* |
|
* Search for the file in those we care about. |
|
* XXX: build this into a tree. Too slow. |
|
*/ |
|
|
for (of = ofile; of; of = of->next) |
for (of = ofile; of; of = of->next) |
if (0 == strcmp(fn, of->fname)) |
if (0 == strcmp(fn, of->fname)) |
break; |
break; |
Line 616 index_prune(const struct of *ofile, DB *db, const char |
|
Line 720 index_prune(const struct of *ofile, DB *db, const char |
|
if (NULL == of) |
if (NULL == of) |
continue; |
continue; |
|
|
|
/* |
|
* Search through the keyword database, throwing out all |
|
* references to our file. |
|
*/ |
|
|
sseq = R_FIRST; |
sseq = R_FIRST; |
while (0 == (ch = (*db->seq)(db, &key, &val, sseq))) { |
while (0 == (ch = (*db->seq)(db, &key, &val, sseq))) { |
sseq = R_NEXT; |
sseq = R_NEXT; |
assert(sizeof(struct db_val) == val.size); |
if (sizeof(struct db_val) != val.size) |
|
break; |
|
|
vbuf = val.data; |
vbuf = val.data; |
if (*maxrec != vbuf->rec) |
if (*maxrec != ntohl(vbuf->rec)) |
continue; |
continue; |
if (verb) |
|
printf("%s: Deleted keyword: %s\n", |
if ((ch = (*db->del)(db, &key, R_CURSOR)) < 0) |
fn, (char *)key.data); |
|
ch = (*db->del)(db, &key, R_CURSOR); |
|
if (ch < 0) |
|
break; |
break; |
} |
} |
|
|
if (ch < 0) { |
if (ch < 0) { |
perror(dbf); |
perror(dbf); |
exit((int)MANDOCLEVEL_SYSERR); |
exit((int)MANDOCLEVEL_SYSERR); |
|
} else if (1 != ch) { |
|
fprintf(stderr, "%s: Corrupt database\n", dbf); |
|
exit((int)MANDOCLEVEL_SYSERR); |
} |
} |
|
|
if (verb) |
if (verb) |
Line 640 index_prune(const struct of *ofile, DB *db, const char |
|
Line 752 index_prune(const struct of *ofile, DB *db, const char |
|
|
|
val.size = 0; |
val.size = 0; |
ch = (*idx->put)(idx, &key, &val, R_CURSOR); |
ch = (*idx->put)(idx, &key, &val, R_CURSOR); |
if (ch < 0) { |
|
perror(idxf); |
|
exit((int)MANDOCLEVEL_SYSERR); |
|
} |
|
|
|
|
if (ch < 0) |
|
break; |
|
cont: |
if (reccur >= *recsz) { |
if (reccur >= *recsz) { |
*recsz += MANDOC_SLOP; |
*recsz += MANDOC_SLOP; |
*recs = mandoc_realloc |
*recs = mandoc_realloc |
Line 654 index_prune(const struct of *ofile, DB *db, const char |
|
Line 765 index_prune(const struct of *ofile, DB *db, const char |
|
(*recs)[(int)reccur] = *maxrec; |
(*recs)[(int)reccur] = *maxrec; |
reccur++; |
reccur++; |
} |
} |
|
|
|
if (ch < 0) { |
|
perror(idxf); |
|
exit((int)MANDOCLEVEL_SYSERR); |
|
} else if (1 != ch) { |
|
fprintf(stderr, "%s: Corrupt index\n", idxf); |
|
exit((int)MANDOCLEVEL_SYSERR); |
|
} |
|
|
(*maxrec)++; |
(*maxrec)++; |
} |
} |
|
|
Line 1178 pman_node(MAN_ARGS) |
|
Line 1298 pman_node(MAN_ARGS) |
|
return(0); |
return(0); |
} |
} |
|
|
|
/* |
|
* Parse a formatted manual page. |
|
* By necessity, this involves rather crude guesswork. |
|
*/ |
static void |
static void |
ofile_argbuild(char *argv[], int argc, int verb, struct of **of) |
pformatted(DB *hash, struct buf *buf, struct buf *dbuf, |
|
const struct of *of) |
{ |
{ |
int i; |
FILE *stream; |
|
char *line, *p; |
|
size_t len, plen; |
|
|
|
if (NULL == (stream = fopen(of->fname, "r"))) { |
|
perror(of->fname); |
|
return; |
|
} |
|
|
|
/* |
|
* Always use the title derived from the filename up front, |
|
* do not even try to find it in the file. This also makes |
|
* sure we don't end up with an orphan index record, even if |
|
* the file content turns out to be completely unintelligible. |
|
*/ |
|
|
|
buf->len = 0; |
|
buf_append(buf, of->title); |
|
hash_put(hash, buf, TYPE_Nm); |
|
|
|
while (NULL != (line = fgetln(stream, &len)) && '\n' != *line) |
|
/* Skip to first blank line. */ ; |
|
|
|
while (NULL != (line = fgetln(stream, &len)) && |
|
('\n' == *line || ' ' == *line)) |
|
/* Skip to first section header. */ ; |
|
|
|
/* |
|
* If no page content can be found, |
|
* reuse the page title as the page description. |
|
*/ |
|
|
|
if (NULL == (line = fgetln(stream, &len))) { |
|
buf_appendb(dbuf, buf->cp, buf->size); |
|
hash_put(hash, buf, TYPE_Nd); |
|
fclose(stream); |
|
return; |
|
} |
|
fclose(stream); |
|
|
|
/* |
|
* If there is a dash, skip to the text following it. |
|
*/ |
|
|
|
for (p = line, plen = len; plen; p++, plen--) |
|
if ('-' == *p) |
|
break; |
|
for ( ; plen; p++, plen--) |
|
if ('-' != *p && ' ' != *p && 8 != *p) |
|
break; |
|
if (0 == plen) { |
|
p = line; |
|
plen = len; |
|
} |
|
|
|
/* |
|
* Copy the rest of the line, but no more than 70 bytes. |
|
*/ |
|
|
|
if (70 < plen) |
|
plen = 70; |
|
p[plen-1] = '\0'; |
|
buf_appendb(dbuf, p, plen); |
|
buf->len = 0; |
|
buf_appendb(buf, p, plen); |
|
hash_put(hash, buf, TYPE_Nd); |
|
} |
|
|
|
static void |
|
ofile_argbuild(int argc, char *argv[], struct of **of) |
|
{ |
|
char buf[MAXPATHLEN]; |
|
char *sec, *arch, *title, *p; |
|
int i, src_form; |
struct of *nof; |
struct of *nof; |
|
|
for (i = 0; i < argc; i++) { |
for (i = 0; i < argc; i++) { |
|
|
|
/* |
|
* Try to infer the manual section, architecture and |
|
* page title from the path, assuming it looks like |
|
* man*[/<arch>]/<title>.<section> or |
|
* cat<section>[/<arch>]/<title>.0 |
|
*/ |
|
|
|
if (strlcpy(buf, argv[i], sizeof(buf)) >= sizeof(buf)) { |
|
fprintf(stderr, "%s: Path too long\n", argv[i]); |
|
continue; |
|
} |
|
sec = arch = title = NULL; |
|
src_form = 0; |
|
p = strrchr(buf, '\0'); |
|
while (p-- > buf) { |
|
if (NULL == sec && '.' == *p) { |
|
sec = p + 1; |
|
*p = '\0'; |
|
if ('0' == *sec) |
|
src_form |= MANDOC_FORM; |
|
else if ('1' <= *sec && '9' >= *sec) |
|
src_form |= MANDOC_SRC; |
|
continue; |
|
} |
|
if ('/' != *p) |
|
continue; |
|
if (NULL == title) { |
|
title = p + 1; |
|
*p = '\0'; |
|
continue; |
|
} |
|
if (strncmp("man", p + 1, 3)) { |
|
src_form |= MANDOC_SRC; |
|
arch = p + 1; |
|
} else if (strncmp("cat", p + 1, 3)) { |
|
src_form |= MANDOC_FORM; |
|
arch = p + 1; |
|
} |
|
break; |
|
} |
|
if (NULL == title) |
|
title = buf; |
|
|
|
/* |
|
* Build the file structure. |
|
*/ |
|
|
nof = mandoc_calloc(1, sizeof(struct of)); |
nof = mandoc_calloc(1, sizeof(struct of)); |
nof->fname = strdup(argv[i]); |
nof->fname = mandoc_strdup(argv[i]); |
|
if (NULL != sec) |
|
nof->sec = mandoc_strdup(sec); |
|
if (NULL != arch) |
|
nof->arch = mandoc_strdup(arch); |
|
nof->title = mandoc_strdup(title); |
|
nof->src_form = src_form; |
|
|
|
/* |
|
* Add the structure to the list. |
|
*/ |
|
|
if (verb > 2) |
if (verb > 2) |
printf("%s: Scheduling\n", argv[i]); |
printf("%s: Scheduling\n", argv[i]); |
if (NULL == *of) { |
if (NULL == *of) { |
Line 1209 ofile_argbuild(char *argv[], int argc, int verb, struc |
|
Line 1466 ofile_argbuild(char *argv[], int argc, int verb, struc |
|
* Pass in a pointer to a NULL structure for the first invocation. |
* Pass in a pointer to a NULL structure for the first invocation. |
*/ |
*/ |
static int |
static int |
ofile_dirbuild(const char *dir, int verb, struct of **of) |
ofile_dirbuild(const char *dir, const char* psec, const char *parch, |
|
int p_src_form, struct of **of) |
{ |
{ |
char buf[MAXPATHLEN]; |
char buf[MAXPATHLEN]; |
|
struct stat sb; |
size_t sz; |
size_t sz; |
DIR *d; |
DIR *d; |
const char *fn; |
const char *fn, *sec, *arch; |
|
char *p, *q, *suffix; |
struct of *nof; |
struct of *nof; |
struct dirent *dp; |
struct dirent *dp; |
|
int src_form; |
|
|
if (NULL == (d = opendir(dir))) { |
if (NULL == (d = opendir(dir))) { |
perror(dir); |
perror(dir); |
Line 1225 ofile_dirbuild(const char *dir, int verb, struct of ** |
|
Line 1486 ofile_dirbuild(const char *dir, int verb, struct of ** |
|
|
|
while (NULL != (dp = readdir(d))) { |
while (NULL != (dp = readdir(d))) { |
fn = dp->d_name; |
fn = dp->d_name; |
|
|
|
if ('.' == *fn) |
|
continue; |
|
|
|
src_form = p_src_form; |
|
|
if (DT_DIR == dp->d_type) { |
if (DT_DIR == dp->d_type) { |
if (0 == strcmp(".", fn)) |
sec = psec; |
|
arch = parch; |
|
|
|
/* |
|
* By default, only use directories called: |
|
* man<section>/[<arch>/] or |
|
* cat<section>/[<arch>/] |
|
*/ |
|
|
|
if (NULL == sec) { |
|
if(0 == strncmp("man", fn, 3)) { |
|
src_form |= MANDOC_SRC; |
|
sec = fn + 3; |
|
} else if (0 == strncmp("cat", fn, 3)) { |
|
src_form |= MANDOC_FORM; |
|
sec = fn + 3; |
|
} else if (use_all) |
|
sec = fn; |
|
else |
|
continue; |
|
} else if (NULL == arch && (use_all || |
|
NULL == strchr(fn, '.'))) |
|
arch = fn; |
|
else if (0 == use_all) |
continue; |
continue; |
if (0 == strcmp("..", fn)) |
|
continue; |
|
|
|
buf[0] = '\0'; |
buf[0] = '\0'; |
strlcat(buf, dir, MAXPATHLEN); |
strlcat(buf, dir, MAXPATHLEN); |
strlcat(buf, "/", MAXPATHLEN); |
strlcat(buf, "/", MAXPATHLEN); |
sz = strlcat(buf, fn, MAXPATHLEN); |
sz = strlcat(buf, fn, MAXPATHLEN); |
|
|
if (sz < MAXPATHLEN) { |
if (MAXPATHLEN <= sz) { |
if ( ! ofile_dirbuild(buf, verb, of)) |
fprintf(stderr, "%s: Path too long\n", dir); |
return(0); |
return(0); |
continue; |
} |
} else if (sz < MAXPATHLEN) |
|
continue; |
if (verb > 2) |
|
printf("%s: Scanning\n", buf); |
|
|
fprintf(stderr, "%s: Path too long\n", dir); |
if ( ! ofile_dirbuild(buf, sec, arch, |
return(0); |
src_form, of)) |
|
return(0); |
} |
} |
if (DT_REG != dp->d_type) |
if (DT_REG != dp->d_type || |
|
(NULL == psec && !use_all) || |
|
!strcmp(MANDOC_DB, fn) || |
|
!strcmp(MANDOC_IDX, fn)) |
continue; |
continue; |
|
|
if (0 == strcmp(MANDOC_DB, fn) || |
/* |
0 == strcmp(MANDOC_IDX, fn)) |
* By default, skip files where the file name suffix |
continue; |
* does not agree with the section directory |
|
* they are located in. |
|
*/ |
|
|
|
suffix = strrchr(fn, '.'); |
|
if (0 == use_all) { |
|
if (NULL == suffix) |
|
continue; |
|
if ((MANDOC_SRC & src_form && |
|
strcmp(suffix + 1, psec)) || |
|
(MANDOC_FORM & src_form && |
|
strcmp(suffix + 1, "0"))) |
|
continue; |
|
} |
|
if (NULL != suffix) { |
|
if ('0' == suffix[1]) |
|
src_form |= MANDOC_FORM; |
|
else if ('1' <= suffix[1] && '9' >= suffix[1]) |
|
src_form |= MANDOC_SRC; |
|
} |
|
|
|
|
|
/* |
|
* Skip formatted manuals if a source version is |
|
* available. Ignore the age: it is very unlikely |
|
* that people install newer formatted base manuals |
|
* when they used to have source manuals before, |
|
* and in ports, old manuals get removed on update. |
|
*/ |
|
if (0 == use_all && MANDOC_FORM & src_form && |
|
NULL != psec) { |
|
buf[0] = '\0'; |
|
strlcat(buf, dir, MAXPATHLEN); |
|
p = strrchr(buf, '/'); |
|
if (NULL == p) |
|
p = buf; |
|
else |
|
p++; |
|
if (0 == strncmp("cat", p, 3)) |
|
memcpy(p, "man", 3); |
|
strlcat(buf, "/", MAXPATHLEN); |
|
sz = strlcat(buf, fn, MAXPATHLEN); |
|
if (sz >= MAXPATHLEN) { |
|
fprintf(stderr, "%s: Path too long\n", buf); |
|
continue; |
|
} |
|
q = strrchr(buf, '.'); |
|
if (NULL != q && p < q++) { |
|
*q = '\0'; |
|
sz = strlcat(buf, psec, MAXPATHLEN); |
|
if (sz >= MAXPATHLEN) { |
|
fprintf(stderr, |
|
"%s: Path too long\n", buf); |
|
continue; |
|
} |
|
if (0 == stat(buf, &sb)) |
|
continue; |
|
} |
|
} |
|
|
buf[0] = '\0'; |
buf[0] = '\0'; |
strlcat(buf, dir, MAXPATHLEN); |
strlcat(buf, dir, MAXPATHLEN); |
strlcat(buf, "/", MAXPATHLEN); |
strlcat(buf, "/", MAXPATHLEN); |
sz = strlcat(buf, fn, MAXPATHLEN); |
sz = strlcat(buf, fn, MAXPATHLEN); |
if (sz >= MAXPATHLEN) { |
if (sz >= MAXPATHLEN) { |
fprintf(stderr, "%s: Path too long\n", dir); |
fprintf(stderr, "%s: Path too long\n", dir); |
return(0); |
continue; |
} |
} |
|
|
nof = mandoc_calloc(1, sizeof(struct of)); |
nof = mandoc_calloc(1, sizeof(struct of)); |
nof->fname = mandoc_strdup(buf); |
nof->fname = mandoc_strdup(buf); |
|
if (NULL != psec) |
|
nof->sec = mandoc_strdup(psec); |
|
if (NULL != parch) |
|
nof->arch = mandoc_strdup(parch); |
|
nof->src_form = src_form; |
|
|
|
/* |
|
* Remember the file name without the extension, |
|
* to be used as the page title in the database. |
|
*/ |
|
|
|
if (NULL != suffix) |
|
*suffix = '\0'; |
|
nof->title = mandoc_strdup(fn); |
|
|
|
/* |
|
* Add the structure to the list. |
|
*/ |
|
|
if (verb > 2) |
if (verb > 2) |
printf("%s: Scheduling\n", buf); |
printf("%s: Scheduling\n", buf); |
|
|
if (NULL == *of) { |
if (NULL == *of) { |
*of = nof; |
*of = nof; |
(*of)->first = nof; |
(*of)->first = nof; |
Line 1290 ofile_free(struct of *of) |
|
Line 1658 ofile_free(struct of *of) |
|
while (of) { |
while (of) { |
nof = of->next; |
nof = of->next; |
free(of->fname); |
free(of->fname); |
|
free(of->sec); |
|
free(of->arch); |
|
free(of->title); |
free(of); |
free(of); |
of = nof; |
of = nof; |
} |
} |