mirror of
https://git.notmuchmail.org/git/notmuch
synced 2024-11-22 19:08:09 +01:00
6273966d0b
This replaces two instances of Xapian::Query::MatchAll with the
equivalent but thread-safe alternative Xapian::Query(std::string()).
Xapian::Query::MatchAll maintains an internal pointer to a refcounted
Xapian::Internal::QueryTerm.
None of this is thread-safe but that wouldn't be an issue if
Xapian::Query::MatchAll wasn't static. Because it's static, the
refcounting goes awry when Notmuch is called from multiple threads.
This is actually documented by Xapian:
4715de3a9f/xapian-core/include/xapian/query.h (L65)
While static, Xapian::Query::MatchNothing is safe because it doesn't
maintain an internal object and as such, doesn't use references.
Two best-effort tests making use of TSan were added to showcase the
issue (I couldn't figure out a way to deterministically reproduce it
without making an unmaintainable mess).
First, when two databases are created in parallel, a query that uses
Xapian::Query::MatchAll is made (lib/query.cc), resulting in the
following backtrace on a segfault:
#0 0x00007ffff76822af in Xapian::Query::get_terms_begin (this=0x7fffe80137f0) at api/query.cc:141
#1 0x00007ffff7f933f5 in _notmuch_query_cache_terms (query=0x7fffe80137c0) at lib/query.cc:176
#2 0x00007ffff7f93784 in _notmuch_query_ensure_parsed_xapian (query=0x7fffe80137c0) at lib/query.cc:225
#3 0x00007ffff7f9381a in _notmuch_query_ensure_parsed (query=0x7fffe80137c0) at lib/query.cc:260
#4 0x00007ffff7f93bfe in _notmuch_query_search_documents (query=0x7fffe80137c0, type=0x7ffff7fa9b1e "mail", out=0x7ffff666da18) at lib/query.cc:361
#5 0x00007ffff7f93ba4 in notmuch_query_search_messages (query=0x7fffe80137c0, out=0x7ffff666da18) at lib/query.cc:349
#6 0x00007ffff7f83d98 in notmuch_database_upgrade (notmuch=0x7fffe8000bd0, progress_notify=0x0, closure=0x0) at lib/database.cc:934
#7 0x00007ffff7fa110f in notmuch_database_create_with_config (database_path=0x7ffff666dcb0 "/tmp/notmuch.MZ2AGr", config_path=0x7ffff7faab3c "", profile=0x0, database=0x0, status_string=0x7ffff666dc90) at lib/open.cc:754
#8 0x00007ffff7fa0d6f in notmuch_database_create_verbose (path=0x7ffff666dcb0 "/tmp/notmuch.MZ2AGr", database=0x0, status_string=0x7ffff666dc90) at lib/open.cc:653
#9 0x00007ffff7fa0ceb in notmuch_database_create (path=0x7ffff666dcb0 "/tmp/notmuch.MZ2AGr", database=0x0) at lib/open.cc:637
...
Second, some queries would make use of Xapian::Query::MatchAll
(lib/regexp-fields.cc), resulting in the following backtrace on a
segfault:
#0 0x00007f629828b690 in Xapian::Internal::QueryBranch::gather_terms (this=0x7f628800def0, void_terms=0x7f629726d5a0) at api/queryinternal.cc:1245
#1 0x00007f629828c260 in Xapian::Internal::QueryScaleWeight::gather_terms (this=0x7f628800df70, void_terms=0x7f629726d5a0) at api/queryinternal.cc:1434
#2 0x00007f629828b69f in Xapian::Internal::QueryBranch::gather_terms (this=0x7f628800dd90, void_terms=0x7f629726d5a0) at api/queryinternal.cc:1245
#3 0x00007f6298282571 in Xapian::Query::get_unique_terms_begin (this=0x7f628800dcd8) at api/query.cc:166
#4 0x00007f629841a59b in Xapian::Weight::Internal::accumulate_stats (this=0x7f628800dca0, subdb=..., rset=...) at weight/weightinternal.cc:86
#5 0x00007f62983c15ba in LocalSubMatch::prepare_match (this=0x7f628800df20, nowait=true, total_stats=...) at matcher/localsubmatch.cc:172
#6 0x00007f62983c8fcc in prepare_sub_matches (leaves=std::vector of length 1, capacity 1 = {...}, stats=...) at matcher/multimatch.cc:237
#7 0x00007f62983c98a3 in MultiMatch::MultiMatch (this=0x7f629726d9a0, db_=..., query_=..., qlen=3, omrset=0x0, collapse_max_=0, collapse_key_=4294967295, percent_cutoff_=0, weight_cutoff_=0, order_=Xapian::Enquire::ASCENDING, sort_key_=0, sort_by_=Xapian::Enquire::Internal::VAL, sort_value_forward_=true, time_limit_=0, stats=..., weight_=0x7f6288008d50, matchspies_=std::vector of length 0, capacity 0, have_sorter=false, have_mdecider=false) at matcher/multimatch.cc:353
#8 0x00007f629826fcba in Xapian::Enquire::Internal::get_mset (this=0x7f628800e0b0, first=0, maxitems=0, check_at_least=0, rset=0x0, mdecider=0x0) at api/omenquire.cc:569
#9 0x00007f629827181c in Xapian::Enquire::get_mset (this=0x7f629726db80, first=0, maxitems=0, check_at_least=0, rset=0x0, mdecider=0x0) at api/omenquire.cc:937
#10 0x00007f6298be529a in _notmuch_query_search_documents (query=0x7f6288009750, type=0x7f6298bfaafe "mail", out=0x7f629726dcc0) at lib/query.cc:447
#11 0x00007f6298be4ae8 in notmuch_query_search_messages (query=0x7f6288009750, out=0x7f629726dcc0) at lib/query.cc:349
...
Printing Xapian::Query::MatchAll->internal.px->_refs in these
circumstances can help quickly identifying this scenario.
This is motivated by some test frameworks (like Rust's Cargo) that
runs unit tests in parallel and would easily encounter this issue,
unless client code gates every call to Notmuch behind a lock.
This is what can be expected from the tests when they fail:
== stderr ==
+==================
+WARNING: ThreadSanitizer: data race (pid=207931)
+ Read of size 1 at 0x7b10000001a0 by thread T2:
+ #0 memcpy <null> (libtsan.so.2+0x62506)
+ #1 void std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_construct<char*>(char*, char*, std::forward_iterator_tag) [clone .isra.0] <null> (libxapian.so.30+0x872b3)
+
+ Previous write of size 8 at 0x7b10000001a0 by thread T1:
+ #0 operator new(unsigned long) <null> (libtsan.so.2+0x8ba83)
+ #1 Xapian::Query::Query(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int, unsigned int) <null> (libxapian.so.30+0x855cd)
...
874 lines
23 KiB
C++
874 lines
23 KiB
C++
/* query.cc - Support for searching a notmuch database
|
|
*
|
|
* Copyright © 2009 Carl Worth
|
|
*
|
|
* This program is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program. If not, see https://www.gnu.org/licenses/ .
|
|
*
|
|
* Author: Carl Worth <cworth@cworth.org>
|
|
*/
|
|
|
|
#include "notmuch-private.h"
|
|
#include "database-private.h"
|
|
#include "xapian-extra.h"
|
|
|
|
#include <glib.h> /* GHashTable, GPtrArray */
|
|
|
|
struct _notmuch_query {
|
|
notmuch_database_t *notmuch;
|
|
const char *query_string;
|
|
notmuch_sort_t sort;
|
|
notmuch_string_list_t *exclude_terms;
|
|
notmuch_exclude_t omit_excluded;
|
|
bool parsed;
|
|
notmuch_query_syntax_t syntax;
|
|
Xapian::Query xapian_query;
|
|
std::set<std::string> terms;
|
|
};
|
|
|
|
typedef struct _notmuch_mset_messages {
|
|
notmuch_messages_t base;
|
|
notmuch_database_t *notmuch;
|
|
Xapian::MSetIterator iterator;
|
|
Xapian::MSetIterator iterator_end;
|
|
} notmuch_mset_messages_t;
|
|
|
|
struct _notmuch_doc_id_set {
|
|
unsigned char *bitmap;
|
|
unsigned int bound;
|
|
};
|
|
|
|
#define DOCIDSET_WORD(bit) ((bit) / CHAR_BIT)
|
|
#define DOCIDSET_BIT(bit) ((bit) % CHAR_BIT)
|
|
|
|
struct _notmuch_threads {
|
|
notmuch_query_t *query;
|
|
|
|
/* The ordered list of doc ids matched by the query. */
|
|
GArray *doc_ids;
|
|
/* Our iterator's current position in doc_ids. */
|
|
unsigned int doc_id_pos;
|
|
/* The set of matched docid's that have not been assigned to a
|
|
* thread. Initially, this contains every docid in doc_ids. */
|
|
notmuch_doc_id_set_t match_set;
|
|
};
|
|
|
|
/* We need this in the message functions so forward declare. */
|
|
static bool
|
|
_notmuch_doc_id_set_init (void *ctx,
|
|
notmuch_doc_id_set_t *doc_ids,
|
|
GArray *arr);
|
|
|
|
static bool
|
|
_debug_query (void)
|
|
{
|
|
char *env = getenv ("NOTMUCH_DEBUG_QUERY");
|
|
|
|
return (env && strcmp (env, "") != 0);
|
|
}
|
|
|
|
/* Explicit destructor call for placement new */
|
|
static int
|
|
_notmuch_query_destructor (notmuch_query_t *query)
|
|
{
|
|
query->xapian_query.~Query();
|
|
query->terms.~set<std::string>();
|
|
return 0;
|
|
}
|
|
|
|
static notmuch_query_t *
|
|
_notmuch_query_constructor (notmuch_database_t *notmuch,
|
|
const char *query_string)
|
|
{
|
|
notmuch_query_t *query;
|
|
|
|
if (_debug_query ())
|
|
fprintf (stderr, "Query string is:\n%s\n", query_string);
|
|
|
|
query = talloc (notmuch, notmuch_query_t);
|
|
if (unlikely (query == NULL))
|
|
return NULL;
|
|
|
|
new (&query->xapian_query) Xapian::Query ();
|
|
new (&query->terms) std::set<std::string> ();
|
|
query->parsed = false;
|
|
|
|
talloc_set_destructor (query, _notmuch_query_destructor);
|
|
|
|
query->notmuch = notmuch;
|
|
|
|
if (query_string)
|
|
query->query_string = talloc_strdup (query, query_string);
|
|
else
|
|
query->query_string = NULL;
|
|
|
|
query->sort = NOTMUCH_SORT_NEWEST_FIRST;
|
|
|
|
query->exclude_terms = _notmuch_string_list_create (query);
|
|
|
|
query->omit_excluded = NOTMUCH_EXCLUDE_TRUE;
|
|
|
|
return query;
|
|
}
|
|
|
|
notmuch_query_t *
|
|
notmuch_query_create (notmuch_database_t *notmuch,
|
|
const char *query_string)
|
|
{
|
|
|
|
notmuch_query_t *query;
|
|
notmuch_status_t status;
|
|
|
|
status = notmuch_query_create_with_syntax (notmuch, query_string,
|
|
NOTMUCH_QUERY_SYNTAX_XAPIAN,
|
|
&query);
|
|
if (status)
|
|
return NULL;
|
|
|
|
return query;
|
|
}
|
|
|
|
notmuch_status_t
|
|
notmuch_query_create_with_syntax (notmuch_database_t *notmuch,
|
|
const char *query_string,
|
|
notmuch_query_syntax_t syntax,
|
|
notmuch_query_t **output)
|
|
{
|
|
|
|
notmuch_query_t *query;
|
|
|
|
if (! output)
|
|
return NOTMUCH_STATUS_NULL_POINTER;
|
|
|
|
query = _notmuch_query_constructor (notmuch, query_string);
|
|
if (! query)
|
|
return NOTMUCH_STATUS_OUT_OF_MEMORY;
|
|
|
|
if (syntax == NOTMUCH_QUERY_SYNTAX_SEXP && ! HAVE_SFSEXP) {
|
|
_notmuch_database_log (notmuch, "sexp query parser not available");
|
|
return NOTMUCH_STATUS_ILLEGAL_ARGUMENT;
|
|
}
|
|
|
|
query->syntax = syntax;
|
|
|
|
*output = query;
|
|
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
}
|
|
|
|
static void
|
|
_notmuch_query_cache_terms (notmuch_query_t *query)
|
|
{
|
|
/* Xapian doesn't support skip_to on terms from a query since
|
|
* they are unordered, so cache a copy of all terms in
|
|
* something searchable.
|
|
*/
|
|
|
|
for (Xapian::TermIterator t = query->xapian_query.get_terms_begin ();
|
|
t != query->xapian_query.get_terms_end (); ++t)
|
|
query->terms.insert (*t);
|
|
}
|
|
|
|
notmuch_status_t
|
|
_notmuch_query_string_to_xapian_query (notmuch_database_t *notmuch,
|
|
std::string query_string,
|
|
Xapian::Query &output,
|
|
std::string &msg)
|
|
{
|
|
try {
|
|
if (query_string == "" || query_string == "*") {
|
|
output = xapian_query_match_all ();
|
|
} else {
|
|
output =
|
|
notmuch->query_parser->
|
|
parse_query (query_string, NOTMUCH_QUERY_PARSER_FLAGS);
|
|
}
|
|
} catch (const Xapian::Error &error) {
|
|
if (! notmuch->exception_reported) {
|
|
_notmuch_database_log (notmuch,
|
|
"A Xapian exception occurred parsing query: %s\n",
|
|
error.get_msg ().c_str ());
|
|
_notmuch_database_log_append (notmuch,
|
|
"Query string was: %s\n",
|
|
query_string.c_str ());
|
|
notmuch->exception_reported = true;
|
|
}
|
|
|
|
msg = error.get_msg ();
|
|
return NOTMUCH_STATUS_XAPIAN_EXCEPTION;
|
|
}
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
}
|
|
|
|
static notmuch_status_t
|
|
_notmuch_query_ensure_parsed_xapian (notmuch_query_t *query)
|
|
{
|
|
notmuch_status_t status;
|
|
std::string msg; /* ignored */
|
|
|
|
status = _notmuch_query_string_to_xapian_query (query->notmuch, query->query_string,
|
|
query->xapian_query, msg);
|
|
if (status)
|
|
return status;
|
|
|
|
query->parsed = true;
|
|
|
|
_notmuch_query_cache_terms (query);
|
|
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
}
|
|
|
|
#if HAVE_SFSEXP
|
|
static notmuch_status_t
|
|
_notmuch_query_ensure_parsed_sexpr (notmuch_query_t *query)
|
|
{
|
|
notmuch_status_t status;
|
|
|
|
if (query->parsed)
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
|
|
status = _notmuch_sexp_string_to_xapian_query (query->notmuch, query->query_string,
|
|
query->xapian_query);
|
|
if (status)
|
|
return status;
|
|
|
|
_notmuch_query_cache_terms (query);
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
}
|
|
#endif
|
|
|
|
static notmuch_status_t
|
|
_notmuch_query_ensure_parsed (notmuch_query_t *query)
|
|
{
|
|
if (query->parsed)
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
|
|
#if HAVE_SFSEXP
|
|
if (query->syntax == NOTMUCH_QUERY_SYNTAX_SEXP)
|
|
return _notmuch_query_ensure_parsed_sexpr (query);
|
|
#endif
|
|
|
|
return _notmuch_query_ensure_parsed_xapian (query);
|
|
}
|
|
|
|
const char *
|
|
notmuch_query_get_query_string (const notmuch_query_t *query)
|
|
{
|
|
return query->query_string;
|
|
}
|
|
|
|
void
|
|
notmuch_query_set_omit_excluded (notmuch_query_t *query,
|
|
notmuch_exclude_t omit_excluded)
|
|
{
|
|
query->omit_excluded = omit_excluded;
|
|
}
|
|
|
|
void
|
|
notmuch_query_set_sort (notmuch_query_t *query, notmuch_sort_t sort)
|
|
{
|
|
query->sort = sort;
|
|
}
|
|
|
|
notmuch_sort_t
|
|
notmuch_query_get_sort (const notmuch_query_t *query)
|
|
{
|
|
return query->sort;
|
|
}
|
|
|
|
notmuch_status_t
|
|
notmuch_query_add_tag_exclude (notmuch_query_t *query, const char *tag)
|
|
{
|
|
notmuch_status_t status;
|
|
char *term;
|
|
|
|
status = _notmuch_query_ensure_parsed (query);
|
|
if (status)
|
|
return status;
|
|
|
|
term = talloc_asprintf (query, "%s%s", _find_prefix ("tag"), tag);
|
|
if (query->terms.count (term) != 0)
|
|
return NOTMUCH_STATUS_IGNORED;
|
|
|
|
_notmuch_string_list_append (query->exclude_terms, term);
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
}
|
|
|
|
/* We end up having to call the destructors explicitly because we had
|
|
* to use "placement new" in order to initialize C++ objects within a
|
|
* block that we allocated with talloc. So C++ is making talloc
|
|
* slightly less simple to use, (we wouldn't need
|
|
* talloc_set_destructor at all otherwise).
|
|
*/
|
|
static int
|
|
_notmuch_messages_destructor (notmuch_mset_messages_t *messages)
|
|
{
|
|
messages->iterator.~MSetIterator ();
|
|
messages->iterator_end.~MSetIterator ();
|
|
|
|
return 0;
|
|
}
|
|
|
|
/* Return a query that matches messages with the excluded tags
|
|
* registered with query. The caller of this function has to combine the returned
|
|
* query appropriately.*/
|
|
static Xapian::Query
|
|
_notmuch_exclude_tags (notmuch_query_t *query)
|
|
{
|
|
Xapian::Query exclude_query = Xapian::Query::MatchNothing;
|
|
|
|
for (notmuch_string_node_t *term = query->exclude_terms->head; term;
|
|
term = term->next) {
|
|
exclude_query = Xapian::Query (Xapian::Query::OP_OR,
|
|
exclude_query, Xapian::Query (term->string));
|
|
}
|
|
return exclude_query;
|
|
}
|
|
|
|
|
|
notmuch_status_t
|
|
notmuch_query_search_messages_st (notmuch_query_t *query,
|
|
notmuch_messages_t **out)
|
|
{
|
|
return notmuch_query_search_messages (query, out);
|
|
}
|
|
|
|
notmuch_status_t
|
|
notmuch_query_search_messages (notmuch_query_t *query,
|
|
notmuch_messages_t **out)
|
|
{
|
|
return _notmuch_query_search_documents (query, "mail", out);
|
|
}
|
|
|
|
notmuch_status_t
|
|
_notmuch_query_search_documents (notmuch_query_t *query,
|
|
const char *type,
|
|
notmuch_messages_t **out)
|
|
{
|
|
notmuch_database_t *notmuch = query->notmuch;
|
|
notmuch_mset_messages_t *messages;
|
|
notmuch_status_t status;
|
|
|
|
status = _notmuch_query_ensure_parsed (query);
|
|
if (status)
|
|
return status;
|
|
|
|
messages = talloc (query, notmuch_mset_messages_t);
|
|
if (unlikely (messages == NULL))
|
|
return NOTMUCH_STATUS_OUT_OF_MEMORY;
|
|
|
|
try {
|
|
|
|
messages->base.is_of_list_type = false;
|
|
messages->base.iterator = NULL;
|
|
messages->notmuch = notmuch;
|
|
new (&messages->iterator) Xapian::MSetIterator ();
|
|
new (&messages->iterator_end) Xapian::MSetIterator ();
|
|
|
|
talloc_set_destructor (messages, _notmuch_messages_destructor);
|
|
|
|
Xapian::Enquire enquire (*notmuch->xapian_db);
|
|
Xapian::Query mail_query (talloc_asprintf (query, "%s%s",
|
|
_find_prefix ("type"),
|
|
type));
|
|
Xapian::Query final_query, exclude_query;
|
|
Xapian::MSet mset;
|
|
Xapian::MSetIterator iterator;
|
|
|
|
final_query = Xapian::Query (Xapian::Query::OP_AND,
|
|
mail_query, query->xapian_query);
|
|
|
|
messages->base.excluded_doc_ids = NULL;
|
|
|
|
if ((query->omit_excluded != NOTMUCH_EXCLUDE_FALSE) && (query->exclude_terms)) {
|
|
exclude_query = _notmuch_exclude_tags (query);
|
|
|
|
if (query->omit_excluded == NOTMUCH_EXCLUDE_TRUE ||
|
|
query->omit_excluded == NOTMUCH_EXCLUDE_ALL) {
|
|
final_query = Xapian::Query (Xapian::Query::OP_AND_NOT,
|
|
final_query, exclude_query);
|
|
} else { /* NOTMUCH_EXCLUDE_FLAG */
|
|
exclude_query = Xapian::Query (Xapian::Query::OP_AND,
|
|
exclude_query, final_query);
|
|
|
|
enquire.set_weighting_scheme (Xapian::BoolWeight ());
|
|
enquire.set_query (exclude_query);
|
|
|
|
mset = enquire.get_mset (0, notmuch->xapian_db->get_doccount ());
|
|
|
|
GArray *excluded_doc_ids = g_array_new (false, false, sizeof (unsigned int));
|
|
|
|
for (iterator = mset.begin (); iterator != mset.end (); iterator++) {
|
|
unsigned int doc_id = *iterator;
|
|
g_array_append_val (excluded_doc_ids, doc_id);
|
|
}
|
|
messages->base.excluded_doc_ids = talloc (messages, _notmuch_doc_id_set);
|
|
_notmuch_doc_id_set_init (query, messages->base.excluded_doc_ids,
|
|
excluded_doc_ids);
|
|
g_array_unref (excluded_doc_ids);
|
|
}
|
|
}
|
|
|
|
|
|
enquire.set_weighting_scheme (Xapian::BoolWeight ());
|
|
|
|
switch (query->sort) {
|
|
case NOTMUCH_SORT_OLDEST_FIRST:
|
|
enquire.set_sort_by_value (NOTMUCH_VALUE_TIMESTAMP, false);
|
|
break;
|
|
case NOTMUCH_SORT_NEWEST_FIRST:
|
|
enquire.set_sort_by_value (NOTMUCH_VALUE_TIMESTAMP, true);
|
|
break;
|
|
case NOTMUCH_SORT_MESSAGE_ID:
|
|
enquire.set_sort_by_value (NOTMUCH_VALUE_MESSAGE_ID, false);
|
|
break;
|
|
case NOTMUCH_SORT_UNSORTED:
|
|
break;
|
|
}
|
|
|
|
if (_debug_query ()) {
|
|
fprintf (stderr, "Exclude query is:\n%s\n",
|
|
exclude_query.get_description ().c_str ());
|
|
fprintf (stderr, "Final query is:\n%s\n",
|
|
final_query.get_description ().c_str ());
|
|
}
|
|
|
|
enquire.set_query (final_query);
|
|
|
|
mset = enquire.get_mset (0, notmuch->xapian_db->get_doccount ());
|
|
|
|
messages->iterator = mset.begin ();
|
|
messages->iterator_end = mset.end ();
|
|
|
|
*out = &messages->base;
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
|
|
} catch (const Xapian::Error &error) {
|
|
_notmuch_database_log (notmuch,
|
|
"A Xapian exception occurred performing query: %s\n",
|
|
error.get_msg ().c_str ());
|
|
_notmuch_database_log_append (notmuch,
|
|
"Query string was: %s\n",
|
|
query->query_string);
|
|
|
|
notmuch->exception_reported = true;
|
|
talloc_free (messages);
|
|
return NOTMUCH_STATUS_XAPIAN_EXCEPTION;
|
|
}
|
|
}
|
|
|
|
bool
|
|
_notmuch_mset_messages_valid (notmuch_messages_t *messages)
|
|
{
|
|
notmuch_mset_messages_t *mset_messages;
|
|
|
|
mset_messages = (notmuch_mset_messages_t *) messages;
|
|
|
|
return (mset_messages->iterator != mset_messages->iterator_end);
|
|
}
|
|
|
|
static Xapian::docid
|
|
_notmuch_mset_messages_get_doc_id (notmuch_messages_t *messages)
|
|
{
|
|
notmuch_mset_messages_t *mset_messages;
|
|
|
|
mset_messages = (notmuch_mset_messages_t *) messages;
|
|
|
|
if (! _notmuch_mset_messages_valid (&mset_messages->base))
|
|
return 0;
|
|
|
|
return *mset_messages->iterator;
|
|
}
|
|
|
|
notmuch_message_t *
|
|
_notmuch_mset_messages_get (notmuch_messages_t *messages)
|
|
{
|
|
notmuch_message_t *message;
|
|
Xapian::docid doc_id;
|
|
notmuch_private_status_t status;
|
|
notmuch_mset_messages_t *mset_messages;
|
|
|
|
mset_messages = (notmuch_mset_messages_t *) messages;
|
|
|
|
if (! _notmuch_mset_messages_valid (&mset_messages->base))
|
|
return NULL;
|
|
|
|
doc_id = *mset_messages->iterator;
|
|
|
|
message = _notmuch_message_create (mset_messages,
|
|
mset_messages->notmuch, doc_id,
|
|
&status);
|
|
|
|
if (message == NULL &&
|
|
status == NOTMUCH_PRIVATE_STATUS_NO_DOCUMENT_FOUND) {
|
|
INTERNAL_ERROR ("a messages iterator contains a non-existent document ID.\n");
|
|
}
|
|
|
|
if (messages->excluded_doc_ids &&
|
|
_notmuch_doc_id_set_contains (messages->excluded_doc_ids, doc_id))
|
|
notmuch_message_set_flag (message, NOTMUCH_MESSAGE_FLAG_EXCLUDED, true);
|
|
|
|
return message;
|
|
}
|
|
|
|
void
|
|
_notmuch_mset_messages_move_to_next (notmuch_messages_t *messages)
|
|
{
|
|
notmuch_mset_messages_t *mset_messages;
|
|
|
|
mset_messages = (notmuch_mset_messages_t *) messages;
|
|
|
|
mset_messages->iterator++;
|
|
}
|
|
|
|
static bool
|
|
_notmuch_doc_id_set_init (void *ctx,
|
|
notmuch_doc_id_set_t *doc_ids,
|
|
GArray *arr)
|
|
{
|
|
unsigned int max = 0;
|
|
unsigned char *bitmap;
|
|
|
|
for (unsigned int i = 0; i < arr->len; i++)
|
|
max = MAX (max, g_array_index (arr, unsigned int, i));
|
|
bitmap = talloc_zero_array (ctx, unsigned char, DOCIDSET_WORD (max) + 1);
|
|
|
|
if (bitmap == NULL)
|
|
return false;
|
|
|
|
doc_ids->bitmap = bitmap;
|
|
doc_ids->bound = max + 1;
|
|
|
|
for (unsigned int i = 0; i < arr->len; i++) {
|
|
unsigned int doc_id = g_array_index (arr, unsigned int, i);
|
|
bitmap[DOCIDSET_WORD (doc_id)] |= 1 << DOCIDSET_BIT (doc_id);
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
bool
|
|
_notmuch_doc_id_set_contains (notmuch_doc_id_set_t *doc_ids,
|
|
unsigned int doc_id)
|
|
{
|
|
if (doc_id >= doc_ids->bound)
|
|
return false;
|
|
return doc_ids->bitmap[DOCIDSET_WORD (doc_id)] & (1 << DOCIDSET_BIT (doc_id));
|
|
}
|
|
|
|
void
|
|
_notmuch_doc_id_set_remove (notmuch_doc_id_set_t *doc_ids,
|
|
unsigned int doc_id)
|
|
{
|
|
if (doc_id < doc_ids->bound)
|
|
doc_ids->bitmap[DOCIDSET_WORD (doc_id)] &= ~(1 << DOCIDSET_BIT (doc_id));
|
|
}
|
|
|
|
/* Glib objects force use to use a talloc destructor as well, (but not
|
|
* nearly as ugly as the for messages due to C++ objects). At
|
|
* this point, I'd really like to have some talloc-friendly
|
|
* equivalents for the few pieces of glib that I'm using. */
|
|
static int
|
|
_notmuch_threads_destructor (notmuch_threads_t *threads)
|
|
{
|
|
if (threads->doc_ids)
|
|
g_array_unref (threads->doc_ids);
|
|
|
|
return 0;
|
|
}
|
|
|
|
notmuch_status_t
|
|
notmuch_query_search_threads_st (notmuch_query_t *query, notmuch_threads_t **out)
|
|
{
|
|
return notmuch_query_search_threads (query, out);
|
|
}
|
|
|
|
notmuch_status_t
|
|
notmuch_query_search_threads (notmuch_query_t *query,
|
|
notmuch_threads_t **out)
|
|
{
|
|
notmuch_threads_t *threads;
|
|
notmuch_messages_t *messages;
|
|
notmuch_status_t status;
|
|
|
|
threads = talloc (query, notmuch_threads_t);
|
|
if (threads == NULL)
|
|
return NOTMUCH_STATUS_OUT_OF_MEMORY;
|
|
threads->doc_ids = NULL;
|
|
talloc_set_destructor (threads, _notmuch_threads_destructor);
|
|
|
|
threads->query = query;
|
|
|
|
status = notmuch_query_search_messages (query, &messages);
|
|
if (status) {
|
|
talloc_free (threads);
|
|
return status;
|
|
}
|
|
|
|
threads->doc_ids = g_array_new (false, false, sizeof (unsigned int));
|
|
while (notmuch_messages_valid (messages)) {
|
|
unsigned int doc_id = _notmuch_mset_messages_get_doc_id (messages);
|
|
g_array_append_val (threads->doc_ids, doc_id);
|
|
notmuch_messages_move_to_next (messages);
|
|
}
|
|
threads->doc_id_pos = 0;
|
|
|
|
talloc_free (messages);
|
|
|
|
if (! _notmuch_doc_id_set_init (threads, &threads->match_set,
|
|
threads->doc_ids)) {
|
|
talloc_free (threads);
|
|
return NOTMUCH_STATUS_OUT_OF_MEMORY;
|
|
}
|
|
|
|
*out = threads;
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
}
|
|
|
|
void
|
|
notmuch_query_destroy (notmuch_query_t *query)
|
|
{
|
|
talloc_free (query);
|
|
}
|
|
|
|
notmuch_bool_t
|
|
notmuch_threads_valid (notmuch_threads_t *threads)
|
|
{
|
|
unsigned int doc_id;
|
|
|
|
if (! threads)
|
|
return false;
|
|
|
|
while (threads->doc_id_pos < threads->doc_ids->len) {
|
|
doc_id = g_array_index (threads->doc_ids, unsigned int,
|
|
threads->doc_id_pos);
|
|
if (_notmuch_doc_id_set_contains (&threads->match_set, doc_id))
|
|
break;
|
|
|
|
threads->doc_id_pos++;
|
|
}
|
|
|
|
return threads->doc_id_pos < threads->doc_ids->len;
|
|
}
|
|
|
|
notmuch_thread_t *
|
|
notmuch_threads_get (notmuch_threads_t *threads)
|
|
{
|
|
unsigned int doc_id;
|
|
|
|
if (! notmuch_threads_valid (threads))
|
|
return NULL;
|
|
|
|
doc_id = g_array_index (threads->doc_ids, unsigned int,
|
|
threads->doc_id_pos);
|
|
return _notmuch_thread_create (threads->query,
|
|
threads->query->notmuch,
|
|
doc_id,
|
|
&threads->match_set,
|
|
threads->query->exclude_terms,
|
|
threads->query->omit_excluded,
|
|
threads->query->sort);
|
|
}
|
|
|
|
void
|
|
notmuch_threads_move_to_next (notmuch_threads_t *threads)
|
|
{
|
|
threads->doc_id_pos++;
|
|
}
|
|
|
|
void
|
|
notmuch_threads_destroy (notmuch_threads_t *threads)
|
|
{
|
|
talloc_free (threads);
|
|
}
|
|
|
|
notmuch_status_t
|
|
notmuch_query_count_messages_st (notmuch_query_t *query, unsigned *count_out)
|
|
{
|
|
return notmuch_query_count_messages (query, count_out);
|
|
}
|
|
|
|
notmuch_status_t
|
|
notmuch_query_count_messages (notmuch_query_t *query, unsigned *count_out)
|
|
{
|
|
return _notmuch_query_count_documents (query, "mail", count_out);
|
|
}
|
|
|
|
notmuch_status_t
|
|
_notmuch_query_count_documents (notmuch_query_t *query, const char *type, unsigned *count_out)
|
|
{
|
|
notmuch_database_t *notmuch = query->notmuch;
|
|
Xapian::doccount count = 0;
|
|
notmuch_status_t status;
|
|
|
|
status = _notmuch_query_ensure_parsed (query);
|
|
if (status)
|
|
return status;
|
|
|
|
try {
|
|
Xapian::Enquire enquire (*notmuch->xapian_db);
|
|
Xapian::Query mail_query (talloc_asprintf (query, "%s%s",
|
|
_find_prefix ("type"),
|
|
type));
|
|
Xapian::Query final_query, exclude_query;
|
|
Xapian::MSet mset;
|
|
|
|
final_query = Xapian::Query (Xapian::Query::OP_AND,
|
|
mail_query, query->xapian_query);
|
|
|
|
exclude_query = _notmuch_exclude_tags (query);
|
|
|
|
final_query = Xapian::Query (Xapian::Query::OP_AND_NOT,
|
|
final_query, exclude_query);
|
|
|
|
enquire.set_weighting_scheme (Xapian::BoolWeight ());
|
|
enquire.set_docid_order (Xapian::Enquire::ASCENDING);
|
|
|
|
if (_debug_query ()) {
|
|
fprintf (stderr, "Exclude query is:\n%s\n",
|
|
exclude_query.get_description ().c_str ());
|
|
fprintf (stderr, "Final query is:\n%s\n",
|
|
final_query.get_description ().c_str ());
|
|
}
|
|
|
|
enquire.set_query (final_query);
|
|
|
|
/*
|
|
* Set the checkatleast parameter to the number of documents
|
|
* in the database to make get_matches_estimated() exact.
|
|
* Set the max parameter to 1 to avoid fetching documents we will discard.
|
|
*/
|
|
mset = enquire.get_mset (0, 1,
|
|
notmuch->xapian_db->get_doccount ());
|
|
|
|
count = mset.get_matches_estimated ();
|
|
|
|
} catch (const Xapian::Error &error) {
|
|
_notmuch_database_log (notmuch,
|
|
"A Xapian exception occurred performing query: %s\n",
|
|
error.get_msg ().c_str ());
|
|
_notmuch_database_log_append (notmuch,
|
|
"Query string was: %s\n",
|
|
query->query_string);
|
|
return NOTMUCH_STATUS_XAPIAN_EXCEPTION;
|
|
}
|
|
|
|
*count_out = count;
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
}
|
|
|
|
notmuch_status_t
|
|
notmuch_query_count_threads_st (notmuch_query_t *query, unsigned *count)
|
|
{
|
|
return notmuch_query_count_threads (query, count);
|
|
}
|
|
|
|
notmuch_status_t
|
|
notmuch_query_count_threads (notmuch_query_t *query, unsigned *count)
|
|
{
|
|
notmuch_messages_t *messages;
|
|
GHashTable *hash;
|
|
notmuch_sort_t sort;
|
|
notmuch_status_t ret = NOTMUCH_STATUS_SUCCESS;
|
|
|
|
sort = query->sort;
|
|
query->sort = NOTMUCH_SORT_UNSORTED;
|
|
ret = notmuch_query_search_messages (query, &messages);
|
|
if (ret)
|
|
return ret;
|
|
query->sort = sort;
|
|
if (messages == NULL)
|
|
return NOTMUCH_STATUS_XAPIAN_EXCEPTION;
|
|
|
|
hash = g_hash_table_new_full (g_str_hash, g_str_equal, NULL, NULL);
|
|
if (hash == NULL) {
|
|
talloc_free (messages);
|
|
return NOTMUCH_STATUS_OUT_OF_MEMORY;
|
|
}
|
|
|
|
while (notmuch_messages_valid (messages)) {
|
|
notmuch_message_t *message = notmuch_messages_get (messages);
|
|
const char *thread_id = notmuch_message_get_thread_id (message);
|
|
char *thread_id_copy = talloc_strdup (messages, thread_id);
|
|
if (unlikely (thread_id_copy == NULL)) {
|
|
notmuch_message_destroy (message);
|
|
ret = NOTMUCH_STATUS_OUT_OF_MEMORY;
|
|
goto DONE;
|
|
}
|
|
g_hash_table_insert (hash, thread_id_copy, NULL);
|
|
notmuch_message_destroy (message);
|
|
notmuch_messages_move_to_next (messages);
|
|
}
|
|
|
|
*count = g_hash_table_size (hash);
|
|
|
|
DONE:
|
|
g_hash_table_unref (hash);
|
|
talloc_free (messages);
|
|
|
|
return ret;
|
|
}
|
|
|
|
notmuch_database_t *
|
|
notmuch_query_get_database (const notmuch_query_t *query)
|
|
{
|
|
return query->notmuch;
|
|
}
|
|
|
|
notmuch_status_t
|
|
_notmuch_query_expand (notmuch_database_t *notmuch, const char *field, Xapian::Query subquery,
|
|
Xapian::Query &output, std::string &msg)
|
|
{
|
|
std::set<std::string> terms;
|
|
const std::string term_prefix = _find_prefix (field);
|
|
|
|
if (_debug_query ()) {
|
|
fprintf (stderr, "Expanding subquery:\n%s\n",
|
|
subquery.get_description ().c_str ());
|
|
}
|
|
|
|
try {
|
|
Xapian::Enquire enquire (*notmuch->xapian_db);
|
|
Xapian::MSet mset;
|
|
|
|
enquire.set_weighting_scheme (Xapian::BoolWeight ());
|
|
enquire.set_query (subquery);
|
|
|
|
mset = enquire.get_mset (0, notmuch->xapian_db->get_doccount ());
|
|
|
|
for (Xapian::MSetIterator iterator = mset.begin (); iterator != mset.end (); iterator++) {
|
|
Xapian::docid doc_id = *iterator;
|
|
Xapian::Document doc = notmuch->xapian_db->get_document (doc_id);
|
|
Xapian::TermIterator i = doc.termlist_begin ();
|
|
|
|
for (i.skip_to (term_prefix);
|
|
i != doc.termlist_end () && ((*i).rfind (term_prefix, 0) == 0); i++) {
|
|
terms.insert (*i);
|
|
}
|
|
}
|
|
output = Xapian::Query (Xapian::Query::OP_OR, terms.begin (), terms.end ());
|
|
if (_debug_query ()) {
|
|
fprintf (stderr, "Expanded query:\n%s\n",
|
|
subquery.get_description ().c_str ());
|
|
}
|
|
|
|
} catch (const Xapian::Error &error) {
|
|
_notmuch_database_log (notmuch,
|
|
"A Xapian exception occurred expanding query: %s\n",
|
|
error.get_msg ().c_str ());
|
|
msg = error.get_msg ();
|
|
return NOTMUCH_STATUS_XAPIAN_EXCEPTION;
|
|
}
|
|
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
}
|