2009-10-28 18:42:07 +01:00
|
|
|
/*
|
|
|
|
* 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-28 18:42:07 +01:00
|
|
|
*
|
|
|
|
* Author: Carl Worth <cworth@cworth.org>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "notmuch-private.h"
|
|
|
|
|
|
|
|
#include <gmime/gmime.h>
|
2010-02-05 02:08:11 +01:00
|
|
|
#include <gmime/gmime-filter.h>
|
2009-10-28 18:42:07 +01:00
|
|
|
|
|
|
|
#include <xapian.h>
|
|
|
|
|
2017-06-08 04:11:47 +02:00
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
int state;
|
|
|
|
int a;
|
|
|
|
int b;
|
|
|
|
int next_if_match;
|
|
|
|
int next_if_not_match;
|
|
|
|
} scanner_state_t;
|
|
|
|
|
|
|
|
/* Simple, linear state-transition diagram for the uuencode filter.
|
|
|
|
*
|
|
|
|
* If the character being processed is within the range of [a, b]
|
|
|
|
* for the current state then we transition next_if_match
|
|
|
|
* state. If not, we transition to the next_if_not_match state.
|
|
|
|
*
|
|
|
|
* The final two states are special in that they are the states in
|
|
|
|
* which we discard data. */
|
|
|
|
static const int first_uuencode_skipping_state = 11;
|
|
|
|
static const scanner_state_t uuencode_states[] = {
|
|
|
|
{0, 'b', 'b', 1, 0},
|
|
|
|
{1, 'e', 'e', 2, 0},
|
|
|
|
{2, 'g', 'g', 3, 0},
|
|
|
|
{3, 'i', 'i', 4, 0},
|
|
|
|
{4, 'n', 'n', 5, 0},
|
|
|
|
{5, ' ', ' ', 6, 0},
|
|
|
|
{6, '0', '7', 7, 0},
|
|
|
|
{7, '0', '7', 8, 0},
|
|
|
|
{8, '0', '7', 9, 0},
|
|
|
|
{9, ' ', ' ', 10, 0},
|
|
|
|
{10, '\n', '\n', 11, 10},
|
|
|
|
{11, 'M', 'M', 12, 0},
|
|
|
|
{12, ' ', '`', 12, 11}
|
|
|
|
};
|
|
|
|
|
2017-06-08 04:11:49 +02:00
|
|
|
/* The following table is intended to implement this DFA (in 'dot'
|
|
|
|
format). Note that 2 and 3 are "hidden" states used to step through
|
|
|
|
the possible out edges of state 1.
|
|
|
|
|
|
|
|
digraph html_filter {
|
|
|
|
0 -> 1 [label="<"];
|
|
|
|
0 -> 0;
|
|
|
|
1 -> 4 [label="'"];
|
|
|
|
1 -> 5 [label="\""];
|
|
|
|
1 -> 0 [label=">"];
|
|
|
|
1 -> 1;
|
|
|
|
4 -> 1 [label="'"];
|
|
|
|
4 -> 4;
|
|
|
|
5 -> 1 [label="\""];
|
|
|
|
5 -> 5;
|
|
|
|
}
|
|
|
|
*/
|
|
|
|
static const int first_html_skipping_state = 1;
|
|
|
|
static const scanner_state_t html_states[] = {
|
|
|
|
{0, '<', '<', 1, 0},
|
|
|
|
{1, '\'', '\'', 4, 2}, /* scanning for quote or > */
|
|
|
|
{1, '"', '"', 5, 3},
|
|
|
|
{1, '>', '>', 0, 1},
|
|
|
|
{4, '\'', '\'', 1, 4}, /* inside single quotes */
|
|
|
|
{5, '"', '"', 1, 5}, /* inside double quotes */
|
|
|
|
};
|
|
|
|
|
2010-02-05 02:26:00 +01:00
|
|
|
/* Oh, how I wish that gobject didn't require so much noisy boilerplate!
|
|
|
|
* (Though I have at least eliminated some of the stock set...) */
|
2017-06-08 04:11:46 +02:00
|
|
|
typedef struct _NotmuchFilterDiscardNonTerm NotmuchFilterDiscardNonTerm;
|
|
|
|
typedef struct _NotmuchFilterDiscardNonTermClass NotmuchFilterDiscardNonTermClass;
|
2010-02-05 02:08:11 +01:00
|
|
|
|
|
|
|
/**
|
2017-06-08 04:11:46 +02:00
|
|
|
* NotmuchFilterDiscardNonTerm:
|
2010-02-05 02:08:11 +01:00
|
|
|
*
|
|
|
|
* @parent_object: parent #GMimeFilter
|
|
|
|
* @encode: encoding vs decoding
|
|
|
|
* @state: State of the parser
|
|
|
|
*
|
|
|
|
* A filter to discard uuencoded portions of an email.
|
|
|
|
*
|
|
|
|
* A uuencoded portion is identified as beginning with a line
|
|
|
|
* matching:
|
|
|
|
*
|
|
|
|
* begin [0-7][0-7][0-7] .*
|
|
|
|
*
|
|
|
|
* After that detection, and beginning with the following line,
|
|
|
|
* characters will be discarded as long as the first character of each
|
|
|
|
* line begins with M and subsequent characters on the line are within
|
|
|
|
* the range of ASCII characters from ' ' to '`'.
|
|
|
|
*
|
|
|
|
* This is not a perfect UUencode filter. It's possible to have a
|
|
|
|
* message that will legitimately match that pattern, (so that some
|
|
|
|
* legitimate content is discarded). And for most UUencoded files, the
|
|
|
|
* final line of encoded data (the line not starting with M) will be
|
|
|
|
* indexed.
|
|
|
|
**/
|
2017-06-08 04:11:46 +02:00
|
|
|
struct _NotmuchFilterDiscardNonTerm {
|
2010-02-05 02:08:11 +01:00
|
|
|
GMimeFilter parent_object;
|
2017-06-08 04:11:49 +02:00
|
|
|
GMimeContentType *content_type;
|
2010-02-05 02:08:11 +01:00
|
|
|
int state;
|
2017-06-08 04:11:47 +02:00
|
|
|
int first_skipping_state;
|
|
|
|
const scanner_state_t *states;
|
2010-02-05 02:08:11 +01:00
|
|
|
};
|
|
|
|
|
2017-06-08 04:11:46 +02:00
|
|
|
struct _NotmuchFilterDiscardNonTermClass {
|
2010-02-05 02:08:11 +01:00
|
|
|
GMimeFilterClass parent_class;
|
|
|
|
};
|
|
|
|
|
2017-06-08 04:11:49 +02:00
|
|
|
static GMimeFilter *notmuch_filter_discard_non_term_new (GMimeContentType *content);
|
2010-02-05 02:08:11 +01:00
|
|
|
|
2017-06-08 04:11:46 +02:00
|
|
|
static void notmuch_filter_discard_non_term_finalize (GObject *object);
|
2010-02-05 02:08:11 +01:00
|
|
|
|
|
|
|
static GMimeFilter *filter_copy (GMimeFilter *filter);
|
|
|
|
static void filter_filter (GMimeFilter *filter, char *in, size_t len, size_t prespace,
|
|
|
|
char **out, size_t *outlen, size_t *outprespace);
|
|
|
|
static void filter_complete (GMimeFilter *filter, char *in, size_t len, size_t prespace,
|
|
|
|
char **out, size_t *outlen, size_t *outprespace);
|
|
|
|
static void filter_reset (GMimeFilter *filter);
|
|
|
|
|
|
|
|
|
|
|
|
static GMimeFilterClass *parent_class = NULL;
|
|
|
|
|
|
|
|
static void
|
2017-06-08 04:11:46 +02:00
|
|
|
notmuch_filter_discard_non_term_class_init (NotmuchFilterDiscardNonTermClass *klass)
|
2010-02-05 02:08:11 +01:00
|
|
|
{
|
|
|
|
GObjectClass *object_class = G_OBJECT_CLASS (klass);
|
|
|
|
GMimeFilterClass *filter_class = GMIME_FILTER_CLASS (klass);
|
|
|
|
|
|
|
|
parent_class = (GMimeFilterClass *) g_type_class_ref (GMIME_TYPE_FILTER);
|
|
|
|
|
2017-06-08 04:11:46 +02:00
|
|
|
object_class->finalize = notmuch_filter_discard_non_term_finalize;
|
2010-02-05 02:08:11 +01:00
|
|
|
|
|
|
|
filter_class->copy = filter_copy;
|
|
|
|
filter_class->filter = filter_filter;
|
|
|
|
filter_class->complete = filter_complete;
|
|
|
|
filter_class->reset = filter_reset;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
2017-06-08 04:11:46 +02:00
|
|
|
notmuch_filter_discard_non_term_finalize (GObject *object)
|
2010-02-05 02:08:11 +01:00
|
|
|
{
|
|
|
|
G_OBJECT_CLASS (parent_class)->finalize (object);
|
|
|
|
}
|
|
|
|
|
|
|
|
static GMimeFilter *
|
|
|
|
filter_copy (GMimeFilter *gmime_filter)
|
|
|
|
{
|
2017-06-08 04:11:49 +02:00
|
|
|
NotmuchFilterDiscardNonTerm *filter = (NotmuchFilterDiscardNonTerm *) gmime_filter;
|
|
|
|
return notmuch_filter_discard_non_term_new (filter->content_type);
|
2010-02-05 02:08:11 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
filter_filter (GMimeFilter *gmime_filter, char *inbuf, size_t inlen, size_t prespace,
|
|
|
|
char **outbuf, size_t *outlen, size_t *outprespace)
|
|
|
|
{
|
2017-06-08 04:11:46 +02:00
|
|
|
NotmuchFilterDiscardNonTerm *filter = (NotmuchFilterDiscardNonTerm *) gmime_filter;
|
2017-06-08 04:11:47 +02:00
|
|
|
const scanner_state_t *states = filter->states;
|
2010-02-05 02:08:11 +01:00
|
|
|
register const char *inptr = inbuf;
|
|
|
|
const char *inend = inbuf + inlen;
|
|
|
|
char *outptr;
|
|
|
|
|
|
|
|
(void) prespace;
|
|
|
|
|
|
|
|
int next;
|
|
|
|
|
2017-10-07 10:44:05 +02:00
|
|
|
g_mime_filter_set_size (gmime_filter, inlen, false);
|
2010-02-05 02:08:11 +01:00
|
|
|
outptr = gmime_filter->outbuf;
|
|
|
|
|
2017-06-08 04:11:48 +02:00
|
|
|
next = filter->state;
|
2010-02-05 02:08:11 +01:00
|
|
|
while (inptr < inend) {
|
2017-06-08 04:11:48 +02:00
|
|
|
/* Each state is defined by a contiguous set of rows of the
|
|
|
|
* state table marked by a common value for '.state'. The
|
|
|
|
* state numbers must be equal to the index of the first row
|
|
|
|
* in a given state; thus the loop condition here looks for a
|
|
|
|
* jump to a first row of a state, which is a real transition
|
|
|
|
* in the underlying DFA.
|
|
|
|
*/
|
|
|
|
do {
|
|
|
|
if (*inptr >= states[next].a && *inptr <= states[next].b) {
|
|
|
|
next = states[next].next_if_match;
|
|
|
|
} else {
|
|
|
|
next = states[next].next_if_not_match;
|
|
|
|
}
|
|
|
|
|
|
|
|
} while (next != states[next].state);
|
2010-02-05 02:08:11 +01:00
|
|
|
|
2017-06-08 04:11:47 +02:00
|
|
|
if (filter->state < filter->first_skipping_state)
|
2010-02-05 02:08:11 +01:00
|
|
|
*outptr++ = *inptr;
|
|
|
|
|
|
|
|
filter->state = next;
|
|
|
|
inptr++;
|
|
|
|
}
|
|
|
|
|
|
|
|
*outlen = outptr - gmime_filter->outbuf;
|
|
|
|
*outprespace = gmime_filter->outpre;
|
|
|
|
*outbuf = gmime_filter->outbuf;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
filter_complete (GMimeFilter *filter, char *inbuf, size_t inlen, size_t prespace,
|
|
|
|
char **outbuf, size_t *outlen, size_t *outprespace)
|
|
|
|
{
|
|
|
|
if (inbuf && inlen)
|
|
|
|
filter_filter (filter, inbuf, inlen, prespace, outbuf, outlen, outprespace);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
filter_reset (GMimeFilter *gmime_filter)
|
|
|
|
{
|
2017-06-08 04:11:46 +02:00
|
|
|
NotmuchFilterDiscardNonTerm *filter = (NotmuchFilterDiscardNonTerm *) gmime_filter;
|
2010-02-05 02:08:11 +01:00
|
|
|
|
|
|
|
filter->state = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2017-06-08 04:11:46 +02:00
|
|
|
* notmuch_filter_discard_non_term_new:
|
2010-02-05 02:08:11 +01:00
|
|
|
*
|
2017-06-08 04:11:46 +02:00
|
|
|
* Returns: a new #NotmuchFilterDiscardNonTerm filter.
|
2010-02-05 02:08:11 +01:00
|
|
|
**/
|
2010-11-02 05:58:43 +01:00
|
|
|
static GMimeFilter *
|
2017-06-08 04:11:49 +02:00
|
|
|
notmuch_filter_discard_non_term_new (GMimeContentType *content_type)
|
2010-02-05 02:08:11 +01:00
|
|
|
{
|
2010-02-05 02:26:00 +01:00
|
|
|
static GType type = 0;
|
2017-06-08 04:11:46 +02:00
|
|
|
NotmuchFilterDiscardNonTerm *filter;
|
2010-02-05 02:08:11 +01:00
|
|
|
|
2010-02-05 02:26:00 +01:00
|
|
|
if (!type) {
|
|
|
|
static const GTypeInfo info = {
|
2017-06-08 04:11:46 +02:00
|
|
|
sizeof (NotmuchFilterDiscardNonTermClass),
|
2010-02-05 02:26:00 +01:00
|
|
|
NULL, /* base_class_init */
|
|
|
|
NULL, /* base_class_finalize */
|
2017-06-08 04:11:46 +02:00
|
|
|
(GClassInitFunc) notmuch_filter_discard_non_term_class_init,
|
2010-02-05 02:26:00 +01:00
|
|
|
NULL, /* class_finalize */
|
|
|
|
NULL, /* class_data */
|
2017-06-08 04:11:46 +02:00
|
|
|
sizeof (NotmuchFilterDiscardNonTerm),
|
2010-02-05 02:26:00 +01:00
|
|
|
0, /* n_preallocs */
|
|
|
|
NULL, /* instance_init */
|
|
|
|
NULL /* value_table */
|
|
|
|
};
|
|
|
|
|
2017-06-08 04:11:46 +02:00
|
|
|
type = g_type_register_static (GMIME_TYPE_FILTER, "NotmuchFilterDiscardNonTerm", &info, (GTypeFlags) 0);
|
2010-02-05 02:26:00 +01:00
|
|
|
}
|
|
|
|
|
2017-09-03 13:55:42 +02:00
|
|
|
filter = (NotmuchFilterDiscardNonTerm *) g_object_new (type, NULL);
|
2017-06-08 04:11:49 +02:00
|
|
|
filter->content_type = content_type;
|
2010-02-05 02:08:11 +01:00
|
|
|
filter->state = 0;
|
2017-06-08 04:11:49 +02:00
|
|
|
if (g_mime_content_type_is_type (content_type, "text", "html")) {
|
|
|
|
filter->states = html_states;
|
|
|
|
filter->first_skipping_state = first_html_skipping_state;
|
|
|
|
} else {
|
|
|
|
filter->states = uuencode_states;
|
|
|
|
filter->first_skipping_state = first_uuencode_skipping_state;
|
|
|
|
}
|
2010-02-05 02:08:11 +01:00
|
|
|
|
|
|
|
return (GMimeFilter *) filter;
|
|
|
|
}
|
|
|
|
|
2009-10-28 18:42:07 +01:00
|
|
|
/* We're finally down to a single (NAME + address) email "mailbox". */
|
|
|
|
static void
|
|
|
|
_index_address_mailbox (notmuch_message_t *message,
|
|
|
|
const char *prefix_name,
|
|
|
|
InternetAddress *address)
|
|
|
|
{
|
|
|
|
InternetAddressMailbox *mailbox = INTERNET_ADDRESS_MAILBOX (address);
|
2014-06-16 04:40:32 +02:00
|
|
|
const char *name, *addr, *combined;
|
2009-12-21 17:23:26 +01:00
|
|
|
void *local = talloc_new (message);
|
2009-10-28 18:42:07 +01:00
|
|
|
|
|
|
|
name = internet_address_get_name (address);
|
2009-10-28 21:09:08 +01:00
|
|
|
addr = internet_address_mailbox_get_addr (mailbox);
|
|
|
|
|
2014-06-16 04:40:32 +02:00
|
|
|
/* Combine the name and address and index them as a phrase. */
|
|
|
|
if (name && addr)
|
|
|
|
combined = talloc_asprintf (local, "%s %s", name, addr);
|
|
|
|
else if (name)
|
|
|
|
combined = name;
|
|
|
|
else
|
|
|
|
combined = addr;
|
2009-10-28 18:42:07 +01:00
|
|
|
|
2014-06-16 04:40:32 +02:00
|
|
|
if (combined)
|
|
|
|
_notmuch_message_gen_terms (message, prefix_name, combined);
|
2009-12-01 21:40:13 +01:00
|
|
|
|
|
|
|
talloc_free (local);
|
2009-10-28 18:42:07 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
_index_address_list (notmuch_message_t *message,
|
|
|
|
const char *prefix_name,
|
|
|
|
InternetAddressList *addresses);
|
|
|
|
|
|
|
|
/* The outer loop over the InternetAddressList wasn't quite enough.
|
|
|
|
* There can actually be a tree here where a single member of the list
|
|
|
|
* is a "group" containing another list. Recurse please.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
_index_address_group (notmuch_message_t *message,
|
|
|
|
const char *prefix_name,
|
|
|
|
InternetAddress *address)
|
|
|
|
{
|
|
|
|
InternetAddressGroup *group;
|
|
|
|
InternetAddressList *list;
|
|
|
|
|
|
|
|
group = INTERNET_ADDRESS_GROUP (address);
|
|
|
|
list = internet_address_group_get_members (group);
|
|
|
|
|
|
|
|
if (! list)
|
|
|
|
return;
|
|
|
|
|
|
|
|
_index_address_list (message, prefix_name, list);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
_index_address_list (notmuch_message_t *message,
|
|
|
|
const char *prefix_name,
|
|
|
|
InternetAddressList *addresses)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
InternetAddress *address;
|
|
|
|
|
|
|
|
if (addresses == NULL)
|
|
|
|
return;
|
|
|
|
|
|
|
|
for (i = 0; i < internet_address_list_length (addresses); i++) {
|
|
|
|
address = internet_address_list_get_address (addresses, i);
|
|
|
|
if (INTERNET_ADDRESS_IS_MAILBOX (address)) {
|
|
|
|
_index_address_mailbox (message, prefix_name, address);
|
|
|
|
} else if (INTERNET_ADDRESS_IS_GROUP (address)) {
|
|
|
|
_index_address_group (message, prefix_name, address);
|
|
|
|
} else {
|
|
|
|
INTERNAL_ERROR ("GMime InternetAddress is neither a mailbox nor a group.\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-09-16 16:59:02 +02:00
|
|
|
static void
|
|
|
|
_index_content_type (notmuch_message_t *message, GMimeObject *part)
|
|
|
|
{
|
|
|
|
GMimeContentType *content_type = g_mime_object_get_content_type (part);
|
|
|
|
if (content_type) {
|
|
|
|
char *mime_string = g_mime_content_type_to_string (content_type);
|
|
|
|
if (mime_string) {
|
|
|
|
_notmuch_message_gen_terms (message, "mimetype", mime_string);
|
|
|
|
g_free (mime_string);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-10-21 04:25:41 +02:00
|
|
|
static void
|
|
|
|
_index_encrypted_mime_part (notmuch_message_t *message, notmuch_indexopts_t *indexopts,
|
|
|
|
GMimeContentType *content_type,
|
|
|
|
GMimeMultipartEncrypted *part);
|
|
|
|
|
2009-10-28 18:42:07 +01:00
|
|
|
/* Callback to generate terms for each mime part of a message. */
|
|
|
|
static void
|
|
|
|
_index_mime_part (notmuch_message_t *message,
|
2017-10-21 04:25:41 +02:00
|
|
|
notmuch_indexopts_t *indexopts,
|
2009-10-28 18:42:07 +01:00
|
|
|
GMimeObject *part)
|
|
|
|
{
|
2010-02-05 02:08:11 +01:00
|
|
|
GMimeStream *stream, *filter;
|
2017-06-08 04:11:46 +02:00
|
|
|
GMimeFilter *discard_non_term_filter;
|
2009-10-28 18:42:07 +01:00
|
|
|
GMimeDataWrapper *wrapper;
|
|
|
|
GByteArray *byte_array;
|
|
|
|
GMimeContentDisposition *disposition;
|
2017-09-16 16:59:02 +02:00
|
|
|
GMimeContentType *content_type;
|
2009-10-28 18:42:07 +01:00
|
|
|
char *body;
|
2012-02-24 08:36:22 +01:00
|
|
|
const char *charset;
|
2009-10-28 18:42:07 +01:00
|
|
|
|
2010-03-02 16:31:28 +01:00
|
|
|
if (! part) {
|
2014-12-26 17:25:35 +01:00
|
|
|
_notmuch_database_log (_notmuch_message_database (message),
|
|
|
|
"Warning: Not indexing empty mime part.\n");
|
2010-03-02 16:31:28 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2017-09-16 16:59:02 +02:00
|
|
|
_index_content_type (message, part);
|
2017-10-21 04:25:41 +02:00
|
|
|
content_type = g_mime_object_get_content_type (part);
|
2015-01-23 00:43:38 +01:00
|
|
|
|
2009-10-28 18:42:07 +01:00
|
|
|
if (GMIME_IS_MULTIPART (part)) {
|
|
|
|
GMimeMultipart *multipart = GMIME_MULTIPART (part);
|
|
|
|
int i;
|
|
|
|
|
2011-05-26 03:01:20 +02:00
|
|
|
if (GMIME_IS_MULTIPART_SIGNED (multipart))
|
|
|
|
_notmuch_message_add_term (message, "tag", "signed");
|
|
|
|
|
|
|
|
if (GMIME_IS_MULTIPART_ENCRYPTED (multipart))
|
|
|
|
_notmuch_message_add_term (message, "tag", "encrypted");
|
|
|
|
|
2009-10-28 18:42:07 +01:00
|
|
|
for (i = 0; i < g_mime_multipart_get_count (multipart); i++) {
|
|
|
|
if (GMIME_IS_MULTIPART_SIGNED (multipart)) {
|
2017-09-16 16:59:04 +02:00
|
|
|
/* Don't index the signature, but index its content type. */
|
|
|
|
if (i == GMIME_MULTIPART_SIGNED_SIGNATURE) {
|
|
|
|
_index_content_type (message,
|
|
|
|
g_mime_multipart_get_part (multipart, i));
|
2009-10-28 18:42:07 +01:00
|
|
|
continue;
|
2017-09-16 16:59:04 +02:00
|
|
|
} else if (i != GMIME_MULTIPART_SIGNED_CONTENT) {
|
2014-12-26 17:25:35 +01:00
|
|
|
_notmuch_database_log (_notmuch_message_database (message),
|
2017-09-16 16:59:04 +02:00
|
|
|
"Warning: Unexpected extra parts of multipart/signed. Indexing anyway.\n");
|
|
|
|
}
|
2009-10-28 18:42:07 +01:00
|
|
|
}
|
2011-12-28 21:14:29 +01:00
|
|
|
if (GMIME_IS_MULTIPART_ENCRYPTED (multipart)) {
|
2017-09-16 16:59:05 +02:00
|
|
|
_index_content_type (message,
|
|
|
|
g_mime_multipart_get_part (multipart, i));
|
2017-10-21 04:25:41 +02:00
|
|
|
if (i == GMIME_MULTIPART_ENCRYPTED_CONTENT) {
|
|
|
|
_index_encrypted_mime_part(message, indexopts,
|
|
|
|
content_type,
|
|
|
|
GMIME_MULTIPART_ENCRYPTED (part));
|
|
|
|
} else {
|
|
|
|
if (i != GMIME_MULTIPART_ENCRYPTED_VERSION) {
|
|
|
|
_notmuch_database_log (_notmuch_message_database (message),
|
|
|
|
"Warning: Unexpected extra parts of multipart/encrypted.\n");
|
|
|
|
}
|
2017-09-16 16:59:05 +02:00
|
|
|
}
|
2011-12-28 21:14:29 +01:00
|
|
|
continue;
|
|
|
|
}
|
2017-10-21 04:25:41 +02:00
|
|
|
_index_mime_part (message, indexopts,
|
2009-10-28 18:42:07 +01:00
|
|
|
g_mime_multipart_get_part (multipart, i));
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (GMIME_IS_MESSAGE_PART (part)) {
|
|
|
|
GMimeMessage *mime_message;
|
|
|
|
|
|
|
|
mime_message = g_mime_message_part_get_message (GMIME_MESSAGE_PART (part));
|
|
|
|
|
2017-10-21 04:25:41 +02:00
|
|
|
_index_mime_part (message, indexopts, g_mime_message_get_mime_part (mime_message));
|
2009-10-28 18:42:07 +01:00
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (! (GMIME_IS_PART (part))) {
|
2014-12-26 17:25:35 +01:00
|
|
|
_notmuch_database_log (_notmuch_message_database (message),
|
|
|
|
"Warning: Not indexing unknown mime part: %s.\n",
|
|
|
|
g_type_name (G_OBJECT_TYPE (part)));
|
2009-10-28 18:42:07 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
disposition = g_mime_object_get_content_disposition (part);
|
|
|
|
if (disposition &&
|
2015-09-26 11:35:21 +02:00
|
|
|
strcasecmp (g_mime_content_disposition_get_disposition (disposition),
|
|
|
|
GMIME_DISPOSITION_ATTACHMENT) == 0)
|
2009-10-28 18:42:07 +01:00
|
|
|
{
|
|
|
|
const char *filename = g_mime_part_get_filename (GMIME_PART (part));
|
|
|
|
|
|
|
|
_notmuch_message_add_term (message, "tag", "attachment");
|
|
|
|
_notmuch_message_gen_terms (message, "attachment", filename);
|
|
|
|
|
|
|
|
/* XXX: Would be nice to call out to something here to parse
|
|
|
|
* the attachment into text and then index that. */
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
byte_array = g_byte_array_new ();
|
|
|
|
|
|
|
|
stream = g_mime_stream_mem_new_with_byte_array (byte_array);
|
2017-10-07 10:44:05 +02:00
|
|
|
g_mime_stream_mem_set_owner (GMIME_STREAM_MEM (stream), false);
|
2010-02-05 02:08:11 +01:00
|
|
|
|
|
|
|
filter = g_mime_stream_filter_new (stream);
|
2017-09-16 16:59:02 +02:00
|
|
|
|
2017-06-08 04:11:49 +02:00
|
|
|
discard_non_term_filter = notmuch_filter_discard_non_term_new (content_type);
|
2010-02-05 02:08:11 +01:00
|
|
|
|
|
|
|
g_mime_stream_filter_add (GMIME_STREAM_FILTER (filter),
|
2017-06-08 04:11:46 +02:00
|
|
|
discard_non_term_filter);
|
2010-02-05 02:08:11 +01:00
|
|
|
|
2012-02-24 08:36:22 +01:00
|
|
|
charset = g_mime_object_get_content_type_parameter (part, "charset");
|
|
|
|
if (charset) {
|
|
|
|
GMimeFilter *charset_filter;
|
|
|
|
charset_filter = g_mime_filter_charset_new (charset, "UTF-8");
|
|
|
|
/* This result can be NULL for things like "unknown-8bit".
|
|
|
|
* Don't set a NULL filter as that makes GMime print
|
|
|
|
* annoying assertion-failure messages on stderr. */
|
|
|
|
if (charset_filter) {
|
|
|
|
g_mime_stream_filter_add (GMIME_STREAM_FILTER (filter),
|
|
|
|
charset_filter);
|
|
|
|
g_object_unref (charset_filter);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-10-28 18:42:07 +01:00
|
|
|
wrapper = g_mime_part_get_content_object (GMIME_PART (part));
|
|
|
|
if (wrapper)
|
2010-02-05 02:08:11 +01:00
|
|
|
g_mime_data_wrapper_write_to_stream (wrapper, filter);
|
2009-10-28 18:42:07 +01:00
|
|
|
|
|
|
|
g_object_unref (stream);
|
2010-02-05 02:08:11 +01:00
|
|
|
g_object_unref (filter);
|
2017-06-08 04:11:46 +02:00
|
|
|
g_object_unref (discard_non_term_filter);
|
2009-10-28 18:42:07 +01:00
|
|
|
|
|
|
|
g_byte_array_append (byte_array, (guint8 *) "\0", 1);
|
2017-10-07 10:44:05 +02:00
|
|
|
body = (char *) g_byte_array_free (byte_array, false);
|
2009-10-28 18:42:07 +01:00
|
|
|
|
2010-01-06 04:14:07 +01:00
|
|
|
if (body) {
|
|
|
|
_notmuch_message_gen_terms (message, NULL, body);
|
2009-10-28 18:42:07 +01:00
|
|
|
|
2010-01-06 04:14:07 +01:00
|
|
|
free (body);
|
|
|
|
}
|
2009-10-28 18:42:07 +01:00
|
|
|
}
|
|
|
|
|
2017-10-21 04:25:41 +02:00
|
|
|
/* descend (if desired) into the cleartext part of an encrypted MIME
|
|
|
|
* part while indexing. */
|
|
|
|
static void
|
|
|
|
_index_encrypted_mime_part (notmuch_message_t *message,
|
|
|
|
notmuch_indexopts_t *indexopts,
|
|
|
|
g_mime_3_unused(GMimeContentType *content_type),
|
|
|
|
GMimeMultipartEncrypted *encrypted_data)
|
|
|
|
{
|
|
|
|
notmuch_status_t status;
|
|
|
|
GError *err = NULL;
|
|
|
|
notmuch_database_t * notmuch = NULL;
|
|
|
|
GMimeObject *clear = NULL;
|
|
|
|
|
|
|
|
if (!indexopts || !notmuch_indexopts_get_try_decrypt (indexopts))
|
|
|
|
return;
|
|
|
|
|
|
|
|
notmuch = _notmuch_message_database (message);
|
|
|
|
|
2017-11-30 09:59:27 +01:00
|
|
|
GMimeCryptoContext* crypto_ctx = NULL;
|
2017-10-21 04:25:41 +02:00
|
|
|
#if (GMIME_MAJOR_VERSION < 3)
|
|
|
|
{
|
|
|
|
const char *protocol = NULL;
|
|
|
|
protocol = g_mime_content_type_get_parameter (content_type, "protocol");
|
|
|
|
status = _notmuch_crypto_get_gmime_ctx_for_protocol (&(indexopts->crypto),
|
|
|
|
protocol, &crypto_ctx);
|
|
|
|
if (status) {
|
|
|
|
_notmuch_database_log (notmuch, "Warning: setup failed for decrypting "
|
|
|
|
"during indexing. (%d)\n", status);
|
|
|
|
status = notmuch_message_add_property (message, "index.decryption", "failure");
|
|
|
|
if (status)
|
|
|
|
_notmuch_database_log_append (notmuch, "failed to add index.decryption "
|
|
|
|
"property (%d)\n", status);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
2017-11-30 09:59:27 +01:00
|
|
|
clear = _notmuch_crypto_decrypt (crypto_ctx, encrypted_data, NULL, &err);
|
2017-10-21 04:25:41 +02:00
|
|
|
if (err) {
|
|
|
|
_notmuch_database_log (notmuch, "Failed to decrypt during indexing. (%d:%d) [%s]\n",
|
|
|
|
err->domain, err->code, err->message);
|
|
|
|
g_error_free(err);
|
|
|
|
/* Indicate that we failed to decrypt during indexing */
|
|
|
|
status = notmuch_message_add_property (message, "index.decryption", "failure");
|
|
|
|
if (status)
|
|
|
|
_notmuch_database_log_append (notmuch, "failed to add index.decryption "
|
|
|
|
"property (%d)\n", status);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
_index_mime_part (message, indexopts, clear);
|
|
|
|
g_object_unref (clear);
|
|
|
|
|
|
|
|
status = notmuch_message_add_property (message, "index.decryption", "success");
|
|
|
|
if (status)
|
|
|
|
_notmuch_database_log (notmuch, "failed to add index.decryption "
|
|
|
|
"property (%d)\n", status);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2009-10-28 18:42:07 +01:00
|
|
|
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-10-28 18:42:07 +01:00
|
|
|
{
|
2014-03-30 23:21:49 +02:00
|
|
|
GMimeMessage *mime_message;
|
2009-10-28 18:42:07 +01:00
|
|
|
InternetAddressList *addresses;
|
2017-05-06 04:26:57 +02:00
|
|
|
const char *subject;
|
2014-03-30 23:21:49 +02:00
|
|
|
notmuch_status_t status;
|
2009-10-28 18:42:07 +01:00
|
|
|
|
2014-03-30 23:21:49 +02:00
|
|
|
status = _notmuch_message_file_get_mime_message (message_file,
|
|
|
|
&mime_message);
|
|
|
|
if (status)
|
|
|
|
return status;
|
2009-10-28 18:42:07 +01:00
|
|
|
|
2017-05-06 04:26:57 +02:00
|
|
|
addresses = g_mime_message_get_from (mime_message);
|
2012-12-11 04:33:40 +01:00
|
|
|
if (addresses) {
|
|
|
|
_index_address_list (message, "from", addresses);
|
2017-05-20 14:05:22 +02:00
|
|
|
g_mime_2_6_unref (addresses);
|
2012-12-11 04:33:40 +01:00
|
|
|
}
|
2009-10-28 18:42:07 +01:00
|
|
|
|
|
|
|
addresses = g_mime_message_get_all_recipients (mime_message);
|
2012-12-11 04:33:40 +01:00
|
|
|
if (addresses) {
|
|
|
|
_index_address_list (message, "to", addresses);
|
|
|
|
g_object_unref (addresses);
|
|
|
|
}
|
2009-10-28 18:42:07 +01:00
|
|
|
|
|
|
|
subject = g_mime_message_get_subject (mime_message);
|
|
|
|
_notmuch_message_gen_terms (message, "subject", subject);
|
|
|
|
|
2017-10-21 04:25:41 +02:00
|
|
|
_index_mime_part (message, indexopts, g_mime_message_get_mime_part (mime_message));
|
2009-10-28 18:42:07 +01:00
|
|
|
|
2014-03-30 23:21:49 +02:00
|
|
|
return NOTMUCH_STATUS_SUCCESS;
|
2009-10-28 18:42:07 +01:00
|
|
|
}
|