2009-11-15 08:05:17 +01:00
|
|
|
/* messages.c - Iterator for a set of messages
|
|
|
|
*
|
|
|
|
* 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-11-15 08:05:17 +01:00
|
|
|
*
|
|
|
|
* Author: Carl Worth <cworth@cworth.org>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "notmuch-private.h"
|
|
|
|
|
2009-11-25 04:30:21 +01:00
|
|
|
#include <glib.h>
|
|
|
|
|
2009-11-16 05:29:13 +01:00
|
|
|
/* Create a new notmuch_message_list_t object, with 'ctx' as its
|
|
|
|
* talloc owner.
|
2009-11-15 08:05:17 +01:00
|
|
|
*
|
|
|
|
* This function can return NULL in case of out-of-memory.
|
|
|
|
*/
|
2009-11-16 05:29:13 +01:00
|
|
|
notmuch_message_list_t *
|
|
|
|
_notmuch_message_list_create (const void *ctx)
|
2009-11-15 08:05:17 +01:00
|
|
|
{
|
2009-11-16 05:29:13 +01:00
|
|
|
notmuch_message_list_t *list;
|
2009-11-15 08:05:17 +01:00
|
|
|
|
2009-11-16 05:29:13 +01:00
|
|
|
list = talloc (ctx, notmuch_message_list_t);
|
|
|
|
if (unlikely (list == NULL))
|
2009-11-15 08:05:17 +01:00
|
|
|
return NULL;
|
|
|
|
|
2009-11-16 05:29:13 +01:00
|
|
|
list->head = NULL;
|
|
|
|
list->tail = &list->head;
|
2009-11-15 08:05:17 +01:00
|
|
|
|
2009-11-16 05:29:13 +01:00
|
|
|
return list;
|
2009-11-15 08:05:17 +01:00
|
|
|
}
|
|
|
|
|
2012-11-25 05:57:04 +01:00
|
|
|
/* Append 'message' to the end of 'list'. */
|
2009-11-16 05:29:13 +01:00
|
|
|
void
|
|
|
|
_notmuch_message_list_add_message (notmuch_message_list_t *list,
|
|
|
|
notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
notmuch_message_node_t *node = talloc (list, notmuch_message_node_t);
|
|
|
|
|
|
|
|
node->message = message;
|
|
|
|
node->next = NULL;
|
|
|
|
|
2012-11-25 05:57:04 +01:00
|
|
|
*(list->tail) = node;
|
|
|
|
list->tail = &node->next;
|
2009-11-16 05:29:13 +01:00
|
|
|
}
|
|
|
|
|
2018-09-03 23:02:25 +02:00
|
|
|
bool
|
|
|
|
_notmuch_message_list_empty (notmuch_message_list_t *list)
|
|
|
|
{
|
|
|
|
if (list == NULL)
|
|
|
|
return TRUE;
|
|
|
|
|
|
|
|
return (list->head == NULL);
|
|
|
|
}
|
|
|
|
|
2009-11-16 05:29:13 +01:00
|
|
|
notmuch_messages_t *
|
|
|
|
_notmuch_messages_create (notmuch_message_list_t *list)
|
2009-11-15 08:05:17 +01:00
|
|
|
{
|
2009-11-16 05:29:13 +01:00
|
|
|
notmuch_messages_t *messages;
|
2009-11-15 08:05:17 +01:00
|
|
|
|
2009-11-16 05:29:13 +01:00
|
|
|
if (list->head == NULL)
|
|
|
|
return NULL;
|
2009-11-15 08:05:17 +01:00
|
|
|
|
2009-11-16 05:29:13 +01:00
|
|
|
messages = talloc (list, notmuch_messages_t);
|
|
|
|
if (unlikely (messages == NULL))
|
|
|
|
return NULL;
|
|
|
|
|
2017-10-07 10:44:05 +02:00
|
|
|
messages->is_of_list_type = true;
|
2009-11-16 05:29:13 +01:00
|
|
|
messages->iterator = list->head;
|
|
|
|
|
|
|
|
return messages;
|
2009-11-15 08:05:17 +01:00
|
|
|
}
|
|
|
|
|
2009-11-24 06:47:24 +01:00
|
|
|
/* We're using the "is_of_type_list" to conditionally defer to the
|
|
|
|
* notmuch_mset_messages_t implementation of notmuch_messages_t in
|
|
|
|
* query.cc. It's ugly that that's over in query.cc, and it's ugly
|
|
|
|
* that we're not using a union here. Both of those uglies are due to
|
|
|
|
* C++:
|
|
|
|
*
|
|
|
|
* 1. I didn't want to force a C++ header file onto
|
|
|
|
* notmuch-private.h and suddenly subject all our code to a
|
|
|
|
* C++ compiler and its rules.
|
|
|
|
*
|
|
|
|
* 2. C++ won't allow me to put C++ objects, (with non-trivial
|
|
|
|
* constructors) into a union anyway. Even though I'd
|
|
|
|
* carefully control object construction with placement new
|
|
|
|
* anyway. *sigh*
|
|
|
|
*/
|
2009-11-15 08:05:17 +01:00
|
|
|
notmuch_bool_t
|
2010-03-09 18:22:29 +01:00
|
|
|
notmuch_messages_valid (notmuch_messages_t *messages)
|
2009-11-15 08:05:17 +01:00
|
|
|
{
|
2009-11-24 06:47:24 +01:00
|
|
|
if (messages == NULL)
|
2017-10-07 10:44:05 +02:00
|
|
|
return false;
|
2009-11-24 06:47:24 +01:00
|
|
|
|
|
|
|
if (! messages->is_of_list_type)
|
2010-03-09 18:22:29 +01:00
|
|
|
return _notmuch_mset_messages_valid (messages);
|
2009-11-24 06:47:24 +01:00
|
|
|
|
|
|
|
return (messages->iterator != NULL);
|
2009-11-15 08:05:17 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
notmuch_message_t *
|
|
|
|
notmuch_messages_get (notmuch_messages_t *messages)
|
|
|
|
{
|
2009-11-24 06:47:24 +01:00
|
|
|
if (! messages->is_of_list_type)
|
|
|
|
return _notmuch_mset_messages_get (messages);
|
|
|
|
|
2009-11-16 05:29:13 +01:00
|
|
|
if (messages->iterator == NULL)
|
2009-11-15 08:05:17 +01:00
|
|
|
return NULL;
|
|
|
|
|
2009-11-16 05:29:13 +01:00
|
|
|
return messages->iterator->message;
|
2009-11-15 08:05:17 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2010-03-09 18:22:29 +01:00
|
|
|
notmuch_messages_move_to_next (notmuch_messages_t *messages)
|
2009-11-15 08:05:17 +01:00
|
|
|
{
|
2012-01-08 00:26:17 +01:00
|
|
|
if (! messages->is_of_list_type) {
|
|
|
|
_notmuch_mset_messages_move_to_next (messages);
|
|
|
|
return;
|
|
|
|
}
|
2009-11-24 06:47:24 +01:00
|
|
|
|
2009-11-16 05:29:13 +01:00
|
|
|
if (messages->iterator == NULL)
|
2009-11-15 08:05:17 +01:00
|
|
|
return;
|
|
|
|
|
2009-11-16 05:29:13 +01:00
|
|
|
messages->iterator = messages->iterator->next;
|
2009-11-15 08:05:17 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
notmuch_messages_destroy (notmuch_messages_t *messages)
|
|
|
|
{
|
|
|
|
talloc_free (messages);
|
|
|
|
}
|
2009-11-25 04:30:21 +01:00
|
|
|
|
|
|
|
|
|
|
|
notmuch_tags_t *
|
|
|
|
notmuch_messages_collect_tags (notmuch_messages_t *messages)
|
|
|
|
{
|
2010-12-09 01:26:05 +01:00
|
|
|
notmuch_string_list_t *tags;
|
|
|
|
notmuch_tags_t *msg_tags;
|
2009-11-25 04:30:21 +01:00
|
|
|
notmuch_message_t *msg;
|
|
|
|
GHashTable *htable;
|
|
|
|
GList *keys, *l;
|
|
|
|
const char *tag;
|
|
|
|
|
2010-12-09 01:26:05 +01:00
|
|
|
tags = _notmuch_string_list_create (messages);
|
2009-11-25 04:30:21 +01:00
|
|
|
if (tags == NULL) return NULL;
|
|
|
|
|
|
|
|
htable = g_hash_table_new_full (g_str_hash, g_str_equal, free, NULL);
|
|
|
|
|
|
|
|
while ((msg = notmuch_messages_get (messages))) {
|
|
|
|
msg_tags = notmuch_message_get_tags (msg);
|
|
|
|
while ((tag = notmuch_tags_get (msg_tags))) {
|
|
|
|
g_hash_table_insert (htable, xstrdup (tag), NULL);
|
2010-03-09 18:22:29 +01:00
|
|
|
notmuch_tags_move_to_next (msg_tags);
|
2009-11-25 04:30:21 +01:00
|
|
|
}
|
|
|
|
notmuch_tags_destroy (msg_tags);
|
|
|
|
notmuch_message_destroy (msg);
|
2010-03-09 18:22:29 +01:00
|
|
|
notmuch_messages_move_to_next (messages);
|
2009-11-25 04:30:21 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
keys = g_hash_table_get_keys (htable);
|
|
|
|
for (l = keys; l; l = l->next) {
|
2010-12-09 01:26:05 +01:00
|
|
|
_notmuch_string_list_append (tags, (char *)l->data);
|
2009-11-25 04:30:21 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
g_list_free (keys);
|
|
|
|
g_hash_table_destroy (htable);
|
|
|
|
|
2010-12-09 01:26:05 +01:00
|
|
|
_notmuch_string_list_sort (tags);
|
|
|
|
return _notmuch_tags_create (messages, tags);
|
2009-11-25 04:30:21 +01:00
|
|
|
}
|