version 1.8, 2013/10/20 00:03:05 |
version 1.47, 2014/09/01 22:45:53 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2012 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2012 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2013 Ingo Schwarze <schwarze@openbsd.org> |
* Copyright (c) 2013, 2014 Ingo Schwarze <schwarze@openbsd.org> |
* |
* |
* Permission to use, copy, modify, and distribute this software for any |
* Permission to use, copy, modify, and distribute this software for any |
* purpose with or without fee is hereby granted, provided that the above |
* purpose with or without fee is hereby granted, provided that the above |
|
|
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
*/ |
*/ |
#ifdef HAVE_CONFIG_H |
|
#include "config.h" |
#include "config.h" |
#endif |
|
|
|
|
#include <sys/mman.h> |
|
#include <sys/types.h> |
|
|
#include <assert.h> |
#include <assert.h> |
#include <fcntl.h> |
#include <fcntl.h> |
#include <getopt.h> |
#include <getopt.h> |
|
|
#include <string.h> |
#include <string.h> |
#include <unistd.h> |
#include <unistd.h> |
|
|
#ifdef HAVE_OHASH |
#if HAVE_OHASH |
#include <ohash.h> |
#include <ohash.h> |
#else |
#else |
#include "compat_ohash.h" |
#include "compat_ohash.h" |
#endif |
#endif |
#include <sqlite3.h> |
#include <sqlite3.h> |
|
#ifndef SQLITE_DETERMINISTIC |
|
#define SQLITE_DETERMINISTIC 0 |
|
#endif |
|
|
#include "mandoc.h" |
#include "mandoc.h" |
|
#include "mandoc_aux.h" |
#include "manpath.h" |
#include "manpath.h" |
#include "mansearch.h" |
#include "mansearch.h" |
|
|
|
extern int mansearch_keymax; |
|
extern const char *const mansearch_keynames[]; |
|
|
#define SQL_BIND_TEXT(_db, _s, _i, _v) \ |
#define SQL_BIND_TEXT(_db, _s, _i, _v) \ |
do { if (SQLITE_OK != sqlite3_bind_text \ |
do { if (SQLITE_OK != sqlite3_bind_text \ |
((_s), (_i)++, (_v), -1, SQLITE_STATIC)) \ |
((_s), (_i)++, (_v), -1, SQLITE_STATIC)) \ |
|
|
} while (0) |
} while (0) |
|
|
struct expr { |
struct expr { |
uint64_t bits; /* type-mask */ |
|
const char *substr; /* to search for, if applicable */ |
|
regex_t regexp; /* compiled regexp, if applicable */ |
regex_t regexp; /* compiled regexp, if applicable */ |
|
const char *substr; /* to search for, if applicable */ |
struct expr *next; /* next in sequence */ |
struct expr *next; /* next in sequence */ |
|
uint64_t bits; /* type-mask */ |
|
int equal; /* equality, not subsring match */ |
|
int open; /* opening parentheses before */ |
|
int and; /* logical AND before */ |
|
int close; /* closing parentheses after */ |
}; |
}; |
|
|
struct match { |
struct match { |
uint64_t id; /* identifier in database */ |
uint64_t pageid; /* identifier in database */ |
char *file; /* relative filepath of manpage */ |
char *desc; /* manual page description */ |
char *desc; /* description of manpage */ |
|
int form; /* 0 == catpage */ |
int form; /* 0 == catpage */ |
}; |
}; |
|
|
struct type { |
static void buildnames(struct manpage *, sqlite3 *, |
uint64_t bits; |
sqlite3_stmt *, uint64_t, |
const char *name; |
const char *, int form); |
}; |
static char *buildoutput(sqlite3 *, sqlite3_stmt *, |
|
uint64_t, uint64_t); |
static const struct type types[] = { |
|
{ TYPE_An, "An" }, |
|
{ TYPE_Ar, "Ar" }, |
|
{ TYPE_At, "At" }, |
|
{ TYPE_Bsx, "Bsx" }, |
|
{ TYPE_Bx, "Bx" }, |
|
{ TYPE_Cd, "Cd" }, |
|
{ TYPE_Cm, "Cm" }, |
|
{ TYPE_Dv, "Dv" }, |
|
{ TYPE_Dx, "Dx" }, |
|
{ TYPE_Em, "Em" }, |
|
{ TYPE_Er, "Er" }, |
|
{ TYPE_Ev, "Ev" }, |
|
{ TYPE_Fa, "Fa" }, |
|
{ TYPE_Fl, "Fl" }, |
|
{ TYPE_Fn, "Fn" }, |
|
{ TYPE_Fn, "Fo" }, |
|
{ TYPE_Ft, "Ft" }, |
|
{ TYPE_Fx, "Fx" }, |
|
{ TYPE_Ic, "Ic" }, |
|
{ TYPE_In, "In" }, |
|
{ TYPE_Lb, "Lb" }, |
|
{ TYPE_Li, "Li" }, |
|
{ TYPE_Lk, "Lk" }, |
|
{ TYPE_Ms, "Ms" }, |
|
{ TYPE_Mt, "Mt" }, |
|
{ TYPE_Nd, "Nd" }, |
|
{ TYPE_Nm, "Nm" }, |
|
{ TYPE_Nx, "Nx" }, |
|
{ TYPE_Ox, "Ox" }, |
|
{ TYPE_Pa, "Pa" }, |
|
{ TYPE_Rs, "Rs" }, |
|
{ TYPE_Sh, "Sh" }, |
|
{ TYPE_Ss, "Ss" }, |
|
{ TYPE_St, "St" }, |
|
{ TYPE_Sy, "Sy" }, |
|
{ TYPE_Tn, "Tn" }, |
|
{ TYPE_Va, "Va" }, |
|
{ TYPE_Va, "Vt" }, |
|
{ TYPE_Xr, "Xr" }, |
|
{ ~0ULL, "any" }, |
|
{ 0ULL, NULL } |
|
}; |
|
|
|
static void *hash_alloc(size_t, void *); |
static void *hash_alloc(size_t, void *); |
static void hash_free(void *, size_t, void *); |
static void hash_free(void *, void *); |
static void *hash_halloc(size_t, void *); |
static void *hash_calloc(size_t, size_t, void *); |
static struct expr *exprcomp(const struct mansearch *, |
static struct expr *exprcomp(const struct mansearch *, |
int, char *[]); |
int, char *[]); |
static void exprfree(struct expr *); |
static void exprfree(struct expr *); |
|
static struct expr *exprspec(struct expr *, uint64_t, |
|
const char *, const char *); |
static struct expr *exprterm(const struct mansearch *, char *, int); |
static struct expr *exprterm(const struct mansearch *, char *, int); |
|
static int manpage_compare(const void *, const void *); |
|
static void sql_append(char **sql, size_t *sz, |
|
const char *newstr, int count); |
static void sql_match(sqlite3_context *context, |
static void sql_match(sqlite3_context *context, |
int argc, sqlite3_value **argv); |
int argc, sqlite3_value **argv); |
static void sql_regexp(sqlite3_context *context, |
static void sql_regexp(sqlite3_context *context, |
int argc, sqlite3_value **argv); |
int argc, sqlite3_value **argv); |
static char *sql_statement(const struct expr *, |
static char *sql_statement(const struct expr *); |
const char *, const char *); |
|
|
|
|
|
int |
int |
|
mansearch_setup(int start) |
|
{ |
|
static void *pagecache; |
|
int c; |
|
|
|
#define PC_PAGESIZE 1280 |
|
#define PC_NUMPAGES 256 |
|
|
|
if (start) { |
|
if (NULL != pagecache) { |
|
fprintf(stderr, "pagecache already enabled\n"); |
|
return((int)MANDOCLEVEL_BADARG); |
|
} |
|
|
|
pagecache = mmap(NULL, PC_PAGESIZE * PC_NUMPAGES, |
|
PROT_READ | PROT_WRITE, |
|
MAP_SHARED | MAP_ANON, -1, 0); |
|
|
|
if (MAP_FAILED == pagecache) { |
|
perror("mmap"); |
|
pagecache = NULL; |
|
return((int)MANDOCLEVEL_SYSERR); |
|
} |
|
|
|
c = sqlite3_config(SQLITE_CONFIG_PAGECACHE, |
|
pagecache, PC_PAGESIZE, PC_NUMPAGES); |
|
|
|
if (SQLITE_OK == c) |
|
return((int)MANDOCLEVEL_OK); |
|
|
|
fprintf(stderr, "pagecache: %s\n", sqlite3_errstr(c)); |
|
|
|
} else if (NULL == pagecache) { |
|
fprintf(stderr, "pagecache missing\n"); |
|
return((int)MANDOCLEVEL_BADARG); |
|
} |
|
|
|
if (-1 == munmap(pagecache, PC_PAGESIZE * PC_NUMPAGES)) { |
|
perror("munmap"); |
|
pagecache = NULL; |
|
return((int)MANDOCLEVEL_SYSERR); |
|
} |
|
|
|
pagecache = NULL; |
|
return((int)MANDOCLEVEL_OK); |
|
} |
|
|
|
int |
mansearch(const struct mansearch *search, |
mansearch(const struct mansearch *search, |
const struct manpaths *paths, |
const struct manpaths *paths, |
int argc, char *argv[], |
int argc, char *argv[], |
struct manpage **res, size_t *sz) |
struct manpage **res, size_t *sz) |
{ |
{ |
int fd, rc, c; |
int fd, rc, c, indexbit; |
int64_t id; |
int64_t pageid; |
|
uint64_t outbit, iterbit; |
char buf[PATH_MAX]; |
char buf[PATH_MAX]; |
char *sql; |
char *sql; |
|
struct manpage *mpage; |
struct expr *e, *ep; |
struct expr *e, *ep; |
sqlite3 *db; |
sqlite3 *db; |
sqlite3_stmt *s; |
sqlite3_stmt *s, *s2; |
struct match *mp; |
struct match *mp; |
struct ohash_info info; |
struct ohash_info info; |
struct ohash htab; |
struct ohash htab; |
unsigned int idx; |
unsigned int idx; |
size_t i, j, cur, maxres; |
size_t i, j, cur, maxres; |
|
|
memset(&info, 0, sizeof(struct ohash_info)); |
info.calloc = hash_calloc; |
|
|
info.halloc = hash_halloc; |
|
info.alloc = hash_alloc; |
info.alloc = hash_alloc; |
info.hfree = hash_free; |
info.free = hash_free; |
info.key_offset = offsetof(struct match, id); |
info.key_offset = offsetof(struct match, pageid); |
|
|
*sz = cur = maxres = 0; |
*sz = cur = maxres = 0; |
sql = NULL; |
sql = NULL; |
Line 173 mansearch(const struct mansearch *search, |
|
Line 193 mansearch(const struct mansearch *search, |
|
if (NULL == (e = exprcomp(search, argc, argv))) |
if (NULL == (e = exprcomp(search, argc, argv))) |
goto out; |
goto out; |
|
|
|
outbit = 0; |
|
if (NULL != search->outkey) { |
|
for (indexbit = 0, iterbit = 1; |
|
indexbit < mansearch_keymax; |
|
indexbit++, iterbit <<= 1) { |
|
if (0 == strcasecmp(search->outkey, |
|
mansearch_keynames[indexbit])) { |
|
outbit = iterbit; |
|
break; |
|
} |
|
} |
|
} |
|
|
/* |
/* |
* Save a descriptor to the current working directory. |
* Save a descriptor to the current working directory. |
* Since pathnames in the "paths" variable might be relative, |
* Since pathnames in the "paths" variable might be relative, |
Line 181 mansearch(const struct mansearch *search, |
|
Line 214 mansearch(const struct mansearch *search, |
|
*/ |
*/ |
|
|
if (NULL == getcwd(buf, PATH_MAX)) { |
if (NULL == getcwd(buf, PATH_MAX)) { |
perror(NULL); |
perror("getcwd"); |
goto out; |
goto out; |
} else if (-1 == (fd = open(buf, O_RDONLY, 0))) { |
} else if (-1 == (fd = open(buf, O_RDONLY, 0))) { |
perror(buf); |
perror(buf); |
goto out; |
goto out; |
} |
} |
|
|
sql = sql_statement(e, search->arch, search->sec); |
sql = sql_statement(e); |
|
|
/* |
/* |
* Loop over the directories (containing databases) for us to |
* Loop over the directories (containing databases) for us to |
Line 206 mansearch(const struct mansearch *search, |
|
Line 239 mansearch(const struct mansearch *search, |
|
} else if (-1 == chdir(paths->paths[i])) { |
} else if (-1 == chdir(paths->paths[i])) { |
perror(paths->paths[i]); |
perror(paths->paths[i]); |
continue; |
continue; |
} |
} |
|
|
c = sqlite3_open_v2 |
c = sqlite3_open_v2(MANDOC_DB, &db, |
(MANDOC_DB, &db, |
SQLITE_OPEN_READONLY, NULL); |
SQLITE_OPEN_READONLY, NULL); |
|
|
|
if (SQLITE_OK != c) { |
if (SQLITE_OK != c) { |
perror(MANDOC_DB); |
perror(MANDOC_DB); |
Line 224 mansearch(const struct mansearch *search, |
|
Line 256 mansearch(const struct mansearch *search, |
|
*/ |
*/ |
|
|
c = sqlite3_create_function(db, "match", 2, |
c = sqlite3_create_function(db, "match", 2, |
SQLITE_ANY, NULL, sql_match, NULL, NULL); |
SQLITE_UTF8 | SQLITE_DETERMINISTIC, |
|
NULL, sql_match, NULL, NULL); |
assert(SQLITE_OK == c); |
assert(SQLITE_OK == c); |
c = sqlite3_create_function(db, "regexp", 2, |
c = sqlite3_create_function(db, "regexp", 2, |
SQLITE_ANY, NULL, sql_regexp, NULL, NULL); |
SQLITE_UTF8 | SQLITE_DETERMINISTIC, |
|
NULL, sql_regexp, NULL, NULL); |
assert(SQLITE_OK == c); |
assert(SQLITE_OK == c); |
|
|
j = 1; |
j = 1; |
Line 235 mansearch(const struct mansearch *search, |
|
Line 269 mansearch(const struct mansearch *search, |
|
if (SQLITE_OK != c) |
if (SQLITE_OK != c) |
fprintf(stderr, "%s\n", sqlite3_errmsg(db)); |
fprintf(stderr, "%s\n", sqlite3_errmsg(db)); |
|
|
if (NULL != search->arch) |
|
SQL_BIND_TEXT(db, s, j, search->arch); |
|
if (NULL != search->sec) |
|
SQL_BIND_TEXT(db, s, j, search->sec); |
|
|
|
for (ep = e; NULL != ep; ep = ep->next) { |
for (ep = e; NULL != ep; ep = ep->next) { |
if (NULL == ep->substr) { |
if (NULL == ep->substr) { |
SQL_BIND_BLOB(db, s, j, ep->regexp); |
SQL_BIND_BLOB(db, s, j, ep->regexp); |
} else |
} else |
SQL_BIND_TEXT(db, s, j, ep->substr); |
SQL_BIND_TEXT(db, s, j, ep->substr); |
SQL_BIND_INT64(db, s, j, ep->bits); |
if (0 == ((TYPE_Nd | TYPE_Nm) & ep->bits)) |
|
SQL_BIND_INT64(db, s, j, ep->bits); |
} |
} |
|
|
memset(&htab, 0, sizeof(struct ohash)); |
memset(&htab, 0, sizeof(struct ohash)); |
Line 260 mansearch(const struct mansearch *search, |
|
Line 290 mansearch(const struct mansearch *search, |
|
* distribution of buckets in the table. |
* distribution of buckets in the table. |
*/ |
*/ |
while (SQLITE_ROW == (c = sqlite3_step(s))) { |
while (SQLITE_ROW == (c = sqlite3_step(s))) { |
id = sqlite3_column_int64(s, 0); |
pageid = sqlite3_column_int64(s, 2); |
idx = ohash_lookup_memory |
idx = ohash_lookup_memory(&htab, |
(&htab, (char *)&id, |
(char *)&pageid, sizeof(uint64_t), |
sizeof(uint64_t), (uint32_t)id); |
(uint32_t)pageid); |
|
|
if (NULL != ohash_find(&htab, idx)) |
if (NULL != ohash_find(&htab, idx)) |
continue; |
continue; |
|
|
mp = mandoc_calloc(1, sizeof(struct match)); |
mp = mandoc_calloc(1, sizeof(struct match)); |
mp->id = id; |
mp->pageid = pageid; |
mp->file = mandoc_strdup |
mp->form = sqlite3_column_int(s, 1); |
((char *)sqlite3_column_text(s, 3)); |
if (TYPE_Nd == outbit) |
mp->desc = mandoc_strdup |
mp->desc = mandoc_strdup((const char *) |
((char *)sqlite3_column_text(s, 4)); |
sqlite3_column_text(s, 0)); |
mp->form = sqlite3_column_int(s, 5); |
|
ohash_insert(&htab, idx, mp); |
ohash_insert(&htab, idx, mp); |
} |
} |
|
|
Line 282 mansearch(const struct mansearch *search, |
|
Line 311 mansearch(const struct mansearch *search, |
|
fprintf(stderr, "%s\n", sqlite3_errmsg(db)); |
fprintf(stderr, "%s\n", sqlite3_errmsg(db)); |
|
|
sqlite3_finalize(s); |
sqlite3_finalize(s); |
sqlite3_close(db); |
|
|
|
|
c = sqlite3_prepare_v2(db, |
|
"SELECT sec, arch, name, pageid FROM mlinks " |
|
"WHERE pageid=? ORDER BY sec, arch, name", |
|
-1, &s, NULL); |
|
if (SQLITE_OK != c) |
|
fprintf(stderr, "%s\n", sqlite3_errmsg(db)); |
|
|
|
c = sqlite3_prepare_v2(db, |
|
"SELECT bits, key, pageid FROM keys " |
|
"WHERE pageid=? AND bits & ?", |
|
-1, &s2, NULL); |
|
if (SQLITE_OK != c) |
|
fprintf(stderr, "%s\n", sqlite3_errmsg(db)); |
|
|
for (mp = ohash_first(&htab, &idx); |
for (mp = ohash_first(&htab, &idx); |
NULL != mp; |
NULL != mp; |
mp = ohash_next(&htab, &idx)) { |
mp = ohash_next(&htab, &idx)) { |
if (cur + 1 > maxres) { |
if (cur + 1 > maxres) { |
maxres += 1024; |
maxres += 1024; |
*res = mandoc_realloc |
*res = mandoc_reallocarray(*res, |
(*res, maxres * sizeof(struct manpage)); |
maxres, sizeof(struct manpage)); |
} |
} |
strlcpy((*res)[cur].file, |
mpage = *res + cur; |
paths->paths[i], PATH_MAX); |
mpage->ipath = i; |
strlcat((*res)[cur].file, "/", PATH_MAX); |
mpage->sec = 10; |
strlcat((*res)[cur].file, mp->file, PATH_MAX); |
mpage->form = mp->form; |
(*res)[cur].desc = mp->desc; |
buildnames(mpage, db, s, mp->pageid, |
(*res)[cur].form = mp->form; |
paths->paths[i], mp->form); |
free(mp->file); |
mpage->output = TYPE_Nd & outbit ? |
|
mp->desc : outbit ? |
|
buildoutput(db, s2, mp->pageid, outbit) : NULL; |
|
|
free(mp); |
free(mp); |
cur++; |
cur++; |
} |
} |
|
|
|
sqlite3_finalize(s); |
|
sqlite3_finalize(s2); |
|
sqlite3_close(db); |
ohash_delete(&htab); |
ohash_delete(&htab); |
} |
} |
|
qsort(*res, cur, sizeof(struct manpage), manpage_compare); |
rc = 1; |
rc = 1; |
out: |
out: |
exprfree(e); |
if (-1 != fd) { |
if (-1 != fd) |
if (-1 == fchdir(fd)) |
|
perror(buf); |
close(fd); |
close(fd); |
|
} |
|
exprfree(e); |
free(sql); |
free(sql); |
*sz = cur; |
*sz = cur; |
return(rc); |
return(rc); |
} |
} |
|
|
|
void |
|
mansearch_free(struct manpage *res, size_t sz) |
|
{ |
|
size_t i; |
|
|
|
for (i = 0; i < sz; i++) { |
|
free(res[i].file); |
|
free(res[i].names); |
|
free(res[i].output); |
|
} |
|
free(res); |
|
} |
|
|
|
static int |
|
manpage_compare(const void *vp1, const void *vp2) |
|
{ |
|
const struct manpage *mp1, *mp2; |
|
int diff; |
|
|
|
mp1 = vp1; |
|
mp2 = vp2; |
|
diff = mp1->sec - mp2->sec; |
|
return(diff ? diff : strcasecmp(mp1->names, mp2->names)); |
|
} |
|
|
|
static void |
|
buildnames(struct manpage *mpage, sqlite3 *db, sqlite3_stmt *s, |
|
uint64_t pageid, const char *path, int form) |
|
{ |
|
char *newnames, *prevsec, *prevarch; |
|
const char *oldnames, *sep1, *name, *sec, *sep2, *arch, *fsec; |
|
size_t i; |
|
int c; |
|
|
|
mpage->file = NULL; |
|
mpage->names = NULL; |
|
prevsec = prevarch = NULL; |
|
i = 1; |
|
SQL_BIND_INT64(db, s, i, pageid); |
|
while (SQLITE_ROW == (c = sqlite3_step(s))) { |
|
|
|
/* Decide whether we already have some names. */ |
|
|
|
if (NULL == mpage->names) { |
|
oldnames = ""; |
|
sep1 = ""; |
|
} else { |
|
oldnames = mpage->names; |
|
sep1 = ", "; |
|
} |
|
|
|
/* Fetch the next name. */ |
|
|
|
sec = (const char *)sqlite3_column_text(s, 0); |
|
arch = (const char *)sqlite3_column_text(s, 1); |
|
name = (const char *)sqlite3_column_text(s, 2); |
|
|
|
/* Remember the first section found. */ |
|
|
|
if (9 < mpage->sec && '1' <= *sec && '9' >= *sec) |
|
mpage->sec = (*sec - '1') + 1; |
|
|
|
/* If the section changed, append the old one. */ |
|
|
|
if (NULL != prevsec && |
|
(strcmp(sec, prevsec) || |
|
strcmp(arch, prevarch))) { |
|
sep2 = '\0' == *prevarch ? "" : "/"; |
|
mandoc_asprintf(&newnames, "%s(%s%s%s)", |
|
oldnames, prevsec, sep2, prevarch); |
|
free(mpage->names); |
|
oldnames = mpage->names = newnames; |
|
free(prevsec); |
|
free(prevarch); |
|
prevsec = prevarch = NULL; |
|
} |
|
|
|
/* Save the new section, to append it later. */ |
|
|
|
if (NULL == prevsec) { |
|
prevsec = mandoc_strdup(sec); |
|
prevarch = mandoc_strdup(arch); |
|
} |
|
|
|
/* Append the new name. */ |
|
|
|
mandoc_asprintf(&newnames, "%s%s%s", |
|
oldnames, sep1, name); |
|
free(mpage->names); |
|
mpage->names = newnames; |
|
|
|
/* Also save the first file name encountered. */ |
|
|
|
if (NULL != mpage->file) |
|
continue; |
|
|
|
if (form) { |
|
sep1 = "man"; |
|
fsec = sec; |
|
} else { |
|
sep1 = "cat"; |
|
fsec = "0"; |
|
} |
|
sep2 = '\0' == *arch ? "" : "/"; |
|
mandoc_asprintf(&mpage->file, "%s/%s%s%s%s/%s.%s", |
|
path, sep1, sec, sep2, arch, name, fsec); |
|
} |
|
if (SQLITE_DONE != c) |
|
fprintf(stderr, "%s\n", sqlite3_errmsg(db)); |
|
sqlite3_reset(s); |
|
|
|
/* Append one final section to the names. */ |
|
|
|
if (NULL != prevsec) { |
|
sep2 = '\0' == *prevarch ? "" : "/"; |
|
mandoc_asprintf(&newnames, "%s(%s%s%s)", |
|
mpage->names, prevsec, sep2, prevarch); |
|
free(mpage->names); |
|
mpage->names = newnames; |
|
free(prevsec); |
|
free(prevarch); |
|
} |
|
} |
|
|
|
static char * |
|
buildoutput(sqlite3 *db, sqlite3_stmt *s, uint64_t pageid, uint64_t outbit) |
|
{ |
|
char *output, *newoutput; |
|
const char *oldoutput, *sep1, *data; |
|
size_t i; |
|
int c; |
|
|
|
output = NULL; |
|
i = 1; |
|
SQL_BIND_INT64(db, s, i, pageid); |
|
SQL_BIND_INT64(db, s, i, outbit); |
|
while (SQLITE_ROW == (c = sqlite3_step(s))) { |
|
if (NULL == output) { |
|
oldoutput = ""; |
|
sep1 = ""; |
|
} else { |
|
oldoutput = output; |
|
sep1 = " # "; |
|
} |
|
data = (const char *)sqlite3_column_text(s, 1); |
|
mandoc_asprintf(&newoutput, "%s%s%s", |
|
oldoutput, sep1, data); |
|
free(output); |
|
output = newoutput; |
|
} |
|
if (SQLITE_DONE != c) |
|
fprintf(stderr, "%s\n", sqlite3_errmsg(db)); |
|
sqlite3_reset(s); |
|
return(output); |
|
} |
|
|
/* |
/* |
* Implement substring match as an application-defined SQL function. |
* Implement substring match as an application-defined SQL function. |
* Using the SQL LIKE or GLOB operators instead would be a bad idea |
* Using the SQL LIKE or GLOB operators instead would be a bad idea |
Line 345 sql_regexp(sqlite3_context *context, int argc, sqlite3 |
|
Line 554 sql_regexp(sqlite3_context *context, int argc, sqlite3 |
|
0, NULL, 0)); |
0, NULL, 0)); |
} |
} |
|
|
|
static void |
|
sql_append(char **sql, size_t *sz, const char *newstr, int count) |
|
{ |
|
size_t newsz; |
|
|
|
newsz = 1 < count ? (size_t)count : strlen(newstr); |
|
*sql = mandoc_realloc(*sql, *sz + newsz + 1); |
|
if (1 < count) |
|
memset(*sql + *sz, *newstr, (size_t)count); |
|
else |
|
memcpy(*sql + *sz, newstr, newsz); |
|
*sz += newsz; |
|
(*sql)[*sz] = '\0'; |
|
} |
|
|
/* |
/* |
* Prepare the search SQL statement. |
* Prepare the search SQL statement. |
* We search for any of the words specified in our match expression. |
|
* We filter the per-doc AND expressions when collecting results. |
|
*/ |
*/ |
static char * |
static char * |
sql_statement(const struct expr *e, const char *arch, const char *sec) |
sql_statement(const struct expr *e) |
{ |
{ |
char *sql; |
char *sql; |
const char *substr = "(key MATCH ? AND bits & ?)"; |
|
const char *regexp = "(key REGEXP ? AND bits & ?)"; |
|
const char *andarch = "arch = ? AND "; |
|
const char *andsec = "sec = ? AND "; |
|
size_t substrsz; |
|
size_t regexpsz; |
|
size_t sz; |
size_t sz; |
|
int needop; |
|
|
sql = mandoc_strdup |
sql = mandoc_strdup( |
("SELECT docid,bits,key,file,desc,form,sec,arch " |
"SELECT desc, form, pageid FROM mpages WHERE "); |
"FROM keys " |
|
"INNER JOIN docs ON docs.id=keys.docid " |
|
"WHERE "); |
|
sz = strlen(sql); |
sz = strlen(sql); |
substrsz = strlen(substr); |
|
regexpsz = strlen(regexp); |
|
|
|
if (NULL != arch) { |
for (needop = 0; NULL != e; e = e->next) { |
sz += strlen(andarch) + 1; |
if (e->and) |
sql = mandoc_realloc(sql, sz); |
sql_append(&sql, &sz, " AND ", 1); |
strlcat(sql, andarch, sz); |
else if (needop) |
|
sql_append(&sql, &sz, " OR ", 1); |
|
if (e->open) |
|
sql_append(&sql, &sz, "(", e->open); |
|
sql_append(&sql, &sz, |
|
TYPE_Nd & e->bits |
|
? (NULL == e->substr |
|
? "desc REGEXP ?" |
|
: "desc MATCH ?") |
|
: TYPE_Nm == e->bits |
|
? (NULL == e->substr |
|
? "pageid IN (SELECT pageid FROM names " |
|
"WHERE name REGEXP ?)" |
|
: e->equal |
|
? "pageid IN (SELECT pageid FROM names " |
|
"WHERE name = ?)" |
|
: "pageid IN (SELECT pageid FROM names " |
|
"WHERE name MATCH ?)") |
|
: (NULL == e->substr |
|
? "pageid IN (SELECT pageid FROM keys " |
|
"WHERE key REGEXP ? AND bits & ?)" |
|
: "pageid IN (SELECT pageid FROM keys " |
|
"WHERE key MATCH ? AND bits & ?)"), 1); |
|
if (e->close) |
|
sql_append(&sql, &sz, ")", e->close); |
|
needop = 1; |
} |
} |
|
|
if (NULL != sec) { |
|
sz += strlen(andsec) + 1; |
|
sql = mandoc_realloc(sql, sz); |
|
strlcat(sql, andsec, sz); |
|
} |
|
|
|
sz += 2; |
|
sql = mandoc_realloc(sql, sz); |
|
strlcat(sql, "(", sz); |
|
|
|
for ( ; NULL != e; e = e->next) { |
|
sz += (NULL == e->substr ? regexpsz : substrsz) + |
|
(NULL == e->next ? 3 : 5); |
|
sql = mandoc_realloc(sql, sz); |
|
strlcat(sql, NULL == e->substr ? regexp : substr, sz); |
|
strlcat(sql, NULL == e->next ? ");" : " OR ", sz); |
|
} |
|
|
|
return(sql); |
return(sql); |
} |
} |
|
|
Line 406 sql_statement(const struct expr *e, const char *arch, |
|
Line 625 sql_statement(const struct expr *e, const char *arch, |
|
static struct expr * |
static struct expr * |
exprcomp(const struct mansearch *search, int argc, char *argv[]) |
exprcomp(const struct mansearch *search, int argc, char *argv[]) |
{ |
{ |
int i, cs; |
uint64_t mask; |
struct expr *first, *next, *cur; |
int i, toopen, logic, igncase, toclose; |
|
struct expr *first, *prev, *cur, *next; |
|
|
first = cur = NULL; |
first = cur = NULL; |
|
logic = igncase = toclose = 0; |
|
toopen = NULL != search->sec || NULL != search->arch; |
|
|
for (i = 0; i < argc; i++) { |
for (i = 0; i < argc; i++) { |
if (0 == strcmp("-i", argv[i])) { |
if (0 == strcmp("(", argv[i])) { |
if (++i >= argc) |
if (igncase) |
return(NULL); |
goto fail; |
cs = 0; |
toopen++; |
} else |
toclose++; |
cs = 1; |
continue; |
next = exprterm(search, argv[i], cs); |
} else if (0 == strcmp(")", argv[i])) { |
if (NULL == next) { |
if (toopen || logic || igncase || NULL == cur) |
exprfree(first); |
goto fail; |
return(NULL); |
cur->close++; |
|
if (0 > --toclose) |
|
goto fail; |
|
continue; |
|
} else if (0 == strcmp("-a", argv[i])) { |
|
if (toopen || logic || igncase || NULL == cur) |
|
goto fail; |
|
logic = 1; |
|
continue; |
|
} else if (0 == strcmp("-o", argv[i])) { |
|
if (toopen || logic || igncase || NULL == cur) |
|
goto fail; |
|
logic = 2; |
|
continue; |
|
} else if (0 == strcmp("-i", argv[i])) { |
|
if (igncase) |
|
goto fail; |
|
igncase = 1; |
|
continue; |
} |
} |
if (NULL != first) { |
next = exprterm(search, argv[i], !igncase); |
|
if (NULL == next) |
|
goto fail; |
|
if (NULL == first) |
|
first = next; |
|
else |
cur->next = next; |
cur->next = next; |
cur = next; |
prev = cur = next; |
} else |
|
cur = first = next; |
/* |
|
* Searching for descriptions must be split out |
|
* because they are stored in the mpages table, |
|
* not in the keys table. |
|
*/ |
|
|
|
for (mask = TYPE_Nm; mask <= TYPE_Nd; mask <<= 1) { |
|
if (mask & cur->bits && ~mask & cur->bits) { |
|
next = mandoc_calloc(1, |
|
sizeof(struct expr)); |
|
memcpy(next, cur, sizeof(struct expr)); |
|
prev->open = 1; |
|
cur->bits = mask; |
|
cur->next = next; |
|
cur = next; |
|
cur->bits &= ~mask; |
|
} |
|
} |
|
prev->and = (1 == logic); |
|
prev->open += toopen; |
|
if (cur != prev) |
|
cur->close = 1; |
|
|
|
toopen = logic = igncase = 0; |
} |
} |
|
if (toopen || logic || igncase || toclose) |
|
goto fail; |
|
|
|
if (NULL != search->sec || NULL != search->arch) |
|
cur->close++; |
|
if (NULL != search->arch) |
|
cur = exprspec(cur, TYPE_arch, search->arch, "^(%s|any)$"); |
|
if (NULL != search->sec) |
|
exprspec(cur, TYPE_sec, search->sec, "^%s$"); |
|
|
return(first); |
return(first); |
|
|
|
fail: |
|
if (NULL != first) |
|
exprfree(first); |
|
return(NULL); |
} |
} |
|
|
static struct expr * |
static struct expr * |
|
exprspec(struct expr *cur, uint64_t key, const char *value, |
|
const char *format) |
|
{ |
|
char errbuf[BUFSIZ]; |
|
char *cp; |
|
int irc; |
|
|
|
mandoc_asprintf(&cp, format, value); |
|
cur->next = mandoc_calloc(1, sizeof(struct expr)); |
|
cur = cur->next; |
|
cur->and = 1; |
|
cur->bits = key; |
|
if (0 != (irc = regcomp(&cur->regexp, cp, |
|
REG_EXTENDED | REG_NOSUB | REG_ICASE))) { |
|
regerror(irc, &cur->regexp, errbuf, sizeof(errbuf)); |
|
fprintf(stderr, "regcomp: %s\n", errbuf); |
|
cur->substr = value; |
|
} |
|
free(cp); |
|
return(cur); |
|
} |
|
|
|
static struct expr * |
exprterm(const struct mansearch *search, char *buf, int cs) |
exprterm(const struct mansearch *search, char *buf, int cs) |
{ |
{ |
|
char errbuf[BUFSIZ]; |
struct expr *e; |
struct expr *e; |
char *key, *v; |
char *key, *val; |
size_t i; |
uint64_t iterbit; |
|
int i, irc; |
|
|
if ('\0' == *buf) |
if ('\0' == *buf) |
return(NULL); |
return(NULL); |
|
|
e = mandoc_calloc(1, sizeof(struct expr)); |
e = mandoc_calloc(1, sizeof(struct expr)); |
|
|
/*"whatis" mode uses an opaque string and default fields. */ |
if (search->argmode == ARG_NAME) { |
|
e->bits = TYPE_Nm; |
if (MANSEARCH_WHATIS & search->flags) { |
|
e->substr = buf; |
e->substr = buf; |
e->bits = search->deftype; |
e->equal = 1; |
return(e); |
return(e); |
} |
} |
|
|
/* |
/* |
* If no =~ is specified, search with equality over names and |
* Separate macro keys from search string. |
* descriptions. |
* If needed, request regular expression handling |
* If =~ begins the phrase, use name and description fields. |
* by setting e->substr to NULL. |
*/ |
*/ |
|
|
if (NULL == (v = strpbrk(buf, "=~"))) { |
if (search->argmode == ARG_WORD) { |
|
e->bits = TYPE_Nm; |
|
e->substr = NULL; |
|
mandoc_asprintf(&val, "[[:<:]]%s[[:>:]]", buf); |
|
cs = 0; |
|
} else if ((val = strpbrk(buf, "=~")) == NULL) { |
|
e->bits = TYPE_Nm | TYPE_Nd; |
e->substr = buf; |
e->substr = buf; |
e->bits = search->deftype; |
} else { |
return(e); |
if (val == buf) |
} else if (v == buf) |
e->bits = TYPE_Nm | TYPE_Nd; |
e->bits = search->deftype; |
if ('=' == *val) |
|
e->substr = val + 1; |
|
*val++ = '\0'; |
|
if (NULL != strstr(buf, "arch")) |
|
cs = 0; |
|
} |
|
|
if ('~' == *v++) { |
/* Compile regular expressions. */ |
if (regcomp(&e->regexp, v, |
|
REG_EXTENDED | REG_NOSUB | (cs ? 0 : REG_ICASE))) { |
if (NULL == e->substr) { |
|
irc = regcomp(&e->regexp, val, |
|
REG_EXTENDED | REG_NOSUB | (cs ? 0 : REG_ICASE)); |
|
if (search->argmode == ARG_WORD) |
|
free(val); |
|
if (irc) { |
|
regerror(irc, &e->regexp, errbuf, sizeof(errbuf)); |
|
fprintf(stderr, "regcomp: %s\n", errbuf); |
free(e); |
free(e); |
return(NULL); |
return(NULL); |
} |
} |
} else |
} |
e->substr = v; |
|
v[-1] = '\0'; |
|
|
|
|
if (e->bits) |
|
return(e); |
|
|
/* |
/* |
* Parse out all possible fields. |
* Parse out all possible fields. |
* If the field doesn't resolve, bail. |
* If the field doesn't resolve, bail. |
Line 484 exprterm(const struct mansearch *search, char *buf, in |
|
Line 809 exprterm(const struct mansearch *search, char *buf, in |
|
while (NULL != (key = strsep(&buf, ","))) { |
while (NULL != (key = strsep(&buf, ","))) { |
if ('\0' == *key) |
if ('\0' == *key) |
continue; |
continue; |
i = 0; |
for (i = 0, iterbit = 1; |
while (types[i].bits && |
i < mansearch_keymax; |
strcasecmp(types[i].name, key)) |
i++, iterbit <<= 1) { |
i++; |
if (0 == strcasecmp(key, |
if (0 == types[i].bits) { |
mansearch_keynames[i])) { |
free(e); |
e->bits |= iterbit; |
return(NULL); |
break; |
|
} |
} |
} |
e->bits |= types[i].bits; |
if (i == mansearch_keymax) { |
|
if (strcasecmp(key, "any")) { |
|
free(e); |
|
return(NULL); |
|
} |
|
e->bits |= ~0ULL; |
|
} |
} |
} |
|
|
return(e); |
return(e); |
Line 511 exprfree(struct expr *p) |
|
Line 843 exprfree(struct expr *p) |
|
} |
} |
|
|
static void * |
static void * |
hash_halloc(size_t sz, void *arg) |
hash_calloc(size_t nmemb, size_t sz, void *arg) |
{ |
{ |
|
|
return(mandoc_calloc(sz, 1)); |
return(mandoc_calloc(nmemb, sz)); |
} |
} |
|
|
static void * |
static void * |
Line 525 hash_alloc(size_t sz, void *arg) |
|
Line 857 hash_alloc(size_t sz, void *arg) |
|
} |
} |
|
|
static void |
static void |
hash_free(void *p, size_t sz, void *arg) |
hash_free(void *p, void *arg) |
{ |
{ |
|
|
free(p); |
free(p); |