Annotation of mandoc/apropos_db.c, Revision 1.24
1.24 ! kristaps 1: /* $Id: apropos_db.c,v 1.23 2011/12/10 21:46:59 kristaps Exp $ */
1.1 schwarze 2: /*
3: * Copyright (c) 2011 Kristaps Dzonsons <kristaps@bsd.lv>
1.3 schwarze 4: * Copyright (c) 2011 Ingo Schwarze <schwarze@openbsd.org>
1.1 schwarze 5: *
6: * Permission to use, copy, modify, and distribute this software for any
7: * purpose with or without fee is hereby granted, provided that the above
8: * copyright notice and this permission notice appear in all copies.
9: *
10: * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
11: * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
12: * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
13: * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
14: * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
15: * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
16: * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
17: */
1.19 kristaps 18: #ifdef HAVE_CONFIG_H
19: #include "config.h"
20: #endif
21:
1.1 schwarze 22: #include <assert.h>
23: #include <fcntl.h>
24: #include <regex.h>
25: #include <stdarg.h>
1.6 kristaps 26: #include <stdint.h>
1.1 schwarze 27: #include <stdlib.h>
28: #include <string.h>
1.8 kristaps 29: #include <unistd.h>
1.1 schwarze 30:
1.19 kristaps 31: #if defined(__linux__)
32: # include <endian.h>
1.1 schwarze 33: # include <db_185.h>
1.19 kristaps 34: #elif defined(__APPLE__)
35: # include <libkern/OSByteOrder.h>
36: # include <db.h>
1.1 schwarze 37: #else
38: # include <db.h>
39: #endif
40:
1.2 schwarze 41: #include "mandocdb.h"
1.1 schwarze 42: #include "apropos_db.h"
43: #include "mandoc.h"
44:
1.5 kristaps 45: struct rec {
46: struct res res; /* resulting record info */
47: /*
48: * Maintain a binary tree for checking the uniqueness of `rec'
49: * when adding elements to the results array.
50: * Since the results array is dynamic, use offset in the array
51: * instead of a pointer to the structure.
52: */
53: int lhs;
54: int rhs;
55: int matched; /* expression is true */
56: int *matches; /* partial truth evaluations */
57: };
58:
1.1 schwarze 59: struct expr {
1.5 kristaps 60: int regex; /* is regex? */
61: int index; /* index in match array */
1.6 kristaps 62: uint64_t mask; /* type-mask */
1.5 kristaps 63: int and; /* is rhs of logical AND? */
64: char *v; /* search value */
65: regex_t re; /* compiled re, if regex */
66: struct expr *next; /* next in sequence */
67: struct expr *subexpr;
1.1 schwarze 68: };
69:
70: struct type {
1.6 kristaps 71: uint64_t mask;
1.1 schwarze 72: const char *name;
73: };
74:
1.8 kristaps 75: struct rectree {
76: struct rec *node; /* record array for dir tree */
77: int len; /* length of record array */
78: };
79:
1.1 schwarze 80: static const struct type types[] = {
1.7 kristaps 81: { TYPE_An, "An" },
82: { TYPE_Ar, "Ar" },
83: { TYPE_At, "At" },
84: { TYPE_Bsx, "Bsx" },
85: { TYPE_Bx, "Bx" },
86: { TYPE_Cd, "Cd" },
87: { TYPE_Cm, "Cm" },
88: { TYPE_Dv, "Dv" },
89: { TYPE_Dx, "Dx" },
90: { TYPE_Em, "Em" },
91: { TYPE_Er, "Er" },
92: { TYPE_Ev, "Ev" },
93: { TYPE_Fa, "Fa" },
94: { TYPE_Fl, "Fl" },
95: { TYPE_Fn, "Fn" },
96: { TYPE_Fn, "Fo" },
97: { TYPE_Ft, "Ft" },
98: { TYPE_Fx, "Fx" },
99: { TYPE_Ic, "Ic" },
100: { TYPE_In, "In" },
101: { TYPE_Lb, "Lb" },
102: { TYPE_Li, "Li" },
103: { TYPE_Lk, "Lk" },
104: { TYPE_Ms, "Ms" },
105: { TYPE_Mt, "Mt" },
106: { TYPE_Nd, "Nd" },
107: { TYPE_Nm, "Nm" },
108: { TYPE_Nx, "Nx" },
109: { TYPE_Ox, "Ox" },
110: { TYPE_Pa, "Pa" },
111: { TYPE_Rs, "Rs" },
112: { TYPE_Sh, "Sh" },
113: { TYPE_Ss, "Ss" },
114: { TYPE_St, "St" },
115: { TYPE_Sy, "Sy" },
116: { TYPE_Tn, "Tn" },
117: { TYPE_Va, "Va" },
118: { TYPE_Va, "Vt" },
119: { TYPE_Xr, "Xr" },
1.2 schwarze 120: { INT_MAX, "any" },
1.1 schwarze 121: { 0, NULL }
122: };
123:
124: static DB *btree_open(void);
1.17 kristaps 125: static int btree_read(const DBT *, const DBT *,
126: const struct mchars *,
127: struct db_val *, char **);
1.5 kristaps 128: static int expreval(const struct expr *, int *);
1.12 schwarze 129: static void exprexec(const struct expr *,
1.6 kristaps 130: const char *, uint64_t, struct rec *);
1.12 schwarze 131: static int exprmark(const struct expr *,
1.6 kristaps 132: const char *, uint64_t, int *);
1.5 kristaps 133: static struct expr *exprexpr(int, char *[], int *, int *, size_t *);
134: static struct expr *exprterm(char *, int);
1.1 schwarze 135: static DB *index_open(void);
1.11 kristaps 136: static int index_read(const DBT *, const DBT *, int,
1.1 schwarze 137: const struct mchars *, struct rec *);
138: static void norm_string(const char *,
139: const struct mchars *, char **);
140: static size_t norm_utf8(unsigned int, char[7]);
1.5 kristaps 141: static void recfree(struct rec *);
1.8 kristaps 142: static int single_search(struct rectree *, const struct opts *,
143: const struct expr *, size_t terms,
1.11 kristaps 144: struct mchars *, int);
1.1 schwarze 145:
146: /*
147: * Open the keyword mandoc-db database.
148: */
149: static DB *
150: btree_open(void)
151: {
152: BTREEINFO info;
153: DB *db;
154:
155: memset(&info, 0, sizeof(BTREEINFO));
156: info.flags = R_DUP;
157:
1.2 schwarze 158: db = dbopen(MANDOC_DB, O_RDONLY, 0, DB_BTREE, &info);
1.12 schwarze 159: if (NULL != db)
1.1 schwarze 160: return(db);
161:
162: return(NULL);
163: }
164:
165: /*
166: * Read a keyword from the database and normalise it.
167: * Return 0 if the database is insane, else 1.
168: */
169: static int
1.17 kristaps 170: btree_read(const DBT *k, const DBT *v,
171: const struct mchars *mc,
172: struct db_val *dbv, char **buf)
1.1 schwarze 173: {
1.17 kristaps 174: const struct db_val *vp;
1.1 schwarze 175:
1.17 kristaps 176: /* Are our sizes sane? */
177: if (k->size < 2 || sizeof(struct db_val) != v->size)
178: return(0);
1.6 kristaps 179:
1.17 kristaps 180: /* Is our string nil-terminated? */
181: if ('\0' != ((const char *)k->data)[(int)k->size - 1])
1.1 schwarze 182: return(0);
183:
1.17 kristaps 184: vp = v->data;
185: norm_string((const char *)k->data, mc, buf);
1.18 kristaps 186: dbv->rec = betoh32(vp->rec);
187: dbv->mask = betoh64(vp->mask);
1.1 schwarze 188: return(1);
189: }
190:
191: /*
192: * Take a Unicode codepoint and produce its UTF-8 encoding.
193: * This isn't the best way to do this, but it works.
1.12 schwarze 194: * The magic numbers are from the UTF-8 packaging.
1.1 schwarze 195: * They're not as scary as they seem: read the UTF-8 spec for details.
196: */
197: static size_t
198: norm_utf8(unsigned int cp, char out[7])
199: {
200: size_t rc;
201:
202: rc = 0;
203:
204: if (cp <= 0x0000007F) {
205: rc = 1;
206: out[0] = (char)cp;
207: } else if (cp <= 0x000007FF) {
208: rc = 2;
209: out[0] = (cp >> 6 & 31) | 192;
210: out[1] = (cp & 63) | 128;
211: } else if (cp <= 0x0000FFFF) {
212: rc = 3;
213: out[0] = (cp >> 12 & 15) | 224;
214: out[1] = (cp >> 6 & 63) | 128;
215: out[2] = (cp & 63) | 128;
216: } else if (cp <= 0x001FFFFF) {
217: rc = 4;
218: out[0] = (cp >> 18 & 7) | 240;
219: out[1] = (cp >> 12 & 63) | 128;
220: out[2] = (cp >> 6 & 63) | 128;
221: out[3] = (cp & 63) | 128;
222: } else if (cp <= 0x03FFFFFF) {
223: rc = 5;
224: out[0] = (cp >> 24 & 3) | 248;
225: out[1] = (cp >> 18 & 63) | 128;
226: out[2] = (cp >> 12 & 63) | 128;
227: out[3] = (cp >> 6 & 63) | 128;
228: out[4] = (cp & 63) | 128;
229: } else if (cp <= 0x7FFFFFFF) {
230: rc = 6;
231: out[0] = (cp >> 30 & 1) | 252;
232: out[1] = (cp >> 24 & 63) | 128;
233: out[2] = (cp >> 18 & 63) | 128;
234: out[3] = (cp >> 12 & 63) | 128;
235: out[4] = (cp >> 6 & 63) | 128;
236: out[5] = (cp & 63) | 128;
237: } else
238: return(0);
239:
240: out[rc] = '\0';
241: return(rc);
242: }
243:
244: /*
245: * Normalise strings from the index and database.
246: * These strings are escaped as defined by mandoc_char(7) along with
247: * other goop in mandoc.h (e.g., soft hyphens).
248: * This function normalises these into a nice UTF-8 string.
249: * Returns 0 if the database is fucked.
250: */
251: static void
252: norm_string(const char *val, const struct mchars *mc, char **buf)
253: {
254: size_t sz, bsz;
255: char utfbuf[7];
256: const char *seq, *cpp;
257: int len, u, pos;
258: enum mandoc_esc esc;
1.12 schwarze 259: static const char res[] = { '\\', '\t',
1.1 schwarze 260: ASCII_NBRSP, ASCII_HYPH, '\0' };
261:
262: /* Pre-allocate by the length of the input */
263:
264: bsz = strlen(val) + 1;
265: *buf = mandoc_realloc(*buf, bsz);
266: pos = 0;
267:
268: while ('\0' != *val) {
269: /*
270: * Halt on the first escape sequence.
271: * This also halts on the end of string, in which case
272: * we just copy, fallthrough, and exit the loop.
273: */
274: if ((sz = strcspn(val, res)) > 0) {
275: memcpy(&(*buf)[pos], val, sz);
276: pos += (int)sz;
277: val += (int)sz;
278: }
279:
280: if (ASCII_HYPH == *val) {
281: (*buf)[pos++] = '-';
282: val++;
283: continue;
284: } else if ('\t' == *val || ASCII_NBRSP == *val) {
285: (*buf)[pos++] = ' ';
286: val++;
287: continue;
288: } else if ('\\' != *val)
289: break;
290:
291: /* Read past the slash. */
292:
293: val++;
294: u = 0;
295:
296: /*
297: * Parse the escape sequence and see if it's a
298: * predefined character or special character.
299: */
300:
301: esc = mandoc_escape(&val, &seq, &len);
302: if (ESCAPE_ERROR == esc)
303: break;
304:
1.12 schwarze 305: /*
1.1 schwarze 306: * XXX - this just does UTF-8, but we need to know
307: * beforehand whether we should do text substitution.
308: */
309:
310: switch (esc) {
311: case (ESCAPE_SPECIAL):
312: if (0 != (u = mchars_spec2cp(mc, seq, len)))
313: break;
314: /* FALLTHROUGH */
315: default:
316: continue;
317: }
318:
319: /*
320: * If we have a Unicode codepoint, try to convert that
321: * to a UTF-8 byte string.
322: */
323:
324: cpp = utfbuf;
325: if (0 == (sz = norm_utf8(u, utfbuf)))
326: continue;
327:
328: /* Copy the rendered glyph into the stream. */
329:
330: sz = strlen(cpp);
331: bsz += sz;
332:
333: *buf = mandoc_realloc(*buf, bsz);
334:
335: memcpy(&(*buf)[pos], cpp, sz);
336: pos += (int)sz;
337: }
338:
339: (*buf)[pos] = '\0';
340: }
341:
342: /*
343: * Open the filename-index mandoc-db database.
344: * Returns NULL if opening failed.
345: */
346: static DB *
347: index_open(void)
348: {
349: DB *db;
350:
1.2 schwarze 351: db = dbopen(MANDOC_IDX, O_RDONLY, 0, DB_RECNO, NULL);
1.1 schwarze 352: if (NULL != db)
353: return(db);
354:
355: return(NULL);
356: }
357:
358: /*
359: * Safely unpack from an index file record into the structure.
360: * Returns 1 if an entry was unpacked, 0 if the database is insane.
361: */
362: static int
1.11 kristaps 363: index_read(const DBT *key, const DBT *val, int index,
1.1 schwarze 364: const struct mchars *mc, struct rec *rec)
365: {
366: size_t left;
367: char *np, *cp;
1.24 ! kristaps 368: char type;
1.1 schwarze 369:
370: #define INDEX_BREAD(_dst) \
371: do { \
372: if (NULL == (np = memchr(cp, '\0', left))) \
373: return(0); \
374: norm_string(cp, mc, &(_dst)); \
375: left -= (np - cp) + 1; \
376: cp = np + 1; \
377: } while (/* CONSTCOND */ 0)
378:
1.24 ! kristaps 379: if (0 == (left = val->size))
! 380: return(0);
1.1 schwarze 381:
1.24 ! kristaps 382: cp = val->data;
1.5 kristaps 383: rec->res.rec = *(recno_t *)key->data;
1.11 kristaps 384: rec->res.volume = index;
1.1 schwarze 385:
1.24 ! kristaps 386: if ('d' == (type = *cp++))
! 387: rec->res.type = RESTYPE_MDOC;
! 388: else if ('a' == type)
! 389: rec->res.type = RESTYPE_MAN;
! 390: else if ('c' == type)
! 391: rec->res.type = RESTYPE_CAT;
! 392: else
! 393: return(0);
! 394:
! 395: left--;
1.5 kristaps 396: INDEX_BREAD(rec->res.file);
397: INDEX_BREAD(rec->res.cat);
398: INDEX_BREAD(rec->res.title);
399: INDEX_BREAD(rec->res.arch);
400: INDEX_BREAD(rec->res.desc);
1.1 schwarze 401: return(1);
402: }
403:
404: /*
1.10 kristaps 405: * Search mandocdb databases in paths for expression "expr".
1.1 schwarze 406: * Filter out by "opts".
407: * Call "res" with the results, which may be zero.
1.5 kristaps 408: * Return 0 if there was a database error, else return 1.
1.1 schwarze 409: */
1.5 kristaps 410: int
1.10 kristaps 411: apropos_search(int pathsz, char **paths, const struct opts *opts,
1.12 schwarze 412: const struct expr *expr, size_t terms, void *arg,
1.5 kristaps 413: void (*res)(struct res *, size_t, void *))
1.1 schwarze 414: {
1.8 kristaps 415: struct rectree tree;
416: struct mchars *mc;
417: struct res *ress;
418: int i, mlen, rc;
419:
420: memset(&tree, 0, sizeof(struct rectree));
421:
1.10 kristaps 422: rc = 0;
1.8 kristaps 423: mc = mchars_alloc();
424:
1.10 kristaps 425: /*
426: * Main loop. Change into the directory containing manpage
427: * databases. Run our expession over each database in the set.
428: */
429:
430: for (i = 0; i < pathsz; i++) {
431: if (chdir(paths[i]))
1.8 kristaps 432: continue;
1.11 kristaps 433: if ( ! single_search(&tree, opts, expr, terms, mc, i))
1.10 kristaps 434: goto out;
1.8 kristaps 435: }
436:
437: /*
1.10 kristaps 438: * Count matching files, transfer to a "clean" array, then feed
439: * them to the output handler.
1.8 kristaps 440: */
441:
442: for (mlen = i = 0; i < tree.len; i++)
443: if (tree.node[i].matched)
444: mlen++;
445:
446: ress = mandoc_malloc(mlen * sizeof(struct res));
447:
448: for (mlen = i = 0; i < tree.len; i++)
449: if (tree.node[i].matched)
1.12 schwarze 450: memcpy(&ress[mlen++], &tree.node[i].res,
1.8 kristaps 451: sizeof(struct res));
452:
453: (*res)(ress, mlen, arg);
454: free(ress);
455:
1.10 kristaps 456: rc = 1;
457: out:
1.8 kristaps 458: for (i = 0; i < tree.len; i++)
459: recfree(&tree.node[i]);
460:
461: free(tree.node);
462: mchars_free(mc);
463: return(rc);
464: }
465:
466: static int
467: single_search(struct rectree *tree, const struct opts *opts,
468: const struct expr *expr, size_t terms,
1.11 kristaps 469: struct mchars *mc, int vol)
1.8 kristaps 470: {
471: int root, leaf, ch;
1.1 schwarze 472: DBT key, val;
473: DB *btree, *idx;
474: char *buf;
1.5 kristaps 475: struct rec *rs;
476: struct rec r;
1.17 kristaps 477: struct db_val vb;
1.1 schwarze 478:
479: root = -1;
480: leaf = -1;
481: btree = NULL;
482: idx = NULL;
483: buf = NULL;
1.8 kristaps 484: rs = tree->node;
1.1 schwarze 485:
1.5 kristaps 486: memset(&r, 0, sizeof(struct rec));
1.1 schwarze 487:
1.12 schwarze 488: if (NULL == (btree = btree_open()))
1.10 kristaps 489: return(1);
1.1 schwarze 490:
1.8 kristaps 491: if (NULL == (idx = index_open())) {
492: (*btree->close)(btree);
1.10 kristaps 493: return(1);
1.8 kristaps 494: }
1.1 schwarze 495:
496: while (0 == (ch = (*btree->seq)(btree, &key, &val, R_NEXT))) {
1.17 kristaps 497: if ( ! btree_read(&key, &val, mc, &vb, &buf))
1.1 schwarze 498: break;
499:
1.5 kristaps 500: /*
501: * See if this keyword record matches any of the
502: * expressions we have stored.
503: */
1.17 kristaps 504: if ( ! exprmark(expr, buf, vb.mask, NULL))
1.1 schwarze 505: continue;
506:
507: /*
508: * O(log n) scan for prior records. Since a record
509: * number is unbounded, this has decent performance over
510: * a complex hash function.
511: */
512:
513: for (leaf = root; leaf >= 0; )
1.17 kristaps 514: if (vb.rec > rs[leaf].res.rec &&
1.5 kristaps 515: rs[leaf].rhs >= 0)
516: leaf = rs[leaf].rhs;
1.17 kristaps 517: else if (vb.rec < rs[leaf].res.rec &&
1.5 kristaps 518: rs[leaf].lhs >= 0)
519: leaf = rs[leaf].lhs;
1.12 schwarze 520: else
1.1 schwarze 521: break;
522:
1.5 kristaps 523: /*
524: * If we find a record, see if it has already evaluated
525: * to true. If it has, great, just keep going. If not,
526: * try to evaluate it now and continue anyway.
527: */
528:
1.17 kristaps 529: if (leaf >= 0 && rs[leaf].res.rec == vb.rec) {
1.5 kristaps 530: if (0 == rs[leaf].matched)
1.17 kristaps 531: exprexec(expr, buf, vb.mask, &rs[leaf]);
1.1 schwarze 532: continue;
1.5 kristaps 533: }
1.1 schwarze 534:
535: /*
1.5 kristaps 536: * We have a new file to examine.
537: * Extract the manpage's metadata from the index
538: * database, then begin partial evaluation.
1.1 schwarze 539: */
540:
1.17 kristaps 541: key.data = &vb.rec;
1.1 schwarze 542: key.size = sizeof(recno_t);
543:
544: if (0 != (*idx->get)(idx, &key, &val, 0))
545: break;
546:
1.5 kristaps 547: r.lhs = r.rhs = -1;
1.11 kristaps 548: if ( ! index_read(&key, &val, vol, mc, &r))
1.1 schwarze 549: break;
550:
1.5 kristaps 551: /* XXX: this should be elsewhere, I guess? */
552:
553: if (opts->cat && strcasecmp(opts->cat, r.res.cat))
1.1 schwarze 554: continue;
1.22 kristaps 555:
556: if (opts->arch && *r.res.arch)
557: if (strcasecmp(opts->arch, r.res.arch))
558: continue;
1.1 schwarze 559:
1.8 kristaps 560: tree->node = rs = mandoc_realloc
561: (rs, (tree->len + 1) * sizeof(struct rec));
1.1 schwarze 562:
1.8 kristaps 563: memcpy(&rs[tree->len], &r, sizeof(struct rec));
1.23 kristaps 564: memset(&r, 0, sizeof(struct rec));
1.12 schwarze 565: rs[tree->len].matches =
1.8 kristaps 566: mandoc_calloc(terms, sizeof(int));
1.1 schwarze 567:
1.17 kristaps 568: exprexec(expr, buf, vb.mask, &rs[tree->len]);
1.12 schwarze 569:
1.1 schwarze 570: /* Append to our tree. */
571:
572: if (leaf >= 0) {
1.17 kristaps 573: if (vb.rec > rs[leaf].res.rec)
1.8 kristaps 574: rs[leaf].rhs = tree->len;
1.1 schwarze 575: else
1.8 kristaps 576: rs[leaf].lhs = tree->len;
1.1 schwarze 577: } else
1.8 kristaps 578: root = tree->len;
1.12 schwarze 579:
1.8 kristaps 580: tree->len++;
1.1 schwarze 581: }
1.12 schwarze 582:
1.8 kristaps 583: (*btree->close)(btree);
584: (*idx->close)(idx);
1.1 schwarze 585:
586: free(buf);
1.23 kristaps 587: recfree(&r);
1.8 kristaps 588: return(1 == ch);
1.5 kristaps 589: }
590:
591: static void
592: recfree(struct rec *rec)
593: {
594:
595: free(rec->res.file);
596: free(rec->res.cat);
597: free(rec->res.title);
598: free(rec->res.arch);
599: free(rec->res.desc);
600:
601: free(rec->matches);
1.1 schwarze 602: }
603:
1.13 kristaps 604: /*
605: * Compile a list of straight-up terms.
606: * The arguments are re-written into ~[[:<:]]term[[:>:]], or "term"
607: * surrounded by word boundaries, then pumped through exprterm().
608: * Terms are case-insensitive.
609: * This emulates whatis(1) behaviour.
610: */
611: struct expr *
612: termcomp(int argc, char *argv[], size_t *tt)
613: {
614: char *buf;
615: int pos;
616: struct expr *e, *next;
617: size_t sz;
618:
619: buf = NULL;
620: e = NULL;
621: *tt = 0;
622:
1.15 schwarze 623: for (pos = argc - 1; pos >= 0; pos--) {
624: sz = strlen(argv[pos]) + 18;
1.13 kristaps 625: buf = mandoc_realloc(buf, sz);
1.15 schwarze 626: strlcpy(buf, "Nm~[[:<:]]", sz);
1.13 kristaps 627: strlcat(buf, argv[pos], sz);
628: strlcat(buf, "[[:>:]]", sz);
629: if (NULL == (next = exprterm(buf, 0))) {
630: free(buf);
631: exprfree(e);
632: return(NULL);
633: }
1.15 schwarze 634: next->next = e;
1.13 kristaps 635: e = next;
636: (*tt)++;
637: }
638:
639: free(buf);
640: return(e);
641: }
642:
643: /*
644: * Compile a sequence of logical expressions.
645: * See apropos.1 for a grammar of this sequence.
646: */
1.1 schwarze 647: struct expr *
1.5 kristaps 648: exprcomp(int argc, char *argv[], size_t *tt)
1.1 schwarze 649: {
1.5 kristaps 650: int pos, lvl;
651: struct expr *e;
652:
653: pos = lvl = 0;
654: *tt = 0;
655:
656: e = exprexpr(argc, argv, &pos, &lvl, tt);
657:
658: if (0 == lvl && pos >= argc)
659: return(e);
660:
661: exprfree(e);
662: return(NULL);
663: }
664:
665: /*
666: * Compile an array of tokens into an expression.
667: * An informal expression grammar is defined in apropos(1).
668: * Return NULL if we fail doing so. All memory will be cleaned up.
669: * Return the root of the expression sequence if alright.
670: */
671: static struct expr *
1.9 kristaps 672: exprexpr(int argc, char *argv[], int *pos, int *lvl, size_t *tt)
1.5 kristaps 673: {
674: struct expr *e, *first, *next;
675: int log;
676:
677: first = next = NULL;
678:
679: for ( ; *pos < argc; (*pos)++) {
680: e = next;
681:
682: /*
683: * Close out a subexpression.
684: */
685:
686: if (NULL != e && 0 == strcmp(")", argv[*pos])) {
687: if (--(*lvl) < 0)
688: goto err;
689: break;
690: }
691:
692: /*
693: * Small note: if we're just starting, don't let "-a"
694: * and "-o" be considered logical operators: they're
695: * just tokens unless pairwise joining, in which case we
696: * record their existence (or assume "OR").
697: */
698: log = 0;
699:
700: if (NULL != e && 0 == strcmp("-a", argv[*pos]))
1.12 schwarze 701: log = 1;
1.5 kristaps 702: else if (NULL != e && 0 == strcmp("-o", argv[*pos]))
703: log = 2;
704:
705: if (log > 0 && ++(*pos) >= argc)
706: goto err;
707:
708: /*
709: * Now we parse the term part. This can begin with
710: * "-i", in which case the expression is case
711: * insensitive.
712: */
713:
714: if (0 == strcmp("(", argv[*pos])) {
715: ++(*pos);
716: ++(*lvl);
717: next = mandoc_calloc(1, sizeof(struct expr));
718: next->subexpr = exprexpr(argc, argv, pos, lvl, tt);
719: if (NULL == next->subexpr) {
720: free(next);
721: next = NULL;
722: }
723: } else if (0 == strcmp("-i", argv[*pos])) {
724: if (++(*pos) >= argc)
725: goto err;
726: next = exprterm(argv[*pos], 0);
727: } else
728: next = exprterm(argv[*pos], 1);
729:
730: if (NULL == next)
731: goto err;
732:
733: next->and = log == 1;
734: next->index = (int)(*tt)++;
735:
736: /* Append to our chain of expressions. */
737:
738: if (NULL == first) {
739: assert(NULL == e);
740: first = next;
741: } else {
742: assert(NULL != e);
743: e->next = next;
744: }
745: }
746:
747: return(first);
748: err:
749: exprfree(first);
750: return(NULL);
751: }
752:
753: /*
754: * Parse a terminal expression with the grammar as defined in
755: * apropos(1).
756: * Return NULL if we fail the parse.
757: */
758: static struct expr *
759: exprterm(char *buf, int cs)
760: {
761: struct expr e;
1.1 schwarze 762: struct expr *p;
1.3 schwarze 763: char *key;
1.5 kristaps 764: int i;
765:
766: memset(&e, 0, sizeof(struct expr));
1.1 schwarze 767:
1.5 kristaps 768: /* Choose regex or substring match. */
1.3 schwarze 769:
1.4 kristaps 770: if (NULL == (e.v = strpbrk(buf, "=~"))) {
1.3 schwarze 771: e.regex = 0;
1.4 kristaps 772: e.v = buf;
1.3 schwarze 773: } else {
774: e.regex = '~' == *e.v;
775: *e.v++ = '\0';
776: }
1.1 schwarze 777:
1.5 kristaps 778: /* Determine the record types to search for. */
1.3 schwarze 779:
780: e.mask = 0;
1.4 kristaps 781: if (buf < e.v) {
782: while (NULL != (key = strsep(&buf, ","))) {
1.3 schwarze 783: i = 0;
784: while (types[i].mask &&
1.4 kristaps 785: strcmp(types[i].name, key))
1.3 schwarze 786: i++;
787: e.mask |= types[i].mask;
788: }
789: }
790: if (0 == e.mask)
791: e.mask = TYPE_Nm | TYPE_Nd;
1.1 schwarze 792:
1.5 kristaps 793: if (e.regex) {
1.13 kristaps 794: i = REG_EXTENDED | REG_NOSUB | (cs ? 0 : REG_ICASE);
1.5 kristaps 795: if (regcomp(&e.re, e.v, i))
796: return(NULL);
797: }
1.1 schwarze 798:
1.3 schwarze 799: e.v = mandoc_strdup(e.v);
1.1 schwarze 800:
801: p = mandoc_calloc(1, sizeof(struct expr));
802: memcpy(p, &e, sizeof(struct expr));
803: return(p);
804: }
805:
806: void
807: exprfree(struct expr *p)
808: {
1.5 kristaps 809: struct expr *pp;
1.12 schwarze 810:
1.5 kristaps 811: while (NULL != p) {
812: if (p->subexpr)
813: exprfree(p->subexpr);
814: if (p->regex)
815: regfree(&p->re);
816: free(p->v);
817: pp = p->next;
818: free(p);
819: p = pp;
820: }
821: }
1.1 schwarze 822:
1.5 kristaps 823: static int
1.12 schwarze 824: exprmark(const struct expr *p, const char *cp,
1.6 kristaps 825: uint64_t mask, int *ms)
1.5 kristaps 826: {
827:
828: for ( ; p; p = p->next) {
829: if (p->subexpr) {
830: if (exprmark(p->subexpr, cp, mask, ms))
831: return(1);
832: continue;
833: } else if ( ! (mask & p->mask))
834: continue;
1.1 schwarze 835:
1.5 kristaps 836: if (p->regex) {
837: if (regexec(&p->re, cp, 0, NULL, 0))
838: continue;
1.16 kristaps 839: } else if (NULL == strcasestr(cp, p->v))
840: continue;
1.5 kristaps 841:
842: if (NULL == ms)
843: return(1);
844: else
845: ms[p->index] = 1;
846: }
1.1 schwarze 847:
1.5 kristaps 848: return(0);
1.1 schwarze 849: }
850:
851: static int
1.5 kristaps 852: expreval(const struct expr *p, int *ms)
1.1 schwarze 853: {
1.5 kristaps 854: int match;
1.1 schwarze 855:
1.5 kristaps 856: /*
857: * AND has precedence over OR. Analysis is left-right, though
858: * it doesn't matter because there are no side-effects.
859: * Thus, step through pairwise ANDs and accumulate their Boolean
860: * evaluation. If we encounter a single true AND collection or
861: * standalone term, the whole expression is true (by definition
862: * of OR).
863: */
864:
865: for (match = 0; p && ! match; p = p->next) {
866: /* Evaluate a subexpression, if applicable. */
867: if (p->subexpr && ! ms[p->index])
868: ms[p->index] = expreval(p->subexpr, ms);
869:
870: match = ms[p->index];
871: for ( ; p->next && p->next->and; p = p->next) {
872: /* Evaluate a subexpression, if applicable. */
873: if (p->next->subexpr && ! ms[p->next->index])
1.12 schwarze 874: ms[p->next->index] =
1.5 kristaps 875: expreval(p->next->subexpr, ms);
876: match = match && ms[p->next->index];
877: }
878: }
879:
880: return(match);
881: }
882:
883: /*
884: * First, update the array of terms for which this expression evaluates
885: * to true.
886: * Second, logically evaluate all terms over the updated array of truth
887: * values.
888: * If this evaluates to true, mark the expression as satisfied.
889: */
890: static void
1.12 schwarze 891: exprexec(const struct expr *e, const char *cp,
1.6 kristaps 892: uint64_t mask, struct rec *r)
1.5 kristaps 893: {
1.1 schwarze 894:
1.5 kristaps 895: assert(0 == r->matched);
1.12 schwarze 896: exprmark(e, cp, mask, r->matches);
897: r->matched = expreval(e, r->matches);
1.1 schwarze 898: }
CVSweb
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to apropos_db.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [cvsweb.bsd.lv] / mandoc