2011-12-24 19:52:44 +01:00
|
|
|
/* notmuch - Not much of an email program, (just index and search)
|
|
|
|
*
|
|
|
|
* Copyright © 2009 Carl Worth
|
|
|
|
* Copyright © 2009 Keith Packard
|
|
|
|
*
|
|
|
|
* 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/ .
|
2011-12-24 19:52:44 +01:00
|
|
|
*
|
|
|
|
* Authors: Carl Worth <cworth@cworth.org>
|
|
|
|
* Keith Packard <keithp@keithp.com>
|
|
|
|
* Austin Clements <aclements@csail.mit.edu>
|
|
|
|
*/
|
|
|
|
|
2019-03-24 04:32:44 +01:00
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
|
2011-12-24 19:52:44 +01:00
|
|
|
#include "notmuch-client.h"
|
|
|
|
|
|
|
|
/* Context that gets inherited from the root node. */
|
|
|
|
typedef struct mime_node_context {
|
|
|
|
/* Per-message resources. These are allocated internally and must
|
|
|
|
* be destroyed. */
|
|
|
|
GMimeStream *stream;
|
|
|
|
GMimeParser *parser;
|
|
|
|
GMimeMessage *mime_message;
|
2019-05-25 20:04:04 +02:00
|
|
|
_notmuch_message_crypto_t *msg_crypto;
|
2011-12-24 19:52:44 +01:00
|
|
|
|
|
|
|
/* Context provided by the caller. */
|
2017-10-10 07:49:02 +02:00
|
|
|
_notmuch_crypto_t *crypto;
|
2011-12-24 19:52:44 +01:00
|
|
|
} mime_node_context_t;
|
|
|
|
|
|
|
|
static int
|
|
|
|
_mime_node_context_free (mime_node_context_t *res)
|
|
|
|
{
|
|
|
|
if (res->mime_message)
|
|
|
|
g_object_unref (res->mime_message);
|
|
|
|
|
|
|
|
if (res->parser)
|
|
|
|
g_object_unref (res->parser);
|
|
|
|
|
|
|
|
if (res->stream)
|
|
|
|
g_object_unref (res->stream);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2019-06-13 12:31:01 +02:00
|
|
|
const _notmuch_message_crypto_t *
|
2019-05-25 20:04:04 +02:00
|
|
|
mime_node_get_message_crypto_status (mime_node_t *node)
|
|
|
|
{
|
|
|
|
return node->ctx->msg_crypto;
|
|
|
|
}
|
|
|
|
|
2011-12-24 19:52:44 +01:00
|
|
|
notmuch_status_t
|
|
|
|
mime_node_open (const void *ctx, notmuch_message_t *message,
|
2017-10-10 07:49:02 +02:00
|
|
|
_notmuch_crypto_t *crypto, mime_node_t **root_out)
|
2011-12-24 19:52:44 +01:00
|
|
|
{
|
|
|
|
const char *filename = notmuch_message_get_filename (message);
|
|
|
|
mime_node_context_t *mctx;
|
|
|
|
mime_node_t *root;
|
|
|
|
notmuch_status_t status;
|
2019-03-24 04:32:44 +01:00
|
|
|
int fd;
|
2011-12-24 19:52:44 +01:00
|
|
|
|
|
|
|
root = talloc_zero (ctx, mime_node_t);
|
|
|
|
if (root == NULL) {
|
|
|
|
fprintf (stderr, "Out of memory.\n");
|
|
|
|
status = NOTMUCH_STATUS_OUT_OF_MEMORY;
|
|
|
|
goto DONE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Create the tree-wide context */
|
|
|
|
mctx = talloc_zero (root, mime_node_context_t);
|
|
|
|
if (mctx == NULL) {
|
|
|
|
fprintf (stderr, "Out of memory.\n");
|
|
|
|
status = NOTMUCH_STATUS_OUT_OF_MEMORY;
|
|
|
|
goto DONE;
|
|
|
|
}
|
|
|
|
talloc_set_destructor (mctx, _mime_node_context_free);
|
|
|
|
|
2017-08-21 17:44:48 +02:00
|
|
|
/* Fast path */
|
2019-03-24 04:32:44 +01:00
|
|
|
fd = open (filename, O_RDONLY);
|
|
|
|
if (fd == -1) {
|
2017-08-21 17:44:48 +02:00
|
|
|
/* Slow path - for some reason the first file in the list is
|
|
|
|
* not available anymore. This is clearly a problem in the
|
|
|
|
* database, but we are not going to let this problem be a
|
|
|
|
* show stopper */
|
|
|
|
notmuch_filenames_t *filenames;
|
|
|
|
for (filenames = notmuch_message_get_filenames (message);
|
|
|
|
notmuch_filenames_valid (filenames);
|
2019-06-13 12:31:01 +02:00
|
|
|
notmuch_filenames_move_to_next (filenames)) {
|
2017-08-21 17:44:48 +02:00
|
|
|
filename = notmuch_filenames_get (filenames);
|
2019-03-24 04:32:44 +01:00
|
|
|
fd = open (filename, O_RDONLY);
|
|
|
|
if (fd != -1)
|
2017-08-21 17:44:48 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
talloc_free (filenames);
|
2019-03-24 04:32:44 +01:00
|
|
|
if (fd == -1) {
|
2017-08-21 17:44:48 +02:00
|
|
|
/* Give up */
|
|
|
|
fprintf (stderr, "Error opening %s: %s\n", filename, strerror (errno));
|
2019-06-13 12:31:01 +02:00
|
|
|
status = NOTMUCH_STATUS_FILE_ERROR;
|
|
|
|
goto DONE;
|
2017-08-21 17:44:48 +02:00
|
|
|
}
|
2019-06-13 12:31:01 +02:00
|
|
|
}
|
2011-12-24 19:52:44 +01:00
|
|
|
|
2019-03-24 04:32:44 +01:00
|
|
|
mctx->stream = g_mime_stream_gzfile_new (fd);
|
2019-06-13 12:31:01 +02:00
|
|
|
if (! mctx->stream) {
|
2012-03-06 19:26:57 +01:00
|
|
|
fprintf (stderr, "Out of memory.\n");
|
|
|
|
status = NOTMUCH_STATUS_OUT_OF_MEMORY;
|
|
|
|
goto DONE;
|
|
|
|
}
|
2011-12-24 19:52:44 +01:00
|
|
|
|
|
|
|
mctx->parser = g_mime_parser_new_with_stream (mctx->stream);
|
2019-06-13 12:31:01 +02:00
|
|
|
if (! mctx->parser) {
|
2012-03-06 19:26:57 +01:00
|
|
|
fprintf (stderr, "Out of memory.\n");
|
|
|
|
status = NOTMUCH_STATUS_OUT_OF_MEMORY;
|
|
|
|
goto DONE;
|
|
|
|
}
|
2011-12-24 19:52:44 +01:00
|
|
|
|
2019-05-02 15:19:46 +02:00
|
|
|
mctx->mime_message = g_mime_parser_construct_message (mctx->parser, NULL);
|
2019-06-13 12:31:01 +02:00
|
|
|
if (! mctx->mime_message) {
|
2012-03-06 19:26:57 +01:00
|
|
|
fprintf (stderr, "Failed to parse %s\n", filename);
|
|
|
|
status = NOTMUCH_STATUS_FILE_ERROR;
|
|
|
|
goto DONE;
|
|
|
|
}
|
2011-12-24 19:52:44 +01:00
|
|
|
|
2019-05-25 20:04:05 +02:00
|
|
|
mctx->msg_crypto = _notmuch_message_crypto_new (mctx);
|
|
|
|
|
2012-05-26 20:45:44 +02:00
|
|
|
mctx->crypto = crypto;
|
2011-12-24 19:52:44 +01:00
|
|
|
|
|
|
|
/* Create the root node */
|
|
|
|
root->part = GMIME_OBJECT (mctx->mime_message);
|
|
|
|
root->envelope_file = message;
|
|
|
|
root->nchildren = 1;
|
|
|
|
root->ctx = mctx;
|
|
|
|
|
2012-01-24 00:33:09 +01:00
|
|
|
root->parent = NULL;
|
|
|
|
root->part_num = 0;
|
|
|
|
root->next_child = 0;
|
|
|
|
root->next_part_num = 1;
|
|
|
|
|
2011-12-24 19:52:44 +01:00
|
|
|
*root_out = root;
|
|
|
|
return NOTMUCH_STATUS_SUCCESS;
|
|
|
|
|
2019-06-13 12:31:01 +02:00
|
|
|
DONE:
|
2011-12-24 19:52:44 +01:00
|
|
|
talloc_free (root);
|
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
2019-05-02 15:19:33 +02:00
|
|
|
/* Signature list destructor */
|
2012-01-20 10:39:24 +01:00
|
|
|
static int
|
|
|
|
_signature_list_free (GMimeSignatureList **proxy)
|
|
|
|
{
|
|
|
|
g_object_unref (*proxy);
|
|
|
|
return 0;
|
|
|
|
}
|
2013-03-30 14:53:16 +01:00
|
|
|
|
2019-05-02 15:19:33 +02:00
|
|
|
/* Set up signature list destructor */
|
2013-03-30 14:53:16 +01:00
|
|
|
static void
|
|
|
|
set_signature_list_destructor (mime_node_t *node)
|
|
|
|
{
|
|
|
|
GMimeSignatureList **proxy = talloc (node, GMimeSignatureList *);
|
2019-06-13 12:31:01 +02:00
|
|
|
|
2013-03-30 14:53:16 +01:00
|
|
|
if (proxy) {
|
|
|
|
*proxy = node->sig_list;
|
|
|
|
talloc_set_destructor (proxy, _signature_list_free);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-05-02 15:19:33 +02:00
|
|
|
/* Verify a signed mime node */
|
2013-03-30 14:53:16 +01:00
|
|
|
static void
|
2019-05-02 15:19:41 +02:00
|
|
|
node_verify (mime_node_t *node, GMimeObject *part)
|
2013-03-30 14:53:16 +01:00
|
|
|
{
|
|
|
|
GError *err = NULL;
|
2019-05-25 20:04:05 +02:00
|
|
|
notmuch_status_t status;
|
2013-03-30 14:53:16 +01:00
|
|
|
|
2017-10-07 10:44:04 +02:00
|
|
|
node->verify_attempted = true;
|
2019-06-13 00:47:20 +02:00
|
|
|
node->sig_list = g_mime_multipart_signed_verify (
|
|
|
|
GMIME_MULTIPART_SIGNED (part), GMIME_ENCRYPT_NONE, &err);
|
2013-03-30 14:53:16 +01:00
|
|
|
|
|
|
|
if (node->sig_list)
|
|
|
|
set_signature_list_destructor (node);
|
|
|
|
else
|
|
|
|
fprintf (stderr, "Failed to verify signed part: %s\n",
|
|
|
|
err ? err->message : "no error explanation given");
|
|
|
|
|
|
|
|
if (err)
|
|
|
|
g_error_free (err);
|
2019-05-25 20:04:05 +02:00
|
|
|
|
|
|
|
status = _notmuch_message_crypto_potential_sig_list (node->ctx->msg_crypto, node->sig_list);
|
|
|
|
if (status) /* this is a warning, not an error */
|
|
|
|
fprintf (stderr, "Warning: failed to note signature status: %s.\n", notmuch_status_to_string (status));
|
2013-03-30 14:53:16 +01:00
|
|
|
}
|
|
|
|
|
2019-05-02 15:19:33 +02:00
|
|
|
/* Decrypt and optionally verify an encrypted mime node */
|
2013-03-30 14:53:16 +01:00
|
|
|
static void
|
2019-05-02 15:19:41 +02:00
|
|
|
node_decrypt_and_verify (mime_node_t *node, GMimeObject *part)
|
2013-03-30 14:53:16 +01:00
|
|
|
{
|
|
|
|
GError *err = NULL;
|
|
|
|
GMimeDecryptResult *decrypt_result = NULL;
|
2019-05-25 20:04:05 +02:00
|
|
|
notmuch_status_t status;
|
2013-03-30 14:53:16 +01:00
|
|
|
GMimeMultipartEncrypted *encrypteddata = GMIME_MULTIPART_ENCRYPTED (part);
|
2018-05-11 08:57:56 +02:00
|
|
|
notmuch_message_t *message = NULL;
|
2013-03-30 14:53:16 +01:00
|
|
|
|
2017-11-30 09:59:29 +01:00
|
|
|
if (! node->decrypted_child) {
|
2018-05-11 08:57:56 +02:00
|
|
|
for (mime_node_t *parent = node; parent; parent = parent->parent)
|
|
|
|
if (parent->envelope_file) {
|
|
|
|
message = parent->envelope_file;
|
2017-11-30 09:59:29 +01:00
|
|
|
break;
|
2018-05-11 08:57:56 +02:00
|
|
|
}
|
2017-11-30 09:59:29 +01:00
|
|
|
|
2017-12-08 07:23:58 +01:00
|
|
|
node->decrypted_child = _notmuch_crypto_decrypt (&node->decrypt_attempted,
|
|
|
|
node->ctx->crypto->decrypt,
|
2018-05-11 08:57:56 +02:00
|
|
|
message,
|
2019-05-02 15:19:41 +02:00
|
|
|
encrypteddata, &decrypt_result, &err);
|
2017-11-30 09:59:29 +01:00
|
|
|
}
|
2013-03-30 14:53:16 +01:00
|
|
|
if (! node->decrypted_child) {
|
|
|
|
fprintf (stderr, "Failed to decrypt part: %s\n",
|
|
|
|
err ? err->message : "no error explanation given");
|
|
|
|
goto DONE;
|
|
|
|
}
|
|
|
|
|
2017-10-07 10:44:04 +02:00
|
|
|
node->decrypt_success = true;
|
2019-05-25 20:04:05 +02:00
|
|
|
status = _notmuch_message_crypto_successful_decryption (node->ctx->msg_crypto);
|
|
|
|
if (status) /* this is a warning, not an error */
|
|
|
|
fprintf (stderr, "Warning: failed to note decryption status: %s.\n", notmuch_status_to_string (status));
|
2013-03-30 14:53:16 +01:00
|
|
|
|
2017-11-30 09:59:26 +01:00
|
|
|
if (decrypt_result) {
|
|
|
|
/* This may be NULL if the part is not signed. */
|
|
|
|
node->sig_list = g_mime_decrypt_result_get_signatures (decrypt_result);
|
|
|
|
if (node->sig_list) {
|
2019-04-20 19:02:57 +02:00
|
|
|
node->verify_attempted = true;
|
2017-11-30 09:59:26 +01:00
|
|
|
g_object_ref (node->sig_list);
|
|
|
|
set_signature_list_destructor (node);
|
2019-05-25 20:04:05 +02:00
|
|
|
status = _notmuch_message_crypto_potential_sig_list (node->ctx->msg_crypto, node->sig_list);
|
|
|
|
if (status) /* this is a warning, not an error */
|
|
|
|
fprintf (stderr, "Warning: failed to note signature status: %s.\n", notmuch_status_to_string (status));
|
2017-11-30 09:59:26 +01:00
|
|
|
}
|
2018-05-11 08:57:56 +02:00
|
|
|
|
|
|
|
if (node->ctx->crypto->decrypt == NOTMUCH_DECRYPT_TRUE && message) {
|
|
|
|
notmuch_database_t *db = notmuch_message_get_database (message);
|
|
|
|
const char *session_key = g_mime_decrypt_result_get_session_key (decrypt_result);
|
|
|
|
if (db && session_key)
|
|
|
|
print_status_message ("Failed to stash session key in the database",
|
|
|
|
message,
|
|
|
|
notmuch_message_add_property (message, "session-key",
|
|
|
|
session_key));
|
|
|
|
}
|
2017-11-30 09:59:26 +01:00
|
|
|
g_object_unref (decrypt_result);
|
2013-03-30 14:53:16 +01:00
|
|
|
}
|
|
|
|
|
2019-06-13 12:31:01 +02:00
|
|
|
DONE:
|
2013-03-30 14:53:16 +01:00
|
|
|
if (err)
|
|
|
|
g_error_free (err);
|
|
|
|
}
|
|
|
|
|
2019-08-29 17:38:46 +02:00
|
|
|
static bool
|
|
|
|
_mime_node_set_up_part (mime_node_t *node, GMimeObject *part, int numchild);
|
|
|
|
|
2011-12-24 19:52:44 +01:00
|
|
|
static mime_node_t *
|
2019-05-25 20:04:05 +02:00
|
|
|
_mime_node_create (mime_node_t *parent, GMimeObject *part, int numchild)
|
2011-12-24 19:52:44 +01:00
|
|
|
{
|
|
|
|
mime_node_t *node = talloc_zero (parent, mime_node_t);
|
|
|
|
|
|
|
|
/* Set basic node properties */
|
|
|
|
node->ctx = parent->ctx;
|
2019-06-13 12:31:01 +02:00
|
|
|
if (! talloc_reference (node, node->ctx)) {
|
2011-12-24 19:52:44 +01:00
|
|
|
fprintf (stderr, "Out of memory.\n");
|
|
|
|
talloc_free (node);
|
|
|
|
return NULL;
|
|
|
|
}
|
2012-01-24 00:33:09 +01:00
|
|
|
node->parent = parent;
|
|
|
|
node->part_num = node->next_part_num = -1;
|
|
|
|
node->next_child = 0;
|
2011-12-24 19:52:44 +01:00
|
|
|
|
2019-08-29 17:38:46 +02:00
|
|
|
if (_mime_node_set_up_part (node, part, numchild))
|
|
|
|
return node;
|
|
|
|
talloc_free (node);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* associate a MIME part with a node. */
|
|
|
|
static bool
|
|
|
|
_mime_node_set_up_part (mime_node_t *node, GMimeObject *part, int numchild)
|
|
|
|
{
|
2011-12-24 19:52:44 +01:00
|
|
|
/* Deal with the different types of parts */
|
|
|
|
if (GMIME_IS_PART (part)) {
|
2019-08-29 17:38:46 +02:00
|
|
|
node->part = part;
|
2011-12-24 19:52:44 +01:00
|
|
|
node->nchildren = 0;
|
|
|
|
} else if (GMIME_IS_MULTIPART (part)) {
|
2019-08-29 17:38:46 +02:00
|
|
|
node->part = part;
|
2011-12-24 19:52:44 +01:00
|
|
|
node->nchildren = g_mime_multipart_get_count (GMIME_MULTIPART (part));
|
|
|
|
} else if (GMIME_IS_MESSAGE_PART (part)) {
|
|
|
|
/* Promote part to an envelope and open it */
|
|
|
|
GMimeMessagePart *message_part = GMIME_MESSAGE_PART (part);
|
|
|
|
GMimeMessage *message = g_mime_message_part_get_message (message_part);
|
|
|
|
node->envelope_part = message_part;
|
|
|
|
node->part = GMIME_OBJECT (message);
|
|
|
|
node->nchildren = 1;
|
|
|
|
} else {
|
|
|
|
fprintf (stderr, "Warning: Unknown mime part type: %s.\n",
|
|
|
|
g_type_name (G_OBJECT_TYPE (part)));
|
2019-08-29 17:38:46 +02:00
|
|
|
return false;
|
2011-12-24 19:52:44 +01:00
|
|
|
}
|
|
|
|
|
2019-08-29 17:38:46 +02:00
|
|
|
/* Handle PGP/MIME parts (by definition not cryptographic payload parts) */
|
2017-12-08 07:23:53 +01:00
|
|
|
if (GMIME_IS_MULTIPART_ENCRYPTED (part) && (node->ctx->crypto->decrypt != NOTMUCH_DECRYPT_FALSE)) {
|
2011-12-24 19:52:44 +01:00
|
|
|
if (node->nchildren != 2) {
|
|
|
|
/* this violates RFC 3156 section 4, so we won't bother with it. */
|
|
|
|
fprintf (stderr, "Error: %d part(s) for a multipart/encrypted "
|
|
|
|
"message (must be exactly 2)\n",
|
|
|
|
node->nchildren);
|
|
|
|
} else {
|
2019-05-02 15:19:41 +02:00
|
|
|
node_decrypt_and_verify (node, part);
|
2011-12-24 19:52:44 +01:00
|
|
|
}
|
2017-07-16 01:01:43 +02:00
|
|
|
} else if (GMIME_IS_MULTIPART_SIGNED (part) && node->ctx->crypto->verify) {
|
2011-12-24 19:52:44 +01:00
|
|
|
if (node->nchildren != 2) {
|
|
|
|
/* this violates RFC 3156 section 5, so we won't bother with it. */
|
|
|
|
fprintf (stderr, "Error: %d part(s) for a multipart/signed message "
|
|
|
|
"(must be exactly 2)\n",
|
|
|
|
node->nchildren);
|
|
|
|
} else {
|
2019-05-02 15:19:41 +02:00
|
|
|
node_verify (node, part);
|
2011-12-24 19:52:44 +01:00
|
|
|
}
|
2019-05-25 20:04:05 +02:00
|
|
|
} else {
|
2019-08-29 17:38:52 +02:00
|
|
|
if (_notmuch_message_crypto_potential_payload (node->ctx->msg_crypto, part, node->parent ? node->parent->part : NULL, numchild) &&
|
|
|
|
node->ctx->msg_crypto->decryption_status == NOTMUCH_MESSAGE_DECRYPTED_FULL) {
|
|
|
|
GMimeObject *clean_payload = _notmuch_repair_crypto_payload_skip_legacy_display (part);
|
|
|
|
if (clean_payload != part) {
|
|
|
|
/* only one layer of recursion is possible here
|
|
|
|
* because there can be only a single cryptographic
|
|
|
|
* payload: */
|
|
|
|
return _mime_node_set_up_part (node, clean_payload, numchild);
|
|
|
|
}
|
|
|
|
}
|
2011-12-24 19:52:44 +01:00
|
|
|
}
|
|
|
|
|
2019-08-29 17:38:46 +02:00
|
|
|
return true;
|
2011-12-24 19:52:44 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
mime_node_t *
|
2012-01-24 00:33:09 +01:00
|
|
|
mime_node_child (mime_node_t *parent, int child)
|
2011-12-24 19:52:44 +01:00
|
|
|
{
|
|
|
|
GMimeObject *sub;
|
2012-01-24 00:33:09 +01:00
|
|
|
mime_node_t *node;
|
2011-12-24 19:52:44 +01:00
|
|
|
|
2019-06-13 12:31:01 +02:00
|
|
|
if (! parent || ! parent->part || child < 0 || child >= parent->nchildren)
|
2011-12-24 19:52:44 +01:00
|
|
|
return NULL;
|
|
|
|
|
|
|
|
if (GMIME_IS_MULTIPART (parent->part)) {
|
2019-05-31 03:18:53 +02:00
|
|
|
if (child == GMIME_MULTIPART_ENCRYPTED_CONTENT && parent->decrypted_child)
|
2011-12-24 19:52:44 +01:00
|
|
|
sub = parent->decrypted_child;
|
|
|
|
else
|
2019-06-13 00:47:20 +02:00
|
|
|
sub = g_mime_multipart_get_part (
|
|
|
|
GMIME_MULTIPART (parent->part), child);
|
2011-12-24 19:52:44 +01:00
|
|
|
} else if (GMIME_IS_MESSAGE (parent->part)) {
|
|
|
|
sub = g_mime_message_get_mime_part (GMIME_MESSAGE (parent->part));
|
|
|
|
} else {
|
2019-08-29 17:38:46 +02:00
|
|
|
/* This should have been caught by _mime_node_set_up_part */
|
2011-12-24 19:52:44 +01:00
|
|
|
INTERNAL_ERROR ("Unexpected GMimeObject type: %s",
|
|
|
|
g_type_name (G_OBJECT_TYPE (parent->part)));
|
|
|
|
}
|
2019-05-25 20:04:05 +02:00
|
|
|
node = _mime_node_create (parent, sub, child);
|
2012-01-24 00:33:09 +01:00
|
|
|
|
|
|
|
if (child == parent->next_child && parent->next_part_num != -1) {
|
|
|
|
/* We're traversing in depth-first order. Record the child's
|
|
|
|
* depth-first numbering. */
|
|
|
|
node->part_num = parent->next_part_num;
|
|
|
|
node->next_part_num = node->part_num + 1;
|
|
|
|
|
|
|
|
/* Prepare the parent for its next depth-first child. */
|
|
|
|
parent->next_child++;
|
|
|
|
parent->next_part_num = -1;
|
|
|
|
|
|
|
|
if (node->nchildren == 0) {
|
|
|
|
/* We've reached a leaf, so find the parent that has more
|
|
|
|
* children and set it up to number its next child. */
|
|
|
|
mime_node_t *iter = node->parent;
|
|
|
|
while (iter && iter->next_child == iter->nchildren)
|
|
|
|
iter = iter->parent;
|
|
|
|
if (iter)
|
|
|
|
iter->next_part_num = node->part_num + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return node;
|
2011-12-24 19:52:44 +01:00
|
|
|
}
|
2011-12-24 19:52:45 +01:00
|
|
|
|
|
|
|
static mime_node_t *
|
|
|
|
_mime_node_seek_dfs_walk (mime_node_t *node, int *n)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (*n == 0)
|
|
|
|
return node;
|
|
|
|
|
|
|
|
*n -= 1;
|
2017-01-06 21:14:49 +01:00
|
|
|
for (i = 0; i < node->nchildren; i++) {
|
2011-12-24 19:52:45 +01:00
|
|
|
mime_node_t *child = mime_node_child (node, i);
|
2017-01-06 21:14:49 +01:00
|
|
|
mime_node_t *ret = _mime_node_seek_dfs_walk (child, n);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
talloc_free (child);
|
2011-12-24 19:52:45 +01:00
|
|
|
}
|
2017-01-06 21:14:49 +01:00
|
|
|
return NULL;
|
2011-12-24 19:52:45 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
mime_node_t *
|
|
|
|
mime_node_seek_dfs (mime_node_t *node, int n)
|
|
|
|
{
|
|
|
|
if (n < 0)
|
|
|
|
return NULL;
|
|
|
|
return _mime_node_seek_dfs_walk (node, &n);
|
|
|
|
}
|