Annotation of mandoc/mandoc-db.c, Revision 1.10
1.10 ! kristaps 1: /* $Id: mandoc-db.c,v 1.9 2011/04/05 14:16:05 kristaps Exp $ */
1.1 kristaps 2: /*
3: * Copyright (c) 2011 Kristaps Dzonsons <kristaps@bsd.lv>
4: *
5: * Permission to use, copy, modify, and distribute this software for any
6: * purpose with or without fee is hereby granted, provided that the above
7: * copyright notice and this permission notice appear in all copies.
8: *
9: * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
10: * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
11: * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
12: * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13: * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14: * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
15: * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
16: */
1.2 kristaps 17: #ifdef HAVE_CONFIG_H
18: #include "config.h"
19: #endif
20:
1.1 kristaps 21: #include <sys/param.h>
22:
23: #include <assert.h>
24: #ifdef __linux__
25: # include <db_185.h>
26: #else
27: # include <db.h>
28: #endif
29: #include <fcntl.h>
30: #include <getopt.h>
31: #include <stdio.h>
32: #include <stdint.h>
33: #include <stdlib.h>
34: #include <string.h>
35:
36: #include "man.h"
37: #include "mdoc.h"
38: #include "mandoc.h"
39:
40: #define MANDOC_DB "mandoc.db"
1.3 kristaps 41: #define MANDOC_IDX "mandoc.index"
1.2 kristaps 42: #define MANDOC_BUFSZ BUFSIZ
1.3 kristaps 43: #define MANDOC_FLAGS O_CREAT|O_TRUNC|O_RDWR
1.1 kristaps 44:
45: enum type {
46: MANDOC_NONE = 0,
47: MANDOC_NAME,
48: MANDOC_FUNCTION,
49: MANDOC_UTILITY,
50: MANDOC_INCLUDES,
51: MANDOC_VARIABLE
52: };
53:
1.6 kristaps 54: #define MAN_ARGS DB *db, \
55: const char *dbn, \
56: DBT *key, size_t *ksz, \
57: DBT *val, \
58: const struct man_node *n
1.1 kristaps 59: #define MDOC_ARGS DB *db, \
60: const char *dbn, \
61: DBT *key, size_t *ksz, \
62: DBT *val, \
63: const struct mdoc_node *n
64:
65: static void dbt_append(DBT *, size_t *, const char *);
66: static void dbt_appendb(DBT *, size_t *,
67: const void *, size_t);
68: static void dbt_init(DBT *, size_t *);
1.8 kristaps 69: static void dbt_put(DB *, const char *, DBT *, DBT *);
1.1 kristaps 70: static void usage(void);
1.9 kristaps 71: static void pman(DB *, const char *, DBT *,
72: size_t *, DBT *, struct man *);
1.6 kristaps 73: static int pman_node(MAN_ARGS);
1.9 kristaps 74: static void pmdoc(DB *, const char *, DBT *,
75: size_t *, DBT *, struct mdoc *);
1.1 kristaps 76: static void pmdoc_node(MDOC_ARGS);
77: static void pmdoc_Fd(MDOC_ARGS);
78: static void pmdoc_In(MDOC_ARGS);
79: static void pmdoc_Fn(MDOC_ARGS);
80: static void pmdoc_Fo(MDOC_ARGS);
81: static void pmdoc_Nm(MDOC_ARGS);
82: static void pmdoc_Vt(MDOC_ARGS);
83:
84: typedef void (*pmdoc_nf)(MDOC_ARGS);
85:
86: static const char *progname;
87:
88: static const pmdoc_nf mdocs[MDOC_MAX] = {
89: NULL, /* Ap */
90: NULL, /* Dd */
91: NULL, /* Dt */
92: NULL, /* Os */
93: NULL, /* Sh */
94: NULL, /* Ss */
95: NULL, /* Pp */
96: NULL, /* D1 */
97: NULL, /* Dl */
98: NULL, /* Bd */
99: NULL, /* Ed */
100: NULL, /* Bl */
101: NULL, /* El */
102: NULL, /* It */
103: NULL, /* Ad */
104: NULL, /* An */
105: NULL, /* Ar */
106: NULL, /* Cd */
107: NULL, /* Cm */
108: NULL, /* Dv */
109: NULL, /* Er */
110: NULL, /* Ev */
111: NULL, /* Ex */
112: NULL, /* Fa */
113: pmdoc_Fd, /* Fd */
114: NULL, /* Fl */
115: pmdoc_Fn, /* Fn */
116: NULL, /* Ft */
117: NULL, /* Ic */
118: pmdoc_In, /* In */
119: NULL, /* Li */
120: NULL, /* Nd */
121: pmdoc_Nm, /* Nm */
122: NULL, /* Op */
123: NULL, /* Ot */
124: NULL, /* Pa */
125: NULL, /* Rv */
126: NULL, /* St */
127: pmdoc_Vt, /* Va */
128: pmdoc_Vt, /* Vt */
129: NULL, /* Xr */
130: NULL, /* %A */
131: NULL, /* %B */
132: NULL, /* %D */
133: NULL, /* %I */
134: NULL, /* %J */
135: NULL, /* %N */
136: NULL, /* %O */
137: NULL, /* %P */
138: NULL, /* %R */
139: NULL, /* %T */
140: NULL, /* %V */
141: NULL, /* Ac */
142: NULL, /* Ao */
143: NULL, /* Aq */
144: NULL, /* At */
145: NULL, /* Bc */
146: NULL, /* Bf */
147: NULL, /* Bo */
148: NULL, /* Bq */
149: NULL, /* Bsx */
150: NULL, /* Bx */
151: NULL, /* Db */
152: NULL, /* Dc */
153: NULL, /* Do */
154: NULL, /* Dq */
155: NULL, /* Ec */
156: NULL, /* Ef */
157: NULL, /* Em */
158: NULL, /* Eo */
159: NULL, /* Fx */
160: NULL, /* Ms */
161: NULL, /* No */
162: NULL, /* Ns */
163: NULL, /* Nx */
164: NULL, /* Ox */
165: NULL, /* Pc */
166: NULL, /* Pf */
167: NULL, /* Po */
168: NULL, /* Pq */
169: NULL, /* Qc */
170: NULL, /* Ql */
171: NULL, /* Qo */
172: NULL, /* Qq */
173: NULL, /* Re */
174: NULL, /* Rs */
175: NULL, /* Sc */
176: NULL, /* So */
177: NULL, /* Sq */
178: NULL, /* Sm */
179: NULL, /* Sx */
180: NULL, /* Sy */
181: NULL, /* Tn */
182: NULL, /* Ux */
183: NULL, /* Xc */
184: NULL, /* Xo */
185: pmdoc_Fo, /* Fo */
186: NULL, /* Fc */
187: NULL, /* Oo */
188: NULL, /* Oc */
189: NULL, /* Bk */
190: NULL, /* Ek */
191: NULL, /* Bt */
192: NULL, /* Hf */
193: NULL, /* Fr */
194: NULL, /* Ud */
195: NULL, /* Lb */
196: NULL, /* Lp */
197: NULL, /* Lk */
198: NULL, /* Mt */
199: NULL, /* Brq */
200: NULL, /* Bro */
201: NULL, /* Brc */
202: NULL, /* %C */
203: NULL, /* Es */
204: NULL, /* En */
205: NULL, /* Dx */
206: NULL, /* %Q */
207: NULL, /* br */
208: NULL, /* sp */
209: NULL, /* %U */
210: NULL, /* Ta */
211: };
212:
213: int
214: main(int argc, char *argv[])
215: {
1.2 kristaps 216: struct mparse *mp; /* parse sequence */
217: struct mdoc *mdoc; /* resulting mdoc */
1.6 kristaps 218: struct man *man; /* resulting man */
1.3 kristaps 219: char *fn;
1.10 ! kristaps 220: const char *msec,
! 221: *dir; /* result dir (default: cwd) */
1.3 kristaps 222: char ibuf[MAXPATHLEN], /* index fname */
223: ibbuf[MAXPATHLEN], /* index backup fname */
224: fbuf[MAXPATHLEN], /* btree fname */
1.2 kristaps 225: fbbuf[MAXPATHLEN]; /* btree backup fname */
1.1 kristaps 226: int c;
1.9 kristaps 227: DB *idx, /* index database */
1.3 kristaps 228: *db; /* keyword database */
229: DBT rkey, rval, /* recno entries */
230: key, val; /* persistent keyword entries */
1.10 ! kristaps 231: size_t ksz, rsz; /* entry buffer size */
1.3 kristaps 232: char vbuf[8];
1.2 kristaps 233: BTREEINFO info; /* btree configuration */
1.3 kristaps 234: recno_t rec;
1.1 kristaps 235: extern int optind;
236: extern char *optarg;
237:
238: progname = strrchr(argv[0], '/');
239: if (progname == NULL)
240: progname = argv[0];
241: else
242: ++progname;
243:
1.3 kristaps 244: dir = "";
1.2 kristaps 245:
1.4 kristaps 246: while (-1 != (c = getopt(argc, argv, "d:")))
1.1 kristaps 247: switch (c) {
1.2 kristaps 248: case ('d'):
249: dir = optarg;
1.1 kristaps 250: break;
251: default:
252: usage();
253: return((int)MANDOCLEVEL_BADARG);
254: }
255:
256: argc -= optind;
257: argv += optind;
258:
259: /*
1.3 kristaps 260: * Set up temporary file-names into which we're going to write
261: * all of our data (both for the index and database). These
262: * will be securely renamed to the real file-names after we've
263: * written all of our data.
1.1 kristaps 264: */
265:
1.3 kristaps 266: ibuf[0] = ibuf[MAXPATHLEN - 2] =
267: ibbuf[0] = ibbuf[MAXPATHLEN - 2] =
268: fbuf[0] = fbuf[MAXPATHLEN - 2] =
269: fbbuf[0] = fbbuf[MAXPATHLEN - 2] = '\0';
1.2 kristaps 270:
271: strlcat(fbuf, dir, MAXPATHLEN);
272: strlcat(fbuf, MANDOC_DB, MAXPATHLEN);
1.3 kristaps 273:
1.2 kristaps 274: strlcat(fbbuf, fbuf, MAXPATHLEN);
275: strlcat(fbbuf, "~", MAXPATHLEN);
276:
1.3 kristaps 277: strlcat(ibuf, dir, MAXPATHLEN);
278: strlcat(ibuf, MANDOC_IDX, MAXPATHLEN);
279:
280: strlcat(ibbuf, ibuf, MAXPATHLEN);
281: strlcat(ibbuf, "~", MAXPATHLEN);
282:
1.2 kristaps 283: if ('\0' != fbuf[MAXPATHLEN - 2] ||
1.3 kristaps 284: '\0' != fbbuf[MAXPATHLEN - 2] ||
285: '\0' != ibuf[MAXPATHLEN - 2] ||
286: '\0' != ibbuf[MAXPATHLEN - 2]) {
287: fprintf(stderr, "%s: Path too long\n", progname);
1.1 kristaps 288: exit((int)MANDOCLEVEL_SYSERR);
289: }
290:
291: /*
1.3 kristaps 292: * For the keyword database, open a BTREE database that allows
293: * duplicates. For the index database, use a standard RECNO
294: * database type.
1.1 kristaps 295: */
296:
297: memset(&info, 0, sizeof(BTREEINFO));
298: info.flags = R_DUP;
1.3 kristaps 299: db = dbopen(fbbuf, MANDOC_FLAGS, 0644, DB_BTREE, &info);
1.1 kristaps 300:
301: if (NULL == db) {
1.2 kristaps 302: perror(fbbuf);
1.1 kristaps 303: exit((int)MANDOCLEVEL_SYSERR);
304: }
305:
1.9 kristaps 306: idx = dbopen(ibbuf, MANDOC_FLAGS, 0644, DB_RECNO, NULL);
1.1 kristaps 307:
1.3 kristaps 308: if (NULL == db) {
309: perror(ibbuf);
310: (*db->close)(db);
311: exit((int)MANDOCLEVEL_SYSERR);
312: }
1.1 kristaps 313:
314: /*
315: * Try parsing the manuals given on the command line. If we
316: * totally fail, then just keep on going. Take resulting trees
317: * and push them down into the database code.
1.3 kristaps 318: * Use the auto-parser and don't report any errors.
1.1 kristaps 319: */
320:
1.3 kristaps 321: mp = mparse_alloc(MPARSE_AUTO, MANDOCLEVEL_FATAL, NULL, NULL);
322:
1.1 kristaps 323: memset(&key, 0, sizeof(DBT));
324: memset(&val, 0, sizeof(DBT));
1.3 kristaps 325: memset(&rkey, 0, sizeof(DBT));
326: memset(&rval, 0, sizeof(DBT));
327:
328: val.size = sizeof(vbuf);
329: val.data = vbuf;
330: rkey.size = sizeof(recno_t);
331:
332: rec = 1;
1.10 ! kristaps 333: ksz = rsz = 0;
1.1 kristaps 334:
335: while (NULL != (fn = *argv++)) {
336: mparse_reset(mp);
1.3 kristaps 337:
1.4 kristaps 338: if (mparse_readfd(mp, -1, fn) >= MANDOCLEVEL_FATAL) {
339: fprintf(stderr, "%s: Parse failure\n", fn);
1.1 kristaps 340: continue;
1.4 kristaps 341: }
1.3 kristaps 342:
1.6 kristaps 343: mparse_result(mp, &mdoc, &man);
344: if (NULL == mdoc && NULL == man)
1.3 kristaps 345: continue;
346:
1.10 ! kristaps 347: msec = NULL != mdoc ?
! 348: mdoc_meta(mdoc)->msec :
! 349: man_meta(man)->msec;
! 350:
1.3 kristaps 351: rkey.data = &rec;
352:
1.10 ! kristaps 353: dbt_init(&rval, &rsz);
! 354: dbt_appendb(&rval, &rsz, fn, strlen(fn) + 1);
! 355: dbt_appendb(&rval, &rsz, msec, strlen(msec) + 1);
! 356:
! 357: dbt_put(idx, ibbuf, &rkey, &rval);
1.3 kristaps 358:
359: memset(val.data, 0, sizeof(uint32_t));
360: memcpy(val.data + 4, &rec, sizeof(uint32_t));
361:
1.6 kristaps 362: if (mdoc)
1.9 kristaps 363: pmdoc(db, fbbuf, &key, &ksz, &val, mdoc);
1.6 kristaps 364: else
1.9 kristaps 365: pman(db, fbbuf, &key, &ksz, &val, man);
1.3 kristaps 366: rec++;
1.1 kristaps 367: }
368:
369: (*db->close)(db);
1.9 kristaps 370: (*idx->close)(idx);
1.3 kristaps 371:
1.1 kristaps 372: mparse_free(mp);
373:
374: free(key.data);
1.10 ! kristaps 375: free(rval.data);
1.1 kristaps 376:
377: /* Atomically replace the file with our temporary one. */
378:
1.2 kristaps 379: if (-1 == rename(fbbuf, fbuf))
380: perror(fbuf);
1.3 kristaps 381: if (-1 == rename(ibbuf, ibuf))
382: perror(fbuf);
1.1 kristaps 383:
384: return((int)MANDOCLEVEL_OK);
385: }
386:
387: /*
388: * Initialise the stored database key whose data buffer is shared
389: * between uses (as the key must sometimes be constructed from an array
390: * of
391: */
392: static void
393: dbt_init(DBT *key, size_t *ksz)
394: {
395:
396: if (0 == *ksz) {
397: assert(0 == key->size);
398: assert(NULL == key->data);
399: key->data = mandoc_malloc(MANDOC_BUFSZ);
400: *ksz = MANDOC_BUFSZ;
401: }
402:
403: key->size = 0;
404: }
405:
406: /*
407: * Append a binary value to a database entry. This can be invoked
408: * multiple times; the buffer is automatically resized.
409: */
410: static void
411: dbt_appendb(DBT *key, size_t *ksz, const void *cp, size_t sz)
412: {
413:
414: assert(key->data);
415:
416: /* Overshoot by MANDOC_BUFSZ. */
417:
418: while (key->size + sz >= *ksz) {
419: *ksz = key->size + sz + MANDOC_BUFSZ;
420: key->data = mandoc_realloc(key->data, *ksz);
421: }
422:
423: memcpy(key->data + (int)key->size, cp, sz);
424: key->size += sz;
425: }
426:
427: /*
428: * Append a nil-terminated string to the database entry. This can be
429: * invoked multiple times. The database entry will be nil-terminated as
430: * well; if invoked multiple times, a space is put between strings.
431: */
432: static void
433: dbt_append(DBT *key, size_t *ksz, const char *cp)
434: {
435: size_t sz;
436:
437: if (0 == (sz = strlen(cp)))
438: return;
439:
1.3 kristaps 440: assert(key->data);
1.1 kristaps 441:
442: if (key->size)
443: ((char *)key->data)[(int)key->size - 1] = ' ';
444:
1.3 kristaps 445: dbt_appendb(key, ksz, cp, sz + 1);
1.1 kristaps 446: }
447:
448: /* ARGSUSED */
449: static void
450: pmdoc_Fd(MDOC_ARGS)
451: {
452: uint32_t fl;
453: const char *start, *end;
454: size_t sz;
1.10 ! kristaps 455: const char nil = '\0';
1.1 kristaps 456:
457: if (SEC_SYNOPSIS != n->sec)
458: return;
459: if (NULL == (n = n->child) || MDOC_TEXT != n->type)
460: return;
1.4 kristaps 461:
462: /*
463: * Only consider those `Fd' macro fields that begin with an
464: * "inclusion" token (versus, e.g., #define).
465: */
1.1 kristaps 466: if (strcmp("#include", n->string))
467: return;
1.4 kristaps 468:
1.1 kristaps 469: if (NULL == (n = n->next) || MDOC_TEXT != n->type)
470: return;
471:
1.4 kristaps 472: /*
473: * Strip away the enclosing angle brackets and make sure we're
474: * not zero-length.
475: */
476:
1.1 kristaps 477: start = n->string;
1.5 kristaps 478: if ('<' == *start || '"' == *start)
1.1 kristaps 479: start++;
480:
481: if (0 == (sz = strlen(start)))
482: return;
483:
484: end = &start[(int)sz - 1];
1.5 kristaps 485: if ('>' == *end || '"' == *end)
1.1 kristaps 486: end--;
487:
488: dbt_appendb(key, ksz, start, end - start + 1);
489: dbt_appendb(key, ksz, &nil, 1);
490:
491: fl = MANDOC_INCLUDES;
492: memcpy(val->data, &fl, 4);
493: }
494:
495: /* ARGSUSED */
496: static void
497: pmdoc_In(MDOC_ARGS)
498: {
499: uint32_t fl;
500:
501: if (SEC_SYNOPSIS != n->sec)
502: return;
503: if (NULL == n->child || MDOC_TEXT != n->child->type)
504: return;
505:
506: dbt_append(key, ksz, n->child->string);
507: fl = MANDOC_INCLUDES;
508: memcpy(val->data, &fl, 4);
509: }
510:
511: /* ARGSUSED */
512: static void
513: pmdoc_Fn(MDOC_ARGS)
514: {
515: uint32_t fl;
516: const char *cp;
517:
518: if (SEC_SYNOPSIS != n->sec)
519: return;
520: if (NULL == n->child || MDOC_TEXT != n->child->type)
521: return;
522:
523: /* .Fn "struct type *arg" "foo" */
524:
525: cp = strrchr(n->child->string, ' ');
526: if (NULL == cp)
527: cp = n->child->string;
528:
1.4 kristaps 529: /* Strip away pointer symbol. */
1.1 kristaps 530:
531: while ('*' == *cp)
532: cp++;
533:
534: dbt_append(key, ksz, cp);
535: fl = MANDOC_FUNCTION;
536: memcpy(val->data, &fl, 4);
537: }
538:
539: /* ARGSUSED */
540: static void
541: pmdoc_Vt(MDOC_ARGS)
542: {
543: uint32_t fl;
544: const char *start, *end;
545: size_t sz;
1.10 ! kristaps 546: const char nil = '\0';
1.1 kristaps 547:
548: if (SEC_SYNOPSIS != n->sec)
549: return;
550: if (MDOC_Vt == n->tok && MDOC_BODY != n->type)
551: return;
1.7 kristaps 552: if (NULL == n->last || MDOC_TEXT != n->last->type)
1.1 kristaps 553: return;
554:
555: /*
1.4 kristaps 556: * Strip away leading pointer symbol '*' and trailing ';'.
1.1 kristaps 557: */
558:
559: start = n->last->string;
560:
561: while ('*' == *start)
562: start++;
563:
564: if (0 == (sz = strlen(start)))
565: return;
566:
567: end = &start[sz - 1];
568: while (end > start && ';' == *end)
569: end--;
570:
571: if (end == start)
572: return;
573:
574: dbt_appendb(key, ksz, start, end - start + 1);
575: dbt_appendb(key, ksz, &nil, 1);
576: fl = MANDOC_VARIABLE;
577: memcpy(val->data, &fl, 4);
578: }
579:
580: /* ARGSUSED */
581: static void
582: pmdoc_Fo(MDOC_ARGS)
583: {
584: uint32_t fl;
585:
586: if (SEC_SYNOPSIS != n->sec || MDOC_HEAD != n->type)
587: return;
588: if (NULL == n->child || MDOC_TEXT != n->child->type)
589: return;
590:
591: dbt_append(key, ksz, n->child->string);
592: fl = MANDOC_FUNCTION;
593: memcpy(val->data, &fl, 4);
594: }
595:
596: /* ARGSUSED */
597: static void
598: pmdoc_Nm(MDOC_ARGS)
599: {
600: uint32_t fl;
601:
602: if (SEC_NAME == n->sec) {
603: for (n = n->child; n; n = n->next) {
604: if (MDOC_TEXT != n->type)
605: continue;
606: dbt_append(key, ksz, n->string);
607: }
608: fl = MANDOC_NAME;
609: memcpy(val->data, &fl, 4);
610: return;
611: } else if (SEC_SYNOPSIS != n->sec || MDOC_HEAD != n->type)
612: return;
613:
614: for (n = n->child; n; n = n->next) {
615: if (MDOC_TEXT != n->type)
616: continue;
617: dbt_append(key, ksz, n->string);
618: }
619:
620: fl = MANDOC_UTILITY;
621: memcpy(val->data, &fl, 4);
622: }
623:
1.8 kristaps 624: static void
625: dbt_put(DB *db, const char *dbn, DBT *key, DBT *val)
626: {
627:
628: if (0 == key->size)
629: return;
630:
631: assert(key->data);
1.10 ! kristaps 632: assert(val->size);
1.8 kristaps 633: assert(val->data);
634:
635: if (0 == (*db->put)(db, key, val, 0))
636: return;
637:
638: perror(dbn);
639: exit((int)MANDOCLEVEL_SYSERR);
640: /* NOTREACHED */
641: }
642:
1.1 kristaps 643: /*
644: * Call out to per-macro handlers after clearing the persistent database
645: * key. If the macro sets the database key, flush it to the database.
646: */
647: static void
648: pmdoc_node(MDOC_ARGS)
649: {
650:
651: if (NULL == n)
652: return;
653:
654: switch (n->type) {
655: case (MDOC_HEAD):
656: /* FALLTHROUGH */
657: case (MDOC_BODY):
658: /* FALLTHROUGH */
659: case (MDOC_TAIL):
660: /* FALLTHROUGH */
661: case (MDOC_BLOCK):
662: /* FALLTHROUGH */
663: case (MDOC_ELEM):
664: if (NULL == mdocs[n->tok])
665: break;
666:
667: dbt_init(key, ksz);
668: (*mdocs[n->tok])(db, dbn, key, ksz, val, n);
669:
1.8 kristaps 670: dbt_put(db, dbn, key, val);
671: break;
1.1 kristaps 672: default:
673: break;
674: }
675:
676: pmdoc_node(db, dbn, key, ksz, val, n->child);
677: pmdoc_node(db, dbn, key, ksz, val, n->next);
678: }
1.6 kristaps 679:
680: static int
681: pman_node(MAN_ARGS)
682: {
683: const struct man_node *head, *body;
1.8 kristaps 684: const char *start;
1.10 ! kristaps 685: const char nil = '\0';
1.8 kristaps 686: size_t sz;
1.6 kristaps 687: uint32_t fl;
688:
689: if (NULL == n)
690: return(0);
691:
692: /*
693: * We're only searching for one thing: the first text child in
694: * the BODY of a NAME section. Since we don't keep track of
695: * sections in -man, run some hoops to find out whether we're in
696: * the correct section or not.
697: */
698:
699: if (MAN_BODY == n->type && MAN_SH == n->tok) {
700: body = n;
701: assert(body->parent);
702: if (NULL != (head = body->parent->head) &&
703: 1 == head->nchild &&
704: NULL != (head = (head->child)) &&
705: MAN_TEXT == head->type &&
706: 0 == strcmp(head->string, "NAME") &&
707: NULL != (body = body->child) &&
708: MAN_TEXT == body->type) {
709:
1.8 kristaps 710: fl = MANDOC_NAME;
711: memcpy(val->data, &fl, 4);
712:
1.6 kristaps 713: start = body->string;
714:
1.8 kristaps 715: /*
716: * Go through a special heuristic dance here.
717: * This is why -man manuals are great!
718: * Conventionally, one or more manual names are
719: * comma-specified prior to a whitespace, then a
720: * dash, then a description. Try to puzzle out
721: * the name parts here.
722: */
723:
724: while (start) {
725: sz = strcspn(start, " ,");
726: if ('\0' == start[(int)sz])
727: break;
728:
729: dbt_init(key, ksz);
730: dbt_appendb(key, ksz, start, sz);
731: dbt_appendb(key, ksz, &nil, 1);
732:
733: dbt_put(db, dbn, key, val);
734:
735: if (' ' == start[(int)sz])
736: break;
737:
738: assert(',' == start[(int)sz]);
739: start += (int)sz + 1;
740: while (' ' == *start)
741: start++;
742: }
743:
1.6 kristaps 744: return(1);
745: }
746: }
747:
748: if (pman_node(db, dbn, key, ksz, val, n->child))
749: return(1);
750: if (pman_node(db, dbn, key, ksz, val, n->next))
751: return(1);
752:
753: return(0);
754: }
755:
756: static void
1.9 kristaps 757: pman(DB *db, const char *dbn, DBT *key,
758: size_t *ksz, DBT *val, struct man *m)
1.6 kristaps 759: {
760:
761: pman_node(db, dbn, key, ksz, val, man_node(m));
762: }
763:
1.1 kristaps 764:
765: static void
1.9 kristaps 766: pmdoc(DB *db, const char *dbn, DBT *key,
767: size_t *ksz, DBT *val, struct mdoc *m)
1.1 kristaps 768: {
769:
770: pmdoc_node(db, dbn, key, ksz, val, mdoc_node(m));
771: }
772:
773: static void
774: usage(void)
775: {
776:
777: fprintf(stderr, "usage: %s "
1.2 kristaps 778: "[-d path] "
1.1 kristaps 779: "[file...]\n",
780: progname);
781: }
CVSweb
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to mandoc-db.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [cvsweb.bsd.lv] / mandoc