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