]> git.cameronkatri.com Git - mandoc.git/blob - mansearch.c
KNF: case (FOO): -> case FOO:, remove /* LINTED */ and /* ARGSUSED */,
[mandoc.git] / mansearch.c
1 /* $Id: mansearch.c,v 1.34 2014/04/20 16:46:05 schwarze Exp $ */
2 /*
3 * Copyright (c) 2012 Kristaps Dzonsons <kristaps@bsd.lv>
4 * Copyright (c) 2013, 2014 Ingo Schwarze <schwarze@openbsd.org>
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 <sys/mman.h>
23 #include <assert.h>
24 #include <fcntl.h>
25 #include <getopt.h>
26 #include <limits.h>
27 #include <regex.h>
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
35 #ifdef HAVE_OHASH
36 #include <ohash.h>
37 #else
38 #include "compat_ohash.h"
39 #endif
40 #include <sqlite3.h>
41
42 #include "mandoc.h"
43 #include "mandoc_aux.h"
44 #include "manpath.h"
45 #include "mansearch.h"
46
47 extern int mansearch_keymax;
48 extern const char *const mansearch_keynames[];
49
50 #define SQL_BIND_TEXT(_db, _s, _i, _v) \
51 do { if (SQLITE_OK != sqlite3_bind_text \
52 ((_s), (_i)++, (_v), -1, SQLITE_STATIC)) \
53 fprintf(stderr, "%s\n", sqlite3_errmsg((_db))); \
54 } while (0)
55 #define SQL_BIND_INT64(_db, _s, _i, _v) \
56 do { if (SQLITE_OK != sqlite3_bind_int64 \
57 ((_s), (_i)++, (_v))) \
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)
65
66 struct expr {
67 uint64_t bits; /* type-mask */
68 const char *substr; /* to search for, if applicable */
69 regex_t regexp; /* compiled regexp, if applicable */
70 int open; /* opening parentheses before */
71 int and; /* logical AND before */
72 int close; /* closing parentheses after */
73 struct expr *next; /* next in sequence */
74 };
75
76 struct match {
77 uint64_t pageid; /* identifier in database */
78 char *desc; /* manual page description */
79 int form; /* 0 == catpage */
80 };
81
82 static void buildnames(struct manpage *, sqlite3 *,
83 sqlite3_stmt *, uint64_t,
84 const char *, int form);
85 static char *buildoutput(sqlite3 *, sqlite3_stmt *,
86 uint64_t, uint64_t);
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 *);
90 static struct expr *exprcomp(const struct mansearch *,
91 int, char *[]);
92 static void exprfree(struct expr *);
93 static struct expr *exprspec(struct expr *, uint64_t,
94 const char *, const char *);
95 static struct expr *exprterm(const struct mansearch *, char *, int);
96 static void sql_append(char **sql, size_t *sz,
97 const char *newstr, int count);
98 static void sql_match(sqlite3_context *context,
99 int argc, sqlite3_value **argv);
100 static void sql_regexp(sqlite3_context *context,
101 int argc, sqlite3_value **argv);
102 static char *sql_statement(const struct expr *);
103
104
105 int
106 mansearch_setup(int start)
107 {
108 static void *pagecache;
109 int c;
110
111 #define PC_PAGESIZE 1280
112 #define PC_NUMPAGES 256
113
114 if (start) {
115 if (NULL != pagecache) {
116 fprintf(stderr, "pagecache already enabled\n");
117 return((int)MANDOCLEVEL_BADARG);
118 }
119
120 pagecache = mmap(NULL, PC_PAGESIZE * PC_NUMPAGES,
121 PROT_READ | PROT_WRITE, MAP_ANON, -1, 0);
122
123 if (MAP_FAILED == pagecache) {
124 perror("mmap");
125 pagecache = NULL;
126 return((int)MANDOCLEVEL_SYSERR);
127 }
128
129 c = sqlite3_config(SQLITE_CONFIG_PAGECACHE,
130 pagecache, PC_PAGESIZE, PC_NUMPAGES);
131
132 if (SQLITE_OK == c)
133 return((int)MANDOCLEVEL_OK);
134
135 fprintf(stderr, "pagecache: %s\n", sqlite3_errstr(c));
136
137 } else if (NULL == pagecache) {
138 fprintf(stderr, "pagecache missing\n");
139 return((int)MANDOCLEVEL_BADARG);
140 }
141
142 if (-1 == munmap(pagecache, PC_PAGESIZE * PC_NUMPAGES)) {
143 perror("munmap");
144 pagecache = NULL;
145 return((int)MANDOCLEVEL_SYSERR);
146 }
147
148 pagecache = NULL;
149 return((int)MANDOCLEVEL_OK);
150 }
151
152 int
153 mansearch(const struct mansearch *search,
154 const struct manpaths *paths,
155 int argc, char *argv[],
156 const char *outkey,
157 struct manpage **res, size_t *sz)
158 {
159 int fd, rc, c, indexbit;
160 int64_t pageid;
161 uint64_t outbit, iterbit;
162 char buf[PATH_MAX];
163 char *sql;
164 struct manpage *mpage;
165 struct expr *e, *ep;
166 sqlite3 *db;
167 sqlite3_stmt *s, *s2;
168 struct match *mp;
169 struct ohash_info info;
170 struct ohash htab;
171 unsigned int idx;
172 size_t i, j, cur, maxres;
173
174 memset(&info, 0, sizeof(struct ohash_info));
175
176 info.halloc = hash_halloc;
177 info.alloc = hash_alloc;
178 info.hfree = hash_free;
179 info.key_offset = offsetof(struct match, pageid);
180
181 *sz = cur = maxres = 0;
182 sql = NULL;
183 *res = NULL;
184 fd = -1;
185 e = NULL;
186 rc = 0;
187
188 if (0 == argc)
189 goto out;
190 if (NULL == (e = exprcomp(search, argc, argv)))
191 goto out;
192
193 outbit = 0;
194 if (NULL != outkey) {
195 for (indexbit = 0, iterbit = 1;
196 indexbit < mansearch_keymax;
197 indexbit++, iterbit <<= 1) {
198 if (0 == strcasecmp(outkey,
199 mansearch_keynames[indexbit])) {
200 outbit = iterbit;
201 break;
202 }
203 }
204 }
205
206 /*
207 * Save a descriptor to the current working directory.
208 * Since pathnames in the "paths" variable might be relative,
209 * and we'll be chdir()ing into them, we need to keep a handle
210 * on our current directory from which to start the chdir().
211 */
212
213 if (NULL == getcwd(buf, PATH_MAX)) {
214 perror("getcwd");
215 goto out;
216 } else if (-1 == (fd = open(buf, O_RDONLY, 0))) {
217 perror(buf);
218 goto out;
219 }
220
221 sql = sql_statement(e);
222
223 /*
224 * Loop over the directories (containing databases) for us to
225 * search.
226 * Don't let missing/bad databases/directories phase us.
227 * In each, try to open the resident database and, if it opens,
228 * scan it for our match expression.
229 */
230
231 for (i = 0; i < paths->sz; i++) {
232 if (-1 == fchdir(fd)) {
233 perror(buf);
234 free(*res);
235 break;
236 } else if (-1 == chdir(paths->paths[i])) {
237 perror(paths->paths[i]);
238 continue;
239 }
240
241 c = sqlite3_open_v2(MANDOC_DB, &db,
242 SQLITE_OPEN_READONLY, NULL);
243
244 if (SQLITE_OK != c) {
245 perror(MANDOC_DB);
246 sqlite3_close(db);
247 continue;
248 }
249
250 /*
251 * Define the SQL functions for substring
252 * and regular expression matching.
253 */
254
255 c = sqlite3_create_function(db, "match", 2,
256 SQLITE_UTF8 | SQLITE_DETERMINISTIC,
257 NULL, sql_match, NULL, NULL);
258 assert(SQLITE_OK == c);
259 c = sqlite3_create_function(db, "regexp", 2,
260 SQLITE_UTF8 | SQLITE_DETERMINISTIC,
261 NULL, sql_regexp, NULL, NULL);
262 assert(SQLITE_OK == c);
263
264 j = 1;
265 c = sqlite3_prepare_v2(db, sql, -1, &s, NULL);
266 if (SQLITE_OK != c)
267 fprintf(stderr, "%s\n", sqlite3_errmsg(db));
268
269 for (ep = e; NULL != ep; ep = ep->next) {
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);
274 if (0 == ((TYPE_Nd | TYPE_Nm) & ep->bits))
275 SQL_BIND_INT64(db, s, j, ep->bits);
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 */
289 while (SQLITE_ROW == (c = sqlite3_step(s))) {
290 pageid = sqlite3_column_int64(s, 2);
291 idx = ohash_lookup_memory(&htab,
292 (char *)&pageid, sizeof(uint64_t),
293 (uint32_t)pageid);
294
295 if (NULL != ohash_find(&htab, idx))
296 continue;
297
298 mp = mandoc_calloc(1, sizeof(struct match));
299 mp->pageid = pageid;
300 mp->form = sqlite3_column_int(s, 1);
301 if (TYPE_Nd == outbit)
302 mp->desc = mandoc_strdup(
303 sqlite3_column_text(s, 0));
304 ohash_insert(&htab, idx, mp);
305 }
306
307 if (SQLITE_DONE != c)
308 fprintf(stderr, "%s\n", sqlite3_errmsg(db));
309
310 sqlite3_finalize(s);
311
312 c = sqlite3_prepare_v2(db,
313 "SELECT * FROM mlinks WHERE pageid=?"
314 " ORDER BY sec, arch, name",
315 -1, &s, NULL);
316 if (SQLITE_OK != c)
317 fprintf(stderr, "%s\n", sqlite3_errmsg(db));
318
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
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(*res,
331 maxres * sizeof(struct manpage));
332 }
333 mpage = *res + cur;
334 mpage->form = mp->form;
335 buildnames(mpage, db, s, mp->pageid,
336 paths->paths[i], mp->form);
337 mpage->output = TYPE_Nd & outbit ?
338 mp->desc : outbit ?
339 buildoutput(db, s2, mp->pageid, outbit) : NULL;
340
341 free(mp);
342 cur++;
343 }
344
345 sqlite3_finalize(s);
346 sqlite3_finalize(s2);
347 sqlite3_close(db);
348 ohash_delete(&htab);
349 }
350 rc = 1;
351 out:
352 if (-1 != fd) {
353 if (-1 == fchdir(fd))
354 perror(buf);
355 close(fd);
356 }
357 exprfree(e);
358 free(sql);
359 *sz = cur;
360 return(rc);
361 }
362
363 static void
364 buildnames(struct manpage *mpage, sqlite3 *db, sqlite3_stmt *s,
365 uint64_t pageid, const char *path, int form)
366 {
367 char *newnames, *prevsec, *prevarch;
368 const char *oldnames, *sep1, *name, *sec, *sep2, *arch, *fsec;
369 size_t i;
370 int c;
371
372 mpage->file = NULL;
373 mpage->names = NULL;
374 prevsec = prevarch = NULL;
375 i = 1;
376 SQL_BIND_INT64(db, s, i, pageid);
377 while (SQLITE_ROW == (c = sqlite3_step(s))) {
378
379 /* Decide whether we already have some names. */
380
381 if (NULL == mpage->names) {
382 oldnames = "";
383 sep1 = "";
384 } else {
385 oldnames = mpage->names;
386 sep1 = ", ";
387 }
388
389 /* Fetch the next name. */
390
391 sec = sqlite3_column_text(s, 0);
392 arch = sqlite3_column_text(s, 1);
393 name = sqlite3_column_text(s, 2);
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 ? "" : "/";
401 mandoc_asprintf(&newnames, "%s(%s%s%s)",
402 oldnames, prevsec, sep2, prevarch);
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
419 mandoc_asprintf(&newnames, "%s%s%s",
420 oldnames, sep1, name);
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
429 if (form) {
430 sep1 = "man";
431 fsec = sec;
432 } else {
433 sep1 = "cat";
434 fsec = "0";
435 }
436 sep2 = '\0' == *arch ? "" : "/";
437 mandoc_asprintf(&mpage->file, "%s/%s%s%s%s/%s.%s",
438 path, sep1, sec, sep2, arch, name, fsec);
439 }
440 if (SQLITE_DONE != c)
441 fprintf(stderr, "%s\n", sqlite3_errmsg(db));
442 sqlite3_reset(s);
443
444 /* Append one final section to the names. */
445
446 if (NULL != prevsec) {
447 sep2 = '\0' == *prevarch ? "" : "/";
448 mandoc_asprintf(&newnames, "%s(%s%s%s)",
449 mpage->names, prevsec, sep2, prevarch);
450 free(mpage->names);
451 mpage->names = newnames;
452 free(prevsec);
453 free(prevarch);
454 }
455 }
456
457 static char *
458 buildoutput(sqlite3 *db, sqlite3_stmt *s, uint64_t pageid, 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, pageid);
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);
478 mandoc_asprintf(&newoutput, "%s%s%s",
479 oldoutput, sep1, data);
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);
487 }
488
489 /*
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 /*
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
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
535 /*
536 * Prepare the search SQL statement.
537 */
538 static char *
539 sql_statement(const struct expr *e)
540 {
541 char *sql;
542 size_t sz;
543 int needop;
544
545 sql = mandoc_strdup("SELECT * FROM mpages WHERE ");
546 sz = strlen(sql);
547
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);
555 sql_append(&sql, &sz,
556 TYPE_Nd & e->bits
557 ? (NULL == e->substr
558 ? "desc REGEXP ?"
559 : "desc MATCH ?")
560 : TYPE_Nm == e->bits
561 ? (NULL == e->substr
562 ? "pageid IN (SELECT pageid FROM names "
563 "WHERE name REGEXP ?)"
564 : "pageid IN (SELECT pageid FROM names "
565 "WHERE name MATCH ?)")
566 : (NULL == e->substr
567 ? "pageid IN (SELECT pageid FROM keys "
568 "WHERE key REGEXP ? AND bits & ?)"
569 : "pageid IN (SELECT pageid FROM keys "
570 "WHERE key MATCH ? AND bits & ?)"), 1);
571 if (e->close)
572 sql_append(&sql, &sz, ")", e->close);
573 needop = 1;
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 *
585 exprcomp(const struct mansearch *search, int argc, char *argv[])
586 {
587 uint64_t mask;
588 int i, toopen, logic, igncase, toclose;
589 struct expr *first, *prev, *cur, *next;
590
591 first = cur = NULL;
592 logic = igncase = toclose = 0;
593 toopen = NULL != search->sec || NULL != search->arch;
594
595 for (i = 0; i < argc; i++) {
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;
624 }
625 next = exprterm(search, argv[i], !igncase);
626 if (NULL == next)
627 goto fail;
628 if (NULL == first)
629 first = next;
630 else
631 cur->next = next;
632 prev = cur = next;
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
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)
655 cur->close = 1;
656
657 toopen = logic = igncase = 0;
658 }
659 if (toopen || logic || igncase || toclose)
660 goto fail;
661
662 if (NULL != search->sec || NULL != search->arch)
663 cur->close++;
664 if (NULL != search->arch)
665 cur = exprspec(cur, TYPE_arch, search->arch, "^(%s|any)$");
666 if (NULL != search->sec)
667 exprspec(cur, TYPE_sec, search->sec, "^%s$");
668
669 return(first);
670
671 fail:
672 if (NULL != first)
673 exprfree(first);
674 return(NULL);
675 }
676
677 static struct expr *
678 exprspec(struct expr *cur, uint64_t key, const char *value,
679 const char *format)
680 {
681 char errbuf[BUFSIZ];
682 char *cp;
683 int irc;
684
685 mandoc_asprintf(&cp, format, value);
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 *
701 exprterm(const struct mansearch *search, char *buf, int cs)
702 {
703 char errbuf[BUFSIZ];
704 struct expr *e;
705 char *key, *v;
706 uint64_t iterbit;
707 int i, irc;
708
709 if ('\0' == *buf)
710 return(NULL);
711
712 e = mandoc_calloc(1, sizeof(struct expr));
713
714 /*"whatis" mode uses an opaque string and default fields. */
715
716 if (MANSEARCH_WHATIS & search->flags) {
717 e->substr = buf;
718 e->bits = search->deftype;
719 return(e);
720 }
721
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, "=~"))) {
729 e->substr = buf;
730 e->bits = search->deftype;
731 return(e);
732 } else if (v == buf)
733 e->bits = search->deftype;
734
735 if ('~' == *v++) {
736 if (NULL != strstr(buf, "arch"))
737 cs = 0;
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);
742 free(e);
743 return(NULL);
744 }
745 } else
746 e->substr = v;
747 v[-1] = '\0';
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;
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;
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 }