version 1.3, 2011/07/15 09:06:23 |
version 1.8, 2011/11/13 10:49:57 |
|
|
#include <sys/param.h> |
#include <sys/param.h> |
|
|
#include <assert.h> |
#include <assert.h> |
|
#include <dirent.h> |
#include <fcntl.h> |
#include <fcntl.h> |
#include <getopt.h> |
#include <getopt.h> |
#include <stdio.h> |
#include <stdio.h> |
|
|
#include "man.h" |
#include "man.h" |
#include "mdoc.h" |
#include "mdoc.h" |
#include "mandoc.h" |
#include "mandoc.h" |
|
#include "mandocdb.h" |
|
|
#define MANDOC_DB "mandoc.db" |
|
#define MANDOC_IDX "mandoc.index" |
|
#define MANDOC_BUFSZ BUFSIZ |
#define MANDOC_BUFSZ BUFSIZ |
#define MANDOC_FLAGS O_CREAT|O_TRUNC|O_RDWR |
|
#define MANDOC_SLOP 1024 |
#define MANDOC_SLOP 1024 |
|
|
/* Bit-fields. See mandocdb.8. */ |
/* Tiny list for files. No need to bring in QUEUE. */ |
|
|
#define TYPE_NAME 0x01 |
|
#define TYPE_FUNCTION 0x02 |
|
#define TYPE_UTILITY 0x04 |
|
#define TYPE_INCLUDES 0x08 |
|
#define TYPE_VARIABLE 0x10 |
|
#define TYPE_STANDARD 0x20 |
|
#define TYPE_AUTHOR 0x40 |
|
#define TYPE_CONFIG 0x80 |
|
#define TYPE_DESC 0x100 |
|
#define TYPE_XREF 0x200 |
|
#define TYPE_PATH 0x400 |
|
#define TYPE_ENV 0x800 |
|
#define TYPE_ERR 0x1000 |
|
|
|
struct of { |
struct of { |
char *fname; |
char *fname; /* heap-allocated */ |
struct of *next; |
struct of *next; /* NULL for last one */ |
|
struct of *first; /* first in list */ |
}; |
}; |
|
|
/* Buffer for storing growable data. */ |
/* Buffer for storing growable data. */ |
|
|
struct buf { |
struct buf { |
char *cp; |
char *cp; |
size_t len; |
size_t len; /* current length */ |
size_t size; |
size_t size; /* total buffer size */ |
}; |
}; |
|
|
/* Operation we're going to perform. */ |
/* Operation we're going to perform. */ |
|
|
enum op { |
enum op { |
OP_NEW = 0, /* new database */ |
OP_NEW = 0, /* new database */ |
OP_UPDATE, /* update entries in existing database */ |
OP_UPDATE, /* delete/add entries in existing database */ |
OP_DELETE /* delete entries from existing database */ |
OP_DELETE /* delete entries from existing database */ |
}; |
}; |
|
|
Line 102 static void hash_reset(DB **); |
|
Line 88 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 *, const char *, |
DB *, 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 *, |
recno_t *, recno_t **, size_t *); |
int, recno_t *, recno_t **, size_t *); |
|
static void ofile_argbuild(char *[], int, int, struct of **); |
|
static int ofile_dirbuild(const char *, int, struct of **); |
|
static void ofile_free(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 259 main(int argc, char *argv[]) |
|
Line 248 main(int argc, char *argv[]) |
|
{ |
{ |
struct mparse *mp; /* parse sequence */ |
struct mparse *mp; /* parse sequence */ |
enum op op; /* current operation */ |
enum op op; /* current operation */ |
const char *dir; /* result dir (default: cwd) */ |
const char *dir; |
char ibuf[MAXPATHLEN], /* index fname */ |
char ibuf[MAXPATHLEN], /* index fname */ |
fbuf[MAXPATHLEN]; /* btree fname */ |
fbuf[MAXPATHLEN]; /* btree fname */ |
int ch, verb, i; |
int verb, /* output verbosity */ |
|
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 */ |
enum mandoclevel ec; /* exit status */ |
|
BTREEINFO info; /* btree configuration */ |
BTREEINFO info; /* btree configuration */ |
recno_t maxrec; /* supremum of all records */ |
recno_t maxrec; /* supremum of all records */ |
recno_t *recs; /* buffer of empty records */ |
recno_t *recs; /* buffer of empty records */ |
size_t recsz, /* buffer size of recs */ |
size_t sz1, sz2, |
|
recsz, /* buffer size of recs */ |
reccur; /* valid number of recs */ |
reccur; /* valid number of recs */ |
struct buf buf, /* keyword buffer */ |
struct buf buf, /* keyword buffer */ |
dbuf; /* description buffer */ |
dbuf; /* description buffer */ |
struct of *ofile; |
struct of *of; /* list of files for processing */ |
extern int optind; |
extern int optind; |
extern char *optarg; |
extern char *optarg; |
|
|
Line 284 main(int argc, char *argv[]) |
|
Line 274 main(int argc, char *argv[]) |
|
else |
else |
++progname; |
++progname; |
|
|
ofile = NULL; |
|
dir = ""; |
|
verb = 0; |
verb = 0; |
|
of = NULL; |
db = idx = NULL; |
db = idx = NULL; |
mp = NULL; |
mp = NULL; |
hash = NULL; |
hash = NULL; |
Line 294 main(int argc, char *argv[]) |
|
Line 283 main(int argc, char *argv[]) |
|
recsz = reccur = 0; |
recsz = reccur = 0; |
maxrec = 0; |
maxrec = 0; |
op = OP_NEW; |
op = OP_NEW; |
ec = MANDOCLEVEL_SYSERR; |
dir = NULL; |
|
|
memset(&buf, 0, sizeof(struct buf)); |
while (-1 != (ch = getopt(argc, argv, "d:u:v"))) |
memset(&dbuf, 0, sizeof(struct buf)); |
|
|
|
while (-1 != (ch = getopt(argc, argv, "d:ruv"))) |
|
switch (ch) { |
switch (ch) { |
case ('d'): |
case ('d'): |
dir = optarg; |
dir = optarg; |
|
op = OP_UPDATE; |
break; |
break; |
case ('r'): |
case ('u'): |
|
dir = optarg; |
op = OP_DELETE; |
op = OP_DELETE; |
break; |
break; |
case ('u'): |
|
op = OP_UPDATE; |
|
break; |
|
case ('v'): |
case ('v'): |
verb++; |
verb++; |
break; |
break; |
Line 321 main(int argc, char *argv[]) |
|
Line 306 main(int argc, char *argv[]) |
|
argc -= optind; |
argc -= optind; |
argv += optind; |
argv += optind; |
|
|
ibuf[0] = ibuf[MAXPATHLEN - 2] = |
memset(&info, 0, sizeof(BTREEINFO)); |
fbuf[0] = fbuf[MAXPATHLEN - 2] = '\0'; |
info.flags = R_DUP; |
|
|
strlcat(fbuf, dir, MAXPATHLEN); |
mp = mparse_alloc(MPARSE_AUTO, MANDOCLEVEL_FATAL, NULL, NULL); |
strlcat(fbuf, MANDOC_DB, MAXPATHLEN); |
|
|
|
strlcat(ibuf, dir, MAXPATHLEN); |
memset(&buf, 0, sizeof(struct buf)); |
strlcat(ibuf, MANDOC_IDX, MAXPATHLEN); |
memset(&dbuf, 0, sizeof(struct buf)); |
|
|
if ('\0' != fbuf[MAXPATHLEN - 2] || |
buf.size = dbuf.size = MANDOC_BUFSZ; |
'\0' != ibuf[MAXPATHLEN - 2]) { |
|
fprintf(stderr, "%s: Path too long\n", dir); |
|
goto out; |
|
} |
|
|
|
/* |
buf.cp = mandoc_malloc(buf.size); |
* For the keyword database, open a BTREE database that allows |
dbuf.cp = mandoc_malloc(dbuf.size); |
* duplicates. |
|
* For the index database, use a standard RECNO database type. |
|
* Truncate the database if we're creating a new one. |
|
*/ |
|
|
|
memset(&info, 0, sizeof(BTREEINFO)); |
flags = OP_NEW == op ? O_CREAT|O_TRUNC|O_RDWR : O_CREAT|O_RDWR; |
info.flags = R_DUP; |
|
|
|
if (OP_NEW == op) { |
if (OP_UPDATE == op || OP_DELETE == op) { |
db = dbopen(fbuf, MANDOC_FLAGS, 0644, DB_BTREE, &info); |
ibuf[0] = fbuf[0] = '\0'; |
idx = dbopen(ibuf, MANDOC_FLAGS, 0644, DB_RECNO, NULL); |
|
} else { |
|
db = dbopen(fbuf, O_CREAT|O_RDWR, 0644, DB_BTREE, &info); |
|
idx = dbopen(ibuf, O_CREAT|O_RDWR, 0644, DB_RECNO, NULL); |
|
} |
|
|
|
if (NULL == db) { |
strlcat(fbuf, dir, MAXPATHLEN); |
perror(fbuf); |
strlcat(fbuf, "/", MAXPATHLEN); |
goto out; |
sz1 = strlcat(fbuf, MANDOC_DB, MAXPATHLEN); |
} else if (NULL == db) { |
|
perror(ibuf); |
|
goto out; |
|
} |
|
|
|
ofile = mandoc_calloc(argc, sizeof(struct of)); |
strlcat(ibuf, dir, MAXPATHLEN); |
for (i = 0; i < argc; i++) { |
strlcat(ibuf, "/", MAXPATHLEN); |
ofile[i].next = &ofile[i + 1]; |
sz2 = strlcat(ibuf, MANDOC_IDX, MAXPATHLEN); |
ofile[i].fname = argv[i]; |
|
} |
|
|
|
ofile[argc - 1].next = NULL; |
if (sz1 >= MAXPATHLEN || sz2 >= MAXPATHLEN) { |
|
fprintf(stderr, "%s: Path too long\n", dir); |
|
exit((int)MANDOCLEVEL_BADARG); |
|
} |
|
|
/* |
db = dbopen(fbuf, flags, 0644, DB_BTREE, &info); |
* If we're going to delete or update a database, remove the |
idx = dbopen(ibuf, flags, 0644, DB_RECNO, NULL); |
* entries now (both the index and all keywords pointing to it). |
|
* This doesn't actually remove them: it only sets their record |
|
* value lengths to zero. |
|
* While doing so, add the empty records to a list we'll access |
|
* later in re-adding entries to the database. |
|
*/ |
|
|
|
if (OP_DELETE == op || OP_UPDATE == op) |
if (NULL == db) { |
index_prune(ofile, db, fbuf, idx, ibuf, |
perror(fbuf); |
|
exit((int)MANDOCLEVEL_SYSERR); |
|
} else if (NULL == db) { |
|
perror(ibuf); |
|
exit((int)MANDOCLEVEL_SYSERR); |
|
} |
|
|
|
if (verb > 2) { |
|
printf("%s: Opened\n", fbuf); |
|
printf("%s: Opened\n", ibuf); |
|
} |
|
|
|
ofile_argbuild(argv, argc, verb, &of); |
|
if (NULL == of) |
|
goto out; |
|
|
|
of = of->first; |
|
|
|
index_prune(of, db, fbuf, idx, ibuf, verb, |
&maxrec, &recs, &recsz); |
&maxrec, &recs, &recsz); |
|
|
if (OP_DELETE == op) { |
if (OP_UPDATE == op) |
ec = MANDOCLEVEL_OK; |
index_merge(of, mp, &dbuf, &buf, hash, |
|
db, fbuf, idx, ibuf, verb, |
|
maxrec, recs, reccur); |
|
|
goto out; |
goto out; |
} |
} |
|
|
/* |
for (i = 0; i < argc; i++) { |
* Add records to the database. |
ibuf[0] = fbuf[0] = '\0'; |
* Try parsing each manual given on the command line. |
|
* If we fail, then emit an error and keep on going. |
|
* Take resulting trees and push them down into the database code. |
|
* Use the auto-parser and don't report any errors. |
|
*/ |
|
|
|
mp = mparse_alloc(MPARSE_AUTO, MANDOCLEVEL_FATAL, NULL, NULL); |
strlcat(fbuf, argv[i], MAXPATHLEN); |
|
strlcat(fbuf, "/", MAXPATHLEN); |
|
sz1 = strlcat(fbuf, MANDOC_DB, MAXPATHLEN); |
|
|
buf.size = dbuf.size = MANDOC_BUFSZ; |
strlcat(ibuf, argv[i], MAXPATHLEN); |
buf.cp = mandoc_malloc(buf.size); |
strlcat(ibuf, "/", MAXPATHLEN); |
dbuf.cp = mandoc_malloc(dbuf.size); |
sz2 = strlcat(ibuf, MANDOC_IDX, MAXPATHLEN); |
|
|
index_merge(ofile, mp, &dbuf, &buf, hash, db, |
if (sz1 >= MAXPATHLEN || sz2 >= MAXPATHLEN) { |
fbuf, idx, ibuf, maxrec, recs, reccur); |
fprintf(stderr, "%s: Path too long\n", argv[i]); |
|
exit((int)MANDOCLEVEL_BADARG); |
|
} |
|
|
ec = MANDOCLEVEL_OK; |
db = dbopen(fbuf, flags, 0644, DB_BTREE, &info); |
|
idx = dbopen(ibuf, flags, 0644, DB_RECNO, NULL); |
|
|
|
if (NULL == db) { |
|
perror(fbuf); |
|
exit((int)MANDOCLEVEL_SYSERR); |
|
} else if (NULL == db) { |
|
perror(ibuf); |
|
exit((int)MANDOCLEVEL_SYSERR); |
|
} |
|
|
|
if (verb > 2) { |
|
printf("%s: Truncated\n", fbuf); |
|
printf("%s: Truncated\n", ibuf); |
|
} |
|
|
|
ofile_free(of); |
|
of = NULL; |
|
|
|
if ( ! ofile_dirbuild(argv[i], verb, &of)) |
|
exit((int)MANDOCLEVEL_SYSERR); |
|
|
|
if (NULL == of) |
|
continue; |
|
|
|
of = of->first; |
|
|
|
index_merge(of, mp, &dbuf, &buf, hash, db, fbuf, |
|
idx, ibuf, verb, maxrec, recs, reccur); |
|
} |
|
|
out: |
out: |
if (db) |
if (db) |
(*db->close)(db); |
(*db->close)(db); |
|
|
if (mp) |
if (mp) |
mparse_free(mp); |
mparse_free(mp); |
|
|
free(ofile); |
ofile_free(of); |
free(buf.cp); |
free(buf.cp); |
free(dbuf.cp); |
free(dbuf.cp); |
free(recs); |
free(recs); |
|
|
return((int)ec); |
return(MANDOCLEVEL_OK); |
} |
} |
|
|
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 *db, const char *dbf, |
DB *hash, 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 514 index_merge(const struct of *of, struct mparse *mp, |
|
Line 525 index_merge(const struct of *of, struct mparse *mp, |
|
val.size = sizeof(vbuf); |
val.size = sizeof(vbuf); |
val.data = vbuf; |
val.data = vbuf; |
|
|
printf("%s: Added keyword: %s\n", |
if (verb > 1) |
fn, (char *)key.data); |
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 537 index_merge(const struct of *of, struct mparse *mp, |
|
Line 549 index_merge(const struct of *of, struct mparse *mp, |
|
val.data = dbuf->cp; |
val.data = dbuf->cp; |
val.size = dbuf->len; |
val.size = dbuf->len; |
|
|
printf("%s: Added index\n", fn); |
if (verb) |
|
printf("%s: Added index\n", fn); |
dbt_put(idx, idxf, &key, &val); |
dbt_put(idx, idxf, &key, &val); |
} |
} |
} |
} |
Line 550 index_merge(const struct of *of, struct mparse *mp, |
|
Line 563 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, |
DB *idx, const char *idxf, int verb, |
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; |
Line 590 index_prune(const struct of *ofile, DB *db, const char |
|
Line 603 index_prune(const struct of *ofile, DB *db, const char |
|
assert(8 == val.size); |
assert(8 == val.size); |
if (*maxrec != *(recno_t *)(val.data + 4)) |
if (*maxrec != *(recno_t *)(val.data + 4)) |
continue; |
continue; |
printf("%s: Deleted keyword: %s\n", |
if (verb) |
fn, (char *)key.data); |
printf("%s: Deleted keyword: %s\n", |
|
fn, (char *)key.data); |
ch = (*db->del)(db, &key, R_CURSOR); |
ch = (*db->del)(db, &key, R_CURSOR); |
if (ch < 0) |
if (ch < 0) |
break; |
break; |
Line 601 index_prune(const struct of *ofile, DB *db, const char |
|
Line 615 index_prune(const struct of *ofile, DB *db, const char |
|
exit((int)MANDOCLEVEL_SYSERR); |
exit((int)MANDOCLEVEL_SYSERR); |
} |
} |
|
|
printf("%s: Deleted index\n", fn); |
if (verb) |
|
printf("%s: Deleted index\n", fn); |
|
|
val.size = 0; |
val.size = 0; |
ch = (*idx->put)(idx, &key, &val, R_CURSOR); |
ch = (*idx->put)(idx, &key, &val, R_CURSOR); |
Line 696 pmdoc_An(MDOC_ARGS) |
|
Line 711 pmdoc_An(MDOC_ARGS) |
|
return; |
return; |
|
|
buf_appendmdoc(buf, n->child, 0); |
buf_appendmdoc(buf, n->child, 0); |
hash_put(hash, buf, TYPE_AUTHOR); |
hash_put(hash, buf, TYPE_An); |
} |
} |
|
|
static void |
static void |
Line 707 hash_reset(DB **db) |
|
Line 722 hash_reset(DB **db) |
|
if (NULL != (hash = *db)) |
if (NULL != (hash = *db)) |
(*hash->close)(hash); |
(*hash->close)(hash); |
|
|
*db = dbopen(NULL, MANDOC_FLAGS, 0644, DB_HASH, NULL); |
*db = dbopen(NULL, O_CREAT|O_RDWR, 0644, DB_HASH, NULL); |
if (NULL == *db) { |
if (NULL == *db) { |
perror("hash"); |
perror("hash"); |
exit((int)MANDOCLEVEL_SYSERR); |
exit((int)MANDOCLEVEL_SYSERR); |
Line 757 pmdoc_Fd(MDOC_ARGS) |
|
Line 772 pmdoc_Fd(MDOC_ARGS) |
|
buf_appendb(buf, start, (size_t)(end - start + 1)); |
buf_appendb(buf, start, (size_t)(end - start + 1)); |
buf_appendb(buf, "", 1); |
buf_appendb(buf, "", 1); |
|
|
hash_put(hash, buf, TYPE_INCLUDES); |
hash_put(hash, buf, TYPE_In); |
} |
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
Line 769 pmdoc_Cd(MDOC_ARGS) |
|
Line 784 pmdoc_Cd(MDOC_ARGS) |
|
return; |
return; |
|
|
buf_appendmdoc(buf, n->child, 0); |
buf_appendmdoc(buf, n->child, 0); |
hash_put(hash, buf, TYPE_CONFIG); |
hash_put(hash, buf, TYPE_Cd); |
} |
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
Line 783 pmdoc_In(MDOC_ARGS) |
|
Line 798 pmdoc_In(MDOC_ARGS) |
|
return; |
return; |
|
|
buf_append(buf, n->child->string); |
buf_append(buf, n->child->string); |
hash_put(hash, buf, TYPE_INCLUDES); |
hash_put(hash, buf, TYPE_In); |
} |
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
Line 809 pmdoc_Fn(MDOC_ARGS) |
|
Line 824 pmdoc_Fn(MDOC_ARGS) |
|
cp++; |
cp++; |
|
|
buf_append(buf, cp); |
buf_append(buf, cp); |
hash_put(hash, buf, TYPE_FUNCTION); |
hash_put(hash, buf, TYPE_Fn); |
} |
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
Line 823 pmdoc_St(MDOC_ARGS) |
|
Line 838 pmdoc_St(MDOC_ARGS) |
|
return; |
return; |
|
|
buf_append(buf, n->child->string); |
buf_append(buf, n->child->string); |
hash_put(hash, buf, TYPE_STANDARD); |
hash_put(hash, buf, TYPE_St); |
} |
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
Line 842 pmdoc_Xr(MDOC_ARGS) |
|
Line 857 pmdoc_Xr(MDOC_ARGS) |
|
} else |
} else |
buf_appendb(buf, ".", 2); |
buf_appendb(buf, ".", 2); |
|
|
hash_put(hash, buf, TYPE_XREF); |
hash_put(hash, buf, TYPE_Xr); |
} |
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
Line 879 pmdoc_Vt(MDOC_ARGS) |
|
Line 894 pmdoc_Vt(MDOC_ARGS) |
|
|
|
buf_appendb(buf, start, sz); |
buf_appendb(buf, start, sz); |
buf_appendb(buf, "", 1); |
buf_appendb(buf, "", 1); |
hash_put(hash, buf, TYPE_VARIABLE); |
hash_put(hash, buf, TYPE_Va); |
} |
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
Line 893 pmdoc_Fo(MDOC_ARGS) |
|
Line 908 pmdoc_Fo(MDOC_ARGS) |
|
return; |
return; |
|
|
buf_append(buf, n->child->string); |
buf_append(buf, n->child->string); |
hash_put(hash, buf, TYPE_FUNCTION); |
hash_put(hash, buf, TYPE_Fn); |
} |
} |
|
|
|
|
Line 908 pmdoc_Nd(MDOC_ARGS) |
|
Line 923 pmdoc_Nd(MDOC_ARGS) |
|
buf_appendmdoc(dbuf, n->child, 1); |
buf_appendmdoc(dbuf, n->child, 1); |
buf_appendmdoc(buf, n->child, 0); |
buf_appendmdoc(buf, n->child, 0); |
|
|
hash_put(hash, buf, TYPE_DESC); |
hash_put(hash, buf, TYPE_Nd); |
} |
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
Line 920 pmdoc_Er(MDOC_ARGS) |
|
Line 935 pmdoc_Er(MDOC_ARGS) |
|
return; |
return; |
|
|
buf_appendmdoc(buf, n->child, 0); |
buf_appendmdoc(buf, n->child, 0); |
hash_put(hash, buf, TYPE_ERR); |
hash_put(hash, buf, TYPE_Er); |
} |
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
Line 932 pmdoc_Ev(MDOC_ARGS) |
|
Line 947 pmdoc_Ev(MDOC_ARGS) |
|
return; |
return; |
|
|
buf_appendmdoc(buf, n->child, 0); |
buf_appendmdoc(buf, n->child, 0); |
hash_put(hash, buf, TYPE_ENV); |
hash_put(hash, buf, TYPE_Ev); |
} |
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
Line 944 pmdoc_Pa(MDOC_ARGS) |
|
Line 959 pmdoc_Pa(MDOC_ARGS) |
|
return; |
return; |
|
|
buf_appendmdoc(buf, n->child, 0); |
buf_appendmdoc(buf, n->child, 0); |
hash_put(hash, buf, TYPE_PATH); |
hash_put(hash, buf, TYPE_Pa); |
} |
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
Line 954 pmdoc_Nm(MDOC_ARGS) |
|
Line 969 pmdoc_Nm(MDOC_ARGS) |
|
|
|
if (SEC_NAME == n->sec) { |
if (SEC_NAME == n->sec) { |
buf_appendmdoc(buf, n->child, 0); |
buf_appendmdoc(buf, n->child, 0); |
hash_put(hash, buf, TYPE_NAME); |
hash_put(hash, buf, TYPE_Nm); |
return; |
return; |
} else if (SEC_SYNOPSIS != n->sec || MDOC_HEAD != n->type) |
} else if (SEC_SYNOPSIS != n->sec || MDOC_HEAD != n->type) |
return; |
return; |
Line 963 pmdoc_Nm(MDOC_ARGS) |
|
Line 978 pmdoc_Nm(MDOC_ARGS) |
|
buf_append(buf, m->name); |
buf_append(buf, m->name); |
|
|
buf_appendmdoc(buf, n->child, 0); |
buf_appendmdoc(buf, n->child, 0); |
hash_put(hash, buf, TYPE_UTILITY); |
hash_put(hash, buf, TYPE_Nm); |
} |
} |
|
|
static void |
static void |
Line 1093 pman_node(MAN_ARGS) |
|
Line 1108 pman_node(MAN_ARGS) |
|
buf_appendb(buf, start, sz); |
buf_appendb(buf, start, sz); |
buf_appendb(buf, "", 1); |
buf_appendb(buf, "", 1); |
|
|
hash_put(hash, buf, TYPE_NAME); |
hash_put(hash, buf, TYPE_Nm); |
|
|
if (' ' == start[(int)sz]) { |
if (' ' == start[(int)sz]) { |
start += (int)sz + 1; |
start += (int)sz + 1; |
Line 1132 pman_node(MAN_ARGS) |
|
Line 1147 pman_node(MAN_ARGS) |
|
buf_appendb(dbuf, start, sz); |
buf_appendb(dbuf, start, sz); |
buf_appendb(buf, start, sz); |
buf_appendb(buf, start, sz); |
|
|
hash_put(hash, buf, TYPE_DESC); |
hash_put(hash, buf, TYPE_Nd); |
} |
} |
} |
} |
|
|
if (pman_node(hash, buf, dbuf, n->child)) |
for (n = n->child; n; n = n->next) |
return(1); |
if (pman_node(hash, buf, dbuf, n)) |
if (pman_node(hash, buf, dbuf, n->next)) |
return(1); |
return(1); |
|
|
|
return(0); |
return(0); |
} |
} |
|
|
static void |
static void |
|
ofile_argbuild(char *argv[], int argc, int verb, struct of **of) |
|
{ |
|
int i; |
|
struct of *nof; |
|
|
|
for (i = 0; i < argc; i++) { |
|
nof = mandoc_calloc(1, sizeof(struct of)); |
|
nof->fname = strdup(argv[i]); |
|
if (verb > 2) |
|
printf("%s: Scheduling\n", argv[i]); |
|
if (NULL == *of) { |
|
*of = nof; |
|
(*of)->first = nof; |
|
} else { |
|
nof->first = (*of)->first; |
|
(*of)->next = nof; |
|
*of = nof; |
|
} |
|
} |
|
} |
|
|
|
/* |
|
* Recursively build up a list of files to parse. |
|
* We use this instead of ftw() and so on because I don't want global |
|
* variables hanging around. |
|
* This ignores the mandoc.db and mandoc.index files, but assumes that |
|
* everything else is a manual. |
|
* Pass in a pointer to a NULL structure for the first invocation. |
|
*/ |
|
static int |
|
ofile_dirbuild(const char *dir, int verb, struct of **of) |
|
{ |
|
char buf[MAXPATHLEN]; |
|
size_t sz; |
|
DIR *d; |
|
const char *fn; |
|
struct of *nof; |
|
struct dirent *dp; |
|
|
|
if (NULL == (d = opendir(dir))) { |
|
perror(dir); |
|
return(0); |
|
} |
|
|
|
while (NULL != (dp = readdir(d))) { |
|
fn = dp->d_name; |
|
if (DT_DIR == dp->d_type) { |
|
if (0 == strcmp(".", fn)) |
|
continue; |
|
if (0 == strcmp("..", fn)) |
|
continue; |
|
|
|
buf[0] = '\0'; |
|
strlcat(buf, dir, MAXPATHLEN); |
|
strlcat(buf, "/", MAXPATHLEN); |
|
sz = strlcat(buf, fn, MAXPATHLEN); |
|
|
|
if (sz < MAXPATHLEN) { |
|
if ( ! ofile_dirbuild(buf, verb, of)) |
|
return(0); |
|
continue; |
|
} else if (sz < MAXPATHLEN) |
|
continue; |
|
|
|
fprintf(stderr, "%s: Path too long\n", dir); |
|
return(0); |
|
} |
|
if (DT_REG != dp->d_type) |
|
continue; |
|
|
|
if (0 == strcmp(MANDOC_DB, fn) || |
|
0 == strcmp(MANDOC_IDX, fn)) |
|
continue; |
|
|
|
buf[0] = '\0'; |
|
strlcat(buf, dir, MAXPATHLEN); |
|
strlcat(buf, "/", MAXPATHLEN); |
|
sz = strlcat(buf, fn, MAXPATHLEN); |
|
if (sz >= MAXPATHLEN) { |
|
fprintf(stderr, "%s: Path too long\n", dir); |
|
return(0); |
|
} |
|
|
|
nof = mandoc_calloc(1, sizeof(struct of)); |
|
nof->fname = mandoc_strdup(buf); |
|
|
|
if (verb > 2) |
|
printf("%s: Scheduling\n", buf); |
|
|
|
if (NULL == *of) { |
|
*of = nof; |
|
(*of)->first = nof; |
|
} else { |
|
nof->first = (*of)->first; |
|
(*of)->next = nof; |
|
*of = nof; |
|
} |
|
} |
|
|
|
closedir(d); |
|
return(1); |
|
} |
|
|
|
static void |
|
ofile_free(struct of *of) |
|
{ |
|
struct of *nof; |
|
|
|
while (of) { |
|
nof = of->next; |
|
free(of->fname); |
|
free(of); |
|
of = nof; |
|
} |
|
} |
|
|
|
static void |
usage(void) |
usage(void) |
{ |
{ |
|
|
fprintf(stderr, "usage: %s [-ruv] [-d path] [file...]\n", |
fprintf(stderr, "usage: %s [-v] " |
progname); |
"[-d dir [files...] |" |
|
" -u dir [files...] |" |
|
" dir...]\n", progname); |
} |
} |