1 /* notmuch - Not much of an email program, (just index and search)
3 * Copyright © 2009 Carl Worth
4 * Copyright © 2009 Keith Packard
6 * This program is free software: you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation, either version 3 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program. If not, see https://www.gnu.org/licenses/ .
19 * Authors: Carl Worth <cworth@cworth.org>
20 * Keith Packard <keithp@keithp.com>
21 * Austin Clements <aclements@csail.mit.edu>
24 #include <sys/types.h>
28 #include "notmuch-client.h"
30 /* Context that gets inherited from the root node. */
31 typedef struct mime_node_context {
32 /* Per-message resources. These are allocated internally and must
36 GMimeMessage *mime_message;
38 /* Context provided by the caller. */
39 _notmuch_crypto_t *crypto;
40 } mime_node_context_t;
43 _mime_node_context_free (mime_node_context_t *res)
45 if (res->mime_message)
46 g_object_unref (res->mime_message);
49 g_object_unref (res->parser);
52 g_object_unref (res->stream);
58 mime_node_open (const void *ctx, notmuch_message_t *message,
59 _notmuch_crypto_t *crypto, mime_node_t **root_out)
61 const char *filename = notmuch_message_get_filename (message);
62 mime_node_context_t *mctx;
64 notmuch_status_t status;
67 root = talloc_zero (ctx, mime_node_t);
69 fprintf (stderr, "Out of memory.\n");
70 status = NOTMUCH_STATUS_OUT_OF_MEMORY;
74 /* Create the tree-wide context */
75 mctx = talloc_zero (root, mime_node_context_t);
77 fprintf (stderr, "Out of memory.\n");
78 status = NOTMUCH_STATUS_OUT_OF_MEMORY;
81 talloc_set_destructor (mctx, _mime_node_context_free);
84 fd = open (filename, O_RDONLY);
86 /* Slow path - for some reason the first file in the list is
87 * not available anymore. This is clearly a problem in the
88 * database, but we are not going to let this problem be a
90 notmuch_filenames_t *filenames;
91 for (filenames = notmuch_message_get_filenames (message);
92 notmuch_filenames_valid (filenames);
93 notmuch_filenames_move_to_next (filenames))
95 filename = notmuch_filenames_get (filenames);
96 fd = open (filename, O_RDONLY);
101 talloc_free (filenames);
104 fprintf (stderr, "Error opening %s: %s\n", filename, strerror (errno));
105 status = NOTMUCH_STATUS_FILE_ERROR;
110 mctx->stream = g_mime_stream_gzfile_new (fd);
112 fprintf (stderr, "Out of memory.\n");
113 status = NOTMUCH_STATUS_OUT_OF_MEMORY;
117 mctx->parser = g_mime_parser_new_with_stream (mctx->stream);
119 fprintf (stderr, "Out of memory.\n");
120 status = NOTMUCH_STATUS_OUT_OF_MEMORY;
124 mctx->mime_message = g_mime_parser_construct_message (mctx->parser, NULL);
125 if (!mctx->mime_message) {
126 fprintf (stderr, "Failed to parse %s\n", filename);
127 status = NOTMUCH_STATUS_FILE_ERROR;
131 mctx->crypto = crypto;
133 /* Create the root node */
134 root->part = GMIME_OBJECT (mctx->mime_message);
135 root->envelope_file = message;
141 root->next_child = 0;
142 root->next_part_num = 1;
145 return NOTMUCH_STATUS_SUCCESS;
152 /* Signature list destructor */
154 _signature_list_free (GMimeSignatureList **proxy)
156 g_object_unref (*proxy);
160 /* Set up signature list destructor */
162 set_signature_list_destructor (mime_node_t *node)
164 GMimeSignatureList **proxy = talloc (node, GMimeSignatureList *);
166 *proxy = node->sig_list;
167 talloc_set_destructor (proxy, _signature_list_free);
171 /* Verify a signed mime node */
173 node_verify (mime_node_t *node, GMimeObject *part)
177 node->verify_attempted = true;
178 node->sig_list = g_mime_multipart_signed_verify
179 (GMIME_MULTIPART_SIGNED (part), GMIME_ENCRYPT_NONE, &err);
182 set_signature_list_destructor (node);
184 fprintf (stderr, "Failed to verify signed part: %s\n",
185 err ? err->message : "no error explanation given");
191 /* Decrypt and optionally verify an encrypted mime node */
193 node_decrypt_and_verify (mime_node_t *node, GMimeObject *part)
196 GMimeDecryptResult *decrypt_result = NULL;
197 GMimeMultipartEncrypted *encrypteddata = GMIME_MULTIPART_ENCRYPTED (part);
198 notmuch_message_t *message = NULL;
200 if (! node->decrypted_child) {
201 for (mime_node_t *parent = node; parent; parent = parent->parent)
202 if (parent->envelope_file) {
203 message = parent->envelope_file;
207 node->decrypted_child = _notmuch_crypto_decrypt (&node->decrypt_attempted,
208 node->ctx->crypto->decrypt,
210 encrypteddata, &decrypt_result, &err);
212 if (! node->decrypted_child) {
213 fprintf (stderr, "Failed to decrypt part: %s\n",
214 err ? err->message : "no error explanation given");
218 node->decrypt_success = true;
220 if (decrypt_result) {
221 /* This may be NULL if the part is not signed. */
222 node->sig_list = g_mime_decrypt_result_get_signatures (decrypt_result);
223 if (node->sig_list) {
224 node->verify_attempted = true;
225 g_object_ref (node->sig_list);
226 set_signature_list_destructor (node);
229 if (node->ctx->crypto->decrypt == NOTMUCH_DECRYPT_TRUE && message) {
230 notmuch_database_t *db = notmuch_message_get_database (message);
231 const char *session_key = g_mime_decrypt_result_get_session_key (decrypt_result);
232 if (db && session_key)
233 print_status_message ("Failed to stash session key in the database",
235 notmuch_message_add_property (message, "session-key",
238 g_object_unref (decrypt_result);
247 _mime_node_create (mime_node_t *parent, GMimeObject *part)
249 mime_node_t *node = talloc_zero (parent, mime_node_t);
251 /* Set basic node properties */
253 node->ctx = parent->ctx;
254 if (!talloc_reference (node, node->ctx)) {
255 fprintf (stderr, "Out of memory.\n");
259 node->parent = parent;
260 node->part_num = node->next_part_num = -1;
261 node->next_child = 0;
263 /* Deal with the different types of parts */
264 if (GMIME_IS_PART (part)) {
266 } else if (GMIME_IS_MULTIPART (part)) {
267 node->nchildren = g_mime_multipart_get_count (GMIME_MULTIPART (part));
268 } else if (GMIME_IS_MESSAGE_PART (part)) {
269 /* Promote part to an envelope and open it */
270 GMimeMessagePart *message_part = GMIME_MESSAGE_PART (part);
271 GMimeMessage *message = g_mime_message_part_get_message (message_part);
272 node->envelope_part = message_part;
273 node->part = GMIME_OBJECT (message);
276 fprintf (stderr, "Warning: Unknown mime part type: %s.\n",
277 g_type_name (G_OBJECT_TYPE (part)));
282 /* Handle PGP/MIME parts */
283 if (GMIME_IS_MULTIPART_ENCRYPTED (part) && (node->ctx->crypto->decrypt != NOTMUCH_DECRYPT_FALSE)) {
284 if (node->nchildren != 2) {
285 /* this violates RFC 3156 section 4, so we won't bother with it. */
286 fprintf (stderr, "Error: %d part(s) for a multipart/encrypted "
287 "message (must be exactly 2)\n",
290 node_decrypt_and_verify (node, part);
292 } else if (GMIME_IS_MULTIPART_SIGNED (part) && node->ctx->crypto->verify) {
293 if (node->nchildren != 2) {
294 /* this violates RFC 3156 section 5, so we won't bother with it. */
295 fprintf (stderr, "Error: %d part(s) for a multipart/signed message "
296 "(must be exactly 2)\n",
299 node_verify (node, part);
307 mime_node_child (mime_node_t *parent, int child)
312 if (!parent || !parent->part || child < 0 || child >= parent->nchildren)
315 if (GMIME_IS_MULTIPART (parent->part)) {
316 if (child == 1 && parent->decrypted_child)
317 sub = parent->decrypted_child;
319 sub = g_mime_multipart_get_part
320 (GMIME_MULTIPART (parent->part), child);
321 } else if (GMIME_IS_MESSAGE (parent->part)) {
322 sub = g_mime_message_get_mime_part (GMIME_MESSAGE (parent->part));
324 /* This should have been caught by message_part_create */
325 INTERNAL_ERROR ("Unexpected GMimeObject type: %s",
326 g_type_name (G_OBJECT_TYPE (parent->part)));
328 node = _mime_node_create (parent, sub);
330 if (child == parent->next_child && parent->next_part_num != -1) {
331 /* We're traversing in depth-first order. Record the child's
332 * depth-first numbering. */
333 node->part_num = parent->next_part_num;
334 node->next_part_num = node->part_num + 1;
336 /* Prepare the parent for its next depth-first child. */
337 parent->next_child++;
338 parent->next_part_num = -1;
340 if (node->nchildren == 0) {
341 /* We've reached a leaf, so find the parent that has more
342 * children and set it up to number its next child. */
343 mime_node_t *iter = node->parent;
344 while (iter && iter->next_child == iter->nchildren)
347 iter->next_part_num = node->part_num + 1;
355 _mime_node_seek_dfs_walk (mime_node_t *node, int *n)
363 for (i = 0; i < node->nchildren; i++) {
364 mime_node_t *child = mime_node_child (node, i);
365 mime_node_t *ret = _mime_node_seek_dfs_walk (child, n);
375 mime_node_seek_dfs (mime_node_t *node, int n)
379 return _mime_node_seek_dfs_walk (node, &n);