2009-10-21 06:03:30 +02:00
|
|
|
/* message.cc - Results of message-based searches from 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 <cworth@cworth.org>
|
|
|
|
*/
|
|
|
|
|
2009-10-26 17:13:19 +01:00
|
|
|
#include "notmuch-private.h"
|
2009-10-21 06:03:30 +02:00
|
|
|
#include "database-private.h"
|
|
|
|
|
2009-11-17 16:28:38 +01:00
|
|
|
#include <stdint.h>
|
|
|
|
|
2009-11-02 23:36:33 +01:00
|
|
|
#include <gmime/gmime.h>
|
|
|
|
|
2009-10-21 06:03:30 +02:00
|
|
|
#include <xapian.h>
|
|
|
|
|
|
|
|
struct _notmuch_message {
|
2009-10-22 00:42:54 +02:00
|
|
|
notmuch_database_t *notmuch;
|
|
|
|
Xapian::docid doc_id;
|
2009-10-27 06:25:45 +01:00
|
|
|
int frozen;
|
2009-10-22 00:42:54 +02:00
|
|
|
char *message_id;
|
2009-10-25 22:54:13 +01:00
|
|
|
char *thread_id;
|
2009-11-18 02:40:19 +01:00
|
|
|
char *in_reply_to;
|
2009-10-23 14:38:13 +02:00
|
|
|
char *filename;
|
2009-10-27 01:35:31 +01:00
|
|
|
notmuch_message_file_t *message_file;
|
2009-11-16 05:39:25 +01:00
|
|
|
notmuch_message_list_t *replies;
|
|
|
|
|
2009-10-21 06:03:30 +02:00
|
|
|
Xapian::Document doc;
|
|
|
|
};
|
|
|
|
|
2009-10-23 15:00:10 +02:00
|
|
|
/* "128 bits of thread-id ought to be enough for anybody" */
|
|
|
|
#define NOTMUCH_THREAD_ID_BITS 128
|
|
|
|
#define NOTMUCH_THREAD_ID_DIGITS (NOTMUCH_THREAD_ID_BITS / 4)
|
|
|
|
typedef struct _thread_id {
|
|
|
|
char str[NOTMUCH_THREAD_ID_DIGITS + 1];
|
|
|
|
} thread_id_t;
|
|
|
|
|
2009-10-21 07:08:31 +02:00
|
|
|
/* We end up having to call the destructor 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).
|
|
|
|
*/
|
2009-10-21 06:03:30 +02:00
|
|
|
static int
|
2009-10-21 07:08:31 +02:00
|
|
|
_notmuch_message_destructor (notmuch_message_t *message)
|
2009-10-21 06:03:30 +02:00
|
|
|
{
|
|
|
|
message->doc.~Document ();
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-10-23 14:45:29 +02:00
|
|
|
/* Create a new notmuch_message_t object for an existing document in
|
|
|
|
* the database.
|
|
|
|
*
|
|
|
|
* Here, 'talloc owner' is an optional talloc context to which the new
|
|
|
|
* message will belong. This allows for the caller to not bother
|
|
|
|
* calling notmuch_message_destroy on the message, and no that all
|
|
|
|
* memory will be reclaimed with 'talloc_owner' is free. The caller
|
|
|
|
* still can call notmuch_message_destroy when finished with the
|
|
|
|
* message if desired.
|
|
|
|
*
|
|
|
|
* The 'talloc_owner' argument can also be NULL, in which case the
|
|
|
|
* caller *is* responsible for calling notmuch_message_destroy.
|
|
|
|
*
|
|
|
|
* If no document exists in the database with document ID of 'doc_id'
|
2009-10-25 22:54:13 +01:00
|
|
|
* then this function returns NULL and optionally sets *status to
|
2009-10-25 17:47:21 +01:00
|
|
|
* NOTMUCH_PRIVATE_STATUS_NO_DOCUMENT_FOUND.
|
|
|
|
*
|
|
|
|
* This function can also fail to due lack of available memory,
|
|
|
|
* returning NULL and optionally setting *status to
|
2009-10-25 22:54:13 +01:00
|
|
|
* NOTMUCH_PRIVATE_STATUS_OUT_OF_MEMORY.
|
|
|
|
*
|
|
|
|
* The caller can pass NULL for status if uninterested in
|
|
|
|
* distinguishing these two cases.
|
2009-10-23 14:45:29 +02:00
|
|
|
*/
|
2009-10-21 06:03:30 +02:00
|
|
|
notmuch_message_t *
|
2009-10-22 00:37:51 +02:00
|
|
|
_notmuch_message_create (const void *talloc_owner,
|
2009-10-21 06:03:30 +02:00
|
|
|
notmuch_database_t *notmuch,
|
2009-10-25 17:47:21 +01:00
|
|
|
unsigned int doc_id,
|
|
|
|
notmuch_private_status_t *status)
|
2009-10-21 06:03:30 +02:00
|
|
|
{
|
|
|
|
notmuch_message_t *message;
|
|
|
|
|
2009-10-25 17:47:21 +01:00
|
|
|
if (status)
|
|
|
|
*status = NOTMUCH_PRIVATE_STATUS_SUCCESS;
|
|
|
|
|
2009-10-22 00:37:51 +02:00
|
|
|
message = talloc (talloc_owner, notmuch_message_t);
|
2009-10-25 17:47:21 +01:00
|
|
|
if (unlikely (message == NULL)) {
|
|
|
|
if (status)
|
|
|
|
*status = NOTMUCH_PRIVATE_STATUS_OUT_OF_MEMORY;
|
2009-10-21 06:03:30 +02:00
|
|
|
return NULL;
|
2009-10-25 17:47:21 +01:00
|
|
|
}
|
2009-10-21 06:03:30 +02:00
|
|
|
|
2009-10-22 00:42:54 +02:00
|
|
|
message->notmuch = notmuch;
|
|
|
|
message->doc_id = doc_id;
|
2009-10-27 01:35:31 +01:00
|
|
|
|
2009-10-27 06:25:45 +01:00
|
|
|
message->frozen = 0;
|
|
|
|
|
2009-10-27 01:35:31 +01:00
|
|
|
/* Each of these will be lazily created as needed. */
|
|
|
|
message->message_id = NULL;
|
|
|
|
message->thread_id = NULL;
|
2009-11-18 02:40:19 +01:00
|
|
|
message->in_reply_to = NULL;
|
2009-10-27 01:35:31 +01:00
|
|
|
message->filename = NULL;
|
|
|
|
message->message_file = NULL;
|
2009-10-25 17:47:21 +01:00
|
|
|
|
2009-11-16 05:39:25 +01:00
|
|
|
message->replies = _notmuch_message_list_create (message);
|
|
|
|
if (unlikely (message->replies == NULL)) {
|
|
|
|
if (status)
|
|
|
|
*status = NOTMUCH_PRIVATE_STATUS_OUT_OF_MEMORY;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2009-10-25 17:47:21 +01:00
|
|
|
/* This is C++'s creepy "placement new", which is really just an
|
|
|
|
* ugly way to call a constructor for a pre-allocated object. So
|
|
|
|
* it's really not an error to not be checking for OUT_OF_MEMORY
|
|
|
|
* here, since this "new" isn't actually allocating memory. This
|
|
|
|
* is language-design comedy of the wrong kind. */
|
|
|
|
|
2009-10-21 06:03:30 +02:00
|
|
|
new (&message->doc) Xapian::Document;
|
|
|
|
|
2009-10-21 07:08:31 +02:00
|
|
|
talloc_set_destructor (message, _notmuch_message_destructor);
|
2009-10-21 06:03:30 +02:00
|
|
|
|
2009-10-23 14:45:29 +02:00
|
|
|
try {
|
|
|
|
message->doc = notmuch->xapian_db->get_document (doc_id);
|
|
|
|
} catch (const Xapian::DocNotFoundError &error) {
|
|
|
|
talloc_free (message);
|
2009-10-25 17:47:21 +01:00
|
|
|
if (status)
|
|
|
|
*status = NOTMUCH_PRIVATE_STATUS_NO_DOCUMENT_FOUND;
|
2009-10-23 14:45:29 +02:00
|
|
|
return NULL;
|
|
|
|
}
|
2009-10-21 06:03:30 +02:00
|
|
|
|
|
|
|
return message;
|
|
|
|
}
|
|
|
|
|
2009-10-23 14:53:52 +02:00
|
|
|
/* Create a new notmuch_message_t object for a specific message ID,
|
2009-11-18 00:23:42 +01:00
|
|
|
* (which may or may not already exist in the database).
|
2009-10-23 14:53:52 +02:00
|
|
|
*
|
2009-11-17 20:02:33 +01:00
|
|
|
* The 'notmuch' database will be the talloc owner of the returned
|
|
|
|
* message.
|
2009-10-23 14:53:52 +02:00
|
|
|
*
|
|
|
|
* If there is already a document with message ID 'message_id' in the
|
|
|
|
* database, then the returned message can be used to query/modify the
|
|
|
|
* document. Otherwise, a new document will be inserted into the
|
2009-10-29 00:50:14 +01:00
|
|
|
* database before this function returns, (and *status will be set
|
|
|
|
* to NOTMUCH_PRIVATE_STATUS_NO_DOCUMENT_FOUND).
|
2009-10-25 17:47:21 +01:00
|
|
|
*
|
|
|
|
* If an error occurs, this function will return NULL and *status
|
|
|
|
* will be set as appropriate. (The status pointer argument must
|
|
|
|
* not be NULL.)
|
2009-10-23 14:53:52 +02:00
|
|
|
*/
|
|
|
|
notmuch_message_t *
|
2009-11-17 20:02:33 +01:00
|
|
|
_notmuch_message_create_for_message_id (notmuch_database_t *notmuch,
|
2009-10-25 17:47:21 +01:00
|
|
|
const char *message_id,
|
2009-10-29 00:50:14 +01:00
|
|
|
notmuch_private_status_t *status_ret)
|
2009-10-23 14:53:52 +02:00
|
|
|
{
|
|
|
|
notmuch_message_t *message;
|
|
|
|
Xapian::Document doc;
|
|
|
|
unsigned int doc_id;
|
|
|
|
char *term;
|
|
|
|
|
2009-10-29 00:50:14 +01:00
|
|
|
*status_ret = NOTMUCH_PRIVATE_STATUS_SUCCESS;
|
2009-10-25 17:47:21 +01:00
|
|
|
|
2009-10-23 14:53:52 +02:00
|
|
|
message = notmuch_database_find_message (notmuch, message_id);
|
|
|
|
if (message)
|
2009-11-17 20:02:33 +01:00
|
|
|
return talloc_steal (notmuch, message);
|
2009-10-23 14:53:52 +02:00
|
|
|
|
|
|
|
term = talloc_asprintf (NULL, "%s%s",
|
2009-10-25 06:29:49 +01:00
|
|
|
_find_prefix ("id"), message_id);
|
2009-10-25 17:47:21 +01:00
|
|
|
if (term == NULL) {
|
2009-10-29 00:50:14 +01:00
|
|
|
*status_ret = NOTMUCH_PRIVATE_STATUS_OUT_OF_MEMORY;
|
2009-10-25 17:47:21 +01:00
|
|
|
return NULL;
|
|
|
|
}
|
2009-10-23 14:53:52 +02:00
|
|
|
|
2009-10-25 17:47:21 +01:00
|
|
|
try {
|
|
|
|
doc.add_term (term);
|
|
|
|
talloc_free (term);
|
|
|
|
|
|
|
|
doc.add_value (NOTMUCH_VALUE_MESSAGE_ID, message_id);
|
|
|
|
|
|
|
|
doc_id = notmuch->xapian_db->add_document (doc);
|
|
|
|
} catch (const Xapian::Error &error) {
|
2009-10-29 00:50:14 +01:00
|
|
|
*status_ret = NOTMUCH_PRIVATE_STATUS_XAPIAN_EXCEPTION;
|
2009-10-25 17:47:21 +01:00
|
|
|
return NULL;
|
|
|
|
}
|
2009-10-23 14:53:52 +02:00
|
|
|
|
2009-11-17 20:02:33 +01:00
|
|
|
message = _notmuch_message_create (notmuch, notmuch,
|
2009-10-29 00:50:14 +01:00
|
|
|
doc_id, status_ret);
|
2009-10-23 14:53:52 +02:00
|
|
|
|
2009-10-29 00:50:14 +01:00
|
|
|
/* We want to inform the caller that we had to create a new
|
|
|
|
* document. */
|
|
|
|
if (*status_ret == NOTMUCH_PRIVATE_STATUS_SUCCESS)
|
|
|
|
*status_ret = NOTMUCH_PRIVATE_STATUS_NO_DOCUMENT_FOUND;
|
2009-10-25 17:47:21 +01:00
|
|
|
|
|
|
|
return message;
|
2009-10-23 14:53:52 +02:00
|
|
|
}
|
|
|
|
|
2009-10-21 06:03:30 +02:00
|
|
|
const char *
|
|
|
|
notmuch_message_get_message_id (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
Xapian::TermIterator i;
|
|
|
|
|
2009-10-22 00:42:54 +02:00
|
|
|
if (message->message_id)
|
|
|
|
return message->message_id;
|
|
|
|
|
2009-10-21 06:03:30 +02:00
|
|
|
i = message->doc.termlist_begin ();
|
2009-10-25 06:29:49 +01:00
|
|
|
i.skip_to (_find_prefix ("id"));
|
2009-10-22 00:42:54 +02:00
|
|
|
|
2009-10-25 22:54:13 +01:00
|
|
|
if (i == message->doc.termlist_end ())
|
2009-10-25 18:22:41 +01:00
|
|
|
INTERNAL_ERROR ("Message with document ID of %d has no message ID.\n",
|
|
|
|
message->doc_id);
|
2009-10-22 00:42:54 +02:00
|
|
|
|
|
|
|
message->message_id = talloc_strdup (message, (*i).c_str () + 1);
|
2009-10-25 22:54:13 +01:00
|
|
|
|
|
|
|
#if DEBUG_DATABASE_SANITY
|
|
|
|
i++;
|
|
|
|
|
|
|
|
if (i != message->doc.termlist_end () &&
|
|
|
|
strncmp ((*i).c_str (), _find_prefix ("id"),
|
|
|
|
strlen (_find_prefix ("id"))) == 0)
|
|
|
|
{
|
|
|
|
INTERNAL_ERROR ("Mail (doc_id: %d) has duplicate message IDs",
|
|
|
|
message->doc_id);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2009-10-22 00:42:54 +02:00
|
|
|
return message->message_id;
|
2009-10-21 06:03:30 +02:00
|
|
|
}
|
|
|
|
|
2009-10-29 16:51:12 +01:00
|
|
|
static void
|
|
|
|
_notmuch_message_ensure_message_file (notmuch_message_t *message)
|
2009-10-27 01:35:31 +01:00
|
|
|
{
|
2009-10-29 16:51:12 +01:00
|
|
|
const char *filename;
|
2009-10-27 01:35:31 +01:00
|
|
|
|
2009-10-29 16:51:12 +01:00
|
|
|
if (message->message_file)
|
|
|
|
return;
|
2009-10-27 01:35:31 +01:00
|
|
|
|
2009-10-29 16:51:12 +01:00
|
|
|
filename = notmuch_message_get_filename (message);
|
|
|
|
if (unlikely (filename == NULL))
|
|
|
|
return;
|
2009-10-27 01:35:31 +01:00
|
|
|
|
2009-10-29 16:51:12 +01:00
|
|
|
message->message_file = _notmuch_message_file_open_ctx (message, filename);
|
|
|
|
}
|
|
|
|
|
|
|
|
const char *
|
|
|
|
notmuch_message_get_header (notmuch_message_t *message, const char *header)
|
|
|
|
{
|
|
|
|
_notmuch_message_ensure_message_file (message);
|
|
|
|
if (message->message_file == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
return notmuch_message_file_get_header (message->message_file, header);
|
|
|
|
}
|
|
|
|
|
2009-11-18 02:40:19 +01:00
|
|
|
/* Return the message ID from the In-Reply-To header of 'message'.
|
|
|
|
*
|
|
|
|
* Returns an empty string ("") if 'message' has no In-Reply-To
|
|
|
|
* header.
|
|
|
|
*
|
|
|
|
* Returns NULL if any error occurs.
|
|
|
|
*/
|
2009-11-16 05:36:51 +01:00
|
|
|
const char *
|
|
|
|
_notmuch_message_get_in_reply_to (notmuch_message_t *message)
|
|
|
|
{
|
2009-11-18 02:40:19 +01:00
|
|
|
const char *prefix = _find_prefix ("replyto");
|
|
|
|
int prefix_len = strlen (prefix);
|
|
|
|
Xapian::TermIterator i;
|
|
|
|
std::string in_reply_to;
|
|
|
|
|
|
|
|
if (message->in_reply_to)
|
|
|
|
return message->in_reply_to;
|
|
|
|
|
|
|
|
i = message->doc.termlist_begin ();
|
|
|
|
i.skip_to (prefix);
|
|
|
|
|
2009-11-20 12:06:11 +01:00
|
|
|
if (i != message->doc.termlist_end ())
|
|
|
|
in_reply_to = *i;
|
2009-11-18 02:40:19 +01:00
|
|
|
|
|
|
|
/* It's perfectly valid for a message to have no In-Reply-To
|
|
|
|
* header. For these cases, we return an empty string. */
|
|
|
|
if (i == message->doc.termlist_end () ||
|
|
|
|
strncmp (in_reply_to.c_str (), prefix, prefix_len))
|
|
|
|
{
|
|
|
|
message->in_reply_to = talloc_strdup (message, "");
|
|
|
|
return message->in_reply_to;
|
|
|
|
}
|
|
|
|
|
|
|
|
message->in_reply_to = talloc_strdup (message,
|
|
|
|
in_reply_to.c_str () + prefix_len);
|
|
|
|
|
|
|
|
#if DEBUG_DATABASE_SANITY
|
|
|
|
i++;
|
|
|
|
|
|
|
|
in_reply_to = *i;
|
|
|
|
|
|
|
|
if (i != message->doc.termlist_end () &&
|
|
|
|
strncmp ((*i).c_str (), prefix, prefix_len))
|
|
|
|
{
|
|
|
|
INTERNAL_ERROR ("Message %s has duplicate In-Reply-To IDs: %s and %s\n"
|
|
|
|
notmuch_message_get_message_id (message),
|
|
|
|
message->in_reply_to,
|
|
|
|
(*i).c_str () + prefix_len);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
return message->in_reply_to;
|
2009-11-16 05:36:51 +01:00
|
|
|
}
|
|
|
|
|
2009-10-25 22:54:13 +01:00
|
|
|
const char *
|
|
|
|
notmuch_message_get_thread_id (notmuch_message_t *message)
|
|
|
|
{
|
2009-11-17 20:07:38 +01:00
|
|
|
const char *prefix = _find_prefix ("thread");
|
2009-10-25 22:54:13 +01:00
|
|
|
Xapian::TermIterator i;
|
2009-11-17 20:07:38 +01:00
|
|
|
std::string id;
|
|
|
|
|
|
|
|
/* This code is written with the assumption that "thread" has a
|
|
|
|
* single-character prefix. */
|
|
|
|
assert (strlen (prefix) == 1);
|
2009-10-25 22:54:13 +01:00
|
|
|
|
|
|
|
if (message->thread_id)
|
|
|
|
return message->thread_id;
|
|
|
|
|
|
|
|
i = message->doc.termlist_begin ();
|
2009-11-17 20:07:38 +01:00
|
|
|
i.skip_to (prefix);
|
|
|
|
|
2009-11-20 12:06:11 +01:00
|
|
|
if (i != message->doc.termlist_end ())
|
|
|
|
id = *i;
|
2009-11-17 20:07:38 +01:00
|
|
|
|
|
|
|
if (i == message->doc.termlist_end () || id[0] != *prefix)
|
2009-10-25 22:54:13 +01:00
|
|
|
INTERNAL_ERROR ("Message with document ID of %d has no thread ID.\n",
|
|
|
|
message->doc_id);
|
|
|
|
|
2009-11-17 20:07:38 +01:00
|
|
|
message->thread_id = talloc_strdup (message, id.c_str () + 1);
|
2009-10-25 22:54:13 +01:00
|
|
|
|
|
|
|
#if DEBUG_DATABASE_SANITY
|
|
|
|
i++;
|
2009-11-17 20:07:38 +01:00
|
|
|
id = *i;
|
2009-10-25 22:54:13 +01:00
|
|
|
|
2009-11-17 20:07:38 +01:00
|
|
|
if (i != message->doc.termlist_end () && id[0] == *prefix)
|
2009-10-25 22:54:13 +01:00
|
|
|
{
|
2009-10-28 20:46:50 +01:00
|
|
|
INTERNAL_ERROR ("Message %s has duplicate thread IDs: %s and %s\n",
|
|
|
|
notmuch_message_get_message_id (message),
|
|
|
|
message->thread_id,
|
2009-11-17 20:07:38 +01:00
|
|
|
id.c_str () + 1);
|
2009-10-25 22:54:13 +01:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
return message->thread_id;
|
|
|
|
}
|
|
|
|
|
2009-11-16 05:39:25 +01:00
|
|
|
void
|
|
|
|
_notmuch_message_add_reply (notmuch_message_t *message,
|
|
|
|
notmuch_message_node_t *reply)
|
|
|
|
{
|
|
|
|
_notmuch_message_list_append (message->replies, reply);
|
|
|
|
}
|
|
|
|
|
|
|
|
notmuch_messages_t *
|
|
|
|
notmuch_message_get_replies (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
return _notmuch_messages_create (message->replies);
|
|
|
|
}
|
|
|
|
|
2009-10-23 14:41:17 +02:00
|
|
|
/* Set the filename for 'message' to 'filename'.
|
|
|
|
*
|
2009-10-25 22:54:13 +01:00
|
|
|
* XXX: We should still figure out if we think it's important to store
|
|
|
|
* multiple filenames for email messages with identical message IDs.
|
2009-10-23 14:41:17 +02:00
|
|
|
*
|
|
|
|
* This change will not be reflected in the database until the next
|
|
|
|
* call to _notmuch_message_set_sync. */
|
|
|
|
void
|
|
|
|
_notmuch_message_set_filename (notmuch_message_t *message,
|
|
|
|
const char *filename)
|
|
|
|
{
|
2009-10-29 00:50:14 +01:00
|
|
|
const char *s;
|
|
|
|
const char *db_path;
|
|
|
|
unsigned int db_path_len;
|
|
|
|
|
|
|
|
if (message->filename) {
|
2009-10-23 14:41:17 +02:00
|
|
|
talloc_free (message->filename);
|
2009-10-29 00:50:14 +01:00
|
|
|
message->filename = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (filename == NULL)
|
|
|
|
INTERNAL_ERROR ("Message filename cannot be NULL.");
|
|
|
|
|
|
|
|
s = filename;
|
|
|
|
|
|
|
|
db_path = notmuch_database_get_path (message->notmuch);
|
|
|
|
db_path_len = strlen (db_path);
|
|
|
|
|
|
|
|
if (*s == '/' && strncmp (s, db_path, db_path_len) == 0
|
|
|
|
&& strlen (s) > db_path_len)
|
|
|
|
{
|
|
|
|
s += db_path_len + 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
message->doc.set_data (s);
|
2009-10-23 14:41:17 +02:00
|
|
|
}
|
|
|
|
|
2009-10-23 14:38:13 +02:00
|
|
|
const char *
|
|
|
|
notmuch_message_get_filename (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
std::string filename_str;
|
2009-10-29 00:50:14 +01:00
|
|
|
const char *db_path;
|
2009-10-23 14:38:13 +02:00
|
|
|
|
|
|
|
if (message->filename)
|
|
|
|
return message->filename;
|
|
|
|
|
|
|
|
filename_str = message->doc.get_data ();
|
2009-10-29 00:50:14 +01:00
|
|
|
db_path = notmuch_database_get_path (message->notmuch);
|
|
|
|
|
|
|
|
if (filename_str[0] != '/')
|
|
|
|
message->filename = talloc_asprintf (message, "%s/%s", db_path,
|
|
|
|
filename_str.c_str ());
|
|
|
|
else
|
|
|
|
message->filename = talloc_strdup (message, filename_str.c_str ());
|
2009-10-23 14:38:13 +02:00
|
|
|
|
|
|
|
return message->filename;
|
|
|
|
}
|
|
|
|
|
2009-10-30 00:06:27 +01:00
|
|
|
time_t
|
|
|
|
notmuch_message_get_date (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
std::string value;
|
|
|
|
|
|
|
|
try {
|
|
|
|
value = message->doc.get_value (NOTMUCH_VALUE_TIMESTAMP);
|
|
|
|
} catch (Xapian::Error &error) {
|
|
|
|
INTERNAL_ERROR ("Failed to read timestamp value from document.");
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return Xapian::sortable_unserialise (value);
|
|
|
|
}
|
|
|
|
|
2009-10-25 07:58:06 +01:00
|
|
|
notmuch_tags_t *
|
|
|
|
notmuch_message_get_tags (notmuch_message_t *message)
|
|
|
|
{
|
2009-10-26 17:13:19 +01:00
|
|
|
const char *prefix = _find_prefix ("tag");
|
|
|
|
Xapian::TermIterator i, end;
|
|
|
|
notmuch_tags_t *tags;
|
|
|
|
std::string tag;
|
|
|
|
|
|
|
|
/* Currently this iteration is written with the assumption that
|
|
|
|
* "tag" has a single-character prefix. */
|
|
|
|
assert (strlen (prefix) == 1);
|
|
|
|
|
|
|
|
tags = _notmuch_tags_create (message);
|
|
|
|
if (unlikely (tags == NULL))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
i = message->doc.termlist_begin ();
|
|
|
|
end = message->doc.termlist_end ();
|
|
|
|
|
|
|
|
i.skip_to (prefix);
|
|
|
|
|
2009-11-20 12:06:11 +01:00
|
|
|
while (i != end) {
|
2009-10-26 17:13:19 +01:00
|
|
|
tag = *i;
|
|
|
|
|
|
|
|
if (tag.empty () || tag[0] != *prefix)
|
|
|
|
break;
|
|
|
|
|
|
|
|
_notmuch_tags_add_tag (tags, tag.c_str () + 1);
|
|
|
|
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
|
2009-10-26 22:12:56 +01:00
|
|
|
_notmuch_tags_prepare_iterator (tags);
|
2009-10-26 17:13:19 +01:00
|
|
|
|
|
|
|
return tags;
|
2009-10-21 06:03:30 +02:00
|
|
|
}
|
|
|
|
|
2009-10-23 14:25:58 +02:00
|
|
|
void
|
2009-10-23 14:41:17 +02:00
|
|
|
_notmuch_message_set_date (notmuch_message_t *message,
|
|
|
|
const char *date)
|
|
|
|
{
|
|
|
|
time_t time_value;
|
|
|
|
|
2009-11-06 18:31:03 +01:00
|
|
|
/* GMime really doesn't want to see a NULL date, so protect its
|
|
|
|
* sensibilities. */
|
|
|
|
if (date == NULL)
|
|
|
|
time_value = 0;
|
|
|
|
else
|
|
|
|
time_value = g_mime_utils_header_decode_date (date, NULL);
|
2009-10-23 14:41:17 +02:00
|
|
|
|
2009-10-25 07:05:08 +01:00
|
|
|
message->doc.add_value (NOTMUCH_VALUE_TIMESTAMP,
|
2009-10-23 14:41:17 +02:00
|
|
|
Xapian::sortable_serialise (time_value));
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
2009-10-23 14:25:58 +02:00
|
|
|
thread_id_generate (thread_id_t *thread_id)
|
|
|
|
{
|
|
|
|
static int seeded = 0;
|
|
|
|
FILE *dev_random;
|
|
|
|
uint32_t value;
|
|
|
|
char *s;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (! seeded) {
|
|
|
|
dev_random = fopen ("/dev/random", "r");
|
|
|
|
if (dev_random == NULL) {
|
|
|
|
srand (time (NULL));
|
|
|
|
} else {
|
|
|
|
fread ((void *) &value, sizeof (value), 1, dev_random);
|
|
|
|
srand (value);
|
|
|
|
fclose (dev_random);
|
|
|
|
}
|
|
|
|
seeded = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
s = thread_id->str;
|
|
|
|
for (i = 0; i < NOTMUCH_THREAD_ID_DIGITS; i += 8) {
|
|
|
|
value = rand ();
|
|
|
|
sprintf (s, "%08x", value);
|
|
|
|
s += 8;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-10-23 14:41:17 +02:00
|
|
|
void
|
|
|
|
_notmuch_message_ensure_thread_id (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
/* If not part of any existing thread, generate a new thread_id. */
|
|
|
|
thread_id_t thread_id;
|
|
|
|
|
|
|
|
thread_id_generate (&thread_id);
|
|
|
|
_notmuch_message_add_term (message, "thread", thread_id.str);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Synchronize changes made to message->doc out into the database. */
|
|
|
|
void
|
2009-10-22 00:53:38 +02:00
|
|
|
_notmuch_message_sync (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
Xapian::WritableDatabase *db = message->notmuch->xapian_db;
|
|
|
|
|
|
|
|
db->replace_document (message->doc_id, message->doc);
|
|
|
|
}
|
|
|
|
|
2009-11-18 03:33:42 +01:00
|
|
|
/* Ensure that 'message' is not holding any file object open. Future
|
|
|
|
* calls to various functions will still automatically open the
|
|
|
|
* message file as needed.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
_notmuch_message_close (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
if (message->message_file) {
|
|
|
|
notmuch_message_file_close (message->message_file);
|
|
|
|
message->message_file = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-10-23 14:18:35 +02:00
|
|
|
/* Add a name:value term to 'message', (the actual term will be
|
|
|
|
* encoded by prefixing the value with a short prefix). See
|
|
|
|
* NORMAL_PREFIX and BOOLEAN_PREFIX arrays for the mapping of term
|
|
|
|
* names to prefix values.
|
|
|
|
*
|
|
|
|
* This change will not be reflected in the database until the next
|
|
|
|
* call to _notmuch_message_set_sync. */
|
2009-10-22 00:53:38 +02:00
|
|
|
notmuch_private_status_t
|
|
|
|
_notmuch_message_add_term (notmuch_message_t *message,
|
|
|
|
const char *prefix_name,
|
|
|
|
const char *value)
|
|
|
|
{
|
|
|
|
|
|
|
|
char *term;
|
|
|
|
|
|
|
|
if (value == NULL)
|
|
|
|
return NOTMUCH_PRIVATE_STATUS_NULL_POINTER;
|
|
|
|
|
|
|
|
term = talloc_asprintf (message, "%s%s",
|
|
|
|
_find_prefix (prefix_name), value);
|
|
|
|
|
|
|
|
if (strlen (term) > NOTMUCH_TERM_MAX)
|
|
|
|
return NOTMUCH_PRIVATE_STATUS_TERM_TOO_LONG;
|
|
|
|
|
|
|
|
message->doc.add_term (term);
|
|
|
|
|
|
|
|
talloc_free (term);
|
|
|
|
|
|
|
|
return NOTMUCH_PRIVATE_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2009-10-28 18:42:07 +01:00
|
|
|
/* Parse 'text' and add a term to 'message' for each parsed word. Each
|
|
|
|
* term will be added both prefixed (if prefix_name is not NULL) and
|
|
|
|
* also unprefixed). */
|
|
|
|
notmuch_private_status_t
|
|
|
|
_notmuch_message_gen_terms (notmuch_message_t *message,
|
|
|
|
const char *prefix_name,
|
|
|
|
const char *text)
|
|
|
|
{
|
|
|
|
Xapian::TermGenerator *term_gen = message->notmuch->term_gen;
|
|
|
|
|
|
|
|
if (text == NULL)
|
|
|
|
return NOTMUCH_PRIVATE_STATUS_NULL_POINTER;
|
|
|
|
|
|
|
|
term_gen->set_document (message->doc);
|
|
|
|
|
|
|
|
if (prefix_name) {
|
|
|
|
const char *prefix = _find_prefix (prefix_name);
|
|
|
|
|
|
|
|
term_gen->index_text (text, 1, prefix);
|
|
|
|
}
|
|
|
|
|
|
|
|
term_gen->index_text (text);
|
|
|
|
|
|
|
|
return NOTMUCH_PRIVATE_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2009-10-23 14:18:35 +02:00
|
|
|
/* Remove a name:value term from 'message', (the actual term will be
|
|
|
|
* encoded by prefixing the value with a short prefix). See
|
|
|
|
* NORMAL_PREFIX and BOOLEAN_PREFIX arrays for the mapping of term
|
|
|
|
* names to prefix values.
|
|
|
|
*
|
|
|
|
* This change will not be reflected in the database until the next
|
|
|
|
* call to _notmuch_message_set_sync. */
|
2009-10-22 00:53:38 +02:00
|
|
|
notmuch_private_status_t
|
|
|
|
_notmuch_message_remove_term (notmuch_message_t *message,
|
|
|
|
const char *prefix_name,
|
|
|
|
const char *value)
|
|
|
|
{
|
|
|
|
char *term;
|
|
|
|
|
|
|
|
if (value == NULL)
|
|
|
|
return NOTMUCH_PRIVATE_STATUS_NULL_POINTER;
|
|
|
|
|
|
|
|
term = talloc_asprintf (message, "%s%s",
|
|
|
|
_find_prefix (prefix_name), value);
|
|
|
|
|
|
|
|
if (strlen (term) > NOTMUCH_TERM_MAX)
|
|
|
|
return NOTMUCH_PRIVATE_STATUS_TERM_TOO_LONG;
|
|
|
|
|
2009-10-28 07:59:06 +01:00
|
|
|
try {
|
|
|
|
message->doc.remove_term (term);
|
|
|
|
} catch (const Xapian::InvalidArgumentError) {
|
|
|
|
/* We'll let the philosopher's try to wrestle with the
|
|
|
|
* question of whether failing to remove that which was not
|
|
|
|
* there in the first place is failure. For us, we'll silently
|
|
|
|
* consider it all good. */
|
|
|
|
}
|
2009-10-22 00:53:38 +02:00
|
|
|
|
|
|
|
talloc_free (term);
|
|
|
|
|
|
|
|
return NOTMUCH_PRIVATE_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
notmuch_status_t
|
|
|
|
notmuch_message_add_tag (notmuch_message_t *message, const char *tag)
|
|
|
|
{
|
|
|
|
notmuch_private_status_t status;
|
|
|
|
|
|
|
|
if (tag == NULL)
|
|
|
|
return NOTMUCH_STATUS_NULL_POINTER;
|
|
|
|
|
|
|
|
if (strlen (tag) > NOTMUCH_TAG_MAX)
|
|
|
|
return NOTMUCH_STATUS_TAG_TOO_LONG;
|
|
|
|
|
|
|
|
status = _notmuch_message_add_term (message, "tag", tag);
|
|
|
|
if (status) {
|
2009-10-25 18:22:41 +01:00
|
|
|
INTERNAL_ERROR ("_notmuch_message_add_term return unexpected value: %d\n",
|
|
|
|
status);
|
2009-10-22 00:53:38 +02:00
|
|
|
}
|
|
|
|
|
2009-10-27 06:25:45 +01:00
|
|
|
if (! message->frozen)
|
|
|
|
_notmuch_message_sync (message);
|
2009-10-23 14:18:35 +02:00
|
|
|
|
2009-10-22 00:53:38 +02:00
|
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
notmuch_status_t
|
|
|
|
notmuch_message_remove_tag (notmuch_message_t *message, const char *tag)
|
|
|
|
{
|
|
|
|
notmuch_private_status_t status;
|
|
|
|
|
|
|
|
if (tag == NULL)
|
|
|
|
return NOTMUCH_STATUS_NULL_POINTER;
|
|
|
|
|
|
|
|
if (strlen (tag) > NOTMUCH_TAG_MAX)
|
|
|
|
return NOTMUCH_STATUS_TAG_TOO_LONG;
|
|
|
|
|
|
|
|
status = _notmuch_message_remove_term (message, "tag", tag);
|
|
|
|
if (status) {
|
2009-10-25 18:22:41 +01:00
|
|
|
INTERNAL_ERROR ("_notmuch_message_remove_term return unexpected value: %d\n",
|
|
|
|
status);
|
2009-10-22 00:53:38 +02:00
|
|
|
}
|
|
|
|
|
2009-10-27 06:25:45 +01:00
|
|
|
if (! message->frozen)
|
|
|
|
_notmuch_message_sync (message);
|
2009-10-23 14:18:35 +02:00
|
|
|
|
2009-10-22 00:53:38 +02:00
|
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2009-10-27 06:25:45 +01:00
|
|
|
void
|
|
|
|
notmuch_message_remove_all_tags (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
notmuch_private_status_t status;
|
|
|
|
notmuch_tags_t *tags;
|
|
|
|
const char *tag;
|
|
|
|
|
|
|
|
for (tags = notmuch_message_get_tags (message);
|
|
|
|
notmuch_tags_has_more (tags);
|
|
|
|
notmuch_tags_advance (tags))
|
|
|
|
{
|
|
|
|
tag = notmuch_tags_get (tags);
|
|
|
|
|
|
|
|
status = _notmuch_message_remove_term (message, "tag", tag);
|
|
|
|
if (status) {
|
|
|
|
INTERNAL_ERROR ("_notmuch_message_remove_term return unexpected value: %d\n",
|
|
|
|
status);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (! message->frozen)
|
|
|
|
_notmuch_message_sync (message);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
notmuch_message_freeze (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
message->frozen++;
|
|
|
|
}
|
|
|
|
|
|
|
|
notmuch_status_t
|
|
|
|
notmuch_message_thaw (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
if (message->frozen > 0) {
|
|
|
|
message->frozen--;
|
|
|
|
if (message->frozen == 0)
|
|
|
|
_notmuch_message_sync (message);
|
|
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
|
|
} else {
|
|
|
|
return NOTMUCH_STATUS_UNBALANCED_FREEZE_THAW;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-10-21 07:24:59 +02:00
|
|
|
void
|
|
|
|
notmuch_message_destroy (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
talloc_free (message);
|
|
|
|
}
|