]> git.cameronkatri.com Git - mandoc.git/blob - mansearch.c
Implement the traditional -h option for man(1): show the SYNOPSIS only.
[mandoc.git] / mansearch.c
1 /* $Id: mansearch.c,v 1.47 2014/09/01 22:45:53 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->ipath = i;
339 mpage->sec = 10;
340 mpage->form = mp->form;
341 buildnames(mpage, db, s, mp->pageid,
342 paths->paths[i], mp->form);
343 mpage->output = TYPE_Nd & outbit ?
344 mp->desc : outbit ?
345 buildoutput(db, s2, mp->pageid, outbit) : NULL;
346
347 free(mp);
348 cur++;
349 }
350
351 sqlite3_finalize(s);
352 sqlite3_finalize(s2);
353 sqlite3_close(db);
354 ohash_delete(&htab);
355 }
356 qsort(*res, cur, sizeof(struct manpage), manpage_compare);
357 rc = 1;
358 out:
359 if (-1 != fd) {
360 if (-1 == fchdir(fd))
361 perror(buf);
362 close(fd);
363 }
364 exprfree(e);
365 free(sql);
366 *sz = cur;
367 return(rc);
368 }
369
370 void
371 mansearch_free(struct manpage *res, size_t sz)
372 {
373 size_t i;
374
375 for (i = 0; i < sz; i++) {
376 free(res[i].file);
377 free(res[i].names);
378 free(res[i].output);
379 }
380 free(res);
381 }
382
383 static int
384 manpage_compare(const void *vp1, const void *vp2)
385 {
386 const struct manpage *mp1, *mp2;
387 int diff;
388
389 mp1 = vp1;
390 mp2 = vp2;
391 diff = mp1->sec - mp2->sec;
392 return(diff ? diff : strcasecmp(mp1->names, mp2->names));
393 }
394
395 static void
396 buildnames(struct manpage *mpage, sqlite3 *db, sqlite3_stmt *s,
397 uint64_t pageid, const char *path, int form)
398 {
399 char *newnames, *prevsec, *prevarch;
400 const char *oldnames, *sep1, *name, *sec, *sep2, *arch, *fsec;
401 size_t i;
402 int c;
403
404 mpage->file = NULL;
405 mpage->names = NULL;
406 prevsec = prevarch = NULL;
407 i = 1;
408 SQL_BIND_INT64(db, s, i, pageid);
409 while (SQLITE_ROW == (c = sqlite3_step(s))) {
410
411 /* Decide whether we already have some names. */
412
413 if (NULL == mpage->names) {
414 oldnames = "";
415 sep1 = "";
416 } else {
417 oldnames = mpage->names;
418 sep1 = ", ";
419 }
420
421 /* Fetch the next name. */
422
423 sec = (const char *)sqlite3_column_text(s, 0);
424 arch = (const char *)sqlite3_column_text(s, 1);
425 name = (const char *)sqlite3_column_text(s, 2);
426
427 /* Remember the first section found. */
428
429 if (9 < mpage->sec && '1' <= *sec && '9' >= *sec)
430 mpage->sec = (*sec - '1') + 1;
431
432 /* If the section changed, append the old one. */
433
434 if (NULL != prevsec &&
435 (strcmp(sec, prevsec) ||
436 strcmp(arch, prevarch))) {
437 sep2 = '\0' == *prevarch ? "" : "/";
438 mandoc_asprintf(&newnames, "%s(%s%s%s)",
439 oldnames, prevsec, sep2, prevarch);
440 free(mpage->names);
441 oldnames = mpage->names = newnames;
442 free(prevsec);
443 free(prevarch);
444 prevsec = prevarch = NULL;
445 }
446
447 /* Save the new section, to append it later. */
448
449 if (NULL == prevsec) {
450 prevsec = mandoc_strdup(sec);
451 prevarch = mandoc_strdup(arch);
452 }
453
454 /* Append the new name. */
455
456 mandoc_asprintf(&newnames, "%s%s%s",
457 oldnames, sep1, name);
458 free(mpage->names);
459 mpage->names = newnames;
460
461 /* Also save the first file name encountered. */
462
463 if (NULL != mpage->file)
464 continue;
465
466 if (form) {
467 sep1 = "man";
468 fsec = sec;
469 } else {
470 sep1 = "cat";
471 fsec = "0";
472 }
473 sep2 = '\0' == *arch ? "" : "/";
474 mandoc_asprintf(&mpage->file, "%s/%s%s%s%s/%s.%s",
475 path, sep1, sec, sep2, arch, name, fsec);
476 }
477 if (SQLITE_DONE != c)
478 fprintf(stderr, "%s\n", sqlite3_errmsg(db));
479 sqlite3_reset(s);
480
481 /* Append one final section to the names. */
482
483 if (NULL != prevsec) {
484 sep2 = '\0' == *prevarch ? "" : "/";
485 mandoc_asprintf(&newnames, "%s(%s%s%s)",
486 mpage->names, prevsec, sep2, prevarch);
487 free(mpage->names);
488 mpage->names = newnames;
489 free(prevsec);
490 free(prevarch);
491 }
492 }
493
494 static char *
495 buildoutput(sqlite3 *db, sqlite3_stmt *s, uint64_t pageid, uint64_t outbit)
496 {
497 char *output, *newoutput;
498 const char *oldoutput, *sep1, *data;
499 size_t i;
500 int c;
501
502 output = NULL;
503 i = 1;
504 SQL_BIND_INT64(db, s, i, pageid);
505 SQL_BIND_INT64(db, s, i, outbit);
506 while (SQLITE_ROW == (c = sqlite3_step(s))) {
507 if (NULL == output) {
508 oldoutput = "";
509 sep1 = "";
510 } else {
511 oldoutput = output;
512 sep1 = " # ";
513 }
514 data = (const char *)sqlite3_column_text(s, 1);
515 mandoc_asprintf(&newoutput, "%s%s%s",
516 oldoutput, sep1, data);
517 free(output);
518 output = newoutput;
519 }
520 if (SQLITE_DONE != c)
521 fprintf(stderr, "%s\n", sqlite3_errmsg(db));
522 sqlite3_reset(s);
523 return(output);
524 }
525
526 /*
527 * Implement substring match as an application-defined SQL function.
528 * Using the SQL LIKE or GLOB operators instead would be a bad idea
529 * because that would require escaping metacharacters in the string
530 * being searched for.
531 */
532 static void
533 sql_match(sqlite3_context *context, int argc, sqlite3_value **argv)
534 {
535
536 assert(2 == argc);
537 sqlite3_result_int(context, NULL != strcasestr(
538 (const char *)sqlite3_value_text(argv[1]),
539 (const char *)sqlite3_value_text(argv[0])));
540 }
541
542 /*
543 * Implement regular expression match
544 * as an application-defined SQL function.
545 */
546 static void
547 sql_regexp(sqlite3_context *context, int argc, sqlite3_value **argv)
548 {
549
550 assert(2 == argc);
551 sqlite3_result_int(context, !regexec(
552 (regex_t *)sqlite3_value_blob(argv[0]),
553 (const char *)sqlite3_value_text(argv[1]),
554 0, NULL, 0));
555 }
556
557 static void
558 sql_append(char **sql, size_t *sz, const char *newstr, int count)
559 {
560 size_t newsz;
561
562 newsz = 1 < count ? (size_t)count : strlen(newstr);
563 *sql = mandoc_realloc(*sql, *sz + newsz + 1);
564 if (1 < count)
565 memset(*sql + *sz, *newstr, (size_t)count);
566 else
567 memcpy(*sql + *sz, newstr, newsz);
568 *sz += newsz;
569 (*sql)[*sz] = '\0';
570 }
571
572 /*
573 * Prepare the search SQL statement.
574 */
575 static char *
576 sql_statement(const struct expr *e)
577 {
578 char *sql;
579 size_t sz;
580 int needop;
581
582 sql = mandoc_strdup(
583 "SELECT desc, form, pageid FROM mpages WHERE ");
584 sz = strlen(sql);
585
586 for (needop = 0; NULL != e; e = e->next) {
587 if (e->and)
588 sql_append(&sql, &sz, " AND ", 1);
589 else if (needop)
590 sql_append(&sql, &sz, " OR ", 1);
591 if (e->open)
592 sql_append(&sql, &sz, "(", e->open);
593 sql_append(&sql, &sz,
594 TYPE_Nd & e->bits
595 ? (NULL == e->substr
596 ? "desc REGEXP ?"
597 : "desc MATCH ?")
598 : TYPE_Nm == e->bits
599 ? (NULL == e->substr
600 ? "pageid IN (SELECT pageid FROM names "
601 "WHERE name REGEXP ?)"
602 : e->equal
603 ? "pageid IN (SELECT pageid FROM names "
604 "WHERE name = ?)"
605 : "pageid IN (SELECT pageid FROM names "
606 "WHERE name MATCH ?)")
607 : (NULL == e->substr
608 ? "pageid IN (SELECT pageid FROM keys "
609 "WHERE key REGEXP ? AND bits & ?)"
610 : "pageid IN (SELECT pageid FROM keys "
611 "WHERE key MATCH ? AND bits & ?)"), 1);
612 if (e->close)
613 sql_append(&sql, &sz, ")", e->close);
614 needop = 1;
615 }
616
617 return(sql);
618 }
619
620 /*
621 * Compile a set of string tokens into an expression.
622 * Tokens in "argv" are assumed to be individual expression atoms (e.g.,
623 * "(", "foo=bar", etc.).
624 */
625 static struct expr *
626 exprcomp(const struct mansearch *search, int argc, char *argv[])
627 {
628 uint64_t mask;
629 int i, toopen, logic, igncase, toclose;
630 struct expr *first, *prev, *cur, *next;
631
632 first = cur = NULL;
633 logic = igncase = toclose = 0;
634 toopen = NULL != search->sec || NULL != search->arch;
635
636 for (i = 0; i < argc; i++) {
637 if (0 == strcmp("(", argv[i])) {
638 if (igncase)
639 goto fail;
640 toopen++;
641 toclose++;
642 continue;
643 } else if (0 == strcmp(")", argv[i])) {
644 if (toopen || logic || igncase || NULL == cur)
645 goto fail;
646 cur->close++;
647 if (0 > --toclose)
648 goto fail;
649 continue;
650 } else if (0 == strcmp("-a", argv[i])) {
651 if (toopen || logic || igncase || NULL == cur)
652 goto fail;
653 logic = 1;
654 continue;
655 } else if (0 == strcmp("-o", argv[i])) {
656 if (toopen || logic || igncase || NULL == cur)
657 goto fail;
658 logic = 2;
659 continue;
660 } else if (0 == strcmp("-i", argv[i])) {
661 if (igncase)
662 goto fail;
663 igncase = 1;
664 continue;
665 }
666 next = exprterm(search, argv[i], !igncase);
667 if (NULL == next)
668 goto fail;
669 if (NULL == first)
670 first = next;
671 else
672 cur->next = next;
673 prev = cur = next;
674
675 /*
676 * Searching for descriptions must be split out
677 * because they are stored in the mpages table,
678 * not in the keys table.
679 */
680
681 for (mask = TYPE_Nm; mask <= TYPE_Nd; mask <<= 1) {
682 if (mask & cur->bits && ~mask & cur->bits) {
683 next = mandoc_calloc(1,
684 sizeof(struct expr));
685 memcpy(next, cur, sizeof(struct expr));
686 prev->open = 1;
687 cur->bits = mask;
688 cur->next = next;
689 cur = next;
690 cur->bits &= ~mask;
691 }
692 }
693 prev->and = (1 == logic);
694 prev->open += toopen;
695 if (cur != prev)
696 cur->close = 1;
697
698 toopen = logic = igncase = 0;
699 }
700 if (toopen || logic || igncase || toclose)
701 goto fail;
702
703 if (NULL != search->sec || NULL != search->arch)
704 cur->close++;
705 if (NULL != search->arch)
706 cur = exprspec(cur, TYPE_arch, search->arch, "^(%s|any)$");
707 if (NULL != search->sec)
708 exprspec(cur, TYPE_sec, search->sec, "^%s$");
709
710 return(first);
711
712 fail:
713 if (NULL != first)
714 exprfree(first);
715 return(NULL);
716 }
717
718 static struct expr *
719 exprspec(struct expr *cur, uint64_t key, const char *value,
720 const char *format)
721 {
722 char errbuf[BUFSIZ];
723 char *cp;
724 int irc;
725
726 mandoc_asprintf(&cp, format, value);
727 cur->next = mandoc_calloc(1, sizeof(struct expr));
728 cur = cur->next;
729 cur->and = 1;
730 cur->bits = key;
731 if (0 != (irc = regcomp(&cur->regexp, cp,
732 REG_EXTENDED | REG_NOSUB | REG_ICASE))) {
733 regerror(irc, &cur->regexp, errbuf, sizeof(errbuf));
734 fprintf(stderr, "regcomp: %s\n", errbuf);
735 cur->substr = value;
736 }
737 free(cp);
738 return(cur);
739 }
740
741 static struct expr *
742 exprterm(const struct mansearch *search, char *buf, int cs)
743 {
744 char errbuf[BUFSIZ];
745 struct expr *e;
746 char *key, *val;
747 uint64_t iterbit;
748 int i, irc;
749
750 if ('\0' == *buf)
751 return(NULL);
752
753 e = mandoc_calloc(1, sizeof(struct expr));
754
755 if (search->argmode == ARG_NAME) {
756 e->bits = TYPE_Nm;
757 e->substr = buf;
758 e->equal = 1;
759 return(e);
760 }
761
762 /*
763 * Separate macro keys from search string.
764 * If needed, request regular expression handling
765 * by setting e->substr to NULL.
766 */
767
768 if (search->argmode == ARG_WORD) {
769 e->bits = TYPE_Nm;
770 e->substr = NULL;
771 mandoc_asprintf(&val, "[[:<:]]%s[[:>:]]", buf);
772 cs = 0;
773 } else if ((val = strpbrk(buf, "=~")) == NULL) {
774 e->bits = TYPE_Nm | TYPE_Nd;
775 e->substr = buf;
776 } else {
777 if (val == buf)
778 e->bits = TYPE_Nm | TYPE_Nd;
779 if ('=' == *val)
780 e->substr = val + 1;
781 *val++ = '\0';
782 if (NULL != strstr(buf, "arch"))
783 cs = 0;
784 }
785
786 /* Compile regular expressions. */
787
788 if (NULL == e->substr) {
789 irc = regcomp(&e->regexp, val,
790 REG_EXTENDED | REG_NOSUB | (cs ? 0 : REG_ICASE));
791 if (search->argmode == ARG_WORD)
792 free(val);
793 if (irc) {
794 regerror(irc, &e->regexp, errbuf, sizeof(errbuf));
795 fprintf(stderr, "regcomp: %s\n", errbuf);
796 free(e);
797 return(NULL);
798 }
799 }
800
801 if (e->bits)
802 return(e);
803
804 /*
805 * Parse out all possible fields.
806 * If the field doesn't resolve, bail.
807 */
808
809 while (NULL != (key = strsep(&buf, ","))) {
810 if ('\0' == *key)
811 continue;
812 for (i = 0, iterbit = 1;
813 i < mansearch_keymax;
814 i++, iterbit <<= 1) {
815 if (0 == strcasecmp(key,
816 mansearch_keynames[i])) {
817 e->bits |= iterbit;
818 break;
819 }
820 }
821 if (i == mansearch_keymax) {
822 if (strcasecmp(key, "any")) {
823 free(e);
824 return(NULL);
825 }
826 e->bits |= ~0ULL;
827 }
828 }
829
830 return(e);
831 }
832
833 static void
834 exprfree(struct expr *p)
835 {
836 struct expr *pp;
837
838 while (NULL != p) {
839 pp = p->next;
840 free(p);
841 p = pp;
842 }
843 }
844
845 static void *
846 hash_calloc(size_t nmemb, size_t sz, void *arg)
847 {
848
849 return(mandoc_calloc(nmemb, sz));
850 }
851
852 static void *
853 hash_alloc(size_t sz, void *arg)
854 {
855
856 return(mandoc_malloc(sz));
857 }
858
859 static void
860 hash_free(void *p, void *arg)
861 {
862
863 free(p);
864 }