1 /* message.cc - Results of message-based searches from a notmuch database
3 * Copyright © 2009 Carl Worth
5 * This program is free software: you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation, either version 3 of the License, or
8 * (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program. If not, see http://www.gnu.org/licenses/ .
18 * Author: Carl Worth <cworth@cworth.org>
21 #include "notmuch-private.h"
22 #include "database-private.h"
26 struct _notmuch_message {
30 struct _notmuch_tags {
31 Xapian::TermIterator iterator;
32 Xapian::TermIterator iterator_end;
35 struct _notmuch_thread_ids {
40 #define ARRAY_SIZE(arr) (sizeof (arr) / sizeof (arr[0]))
42 /* These prefix values are specifically chosen to be compatible
43 * with sup, (http://sup.rubyforge.org), written by
44 * William Morgan <wmorgan-sup@masanjin.net>, and released
45 * under the GNU GPL v2.
53 prefix_t NORMAL_PREFIX[] = {
56 { "from_name", "FN" },
62 prefix_t BOOLEAN_PREFIX[] = {
64 { "from_email", "FE" },
70 { "attachment_extension", "O" },
77 _find_prefix (const char *name)
81 for (i = 0; i < ARRAY_SIZE (NORMAL_PREFIX); i++)
82 if (strcmp (name, NORMAL_PREFIX[i].name) == 0)
83 return NORMAL_PREFIX[i].prefix;
85 for (i = 0; i < ARRAY_SIZE (BOOLEAN_PREFIX); i++)
86 if (strcmp (name, BOOLEAN_PREFIX[i].name) == 0)
87 return BOOLEAN_PREFIX[i].prefix;
92 /* We end up having to call the destructor explicitly because we had
93 * to use "placement new" in order to initialize C++ objects within a
94 * block that we allocated with talloc. So C++ is making talloc
95 * slightly less simple to use, (we wouldn't need
96 * talloc_set_destructor at all otherwise).
99 _notmuch_message_destructor (notmuch_message_t *message)
101 message->doc.~Document ();
107 _notmuch_message_create (notmuch_results_t *owner,
108 notmuch_database_t *notmuch,
109 Xapian::docid doc_id)
111 notmuch_message_t *message;
113 message = talloc (owner, notmuch_message_t);
114 if (unlikely (message == NULL))
117 new (&message->doc) Xapian::Document;
119 talloc_set_destructor (message, _notmuch_message_destructor);
121 message->doc = notmuch->xapian_db->get_document (doc_id);
127 notmuch_message_get_message_id (notmuch_message_t *message)
129 Xapian::TermIterator i;
131 i = message->doc.termlist_begin ();
133 if (i != message->doc.termlist_end ())
134 return talloc_strdup (message, (*i).c_str () + 1);
139 /* We end up having to call the destructors explicitly because we had
140 * to use "placement new" in order to initialize C++ objects within a
141 * block that we allocated with talloc. So C++ is making talloc
142 * slightly less simple to use, (we wouldn't need
143 * talloc_set_destructor at all otherwise).
146 _notmuch_tags_destructor (notmuch_tags_t *tags)
148 tags->iterator.~TermIterator ();
149 tags->iterator_end.~TermIterator ();
155 notmuch_message_get_tags (notmuch_message_t *message)
157 notmuch_tags_t *tags;
159 tags = talloc (message, notmuch_tags_t);
160 if (unlikely (tags == NULL))
163 new (&tags->iterator) Xapian::TermIterator;
164 new (&tags->iterator_end) Xapian::TermIterator;
166 talloc_set_destructor (tags, _notmuch_tags_destructor);
168 tags->iterator = message->doc.termlist_begin ();
169 tags->iterator.skip_to ("L");
170 tags->iterator_end = message->doc.termlist_end ();
175 notmuch_thread_ids_t *
176 notmuch_message_get_thread_ids (notmuch_message_t *message)
178 notmuch_thread_ids_t *thread_ids;
181 thread_ids = talloc (message, notmuch_thread_ids_t);
182 if (unlikely (thread_ids == NULL))
185 id_str = message->doc.get_value (NOTMUCH_VALUE_THREAD).c_str ();
186 thread_ids->next = talloc_strdup (message, id_str);
188 /* Initialize thread_ids->current and terminate first ID. */
189 notmuch_thread_ids_advance (thread_ids);
195 notmuch_message_destroy (notmuch_message_t *message)
197 talloc_free (message);
201 notmuch_tags_has_more (notmuch_tags_t *tags)
205 if (tags->iterator == tags->iterator_end)
209 if (s.size () && s[0] == 'L')
216 notmuch_tags_get (notmuch_tags_t *tags)
218 return talloc_strdup (tags, (*tags->iterator).c_str () + 1);
222 notmuch_tags_advance (notmuch_tags_t *tags)
228 notmuch_tags_destroy (notmuch_tags_t *tags)
234 notmuch_thread_ids_has_more (notmuch_thread_ids_t *thread_ids)
236 if (thread_ids->current == NULL || *thread_ids->current == '\0')
243 notmuch_thread_ids_get (notmuch_thread_ids_t *thread_ids)
245 return thread_ids->current;
249 notmuch_thread_ids_advance (notmuch_thread_ids_t *thread_ids)
251 thread_ids->current = strsep (&thread_ids->next, ",");
255 notmuch_thread_ids_destroy (notmuch_thread_ids_t *thread_ids)
257 talloc_free (thread_ids);