Annotation of mandoc/mansearch.c, Revision 1.31
1.31 ! schwarze 1: /* $Id: mansearch.c,v 1.30 2014/04/15 23:51:39 schwarze Exp $ */
1.1 kristaps 2: /*
3: * Copyright (c) 2012 Kristaps Dzonsons <kristaps@bsd.lv>
1.13 schwarze 4: * Copyright (c) 2013, 2014 Ingo Schwarze <schwarze@openbsd.org>
1.1 kristaps 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: */
18: #ifdef HAVE_CONFIG_H
19: #include "config.h"
20: #endif
21:
1.28 schwarze 22: #include <sys/mman.h>
1.1 kristaps 23: #include <assert.h>
24: #include <fcntl.h>
25: #include <getopt.h>
1.6 schwarze 26: #include <limits.h>
1.8 schwarze 27: #include <regex.h>
1.1 kristaps 28: #include <stdio.h>
29: #include <stdint.h>
30: #include <stddef.h>
31: #include <stdlib.h>
32: #include <string.h>
33: #include <unistd.h>
34:
1.4 kristaps 35: #ifdef HAVE_OHASH
1.1 kristaps 36: #include <ohash.h>
1.4 kristaps 37: #else
38: #include "compat_ohash.h"
39: #endif
1.1 kristaps 40: #include <sqlite3.h>
41:
42: #include "mandoc.h"
1.23 schwarze 43: #include "mandoc_aux.h"
1.1 kristaps 44: #include "manpath.h"
45: #include "mansearch.h"
46:
1.20 schwarze 47: extern int mansearch_keymax;
48: extern const char *const mansearch_keynames[];
49:
1.3 kristaps 50: #define SQL_BIND_TEXT(_db, _s, _i, _v) \
1.8 schwarze 51: do { if (SQLITE_OK != sqlite3_bind_text \
1.2 kristaps 52: ((_s), (_i)++, (_v), -1, SQLITE_STATIC)) \
1.8 schwarze 53: fprintf(stderr, "%s\n", sqlite3_errmsg((_db))); \
54: } while (0)
1.3 kristaps 55: #define SQL_BIND_INT64(_db, _s, _i, _v) \
1.8 schwarze 56: do { if (SQLITE_OK != sqlite3_bind_int64 \
1.2 kristaps 57: ((_s), (_i)++, (_v))) \
1.8 schwarze 58: fprintf(stderr, "%s\n", sqlite3_errmsg((_db))); \
59: } while (0)
60: #define SQL_BIND_BLOB(_db, _s, _i, _v) \
61: do { if (SQLITE_OK != sqlite3_bind_blob \
62: ((_s), (_i)++, (&_v), sizeof(_v), SQLITE_STATIC)) \
63: fprintf(stderr, "%s\n", sqlite3_errmsg((_db))); \
64: } while (0)
1.2 kristaps 65:
1.1 kristaps 66: struct expr {
1.8 schwarze 67: uint64_t bits; /* type-mask */
68: const char *substr; /* to search for, if applicable */
69: regex_t regexp; /* compiled regexp, if applicable */
1.13 schwarze 70: int open; /* opening parentheses before */
71: int and; /* logical AND before */
72: int close; /* closing parentheses after */
1.8 schwarze 73: struct expr *next; /* next in sequence */
1.1 kristaps 74: };
75:
76: struct match {
77: uint64_t id; /* identifier in database */
1.26 schwarze 78: char *desc; /* manual page description */
1.1 kristaps 79: int form; /* 0 == catpage */
80: };
81:
1.17 schwarze 82: static void buildnames(struct manpage *, sqlite3 *,
1.19 schwarze 83: sqlite3_stmt *, uint64_t,
84: const char *, int form);
1.12 schwarze 85: static char *buildoutput(sqlite3 *, sqlite3_stmt *,
86: uint64_t, uint64_t);
1.1 kristaps 87: static void *hash_alloc(size_t, void *);
88: static void hash_free(void *, size_t, void *);
89: static void *hash_halloc(size_t, void *);
1.5 kristaps 90: static struct expr *exprcomp(const struct mansearch *,
91: int, char *[]);
1.1 kristaps 92: static void exprfree(struct expr *);
1.15 schwarze 93: static struct expr *exprspec(struct expr *, uint64_t,
94: const char *, const char *);
1.8 schwarze 95: static struct expr *exprterm(const struct mansearch *, char *, int);
1.13 schwarze 96: static void sql_append(char **sql, size_t *sz,
97: const char *newstr, int count);
1.7 schwarze 98: static void sql_match(sqlite3_context *context,
99: int argc, sqlite3_value **argv);
1.8 schwarze 100: static void sql_regexp(sqlite3_context *context,
101: int argc, sqlite3_value **argv);
1.15 schwarze 102: static char *sql_statement(const struct expr *);
1.28 schwarze 103:
104: int
105: mansearch_setup(int start)
106: {
107: static void *pagecache;
108: int c;
109:
110: #define PC_PAGESIZE 1280
111: #define PC_NUMPAGES 256
112:
113: if (start) {
114: if (NULL != pagecache) {
115: fprintf(stderr, "pagecache already enabled\n");
116: return((int)MANDOCLEVEL_BADARG);
117: }
118:
119: pagecache = mmap(NULL, PC_PAGESIZE * PC_NUMPAGES,
120: PROT_READ | PROT_WRITE, MAP_ANON, -1, 0);
121:
122: if (MAP_FAILED == pagecache) {
123: perror("mmap");
124: pagecache = NULL;
125: return((int)MANDOCLEVEL_SYSERR);
126: }
127:
128: c = sqlite3_config(SQLITE_CONFIG_PAGECACHE,
129: pagecache, PC_PAGESIZE, PC_NUMPAGES);
130:
131: if (SQLITE_OK == c)
132: return((int)MANDOCLEVEL_OK);
133:
134: fprintf(stderr, "pagecache: %s\n", sqlite3_errstr(c));
135:
136: } else if (NULL == pagecache) {
137: fprintf(stderr, "pagecache missing\n");
138: return((int)MANDOCLEVEL_BADARG);
139: }
140:
141: if (-1 == munmap(pagecache, PC_PAGESIZE * PC_NUMPAGES)) {
142: perror("munmap");
143: pagecache = NULL;
144: return((int)MANDOCLEVEL_SYSERR);
145: }
146:
147: pagecache = NULL;
148: return((int)MANDOCLEVEL_OK);
149: }
1.1 kristaps 150:
151: int
1.5 kristaps 152: mansearch(const struct mansearch *search,
1.12 schwarze 153: const struct manpaths *paths,
154: int argc, char *argv[],
155: const char *outkey,
1.1 kristaps 156: struct manpage **res, size_t *sz)
157: {
1.20 schwarze 158: int fd, rc, c, indexbit;
1.1 kristaps 159: int64_t id;
1.20 schwarze 160: uint64_t outbit, iterbit;
1.6 schwarze 161: char buf[PATH_MAX];
1.11 schwarze 162: char *sql;
1.10 schwarze 163: struct manpage *mpage;
1.1 kristaps 164: struct expr *e, *ep;
165: sqlite3 *db;
1.12 schwarze 166: sqlite3_stmt *s, *s2;
1.1 kristaps 167: struct match *mp;
168: struct ohash_info info;
169: struct ohash htab;
170: unsigned int idx;
171: size_t i, j, cur, maxres;
172:
173: memset(&info, 0, sizeof(struct ohash_info));
174:
175: info.halloc = hash_halloc;
176: info.alloc = hash_alloc;
177: info.hfree = hash_free;
178: info.key_offset = offsetof(struct match, id);
179:
1.2 kristaps 180: *sz = cur = maxres = 0;
1.1 kristaps 181: sql = NULL;
182: *res = NULL;
183: fd = -1;
184: e = NULL;
1.2 kristaps 185: rc = 0;
1.1 kristaps 186:
187: if (0 == argc)
188: goto out;
1.5 kristaps 189: if (NULL == (e = exprcomp(search, argc, argv)))
1.1 kristaps 190: goto out;
191:
1.12 schwarze 192: outbit = 0;
193: if (NULL != outkey) {
1.20 schwarze 194: for (indexbit = 0, iterbit = 1;
195: indexbit < mansearch_keymax;
196: indexbit++, iterbit <<= 1) {
197: if (0 == strcasecmp(outkey,
198: mansearch_keynames[indexbit])) {
199: outbit = iterbit;
1.12 schwarze 200: break;
201: }
202: }
203: }
204:
1.1 kristaps 205: /*
206: * Save a descriptor to the current working directory.
207: * Since pathnames in the "paths" variable might be relative,
208: * and we'll be chdir()ing into them, we need to keep a handle
209: * on our current directory from which to start the chdir().
210: */
211:
1.6 schwarze 212: if (NULL == getcwd(buf, PATH_MAX)) {
1.30 schwarze 213: perror("getcwd");
1.1 kristaps 214: goto out;
215: } else if (-1 == (fd = open(buf, O_RDONLY, 0))) {
216: perror(buf);
217: goto out;
218: }
219:
1.15 schwarze 220: sql = sql_statement(e);
1.1 kristaps 221:
222: /*
223: * Loop over the directories (containing databases) for us to
224: * search.
225: * Don't let missing/bad databases/directories phase us.
226: * In each, try to open the resident database and, if it opens,
227: * scan it for our match expression.
228: */
229:
230: for (i = 0; i < paths->sz; i++) {
231: if (-1 == fchdir(fd)) {
232: perror(buf);
233: free(*res);
234: break;
235: } else if (-1 == chdir(paths->paths[i])) {
236: perror(paths->paths[i]);
237: continue;
238: }
239:
1.2 kristaps 240: c = sqlite3_open_v2
241: (MANDOC_DB, &db,
242: SQLITE_OPEN_READONLY, NULL);
1.1 kristaps 243:
1.2 kristaps 244: if (SQLITE_OK != c) {
1.1 kristaps 245: perror(MANDOC_DB);
246: sqlite3_close(db);
247: continue;
248: }
249:
1.8 schwarze 250: /*
251: * Define the SQL functions for substring
252: * and regular expression matching.
253: */
1.7 schwarze 254:
255: c = sqlite3_create_function(db, "match", 2,
1.31 ! schwarze 256: SQLITE_UTF8 | SQLITE_DETERMINISTIC,
! 257: NULL, sql_match, NULL, NULL);
1.8 schwarze 258: assert(SQLITE_OK == c);
259: c = sqlite3_create_function(db, "regexp", 2,
1.31 ! schwarze 260: SQLITE_UTF8 | SQLITE_DETERMINISTIC,
! 261: NULL, sql_regexp, NULL, NULL);
1.8 schwarze 262: assert(SQLITE_OK == c);
1.7 schwarze 263:
1.1 kristaps 264: j = 1;
1.2 kristaps 265: c = sqlite3_prepare_v2(db, sql, -1, &s, NULL);
266: if (SQLITE_OK != c)
267: fprintf(stderr, "%s\n", sqlite3_errmsg(db));
1.1 kristaps 268:
269: for (ep = e; NULL != ep; ep = ep->next) {
1.8 schwarze 270: if (NULL == ep->substr) {
271: SQL_BIND_BLOB(db, s, j, ep->regexp);
272: } else
273: SQL_BIND_TEXT(db, s, j, ep->substr);
1.27 schwarze 274: if (0 == ((TYPE_Nd | TYPE_Nm) & ep->bits))
1.26 schwarze 275: SQL_BIND_INT64(db, s, j, ep->bits);
1.1 kristaps 276: }
277:
278: memset(&htab, 0, sizeof(struct ohash));
279: ohash_init(&htab, 4, &info);
280:
281: /*
282: * Hash each entry on its [unique] document identifier.
283: * This is a uint64_t.
284: * Instead of using a hash function, simply convert the
285: * uint64_t to a uint32_t, the hash value's type.
286: * This gives good performance and preserves the
287: * distribution of buckets in the table.
288: */
1.2 kristaps 289: while (SQLITE_ROW == (c = sqlite3_step(s))) {
1.26 schwarze 290: id = sqlite3_column_int64(s, 2);
1.1 kristaps 291: idx = ohash_lookup_memory
1.26 schwarze 292: (&htab, (char *)&id,
1.1 kristaps 293: sizeof(uint64_t), (uint32_t)id);
294:
295: if (NULL != ohash_find(&htab, idx))
296: continue;
297:
298: mp = mandoc_calloc(1, sizeof(struct match));
299: mp->id = id;
1.26 schwarze 300: mp->form = sqlite3_column_int(s, 1);
301: if (TYPE_Nd == outbit)
302: mp->desc = mandoc_strdup(
303: sqlite3_column_text(s, 0));
1.1 kristaps 304: ohash_insert(&htab, idx, mp);
305: }
306:
1.2 kristaps 307: if (SQLITE_DONE != c)
308: fprintf(stderr, "%s\n", sqlite3_errmsg(db));
309:
1.1 kristaps 310: sqlite3_finalize(s);
1.10 schwarze 311:
312: c = sqlite3_prepare_v2(db,
1.22 schwarze 313: "SELECT * FROM mlinks WHERE pageid=?"
314: " ORDER BY sec, arch, name",
1.10 schwarze 315: -1, &s, NULL);
316: if (SQLITE_OK != c)
317: fprintf(stderr, "%s\n", sqlite3_errmsg(db));
1.1 kristaps 318:
1.12 schwarze 319: c = sqlite3_prepare_v2(db,
320: "SELECT * FROM keys WHERE pageid=? AND bits & ?",
321: -1, &s2, NULL);
322: if (SQLITE_OK != c)
323: fprintf(stderr, "%s\n", sqlite3_errmsg(db));
324:
1.1 kristaps 325: for (mp = ohash_first(&htab, &idx);
326: NULL != mp;
327: mp = ohash_next(&htab, &idx)) {
328: if (cur + 1 > maxres) {
329: maxres += 1024;
330: *res = mandoc_realloc
331: (*res, maxres * sizeof(struct manpage));
332: }
1.10 schwarze 333: mpage = *res + cur;
334: mpage->form = mp->form;
1.19 schwarze 335: buildnames(mpage, db, s, mp->id,
336: paths->paths[i], mp->form);
1.26 schwarze 337: mpage->output = TYPE_Nd & outbit ?
338: mp->desc : outbit ?
1.12 schwarze 339: buildoutput(db, s2, mp->id, outbit) : NULL;
1.10 schwarze 340:
1.1 kristaps 341: free(mp);
342: cur++;
343: }
1.10 schwarze 344:
345: sqlite3_finalize(s);
1.12 schwarze 346: sqlite3_finalize(s2);
1.10 schwarze 347: sqlite3_close(db);
1.1 kristaps 348: ohash_delete(&htab);
349: }
1.2 kristaps 350: rc = 1;
1.1 kristaps 351: out:
1.30 schwarze 352: if (-1 != fd) {
353: if (-1 == fchdir(fd))
354: perror(buf);
355: close(fd);
356: }
1.1 kristaps 357: exprfree(e);
358: free(sql);
359: *sz = cur;
1.2 kristaps 360: return(rc);
1.11 schwarze 361: }
362:
1.17 schwarze 363: static void
364: buildnames(struct manpage *mpage, sqlite3 *db, sqlite3_stmt *s,
1.19 schwarze 365: uint64_t id, const char *path, int form)
1.11 schwarze 366: {
1.22 schwarze 367: char *newnames, *prevsec, *prevarch;
1.19 schwarze 368: const char *oldnames, *sep1, *name, *sec, *sep2, *arch, *fsec;
1.11 schwarze 369: size_t i;
370: int c;
371:
1.25 schwarze 372: mpage->file = NULL;
1.17 schwarze 373: mpage->names = NULL;
1.22 schwarze 374: prevsec = prevarch = NULL;
1.11 schwarze 375: i = 1;
376: SQL_BIND_INT64(db, s, i, id);
377: while (SQLITE_ROW == (c = sqlite3_step(s))) {
1.17 schwarze 378:
1.22 schwarze 379: /* Decide whether we already have some names. */
1.17 schwarze 380:
381: if (NULL == mpage->names) {
1.11 schwarze 382: oldnames = "";
383: sep1 = "";
384: } else {
1.17 schwarze 385: oldnames = mpage->names;
1.11 schwarze 386: sep1 = ", ";
387: }
1.22 schwarze 388:
389: /* Fetch the next name. */
390:
1.19 schwarze 391: sec = sqlite3_column_text(s, 0);
392: arch = sqlite3_column_text(s, 1);
393: name = sqlite3_column_text(s, 2);
1.22 schwarze 394:
395: /* If the section changed, append the old one. */
396:
397: if (NULL != prevsec &&
398: (strcmp(sec, prevsec) ||
399: strcmp(arch, prevarch))) {
400: sep2 = '\0' == *prevarch ? "" : "/";
1.24 schwarze 401: mandoc_asprintf(&newnames, "%s(%s%s%s)",
402: oldnames, prevsec, sep2, prevarch);
1.22 schwarze 403: free(mpage->names);
404: oldnames = mpage->names = newnames;
405: free(prevsec);
406: free(prevarch);
407: prevsec = prevarch = NULL;
408: }
409:
410: /* Save the new section, to append it later. */
411:
412: if (NULL == prevsec) {
413: prevsec = mandoc_strdup(sec);
414: prevarch = mandoc_strdup(arch);
415: }
416:
417: /* Append the new name. */
418:
1.24 schwarze 419: mandoc_asprintf(&newnames, "%s%s%s",
420: oldnames, sep1, name);
1.17 schwarze 421: free(mpage->names);
422: mpage->names = newnames;
423:
424: /* Also save the first file name encountered. */
425:
426: if (NULL != mpage->file)
427: continue;
428:
1.19 schwarze 429: if (form) {
430: sep1 = "man";
431: fsec = sec;
432: } else {
433: sep1 = "cat";
434: fsec = "0";
435: }
1.22 schwarze 436: sep2 = '\0' == *arch ? "" : "/";
1.24 schwarze 437: mandoc_asprintf(&mpage->file, "%s/%s%s%s%s/%s.%s",
438: path, sep1, sec, sep2, arch, name, fsec);
1.11 schwarze 439: }
440: if (SQLITE_DONE != c)
441: fprintf(stderr, "%s\n", sqlite3_errmsg(db));
442: sqlite3_reset(s);
1.22 schwarze 443:
444: /* Append one final section to the names. */
445:
446: if (NULL != prevsec) {
447: sep2 = '\0' == *prevarch ? "" : "/";
1.24 schwarze 448: mandoc_asprintf(&newnames, "%s(%s%s%s)",
449: mpage->names, prevsec, sep2, prevarch);
1.22 schwarze 450: free(mpage->names);
451: mpage->names = newnames;
452: free(prevsec);
453: free(prevarch);
454: }
1.12 schwarze 455: }
456:
457: static char *
458: buildoutput(sqlite3 *db, sqlite3_stmt *s, uint64_t id, uint64_t outbit)
459: {
460: char *output, *newoutput;
461: const char *oldoutput, *sep1, *data;
462: size_t i;
463: int c;
464:
465: output = NULL;
466: i = 1;
467: SQL_BIND_INT64(db, s, i, id);
468: SQL_BIND_INT64(db, s, i, outbit);
469: while (SQLITE_ROW == (c = sqlite3_step(s))) {
470: if (NULL == output) {
471: oldoutput = "";
472: sep1 = "";
473: } else {
474: oldoutput = output;
475: sep1 = " # ";
476: }
477: data = sqlite3_column_text(s, 1);
1.24 schwarze 478: mandoc_asprintf(&newoutput, "%s%s%s",
479: oldoutput, sep1, data);
1.12 schwarze 480: free(output);
481: output = newoutput;
482: }
483: if (SQLITE_DONE != c)
484: fprintf(stderr, "%s\n", sqlite3_errmsg(db));
485: sqlite3_reset(s);
486: return(output);
1.1 kristaps 487: }
488:
489: /*
1.7 schwarze 490: * Implement substring match as an application-defined SQL function.
491: * Using the SQL LIKE or GLOB operators instead would be a bad idea
492: * because that would require escaping metacharacters in the string
493: * being searched for.
494: */
495: static void
496: sql_match(sqlite3_context *context, int argc, sqlite3_value **argv)
497: {
498:
499: assert(2 == argc);
500: sqlite3_result_int(context, NULL != strcasestr(
501: (const char *)sqlite3_value_text(argv[1]),
502: (const char *)sqlite3_value_text(argv[0])));
503: }
504:
505: /*
1.8 schwarze 506: * Implement regular expression match
507: * as an application-defined SQL function.
508: */
509: static void
510: sql_regexp(sqlite3_context *context, int argc, sqlite3_value **argv)
511: {
512:
513: assert(2 == argc);
514: sqlite3_result_int(context, !regexec(
515: (regex_t *)sqlite3_value_blob(argv[0]),
516: (const char *)sqlite3_value_text(argv[1]),
517: 0, NULL, 0));
518: }
519:
1.13 schwarze 520: static void
521: sql_append(char **sql, size_t *sz, const char *newstr, int count)
522: {
523: size_t newsz;
524:
525: newsz = 1 < count ? (size_t)count : strlen(newstr);
526: *sql = mandoc_realloc(*sql, *sz + newsz + 1);
527: if (1 < count)
528: memset(*sql + *sz, *newstr, (size_t)count);
529: else
530: memcpy(*sql + *sz, newstr, newsz);
531: *sz += newsz;
532: (*sql)[*sz] = '\0';
533: }
534:
1.8 schwarze 535: /*
1.1 kristaps 536: * Prepare the search SQL statement.
537: */
538: static char *
1.15 schwarze 539: sql_statement(const struct expr *e)
1.1 kristaps 540: {
541: char *sql;
542: size_t sz;
1.13 schwarze 543: int needop;
1.1 kristaps 544:
1.13 schwarze 545: sql = mandoc_strdup("SELECT * FROM mpages WHERE ");
1.1 kristaps 546: sz = strlen(sql);
1.2 kristaps 547:
1.13 schwarze 548: for (needop = 0; NULL != e; e = e->next) {
549: if (e->and)
550: sql_append(&sql, &sz, " AND ", 1);
551: else if (needop)
552: sql_append(&sql, &sz, " OR ", 1);
553: if (e->open)
554: sql_append(&sql, &sz, "(", e->open);
1.26 schwarze 555: sql_append(&sql, &sz,
556: TYPE_Nd & e->bits
557: ? (NULL == e->substr
558: ? "desc REGEXP ?"
559: : "desc MATCH ?")
1.27 schwarze 560: : TYPE_Nm == e->bits
561: ? (NULL == e->substr
562: ? "id IN (SELECT pageid FROM names "
563: "WHERE name REGEXP ?)"
564: : "id IN (SELECT pageid FROM names "
565: "WHERE name MATCH ?)")
1.26 schwarze 566: : (NULL == e->substr
567: ? "id IN (SELECT pageid FROM keys "
568: "WHERE key REGEXP ? AND bits & ?)"
569: : "id IN (SELECT pageid FROM keys "
570: "WHERE key MATCH ? AND bits & ?)"), 1);
1.13 schwarze 571: if (e->close)
572: sql_append(&sql, &sz, ")", e->close);
573: needop = 1;
1.1 kristaps 574: }
575:
576: return(sql);
577: }
578:
579: /*
580: * Compile a set of string tokens into an expression.
581: * Tokens in "argv" are assumed to be individual expression atoms (e.g.,
582: * "(", "foo=bar", etc.).
583: */
584: static struct expr *
1.5 kristaps 585: exprcomp(const struct mansearch *search, int argc, char *argv[])
1.1 kristaps 586: {
1.27 schwarze 587: uint64_t mask;
1.13 schwarze 588: int i, toopen, logic, igncase, toclose;
1.27 schwarze 589: struct expr *first, *prev, *cur, *next;
1.1 kristaps 590:
591: first = cur = NULL;
1.15 schwarze 592: logic = igncase = toclose = 0;
593: toopen = 1;
1.1 kristaps 594:
595: for (i = 0; i < argc; i++) {
1.13 schwarze 596: if (0 == strcmp("(", argv[i])) {
597: if (igncase)
598: goto fail;
599: toopen++;
600: toclose++;
601: continue;
602: } else if (0 == strcmp(")", argv[i])) {
603: if (toopen || logic || igncase || NULL == cur)
604: goto fail;
605: cur->close++;
606: if (0 > --toclose)
607: goto fail;
608: continue;
609: } else if (0 == strcmp("-a", argv[i])) {
610: if (toopen || logic || igncase || NULL == cur)
611: goto fail;
612: logic = 1;
613: continue;
614: } else if (0 == strcmp("-o", argv[i])) {
615: if (toopen || logic || igncase || NULL == cur)
616: goto fail;
617: logic = 2;
618: continue;
619: } else if (0 == strcmp("-i", argv[i])) {
620: if (igncase)
621: goto fail;
622: igncase = 1;
623: continue;
1.1 kristaps 624: }
1.13 schwarze 625: next = exprterm(search, argv[i], !igncase);
626: if (NULL == next)
627: goto fail;
1.26 schwarze 628: if (NULL == first)
629: first = next;
630: else
1.1 kristaps 631: cur->next = next;
1.27 schwarze 632: prev = cur = next;
1.26 schwarze 633:
634: /*
635: * Searching for descriptions must be split out
636: * because they are stored in the mpages table,
637: * not in the keys table.
638: */
639:
1.27 schwarze 640: for (mask = TYPE_Nm; mask <= TYPE_Nd; mask <<= 1) {
641: if (mask & cur->bits && ~mask & cur->bits) {
642: next = mandoc_calloc(1,
643: sizeof(struct expr));
644: memcpy(next, cur, sizeof(struct expr));
645: prev->open = 1;
646: cur->bits = mask;
647: cur->next = next;
648: cur = next;
649: cur->bits &= ~mask;
650: }
651: }
652: prev->and = (1 == logic);
653: prev->open += toopen;
654: if (cur != prev)
1.26 schwarze 655: cur->close = 1;
1.27 schwarze 656:
1.13 schwarze 657: toopen = logic = igncase = 0;
1.1 kristaps 658: }
1.15 schwarze 659: if (toopen || logic || igncase || toclose)
660: goto fail;
661:
662: cur->close++;
663: cur = exprspec(cur, TYPE_arch, search->arch, "^(%s|any)$");
664: exprspec(cur, TYPE_sec, search->sec, "^%s$");
665:
666: return(first);
667:
1.13 schwarze 668: fail:
669: if (NULL != first)
670: exprfree(first);
671: return(NULL);
1.1 kristaps 672: }
673:
674: static struct expr *
1.15 schwarze 675: exprspec(struct expr *cur, uint64_t key, const char *value,
676: const char *format)
677: {
678: char errbuf[BUFSIZ];
679: char *cp;
680: int irc;
681:
682: if (NULL == value)
683: return(cur);
684:
1.24 schwarze 685: mandoc_asprintf(&cp, format, value);
1.15 schwarze 686: cur->next = mandoc_calloc(1, sizeof(struct expr));
687: cur = cur->next;
688: cur->and = 1;
689: cur->bits = key;
690: if (0 != (irc = regcomp(&cur->regexp, cp,
691: REG_EXTENDED | REG_NOSUB | REG_ICASE))) {
692: regerror(irc, &cur->regexp, errbuf, sizeof(errbuf));
693: fprintf(stderr, "regcomp: %s\n", errbuf);
694: cur->substr = value;
695: }
696: free(cp);
697: return(cur);
698: }
699:
700: static struct expr *
1.8 schwarze 701: exprterm(const struct mansearch *search, char *buf, int cs)
1.1 kristaps 702: {
1.15 schwarze 703: char errbuf[BUFSIZ];
1.1 kristaps 704: struct expr *e;
705: char *key, *v;
1.20 schwarze 706: uint64_t iterbit;
707: int i, irc;
1.1 kristaps 708:
709: if ('\0' == *buf)
710: return(NULL);
711:
712: e = mandoc_calloc(1, sizeof(struct expr));
713:
1.5 kristaps 714: /*"whatis" mode uses an opaque string and default fields. */
715:
716: if (MANSEARCH_WHATIS & search->flags) {
1.8 schwarze 717: e->substr = buf;
1.5 kristaps 718: e->bits = search->deftype;
719: return(e);
720: }
721:
1.1 kristaps 722: /*
723: * If no =~ is specified, search with equality over names and
724: * descriptions.
725: * If =~ begins the phrase, use name and description fields.
726: */
727:
728: if (NULL == (v = strpbrk(buf, "=~"))) {
1.8 schwarze 729: e->substr = buf;
1.5 kristaps 730: e->bits = search->deftype;
1.1 kristaps 731: return(e);
732: } else if (v == buf)
1.5 kristaps 733: e->bits = search->deftype;
1.1 kristaps 734:
1.8 schwarze 735: if ('~' == *v++) {
1.21 schwarze 736: if (NULL != strstr(buf, "arch"))
737: cs = 0;
1.15 schwarze 738: if (0 != (irc = regcomp(&e->regexp, v,
739: REG_EXTENDED | REG_NOSUB | (cs ? 0 : REG_ICASE)))) {
740: regerror(irc, &e->regexp, errbuf, sizeof(errbuf));
741: fprintf(stderr, "regcomp: %s\n", errbuf);
1.8 schwarze 742: free(e);
743: return(NULL);
744: }
745: } else
746: e->substr = v;
747: v[-1] = '\0';
1.1 kristaps 748:
749: /*
750: * Parse out all possible fields.
751: * If the field doesn't resolve, bail.
752: */
753:
754: while (NULL != (key = strsep(&buf, ","))) {
755: if ('\0' == *key)
756: continue;
1.20 schwarze 757: for (i = 0, iterbit = 1;
758: i < mansearch_keymax;
759: i++, iterbit <<= 1) {
760: if (0 == strcasecmp(key,
761: mansearch_keynames[i])) {
762: e->bits |= iterbit;
763: break;
764: }
765: }
766: if (i == mansearch_keymax) {
767: if (strcasecmp(key, "any")) {
768: free(e);
769: return(NULL);
770: }
771: e->bits |= ~0ULL;
1.1 kristaps 772: }
773: }
774:
775: return(e);
776: }
777:
778: static void
779: exprfree(struct expr *p)
780: {
781: struct expr *pp;
782:
783: while (NULL != p) {
784: pp = p->next;
785: free(p);
786: p = pp;
787: }
788: }
789:
790: static void *
791: hash_halloc(size_t sz, void *arg)
792: {
793:
794: return(mandoc_calloc(sz, 1));
795: }
796:
797: static void *
798: hash_alloc(size_t sz, void *arg)
799: {
800:
801: return(mandoc_malloc(sz));
802: }
803:
804: static void
805: hash_free(void *p, size_t sz, void *arg)
806: {
807:
808: free(p);
809: }
CVSweb