notmuch: Start actually adding messages to the index.
This is the beginning of the notmuch library as well, with its
interface in notmuch.h. So far we've got create, open, close, and
add_message (all with a notmuch_database prefix).
The current add_message function has already been whittled down from
what we have in notmuch-index-message to add only references,
message-id, and thread-id to the index, (that is---just enough to do
thread-linkage but nothing for full-text searching).
The concept here is to do something quickly so that the user can get
some data into notmuch and start using it. (The most interesting stuff
is then thread-linkage and labels like inbox and unread.) We can
defer the full-text indexing of the body of the messages for later,
(such as in the background while the user is reading mail).
The initial thread-stitching step is still slower than I would like.
We may have to stop using libgmime for this step as its overhead is
not worth it for the simple case of just parsing the message-id,
references, and in-reply-to headers.
2009-10-19 05:56:30 +02:00
|
|
|
/* notmuch-private.h - Internal interfaces for notmuch.
|
|
|
|
*
|
|
|
|
* 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/ .
|
notmuch: Start actually adding messages to the index.
This is the beginning of the notmuch library as well, with its
interface in notmuch.h. So far we've got create, open, close, and
add_message (all with a notmuch_database prefix).
The current add_message function has already been whittled down from
what we have in notmuch-index-message to add only references,
message-id, and thread-id to the index, (that is---just enough to do
thread-linkage but nothing for full-text searching).
The concept here is to do something quickly so that the user can get
some data into notmuch and start using it. (The most interesting stuff
is then thread-linkage and labels like inbox and unread.) We can
defer the full-text indexing of the body of the messages for later,
(such as in the background while the user is reading mail).
The initial thread-stitching step is still slower than I would like.
We may have to stop using libgmime for this step as its overhead is
not worth it for the simple case of just parsing the message-id,
references, and in-reply-to headers.
2009-10-19 05:56:30 +02:00
|
|
|
*
|
|
|
|
* Author: Carl Worth <cworth@cworth.org>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef NOTMUCH_PRIVATE_H
|
|
|
|
#define NOTMUCH_PRIVATE_H
|
|
|
|
|
2009-10-20 07:34:59 +02:00
|
|
|
#ifndef _GNU_SOURCE
|
2009-10-26 23:17:10 +01:00
|
|
|
#define _GNU_SOURCE /* For getline and asprintf */
|
2009-10-20 07:34:59 +02:00
|
|
|
#endif
|
2017-10-07 10:44:05 +02:00
|
|
|
#include <stdbool.h>
|
2009-10-19 21:54:40 +02:00
|
|
|
#include <stdio.h>
|
2009-10-23 23:31:01 +02:00
|
|
|
|
2009-12-02 00:23:25 +01:00
|
|
|
#include "compat.h"
|
|
|
|
|
2009-10-23 23:31:01 +02:00
|
|
|
#include "notmuch.h"
|
|
|
|
|
|
|
|
NOTMUCH_BEGIN_DECLS
|
|
|
|
|
notmuch: Start actually adding messages to the index.
This is the beginning of the notmuch library as well, with its
interface in notmuch.h. So far we've got create, open, close, and
add_message (all with a notmuch_database prefix).
The current add_message function has already been whittled down from
what we have in notmuch-index-message to add only references,
message-id, and thread-id to the index, (that is---just enough to do
thread-linkage but nothing for full-text searching).
The concept here is to do something quickly so that the user can get
some data into notmuch and start using it. (The most interesting stuff
is then thread-linkage and labels like inbox and unread.) We can
defer the full-text indexing of the body of the messages for later,
(such as in the background while the user is reading mail).
The initial thread-stitching step is still slower than I would like.
We may have to stop using libgmime for this step as its overhead is
not worth it for the simple case of just parsing the message-id,
references, and in-reply-to headers.
2009-10-19 05:56:30 +02:00
|
|
|
#include <stdlib.h>
|
2009-10-19 21:54:40 +02:00
|
|
|
#include <stdarg.h>
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <sys/mman.h>
|
notmuch: Start actually adding messages to the index.
This is the beginning of the notmuch library as well, with its
interface in notmuch.h. So far we've got create, open, close, and
add_message (all with a notmuch_database prefix).
The current add_message function has already been whittled down from
what we have in notmuch-index-message to add only references,
message-id, and thread-id to the index, (that is---just enough to do
thread-linkage but nothing for full-text searching).
The concept here is to do something quickly so that the user can get
some data into notmuch and start using it. (The most interesting stuff
is then thread-linkage and labels like inbox and unread.) We can
defer the full-text indexing of the body of the messages for later,
(such as in the background while the user is reading mail).
The initial thread-stitching step is still slower than I would like.
We may have to stop using libgmime for this step as its overhead is
not worth it for the simple case of just parsing the message-id,
references, and in-reply-to headers.
2009-10-19 05:56:30 +02:00
|
|
|
#include <string.h>
|
2009-10-19 21:54:40 +02:00
|
|
|
#include <errno.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <ctype.h>
|
2009-10-25 08:25:59 +01:00
|
|
|
#include <assert.h>
|
notmuch: Start actually adding messages to the index.
This is the beginning of the notmuch library as well, with its
interface in notmuch.h. So far we've got create, open, close, and
add_message (all with a notmuch_database prefix).
The current add_message function has already been whittled down from
what we have in notmuch-index-message to add only references,
message-id, and thread-id to the index, (that is---just enough to do
thread-linkage but nothing for full-text searching).
The concept here is to do something quickly so that the user can get
some data into notmuch and start using it. (The most interesting stuff
is then thread-linkage and labels like inbox and unread.) We can
defer the full-text indexing of the body of the messages for later,
(such as in the background while the user is reading mail).
The initial thread-stitching step is still slower than I would like.
We may have to stop using libgmime for this step as its overhead is
not worth it for the simple case of just parsing the message-id,
references, and in-reply-to headers.
2009-10-19 05:56:30 +02:00
|
|
|
|
2009-10-21 06:03:30 +02:00
|
|
|
#include <talloc.h>
|
|
|
|
|
2017-05-06 04:26:57 +02:00
|
|
|
#include "gmime-extra.h"
|
2014-03-30 23:21:49 +02:00
|
|
|
|
2009-10-21 22:57:02 +02:00
|
|
|
#include "xutil.h"
|
2011-10-23 17:05:13 +02:00
|
|
|
#include "error_util.h"
|
2015-09-03 21:40:01 +02:00
|
|
|
#include "string-util.h"
|
2017-10-21 04:25:38 +02:00
|
|
|
#include "crypto.h"
|
2019-08-29 17:38:47 +02:00
|
|
|
#include "repair.h"
|
2009-10-21 06:03:30 +02:00
|
|
|
|
2009-10-25 22:54:13 +01:00
|
|
|
#ifdef DEBUG
|
|
|
|
# define DEBUG_DATABASE_SANITY 1
|
2018-09-03 16:00:26 +02:00
|
|
|
# define DEBUG_THREADING 1
|
2009-10-25 22:54:13 +01:00
|
|
|
# define DEBUG_QUERY 1
|
|
|
|
#endif
|
|
|
|
|
2019-06-13 12:55:35 +02:00
|
|
|
#define COMPILE_TIME_ASSERT(pred) ((void) sizeof (char[1 - 2 * ! (pred)]))
|
2009-10-25 07:58:06 +01:00
|
|
|
|
2010-11-11 23:32:17 +01:00
|
|
|
#define STRNCMP_LITERAL(var, literal) \
|
|
|
|
strncmp ((var), (literal), sizeof (literal) - 1)
|
|
|
|
|
2014-10-24 14:49:15 +02:00
|
|
|
/* Robust bit test/set/reset macros */
|
2015-02-23 17:56:14 +01:00
|
|
|
#define _NOTMUCH_VALID_BIT(bit) \
|
2015-02-23 17:56:15 +01:00
|
|
|
((bit) >= 0 && ((unsigned long) bit) < CHAR_BIT * sizeof (unsigned long long))
|
2014-10-24 14:49:15 +02:00
|
|
|
#define NOTMUCH_TEST_BIT(val, bit) \
|
2019-06-13 12:55:35 +02:00
|
|
|
(_NOTMUCH_VALID_BIT (bit) ? ! ! ((val) & (1ull << (bit))) : 0)
|
2014-10-24 14:49:15 +02:00
|
|
|
#define NOTMUCH_SET_BIT(valp, bit) \
|
2019-06-13 12:55:35 +02:00
|
|
|
(_NOTMUCH_VALID_BIT (bit) ? (*(valp) |= (1ull << (bit))) : *(valp))
|
2014-10-24 14:49:15 +02:00
|
|
|
#define NOTMUCH_CLEAR_BIT(valp, bit) \
|
2019-06-13 12:55:35 +02:00
|
|
|
(_NOTMUCH_VALID_BIT (bit) ? (*(valp) &= ~(1ull << (bit))) : *(valp))
|
2014-10-24 14:49:15 +02:00
|
|
|
|
2009-10-25 23:53:27 +01:00
|
|
|
#define unused(x) x __attribute__ ((unused))
|
|
|
|
|
2009-10-21 06:03:30 +02:00
|
|
|
/* Thanks to Andrew Tridgell's (SAMBA's) talloc for this definition of
|
|
|
|
* unlikely. The talloc source code comes to us via the GNU LGPL v. 3.
|
|
|
|
*/
|
|
|
|
/* these macros gain us a few percent of speed on gcc */
|
|
|
|
#if (__GNUC__ >= 3)
|
|
|
|
/* the strange !! is to ensure that __builtin_expect() takes either 0 or 1
|
2019-06-13 12:55:35 +02:00
|
|
|
* as its first argument */
|
2009-10-21 06:03:30 +02:00
|
|
|
#ifndef likely
|
2019-06-13 12:55:35 +02:00
|
|
|
#define likely(x) __builtin_expect (! ! (x), 1)
|
2009-10-21 06:03:30 +02:00
|
|
|
#endif
|
|
|
|
#ifndef unlikely
|
2019-06-13 12:55:35 +02:00
|
|
|
#define unlikely(x) __builtin_expect (! ! (x), 0)
|
2009-10-21 06:03:30 +02:00
|
|
|
#endif
|
|
|
|
#else
|
|
|
|
#ifndef likely
|
|
|
|
#define likely(x) (x)
|
|
|
|
#endif
|
|
|
|
#ifndef unlikely
|
|
|
|
#define unlikely(x) (x)
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
2009-10-21 09:35:56 +02:00
|
|
|
typedef enum {
|
2009-10-25 07:05:08 +01:00
|
|
|
NOTMUCH_VALUE_TIMESTAMP = 0,
|
2011-11-06 18:17:36 +01:00
|
|
|
NOTMUCH_VALUE_MESSAGE_ID,
|
|
|
|
NOTMUCH_VALUE_FROM,
|
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
|
|
|
NOTMUCH_VALUE_SUBJECT,
|
|
|
|
NOTMUCH_VALUE_LAST_MOD,
|
2009-10-21 09:35:56 +02:00
|
|
|
} notmuch_value_t;
|
|
|
|
|
2009-10-21 23:10:00 +02:00
|
|
|
/* Xapian (with flint backend) complains if we provide a term longer
|
|
|
|
* than this, but I haven't yet found a way to query the limit
|
|
|
|
* programmatically. */
|
|
|
|
#define NOTMUCH_TERM_MAX 245
|
2009-10-21 23:07:40 +02:00
|
|
|
|
2010-06-04 21:39:36 +02:00
|
|
|
#define NOTMUCH_METADATA_THREAD_ID_PREFIX "thread_id_"
|
|
|
|
|
|
|
|
/* For message IDs we have to be even more restrictive. Beyond fitting
|
|
|
|
* into the term limit, we also use message IDs to construct
|
|
|
|
* metadata-key values. And the documentation says that these should
|
|
|
|
* be restricted to about 200 characters. (The actual limit for the
|
|
|
|
* chert backend at least is 252.)
|
|
|
|
*/
|
|
|
|
#define NOTMUCH_MESSAGE_ID_MAX (200 - sizeof (NOTMUCH_METADATA_THREAD_ID_PREFIX))
|
|
|
|
|
2009-10-22 00:53:38 +02:00
|
|
|
typedef enum _notmuch_private_status {
|
|
|
|
/* First, copy all the public status values. */
|
2019-06-13 12:55:35 +02:00
|
|
|
NOTMUCH_PRIVATE_STATUS_SUCCESS = NOTMUCH_STATUS_SUCCESS,
|
|
|
|
NOTMUCH_PRIVATE_STATUS_OUT_OF_MEMORY = NOTMUCH_STATUS_OUT_OF_MEMORY,
|
|
|
|
NOTMUCH_PRIVATE_STATUS_READ_ONLY_DATABASE = NOTMUCH_STATUS_READ_ONLY_DATABASE,
|
|
|
|
NOTMUCH_PRIVATE_STATUS_XAPIAN_EXCEPTION = NOTMUCH_STATUS_XAPIAN_EXCEPTION,
|
|
|
|
NOTMUCH_PRIVATE_STATUS_FILE_NOT_EMAIL = NOTMUCH_STATUS_FILE_NOT_EMAIL,
|
|
|
|
NOTMUCH_PRIVATE_STATUS_NULL_POINTER = NOTMUCH_STATUS_NULL_POINTER,
|
|
|
|
NOTMUCH_PRIVATE_STATUS_TAG_TOO_LONG = NOTMUCH_STATUS_TAG_TOO_LONG,
|
|
|
|
NOTMUCH_PRIVATE_STATUS_UNBALANCED_FREEZE_THAW = NOTMUCH_STATUS_UNBALANCED_FREEZE_THAW,
|
2009-10-22 00:53:38 +02:00
|
|
|
|
|
|
|
/* Then add our own private values. */
|
2019-06-13 12:55:35 +02:00
|
|
|
NOTMUCH_PRIVATE_STATUS_TERM_TOO_LONG = NOTMUCH_STATUS_LAST_STATUS,
|
2009-10-23 23:24:07 +02:00
|
|
|
NOTMUCH_PRIVATE_STATUS_NO_DOCUMENT_FOUND,
|
2019-02-26 02:57:40 +01:00
|
|
|
NOTMUCH_PRIVATE_STATUS_BAD_PREFIX,
|
2009-10-22 00:53:38 +02:00
|
|
|
|
|
|
|
NOTMUCH_PRIVATE_STATUS_LAST_STATUS
|
|
|
|
} notmuch_private_status_t;
|
|
|
|
|
2009-10-25 22:54:13 +01:00
|
|
|
/* Coerce a notmuch_private_status_t value to a notmuch_status_t
|
|
|
|
* value, generating an internal error if the private value is equal
|
|
|
|
* to or greater than NOTMUCH_STATUS_LAST_STATUS. (The idea here is
|
|
|
|
* that the caller has previously handled any expected
|
|
|
|
* notmuch_private_status_t values.)
|
2012-09-24 17:21:18 +02:00
|
|
|
*
|
|
|
|
* Note that the function _internal_error does not return. Evaluating
|
|
|
|
* to NOTMUCH_STATUS_SUCCESS is done purely to appease the compiler.
|
2009-10-25 22:54:13 +01:00
|
|
|
*/
|
2019-06-13 12:55:35 +02:00
|
|
|
#define COERCE_STATUS(private_status, format, ...) \
|
|
|
|
((private_status >= (notmuch_private_status_t) NOTMUCH_STATUS_LAST_STATUS) \
|
|
|
|
? \
|
|
|
|
_internal_error (format " (%s).\n", \
|
|
|
|
##__VA_ARGS__, \
|
|
|
|
__location__), \
|
|
|
|
(notmuch_status_t) NOTMUCH_PRIVATE_STATUS_SUCCESS \
|
|
|
|
: \
|
2009-10-25 22:54:13 +01:00
|
|
|
(notmuch_status_t) private_status)
|
|
|
|
|
2012-05-18 06:13:34 +02:00
|
|
|
/* Flags shared by various lookup functions. */
|
|
|
|
typedef enum _notmuch_find_flags {
|
2012-05-18 06:13:37 +02:00
|
|
|
/* Lookup without creating any documents. This is the default
|
|
|
|
* behavior. */
|
|
|
|
NOTMUCH_FIND_LOOKUP = 0,
|
2012-05-18 06:13:34 +02:00
|
|
|
/* If set, create the necessary document (or documents) if they
|
|
|
|
* are missing. Requires a read/write database. */
|
2019-06-13 12:55:35 +02:00
|
|
|
NOTMUCH_FIND_CREATE = 1 << 0,
|
2012-05-18 06:13:34 +02:00
|
|
|
} notmuch_find_flags_t;
|
|
|
|
|
2010-11-17 20:28:26 +01:00
|
|
|
typedef struct _notmuch_doc_id_set notmuch_doc_id_set_t;
|
|
|
|
|
2009-10-27 01:35:31 +01:00
|
|
|
/* database.cc */
|
|
|
|
|
|
|
|
/* Lookup a prefix value by name.
|
|
|
|
*
|
|
|
|
* XXX: This should really be static inside of message.cc, and we can
|
|
|
|
* do that once we convert database.cc to use the
|
|
|
|
* _notmuch_message_add/remove_term functions. */
|
|
|
|
const char *
|
|
|
|
_find_prefix (const char *name);
|
|
|
|
|
2019-02-26 02:57:40 +01:00
|
|
|
/* Lookup a prefix value by name, including possibly user defined prefixes
|
|
|
|
*/
|
|
|
|
const char *
|
2019-06-13 12:55:35 +02:00
|
|
|
_notmuch_database_prefix (notmuch_database_t *notmuch, const char *name);
|
2019-02-26 02:57:40 +01:00
|
|
|
|
2014-10-07 01:17:07 +02:00
|
|
|
char *
|
|
|
|
_notmuch_message_id_compressed (void *ctx, const char *message_id);
|
|
|
|
|
2010-01-07 19:19:44 +01:00
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_database_ensure_writable (notmuch_database_t *notmuch);
|
|
|
|
|
2017-02-24 02:38:24 +01:00
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_database_reopen (notmuch_database_t *notmuch);
|
|
|
|
|
2014-12-26 09:01:01 +01:00
|
|
|
void
|
|
|
|
_notmuch_database_log (notmuch_database_t *notmuch,
|
|
|
|
const char *format, ...);
|
|
|
|
|
2016-07-15 12:25:41 +02:00
|
|
|
void
|
|
|
|
_notmuch_database_log_append (notmuch_database_t *notmuch,
|
|
|
|
const char *format, ...);
|
|
|
|
|
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
|
|
|
unsigned long
|
|
|
|
_notmuch_database_new_revision (notmuch_database_t *notmuch);
|
|
|
|
|
2009-12-19 21:32:11 +01:00
|
|
|
const char *
|
|
|
|
_notmuch_database_relative_path (notmuch_database_t *notmuch,
|
|
|
|
const char *path);
|
|
|
|
|
2009-12-20 00:11:55 +01:00
|
|
|
notmuch_status_t
|
2009-12-21 17:14:52 +01:00
|
|
|
_notmuch_database_split_path (void *ctx,
|
|
|
|
const char *path,
|
|
|
|
const char **directory,
|
|
|
|
const char **basename);
|
|
|
|
|
2010-01-05 22:29:23 +01:00
|
|
|
const char *
|
|
|
|
_notmuch_database_get_directory_db_path (const char *path);
|
|
|
|
|
2010-06-04 19:16:53 +02:00
|
|
|
unsigned int
|
|
|
|
_notmuch_database_generate_doc_id (notmuch_database_t *notmuch);
|
|
|
|
|
2010-01-05 22:29:23 +01:00
|
|
|
notmuch_private_status_t
|
|
|
|
_notmuch_database_find_unique_doc_id (notmuch_database_t *notmuch,
|
|
|
|
const char *prefix_name,
|
|
|
|
const char *value,
|
|
|
|
unsigned int *doc_id);
|
|
|
|
|
2009-12-21 17:14:52 +01:00
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_database_find_directory_id (notmuch_database_t *database,
|
|
|
|
const char *path,
|
2012-05-18 06:13:35 +02:00
|
|
|
notmuch_find_flags_t flags,
|
2009-12-21 17:14:52 +01:00
|
|
|
unsigned int *directory_id);
|
2009-12-20 00:11:55 +01:00
|
|
|
|
2009-12-21 17:23:26 +01:00
|
|
|
const char *
|
|
|
|
_notmuch_database_get_directory_path (void *ctx,
|
|
|
|
notmuch_database_t *notmuch,
|
|
|
|
unsigned int doc_id);
|
|
|
|
|
2009-12-22 00:09:56 +01:00
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_database_filename_to_direntry (void *ctx,
|
|
|
|
notmuch_database_t *notmuch,
|
|
|
|
const char *filename,
|
2012-05-18 06:13:36 +02:00
|
|
|
notmuch_find_flags_t flags,
|
2009-12-22 00:09:56 +01:00
|
|
|
char **direntry);
|
|
|
|
|
2010-01-05 22:29:23 +01:00
|
|
|
/* directory.cc */
|
|
|
|
|
|
|
|
notmuch_directory_t *
|
2020-07-19 12:36:47 +02:00
|
|
|
_notmuch_directory_find_or_create (notmuch_database_t *notmuch,
|
|
|
|
const char *path,
|
|
|
|
notmuch_find_flags_t flags,
|
|
|
|
notmuch_status_t *status_ret);
|
2010-01-05 22:29:23 +01:00
|
|
|
|
|
|
|
unsigned int
|
|
|
|
_notmuch_directory_get_document_id (notmuch_directory_t *directory);
|
|
|
|
|
2020-07-27 01:31:35 +02:00
|
|
|
notmuch_database_mode_t
|
|
|
|
_notmuch_database_mode (notmuch_database_t *notmuch);
|
|
|
|
|
2009-10-21 06:03:30 +02:00
|
|
|
/* message.cc */
|
|
|
|
|
|
|
|
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
|
|
|
|
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);
|
2009-10-23 14:53:52 +02:00
|
|
|
|
2010-11-17 20:28:26 +01:00
|
|
|
unsigned int
|
|
|
|
_notmuch_message_get_doc_id (notmuch_message_t *message);
|
|
|
|
|
2009-11-16 05:36:51 +01:00
|
|
|
const char *
|
|
|
|
_notmuch_message_get_in_reply_to (notmuch_message_t *message);
|
|
|
|
|
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);
|
|
|
|
|
|
|
|
notmuch_private_status_t
|
|
|
|
_notmuch_message_remove_term (notmuch_message_t *message,
|
|
|
|
const char *prefix_name,
|
|
|
|
const char *value);
|
|
|
|
|
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,
|
2017-10-07 10:44:05 +02:00
|
|
|
bool *result);
|
2016-04-09 03:54:50 +02:00
|
|
|
|
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);
|
|
|
|
|
2010-01-08 03:26:31 +01:00
|
|
|
void
|
|
|
|
_notmuch_message_upgrade_filename_storage (notmuch_message_t *message);
|
|
|
|
|
2014-02-08 20:20:42 +01:00
|
|
|
void
|
|
|
|
_notmuch_message_upgrade_folder (notmuch_message_t *message);
|
|
|
|
|
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
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_message_remove_filename (notmuch_message_t *message,
|
|
|
|
const char *filename);
|
|
|
|
|
2010-11-11 02:36:09 +01:00
|
|
|
notmuch_status_t
|
2010-10-31 22:29:16 +01:00
|
|
|
_notmuch_message_rename (notmuch_message_t *message,
|
|
|
|
const char *new_filename);
|
|
|
|
|
2009-10-23 14:41:17 +02:00
|
|
|
void
|
|
|
|
_notmuch_message_ensure_thread_id (notmuch_message_t *message);
|
|
|
|
|
|
|
|
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);
|
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
|
|
|
|
2019-05-28 00:40:28 +02:00
|
|
|
void
|
|
|
|
_notmuch_message_update_subject (notmuch_message_t *message,
|
|
|
|
const char *subject);
|
|
|
|
|
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
|
|
|
void
|
|
|
|
_notmuch_message_upgrade_last_mod (notmuch_message_t *message);
|
|
|
|
|
2009-10-23 14:41:17 +02:00
|
|
|
void
|
|
|
|
_notmuch_message_sync (notmuch_message_t *message);
|
|
|
|
|
2011-06-11 06:07:54 +02:00
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_message_delete (notmuch_message_t *message);
|
|
|
|
|
2014-10-23 14:30:36 +02:00
|
|
|
notmuch_private_status_t
|
|
|
|
_notmuch_message_initialize_ghost (notmuch_message_t *message,
|
|
|
|
const char *thread_id);
|
|
|
|
|
2009-11-18 03:33:42 +01:00
|
|
|
void
|
|
|
|
_notmuch_message_close (notmuch_message_t *message);
|
|
|
|
|
2010-01-09 20:13:12 +01:00
|
|
|
/* Get a copy of the data in this message document.
|
|
|
|
*
|
|
|
|
* Caller should talloc_free the result when done.
|
|
|
|
*
|
|
|
|
* This function is intended to support database upgrade and really
|
|
|
|
* shouldn't be used otherwise. */
|
|
|
|
char *
|
|
|
|
_notmuch_message_talloc_copy_data (notmuch_message_t *message);
|
|
|
|
|
|
|
|
/* Clear the data in this message document.
|
|
|
|
*
|
|
|
|
* This function is intended to support database upgrade and really
|
|
|
|
* shouldn't be used otherwise. */
|
|
|
|
void
|
|
|
|
_notmuch_message_clear_data (notmuch_message_t *message);
|
|
|
|
|
2010-04-24 20:20:53 +02:00
|
|
|
/* Set the author member of 'message' - this is the representation used
|
|
|
|
* when displaying the message */
|
|
|
|
void
|
2014-05-13 11:44:05 +02:00
|
|
|
_notmuch_message_set_author (notmuch_message_t *message, const char *author);
|
2010-04-24 20:20:53 +02:00
|
|
|
|
|
|
|
/* Get the author member of 'message' */
|
|
|
|
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
|
|
|
|
2009-10-21 00:09:51 +02:00
|
|
|
/* message-file.c */
|
2009-10-19 21:54:40 +02:00
|
|
|
|
|
|
|
/* XXX: I haven't decided yet whether these will actually get exported
|
|
|
|
* into the public interface in notmuch.h
|
|
|
|
*/
|
|
|
|
|
2009-10-21 00:09:51 +02:00
|
|
|
typedef struct _notmuch_message_file notmuch_message_file_t;
|
2009-10-19 21:54:40 +02:00
|
|
|
|
|
|
|
/* Open a file containing a single email message.
|
|
|
|
*
|
|
|
|
* The caller should call notmuch_message_close when done with this.
|
|
|
|
*
|
|
|
|
* Returns NULL if any error occurs.
|
|
|
|
*/
|
2009-10-21 00:09:51 +02:00
|
|
|
notmuch_message_file_t *
|
2014-12-26 18:34:49 +01:00
|
|
|
_notmuch_message_file_open (notmuch_database_t *notmuch, const char *filename);
|
2009-10-19 21:54:40 +02:00
|
|
|
|
2009-10-27 01:35:31 +01:00
|
|
|
/* Like notmuch_message_file_open but with 'ctx' as the talloc owner. */
|
|
|
|
notmuch_message_file_t *
|
2014-12-26 18:34:49 +01:00
|
|
|
_notmuch_message_file_open_ctx (notmuch_database_t *notmuch,
|
|
|
|
void *ctx, const char *filename);
|
2009-10-27 01:35:31 +01:00
|
|
|
|
2009-11-18 00:23:42 +01:00
|
|
|
/* Close a notmuch message previously opened with notmuch_message_open. */
|
2009-10-19 21:54:40 +02:00
|
|
|
void
|
2014-05-13 11:44:05 +02:00
|
|
|
_notmuch_message_file_close (notmuch_message_file_t *message);
|
2009-10-19 21:54:40 +02:00
|
|
|
|
2014-03-30 23:21:49 +02:00
|
|
|
/* Parse the message.
|
2009-10-19 21:54:40 +02:00
|
|
|
*
|
2014-03-30 23:21:49 +02:00
|
|
|
* This will be done automatically as necessary on other calls
|
|
|
|
* depending on it, but an explicit call allows for better error
|
|
|
|
* status reporting.
|
|
|
|
*/
|
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_message_file_parse (notmuch_message_file_t *message);
|
|
|
|
|
|
|
|
/* Get the gmime message of a message file.
|
2009-10-19 21:54:40 +02:00
|
|
|
*
|
2014-03-30 23:21:49 +02:00
|
|
|
* The message file is parsed as necessary.
|
2009-10-19 21:54:40 +02:00
|
|
|
*
|
2014-03-30 23:21:49 +02:00
|
|
|
* The GMimeMessage* is set to *mime_message on success (which the
|
|
|
|
* caller must not unref).
|
2009-10-19 21:54:40 +02:00
|
|
|
*
|
2014-03-30 23:21:49 +02:00
|
|
|
* XXX: Would be nice to not have to expose GMimeMessage here.
|
2009-10-19 21:54:40 +02:00
|
|
|
*/
|
2014-03-30 23:21:49 +02:00
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_message_file_get_mime_message (notmuch_message_file_t *message,
|
|
|
|
GMimeMessage **mime_message);
|
2009-10-19 21:54:40 +02:00
|
|
|
|
2013-08-12 20:40:35 +02:00
|
|
|
/* Get the value of the specified header from the message as a UTF-8 string.
|
2014-03-30 23:21:49 +02:00
|
|
|
*
|
|
|
|
* The message file is parsed as necessary.
|
2009-10-19 21:54:40 +02:00
|
|
|
*
|
|
|
|
* The header name is case insensitive.
|
|
|
|
*
|
2010-04-26 21:58:34 +02:00
|
|
|
* The Received: header is special - for it all Received: headers in
|
|
|
|
* the message are concatenated
|
|
|
|
*
|
2009-10-19 21:54:40 +02:00
|
|
|
* The returned value is owned by the notmuch message and is valid
|
|
|
|
* only until the message is closed. The caller should copy it if
|
|
|
|
* needing to modify the value or to hold onto it for longer.
|
|
|
|
*
|
2014-03-30 23:21:49 +02:00
|
|
|
* Returns NULL on errors, empty string if the message does not
|
|
|
|
* contain a header line matching 'header'.
|
2009-10-19 21:54:40 +02:00
|
|
|
*/
|
|
|
|
const char *
|
2014-05-13 11:44:05 +02:00
|
|
|
_notmuch_message_file_get_header (notmuch_message_file_t *message,
|
2019-06-13 12:55:35 +02:00
|
|
|
const char *header);
|
2009-10-19 21:54:40 +02:00
|
|
|
|
2017-06-04 14:32:27 +02:00
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_message_file_get_headers (notmuch_message_file_t *message_file,
|
|
|
|
const char **from_out,
|
|
|
|
const char **subject_out,
|
|
|
|
const char **to_out,
|
|
|
|
const char **date_out,
|
|
|
|
char **message_id_out);
|
|
|
|
|
|
|
|
const char *
|
|
|
|
_notmuch_message_file_get_filename (notmuch_message_file_t *message);
|
|
|
|
|
2017-06-04 14:32:34 +02:00
|
|
|
/* add-message.cc */
|
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_database_link_message_to_parents (notmuch_database_t *notmuch,
|
|
|
|
notmuch_message_t *message,
|
|
|
|
notmuch_message_file_t *message_file,
|
|
|
|
const char **thread_id);
|
2014-03-30 23:21:49 +02:00
|
|
|
/* index.cc */
|
|
|
|
|
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_message_index_file (notmuch_message_t *message,
|
2017-10-21 04:25:41 +02:00
|
|
|
notmuch_indexopts_t *indexopts,
|
2014-03-30 23:21:49 +02:00
|
|
|
notmuch_message_file_t *message_file);
|
|
|
|
|
2009-11-15 08:05:17 +01:00
|
|
|
/* messages.c */
|
|
|
|
|
2009-11-16 05:29:13 +01:00
|
|
|
typedef struct _notmuch_message_node {
|
|
|
|
notmuch_message_t *message;
|
|
|
|
struct _notmuch_message_node *next;
|
|
|
|
} notmuch_message_node_t;
|
|
|
|
|
|
|
|
typedef struct _notmuch_message_list {
|
|
|
|
notmuch_message_node_t *head;
|
|
|
|
notmuch_message_node_t **tail;
|
|
|
|
} notmuch_message_list_t;
|
|
|
|
|
2009-11-24 06:47:24 +01:00
|
|
|
/* There's a rumor that there's an alternate struct _notmuch_messages
|
|
|
|
* somewhere with some nasty C++ objects in it. We'll try to maintain
|
|
|
|
* ignorance of that here. (See notmuch_mset_messages_t in query.cc)
|
|
|
|
*/
|
2017-05-10 21:42:12 +02:00
|
|
|
struct _notmuch_messages {
|
2017-10-07 10:44:05 +02:00
|
|
|
bool is_of_list_type;
|
2012-03-01 23:30:37 +01:00
|
|
|
notmuch_doc_id_set_t *excluded_doc_ids;
|
2009-11-24 06:47:24 +01:00
|
|
|
notmuch_message_node_t *iterator;
|
|
|
|
};
|
|
|
|
|
2009-11-16 05:29:13 +01:00
|
|
|
notmuch_message_list_t *
|
|
|
|
_notmuch_message_list_create (const void *ctx);
|
2009-11-15 08:05:17 +01:00
|
|
|
|
2018-09-03 23:02:25 +02:00
|
|
|
bool
|
|
|
|
_notmuch_message_list_empty (notmuch_message_list_t *list);
|
|
|
|
|
2009-11-16 05:29:13 +01:00
|
|
|
void
|
|
|
|
_notmuch_message_list_add_message (notmuch_message_list_t *list,
|
|
|
|
notmuch_message_t *message);
|
|
|
|
|
|
|
|
notmuch_messages_t *
|
|
|
|
_notmuch_messages_create (notmuch_message_list_t *list);
|
2009-11-15 08:05:17 +01:00
|
|
|
|
2018-08-30 13:29:10 +02:00
|
|
|
bool
|
|
|
|
_notmuch_messages_has_next (notmuch_messages_t *messages);
|
|
|
|
|
2009-11-24 06:47:24 +01:00
|
|
|
/* query.cc */
|
|
|
|
|
2017-10-07 10:44:05 +02:00
|
|
|
bool
|
2010-03-09 18:22:29 +01:00
|
|
|
_notmuch_mset_messages_valid (notmuch_messages_t *messages);
|
2009-11-24 06:47:24 +01:00
|
|
|
|
|
|
|
notmuch_message_t *
|
|
|
|
_notmuch_mset_messages_get (notmuch_messages_t *messages);
|
|
|
|
|
|
|
|
void
|
2010-03-09 18:22:29 +01:00
|
|
|
_notmuch_mset_messages_move_to_next (notmuch_messages_t *messages);
|
2009-11-24 06:47:24 +01:00
|
|
|
|
2017-10-07 10:44:05 +02:00
|
|
|
bool
|
2010-11-17 20:28:26 +01:00
|
|
|
_notmuch_doc_id_set_contains (notmuch_doc_id_set_t *doc_ids,
|
2016-05-28 19:45:31 +02:00
|
|
|
unsigned int doc_id);
|
2010-11-17 20:28:26 +01:00
|
|
|
|
|
|
|
void
|
|
|
|
_notmuch_doc_id_set_remove (notmuch_doc_id_set_t *doc_ids,
|
2016-05-28 19:45:31 +02:00
|
|
|
unsigned int doc_id);
|
2010-11-17 20:28:26 +01:00
|
|
|
|
2016-04-09 03:54:49 +02:00
|
|
|
/* querying xapian documents by type (e.g. "mail" or "ghost"): */
|
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_query_search_documents (notmuch_query_t *query,
|
|
|
|
const char *type,
|
|
|
|
notmuch_messages_t **out);
|
|
|
|
|
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_query_count_documents (notmuch_query_t *query,
|
|
|
|
const char *type,
|
|
|
|
unsigned *count_out);
|
2017-06-04 14:32:26 +02:00
|
|
|
/* message-id.c */
|
|
|
|
|
|
|
|
/* Parse an RFC 822 message-id, discarding whitespace, any RFC 822
|
|
|
|
* comments, and the '<' and '>' delimiters.
|
|
|
|
*
|
|
|
|
* If not NULL, then *next will be made to point to the first character
|
|
|
|
* not parsed, (possibly pointing to the final '\0' terminator.
|
|
|
|
*
|
|
|
|
* Returns a newly talloc'ed string belonging to 'ctx'.
|
|
|
|
*
|
|
|
|
* Returns NULL if there is any error parsing the message-id. */
|
|
|
|
char *
|
|
|
|
_notmuch_message_id_parse (void *ctx, const char *message_id, const char **next);
|
|
|
|
|
2018-08-30 13:29:14 +02:00
|
|
|
/* Parse a message-id, discarding leading and trailing whitespace, and
|
|
|
|
* '<' and '>' delimiters.
|
|
|
|
*
|
|
|
|
* Apply a probably-stricter-than RFC definition of what is allowed in
|
|
|
|
* a message-id. In particular, forbid whitespace.
|
|
|
|
*
|
|
|
|
* Returns a newly talloc'ed string belonging to 'ctx'.
|
|
|
|
*
|
|
|
|
* Returns NULL if there is any error parsing the message-id.
|
|
|
|
*/
|
|
|
|
|
|
|
|
char *
|
|
|
|
_notmuch_message_id_parse_strict (void *ctx, const char *message_id);
|
|
|
|
|
2016-04-09 03:54:49 +02:00
|
|
|
|
2009-11-16 05:39:25 +01:00
|
|
|
/* message.cc */
|
|
|
|
|
|
|
|
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
|
|
|
|
2017-06-04 14:32:33 +02:00
|
|
|
void
|
|
|
|
_notmuch_message_remove_unprefixed_terms (notmuch_message_t *message);
|
2018-01-28 03:50:42 +01:00
|
|
|
|
|
|
|
const char *
|
2019-06-13 12:55:35 +02:00
|
|
|
_notmuch_message_get_thread_id_only (notmuch_message_t *message);
|
2018-01-28 03:50:42 +01:00
|
|
|
|
2018-08-30 13:29:08 +02:00
|
|
|
size_t _notmuch_message_get_thread_depth (notmuch_message_t *message);
|
|
|
|
|
|
|
|
void
|
|
|
|
_notmuch_message_label_depths (notmuch_message_t *message,
|
|
|
|
size_t depth);
|
|
|
|
|
2018-08-30 13:29:04 +02:00
|
|
|
notmuch_message_list_t *
|
|
|
|
_notmuch_message_sort_subtrees (void *ctx, notmuch_message_list_t *list);
|
|
|
|
|
2009-10-23 00:31:56 +02:00
|
|
|
/* sha1.c */
|
|
|
|
|
2009-10-23 22:54:53 +02:00
|
|
|
char *
|
2014-05-13 11:44:05 +02:00
|
|
|
_notmuch_sha1_of_string (const char *str);
|
2009-10-23 22:54:53 +02:00
|
|
|
|
2009-10-23 00:31:56 +02:00
|
|
|
char *
|
2014-05-13 11:44:05 +02:00
|
|
|
_notmuch_sha1_of_file (const char *filename);
|
2009-10-23 00:31:56 +02:00
|
|
|
|
2010-12-09 01:26:05 +01:00
|
|
|
/* string-list.c */
|
2009-10-26 17:13:19 +01:00
|
|
|
|
2010-12-09 01:26:05 +01:00
|
|
|
typedef struct _notmuch_string_node {
|
|
|
|
char *string;
|
|
|
|
struct _notmuch_string_node *next;
|
|
|
|
} notmuch_string_node_t;
|
2010-11-11 08:26:31 +01:00
|
|
|
|
2017-05-10 21:42:12 +02:00
|
|
|
typedef struct _notmuch_string_list {
|
2010-12-09 01:26:05 +01:00
|
|
|
int length;
|
|
|
|
notmuch_string_node_t *head;
|
|
|
|
notmuch_string_node_t **tail;
|
lib: fix clang build
Long story short, fix build on recent (3.2+) clang.
The long story for posterity follows.
gcc 4.6 added new warnings about structs with greater visibility than
their fields. The warnings were silenced by adjusting visibility in
commit d5523ead90b6be2b07d4af745b8ed9b980a6b9f1
Author: Carl Worth <cworth@cworth.org>
Date: Wed May 11 13:23:13 2011 -0700
Mark some structures in the library interface with visibility=default attribute.
Later on,
commit 3b76adf9e2c026dd03b820f4c6eab50e25444113
Author: Austin Clements <amdragon@MIT.EDU>
Date: Sat Jan 14 19:17:33 2012 -0500
lib: Add support for automatically excluding tags from queries
changed visibility of struct _notmuch_string_list for the same reason, and
commit 1a53f9f116fa7c460cda3df532be921baaafb082
Author: Mark Walters <markwalters1009@gmail.com>
Date: Thu Mar 1 22:30:38 2012 +0000
lib: Add the exclude flag to notmuch_query_search_threads
split the struct _notmuch_string_list and its typedef
notmuch_string_list_t as a way to make a forward declaration for
_notmuch_thread_create().
The subtle difference was that the struct definition now had 'visible'
in it, while the typedef didn't, and it was within the #pragma GCC
visibility push(hidden) block. This went unnoticed, as the then common
versions of clang didn't care about this.
A later change in clang (I did not dig into when this change was
introduced) caused the following error:
CXX -O2 lib/database.o
In file included from lib/database.cc:21:
In file included from ./lib/database-private.h:33:
./lib/notmuch-private.h:479:8: error: visibility does not match previous declaration
struct visible _notmuch_string_list {
^
./lib/notmuch-private.h:67:33: note: expanded from macro 'visible'
^
./lib/notmuch-private.h:52:13: note: previous attribute is here
^
1 error generated.
make: *** [lib/database.o] Error 1
This is slightly misleading due to the reference to the #pragma. The
real culprit is the typedef within the #pragma.
We could just add 'visible' to the typedef, or move the typedef
outside of the #pragma, and be done with it, but juggle the
declarations a bit to accommodate moving the typedef back with the
struct, and keep the visibility attribute in one place.
The problem was originally reported by Simonas Kazlauskas
<s@kazlauskas.me> in id:20130418102507.GA23688@godbox but I was only
able to reproduce and investigate now that I upgraded clang.
2013-08-17 23:30:01 +02:00
|
|
|
} notmuch_string_list_t;
|
2010-11-11 09:07:24 +01:00
|
|
|
|
2010-12-09 01:26:05 +01:00
|
|
|
notmuch_string_list_t *
|
|
|
|
_notmuch_string_list_create (const void *ctx);
|
2010-11-11 08:26:31 +01:00
|
|
|
|
2017-06-04 14:32:30 +02:00
|
|
|
/*
|
|
|
|
* return the number of strings in 'list'
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
_notmuch_string_list_length (notmuch_string_list_t *list);
|
|
|
|
|
2010-12-09 01:26:05 +01:00
|
|
|
/* Add 'string' to 'list'.
|
2010-11-11 09:07:24 +01:00
|
|
|
*
|
2010-12-09 01:26:05 +01:00
|
|
|
* The list will create its own talloced copy of 'string'.
|
2010-11-11 09:07:24 +01:00
|
|
|
*/
|
2010-11-11 08:26:31 +01:00
|
|
|
void
|
2010-12-09 01:26:05 +01:00
|
|
|
_notmuch_string_list_append (notmuch_string_list_t *list,
|
|
|
|
const char *string);
|
2010-11-11 08:26:31 +01:00
|
|
|
|
|
|
|
void
|
2010-12-09 01:26:05 +01:00
|
|
|
_notmuch_string_list_sort (notmuch_string_list_t *list);
|
|
|
|
|
2018-08-30 13:29:05 +02:00
|
|
|
const notmuch_string_list_t *
|
2019-06-13 12:55:35 +02:00
|
|
|
_notmuch_message_get_references (notmuch_message_t *message);
|
2018-08-30 13:29:05 +02:00
|
|
|
|
2016-06-13 03:05:48 +02:00
|
|
|
/* string-map.c */
|
2019-06-13 12:55:35 +02:00
|
|
|
typedef struct _notmuch_string_map notmuch_string_map_t;
|
2016-06-13 03:05:51 +02:00
|
|
|
typedef struct _notmuch_string_map_iterator notmuch_string_map_iterator_t;
|
2016-06-13 03:05:49 +02:00
|
|
|
notmuch_string_map_t *
|
|
|
|
_notmuch_string_map_create (const void *ctx);
|
|
|
|
|
|
|
|
void
|
|
|
|
_notmuch_string_map_append (notmuch_string_map_t *map,
|
|
|
|
const char *key,
|
|
|
|
const char *value);
|
|
|
|
|
2020-12-20 22:10:53 +01:00
|
|
|
void
|
|
|
|
_notmuch_string_map_set (notmuch_string_map_t *map,
|
|
|
|
const char *key,
|
|
|
|
const char *value);
|
|
|
|
|
2016-06-13 03:05:49 +02:00
|
|
|
const char *
|
|
|
|
_notmuch_string_map_get (notmuch_string_map_t *map, const char *key);
|
|
|
|
|
2016-06-13 03:05:51 +02:00
|
|
|
notmuch_string_map_iterator_t *
|
|
|
|
_notmuch_string_map_iterator_create (notmuch_string_map_t *map, const char *key,
|
2017-10-07 10:44:05 +02:00
|
|
|
bool exact);
|
2016-06-13 03:05:51 +02:00
|
|
|
|
2017-10-07 10:44:05 +02:00
|
|
|
bool
|
2016-06-13 03:05:51 +02:00
|
|
|
_notmuch_string_map_iterator_valid (notmuch_string_map_iterator_t *iter);
|
|
|
|
|
|
|
|
void
|
|
|
|
_notmuch_string_map_iterator_move_to_next (notmuch_string_map_iterator_t *iter);
|
|
|
|
|
|
|
|
const char *
|
|
|
|
_notmuch_string_map_iterator_key (notmuch_string_map_iterator_t *iterator);
|
|
|
|
|
|
|
|
const char *
|
|
|
|
_notmuch_string_map_iterator_value (notmuch_string_map_iterator_t *iterator);
|
|
|
|
|
|
|
|
void
|
|
|
|
_notmuch_string_map_iterator_destroy (notmuch_string_map_iterator_t *iterator);
|
|
|
|
|
2019-02-26 03:10:29 +01:00
|
|
|
/* Create an iterator for user headers. Destroy with
|
|
|
|
* _notmuch_string_map_iterator_destroy. Actually in database.cc*/
|
|
|
|
notmuch_string_map_iterator_t *
|
|
|
|
_notmuch_database_user_headers (notmuch_database_t *notmuch);
|
|
|
|
|
2010-12-09 01:26:05 +01:00
|
|
|
/* tags.c */
|
|
|
|
|
|
|
|
notmuch_tags_t *
|
|
|
|
_notmuch_tags_create (const void *ctx, notmuch_string_list_t *list);
|
|
|
|
|
|
|
|
/* filenames.c */
|
2010-11-11 09:07:24 +01:00
|
|
|
|
2010-12-09 01:26:05 +01:00
|
|
|
/* The notmuch_filenames_t iterates over a notmuch_string_list_t of
|
|
|
|
* file names */
|
2010-11-11 09:07:24 +01:00
|
|
|
notmuch_filenames_t *
|
|
|
|
_notmuch_filenames_create (const void *ctx,
|
2010-12-09 01:26:05 +01:00
|
|
|
notmuch_string_list_t *list);
|
2010-11-11 08:26:31 +01:00
|
|
|
|
lib: fix clang build
Long story short, fix build on recent (3.2+) clang.
The long story for posterity follows.
gcc 4.6 added new warnings about structs with greater visibility than
their fields. The warnings were silenced by adjusting visibility in
commit d5523ead90b6be2b07d4af745b8ed9b980a6b9f1
Author: Carl Worth <cworth@cworth.org>
Date: Wed May 11 13:23:13 2011 -0700
Mark some structures in the library interface with visibility=default attribute.
Later on,
commit 3b76adf9e2c026dd03b820f4c6eab50e25444113
Author: Austin Clements <amdragon@MIT.EDU>
Date: Sat Jan 14 19:17:33 2012 -0500
lib: Add support for automatically excluding tags from queries
changed visibility of struct _notmuch_string_list for the same reason, and
commit 1a53f9f116fa7c460cda3df532be921baaafb082
Author: Mark Walters <markwalters1009@gmail.com>
Date: Thu Mar 1 22:30:38 2012 +0000
lib: Add the exclude flag to notmuch_query_search_threads
split the struct _notmuch_string_list and its typedef
notmuch_string_list_t as a way to make a forward declaration for
_notmuch_thread_create().
The subtle difference was that the struct definition now had 'visible'
in it, while the typedef didn't, and it was within the #pragma GCC
visibility push(hidden) block. This went unnoticed, as the then common
versions of clang didn't care about this.
A later change in clang (I did not dig into when this change was
introduced) caused the following error:
CXX -O2 lib/database.o
In file included from lib/database.cc:21:
In file included from ./lib/database-private.h:33:
./lib/notmuch-private.h:479:8: error: visibility does not match previous declaration
struct visible _notmuch_string_list {
^
./lib/notmuch-private.h:67:33: note: expanded from macro 'visible'
^
./lib/notmuch-private.h:52:13: note: previous attribute is here
^
1 error generated.
make: *** [lib/database.o] Error 1
This is slightly misleading due to the reference to the #pragma. The
real culprit is the typedef within the #pragma.
We could just add 'visible' to the typedef, or move the typedef
outside of the #pragma, and be done with it, but juggle the
declarations a bit to accommodate moving the typedef back with the
struct, and keep the visibility attribute in one place.
The problem was originally reported by Simonas Kazlauskas
<s@kazlauskas.me> in id:20130418102507.GA23688@godbox but I was only
able to reproduce and investigate now that I upgraded clang.
2013-08-17 23:30:01 +02:00
|
|
|
/* thread.cc */
|
|
|
|
|
|
|
|
notmuch_thread_t *
|
|
|
|
_notmuch_thread_create (void *ctx,
|
|
|
|
notmuch_database_t *notmuch,
|
|
|
|
unsigned int seed_doc_id,
|
|
|
|
notmuch_doc_id_set_t *match_set,
|
|
|
|
notmuch_string_list_t *excluded_terms,
|
|
|
|
notmuch_exclude_t omit_exclude,
|
|
|
|
notmuch_sort_t sort);
|
|
|
|
|
2017-10-21 04:25:38 +02:00
|
|
|
/* indexopts.c */
|
|
|
|
|
|
|
|
struct _notmuch_indexopts {
|
|
|
|
_notmuch_crypto_t crypto;
|
|
|
|
};
|
|
|
|
|
2018-11-17 15:08:59 +01:00
|
|
|
#define CONFIG_HEADER_PREFIX "index.header."
|
|
|
|
|
2018-11-17 15:09:00 +01:00
|
|
|
#define EMPTY_STRING(s) ((s)[0] == '\0')
|
|
|
|
|
2020-08-08 16:16:37 +02:00
|
|
|
/* config.cc */
|
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_config_load_from_database (notmuch_database_t * db);
|
2020-08-08 16:16:36 +02:00
|
|
|
|
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_config_load_from_file (notmuch_database_t * db, GKeyFile *file);
|
2020-12-24 21:10:05 +01:00
|
|
|
|
|
|
|
notmuch_status_t
|
|
|
|
_notmuch_config_load_defaults (notmuch_database_t * db);
|
2020-12-24 04:35:42 +01:00
|
|
|
|
|
|
|
void
|
|
|
|
_notmuch_config_cache (notmuch_database_t *db, notmuch_config_key_t key, const char* val);
|
|
|
|
|
notmuch: Start actually adding messages to the index.
This is the beginning of the notmuch library as well, with its
interface in notmuch.h. So far we've got create, open, close, and
add_message (all with a notmuch_database prefix).
The current add_message function has already been whittled down from
what we have in notmuch-index-message to add only references,
message-id, and thread-id to the index, (that is---just enough to do
thread-linkage but nothing for full-text searching).
The concept here is to do something quickly so that the user can get
some data into notmuch and start using it. (The most interesting stuff
is then thread-linkage and labels like inbox and unread.) We can
defer the full-text indexing of the body of the messages for later,
(such as in the background while the user is reading mail).
The initial thread-stitching step is still slower than I would like.
We may have to stop using libgmime for this step as its overhead is
not worth it for the simple case of just parsing the message-id,
references, and in-reply-to headers.
2009-10-19 05:56:30 +02:00
|
|
|
NOTMUCH_END_DECLS
|
|
|
|
|
2012-04-12 22:57:39 +02:00
|
|
|
#ifdef __cplusplus
|
|
|
|
/* Implicit typecast from 'void *' to 'T *' is okay in C, but not in
|
|
|
|
* C++. In talloc_steal, an explicit cast is provided for type safety
|
|
|
|
* in some GCC versions. Otherwise, a cast is required. Provide a
|
|
|
|
* template function for this to maintain type safety, and redefine
|
|
|
|
* talloc_steal to use it.
|
|
|
|
*/
|
2019-06-13 12:55:35 +02:00
|
|
|
#if ! (__GNUC__ >= 3)
|
2012-04-12 22:57:39 +02:00
|
|
|
template <class T> T *
|
|
|
|
_notmuch_talloc_steal (const void *new_ctx, const T *ptr)
|
|
|
|
{
|
|
|
|
return static_cast<T *> (talloc_steal (new_ctx, ptr));
|
|
|
|
}
|
|
|
|
#undef talloc_steal
|
|
|
|
#define talloc_steal _notmuch_talloc_steal
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
notmuch: Start actually adding messages to the index.
This is the beginning of the notmuch library as well, with its
interface in notmuch.h. So far we've got create, open, close, and
add_message (all with a notmuch_database prefix).
The current add_message function has already been whittled down from
what we have in notmuch-index-message to add only references,
message-id, and thread-id to the index, (that is---just enough to do
thread-linkage but nothing for full-text searching).
The concept here is to do something quickly so that the user can get
some data into notmuch and start using it. (The most interesting stuff
is then thread-linkage and labels like inbox and unread.) We can
defer the full-text indexing of the body of the messages for later,
(such as in the background while the user is reading mail).
The initial thread-stitching step is still slower than I would like.
We may have to stop using libgmime for this step as its overhead is
not worth it for the simple case of just parsing the message-id,
references, and in-reply-to headers.
2009-10-19 05:56:30 +02:00
|
|
|
#endif
|