2009-10-19 21:54:40 +02:00
|
|
|
/* message.c - Utility functions for parsing an email message 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
|
|
|
|
* along with this program. If not, see http://www.gnu.org/licenses/ .
|
|
|
|
*
|
|
|
|
* Author: Carl Worth <cworth@cworth.org>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdarg.h>
|
|
|
|
|
|
|
|
#include "notmuch-private.h"
|
|
|
|
|
2009-11-02 23:32:20 +01:00
|
|
|
#include <gmime/gmime.h>
|
|
|
|
|
2009-10-19 22:40:56 +02:00
|
|
|
#include <glib.h> /* GHashTable */
|
2009-10-19 21:54:40 +02:00
|
|
|
|
2009-10-20 01:38:44 +02:00
|
|
|
typedef struct {
|
|
|
|
char *str;
|
|
|
|
size_t size;
|
|
|
|
size_t len;
|
|
|
|
} header_value_closure_t;
|
|
|
|
|
2009-10-21 00:09:51 +02:00
|
|
|
struct _notmuch_message_file {
|
2009-10-20 01:38:44 +02:00
|
|
|
/* File object */
|
|
|
|
FILE *file;
|
2009-10-19 21:54:40 +02:00
|
|
|
|
|
|
|
/* Header storage */
|
|
|
|
int restrict_headers;
|
|
|
|
GHashTable *headers;
|
2009-10-20 08:08:49 +02:00
|
|
|
int broken_headers;
|
|
|
|
int good_headers;
|
2009-10-29 16:51:12 +01:00
|
|
|
size_t header_size; /* Length of full message header in bytes. */
|
2009-10-19 21:54:40 +02:00
|
|
|
|
|
|
|
/* Parsing state */
|
2009-10-20 01:38:44 +02:00
|
|
|
char *line;
|
|
|
|
size_t line_size;
|
|
|
|
header_value_closure_t value;
|
|
|
|
|
2009-10-19 21:54:40 +02:00
|
|
|
int parsing_started;
|
|
|
|
int parsing_finished;
|
|
|
|
};
|
|
|
|
|
|
|
|
static int
|
|
|
|
strcase_equal (const void *a, const void *b)
|
|
|
|
{
|
|
|
|
return strcasecmp (a, b) == 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned int
|
|
|
|
strcase_hash (const void *ptr)
|
|
|
|
{
|
|
|
|
const char *s = ptr;
|
|
|
|
|
|
|
|
/* This is the djb2 hash. */
|
|
|
|
unsigned int hash = 5381;
|
|
|
|
while (s && *s) {
|
|
|
|
hash = ((hash << 5) + hash) + tolower (*s);
|
|
|
|
s++;
|
|
|
|
}
|
|
|
|
|
|
|
|
return hash;
|
|
|
|
}
|
|
|
|
|
2009-10-27 01:35:31 +01:00
|
|
|
static int
|
|
|
|
_notmuch_message_file_destructor (notmuch_message_file_t *message)
|
|
|
|
{
|
|
|
|
if (message->line)
|
|
|
|
free (message->line);
|
|
|
|
|
|
|
|
if (message->value.size)
|
|
|
|
free (message->value.str);
|
|
|
|
|
|
|
|
if (message->headers)
|
|
|
|
g_hash_table_destroy (message->headers);
|
|
|
|
|
|
|
|
if (message->file)
|
|
|
|
fclose (message->file);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Create a new notmuch_message_file_t for 'filename' with 'ctx' as
|
|
|
|
* the talloc owner. */
|
2009-10-21 00:09:51 +02:00
|
|
|
notmuch_message_file_t *
|
2009-10-27 01:35:31 +01:00
|
|
|
_notmuch_message_file_open_ctx (void *ctx, const char *filename)
|
2009-10-19 21:54:40 +02:00
|
|
|
{
|
2009-10-21 00:09:51 +02:00
|
|
|
notmuch_message_file_t *message;
|
2009-10-19 21:54:40 +02:00
|
|
|
|
2009-10-27 01:35:31 +01:00
|
|
|
message = talloc_zero (ctx, notmuch_message_file_t);
|
|
|
|
if (unlikely (message == NULL))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
talloc_set_destructor (message, _notmuch_message_file_destructor);
|
2009-10-19 21:54:40 +02:00
|
|
|
|
2009-10-20 01:38:44 +02:00
|
|
|
message->file = fopen (filename, "r");
|
|
|
|
if (message->file == NULL)
|
2009-10-19 21:54:40 +02:00
|
|
|
goto FAIL;
|
|
|
|
|
|
|
|
message->headers = g_hash_table_new_full (strcase_hash,
|
|
|
|
strcase_equal,
|
|
|
|
free,
|
|
|
|
free);
|
|
|
|
|
|
|
|
message->parsing_started = 0;
|
|
|
|
message->parsing_finished = 0;
|
|
|
|
|
|
|
|
return message;
|
|
|
|
|
|
|
|
FAIL:
|
|
|
|
fprintf (stderr, "Error opening %s: %s\n", filename, strerror (errno));
|
2009-10-21 00:09:51 +02:00
|
|
|
notmuch_message_file_close (message);
|
2009-10-19 21:54:40 +02:00
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2009-10-27 01:35:31 +01:00
|
|
|
notmuch_message_file_t *
|
|
|
|
notmuch_message_file_open (const char *filename)
|
|
|
|
{
|
|
|
|
return _notmuch_message_file_open_ctx (NULL, filename);
|
|
|
|
}
|
|
|
|
|
2009-10-19 21:54:40 +02:00
|
|
|
void
|
2009-10-21 00:09:51 +02:00
|
|
|
notmuch_message_file_close (notmuch_message_file_t *message)
|
2009-10-19 21:54:40 +02:00
|
|
|
{
|
2009-10-26 23:17:10 +01:00
|
|
|
talloc_free (message);
|
2009-10-19 21:54:40 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2009-10-21 00:09:51 +02:00
|
|
|
notmuch_message_file_restrict_headersv (notmuch_message_file_t *message,
|
|
|
|
va_list va_headers)
|
2009-10-19 21:54:40 +02:00
|
|
|
{
|
|
|
|
char *header;
|
|
|
|
|
2009-10-25 18:22:41 +01:00
|
|
|
if (message->parsing_started)
|
|
|
|
INTERNAL_ERROR ("notmuch_message_file_restrict_headers called after parsing has started");
|
2009-10-19 21:54:40 +02:00
|
|
|
|
|
|
|
while (1) {
|
|
|
|
header = va_arg (va_headers, char*);
|
|
|
|
if (header == NULL)
|
|
|
|
break;
|
|
|
|
g_hash_table_insert (message->headers,
|
|
|
|
xstrdup (header), NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
message->restrict_headers = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2009-10-21 00:09:51 +02:00
|
|
|
notmuch_message_file_restrict_headers (notmuch_message_file_t *message, ...)
|
2009-10-19 21:54:40 +02:00
|
|
|
{
|
|
|
|
va_list va_headers;
|
|
|
|
|
|
|
|
va_start (va_headers, message);
|
|
|
|
|
2009-10-21 00:09:51 +02:00
|
|
|
notmuch_message_file_restrict_headersv (message, va_headers);
|
2009-10-19 21:54:40 +02:00
|
|
|
}
|
|
|
|
|
2009-10-25 23:58:05 +01:00
|
|
|
static void
|
2009-10-20 01:38:44 +02:00
|
|
|
copy_header_unfolding (header_value_closure_t *value,
|
|
|
|
const char *chunk)
|
|
|
|
{
|
|
|
|
char *last;
|
|
|
|
|
|
|
|
if (chunk == NULL)
|
|
|
|
return;
|
|
|
|
|
|
|
|
while (*chunk == ' ' || *chunk == '\t')
|
|
|
|
chunk++;
|
|
|
|
|
|
|
|
if (value->len + 1 + strlen (chunk) + 1 > value->size) {
|
2009-10-25 23:39:53 +01:00
|
|
|
unsigned int new_size = value->size;
|
2009-10-20 01:38:44 +02:00
|
|
|
if (value->size == 0)
|
|
|
|
new_size = strlen (chunk) + 1;
|
|
|
|
else
|
|
|
|
while (value->len + 1 + strlen (chunk) + 1 > new_size)
|
|
|
|
new_size *= 2;
|
|
|
|
value->str = xrealloc (value->str, new_size);
|
|
|
|
value->size = new_size;
|
2009-10-19 21:54:40 +02:00
|
|
|
}
|
|
|
|
|
2009-10-20 01:38:44 +02:00
|
|
|
last = value->str + value->len;
|
|
|
|
if (value->len) {
|
|
|
|
*last = ' ';
|
|
|
|
last++;
|
|
|
|
value->len++;
|
2009-10-19 21:54:40 +02:00
|
|
|
}
|
|
|
|
|
2009-10-20 01:38:44 +02:00
|
|
|
strcpy (last, chunk);
|
|
|
|
value->len += strlen (chunk);
|
2009-10-19 21:54:40 +02:00
|
|
|
|
2009-10-20 01:38:44 +02:00
|
|
|
last = value->str + value->len - 1;
|
|
|
|
if (*last == '\n') {
|
|
|
|
*last = '\0';
|
|
|
|
value->len--;
|
|
|
|
}
|
2009-10-19 21:54:40 +02:00
|
|
|
}
|
|
|
|
|
2009-10-29 16:51:12 +01:00
|
|
|
/* As a special-case, a value of NULL for header_desired will force
|
|
|
|
* the entire header to be parsed if it is not parsed already. This is
|
|
|
|
* used by the _notmuch_message_file_get_headers_end function. */
|
2009-10-19 21:54:40 +02:00
|
|
|
const char *
|
2009-10-21 00:09:51 +02:00
|
|
|
notmuch_message_file_get_header (notmuch_message_file_t *message,
|
|
|
|
const char *header_desired)
|
2009-10-19 21:54:40 +02:00
|
|
|
{
|
|
|
|
int contains;
|
2009-11-02 23:32:20 +01:00
|
|
|
char *header, *decoded_value;
|
2009-10-20 01:38:44 +02:00
|
|
|
const char *s, *colon;
|
2009-10-19 21:54:40 +02:00
|
|
|
int match;
|
2009-11-02 23:32:20 +01:00
|
|
|
static int initialized = 0;
|
|
|
|
|
|
|
|
if (! initialized) {
|
|
|
|
g_mime_init (0);
|
|
|
|
initialized = 1;
|
|
|
|
}
|
2009-10-19 21:54:40 +02:00
|
|
|
|
|
|
|
message->parsing_started = 1;
|
|
|
|
|
2009-10-29 16:51:12 +01:00
|
|
|
if (header_desired == NULL)
|
|
|
|
contains = 0;
|
|
|
|
else
|
|
|
|
contains = g_hash_table_lookup_extended (message->headers,
|
|
|
|
header_desired, NULL,
|
2009-11-02 23:32:20 +01:00
|
|
|
(gpointer *) &decoded_value);
|
2009-10-29 16:51:12 +01:00
|
|
|
|
2009-11-02 23:32:20 +01:00
|
|
|
if (contains && decoded_value)
|
|
|
|
return decoded_value;
|
2009-10-19 21:54:40 +02:00
|
|
|
|
|
|
|
if (message->parsing_finished)
|
2009-11-12 08:00:58 +01:00
|
|
|
return "";
|
2009-10-19 21:54:40 +02:00
|
|
|
|
2009-10-20 01:38:44 +02:00
|
|
|
#define NEXT_HEADER_LINE(closure) \
|
2009-10-29 16:51:12 +01:00
|
|
|
while (1) { \
|
2009-10-20 01:38:44 +02:00
|
|
|
ssize_t bytes_read = getline (&message->line, \
|
|
|
|
&message->line_size, \
|
|
|
|
message->file); \
|
|
|
|
if (bytes_read == -1) { \
|
|
|
|
message->parsing_finished = 1; \
|
|
|
|
break; \
|
|
|
|
} \
|
|
|
|
if (*message->line == '\n') { \
|
|
|
|
message->parsing_finished = 1; \
|
|
|
|
break; \
|
|
|
|
} \
|
|
|
|
if (closure && \
|
|
|
|
(*message->line == ' ' || *message->line == '\t')) \
|
|
|
|
{ \
|
|
|
|
copy_header_unfolding ((closure), message->line); \
|
|
|
|
} \
|
2009-10-29 16:51:12 +01:00
|
|
|
if (*message->line == ' ' || *message->line == '\t') \
|
|
|
|
message->header_size += strlen (message->line); \
|
|
|
|
else \
|
|
|
|
break; \
|
|
|
|
}
|
2009-10-20 01:38:44 +02:00
|
|
|
|
|
|
|
if (message->line == NULL)
|
|
|
|
NEXT_HEADER_LINE (NULL);
|
2009-10-19 21:54:40 +02:00
|
|
|
|
2009-10-20 01:38:44 +02:00
|
|
|
while (1) {
|
2009-10-19 21:54:40 +02:00
|
|
|
|
2009-10-20 01:38:44 +02:00
|
|
|
if (message->parsing_finished)
|
|
|
|
break;
|
2009-10-19 21:54:40 +02:00
|
|
|
|
2009-10-20 01:38:44 +02:00
|
|
|
colon = strchr (message->line, ':');
|
2009-10-19 21:54:40 +02:00
|
|
|
|
2009-10-20 01:38:44 +02:00
|
|
|
if (colon == NULL) {
|
2009-10-20 08:08:49 +02:00
|
|
|
message->broken_headers++;
|
|
|
|
/* A simple heuristic for giving up on things that just
|
|
|
|
* don't look like mail messages. */
|
|
|
|
if (message->broken_headers >= 10 &&
|
|
|
|
message->good_headers < 5)
|
|
|
|
{
|
|
|
|
message->parsing_finished = 1;
|
|
|
|
continue;
|
|
|
|
}
|
2009-10-20 01:38:44 +02:00
|
|
|
NEXT_HEADER_LINE (NULL);
|
2009-10-19 21:54:40 +02:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2009-10-29 16:51:12 +01:00
|
|
|
message->header_size += strlen (message->line);
|
|
|
|
|
2009-10-20 08:08:49 +02:00
|
|
|
message->good_headers++;
|
|
|
|
|
2009-10-20 01:38:44 +02:00
|
|
|
header = xstrndup (message->line, colon - message->line);
|
2009-10-19 21:54:40 +02:00
|
|
|
|
|
|
|
if (message->restrict_headers &&
|
|
|
|
! g_hash_table_lookup_extended (message->headers,
|
|
|
|
header, NULL, NULL))
|
|
|
|
{
|
|
|
|
free (header);
|
2009-10-20 01:38:44 +02:00
|
|
|
NEXT_HEADER_LINE (NULL);
|
2009-10-19 21:54:40 +02:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
s = colon + 1;
|
2009-10-20 01:38:44 +02:00
|
|
|
while (*s == ' ' || *s == '\t')
|
|
|
|
s++;
|
2009-10-19 21:54:40 +02:00
|
|
|
|
2009-10-20 01:38:44 +02:00
|
|
|
message->value.len = 0;
|
|
|
|
copy_header_unfolding (&message->value, s);
|
2009-10-19 21:54:40 +02:00
|
|
|
|
2009-10-20 01:38:44 +02:00
|
|
|
NEXT_HEADER_LINE (&message->value);
|
2009-10-19 21:54:40 +02:00
|
|
|
|
2009-10-29 16:51:12 +01:00
|
|
|
if (header_desired == 0)
|
|
|
|
match = 0;
|
|
|
|
else
|
|
|
|
match = (strcasecmp (header, header_desired) == 0);
|
2009-10-19 21:54:40 +02:00
|
|
|
|
2009-11-02 23:32:20 +01:00
|
|
|
decoded_value = g_mime_utils_header_decode_text (message->value.str);
|
2009-10-20 18:52:01 +02:00
|
|
|
|
2009-11-02 23:32:20 +01:00
|
|
|
g_hash_table_insert (message->headers, header, decoded_value);
|
2009-10-19 21:54:40 +02:00
|
|
|
|
|
|
|
if (match)
|
2009-11-02 23:32:20 +01:00
|
|
|
return decoded_value;
|
2009-10-19 21:54:40 +02:00
|
|
|
}
|
2009-10-20 01:38:44 +02:00
|
|
|
|
|
|
|
if (message->line)
|
|
|
|
free (message->line);
|
|
|
|
message->line = NULL;
|
|
|
|
|
|
|
|
if (message->value.size) {
|
|
|
|
free (message->value.str);
|
|
|
|
message->value.str = NULL;
|
|
|
|
message->value.size = 0;
|
|
|
|
message->value.len = 0;
|
|
|
|
}
|
|
|
|
|
2009-10-23 00:46:22 +02:00
|
|
|
/* We've parsed all headers and never found the one we're looking
|
|
|
|
* for. It's probably just not there, but let's check that we
|
|
|
|
* didn't make a mistake preventing us from seeing it. */
|
2009-10-29 16:51:12 +01:00
|
|
|
if (message->restrict_headers && header_desired &&
|
2009-10-23 00:46:22 +02:00
|
|
|
! g_hash_table_lookup_extended (message->headers,
|
|
|
|
header_desired, NULL, NULL))
|
|
|
|
{
|
2009-10-25 18:22:41 +01:00
|
|
|
INTERNAL_ERROR ("Attempt to get header \"%s\" which was not\n"
|
|
|
|
"included in call to notmuch_message_file_restrict_headers\n",
|
|
|
|
header_desired);
|
2009-10-23 00:46:22 +02:00
|
|
|
}
|
|
|
|
|
2009-11-12 08:00:58 +01:00
|
|
|
return "";
|
2009-10-19 21:54:40 +02:00
|
|
|
}
|