/* 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 http://www.gnu.org/licenses/ . * * Author: Carl Worth */ #include "notmuch-private.h" #include "database-private.h" #include struct _notmuch_query { notmuch_database_t *notmuch; const char *query_string; notmuch_sort_t sort; }; struct _notmuch_results { notmuch_database_t *notmuch; Xapian::MSetIterator iterator; Xapian::MSetIterator iterator_end; }; notmuch_query_t * notmuch_query_create (notmuch_database_t *notmuch, const char *query_string) { notmuch_query_t *query; #ifdef DEBUG_QUERY fprintf (stderr, "Query string is:\n%s\n", query_string); #endif query = talloc (NULL, notmuch_query_t); if (unlikely (query == NULL)) return NULL; query->notmuch = notmuch; query->query_string = talloc_strdup (query, query_string); query->sort = NOTMUCH_SORT_DATE_OLDEST_FIRST; return query; } void notmuch_query_set_sort (notmuch_query_t *query, notmuch_sort_t sort) { query->sort = sort; } /* 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_results_destructor (notmuch_results_t *results) { results->iterator.~MSetIterator (); results->iterator_end.~MSetIterator (); return 0; } notmuch_results_t * notmuch_query_search (notmuch_query_t *query) { notmuch_database_t *notmuch = query->notmuch; const char *query_string = query->query_string; notmuch_results_t *results; results = talloc (query, notmuch_results_t); if (unlikely (results == NULL)) return NULL; try { Xapian::Enquire enquire (*notmuch->xapian_db); Xapian::Query mail_query ("Kmail"); Xapian::Query string_query, final_query; Xapian::MSet mset; unsigned int flags = (Xapian::QueryParser::FLAG_BOOLEAN | Xapian::QueryParser::FLAG_PHRASE | Xapian::QueryParser::FLAG_LOVEHATE | Xapian::QueryParser::FLAG_BOOLEAN_ANY_CASE | Xapian::QueryParser::FLAG_WILDCARD); if (strcmp (query_string, "") == 0) { final_query = mail_query; } else { string_query = notmuch->query_parser-> parse_query (query_string, flags); final_query = Xapian::Query (Xapian::Query::OP_AND, mail_query, string_query); } switch (query->sort) { case NOTMUCH_SORT_DATE_OLDEST_FIRST: enquire.set_sort_by_value (NOTMUCH_VALUE_DATE, FALSE); break; case NOTMUCH_SORT_DATE_NEWEST_FIRST: enquire.set_sort_by_value (NOTMUCH_VALUE_DATE, TRUE); break; case NOTMUCH_SORT_MESSAGE_ID: enquire.set_sort_by_value (NOTMUCH_VALUE_MESSAGE_ID, FALSE); break; } #if DEBUG_QUERY fprintf (stderr, "Final query is:\n%s\n", final_query.get_description().c_str()); #endif enquire.set_query (final_query); mset = enquire.get_mset (0, notmuch->xapian_db->get_doccount ()); results->notmuch = notmuch; new (&results->iterator) Xapian::MSetIterator (); new (&results->iterator_end) Xapian::MSetIterator (); talloc_set_destructor (results, _notmuch_results_destructor); results->iterator = mset.begin (); results->iterator_end = mset.end (); } catch (const Xapian::Error &error) { fprintf (stderr, "A Xapian exception occurred: %s\n", error.get_msg().c_str()); } return results; } void notmuch_query_destroy (notmuch_query_t *query) { talloc_free (query); } notmuch_bool_t notmuch_results_has_more (notmuch_results_t *results) { return (results->iterator != results->iterator_end); } notmuch_message_t * notmuch_results_get (notmuch_results_t *results) { Xapian::docid doc_id; doc_id = *results->iterator; return _notmuch_message_create (results, results->notmuch, doc_id); } void notmuch_results_advance (notmuch_results_t *results) { results->iterator++; } void notmuch_results_destroy (notmuch_results_t *results) { talloc_free (results); }