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
|
|
|
/* xutil.c - Various wrapper functions to abort on error.
|
|
|
|
*
|
|
|
|
* Copyright © 2009 Carl Worth
|
|
|
|
*
|
|
|
|
* This program is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program. If not, see http://www.gnu.org/licenses/ .
|
|
|
|
*
|
|
|
|
* Author: Carl Worth <cworth@cworth.org>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "notmuch-private.h"
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
|
|
|
void *
|
|
|
|
xcalloc (size_t nmemb, size_t size)
|
|
|
|
{
|
|
|
|
void *ret;
|
|
|
|
|
|
|
|
ret = calloc (nmemb, size);
|
|
|
|
if (ret == NULL) {
|
|
|
|
fprintf (stderr, "Out of memory.\n");
|
|
|
|
exit (1);
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
void *
|
|
|
|
xmalloc (size_t size)
|
|
|
|
{
|
|
|
|
void *ret;
|
|
|
|
|
|
|
|
ret = malloc (size);
|
|
|
|
if (ret == NULL) {
|
|
|
|
fprintf (stderr, "Out of memory.\n");
|
|
|
|
exit (1);
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
void *
|
|
|
|
xrealloc (void *ptr, size_t size)
|
|
|
|
{
|
|
|
|
void *ret;
|
|
|
|
|
|
|
|
ret = realloc (ptr, size);
|
|
|
|
if (ret == NULL) {
|
|
|
|
fprintf (stderr, "Out of memory.\n");
|
|
|
|
exit (1);
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
char *
|
|
|
|
xstrdup (const char *s)
|
|
|
|
{
|
|
|
|
char *ret;
|
|
|
|
|
|
|
|
ret = strdup (s);
|
|
|
|
if (ret == NULL) {
|
|
|
|
fprintf (stderr, "Out of memory.\n");
|
|
|
|
exit (1);
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
char *
|
|
|
|
xstrndup (const char *s, size_t n)
|
|
|
|
{
|
|
|
|
char *ret;
|
|
|
|
|
2009-12-01 21:51:39 +01:00
|
|
|
if (strlen (s) <= n)
|
|
|
|
n = strlen (s);
|
|
|
|
|
|
|
|
ret = malloc (n + 1);
|
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
|
|
|
if (ret == NULL) {
|
|
|
|
fprintf (stderr, "Out of memory.\n");
|
|
|
|
exit (1);
|
|
|
|
}
|
2009-12-01 21:51:39 +01:00
|
|
|
memcpy (ret, s, n);
|
|
|
|
ret[n] = '\0';
|
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
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2009-10-22 00:06:52 +02:00
|
|
|
|
|
|
|
void
|
|
|
|
xregcomp (regex_t *preg, const char *regex, int cflags)
|
|
|
|
{
|
|
|
|
int rerr;
|
|
|
|
|
|
|
|
rerr = regcomp (preg, regex, cflags);
|
|
|
|
if (rerr) {
|
|
|
|
size_t error_size = regerror (rerr, preg, NULL, 0);
|
|
|
|
char *error = xmalloc (error_size);
|
|
|
|
|
|
|
|
regerror (rerr, preg, error, error_size);
|
2009-10-25 18:22:41 +01:00
|
|
|
INTERNAL_ERROR ("compiling regex %s: %s\n",
|
|
|
|
regex, error);
|
2009-10-22 00:06:52 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
xregexec (const regex_t *preg, const char *string,
|
|
|
|
size_t nmatch, regmatch_t pmatch[], int eflags)
|
|
|
|
{
|
2009-10-25 23:39:53 +01:00
|
|
|
unsigned int i;
|
|
|
|
int rerr;
|
2009-10-22 00:06:52 +02:00
|
|
|
|
|
|
|
rerr = regexec (preg, string, nmatch, pmatch, eflags);
|
|
|
|
if (rerr)
|
|
|
|
return rerr;
|
|
|
|
|
|
|
|
for (i = 0; i < nmatch; i++) {
|
2009-10-25 18:22:41 +01:00
|
|
|
if (pmatch[i].rm_so == -1)
|
|
|
|
INTERNAL_ERROR ("matching regex against %s: Sub-match %d not found\n",
|
|
|
|
string, i);
|
2009-10-22 00:06:52 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|