1 /* database.cc - The database interfaces of the notmuch mail library
3 * Copyright © 2009 Carl Worth
5 * This program is free software: you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation, either version 3 of the License, or
8 * (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program. If not, see http://www.gnu.org/licenses/ .
18 * Author: Carl Worth <cworth@cworth.org>
21 #include "database-private.h"
27 #include <glib.h> /* g_free, GPtrArray, GHashTable */
31 #define ARRAY_SIZE(arr) (sizeof (arr) / sizeof (arr[0]))
38 /* Here's the current schema for our database:
40 * We currently have two different types of documents: mail and timestamps.
44 * A mail document is associated with a particular email message file
45 * on disk. It is indexed with the following prefixed terms which the
46 * database uses to construct threads, etc.:
48 * Single terms of given prefix:
52 * id: Unique ID of mail, (from Message-ID header or generated
53 * as "notmuch-sha1-<sha1_sum_of_entire_file>.
55 * thread: The ID of the thread to which the mail belongs
57 * replyto: The ID from the In-Reply-To header of the mail (if any).
59 * Multiple terms of given prefix:
61 * reference: All message IDs from In-Reply-To and Re ferences
62 * headers in the message.
64 * tag: Any tags associated with this message by the user.
66 * A mail document also has two values:
68 * TIMESTAMP: The time_t value corresponding to the message's
71 * MESSAGE_ID: The unique ID of the mail mess (see "id" above)
73 * In addition, terms from the content of the message are added with
74 * "from", "to", "attachment", and "subject" prefixes for use by the
75 * user in searching. But the database doesn't really care itself
80 * A timestamp document is used by a client of the notmuch library to
81 * maintain data necessary to allow for efficient polling of mail
82 * directories. The notmuch library does no interpretation of
83 * timestamps, but merely allows the user to store and retrieve
84 * timestamps as name/value pairs.
86 * The timestamp document is indexed with a single prefixed term:
88 * timestamp: The user's key value (likely a directory name)
90 * and has a single value:
92 * TIMESTAMP: The time_t value from the user.
95 /* With these prefix values we follow the conventions published here:
97 * http://xapian.org/docs/omega/termprefixes.html
99 * as much as makes sense. Note that I took some liberty in matching
100 * the reserved prefix values to notmuch concepts, (for example, 'G'
101 * is documented as "newsGroup (or similar entity - e.g. a web forum
102 * name)", for which I think the thread is the closest analogue in
103 * notmuch. This in spite of the fact that we will eventually be
104 * storing mailing-list messages where 'G' for "mailing list name"
105 * might be even a closer analogue. I'm treating the single-character
106 * prefixes preferentially for core notmuch concepts (which will be
107 * nearly universal to all mail messages).
110 prefix_t BOOLEAN_PREFIX_INTERNAL[] = {
112 { "reference", "XREFERENCE" },
113 { "replyto", "XREPLYTO" },
114 { "timestamp", "XTIMESTAMP" },
117 prefix_t BOOLEAN_PREFIX_EXTERNAL[] = {
123 prefix_t PROBABILISTIC_PREFIX[]= {
126 { "attachment", "XATTACHMENT" },
127 { "subject", "XSUBJECT"}
131 _internal_error (const char *format, ...)
135 va_start (va_args, format);
137 fprintf (stderr, "Internal error: ");
138 vfprintf (stderr, format, va_args);
146 _find_prefix (const char *name)
150 for (i = 0; i < ARRAY_SIZE (BOOLEAN_PREFIX_INTERNAL); i++)
151 if (strcmp (name, BOOLEAN_PREFIX_INTERNAL[i].name) == 0)
152 return BOOLEAN_PREFIX_INTERNAL[i].prefix;
154 for (i = 0; i < ARRAY_SIZE (BOOLEAN_PREFIX_EXTERNAL); i++)
155 if (strcmp (name, BOOLEAN_PREFIX_EXTERNAL[i].name) == 0)
156 return BOOLEAN_PREFIX_EXTERNAL[i].prefix;
158 for (i = 0; i < ARRAY_SIZE (PROBABILISTIC_PREFIX); i++)
159 if (strcmp (name, PROBABILISTIC_PREFIX[i].name) == 0)
160 return PROBABILISTIC_PREFIX[i].prefix;
162 INTERNAL_ERROR ("No prefix exists for '%s'\n", name);
168 notmuch_status_to_string (notmuch_status_t status)
171 case NOTMUCH_STATUS_SUCCESS:
172 return "No error occurred";
173 case NOTMUCH_STATUS_OUT_OF_MEMORY:
174 return "Out of memory";
175 case NOTMUCH_STATUS_XAPIAN_EXCEPTION:
176 return "A Xapian exception occurred";
177 case NOTMUCH_STATUS_FILE_ERROR:
178 return "Something went wrong trying to read or write a file";
179 case NOTMUCH_STATUS_FILE_NOT_EMAIL:
180 return "File is not an email";
181 case NOTMUCH_STATUS_DUPLICATE_MESSAGE_ID:
182 return "Message ID is identical to a message in database";
183 case NOTMUCH_STATUS_NULL_POINTER:
184 return "Erroneous NULL pointer";
185 case NOTMUCH_STATUS_TAG_TOO_LONG:
186 return "Tag value is too long (exceeds NOTMUCH_TAG_MAX)";
187 case NOTMUCH_STATUS_UNBALANCED_FREEZE_THAW:
188 return "Unblanced number of calls to notmuch_message_freeze/thaw";
190 case NOTMUCH_STATUS_LAST_STATUS:
191 return "Unknown error status value";
196 find_doc_ids (notmuch_database_t *notmuch,
197 const char *prefix_name,
199 Xapian::PostingIterator *begin,
200 Xapian::PostingIterator *end)
202 Xapian::PostingIterator i;
205 term = talloc_asprintf (notmuch, "%s%s",
206 _find_prefix (prefix_name), value);
208 *begin = notmuch->xapian_db->postlist_begin (term);
210 *end = notmuch->xapian_db->postlist_end (term);
215 static notmuch_private_status_t
216 find_unique_doc_id (notmuch_database_t *notmuch,
217 const char *prefix_name,
219 unsigned int *doc_id)
221 Xapian::PostingIterator i, end;
223 find_doc_ids (notmuch, prefix_name, value, &i, &end);
227 return NOTMUCH_PRIVATE_STATUS_NO_DOCUMENT_FOUND;
230 return NOTMUCH_PRIVATE_STATUS_SUCCESS;
234 static Xapian::Document
235 find_document_for_doc_id (notmuch_database_t *notmuch, unsigned doc_id)
237 return notmuch->xapian_db->get_document (doc_id);
240 static notmuch_private_status_t
241 find_unique_document (notmuch_database_t *notmuch,
242 const char *prefix_name,
244 Xapian::Document *document,
245 unsigned int *doc_id)
247 notmuch_private_status_t status;
249 status = find_unique_doc_id (notmuch, prefix_name, value, doc_id);
252 *document = Xapian::Document ();
256 *document = find_document_for_doc_id (notmuch, *doc_id);
257 return NOTMUCH_PRIVATE_STATUS_SUCCESS;
261 notmuch_database_find_message (notmuch_database_t *notmuch,
262 const char *message_id)
264 notmuch_private_status_t status;
267 status = find_unique_doc_id (notmuch, "id", message_id, &doc_id);
269 if (status == NOTMUCH_PRIVATE_STATUS_NO_DOCUMENT_FOUND)
272 return _notmuch_message_create (notmuch, notmuch, doc_id, NULL);
275 /* Advance 'str' past any whitespace or RFC 822 comments. A comment is
276 * a (potentially nested) parenthesized sequence with '\' used to
277 * escape any character (including parentheses).
279 * If the sequence to be skipped continues to the end of the string,
280 * then 'str' will be left pointing at the final terminating '\0'
284 skip_space_and_comments (const char **str)
289 while (*s && (isspace (*s) || *s == '(')) {
290 while (*s && isspace (*s))
295 while (*s && nesting) {
311 /* Parse an RFC 822 message-id, discarding whitespace, any RFC 822
312 * comments, and the '<' and '>' delimeters.
314 * If not NULL, then *next will be made to point to the first character
315 * not parsed, (possibly pointing to the final '\0' terminator.
317 * Returns a newly talloc'ed string belonging to 'ctx'.
319 * Returns NULL if there is any error parsing the message-id. */
321 _parse_message_id (void *ctx, const char *message_id, const char **next)
326 if (message_id == NULL)
331 skip_space_and_comments (&s);
333 /* Skip any unstructured text as well. */
334 while (*s && *s != '<')
345 skip_space_and_comments (&s);
348 while (*end && *end != '>')
357 if (end > s && *end == '>')
362 result = talloc_strndup (ctx, s, end - s + 1);
364 /* Finally, collapse any whitespace that is within the message-id
370 for (r = result, len = strlen (r); *r; r++, len--)
371 if (*r == ' ' || *r == '\t')
372 memmove (r, r+1, len);
378 /* Parse a References header value, putting a (talloc'ed under 'ctx')
379 * copy of each referenced message-id into 'hash'.
381 * We explicitly avoid including any reference identical to
382 * 'message_id' in the result (to avoid mass confusion when a single
383 * message references itself cyclically---and yes, mail messages are
384 * not infrequent in the wild that do this---don't ask me why).
387 parse_references (void *ctx,
388 const char *message_id,
398 ref = _parse_message_id (ctx, refs, &refs);
400 if (ref && strcmp (ref, message_id))
401 g_hash_table_insert (hash, ref, NULL);
406 notmuch_database_create (const char *path)
408 notmuch_database_t *notmuch = NULL;
409 char *notmuch_path = NULL;
414 fprintf (stderr, "Error: Cannot create a database for a NULL path.\n");
418 err = stat (path, &st);
420 fprintf (stderr, "Error: Cannot create database at %s: %s.\n",
421 path, strerror (errno));
425 if (! S_ISDIR (st.st_mode)) {
426 fprintf (stderr, "Error: Cannot create database at %s: Not a directory.\n",
431 notmuch_path = talloc_asprintf (NULL, "%s/%s", path, ".notmuch");
433 err = mkdir (notmuch_path, 0755);
436 fprintf (stderr, "Error: Cannot create directory %s: %s.\n",
437 notmuch_path, strerror (errno));
441 notmuch = notmuch_database_open (path);
445 talloc_free (notmuch_path);
451 notmuch_database_open (const char *path)
453 notmuch_database_t *notmuch = NULL;
454 char *notmuch_path = NULL, *xapian_path = NULL;
459 if (asprintf (¬much_path, "%s/%s", path, ".notmuch") == -1) {
461 fprintf (stderr, "Out of memory\n");
465 err = stat (notmuch_path, &st);
467 fprintf (stderr, "Error opening database at %s: %s\n",
468 notmuch_path, strerror (errno));
472 if (asprintf (&xapian_path, "%s/%s", notmuch_path, "xapian") == -1) {
474 fprintf (stderr, "Out of memory\n");
478 notmuch = talloc (NULL, notmuch_database_t);
479 notmuch->path = talloc_strdup (notmuch, path);
481 if (notmuch->path[strlen (notmuch->path) - 1] == '/')
482 notmuch->path[strlen (notmuch->path) - 1] = '\0';
485 notmuch->xapian_db = new Xapian::WritableDatabase (xapian_path,
486 Xapian::DB_CREATE_OR_OPEN);
487 notmuch->query_parser = new Xapian::QueryParser;
488 notmuch->term_gen = new Xapian::TermGenerator;
489 notmuch->term_gen->set_stemmer (Xapian::Stem ("english"));
491 notmuch->query_parser->set_default_op (Xapian::Query::OP_AND);
492 notmuch->query_parser->set_database (*notmuch->xapian_db);
493 notmuch->query_parser->set_stemmer (Xapian::Stem ("english"));
494 notmuch->query_parser->set_stemming_strategy (Xapian::QueryParser::STEM_SOME);
496 for (i = 0; i < ARRAY_SIZE (BOOLEAN_PREFIX_EXTERNAL); i++) {
497 prefix_t *prefix = &BOOLEAN_PREFIX_EXTERNAL[i];
498 notmuch->query_parser->add_boolean_prefix (prefix->name,
502 for (i = 0; i < ARRAY_SIZE (PROBABILISTIC_PREFIX); i++) {
503 prefix_t *prefix = &PROBABILISTIC_PREFIX[i];
504 notmuch->query_parser->add_prefix (prefix->name, prefix->prefix);
506 } catch (const Xapian::Error &error) {
507 fprintf (stderr, "A Xapian exception occurred: %s\n",
508 error.get_msg().c_str());
522 notmuch_database_close (notmuch_database_t *notmuch)
524 notmuch->xapian_db->flush ();
526 delete notmuch->term_gen;
527 delete notmuch->query_parser;
528 delete notmuch->xapian_db;
529 talloc_free (notmuch);
533 notmuch_database_get_path (notmuch_database_t *notmuch)
535 return notmuch->path;
538 static notmuch_private_status_t
539 find_timestamp_document (notmuch_database_t *notmuch, const char *db_key,
540 Xapian::Document *doc, unsigned int *doc_id)
542 return find_unique_document (notmuch, "timestamp", db_key, doc, doc_id);
545 /* We allow the user to use arbitrarily long keys for timestamps,
546 * (they're for filesystem paths after all, which have no limit we
547 * know about). But we have a term-length limit. So if we exceed that,
548 * we'll use the SHA-1 of the user's key as the actual key for
549 * constructing a database term.
551 * Caution: This function returns a newly allocated string which the
552 * caller should free() when finished.
555 timestamp_db_key (const char *key)
557 int term_len = strlen (_find_prefix ("timestamp")) + strlen (key);
559 if (term_len > NOTMUCH_TERM_MAX)
560 return notmuch_sha1_of_string (key);
566 notmuch_database_set_timestamp (notmuch_database_t *notmuch,
567 const char *key, time_t timestamp)
569 Xapian::Document doc;
571 notmuch_private_status_t status;
572 notmuch_status_t ret = NOTMUCH_STATUS_SUCCESS;
575 db_key = timestamp_db_key (key);
578 status = find_timestamp_document (notmuch, db_key, &doc, &doc_id);
580 doc.add_value (NOTMUCH_VALUE_TIMESTAMP,
581 Xapian::sortable_serialise (timestamp));
583 if (status == NOTMUCH_PRIVATE_STATUS_NO_DOCUMENT_FOUND) {
584 char *term = talloc_asprintf (NULL, "%s%s",
585 _find_prefix ("timestamp"), db_key);
589 notmuch->xapian_db->add_document (doc);
591 notmuch->xapian_db->replace_document (doc_id, doc);
594 } catch (Xapian::Error &error) {
595 fprintf (stderr, "A Xapian exception occurred: %s.\n",
596 error.get_msg().c_str());
597 ret = NOTMUCH_STATUS_XAPIAN_EXCEPTION;
607 notmuch_database_get_timestamp (notmuch_database_t *notmuch, const char *key)
609 Xapian::Document doc;
611 notmuch_private_status_t status;
615 db_key = timestamp_db_key (key);
618 status = find_timestamp_document (notmuch, db_key, &doc, &doc_id);
620 if (status == NOTMUCH_PRIVATE_STATUS_NO_DOCUMENT_FOUND)
623 ret = Xapian::sortable_unserialise (doc.get_value (NOTMUCH_VALUE_TIMESTAMP));
624 } catch (Xapian::Error &error) {
635 /* Find the thread ID to which the message with 'message_id' belongs.
637 * Returns NULL if no message with message ID 'message_id' is in the
640 * Otherwise, returns a newly talloced string belonging to 'ctx'.
643 _resolve_message_id_to_thread_id (notmuch_database_t *notmuch,
645 const char *message_id)
647 notmuch_message_t *message;
648 const char *ret = NULL;
650 message = notmuch_database_find_message (notmuch, message_id);
654 ret = talloc_steal (ctx, notmuch_message_get_thread_id (message));
658 notmuch_message_destroy (message);
663 static notmuch_status_t
664 _merge_threads (notmuch_database_t *notmuch,
665 const char *winner_thread_id,
666 const char *loser_thread_id)
668 Xapian::PostingIterator loser, loser_end;
669 notmuch_message_t *message = NULL;
670 notmuch_private_status_t private_status;
671 notmuch_status_t ret = NOTMUCH_STATUS_SUCCESS;
673 find_doc_ids (notmuch, "thread", loser_thread_id, &loser, &loser_end);
675 for ( ; loser != loser_end; loser++) {
676 message = _notmuch_message_create (notmuch, notmuch,
677 *loser, &private_status);
678 if (message == NULL) {
679 ret = COERCE_STATUS (private_status,
680 "Cannot find document for doc_id from query");
684 _notmuch_message_remove_term (message, "thread", loser_thread_id);
685 _notmuch_message_add_term (message, "thread", winner_thread_id);
686 _notmuch_message_sync (message);
688 notmuch_message_destroy (message);
694 notmuch_message_destroy (message);
700 _my_talloc_free_for_g_hash (void *ptr)
705 static notmuch_status_t
706 _notmuch_database_link_message_to_parents (notmuch_database_t *notmuch,
707 notmuch_message_t *message,
708 notmuch_message_file_t *message_file,
709 const char **thread_id)
711 GHashTable *parents = NULL;
712 const char *refs, *in_reply_to, *in_reply_to_message_id;
713 GList *l, *keys = NULL;
714 notmuch_status_t ret = NOTMUCH_STATUS_SUCCESS;
716 parents = g_hash_table_new_full (g_str_hash, g_str_equal,
717 _my_talloc_free_for_g_hash, NULL);
719 refs = notmuch_message_file_get_header (message_file, "references");
720 parse_references (message, notmuch_message_get_message_id (message),
723 in_reply_to = notmuch_message_file_get_header (message_file, "in-reply-to");
724 parse_references (message, notmuch_message_get_message_id (message),
725 parents, in_reply_to);
727 /* Carefully avoid adding any self-referential in-reply-to term. */
728 in_reply_to_message_id = _parse_message_id (message, in_reply_to, NULL);
729 if (strcmp (in_reply_to_message_id,
730 notmuch_message_get_message_id (message)))
732 _notmuch_message_add_term (message, "replyto",
733 _parse_message_id (message, in_reply_to, NULL));
736 keys = g_hash_table_get_keys (parents);
737 for (l = keys; l; l = l->next) {
738 char *parent_message_id;
739 const char *parent_thread_id;
741 parent_message_id = (char *) l->data;
742 parent_thread_id = _resolve_message_id_to_thread_id (notmuch,
746 if (parent_thread_id == NULL) {
747 _notmuch_message_add_term (message, "reference",
750 if (*thread_id == NULL) {
751 *thread_id = talloc_strdup (message, parent_thread_id);
752 _notmuch_message_add_term (message, "thread", *thread_id);
753 } else if (strcmp (*thread_id, parent_thread_id)) {
754 ret = _merge_threads (notmuch, *thread_id, parent_thread_id);
765 g_hash_table_unref (parents);
770 static notmuch_status_t
771 _notmuch_database_link_message_to_children (notmuch_database_t *notmuch,
772 notmuch_message_t *message,
773 const char **thread_id)
775 const char *message_id = notmuch_message_get_message_id (message);
776 Xapian::PostingIterator child, children_end;
777 notmuch_message_t *child_message = NULL;
778 const char *child_thread_id;
779 notmuch_status_t ret = NOTMUCH_STATUS_SUCCESS;
780 notmuch_private_status_t private_status;
782 find_doc_ids (notmuch, "reference", message_id, &child, &children_end);
784 for ( ; child != children_end; child++) {
786 child_message = _notmuch_message_create (message, notmuch,
787 *child, &private_status);
788 if (child_message == NULL) {
789 ret = COERCE_STATUS (private_status,
790 "Cannot find document for doc_id from query");
794 child_thread_id = notmuch_message_get_thread_id (child_message);
795 if (*thread_id == NULL) {
796 *thread_id = talloc_strdup (message, child_thread_id);
797 _notmuch_message_add_term (message, "thread", *thread_id);
798 } else if (strcmp (*thread_id, child_thread_id)) {
799 _notmuch_message_remove_term (child_message, "reference",
801 _notmuch_message_sync (child_message);
802 ret = _merge_threads (notmuch, *thread_id, child_thread_id);
807 notmuch_message_destroy (child_message);
808 child_message = NULL;
813 notmuch_message_destroy (child_message);
818 /* Given a (mostly empty) 'message' and its corresponding
819 * 'message_file' link it to existing threads in the database.
821 * We first look at 'message_file' and its link-relevant headers
822 * (References and In-Reply-To) for message IDs. We also look in the
823 * database for existing message that reference 'message'.p
825 * The end result is to call _notmuch_message_add_thread_id with one
826 * or more thread IDs to which this message belongs, (including
827 * generating a new thread ID if necessary if the message doesn't
828 * connect to any existing threads).
830 static notmuch_status_t
831 _notmuch_database_link_message (notmuch_database_t *notmuch,
832 notmuch_message_t *message,
833 notmuch_message_file_t *message_file)
835 notmuch_status_t status;
836 const char *thread_id = NULL;
838 status = _notmuch_database_link_message_to_parents (notmuch, message,
844 status = _notmuch_database_link_message_to_children (notmuch, message,
849 if (thread_id == NULL)
850 _notmuch_message_ensure_thread_id (message);
852 return NOTMUCH_STATUS_SUCCESS;
856 notmuch_database_add_message (notmuch_database_t *notmuch,
857 const char *filename,
858 notmuch_message_t **message_ret)
860 notmuch_message_file_t *message_file;
861 notmuch_message_t *message = NULL;
862 notmuch_status_t ret = NOTMUCH_STATUS_SUCCESS;
863 notmuch_private_status_t private_status;
865 const char *date, *header;
866 const char *from, *to, *subject;
872 message_file = notmuch_message_file_open (filename);
873 if (message_file == NULL) {
874 ret = NOTMUCH_STATUS_FILE_ERROR;
878 notmuch_message_file_restrict_headers (message_file,
889 /* Before we do any real work, (especially before doing a
890 * potential SHA-1 computation on the entire file's contents),
891 * let's make sure that what we're looking at looks like an
892 * actual email message.
894 from = notmuch_message_file_get_header (message_file, "from");
895 subject = notmuch_message_file_get_header (message_file, "subject");
896 to = notmuch_message_file_get_header (message_file, "to");
902 ret = NOTMUCH_STATUS_FILE_NOT_EMAIL;
906 /* Now that we're sure it's mail, the first order of business
907 * is to find a message ID (or else create one ourselves). */
909 header = notmuch_message_file_get_header (message_file, "message-id");
911 message_id = _parse_message_id (message_file, header, NULL);
912 /* So the header value isn't RFC-compliant, but it's
913 * better than no message-id at all. */
914 if (message_id == NULL)
915 message_id = talloc_strdup (message_file, header);
917 /* No message-id at all, let's generate one by taking a
918 * hash over the file's contents. */
919 char *sha1 = notmuch_sha1_of_file (filename);
921 /* If that failed too, something is really wrong. Give up. */
923 ret = NOTMUCH_STATUS_FILE_ERROR;
927 message_id = talloc_asprintf (message_file,
928 "notmuch-sha1-%s", sha1);
932 /* Now that we have a message ID, we get a message object,
933 * (which may or may not reference an existing document in the
936 message = _notmuch_message_create_for_message_id (notmuch,
940 talloc_free (message_id);
945 /* Is this a newly created message object? */
946 if (private_status == NOTMUCH_PRIVATE_STATUS_NO_DOCUMENT_FOUND) {
947 _notmuch_message_set_filename (message, filename);
948 _notmuch_message_add_term (message, "type", "mail");
950 ret = NOTMUCH_STATUS_DUPLICATE_MESSAGE_ID;
954 ret = _notmuch_database_link_message (notmuch, message, message_file);
958 date = notmuch_message_file_get_header (message_file, "date");
959 _notmuch_message_set_date (message, date);
961 _notmuch_message_index_file (message, filename);
963 _notmuch_message_sync (message);
964 } catch (const Xapian::Error &error) {
965 fprintf (stderr, "A Xapian exception occurred: %s.\n",
966 error.get_msg().c_str());
967 ret = NOTMUCH_STATUS_XAPIAN_EXCEPTION;
973 if (ret == NOTMUCH_STATUS_SUCCESS && message_ret)
974 *message_ret = message;
976 notmuch_message_destroy (message);
980 notmuch_message_file_close (message_file);