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