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
|
2016-06-02 18:26:14 +02:00
|
|
|
* along with this program. If not, see https://www.gnu.org/licenses/ .
|
2009-10-21 06:03:30 +02:00
|
|
|
*
|
|
|
|
* 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"
|
2016-06-13 03:05:50 +02:00
|
|
|
#include "message-private.h"
|
2009-10-21 06:03:30 +02:00
|
|
|
|
2009-11-17 16:28:38 +01:00
|
|
|
#include <stdint.h>
|
|
|
|
|
2009-11-02 23:36:33 +01:00
|
|
|
#include <gmime/gmime.h>
|
|
|
|
|
2011-05-11 22:23:13 +02:00
|
|
|
struct visible _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;
|
2010-12-09 07:54:34 +01:00
|
|
|
notmuch_string_list_t *tag_list;
|
2010-12-09 04:19:55 +01:00
|
|
|
notmuch_string_list_t *filename_term_list;
|
2010-12-09 01:26:05 +01:00
|
|
|
notmuch_string_list_t *filename_list;
|
2010-04-24 20:20:53 +02:00
|
|
|
char *author;
|
2009-10-27 01:35:31 +01:00
|
|
|
notmuch_message_file_t *message_file;
|
2016-06-13 03:05:48 +02:00
|
|
|
notmuch_string_list_t *property_term_list;
|
|
|
|
notmuch_string_map_t *property_map;
|
2009-11-16 05:39:25 +01:00
|
|
|
notmuch_message_list_t *replies;
|
2009-11-25 05:54:33 +01:00
|
|
|
unsigned long flags;
|
2014-10-23 14:30:36 +02:00
|
|
|
/* For flags that are initialized on-demand, lazy_flags indicates
|
|
|
|
* if each flag has been initialized. */
|
|
|
|
unsigned long lazy_flags;
|
2009-11-16 05:39:25 +01:00
|
|
|
|
2015-06-05 19:28:33 +02:00
|
|
|
/* Message document modified since last sync */
|
|
|
|
notmuch_bool_t modified;
|
|
|
|
|
2017-02-18 02:28:05 +01:00
|
|
|
/* last view of database the struct is synced with */
|
|
|
|
unsigned long last_view;
|
|
|
|
|
2009-10-21 06:03:30 +02:00
|
|
|
Xapian::Document doc;
|
2011-01-26 06:53:14 +01:00
|
|
|
Xapian::termcount termpos;
|
2009-10-21 06:03:30 +02:00
|
|
|
};
|
|
|
|
|
2010-10-31 22:29:16 +01:00
|
|
|
#define ARRAY_SIZE(arr) (sizeof (arr) / sizeof (arr[0]))
|
|
|
|
|
|
|
|
struct maildir_flag_tag {
|
|
|
|
char flag;
|
|
|
|
const char *tag;
|
2011-09-15 00:23:18 +02:00
|
|
|
notmuch_bool_t inverse;
|
2010-10-31 22:29:16 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
/* ASCII ordered table of Maildir flags and associated tags */
|
2010-11-12 05:53:21 +01:00
|
|
|
static struct maildir_flag_tag flag2tag[] = {
|
2011-09-15 00:23:18 +02:00
|
|
|
{ 'D', "draft", FALSE},
|
|
|
|
{ 'F', "flagged", FALSE},
|
|
|
|
{ 'P', "passed", FALSE},
|
|
|
|
{ 'R', "replied", FALSE},
|
|
|
|
{ 'S', "unread", TRUE }
|
2010-10-31 22:29:16 +01:00
|
|
|
};
|
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
2010-06-04 19:16:53 +02:00
|
|
|
static notmuch_message_t *
|
|
|
|
_notmuch_message_create_for_document (const void *talloc_owner,
|
|
|
|
notmuch_database_t *notmuch,
|
|
|
|
unsigned int doc_id,
|
|
|
|
Xapian::Document doc,
|
|
|
|
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-11-25 05:54:33 +01:00
|
|
|
message->flags = 0;
|
2014-10-23 14:30:36 +02:00
|
|
|
message->lazy_flags = 0;
|
2009-10-27 06:25:45 +01:00
|
|
|
|
2017-02-18 02:28:05 +01:00
|
|
|
/* the message is initially not synchronized with Xapian */
|
|
|
|
message->last_view = 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;
|
2010-12-09 07:54:34 +01:00
|
|
|
message->tag_list = NULL;
|
2010-12-09 04:19:55 +01:00
|
|
|
message->filename_term_list = NULL;
|
2010-11-11 09:07:24 +01:00
|
|
|
message->filename_list = NULL;
|
2009-10-27 01:35:31 +01:00
|
|
|
message->message_file = NULL;
|
2010-04-24 20:20:53 +02:00
|
|
|
message->author = NULL;
|
2016-06-13 03:05:48 +02:00
|
|
|
message->property_term_list = NULL;
|
|
|
|
message->property_map = 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
|
|
|
|
2010-06-04 19:16:53 +02:00
|
|
|
message->doc = doc;
|
2011-01-26 06:53:14 +01:00
|
|
|
message->termpos = 0;
|
2010-06-04 19:16:53 +02:00
|
|
|
|
|
|
|
return message;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* 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
|
2011-01-13 02:04:10 +01:00
|
|
|
* calling notmuch_message_destroy on the message, and know that all
|
|
|
|
* memory will be reclaimed when 'talloc_owner' is freed. The caller
|
2010-06-04 19:16:53 +02:00
|
|
|
* 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'
|
|
|
|
* then this function returns NULL and optionally sets *status to
|
|
|
|
* NOTMUCH_PRIVATE_STATUS_NO_DOCUMENT_FOUND.
|
|
|
|
*
|
|
|
|
* This function can also fail to due lack of available memory,
|
|
|
|
* returning NULL and optionally setting *status to
|
|
|
|
* NOTMUCH_PRIVATE_STATUS_OUT_OF_MEMORY.
|
|
|
|
*
|
|
|
|
* The caller can pass NULL for status if uninterested in
|
|
|
|
* distinguishing these two cases.
|
|
|
|
*/
|
|
|
|
notmuch_message_t *
|
|
|
|
_notmuch_message_create (const void *talloc_owner,
|
|
|
|
notmuch_database_t *notmuch,
|
|
|
|
unsigned int doc_id,
|
|
|
|
notmuch_private_status_t *status)
|
|
|
|
{
|
|
|
|
Xapian::Document doc;
|
|
|
|
|
2009-10-23 14:45:29 +02:00
|
|
|
try {
|
2010-06-04 19:16:53 +02:00
|
|
|
doc = notmuch->xapian_db->get_document (doc_id);
|
2009-10-23 14:45:29 +02:00
|
|
|
} catch (const Xapian::DocNotFoundError &error) {
|
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
|
|
|
|
2010-06-04 19:16:53 +02:00
|
|
|
return _notmuch_message_create_for_document (talloc_owner, notmuch,
|
|
|
|
doc_id, doc, status);
|
2009-10-21 06:03:30 +02:00
|
|
|
}
|
|
|
|
|
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
|
|
|
*
|
2010-06-04 19:16:53 +02:00
|
|
|
* This function returns a valid notmuch_message_t whether or not
|
|
|
|
* there is already a document in the database with the given message
|
|
|
|
* ID. These two cases can be distinguished by the value of *status:
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* NOTMUCH_PRIVATE_STATUS_SUCCESS:
|
|
|
|
*
|
|
|
|
* There is already a document with message ID 'message_id' in the
|
|
|
|
* database. The returned message can be used to query/modify the
|
2014-10-23 14:30:36 +02:00
|
|
|
* document. The message may be a ghost message.
|
2014-08-05 03:29:16 +02:00
|
|
|
*
|
2010-06-04 19:16:53 +02:00
|
|
|
* NOTMUCH_PRIVATE_STATUS_NO_DOCUMENT_FOUND:
|
|
|
|
*
|
|
|
|
* No document with 'message_id' exists in the database. The
|
|
|
|
* returned message contains a newly created document (not yet
|
|
|
|
* added to the database) and a document ID that is known not to
|
2014-08-05 03:29:16 +02:00
|
|
|
* exist in the database. This message is "blank"; that is, it
|
|
|
|
* contains only a message ID and no other metadata. The caller
|
|
|
|
* can modify the message, and a call to _notmuch_message_sync
|
|
|
|
* will add the document to the database.
|
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;
|
|
|
|
|
2011-10-04 06:55:29 +02:00
|
|
|
*status_ret = (notmuch_private_status_t) notmuch_database_find_message (notmuch,
|
|
|
|
message_id,
|
|
|
|
&message);
|
2009-10-23 14:53:52 +02:00
|
|
|
if (message)
|
2009-11-17 20:02:33 +01:00
|
|
|
return talloc_steal (notmuch, message);
|
2011-10-04 06:55:29 +02:00
|
|
|
else if (*status_ret)
|
|
|
|
return NULL;
|
2009-10-23 14:53:52 +02:00
|
|
|
|
2014-10-07 01:17:07 +02:00
|
|
|
/* If the message ID is too long, substitute its sha1 instead. */
|
|
|
|
if (strlen (message_id) > NOTMUCH_MESSAGE_ID_MAX)
|
|
|
|
message_id = _notmuch_message_id_compressed (message, message_id);
|
|
|
|
|
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
|
|
|
|
2010-01-07 19:19:44 +01:00
|
|
|
if (notmuch->mode == NOTMUCH_DATABASE_MODE_READ_ONLY)
|
|
|
|
INTERNAL_ERROR ("Failure to ensure database is writable.");
|
|
|
|
|
2009-10-25 17:47:21 +01:00
|
|
|
try {
|
2010-01-09 20:18:27 +01:00
|
|
|
doc.add_term (term, 0);
|
2009-10-25 17:47:21 +01:00
|
|
|
talloc_free (term);
|
|
|
|
|
|
|
|
doc.add_value (NOTMUCH_VALUE_MESSAGE_ID, message_id);
|
|
|
|
|
2010-06-04 19:16:53 +02:00
|
|
|
doc_id = _notmuch_database_generate_doc_id (notmuch);
|
2009-10-25 17:47:21 +01:00
|
|
|
} catch (const Xapian::Error &error) {
|
2014-12-26 17:25:35 +01:00
|
|
|
_notmuch_database_log(_notmuch_message_database (message), "A Xapian exception occurred creating message: %s\n",
|
2009-11-22 03:52:55 +01:00
|
|
|
error.get_msg().c_str());
|
2009-11-22 03:54:20 +01:00
|
|
|
notmuch->exception_reported = TRUE;
|
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
|
|
|
|
2010-06-04 19:16:53 +02:00
|
|
|
message = _notmuch_message_create_for_document (notmuch, notmuch,
|
|
|
|
doc_id, doc, 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
|
|
|
}
|
|
|
|
|
2010-11-27 05:34:29 +01:00
|
|
|
static char *
|
|
|
|
_notmuch_message_get_term (notmuch_message_t *message,
|
|
|
|
Xapian::TermIterator &i, Xapian::TermIterator &end,
|
|
|
|
const char *prefix)
|
2009-10-21 06:03:30 +02:00
|
|
|
{
|
2010-11-27 05:34:29 +01:00
|
|
|
int prefix_len = strlen (prefix);
|
|
|
|
char *value;
|
2009-10-21 06:03:30 +02:00
|
|
|
|
2010-11-27 05:34:29 +01:00
|
|
|
i.skip_to (prefix);
|
2009-10-22 00:42:54 +02:00
|
|
|
|
2013-05-02 16:31:42 +02:00
|
|
|
if (i == end)
|
|
|
|
return NULL;
|
2009-10-22 00:42:54 +02:00
|
|
|
|
2015-01-02 17:18:42 +01:00
|
|
|
const std::string &term = *i;
|
2013-05-02 16:31:42 +02:00
|
|
|
if (strncmp (term.c_str(), prefix, prefix_len))
|
2010-11-27 05:34:29 +01:00
|
|
|
return NULL;
|
2009-10-22 00:42:54 +02:00
|
|
|
|
2013-05-02 16:31:42 +02:00
|
|
|
value = talloc_strdup (message, term.c_str() + prefix_len);
|
2009-10-25 22:54:13 +01:00
|
|
|
|
|
|
|
#if DEBUG_DATABASE_SANITY
|
|
|
|
i++;
|
|
|
|
|
2010-11-27 05:34:29 +01:00
|
|
|
if (i != end && strncmp ((*i).c_str (), prefix, prefix_len) == 0) {
|
|
|
|
INTERNAL_ERROR ("Mail (doc_id: %d) has duplicate %s terms: %s and %s\n",
|
|
|
|
message->doc_id, prefix, value,
|
|
|
|
(*i).c_str () + prefix_len);
|
2009-10-25 22:54:13 +01:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2010-11-27 05:34:29 +01:00
|
|
|
return value;
|
|
|
|
}
|
|
|
|
|
2017-02-18 15:45:44 +01:00
|
|
|
static void
|
2017-02-24 19:33:07 +01:00
|
|
|
_notmuch_message_ensure_metadata (notmuch_message_t *message, void *field)
|
2010-11-27 05:34:29 +01:00
|
|
|
{
|
|
|
|
Xapian::TermIterator i, end;
|
2017-02-18 02:28:05 +01:00
|
|
|
|
2017-02-24 19:33:07 +01:00
|
|
|
if (field && (message->last_view >= message->notmuch->view))
|
|
|
|
return;
|
|
|
|
|
2010-11-27 05:34:29 +01:00
|
|
|
const char *thread_prefix = _find_prefix ("thread"),
|
2010-12-09 07:54:34 +01:00
|
|
|
*tag_prefix = _find_prefix ("tag"),
|
2010-11-27 05:34:29 +01:00
|
|
|
*id_prefix = _find_prefix ("id"),
|
2014-10-23 14:30:36 +02:00
|
|
|
*type_prefix = _find_prefix ("type"),
|
2010-12-09 04:19:55 +01:00
|
|
|
*filename_prefix = _find_prefix ("file-direntry"),
|
2016-06-13 03:05:48 +02:00
|
|
|
*property_prefix = _find_prefix ("property"),
|
2010-11-27 05:34:29 +01:00
|
|
|
*replyto_prefix = _find_prefix ("replyto");
|
|
|
|
|
|
|
|
/* We do this all in a single pass because Xapian decompresses the
|
|
|
|
* term list every time you iterate over it. Thus, while this is
|
|
|
|
* slightly more costly than looking up individual fields if only
|
|
|
|
* one field of the message object is actually used, it's a huge
|
|
|
|
* win as more fields are used. */
|
2017-02-18 02:28:05 +01:00
|
|
|
for (int count=0; count < 3; count++) {
|
|
|
|
try {
|
|
|
|
i = message->doc.termlist_begin ();
|
|
|
|
end = message->doc.termlist_end ();
|
|
|
|
|
|
|
|
/* Get thread */
|
|
|
|
if (!message->thread_id)
|
|
|
|
message->thread_id =
|
|
|
|
_notmuch_message_get_term (message, i, end, thread_prefix);
|
|
|
|
|
|
|
|
/* Get tags */
|
|
|
|
assert (strcmp (thread_prefix, tag_prefix) < 0);
|
|
|
|
if (!message->tag_list) {
|
|
|
|
message->tag_list =
|
|
|
|
_notmuch_database_get_terms_with_prefix (message, i, end,
|
|
|
|
tag_prefix);
|
|
|
|
_notmuch_string_list_sort (message->tag_list);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Get id */
|
|
|
|
assert (strcmp (tag_prefix, id_prefix) < 0);
|
|
|
|
if (!message->message_id)
|
|
|
|
message->message_id =
|
|
|
|
_notmuch_message_get_term (message, i, end, id_prefix);
|
|
|
|
|
|
|
|
/* Get document type */
|
|
|
|
assert (strcmp (id_prefix, type_prefix) < 0);
|
|
|
|
if (! NOTMUCH_TEST_BIT (message->lazy_flags, NOTMUCH_MESSAGE_FLAG_GHOST)) {
|
|
|
|
i.skip_to (type_prefix);
|
|
|
|
/* "T" is the prefix "type" fields. See
|
|
|
|
* BOOLEAN_PREFIX_INTERNAL. */
|
|
|
|
if (*i == "Tmail")
|
|
|
|
NOTMUCH_CLEAR_BIT (&message->flags, NOTMUCH_MESSAGE_FLAG_GHOST);
|
|
|
|
else if (*i == "Tghost")
|
|
|
|
NOTMUCH_SET_BIT (&message->flags, NOTMUCH_MESSAGE_FLAG_GHOST);
|
|
|
|
else
|
|
|
|
INTERNAL_ERROR ("Message without type term");
|
|
|
|
NOTMUCH_SET_BIT (&message->lazy_flags, NOTMUCH_MESSAGE_FLAG_GHOST);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Get filename list. Here we get only the terms. We lazily
|
|
|
|
* expand them to full file names when needed in
|
|
|
|
* _notmuch_message_ensure_filename_list. */
|
|
|
|
assert (strcmp (type_prefix, filename_prefix) < 0);
|
|
|
|
if (!message->filename_term_list && !message->filename_list)
|
|
|
|
message->filename_term_list =
|
|
|
|
_notmuch_database_get_terms_with_prefix (message, i, end,
|
|
|
|
filename_prefix);
|
|
|
|
|
|
|
|
|
|
|
|
/* Get property terms. Mimic the setup with filenames above */
|
|
|
|
assert (strcmp (filename_prefix, property_prefix) < 0);
|
|
|
|
if (!message->property_map && !message->property_term_list)
|
|
|
|
message->property_term_list =
|
|
|
|
_notmuch_database_get_terms_with_prefix (message, i, end,
|
|
|
|
property_prefix);
|
|
|
|
|
|
|
|
/* Get reply to */
|
|
|
|
assert (strcmp (property_prefix, replyto_prefix) < 0);
|
|
|
|
if (!message->in_reply_to)
|
|
|
|
message->in_reply_to =
|
|
|
|
_notmuch_message_get_term (message, i, end, replyto_prefix);
|
|
|
|
|
|
|
|
|
|
|
|
/* It's perfectly valid for a message to have no In-Reply-To
|
|
|
|
* header. For these cases, we return an empty string. */
|
|
|
|
if (!message->in_reply_to)
|
|
|
|
message->in_reply_to = talloc_strdup (message, "");
|
|
|
|
|
|
|
|
/* all the way without an exception */
|
|
|
|
break;
|
|
|
|
} catch (const Xapian::DatabaseModifiedError &error) {
|
|
|
|
notmuch_status_t status = _notmuch_database_reopen (message->notmuch);
|
|
|
|
if (status != NOTMUCH_STATUS_SUCCESS)
|
|
|
|
INTERNAL_ERROR ("unhandled error from notmuch_database_reopen: %s\n",
|
|
|
|
notmuch_status_to_string (status));
|
|
|
|
} catch (const Xapian::Error &error) {
|
|
|
|
INTERNAL_ERROR ("A Xapian exception occurred fetching message metadata: %s\n",
|
|
|
|
error.get_msg().c_str());
|
|
|
|
}
|
2010-12-09 07:54:34 +01:00
|
|
|
}
|
2017-02-18 02:28:05 +01:00
|
|
|
message->last_view = message->notmuch->view;
|
2010-11-27 05:34:29 +01:00
|
|
|
}
|
|
|
|
|
2016-06-13 03:05:50 +02:00
|
|
|
void
|
2010-11-27 05:34:29 +01:00
|
|
|
_notmuch_message_invalidate_metadata (notmuch_message_t *message,
|
|
|
|
const char *prefix_name)
|
|
|
|
{
|
|
|
|
if (strcmp ("thread", prefix_name) == 0) {
|
|
|
|
talloc_free (message->thread_id);
|
|
|
|
message->thread_id = NULL;
|
|
|
|
}
|
|
|
|
|
2010-12-09 07:54:34 +01:00
|
|
|
if (strcmp ("tag", prefix_name) == 0) {
|
|
|
|
talloc_unlink (message, message->tag_list);
|
|
|
|
message->tag_list = NULL;
|
|
|
|
}
|
|
|
|
|
2014-10-23 14:30:36 +02:00
|
|
|
if (strcmp ("type", prefix_name) == 0) {
|
|
|
|
NOTMUCH_CLEAR_BIT (&message->flags, NOTMUCH_MESSAGE_FLAG_GHOST);
|
|
|
|
NOTMUCH_CLEAR_BIT (&message->lazy_flags, NOTMUCH_MESSAGE_FLAG_GHOST);
|
|
|
|
}
|
|
|
|
|
2010-12-09 04:19:55 +01:00
|
|
|
if (strcmp ("file-direntry", prefix_name) == 0) {
|
|
|
|
talloc_free (message->filename_term_list);
|
|
|
|
talloc_free (message->filename_list);
|
|
|
|
message->filename_term_list = message->filename_list = NULL;
|
|
|
|
}
|
|
|
|
|
2016-06-13 03:05:48 +02:00
|
|
|
if (strcmp ("property", prefix_name) == 0) {
|
|
|
|
|
|
|
|
if (message->property_term_list)
|
|
|
|
talloc_free (message->property_term_list);
|
|
|
|
message->property_term_list = NULL;
|
|
|
|
|
|
|
|
if (message->property_map)
|
|
|
|
talloc_unlink (message, message->property_map);
|
|
|
|
|
|
|
|
message->property_map = NULL;
|
|
|
|
}
|
|
|
|
|
2010-11-27 05:34:29 +01:00
|
|
|
if (strcmp ("replyto", prefix_name) == 0) {
|
|
|
|
talloc_free (message->in_reply_to);
|
|
|
|
message->in_reply_to = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned int
|
|
|
|
_notmuch_message_get_doc_id (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
return message->doc_id;
|
|
|
|
}
|
|
|
|
|
|
|
|
const char *
|
|
|
|
notmuch_message_get_message_id (notmuch_message_t *message)
|
|
|
|
{
|
2017-02-24 19:33:07 +01:00
|
|
|
_notmuch_message_ensure_metadata (message, message->message_id);
|
2010-11-27 05:34:29 +01:00
|
|
|
if (!message->message_id)
|
|
|
|
INTERNAL_ERROR ("Message with document ID of %u has no message ID.\n",
|
|
|
|
message->doc_id);
|
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
|
|
|
|
2014-12-26 18:34:49 +01:00
|
|
|
message->message_file = _notmuch_message_file_open_ctx (
|
|
|
|
_notmuch_message_database (message), message, filename);
|
2009-10-29 16:51:12 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
const char *
|
|
|
|
notmuch_message_get_header (notmuch_message_t *message, const char *header)
|
|
|
|
{
|
2014-08-25 19:26:07 +02:00
|
|
|
Xapian::valueno slot = Xapian::BAD_VALUENO;
|
|
|
|
|
|
|
|
/* Fetch header from the appropriate xapian value field if
|
|
|
|
* available */
|
|
|
|
if (strcasecmp (header, "from") == 0)
|
|
|
|
slot = NOTMUCH_VALUE_FROM;
|
|
|
|
else if (strcasecmp (header, "subject") == 0)
|
|
|
|
slot = NOTMUCH_VALUE_SUBJECT;
|
|
|
|
else if (strcasecmp (header, "message-id") == 0)
|
|
|
|
slot = NOTMUCH_VALUE_MESSAGE_ID;
|
|
|
|
|
|
|
|
if (slot != Xapian::BAD_VALUENO) {
|
|
|
|
try {
|
|
|
|
std::string value = message->doc.get_value (slot);
|
|
|
|
|
|
|
|
/* If we have NOTMUCH_FEATURE_FROM_SUBJECT_ID_VALUES, then
|
|
|
|
* empty values indicate empty headers. If we don't, then
|
|
|
|
* it could just mean we didn't record the header. */
|
|
|
|
if ((message->notmuch->features &
|
|
|
|
NOTMUCH_FEATURE_FROM_SUBJECT_ID_VALUES) ||
|
|
|
|
! value.empty())
|
2013-11-19 06:10:31 +01:00
|
|
|
return talloc_strdup (message, value.c_str ());
|
|
|
|
|
2014-08-25 19:26:07 +02:00
|
|
|
} catch (Xapian::Error &error) {
|
2014-12-26 17:25:35 +01:00
|
|
|
_notmuch_database_log(_notmuch_message_database (message), "A Xapian exception occurred when reading header: %s\n",
|
2014-08-25 19:26:07 +02:00
|
|
|
error.get_msg().c_str());
|
|
|
|
message->notmuch->exception_reported = TRUE;
|
|
|
|
return NULL;
|
|
|
|
}
|
2013-11-19 06:10:31 +01:00
|
|
|
}
|
2011-11-06 18:17:36 +01:00
|
|
|
|
|
|
|
/* Otherwise fall back to parsing the file */
|
2009-10-29 16:51:12 +01:00
|
|
|
_notmuch_message_ensure_message_file (message);
|
|
|
|
if (message->message_file == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
2014-05-13 11:44:05 +02:00
|
|
|
return _notmuch_message_file_get_header (message->message_file, header);
|
2009-10-29 16:51:12 +01:00
|
|
|
}
|
|
|
|
|
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)
|
|
|
|
{
|
2017-02-24 19:33:07 +01:00
|
|
|
_notmuch_message_ensure_metadata (message, message->in_reply_to);
|
2009-11-18 02:40:19 +01:00
|
|
|
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)
|
|
|
|
{
|
2017-02-24 19:33:07 +01:00
|
|
|
_notmuch_message_ensure_metadata (message, message->thread_id);
|
2010-11-27 05:34:29 +01:00
|
|
|
if (!message->thread_id)
|
|
|
|
INTERNAL_ERROR ("Message with document ID of %u has no thread ID.\n",
|
2009-10-25 22:54:13 +01:00
|
|
|
message->doc_id);
|
|
|
|
return message->thread_id;
|
|
|
|
}
|
|
|
|
|
2009-11-16 05:39:25 +01:00
|
|
|
void
|
|
|
|
_notmuch_message_add_reply (notmuch_message_t *message,
|
2012-11-25 05:57:03 +01:00
|
|
|
notmuch_message_t *reply)
|
2009-11-16 05:39:25 +01:00
|
|
|
{
|
2012-11-25 05:57:03 +01:00
|
|
|
_notmuch_message_list_add_message (message->replies, reply);
|
2009-11-16 05:39:25 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
notmuch_messages_t *
|
|
|
|
notmuch_message_get_replies (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
return _notmuch_messages_create (message->replies);
|
|
|
|
}
|
|
|
|
|
2016-06-13 03:05:50 +02:00
|
|
|
void
|
2014-02-08 18:48:16 +01:00
|
|
|
_notmuch_message_remove_terms (notmuch_message_t *message, const char *prefix)
|
|
|
|
{
|
|
|
|
Xapian::TermIterator i;
|
|
|
|
size_t prefix_len = strlen (prefix);
|
|
|
|
|
|
|
|
while (1) {
|
|
|
|
i = message->doc.termlist_begin ();
|
|
|
|
i.skip_to (prefix);
|
|
|
|
|
|
|
|
/* Terminate loop when no terms remain with desired prefix. */
|
|
|
|
if (i == message->doc.termlist_end () ||
|
|
|
|
strncmp ((*i).c_str (), prefix, prefix_len))
|
|
|
|
break;
|
|
|
|
|
|
|
|
try {
|
|
|
|
message->doc.remove_term ((*i));
|
2015-06-05 19:28:33 +02:00
|
|
|
message->modified = TRUE;
|
2014-02-08 18:48:16 +01:00
|
|
|
} catch (const Xapian::InvalidArgumentError) {
|
|
|
|
/* Ignore failure to remove non-existent term. */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-02-08 20:20:42 +01:00
|
|
|
/* Return true if p points at "new" or "cur". */
|
|
|
|
static bool is_maildir (const char *p)
|
|
|
|
{
|
|
|
|
return strcmp (p, "cur") == 0 || strcmp (p, "new") == 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Add "folder:" term for directory. */
|
|
|
|
static notmuch_status_t
|
|
|
|
_notmuch_message_add_folder_terms (notmuch_message_t *message,
|
|
|
|
const char *directory)
|
|
|
|
{
|
|
|
|
char *folder, *last;
|
|
|
|
|
|
|
|
folder = talloc_strdup (NULL, directory);
|
|
|
|
if (! folder)
|
|
|
|
return NOTMUCH_STATUS_OUT_OF_MEMORY;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If the message file is in a leaf directory named "new" or
|
|
|
|
* "cur", presume maildir and index the parent directory. Thus a
|
|
|
|
* "folder:" prefix search matches messages in the specified
|
|
|
|
* maildir folder, i.e. in the specified directory and its "new"
|
|
|
|
* and "cur" subdirectories.
|
|
|
|
*
|
|
|
|
* Note that this means the "folder:" prefix can't be used for
|
|
|
|
* distinguishing between message files in "new" or "cur". The
|
|
|
|
* "path:" prefix needs to be used for that.
|
|
|
|
*
|
|
|
|
* Note the deliberate difference to _filename_is_in_maildir(). We
|
|
|
|
* don't want to index different things depending on the existence
|
|
|
|
* or non-existence of all maildir sibling directories "new",
|
|
|
|
* "cur", and "tmp". Doing so would be surprising, and difficult
|
|
|
|
* for the user to fix in case all subdirectories were not in
|
|
|
|
* place during indexing.
|
|
|
|
*/
|
|
|
|
last = strrchr (folder, '/');
|
|
|
|
if (last) {
|
|
|
|
if (is_maildir (last + 1))
|
|
|
|
*last = '\0';
|
|
|
|
} else if (is_maildir (folder)) {
|
|
|
|
*folder = '\0';
|
|
|
|
}
|
|
|
|
|
|
|
|
_notmuch_message_add_term (message, "folder", folder);
|
|
|
|
|
|
|
|
talloc_free (folder);
|
|
|
|
|
|
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2014-02-08 19:50:44 +01:00
|
|
|
#define RECURSIVE_SUFFIX "/**"
|
|
|
|
|
|
|
|
/* Add "path:" terms for directory. */
|
|
|
|
static notmuch_status_t
|
|
|
|
_notmuch_message_add_path_terms (notmuch_message_t *message,
|
|
|
|
const char *directory)
|
|
|
|
{
|
|
|
|
/* Add exact "path:" term. */
|
|
|
|
_notmuch_message_add_term (message, "path", directory);
|
|
|
|
|
|
|
|
if (strlen (directory)) {
|
|
|
|
char *path, *p;
|
|
|
|
|
|
|
|
path = talloc_asprintf (NULL, "%s%s", directory, RECURSIVE_SUFFIX);
|
|
|
|
if (! path)
|
|
|
|
return NOTMUCH_STATUS_OUT_OF_MEMORY;
|
|
|
|
|
|
|
|
/* Add recursive "path:" terms for directory and all parents. */
|
|
|
|
for (p = path + strlen (path) - 1; p > path; p--) {
|
|
|
|
if (*p == '/') {
|
|
|
|
strcpy (p, RECURSIVE_SUFFIX);
|
|
|
|
_notmuch_message_add_term (message, "path", path);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
talloc_free (path);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Recursive all-matching path:** for consistency. */
|
|
|
|
_notmuch_message_add_term (message, "path", "**");
|
|
|
|
|
|
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2014-02-08 18:48:16 +01:00
|
|
|
/* Add directory based terms for all filenames of the message. */
|
|
|
|
static notmuch_status_t
|
|
|
|
_notmuch_message_add_directory_terms (void *ctx, notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
const char *direntry_prefix = _find_prefix ("file-direntry");
|
|
|
|
int direntry_prefix_len = strlen (direntry_prefix);
|
|
|
|
Xapian::TermIterator i = message->doc.termlist_begin ();
|
|
|
|
notmuch_status_t status = NOTMUCH_STATUS_SUCCESS;
|
|
|
|
|
|
|
|
for (i.skip_to (direntry_prefix); i != message->doc.termlist_end (); i++) {
|
|
|
|
unsigned int directory_id;
|
|
|
|
const char *direntry, *directory;
|
|
|
|
char *colon;
|
2015-01-02 17:18:42 +01:00
|
|
|
const std::string &term = *i;
|
2014-02-08 18:48:16 +01:00
|
|
|
|
|
|
|
/* Terminate loop at first term without desired prefix. */
|
2014-12-28 11:45:08 +01:00
|
|
|
if (strncmp (term.c_str (), direntry_prefix, direntry_prefix_len))
|
2014-02-08 18:48:16 +01:00
|
|
|
break;
|
|
|
|
|
|
|
|
/* Indicate that there are filenames remaining. */
|
|
|
|
status = NOTMUCH_STATUS_DUPLICATE_MESSAGE_ID;
|
|
|
|
|
2014-12-28 11:45:08 +01:00
|
|
|
direntry = term.c_str ();
|
2014-02-08 18:48:16 +01:00
|
|
|
direntry += direntry_prefix_len;
|
|
|
|
|
|
|
|
directory_id = strtol (direntry, &colon, 10);
|
|
|
|
|
|
|
|
if (colon == NULL || *colon != ':')
|
|
|
|
INTERNAL_ERROR ("malformed direntry");
|
|
|
|
|
|
|
|
directory = _notmuch_database_get_directory_path (ctx,
|
|
|
|
message->notmuch,
|
|
|
|
directory_id);
|
2014-02-08 19:50:44 +01:00
|
|
|
|
2014-02-08 20:20:42 +01:00
|
|
|
_notmuch_message_add_folder_terms (message, directory);
|
2014-02-08 19:50:44 +01:00
|
|
|
_notmuch_message_add_path_terms (message, directory);
|
2014-02-08 18:48:16 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
2009-12-21 21:08:46 +01:00
|
|
|
/* Add an additional 'filename' for 'message'.
|
2009-10-23 14:41:17 +02:00
|
|
|
*
|
|
|
|
* This change will not be reflected in the database until the next
|
2010-06-04 18:54:46 +02:00
|
|
|
* call to _notmuch_message_sync. */
|
2009-12-21 17:23:26 +01:00
|
|
|
notmuch_status_t
|
2009-12-21 21:08:46 +01:00
|
|
|
_notmuch_message_add_filename (notmuch_message_t *message,
|
2009-10-23 14:41:17 +02:00
|
|
|
const char *filename)
|
|
|
|
{
|
2011-01-15 23:09:04 +01:00
|
|
|
const char *relative, *directory;
|
2009-12-21 17:23:26 +01:00
|
|
|
notmuch_status_t status;
|
|
|
|
void *local = talloc_new (message);
|
2009-12-22 00:09:56 +01:00
|
|
|
char *direntry;
|
2009-10-29 00:50:14 +01:00
|
|
|
|
2011-01-15 23:09:04 +01:00
|
|
|
if (filename == NULL)
|
|
|
|
INTERNAL_ERROR ("Message filename cannot be NULL.");
|
|
|
|
|
2014-08-25 19:26:08 +02:00
|
|
|
if (! (message->notmuch->features & NOTMUCH_FEATURE_FILE_TERMS) ||
|
|
|
|
! (message->notmuch->features & NOTMUCH_FEATURE_BOOL_FOLDER))
|
|
|
|
return NOTMUCH_STATUS_UPGRADE_REQUIRED;
|
|
|
|
|
2011-01-15 23:09:04 +01:00
|
|
|
relative = _notmuch_database_relative_path (message->notmuch, filename);
|
|
|
|
|
|
|
|
status = _notmuch_database_split_path (local, relative, &directory, NULL);
|
|
|
|
if (status)
|
|
|
|
return status;
|
2009-10-29 00:50:14 +01:00
|
|
|
|
2012-05-18 06:13:36 +02:00
|
|
|
status = _notmuch_database_filename_to_direntry (
|
|
|
|
local, message->notmuch, filename, NOTMUCH_FIND_CREATE, &direntry);
|
2009-12-21 17:23:26 +01:00
|
|
|
if (status)
|
|
|
|
return status;
|
|
|
|
|
2011-01-15 23:09:04 +01:00
|
|
|
/* New file-direntry allows navigating to this message with
|
|
|
|
* notmuch_directory_get_child_files() . */
|
2010-01-05 22:29:23 +01:00
|
|
|
_notmuch_message_add_term (message, "file-direntry", direntry);
|
2009-12-21 17:23:26 +01:00
|
|
|
|
2014-02-08 20:20:42 +01:00
|
|
|
_notmuch_message_add_folder_terms (message, directory);
|
2014-02-08 19:50:44 +01:00
|
|
|
_notmuch_message_add_path_terms (message, directory);
|
|
|
|
|
2009-12-21 17:23:26 +01:00
|
|
|
talloc_free (local);
|
|
|
|
|
|
|
|
return NOTMUCH_STATUS_SUCCESS;
|
2009-10-23 14:41:17 +02:00
|
|
|
}
|
|
|
|
|
2011-01-15 23:09:04 +01:00
|
|
|
/* Remove a particular 'filename' from 'message'.
|
2010-11-12 01:36:02 +01:00
|
|
|
*
|
|
|
|
* This change will not be reflected in the database until the next
|
|
|
|
* call to _notmuch_message_sync.
|
2011-01-15 23:09:04 +01:00
|
|
|
*
|
2011-02-06 10:17:49 +01:00
|
|
|
* If this message still has other filenames, returns
|
|
|
|
* NOTMUCH_STATUS_DUPLICATE_MESSAGE_ID.
|
|
|
|
*
|
2011-01-15 23:09:04 +01:00
|
|
|
* Note: This function does not remove a document from the database,
|
|
|
|
* even if the specified filename is the only filename for this
|
|
|
|
* message. For that functionality, see
|
2016-01-15 20:02:38 +01:00
|
|
|
* notmuch_database_remove_message. */
|
2011-01-15 23:09:04 +01:00
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_message_remove_filename (notmuch_message_t *message,
|
|
|
|
const char *filename)
|
2010-11-12 01:36:02 +01:00
|
|
|
{
|
|
|
|
void *local = talloc_new (message);
|
|
|
|
char *direntry;
|
|
|
|
notmuch_private_status_t private_status;
|
|
|
|
notmuch_status_t status;
|
|
|
|
|
2014-08-25 19:26:08 +02:00
|
|
|
if (! (message->notmuch->features & NOTMUCH_FEATURE_FILE_TERMS) ||
|
|
|
|
! (message->notmuch->features & NOTMUCH_FEATURE_BOOL_FOLDER))
|
|
|
|
return NOTMUCH_STATUS_UPGRADE_REQUIRED;
|
|
|
|
|
2012-05-18 06:13:36 +02:00
|
|
|
status = _notmuch_database_filename_to_direntry (
|
2012-05-18 06:13:42 +02:00
|
|
|
local, message->notmuch, filename, NOTMUCH_FIND_LOOKUP, &direntry);
|
|
|
|
if (status || !direntry)
|
2010-11-12 01:36:02 +01:00
|
|
|
return status;
|
|
|
|
|
2011-01-15 23:09:04 +01:00
|
|
|
/* Unlink this file from its parent directory. */
|
2010-11-12 01:36:02 +01:00
|
|
|
private_status = _notmuch_message_remove_term (message,
|
|
|
|
"file-direntry", direntry);
|
|
|
|
status = COERCE_STATUS (private_status,
|
|
|
|
"Unexpected error from _notmuch_message_remove_term");
|
2011-06-10 21:58:18 +02:00
|
|
|
if (status)
|
|
|
|
return status;
|
2010-11-12 01:36:02 +01:00
|
|
|
|
2014-02-08 19:50:44 +01:00
|
|
|
/* Re-synchronize "folder:" and "path:" terms for this message. */
|
2011-06-29 22:04:45 +02:00
|
|
|
|
2014-02-08 19:50:44 +01:00
|
|
|
/* Remove all "folder:" terms. */
|
2014-02-08 20:20:42 +01:00
|
|
|
_notmuch_message_remove_terms (message, _find_prefix ("folder"));
|
2011-06-29 22:04:45 +02:00
|
|
|
|
2014-02-08 19:50:44 +01:00
|
|
|
/* Remove all "path:" terms. */
|
|
|
|
_notmuch_message_remove_terms (message, _find_prefix ("path"));
|
|
|
|
|
|
|
|
/* Add back terms for all remaining filenames of the message. */
|
2014-02-08 18:48:16 +01:00
|
|
|
status = _notmuch_message_add_directory_terms (local, message);
|
2011-01-15 23:09:04 +01:00
|
|
|
|
2010-11-12 01:36:02 +01:00
|
|
|
talloc_free (local);
|
|
|
|
|
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
2014-02-08 20:20:42 +01:00
|
|
|
/* Upgrade the "folder:" prefix from V1 to V2. */
|
|
|
|
#define FOLDER_PREFIX_V1 "XFOLDER"
|
|
|
|
#define ZFOLDER_PREFIX_V1 "Z" FOLDER_PREFIX_V1
|
|
|
|
void
|
|
|
|
_notmuch_message_upgrade_folder (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
/* Remove all old "folder:" terms. */
|
|
|
|
_notmuch_message_remove_terms (message, FOLDER_PREFIX_V1);
|
|
|
|
|
|
|
|
/* Remove all old "folder:" stemmed terms. */
|
|
|
|
_notmuch_message_remove_terms (message, ZFOLDER_PREFIX_V1);
|
|
|
|
|
|
|
|
/* Add new boolean "folder:" and "path:" terms. */
|
|
|
|
_notmuch_message_add_directory_terms (message, message);
|
|
|
|
}
|
|
|
|
|
2010-01-09 20:13:12 +01:00
|
|
|
char *
|
|
|
|
_notmuch_message_talloc_copy_data (notmuch_message_t *message)
|
2010-01-08 03:26:31 +01:00
|
|
|
{
|
2010-01-09 20:13:12 +01:00
|
|
|
return talloc_strdup (message, message->doc.get_data ().c_str ());
|
|
|
|
}
|
2010-01-08 03:26:31 +01:00
|
|
|
|
2010-01-09 20:13:12 +01:00
|
|
|
void
|
|
|
|
_notmuch_message_clear_data (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
message->doc.set_data ("");
|
2015-06-05 19:28:33 +02:00
|
|
|
message->modified = TRUE;
|
2010-01-08 03:26:31 +01:00
|
|
|
}
|
|
|
|
|
2010-11-11 09:07:24 +01:00
|
|
|
static void
|
|
|
|
_notmuch_message_ensure_filename_list (notmuch_message_t *message)
|
2009-10-23 14:38:13 +02:00
|
|
|
{
|
2010-12-09 04:19:55 +01:00
|
|
|
notmuch_string_node_t *node;
|
2009-10-23 14:38:13 +02:00
|
|
|
|
2010-11-11 09:07:24 +01:00
|
|
|
if (message->filename_list)
|
|
|
|
return;
|
|
|
|
|
2017-02-24 19:33:07 +01:00
|
|
|
_notmuch_message_ensure_metadata (message, message->filename_term_list);
|
2009-10-23 14:38:13 +02:00
|
|
|
|
2010-12-09 04:19:55 +01:00
|
|
|
message->filename_list = _notmuch_string_list_create (message);
|
|
|
|
node = message->filename_term_list->head;
|
2009-12-21 17:23:26 +01:00
|
|
|
|
2010-12-09 04:19:55 +01:00
|
|
|
if (!node) {
|
2010-01-07 18:22:34 +01:00
|
|
|
/* A message document created by an old version of notmuch
|
|
|
|
* (prior to rename support) will have the filename in the
|
2010-01-08 03:26:31 +01:00
|
|
|
* data of the document rather than as a file-direntry term.
|
|
|
|
*
|
|
|
|
* It would be nice to do the upgrade of the document directly
|
|
|
|
* here, but the database is likely open in read-only mode. */
|
2010-01-07 18:22:34 +01:00
|
|
|
|
2017-03-17 23:28:48 +01:00
|
|
|
std::string datastr = message->doc.get_data ();
|
|
|
|
const char *data = datastr.c_str ();
|
2010-01-07 18:22:34 +01:00
|
|
|
|
|
|
|
if (data == NULL)
|
|
|
|
INTERNAL_ERROR ("message with no filename");
|
|
|
|
|
2010-12-09 01:26:05 +01:00
|
|
|
_notmuch_string_list_append (message->filename_list, data);
|
2010-01-07 18:22:34 +01:00
|
|
|
|
2010-11-11 09:07:24 +01:00
|
|
|
return;
|
2009-12-21 17:23:26 +01:00
|
|
|
}
|
|
|
|
|
2010-12-09 04:19:55 +01:00
|
|
|
for (; node; node = node->next) {
|
2010-11-11 09:07:24 +01:00
|
|
|
void *local = talloc_new (message);
|
|
|
|
const char *db_path, *directory, *basename, *filename;
|
|
|
|
char *colon, *direntry = NULL;
|
|
|
|
unsigned int directory_id;
|
2009-12-21 17:23:26 +01:00
|
|
|
|
2010-12-09 04:19:55 +01:00
|
|
|
direntry = node->string;
|
2009-12-21 17:23:26 +01:00
|
|
|
|
2010-11-11 09:07:24 +01:00
|
|
|
directory_id = strtol (direntry, &colon, 10);
|
2009-12-21 17:23:26 +01:00
|
|
|
|
2010-11-11 09:07:24 +01:00
|
|
|
if (colon == NULL || *colon != ':')
|
|
|
|
INTERNAL_ERROR ("malformed direntry");
|
2009-10-29 00:50:14 +01:00
|
|
|
|
2010-11-11 09:07:24 +01:00
|
|
|
basename = colon + 1;
|
2009-12-21 17:23:26 +01:00
|
|
|
|
2010-11-11 09:07:24 +01:00
|
|
|
*colon = '\0';
|
2009-12-21 17:23:26 +01:00
|
|
|
|
2010-11-11 09:07:24 +01:00
|
|
|
db_path = notmuch_database_get_path (message->notmuch);
|
|
|
|
|
|
|
|
directory = _notmuch_database_get_directory_path (local,
|
|
|
|
message->notmuch,
|
|
|
|
directory_id);
|
|
|
|
|
|
|
|
if (strlen (directory))
|
|
|
|
filename = talloc_asprintf (message, "%s/%s/%s",
|
|
|
|
db_path, directory, basename);
|
|
|
|
else
|
|
|
|
filename = talloc_asprintf (message, "%s/%s",
|
|
|
|
db_path, basename);
|
|
|
|
|
2010-12-09 01:26:05 +01:00
|
|
|
_notmuch_string_list_append (message->filename_list, filename);
|
2010-11-11 09:07:24 +01:00
|
|
|
|
|
|
|
talloc_free (local);
|
|
|
|
}
|
2010-12-09 04:19:55 +01:00
|
|
|
|
|
|
|
talloc_free (message->filename_term_list);
|
|
|
|
message->filename_term_list = NULL;
|
2010-11-11 09:07:24 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
const char *
|
|
|
|
notmuch_message_get_filename (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
_notmuch_message_ensure_filename_list (message);
|
|
|
|
|
|
|
|
if (message->filename_list == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
if (message->filename_list->head == NULL ||
|
2010-12-09 01:26:05 +01:00
|
|
|
message->filename_list->head->string == NULL)
|
2010-11-11 09:07:24 +01:00
|
|
|
{
|
|
|
|
INTERNAL_ERROR ("message with no filename");
|
|
|
|
}
|
|
|
|
|
2010-12-09 01:26:05 +01:00
|
|
|
return message->filename_list->head->string;
|
2010-11-11 09:07:24 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
notmuch_filenames_t *
|
|
|
|
notmuch_message_get_filenames (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
_notmuch_message_ensure_filename_list (message);
|
2009-10-23 14:38:13 +02:00
|
|
|
|
2010-11-11 09:07:24 +01:00
|
|
|
return _notmuch_filenames_create (message, message->filename_list);
|
2009-10-23 14:38:13 +02:00
|
|
|
}
|
|
|
|
|
2009-11-25 05:54:33 +01:00
|
|
|
notmuch_bool_t
|
|
|
|
notmuch_message_get_flag (notmuch_message_t *message,
|
|
|
|
notmuch_message_flag_t flag)
|
|
|
|
{
|
2014-10-23 14:30:36 +02:00
|
|
|
if (flag == NOTMUCH_MESSAGE_FLAG_GHOST &&
|
|
|
|
! NOTMUCH_TEST_BIT (message->lazy_flags, flag))
|
2017-02-24 19:33:07 +01:00
|
|
|
_notmuch_message_ensure_metadata (message, NULL);
|
2014-10-23 14:30:36 +02:00
|
|
|
|
2014-10-24 14:49:15 +02:00
|
|
|
return NOTMUCH_TEST_BIT (message->flags, flag);
|
2009-11-25 05:54:33 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
notmuch_message_set_flag (notmuch_message_t *message,
|
|
|
|
notmuch_message_flag_t flag, notmuch_bool_t enable)
|
|
|
|
{
|
|
|
|
if (enable)
|
2014-10-24 14:49:15 +02:00
|
|
|
NOTMUCH_SET_BIT (&message->flags, flag);
|
2009-11-25 05:54:33 +01:00
|
|
|
else
|
2014-10-24 14:49:15 +02:00
|
|
|
NOTMUCH_CLEAR_BIT (&message->flags, flag);
|
2014-10-23 14:30:36 +02:00
|
|
|
NOTMUCH_SET_BIT (&message->lazy_flags, flag);
|
2009-11-25 05:54:33 +01:00
|
|
|
}
|
|
|
|
|
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) {
|
2014-12-26 17:25:35 +01:00
|
|
|
_notmuch_database_log(_notmuch_message_database (message), "A Xapian exception occurred when reading date: %s\n",
|
2013-11-19 06:10:31 +01:00
|
|
|
error.get_msg().c_str());
|
|
|
|
message->notmuch->exception_reported = TRUE;
|
2009-10-30 00:06:27 +01:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-10-07 01:17:09 +02:00
|
|
|
if (value.empty ())
|
|
|
|
/* sortable_unserialise is undefined on empty string */
|
|
|
|
return 0;
|
2009-10-30 00:06:27 +01:00
|
|
|
return Xapian::sortable_unserialise (value);
|
|
|
|
}
|
|
|
|
|
2009-10-25 07:58:06 +01:00
|
|
|
notmuch_tags_t *
|
|
|
|
notmuch_message_get_tags (notmuch_message_t *message)
|
|
|
|
{
|
2010-12-09 07:54:34 +01:00
|
|
|
notmuch_tags_t *tags;
|
|
|
|
|
2017-02-24 19:33:07 +01:00
|
|
|
_notmuch_message_ensure_metadata (message, message->tag_list);
|
2010-12-09 07:54:34 +01:00
|
|
|
|
|
|
|
tags = _notmuch_tags_create (message, message->tag_list);
|
|
|
|
/* _notmuch_tags_create steals the reference to the tag_list, but
|
|
|
|
* in this case it's still used by the message, so we add an
|
|
|
|
* *additional* talloc reference to the list. As a result, it's
|
|
|
|
* possible to modify the message tags (which talloc_unlink's the
|
|
|
|
* current list from the message) while still iterating because
|
|
|
|
* the iterator will keep the current list alive. */
|
2012-10-01 09:36:11 +02:00
|
|
|
if (!talloc_reference (message, message->tag_list))
|
|
|
|
return NULL;
|
|
|
|
|
2010-12-09 07:54:34 +01:00
|
|
|
return tags;
|
2009-10-21 06:03:30 +02:00
|
|
|
}
|
|
|
|
|
2010-04-24 20:20:53 +02:00
|
|
|
const char *
|
2014-05-13 11:44:05 +02:00
|
|
|
_notmuch_message_get_author (notmuch_message_t *message)
|
2010-04-24 20:20:53 +02:00
|
|
|
{
|
|
|
|
return message->author;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2014-05-13 11:44:05 +02:00
|
|
|
_notmuch_message_set_author (notmuch_message_t *message,
|
2010-04-24 20:20:53 +02:00
|
|
|
const char *author)
|
|
|
|
{
|
|
|
|
if (message->author)
|
|
|
|
talloc_free(message->author);
|
|
|
|
message->author = talloc_strdup(message, author);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2009-10-23 14:25:58 +02:00
|
|
|
void
|
2011-11-06 18:17:36 +01:00
|
|
|
_notmuch_message_set_header_values (notmuch_message_t *message,
|
|
|
|
const char *date,
|
|
|
|
const char *from,
|
|
|
|
const char *subject)
|
2009-10-23 14:41:17 +02:00
|
|
|
{
|
|
|
|
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. */
|
2009-11-20 21:46:37 +01:00
|
|
|
if (date == NULL || *date == '\0')
|
2009-11-06 18:31:03 +01:00
|
|
|
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));
|
2011-11-06 18:17:36 +01:00
|
|
|
message->doc.add_value (NOTMUCH_VALUE_FROM, from);
|
|
|
|
message->doc.add_value (NOTMUCH_VALUE_SUBJECT, subject);
|
2015-06-05 19:28:33 +02:00
|
|
|
message->modified = TRUE;
|
2009-10-23 14:41:17 +02:00
|
|
|
}
|
|
|
|
|
lib: Add per-message last modification tracking
This adds a new document value that stores the revision of the last
modification to message metadata, where the revision number increases
monotonically with each database commit.
An alternative would be to store the wall-clock time of the last
modification of each message. In principle this is simpler and has
the advantage that any process can determine the current timestamp
without support from libnotmuch. However, even assuming a computer's
clock never goes backward and ignoring clock skew in networked
environments, this has a fatal flaw. Xapian uses (optimistic)
snapshot isolation, which means reads can be concurrent with writes.
Given this, consider the following time line with a write and two read
transactions:
write |-X-A--------------|
read 1 |---B---|
read 2 |---|
The write transaction modifies message X and records the wall-clock
time of the modification at A. The writer hangs around for a while
and later commits its change. Read 1 is concurrent with the write, so
it doesn't see the change to X. It does some query and records the
wall-clock time of its results at B. Transaction read 2 later starts
after the write commits and queries for changes since wall-clock time
B (say the reads are performing an incremental backup). Even though
read 1 could not see the change to X, read 2 is told (correctly) that
X has not changed since B, the time of the last read. In fact, X
changed before wall-clock time A, but the change was not visible until
*after* wall-clock time B, so read 2 misses the change to X.
This is tricky to solve in full-blown snapshot isolation, but because
Xapian serializes writes, we can use a simple, monotonically
increasing database revision number. Furthermore, maintaining this
revision number requires no more IO than a wall-clock time solution
because Xapian already maintains statistics on the upper (and lower)
bound of each value stream.
2014-10-13 08:20:01 +02:00
|
|
|
/* Upgrade a message to support NOTMUCH_FEATURE_LAST_MOD. The caller
|
|
|
|
* must call _notmuch_message_sync. */
|
|
|
|
void
|
|
|
|
_notmuch_message_upgrade_last_mod (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
/* _notmuch_message_sync will update the last modification
|
|
|
|
* revision; we just have to ask it to. */
|
|
|
|
message->modified = TRUE;
|
|
|
|
}
|
|
|
|
|
2009-10-23 14:41:17 +02:00
|
|
|
/* 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)
|
|
|
|
{
|
2009-11-21 20:54:25 +01:00
|
|
|
Xapian::WritableDatabase *db;
|
|
|
|
|
2009-11-21 22:10:18 +01:00
|
|
|
if (message->notmuch->mode == NOTMUCH_DATABASE_MODE_READ_ONLY)
|
2009-11-21 20:54:25 +01:00
|
|
|
return;
|
2009-10-22 00:53:38 +02:00
|
|
|
|
2015-06-05 19:28:33 +02:00
|
|
|
if (! message->modified)
|
|
|
|
return;
|
|
|
|
|
lib: Add per-message last modification tracking
This adds a new document value that stores the revision of the last
modification to message metadata, where the revision number increases
monotonically with each database commit.
An alternative would be to store the wall-clock time of the last
modification of each message. In principle this is simpler and has
the advantage that any process can determine the current timestamp
without support from libnotmuch. However, even assuming a computer's
clock never goes backward and ignoring clock skew in networked
environments, this has a fatal flaw. Xapian uses (optimistic)
snapshot isolation, which means reads can be concurrent with writes.
Given this, consider the following time line with a write and two read
transactions:
write |-X-A--------------|
read 1 |---B---|
read 2 |---|
The write transaction modifies message X and records the wall-clock
time of the modification at A. The writer hangs around for a while
and later commits its change. Read 1 is concurrent with the write, so
it doesn't see the change to X. It does some query and records the
wall-clock time of its results at B. Transaction read 2 later starts
after the write commits and queries for changes since wall-clock time
B (say the reads are performing an incremental backup). Even though
read 1 could not see the change to X, read 2 is told (correctly) that
X has not changed since B, the time of the last read. In fact, X
changed before wall-clock time A, but the change was not visible until
*after* wall-clock time B, so read 2 misses the change to X.
This is tricky to solve in full-blown snapshot isolation, but because
Xapian serializes writes, we can use a simple, monotonically
increasing database revision number. Furthermore, maintaining this
revision number requires no more IO than a wall-clock time solution
because Xapian already maintains statistics on the upper (and lower)
bound of each value stream.
2014-10-13 08:20:01 +02:00
|
|
|
/* Update the last modification of this message. */
|
|
|
|
if (message->notmuch->features & NOTMUCH_FEATURE_LAST_MOD)
|
|
|
|
/* sortable_serialise gives a reasonably compact encoding,
|
|
|
|
* which directly translates to reduced IO when scanning the
|
|
|
|
* value stream. Since it's built for doubles, we only get 53
|
|
|
|
* effective bits, but that's still enough for the database to
|
|
|
|
* last a few centuries at 1 million revisions per second. */
|
|
|
|
message->doc.add_value (NOTMUCH_VALUE_LAST_MOD,
|
|
|
|
Xapian::sortable_serialise (
|
|
|
|
_notmuch_database_new_revision (
|
|
|
|
message->notmuch)));
|
|
|
|
|
2009-11-21 20:54:25 +01:00
|
|
|
db = static_cast <Xapian::WritableDatabase *> (message->notmuch->xapian_db);
|
2009-10-22 00:53:38 +02:00
|
|
|
db->replace_document (message->doc_id, message->doc);
|
2015-06-05 19:28:33 +02:00
|
|
|
message->modified = FALSE;
|
2009-10-22 00:53:38 +02:00
|
|
|
}
|
|
|
|
|
2016-04-09 03:54:48 +02:00
|
|
|
/* Delete a message document from the database, leaving a ghost
|
|
|
|
* message in its place */
|
2011-06-11 06:07:54 +02:00
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_message_delete (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
notmuch_status_t status;
|
|
|
|
Xapian::WritableDatabase *db;
|
2016-04-09 03:54:51 +02:00
|
|
|
const char *mid, *tid, *query_string;
|
2016-04-09 03:54:48 +02:00
|
|
|
notmuch_message_t *ghost;
|
|
|
|
notmuch_private_status_t private_status;
|
|
|
|
notmuch_database_t *notmuch;
|
2016-04-09 03:54:51 +02:00
|
|
|
notmuch_query_t *query;
|
|
|
|
unsigned int count = 0;
|
|
|
|
notmuch_bool_t is_ghost;
|
2016-04-09 03:54:48 +02:00
|
|
|
|
|
|
|
mid = notmuch_message_get_message_id (message);
|
|
|
|
tid = notmuch_message_get_thread_id (message);
|
|
|
|
notmuch = message->notmuch;
|
2011-06-11 06:07:54 +02:00
|
|
|
|
|
|
|
status = _notmuch_database_ensure_writable (message->notmuch);
|
|
|
|
if (status)
|
|
|
|
return status;
|
|
|
|
|
2016-04-09 03:54:48 +02:00
|
|
|
db = static_cast <Xapian::WritableDatabase *> (notmuch->xapian_db);
|
2011-06-11 06:07:54 +02:00
|
|
|
db->delete_document (message->doc_id);
|
2016-04-09 03:54:48 +02:00
|
|
|
|
2016-04-09 03:54:51 +02:00
|
|
|
/* if this was a ghost to begin with, we are done */
|
|
|
|
private_status = _notmuch_message_has_term (message, "type", "ghost", &is_ghost);
|
|
|
|
if (private_status)
|
|
|
|
return COERCE_STATUS (private_status,
|
|
|
|
"Error trying to determine whether message was a ghost");
|
|
|
|
if (is_ghost)
|
|
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
|
|
|
|
|
|
query_string = talloc_asprintf (message, "thread:%s", tid);
|
|
|
|
query = notmuch_query_create (notmuch, query_string);
|
|
|
|
if (query == NULL)
|
|
|
|
return NOTMUCH_STATUS_OUT_OF_MEMORY;
|
|
|
|
status = notmuch_query_count_messages_st (query, &count);
|
|
|
|
if (status) {
|
|
|
|
notmuch_query_destroy (query);
|
|
|
|
return status;
|
2016-04-09 03:54:48 +02:00
|
|
|
}
|
|
|
|
|
2016-04-09 03:54:51 +02:00
|
|
|
if (count > 0) {
|
|
|
|
/* reintroduce a ghost in its place because there are still
|
|
|
|
* other active messages in this thread: */
|
|
|
|
ghost = _notmuch_message_create_for_message_id (notmuch, mid, &private_status);
|
|
|
|
if (private_status == NOTMUCH_PRIVATE_STATUS_NO_DOCUMENT_FOUND) {
|
|
|
|
private_status = _notmuch_message_initialize_ghost (ghost, tid);
|
|
|
|
if (! private_status)
|
|
|
|
_notmuch_message_sync (ghost);
|
|
|
|
} else if (private_status == NOTMUCH_PRIVATE_STATUS_SUCCESS) {
|
|
|
|
/* this is deeply weird, and we should not have gotten
|
|
|
|
into this state. is there a better error message to
|
|
|
|
return here? */
|
|
|
|
status = NOTMUCH_STATUS_DUPLICATE_MESSAGE_ID;
|
|
|
|
}
|
|
|
|
|
|
|
|
notmuch_message_destroy (ghost);
|
|
|
|
status = COERCE_STATUS (private_status, "Error converting to ghost message");
|
2016-04-09 03:54:52 +02:00
|
|
|
} else {
|
|
|
|
/* the thread is empty; drop all ghost messages from it */
|
|
|
|
notmuch_messages_t *messages;
|
|
|
|
status = _notmuch_query_search_documents (query,
|
|
|
|
"ghost",
|
|
|
|
&messages);
|
|
|
|
if (status == NOTMUCH_STATUS_SUCCESS) {
|
|
|
|
notmuch_status_t last_error = NOTMUCH_STATUS_SUCCESS;
|
|
|
|
while (notmuch_messages_valid (messages)) {
|
|
|
|
message = notmuch_messages_get (messages);
|
|
|
|
status = _notmuch_message_delete (message);
|
|
|
|
if (status) /* we'll report the last failure we see;
|
|
|
|
* if there is more than one failure, we
|
|
|
|
* forget about previous ones */
|
|
|
|
last_error = status;
|
|
|
|
notmuch_message_destroy (message);
|
|
|
|
notmuch_messages_move_to_next (messages);
|
|
|
|
}
|
|
|
|
status = last_error;
|
|
|
|
}
|
2016-04-09 03:54:51 +02:00
|
|
|
}
|
|
|
|
notmuch_query_destroy (query);
|
|
|
|
return status;
|
2011-06-11 06:07:54 +02:00
|
|
|
}
|
|
|
|
|
2014-10-23 14:30:36 +02:00
|
|
|
/* Transform a blank message into a ghost message. The caller must
|
|
|
|
* _notmuch_message_sync the message. */
|
|
|
|
notmuch_private_status_t
|
|
|
|
_notmuch_message_initialize_ghost (notmuch_message_t *message,
|
|
|
|
const char *thread_id)
|
|
|
|
{
|
|
|
|
notmuch_private_status_t status;
|
|
|
|
|
|
|
|
status = _notmuch_message_add_term (message, "type", "ghost");
|
|
|
|
if (status)
|
|
|
|
return status;
|
|
|
|
status = _notmuch_message_add_term (message, "thread", thread_id);
|
|
|
|
if (status)
|
|
|
|
return status;
|
|
|
|
|
|
|
|
return NOTMUCH_PRIVATE_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
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) {
|
2014-05-13 11:44:05 +02:00
|
|
|
_notmuch_message_file_close (message->message_file);
|
2009-11-18 03:33:42 +01:00
|
|
|
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
|
2010-06-04 18:54:46 +02:00
|
|
|
* call to _notmuch_message_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;
|
|
|
|
|
2010-01-09 20:18:27 +01:00
|
|
|
message->doc.add_term (term, 0);
|
2015-06-05 19:28:33 +02:00
|
|
|
message->modified = TRUE;
|
2009-10-22 00:53:38 +02:00
|
|
|
|
|
|
|
talloc_free (term);
|
|
|
|
|
2010-11-27 05:34:29 +01:00
|
|
|
_notmuch_message_invalidate_metadata (message, prefix_name);
|
|
|
|
|
2009-10-22 00:53:38 +02:00
|
|
|
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
|
2011-06-20 22:14:21 +02:00
|
|
|
* also non-prefixed). */
|
2009-10-28 18:42:07 +01:00
|
|
|
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);
|
|
|
|
|
2014-06-16 04:40:34 +02:00
|
|
|
term_gen->set_termpos (message->termpos);
|
2009-10-28 18:42:07 +01:00
|
|
|
term_gen->index_text (text, 1, prefix);
|
2014-06-16 04:40:34 +02:00
|
|
|
/* Create a gap between this an the next terms so they don't
|
|
|
|
* appear to be a phrase. */
|
|
|
|
message->termpos = term_gen->get_termpos () + 100;
|
2014-08-01 04:59:27 +02:00
|
|
|
|
|
|
|
_notmuch_message_invalidate_metadata (message, prefix_name);
|
2009-10-28 18:42:07 +01:00
|
|
|
}
|
|
|
|
|
2014-06-16 04:40:34 +02:00
|
|
|
term_gen->set_termpos (message->termpos);
|
2009-10-28 18:42:07 +01:00
|
|
|
term_gen->index_text (text);
|
2014-06-16 04:40:34 +02:00
|
|
|
/* Create a term gap, as above. */
|
|
|
|
message->termpos = term_gen->get_termpos () + 100;
|
2009-10-28 18:42:07 +01:00
|
|
|
|
|
|
|
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
|
2010-06-04 18:54:46 +02:00
|
|
|
* call to _notmuch_message_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);
|
2015-06-05 19:28:33 +02:00
|
|
|
message->modified = TRUE;
|
2009-10-28 07:59:06 +01:00
|
|
|
} catch (const Xapian::InvalidArgumentError) {
|
2016-01-15 06:23:10 +01:00
|
|
|
/* We'll let the philosophers try to wrestle with the
|
2009-10-28 07:59:06 +01:00
|
|
|
* 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);
|
|
|
|
|
2010-11-27 05:34:29 +01:00
|
|
|
_notmuch_message_invalidate_metadata (message, prefix_name);
|
|
|
|
|
2009-10-22 00:53:38 +02:00
|
|
|
return NOTMUCH_PRIVATE_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2016-04-09 03:54:50 +02:00
|
|
|
notmuch_private_status_t
|
|
|
|
_notmuch_message_has_term (notmuch_message_t *message,
|
|
|
|
const char *prefix_name,
|
|
|
|
const char *value,
|
|
|
|
notmuch_bool_t *result)
|
|
|
|
{
|
|
|
|
char *term;
|
|
|
|
notmuch_bool_t out = FALSE;
|
|
|
|
notmuch_private_status_t status = NOTMUCH_PRIVATE_STATUS_SUCCESS;
|
|
|
|
|
|
|
|
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;
|
|
|
|
|
|
|
|
try {
|
|
|
|
/* Look for the exact term */
|
|
|
|
Xapian::TermIterator i = message->doc.termlist_begin ();
|
|
|
|
i.skip_to (term);
|
|
|
|
if (i != message->doc.termlist_end () &&
|
|
|
|
!strcmp ((*i).c_str (), term))
|
|
|
|
out = TRUE;
|
|
|
|
} catch (Xapian::Error &error) {
|
|
|
|
status = NOTMUCH_PRIVATE_STATUS_XAPIAN_EXCEPTION;
|
|
|
|
}
|
|
|
|
talloc_free (term);
|
|
|
|
|
|
|
|
*result = out;
|
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
2009-10-22 00:53:38 +02:00
|
|
|
notmuch_status_t
|
|
|
|
notmuch_message_add_tag (notmuch_message_t *message, const char *tag)
|
|
|
|
{
|
2010-01-07 19:19:44 +01:00
|
|
|
notmuch_private_status_t private_status;
|
|
|
|
notmuch_status_t status;
|
|
|
|
|
|
|
|
status = _notmuch_database_ensure_writable (message->notmuch);
|
|
|
|
if (status)
|
|
|
|
return status;
|
2009-10-22 00:53:38 +02:00
|
|
|
|
|
|
|
if (tag == NULL)
|
|
|
|
return NOTMUCH_STATUS_NULL_POINTER;
|
|
|
|
|
|
|
|
if (strlen (tag) > NOTMUCH_TAG_MAX)
|
|
|
|
return NOTMUCH_STATUS_TAG_TOO_LONG;
|
|
|
|
|
2010-01-07 19:19:44 +01:00
|
|
|
private_status = _notmuch_message_add_term (message, "tag", tag);
|
|
|
|
if (private_status) {
|
2009-10-25 18:22:41 +01:00
|
|
|
INTERNAL_ERROR ("_notmuch_message_add_term return unexpected value: %d\n",
|
2010-01-07 19:19:44 +01:00
|
|
|
private_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)
|
|
|
|
{
|
2010-01-07 19:19:44 +01:00
|
|
|
notmuch_private_status_t private_status;
|
|
|
|
notmuch_status_t status;
|
|
|
|
|
|
|
|
status = _notmuch_database_ensure_writable (message->notmuch);
|
|
|
|
if (status)
|
|
|
|
return status;
|
2009-10-22 00:53:38 +02:00
|
|
|
|
|
|
|
if (tag == NULL)
|
|
|
|
return NOTMUCH_STATUS_NULL_POINTER;
|
|
|
|
|
|
|
|
if (strlen (tag) > NOTMUCH_TAG_MAX)
|
|
|
|
return NOTMUCH_STATUS_TAG_TOO_LONG;
|
|
|
|
|
2010-01-07 19:19:44 +01:00
|
|
|
private_status = _notmuch_message_remove_term (message, "tag", tag);
|
|
|
|
if (private_status) {
|
2009-10-25 18:22:41 +01:00
|
|
|
INTERNAL_ERROR ("_notmuch_message_remove_term return unexpected value: %d\n",
|
2010-01-07 19:19:44 +01:00
|
|
|
private_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;
|
|
|
|
}
|
|
|
|
|
2012-06-09 21:14:15 +02:00
|
|
|
/* Is the given filename within a maildir directory?
|
|
|
|
*
|
|
|
|
* Specifically, is the final directory component of 'filename' either
|
|
|
|
* "cur" or "new". If so, return a pointer to that final directory
|
|
|
|
* component within 'filename'. If not, return NULL.
|
|
|
|
*
|
|
|
|
* A non-NULL return value is guaranteed to be a valid string pointer
|
|
|
|
* pointing to the characters "new/" or "cur/", (but not
|
|
|
|
* NUL-terminated).
|
|
|
|
*/
|
|
|
|
static const char *
|
|
|
|
_filename_is_in_maildir (const char *filename)
|
|
|
|
{
|
|
|
|
const char *slash, *dir = NULL;
|
|
|
|
|
|
|
|
/* Find the last '/' separating directory from filename. */
|
|
|
|
slash = strrchr (filename, '/');
|
|
|
|
if (slash == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
/* Jump back 4 characters to where the previous '/' will be if the
|
|
|
|
* directory is named "cur" or "new". */
|
|
|
|
if (slash - filename < 4)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
slash -= 4;
|
|
|
|
|
|
|
|
if (*slash != '/')
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
dir = slash + 1;
|
|
|
|
|
|
|
|
if (STRNCMP_LITERAL (dir, "cur/") == 0 ||
|
|
|
|
STRNCMP_LITERAL (dir, "new/") == 0)
|
|
|
|
{
|
|
|
|
return dir;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2010-10-31 22:29:16 +01:00
|
|
|
notmuch_status_t
|
2010-11-11 02:36:09 +01:00
|
|
|
notmuch_message_maildir_flags_to_tags (notmuch_message_t *message)
|
2010-10-31 22:29:16 +01:00
|
|
|
{
|
2010-11-11 09:18:35 +01:00
|
|
|
const char *flags;
|
2010-10-31 22:29:16 +01:00
|
|
|
notmuch_status_t status;
|
2010-11-11 09:18:35 +01:00
|
|
|
notmuch_filenames_t *filenames;
|
2012-06-09 21:14:16 +02:00
|
|
|
const char *filename, *dir;
|
2010-11-11 09:18:35 +01:00
|
|
|
char *combined_flags = talloc_strdup (message, "");
|
|
|
|
unsigned i;
|
maildir_flags_to_tags: Avoid interpreting "no info" as "no flags set".
If a filename has no maildir info at all, (that is, it does not
contain the sequence ":2,"), we consider this distinct from a filename
with an empty maildir info, (the ":2," separator is present, but no
flags characters follow).
Specifically, we regard a missing info field as providing no
information, so tags will remain unchanged. On the other hand, an info
field that is present but has no flags set will cause various tags to
be cleared, (or in the case of "unread", added).
This fixes the "remove info" case of the maildir-sync tests in the
test suite.
2010-11-11 11:55:13 +01:00
|
|
|
int seen_maildir_info = 0;
|
2010-11-11 02:36:09 +01:00
|
|
|
|
2010-11-11 09:18:35 +01:00
|
|
|
for (filenames = notmuch_message_get_filenames (message);
|
|
|
|
notmuch_filenames_valid (filenames);
|
|
|
|
notmuch_filenames_move_to_next (filenames))
|
|
|
|
{
|
|
|
|
filename = notmuch_filenames_get (filenames);
|
2012-06-09 21:14:16 +02:00
|
|
|
dir = _filename_is_in_maildir (filename);
|
|
|
|
|
|
|
|
if (! dir)
|
|
|
|
continue;
|
2010-10-31 22:29:16 +01:00
|
|
|
|
2010-11-11 09:18:35 +01:00
|
|
|
flags = strstr (filename, ":2,");
|
2012-06-09 21:14:17 +02:00
|
|
|
if (flags) {
|
|
|
|
seen_maildir_info = 1;
|
|
|
|
flags += 3;
|
|
|
|
combined_flags = talloc_strdup_append (combined_flags, flags);
|
|
|
|
} else if (STRNCMP_LITERAL (dir, "new/") == 0) {
|
|
|
|
/* Messages are delivered to new/ with no "info" part, but
|
|
|
|
* they effectively have default maildir flags. According
|
|
|
|
* to the spec, we should ignore the info part for
|
|
|
|
* messages in new/, but some MUAs (mutt) can set maildir
|
|
|
|
* flags on messages in new/, so we're liberal in what we
|
|
|
|
* accept. */
|
|
|
|
seen_maildir_info = 1;
|
|
|
|
}
|
2010-10-31 22:29:16 +01:00
|
|
|
}
|
|
|
|
|
maildir_flags_to_tags: Avoid interpreting "no info" as "no flags set".
If a filename has no maildir info at all, (that is, it does not
contain the sequence ":2,"), we consider this distinct from a filename
with an empty maildir info, (the ":2," separator is present, but no
flags characters follow).
Specifically, we regard a missing info field as providing no
information, so tags will remain unchanged. On the other hand, an info
field that is present but has no flags set will cause various tags to
be cleared, (or in the case of "unread", added).
This fixes the "remove info" case of the maildir-sync tests in the
test suite.
2010-11-11 11:55:13 +01:00
|
|
|
/* If none of the filenames have any maildir info field (not even
|
|
|
|
* an empty info with no flags set) then there's no information to
|
|
|
|
* go on, so do nothing. */
|
|
|
|
if (! seen_maildir_info)
|
|
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
|
|
|
2010-10-31 22:29:16 +01:00
|
|
|
status = notmuch_message_freeze (message);
|
|
|
|
if (status)
|
|
|
|
return status;
|
2010-11-11 09:18:35 +01:00
|
|
|
|
2010-10-31 22:29:16 +01:00
|
|
|
for (i = 0; i < ARRAY_SIZE(flag2tag); i++) {
|
2010-11-11 09:18:35 +01:00
|
|
|
if ((strchr (combined_flags, flag2tag[i].flag) != NULL)
|
2016-05-28 19:45:31 +02:00
|
|
|
^
|
2010-11-11 09:18:35 +01:00
|
|
|
flag2tag[i].inverse)
|
|
|
|
{
|
2010-10-31 22:29:16 +01:00
|
|
|
status = notmuch_message_add_tag (message, flag2tag[i].tag);
|
|
|
|
} else {
|
|
|
|
status = notmuch_message_remove_tag (message, flag2tag[i].tag);
|
|
|
|
}
|
|
|
|
if (status)
|
|
|
|
return status;
|
|
|
|
}
|
|
|
|
status = notmuch_message_thaw (message);
|
|
|
|
|
2010-11-11 09:18:35 +01:00
|
|
|
talloc_free (combined_flags);
|
|
|
|
|
2010-10-31 22:29:16 +01:00
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
2010-11-12 01:36:02 +01:00
|
|
|
/* From the set of tags on 'message' and the flag2tag table, compute a
|
|
|
|
* set of maildir-flag actions to be taken, (flags that should be
|
|
|
|
* either set or cleared).
|
|
|
|
*
|
|
|
|
* The result is returned as two talloced strings: to_set, and to_clear
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
_get_maildir_flag_actions (notmuch_message_t *message,
|
|
|
|
char **to_set_ret,
|
|
|
|
char **to_clear_ret)
|
|
|
|
{
|
|
|
|
char *to_set, *to_clear;
|
|
|
|
notmuch_tags_t *tags;
|
|
|
|
const char *tag;
|
|
|
|
unsigned i;
|
|
|
|
|
|
|
|
to_set = talloc_strdup (message, "");
|
|
|
|
to_clear = talloc_strdup (message, "");
|
|
|
|
|
|
|
|
/* First, find flags for all set tags. */
|
|
|
|
for (tags = notmuch_message_get_tags (message);
|
|
|
|
notmuch_tags_valid (tags);
|
|
|
|
notmuch_tags_move_to_next (tags))
|
|
|
|
{
|
|
|
|
tag = notmuch_tags_get (tags);
|
|
|
|
|
|
|
|
for (i = 0; i < ARRAY_SIZE (flag2tag); i++) {
|
|
|
|
if (strcmp (tag, flag2tag[i].tag) == 0) {
|
|
|
|
if (flag2tag[i].inverse)
|
|
|
|
to_clear = talloc_asprintf_append (to_clear,
|
|
|
|
"%c",
|
|
|
|
flag2tag[i].flag);
|
|
|
|
else
|
|
|
|
to_set = talloc_asprintf_append (to_set,
|
|
|
|
"%c",
|
|
|
|
flag2tag[i].flag);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Then, find the flags for all tags not present. */
|
|
|
|
for (i = 0; i < ARRAY_SIZE (flag2tag); i++) {
|
|
|
|
if (flag2tag[i].inverse) {
|
|
|
|
if (strchr (to_clear, flag2tag[i].flag) == NULL)
|
|
|
|
to_set = talloc_asprintf_append (to_set, "%c", flag2tag[i].flag);
|
|
|
|
} else {
|
|
|
|
if (strchr (to_set, flag2tag[i].flag) == NULL)
|
|
|
|
to_clear = talloc_asprintf_append (to_clear, "%c", flag2tag[i].flag);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
*to_set_ret = to_set;
|
|
|
|
*to_clear_ret = to_clear;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Given 'filename' and a set of maildir flags to set and to clear,
|
|
|
|
* compute the new maildir filename.
|
|
|
|
*
|
|
|
|
* If the existing filename is in the directory "new", the new
|
2012-12-19 22:32:27 +01:00
|
|
|
* filename will be in the directory "cur", except for the case when
|
|
|
|
* no flags are changed and the existing filename does not contain
|
|
|
|
* maildir info (starting with ",2:").
|
2010-11-12 01:36:02 +01:00
|
|
|
*
|
|
|
|
* After a sequence of ":2," in the filename, any subsequent
|
|
|
|
* single-character flags will be added or removed according to the
|
|
|
|
* characters in flags_to_set and flags_to_clear. Any existing flags
|
|
|
|
* not mentioned in either string will remain. The final list of flags
|
|
|
|
* will be in ASCII order.
|
|
|
|
*
|
|
|
|
* If the original flags seem invalid, (repeated characters or
|
|
|
|
* non-ASCII ordering of flags), this function will return NULL
|
|
|
|
* (meaning that renaming would not be safe and should not occur).
|
2010-11-11 02:36:09 +01:00
|
|
|
*/
|
2010-11-12 01:36:02 +01:00
|
|
|
static char*
|
|
|
|
_new_maildir_filename (void *ctx,
|
|
|
|
const char *filename,
|
|
|
|
const char *flags_to_set,
|
|
|
|
const char *flags_to_clear)
|
|
|
|
{
|
|
|
|
const char *info, *flags;
|
|
|
|
unsigned int flag, last_flag;
|
|
|
|
char *filename_new, *dir;
|
|
|
|
char flag_map[128];
|
|
|
|
int flags_in_map = 0;
|
2012-12-19 22:32:27 +01:00
|
|
|
notmuch_bool_t flags_changed = FALSE;
|
2010-11-12 01:36:02 +01:00
|
|
|
unsigned int i;
|
|
|
|
char *s;
|
|
|
|
|
|
|
|
memset (flag_map, 0, sizeof (flag_map));
|
|
|
|
|
|
|
|
info = strstr (filename, ":2,");
|
|
|
|
|
|
|
|
if (info == NULL) {
|
|
|
|
info = filename + strlen(filename);
|
|
|
|
} else {
|
|
|
|
/* Loop through existing flags in filename. */
|
|
|
|
for (flags = info + 3, last_flag = 0;
|
|
|
|
*flags;
|
|
|
|
last_flag = flag, flags++)
|
|
|
|
{
|
|
|
|
flag = *flags;
|
|
|
|
|
|
|
|
/* Original flags not in ASCII order. Abort. */
|
|
|
|
if (flag < last_flag)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
/* Non-ASCII flag. Abort. */
|
|
|
|
if (flag > sizeof(flag_map) - 1)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
/* Repeated flag value. Abort. */
|
|
|
|
if (flag_map[flag])
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
flag_map[flag] = 1;
|
|
|
|
flags_in_map++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Then set and clear our flags from tags. */
|
|
|
|
for (flags = flags_to_set; *flags; flags++) {
|
|
|
|
flag = *flags;
|
|
|
|
if (flag_map[flag] == 0) {
|
|
|
|
flag_map[flag] = 1;
|
|
|
|
flags_in_map++;
|
2012-12-19 22:32:27 +01:00
|
|
|
flags_changed = TRUE;
|
2010-11-12 01:36:02 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (flags = flags_to_clear; *flags; flags++) {
|
|
|
|
flag = *flags;
|
|
|
|
if (flag_map[flag]) {
|
|
|
|
flag_map[flag] = 0;
|
|
|
|
flags_in_map--;
|
2012-12-19 22:32:27 +01:00
|
|
|
flags_changed = TRUE;
|
2010-11-12 01:36:02 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-12-19 22:32:27 +01:00
|
|
|
/* Messages in new/ without maildir info can be kept in new/ if no
|
|
|
|
* flags have changed. */
|
|
|
|
dir = (char *) _filename_is_in_maildir (filename);
|
|
|
|
if (dir && STRNCMP_LITERAL (dir, "new/") == 0 && !*info && !flags_changed)
|
|
|
|
return talloc_strdup (ctx, filename);
|
|
|
|
|
2010-11-12 01:36:02 +01:00
|
|
|
filename_new = (char *) talloc_size (ctx,
|
|
|
|
info - filename +
|
|
|
|
strlen (":2,") + flags_in_map + 1);
|
|
|
|
if (unlikely (filename_new == NULL))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
strncpy (filename_new, filename, info - filename);
|
|
|
|
filename_new[info - filename] = '\0';
|
|
|
|
|
|
|
|
strcat (filename_new, ":2,");
|
|
|
|
|
|
|
|
s = filename_new + strlen (filename_new);
|
|
|
|
for (i = 0; i < sizeof (flag_map); i++)
|
|
|
|
{
|
|
|
|
if (flag_map[i]) {
|
|
|
|
*s = i;
|
|
|
|
s++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
*s = '\0';
|
|
|
|
|
|
|
|
/* If message is in new/ move it under cur/. */
|
|
|
|
dir = (char *) _filename_is_in_maildir (filename_new);
|
|
|
|
if (dir && STRNCMP_LITERAL (dir, "new/") == 0)
|
|
|
|
memcpy (dir, "cur/", 4);
|
|
|
|
|
|
|
|
return filename_new;
|
|
|
|
}
|
|
|
|
|
2010-11-11 02:36:09 +01:00
|
|
|
notmuch_status_t
|
|
|
|
notmuch_message_tags_to_maildir_flags (notmuch_message_t *message)
|
2010-10-31 22:29:16 +01:00
|
|
|
{
|
2010-11-11 12:41:39 +01:00
|
|
|
notmuch_filenames_t *filenames;
|
2010-11-12 01:36:02 +01:00
|
|
|
const char *filename;
|
|
|
|
char *filename_new;
|
|
|
|
char *to_set, *to_clear;
|
2010-11-12 05:54:41 +01:00
|
|
|
notmuch_status_t status = NOTMUCH_STATUS_SUCCESS;
|
2010-10-31 22:29:16 +01:00
|
|
|
|
2010-11-12 01:36:02 +01:00
|
|
|
_get_maildir_flag_actions (message, &to_set, &to_clear);
|
2010-10-31 22:29:16 +01:00
|
|
|
|
2010-11-11 12:41:39 +01:00
|
|
|
for (filenames = notmuch_message_get_filenames (message);
|
|
|
|
notmuch_filenames_valid (filenames);
|
|
|
|
notmuch_filenames_move_to_next (filenames))
|
|
|
|
{
|
|
|
|
filename = notmuch_filenames_get (filenames);
|
2010-10-31 22:29:16 +01:00
|
|
|
|
2010-11-11 23:32:17 +01:00
|
|
|
if (! _filename_is_in_maildir (filename))
|
|
|
|
continue;
|
|
|
|
|
2010-11-12 01:36:02 +01:00
|
|
|
filename_new = _new_maildir_filename (message, filename,
|
|
|
|
to_set, to_clear);
|
|
|
|
if (filename_new == NULL)
|
2010-11-11 12:41:39 +01:00
|
|
|
continue;
|
2010-10-31 22:29:16 +01:00
|
|
|
|
2010-11-12 01:36:02 +01:00
|
|
|
if (strcmp (filename, filename_new)) {
|
|
|
|
int err;
|
|
|
|
notmuch_status_t new_status;
|
2010-10-31 22:29:16 +01:00
|
|
|
|
2010-11-12 01:36:02 +01:00
|
|
|
err = rename (filename, filename_new);
|
|
|
|
if (err)
|
|
|
|
continue;
|
2010-10-31 22:29:16 +01:00
|
|
|
|
2011-01-15 23:09:04 +01:00
|
|
|
new_status = _notmuch_message_remove_filename (message,
|
|
|
|
filename);
|
|
|
|
/* Hold on to only the first error. */
|
2011-02-06 10:17:49 +01:00
|
|
|
if (! status && new_status
|
|
|
|
&& new_status != NOTMUCH_STATUS_DUPLICATE_MESSAGE_ID) {
|
2011-01-15 23:09:04 +01:00
|
|
|
status = new_status;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
new_status = _notmuch_message_add_filename (message,
|
|
|
|
filename_new);
|
2010-11-12 01:36:02 +01:00
|
|
|
/* Hold on to only the first error. */
|
|
|
|
if (! status && new_status) {
|
|
|
|
status = new_status;
|
|
|
|
continue;
|
|
|
|
}
|
2010-11-11 09:26:04 +01:00
|
|
|
|
2010-11-11 12:41:39 +01:00
|
|
|
_notmuch_message_sync (message);
|
|
|
|
}
|
2010-11-12 01:36:02 +01:00
|
|
|
|
|
|
|
talloc_free (filename_new);
|
2010-10-31 22:29:16 +01:00
|
|
|
}
|
2010-11-11 12:41:39 +01:00
|
|
|
|
2010-11-12 01:36:02 +01:00
|
|
|
talloc_free (to_set);
|
|
|
|
talloc_free (to_clear);
|
|
|
|
|
2014-09-22 11:54:52 +02:00
|
|
|
return status;
|
2010-10-31 22:29:16 +01:00
|
|
|
}
|
|
|
|
|
2010-01-07 19:19:44 +01:00
|
|
|
notmuch_status_t
|
2009-10-27 06:25:45 +01:00
|
|
|
notmuch_message_remove_all_tags (notmuch_message_t *message)
|
|
|
|
{
|
2010-01-07 19:19:44 +01:00
|
|
|
notmuch_private_status_t private_status;
|
|
|
|
notmuch_status_t status;
|
2009-10-27 06:25:45 +01:00
|
|
|
notmuch_tags_t *tags;
|
|
|
|
const char *tag;
|
|
|
|
|
2010-01-07 19:19:44 +01:00
|
|
|
status = _notmuch_database_ensure_writable (message->notmuch);
|
|
|
|
if (status)
|
|
|
|
return status;
|
|
|
|
|
2009-10-27 06:25:45 +01:00
|
|
|
for (tags = notmuch_message_get_tags (message);
|
2010-03-09 18:22:29 +01:00
|
|
|
notmuch_tags_valid (tags);
|
|
|
|
notmuch_tags_move_to_next (tags))
|
2009-10-27 06:25:45 +01:00
|
|
|
{
|
|
|
|
tag = notmuch_tags_get (tags);
|
|
|
|
|
2010-01-07 19:19:44 +01:00
|
|
|
private_status = _notmuch_message_remove_term (message, "tag", tag);
|
|
|
|
if (private_status) {
|
2009-10-27 06:25:45 +01:00
|
|
|
INTERNAL_ERROR ("_notmuch_message_remove_term return unexpected value: %d\n",
|
2010-01-07 19:19:44 +01:00
|
|
|
private_status);
|
2009-10-27 06:25:45 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (! message->frozen)
|
|
|
|
_notmuch_message_sync (message);
|
2010-01-07 19:19:44 +01:00
|
|
|
|
2010-12-09 07:54:34 +01:00
|
|
|
talloc_free (tags);
|
2010-01-07 19:19:44 +01:00
|
|
|
return NOTMUCH_STATUS_SUCCESS;
|
2009-10-27 06:25:45 +01:00
|
|
|
}
|
|
|
|
|
2010-01-07 19:19:44 +01:00
|
|
|
notmuch_status_t
|
2009-10-27 06:25:45 +01:00
|
|
|
notmuch_message_freeze (notmuch_message_t *message)
|
|
|
|
{
|
2010-01-07 19:19:44 +01:00
|
|
|
notmuch_status_t status;
|
|
|
|
|
|
|
|
status = _notmuch_database_ensure_writable (message->notmuch);
|
|
|
|
if (status)
|
|
|
|
return status;
|
|
|
|
|
2009-10-27 06:25:45 +01:00
|
|
|
message->frozen++;
|
2010-01-07 19:19:44 +01:00
|
|
|
|
|
|
|
return NOTMUCH_STATUS_SUCCESS;
|
2009-10-27 06:25:45 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
notmuch_status_t
|
|
|
|
notmuch_message_thaw (notmuch_message_t *message)
|
|
|
|
{
|
2010-01-07 19:19:44 +01:00
|
|
|
notmuch_status_t status;
|
|
|
|
|
|
|
|
status = _notmuch_database_ensure_writable (message->notmuch);
|
|
|
|
if (status)
|
|
|
|
return status;
|
|
|
|
|
2009-10-27 06:25:45 +01:00
|
|
|
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);
|
|
|
|
}
|
2014-12-26 17:16:12 +01:00
|
|
|
|
|
|
|
notmuch_database_t *
|
|
|
|
_notmuch_message_database (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
return message->notmuch;
|
|
|
|
}
|
2016-06-13 03:05:50 +02:00
|
|
|
|
2017-02-18 15:45:48 +01:00
|
|
|
static void
|
2016-06-13 03:05:50 +02:00
|
|
|
_notmuch_message_ensure_property_map (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
notmuch_string_node_t *node;
|
|
|
|
|
|
|
|
if (message->property_map)
|
|
|
|
return;
|
|
|
|
|
2017-02-24 19:33:07 +01:00
|
|
|
_notmuch_message_ensure_metadata (message, message->property_term_list);
|
2016-06-13 03:05:50 +02:00
|
|
|
|
|
|
|
message->property_map = _notmuch_string_map_create (message);
|
|
|
|
|
|
|
|
for (node = message->property_term_list->head; node; node = node->next) {
|
|
|
|
const char *key;
|
|
|
|
char *value;
|
|
|
|
|
|
|
|
value = index(node->string, '=');
|
|
|
|
if (!value)
|
|
|
|
INTERNAL_ERROR ("malformed property term");
|
|
|
|
|
|
|
|
*value = '\0';
|
|
|
|
value++;
|
|
|
|
key = node->string;
|
|
|
|
|
|
|
|
_notmuch_string_map_append (message->property_map, key, value);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
talloc_free (message->property_term_list);
|
|
|
|
message->property_term_list = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
notmuch_string_map_t *
|
|
|
|
_notmuch_message_property_map (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
_notmuch_message_ensure_property_map (message);
|
|
|
|
|
|
|
|
return message->property_map;
|
|
|
|
}
|
|
|
|
|
|
|
|
notmuch_bool_t
|
|
|
|
_notmuch_message_frozen (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
return message->frozen;
|
|
|
|
}
|