2009-11-10 21:03:05 +01:00
|
|
|
/* notmuch - Not much of an email program, (just index and search)
|
|
|
|
*
|
|
|
|
* 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-10 21:03:05 +01:00
|
|
|
*
|
|
|
|
* Author: Carl Worth <cworth@cworth.org>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "notmuch-client.h"
|
2012-07-23 12:39:46 +02:00
|
|
|
#include "sprinter.h"
|
2013-10-24 17:19:08 +02:00
|
|
|
#include "string-util.h"
|
2009-11-10 21:03:05 +01:00
|
|
|
|
2010-10-28 20:19:53 +02:00
|
|
|
typedef enum {
|
2014-11-05 01:25:55 +01:00
|
|
|
/* Search command */
|
2014-10-31 22:53:57 +01:00
|
|
|
OUTPUT_SUMMARY = 1 << 0,
|
|
|
|
OUTPUT_THREADS = 1 << 1,
|
|
|
|
OUTPUT_MESSAGES = 1 << 2,
|
|
|
|
OUTPUT_FILES = 1 << 3,
|
|
|
|
OUTPUT_TAGS = 1 << 4,
|
2014-11-05 01:25:55 +01:00
|
|
|
|
|
|
|
/* Address command */
|
2014-10-31 22:53:58 +01:00
|
|
|
OUTPUT_SENDER = 1 << 5,
|
|
|
|
OUTPUT_RECIPIENTS = 1 << 6,
|
2014-11-05 01:25:58 +01:00
|
|
|
OUTPUT_COUNT = 1 << 7,
|
2017-11-02 19:44:59 +01:00
|
|
|
OUTPUT_ADDRESS = 1 << 8,
|
2010-10-28 20:19:53 +02:00
|
|
|
} output_t;
|
|
|
|
|
2015-09-03 21:39:59 +02:00
|
|
|
typedef enum {
|
|
|
|
DEDUP_NONE,
|
|
|
|
DEDUP_MAILBOX,
|
2015-09-03 21:40:03 +02:00
|
|
|
DEDUP_ADDRESS,
|
2015-09-03 21:39:59 +02:00
|
|
|
} dedup_t;
|
|
|
|
|
2014-11-05 01:25:51 +01:00
|
|
|
typedef enum {
|
|
|
|
NOTMUCH_FORMAT_JSON,
|
|
|
|
NOTMUCH_FORMAT_TEXT,
|
|
|
|
NOTMUCH_FORMAT_TEXT0,
|
|
|
|
NOTMUCH_FORMAT_SEXP
|
|
|
|
} format_sel_t;
|
|
|
|
|
2014-10-31 22:53:55 +01:00
|
|
|
typedef struct {
|
2014-11-05 01:25:51 +01:00
|
|
|
notmuch_database_t *notmuch;
|
2020-08-08 16:16:52 +02:00
|
|
|
void *talloc_ctx;
|
cli: use designated initializers for opt desc
Several changes at once, just to not have to change the same lines
several times over:
- Use designated initializers to initialize opt desc arrays.
- Only initialize the needed fields.
- Remove arg_id (short options) as unused.
- Replace opt_type and output_var with several type safe output
variables, where the output variable being non-NULL determines the
type. Introduce checks to ensure only one is set. The downside is
some waste of const space per argument; this could be saved by
retaining opt_type and using a union, but that's still pretty
verbose.
- Fix some variables due to the type safety. Mostly a good thing, but
leads to some enums being changed to ints. This is pedantically
correct, but somewhat annoying. We could also cast, but that defeats
the purpose a bit.
- Terminate the opt desc arrays using {}.
The output variable type safety and the ability to add new fields for
just some output types or arguments are the big wins. For example, if
we wanted to add a variable to set when the argument is present, we
could do so for just the arguments that need it.
Beauty is in the eye of the beholder, but I think this looks nice when
defining the arguments, and reduces some of the verbosity we have
there.
2017-10-01 22:53:11 +02:00
|
|
|
int format_sel;
|
2014-10-31 22:53:55 +01:00
|
|
|
sprinter_t *format;
|
cli: use designated initializers for opt desc
Several changes at once, just to not have to change the same lines
several times over:
- Use designated initializers to initialize opt desc arrays.
- Only initialize the needed fields.
- Remove arg_id (short options) as unused.
- Replace opt_type and output_var with several type safe output
variables, where the output variable being non-NULL determines the
type. Introduce checks to ensure only one is set. The downside is
some waste of const space per argument; this could be saved by
retaining opt_type and using a union, but that's still pretty
verbose.
- Fix some variables due to the type safety. Mostly a good thing, but
leads to some enums being changed to ints. This is pedantically
correct, but somewhat annoying. We could also cast, but that defeats
the purpose a bit.
- Terminate the opt desc arrays using {}.
The output variable type safety and the ability to add new fields for
just some output types or arguments are the big wins. For example, if
we wanted to add a variable to set when the argument is present, we
could do so for just the arguments that need it.
Beauty is in the eye of the beholder, but I think this looks nice when
defining the arguments, and reduces some of the verbosity we have
there.
2017-10-01 22:53:11 +02:00
|
|
|
int exclude;
|
2014-10-31 22:53:55 +01:00
|
|
|
notmuch_query_t *query;
|
cli: use designated initializers for opt desc
Several changes at once, just to not have to change the same lines
several times over:
- Use designated initializers to initialize opt desc arrays.
- Only initialize the needed fields.
- Remove arg_id (short options) as unused.
- Replace opt_type and output_var with several type safe output
variables, where the output variable being non-NULL determines the
type. Introduce checks to ensure only one is set. The downside is
some waste of const space per argument; this could be saved by
retaining opt_type and using a union, but that's still pretty
verbose.
- Fix some variables due to the type safety. Mostly a good thing, but
leads to some enums being changed to ints. This is pedantically
correct, but somewhat annoying. We could also cast, but that defeats
the purpose a bit.
- Terminate the opt desc arrays using {}.
The output variable type safety and the ability to add new fields for
just some output types or arguments are the big wins. For example, if
we wanted to add a variable to set when the argument is present, we
could do so for just the arguments that need it.
Beauty is in the eye of the beholder, but I think this looks nice when
defining the arguments, and reduces some of the verbosity we have
there.
2017-10-01 22:53:11 +02:00
|
|
|
int sort;
|
|
|
|
int output;
|
2014-10-31 22:53:55 +01:00
|
|
|
int offset;
|
|
|
|
int limit;
|
|
|
|
int dupe;
|
2014-11-05 01:25:57 +01:00
|
|
|
GHashTable *addresses;
|
cli: use designated initializers for opt desc
Several changes at once, just to not have to change the same lines
several times over:
- Use designated initializers to initialize opt desc arrays.
- Only initialize the needed fields.
- Remove arg_id (short options) as unused.
- Replace opt_type and output_var with several type safe output
variables, where the output variable being non-NULL determines the
type. Introduce checks to ensure only one is set. The downside is
some waste of const space per argument; this could be saved by
retaining opt_type and using a union, but that's still pretty
verbose.
- Fix some variables due to the type safety. Mostly a good thing, but
leads to some enums being changed to ints. This is pedantically
correct, but somewhat annoying. We could also cast, but that defeats
the purpose a bit.
- Terminate the opt desc arrays using {}.
The output variable type safety and the ability to add new fields for
just some output types or arguments are the big wins. For example, if
we wanted to add a variable to set when the argument is present, we
could do so for just the arguments that need it.
Beauty is in the eye of the beholder, but I think this looks nice when
defining the arguments, and reduces some of the verbosity we have
there.
2017-10-01 22:53:11 +02:00
|
|
|
int dedup;
|
2014-11-05 01:25:50 +01:00
|
|
|
} search_context_t;
|
2014-10-31 22:53:55 +01:00
|
|
|
|
2014-10-31 22:53:58 +01:00
|
|
|
typedef struct {
|
|
|
|
const char *name;
|
|
|
|
const char *addr;
|
2014-11-05 01:25:58 +01:00
|
|
|
int count;
|
2014-10-31 22:53:58 +01:00
|
|
|
} mailbox_t;
|
|
|
|
|
2013-10-24 17:19:08 +02:00
|
|
|
/* Return two stable query strings that identify exactly the matched
|
|
|
|
* and unmatched messages currently in thread. If there are no
|
|
|
|
* matched or unmatched messages, the returned buffers will be
|
|
|
|
* NULL. */
|
|
|
|
static int
|
|
|
|
get_thread_query (notmuch_thread_t *thread,
|
|
|
|
char **matched_out, char **unmatched_out)
|
|
|
|
{
|
|
|
|
notmuch_messages_t *messages;
|
|
|
|
char *escaped = NULL;
|
|
|
|
size_t escaped_len = 0;
|
|
|
|
|
|
|
|
*matched_out = *unmatched_out = NULL;
|
|
|
|
|
|
|
|
for (messages = notmuch_thread_get_messages (thread);
|
|
|
|
notmuch_messages_valid (messages);
|
2019-06-13 12:31:01 +02:00
|
|
|
notmuch_messages_move_to_next (messages)) {
|
2013-10-24 17:19:08 +02:00
|
|
|
notmuch_message_t *message = notmuch_messages_get (messages);
|
|
|
|
const char *mid = notmuch_message_get_message_id (message);
|
2020-07-11 20:30:04 +02:00
|
|
|
notmuch_bool_t is_set;
|
|
|
|
char **buf;
|
|
|
|
|
|
|
|
if (notmuch_message_get_flag_st (message, NOTMUCH_MESSAGE_FLAG_MATCH, &is_set))
|
|
|
|
return -1;
|
2013-10-24 17:19:08 +02:00
|
|
|
/* Determine which query buffer to extend */
|
2020-07-11 20:30:04 +02:00
|
|
|
buf = is_set ? matched_out : unmatched_out;
|
2013-10-24 17:19:08 +02:00
|
|
|
/* Add this message's id: query. Since "id" is an exclusive
|
|
|
|
* prefix, it is implicitly 'or'd together, so we only need to
|
|
|
|
* join queries with a space. */
|
|
|
|
if (make_boolean_term (thread, "id", mid, &escaped, &escaped_len) < 0)
|
|
|
|
return -1;
|
|
|
|
if (*buf)
|
|
|
|
*buf = talloc_asprintf_append_buffer (*buf, " %s", escaped);
|
|
|
|
else
|
|
|
|
*buf = talloc_strdup (thread, escaped);
|
2019-06-13 12:31:01 +02:00
|
|
|
if (! *buf)
|
2013-10-24 17:19:08 +02:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
talloc_free (escaped);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2010-10-23 02:57:02 +02:00
|
|
|
static int
|
2014-11-05 01:25:50 +01:00
|
|
|
do_search_threads (search_context_t *ctx)
|
2009-11-18 04:11:05 +01:00
|
|
|
{
|
|
|
|
notmuch_thread_t *thread;
|
|
|
|
notmuch_threads_t *threads;
|
|
|
|
notmuch_tags_t *tags;
|
2014-11-05 01:25:50 +01:00
|
|
|
sprinter_t *format = ctx->format;
|
2009-11-18 04:11:05 +01:00
|
|
|
time_t date;
|
2011-11-15 21:08:49 +01:00
|
|
|
int i;
|
2015-09-06 15:15:47 +02:00
|
|
|
notmuch_status_t status;
|
2011-11-15 21:08:49 +01:00
|
|
|
|
2014-11-05 01:25:50 +01:00
|
|
|
if (ctx->offset < 0) {
|
2015-09-27 17:31:58 +02:00
|
|
|
unsigned count;
|
|
|
|
notmuch_status_t status;
|
2017-02-26 22:21:35 +01:00
|
|
|
status = notmuch_query_count_threads (ctx->query, &count);
|
2015-09-27 17:31:58 +02:00
|
|
|
if (print_status_query ("notmuch search", ctx->query, status))
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
ctx->offset += count;
|
2014-11-05 01:25:50 +01:00
|
|
|
if (ctx->offset < 0)
|
|
|
|
ctx->offset = 0;
|
2011-11-15 21:08:49 +01:00
|
|
|
}
|
2009-12-31 16:17:40 +01:00
|
|
|
|
2017-02-26 22:21:31 +01:00
|
|
|
status = notmuch_query_search_threads (ctx->query, &threads);
|
2019-06-13 12:31:01 +02:00
|
|
|
if (print_status_query ("notmuch search", ctx->query, status))
|
2010-10-23 02:57:02 +02:00
|
|
|
return 1;
|
|
|
|
|
2012-07-23 12:39:46 +02:00
|
|
|
format->begin_list (format);
|
2011-01-30 20:26:04 +01:00
|
|
|
|
2011-11-15 21:08:49 +01:00
|
|
|
for (i = 0;
|
2014-11-05 01:25:50 +01:00
|
|
|
notmuch_threads_valid (threads) && (ctx->limit < 0 || i < ctx->offset + ctx->limit);
|
2019-06-13 12:31:01 +02:00
|
|
|
notmuch_threads_move_to_next (threads), i++) {
|
2011-11-15 21:08:49 +01:00
|
|
|
thread = notmuch_threads_get (threads);
|
|
|
|
|
2014-11-05 01:25:50 +01:00
|
|
|
if (i < ctx->offset) {
|
2011-11-15 21:08:49 +01:00
|
|
|
notmuch_thread_destroy (thread);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2014-11-05 01:25:50 +01:00
|
|
|
if (ctx->output == OUTPUT_THREADS) {
|
2012-07-23 12:39:46 +02:00
|
|
|
format->set_prefix (format, "thread");
|
|
|
|
format->string (format,
|
|
|
|
notmuch_thread_get_thread_id (thread));
|
|
|
|
format->separator (format);
|
2010-10-28 20:19:53 +02:00
|
|
|
} else { /* output == OUTPUT_SUMMARY */
|
2012-07-23 12:39:46 +02:00
|
|
|
void *ctx_quote = talloc_new (thread);
|
|
|
|
const char *authors = notmuch_thread_get_authors (thread);
|
|
|
|
const char *subject = notmuch_thread_get_subject (thread);
|
|
|
|
const char *thread_id = notmuch_thread_get_thread_id (thread);
|
|
|
|
int matched = notmuch_thread_get_matched_messages (thread);
|
2017-06-04 14:32:32 +02:00
|
|
|
int files = notmuch_thread_get_total_files (thread);
|
2012-07-23 12:39:46 +02:00
|
|
|
int total = notmuch_thread_get_total_messages (thread);
|
|
|
|
const char *relative_date = NULL;
|
2017-10-07 10:44:04 +02:00
|
|
|
bool first_tag = true;
|
2012-07-23 12:39:46 +02:00
|
|
|
|
|
|
|
format->begin_map (format);
|
2010-10-28 20:19:53 +02:00
|
|
|
|
2014-11-05 01:25:50 +01:00
|
|
|
if (ctx->sort == NOTMUCH_SORT_OLDEST_FIRST)
|
2010-10-28 20:19:53 +02:00
|
|
|
date = notmuch_thread_get_oldest_date (thread);
|
|
|
|
else
|
|
|
|
date = notmuch_thread_get_newest_date (thread);
|
|
|
|
|
2012-07-23 12:39:46 +02:00
|
|
|
relative_date = notmuch_time_relative_date (ctx_quote, date);
|
|
|
|
|
|
|
|
if (format->is_text_printer) {
|
2019-06-13 12:31:01 +02:00
|
|
|
/* Special case for the text formatter */
|
2017-06-04 14:32:32 +02:00
|
|
|
printf ("thread:%s %12s ",
|
2012-07-23 12:39:46 +02:00
|
|
|
thread_id,
|
2017-06-04 14:32:32 +02:00
|
|
|
relative_date);
|
|
|
|
if (total == files)
|
|
|
|
printf ("[%d/%d] %s; %s (",
|
2019-06-13 12:31:01 +02:00
|
|
|
matched,
|
|
|
|
total,
|
|
|
|
sanitize_string (ctx_quote, authors),
|
|
|
|
sanitize_string (ctx_quote, subject));
|
2017-06-04 14:32:32 +02:00
|
|
|
else
|
|
|
|
printf ("[%d/%d(%d)] %s; %s (",
|
2019-06-13 12:31:01 +02:00
|
|
|
matched,
|
|
|
|
total,
|
|
|
|
files,
|
|
|
|
sanitize_string (ctx_quote, authors),
|
|
|
|
sanitize_string (ctx_quote, subject));
|
2017-06-04 14:32:32 +02:00
|
|
|
|
2012-07-23 12:39:46 +02:00
|
|
|
} else { /* Structured Output */
|
|
|
|
format->map_key (format, "thread");
|
|
|
|
format->string (format, thread_id);
|
|
|
|
format->map_key (format, "timestamp");
|
|
|
|
format->integer (format, date);
|
|
|
|
format->map_key (format, "date_relative");
|
|
|
|
format->string (format, relative_date);
|
|
|
|
format->map_key (format, "matched");
|
|
|
|
format->integer (format, matched);
|
|
|
|
format->map_key (format, "total");
|
|
|
|
format->integer (format, total);
|
|
|
|
format->map_key (format, "authors");
|
|
|
|
format->string (format, authors);
|
|
|
|
format->map_key (format, "subject");
|
|
|
|
format->string (format, subject);
|
2013-10-24 17:19:08 +02:00
|
|
|
if (notmuch_format_version >= 2) {
|
|
|
|
char *matched_query, *unmatched_query;
|
|
|
|
if (get_thread_query (thread, &matched_query,
|
|
|
|
&unmatched_query) < 0) {
|
|
|
|
fprintf (stderr, "Out of memory\n");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
format->map_key (format, "query");
|
|
|
|
format->begin_list (format);
|
|
|
|
if (matched_query)
|
|
|
|
format->string (format, matched_query);
|
|
|
|
else
|
|
|
|
format->null (format);
|
|
|
|
if (unmatched_query)
|
|
|
|
format->string (format, unmatched_query);
|
|
|
|
else
|
|
|
|
format->null (format);
|
|
|
|
format->end (format);
|
|
|
|
}
|
2012-07-23 12:39:46 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
talloc_free (ctx_quote);
|
2010-10-28 20:19:53 +02:00
|
|
|
|
2012-07-23 12:39:46 +02:00
|
|
|
format->map_key (format, "tags");
|
|
|
|
format->begin_list (format);
|
2010-10-28 20:19:53 +02:00
|
|
|
|
|
|
|
for (tags = notmuch_thread_get_tags (thread);
|
|
|
|
notmuch_tags_valid (tags);
|
2019-06-13 12:31:01 +02:00
|
|
|
notmuch_tags_move_to_next (tags)) {
|
2012-07-23 12:39:46 +02:00
|
|
|
const char *tag = notmuch_tags_get (tags);
|
|
|
|
|
|
|
|
if (format->is_text_printer) {
|
2019-06-13 12:31:01 +02:00
|
|
|
/* Special case for the text formatter */
|
2012-07-23 12:39:46 +02:00
|
|
|
if (first_tag)
|
2017-10-07 10:44:04 +02:00
|
|
|
first_tag = false;
|
2012-07-23 12:39:46 +02:00
|
|
|
else
|
|
|
|
fputc (' ', stdout);
|
|
|
|
fputs (tag, stdout);
|
|
|
|
} else { /* Structured Output */
|
|
|
|
format->string (format, tag);
|
|
|
|
}
|
2010-10-28 20:19:53 +02:00
|
|
|
}
|
2009-12-31 16:17:40 +01:00
|
|
|
|
2012-07-23 12:39:46 +02:00
|
|
|
if (format->is_text_printer)
|
|
|
|
printf (")");
|
2010-10-28 20:19:53 +02:00
|
|
|
|
2012-07-23 12:39:46 +02:00
|
|
|
format->end (format);
|
|
|
|
format->end (format);
|
|
|
|
format->separator (format);
|
2010-10-28 20:19:53 +02:00
|
|
|
}
|
2009-12-31 16:17:40 +01:00
|
|
|
|
2009-11-18 04:11:05 +01:00
|
|
|
notmuch_thread_destroy (thread);
|
|
|
|
}
|
2009-12-31 16:17:40 +01:00
|
|
|
|
2012-07-23 12:39:46 +02:00
|
|
|
format->end (format);
|
2010-11-01 17:15:40 +01:00
|
|
|
|
2010-10-28 20:19:53 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2019-06-13 12:31:01 +02:00
|
|
|
static mailbox_t *
|
|
|
|
new_mailbox (void *ctx, const char *name, const char *addr)
|
2015-09-03 21:39:58 +02:00
|
|
|
{
|
|
|
|
mailbox_t *mailbox;
|
|
|
|
|
|
|
|
mailbox = talloc (ctx, mailbox_t);
|
|
|
|
if (! mailbox)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
mailbox->name = talloc_strdup (mailbox, name);
|
|
|
|
mailbox->addr = talloc_strdup (mailbox, addr);
|
|
|
|
mailbox->count = 1;
|
|
|
|
|
|
|
|
return mailbox;
|
|
|
|
}
|
|
|
|
|
2019-06-13 12:31:01 +02:00
|
|
|
static int
|
|
|
|
mailbox_compare (const void *v1, const void *v2)
|
2015-09-25 18:48:20 +02:00
|
|
|
{
|
|
|
|
const mailbox_t *m1 = v1, *m2 = v2;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = strcmp_null (m1->name, m2->name);
|
|
|
|
if (! ret)
|
|
|
|
ret = strcmp (m1->addr, m2->addr);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2017-10-07 10:44:04 +02:00
|
|
|
/* Returns true iff name and addr is duplicate. If not, stores the
|
2014-11-05 01:25:57 +01:00
|
|
|
* name/addr pair in order to detect subsequent duplicates. */
|
2017-10-07 10:44:04 +02:00
|
|
|
static bool
|
2014-11-05 01:25:57 +01:00
|
|
|
is_duplicate (const search_context_t *ctx, const char *name, const char *addr)
|
|
|
|
{
|
|
|
|
char *key;
|
2015-09-25 18:48:20 +02:00
|
|
|
GList *list, *l;
|
2014-11-05 01:25:58 +01:00
|
|
|
mailbox_t *mailbox;
|
2014-11-05 01:25:57 +01:00
|
|
|
|
2015-09-25 18:48:20 +02:00
|
|
|
list = g_hash_table_lookup (ctx->addresses, addr);
|
|
|
|
if (list) {
|
|
|
|
mailbox_t find = {
|
|
|
|
.name = name,
|
|
|
|
.addr = addr,
|
|
|
|
};
|
|
|
|
|
|
|
|
l = g_list_find_custom (list, &find, mailbox_compare);
|
|
|
|
if (l) {
|
|
|
|
mailbox = l->data;
|
|
|
|
mailbox->count++;
|
2017-10-07 10:44:04 +02:00
|
|
|
return true;
|
2015-09-25 18:48:20 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
mailbox = new_mailbox (ctx->format, name, addr);
|
|
|
|
if (! mailbox)
|
2017-10-07 10:44:04 +02:00
|
|
|
return false;
|
2014-11-05 01:25:57 +01:00
|
|
|
|
2015-09-25 18:48:20 +02:00
|
|
|
/*
|
|
|
|
* XXX: It would be more efficient to prepend to the list, but
|
|
|
|
* then we'd have to store the changed list head back to the
|
|
|
|
* hash table. This check is here just to avoid the compiler
|
|
|
|
* warning for unused result.
|
|
|
|
*/
|
|
|
|
if (list != g_list_append (list, mailbox))
|
|
|
|
INTERNAL_ERROR ("appending to list changed list head\n");
|
|
|
|
|
2017-10-07 10:44:04 +02:00
|
|
|
return false;
|
2014-11-05 01:25:58 +01:00
|
|
|
}
|
2014-11-05 01:25:57 +01:00
|
|
|
|
2015-09-25 18:48:20 +02:00
|
|
|
key = talloc_strdup (ctx->format, addr);
|
|
|
|
if (! key)
|
2017-10-07 10:44:04 +02:00
|
|
|
return false;
|
2015-09-25 18:48:20 +02:00
|
|
|
|
2015-09-03 21:39:58 +02:00
|
|
|
mailbox = new_mailbox (ctx->format, name, addr);
|
|
|
|
if (! mailbox)
|
2017-10-07 10:44:04 +02:00
|
|
|
return false;
|
2015-09-03 21:39:58 +02:00
|
|
|
|
2015-09-25 18:48:20 +02:00
|
|
|
list = g_list_append (NULL, mailbox);
|
|
|
|
if (! list)
|
2017-10-07 10:44:04 +02:00
|
|
|
return false;
|
2015-09-25 18:48:20 +02:00
|
|
|
|
|
|
|
g_hash_table_insert (ctx->addresses, key, list);
|
2015-09-03 21:39:57 +02:00
|
|
|
|
2017-10-07 10:44:04 +02:00
|
|
|
return false;
|
2014-11-05 01:25:57 +01:00
|
|
|
}
|
|
|
|
|
2014-10-31 22:53:58 +01:00
|
|
|
static void
|
2014-11-05 01:25:50 +01:00
|
|
|
print_mailbox (const search_context_t *ctx, const mailbox_t *mailbox)
|
2014-10-31 22:53:58 +01:00
|
|
|
{
|
|
|
|
const char *name = mailbox->name;
|
|
|
|
const char *addr = mailbox->addr;
|
2014-11-05 01:25:58 +01:00
|
|
|
int count = mailbox->count;
|
2014-11-05 01:25:50 +01:00
|
|
|
sprinter_t *format = ctx->format;
|
2014-10-31 22:53:58 +01:00
|
|
|
InternetAddress *ia = internet_address_mailbox_new (name, addr);
|
|
|
|
char *name_addr;
|
|
|
|
|
|
|
|
/* name_addr has the name part quoted if necessary. Compare
|
|
|
|
* 'John Doe <john@doe.com>' vs. '"Doe, John" <john@doe.com>' */
|
2019-05-02 15:19:45 +02:00
|
|
|
name_addr = internet_address_to_string (ia, NULL, false);
|
2014-10-31 22:53:58 +01:00
|
|
|
|
|
|
|
if (format->is_text_printer) {
|
2015-09-03 21:40:03 +02:00
|
|
|
if (ctx->output & OUTPUT_COUNT) {
|
2014-11-05 01:25:58 +01:00
|
|
|
format->integer (format, count);
|
|
|
|
format->string (format, "\t");
|
|
|
|
}
|
2017-11-02 19:44:59 +01:00
|
|
|
if (ctx->output & OUTPUT_ADDRESS)
|
|
|
|
format->string (format, addr);
|
|
|
|
else
|
|
|
|
format->string (format, name_addr);
|
2014-10-31 22:53:58 +01:00
|
|
|
format->separator (format);
|
|
|
|
} else {
|
|
|
|
format->begin_map (format);
|
|
|
|
format->map_key (format, "name");
|
|
|
|
format->string (format, name);
|
|
|
|
format->map_key (format, "address");
|
|
|
|
format->string (format, addr);
|
|
|
|
format->map_key (format, "name-addr");
|
|
|
|
format->string (format, name_addr);
|
2015-09-03 21:40:03 +02:00
|
|
|
if (ctx->output & OUTPUT_COUNT) {
|
2014-11-05 01:25:58 +01:00
|
|
|
format->map_key (format, "count");
|
|
|
|
format->integer (format, count);
|
|
|
|
}
|
2014-10-31 22:53:58 +01:00
|
|
|
format->end (format);
|
|
|
|
format->separator (format);
|
|
|
|
}
|
|
|
|
|
|
|
|
g_object_unref (ia);
|
|
|
|
g_free (name_addr);
|
|
|
|
}
|
|
|
|
|
2014-11-05 01:25:58 +01:00
|
|
|
/* Print or prepare for printing addresses from InternetAddressList. */
|
2014-10-31 22:53:58 +01:00
|
|
|
static void
|
2014-11-05 01:25:57 +01:00
|
|
|
process_address_list (const search_context_t *ctx,
|
|
|
|
InternetAddressList *list)
|
2014-10-31 22:53:58 +01:00
|
|
|
{
|
|
|
|
InternetAddress *address;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < internet_address_list_length (list); i++) {
|
|
|
|
address = internet_address_list_get_address (list, i);
|
|
|
|
if (INTERNET_ADDRESS_IS_GROUP (address)) {
|
|
|
|
InternetAddressGroup *group;
|
|
|
|
InternetAddressList *group_list;
|
|
|
|
|
|
|
|
group = INTERNET_ADDRESS_GROUP (address);
|
|
|
|
group_list = internet_address_group_get_members (group);
|
|
|
|
if (group_list == NULL)
|
|
|
|
continue;
|
|
|
|
|
2014-11-05 01:25:50 +01:00
|
|
|
process_address_list (ctx, group_list);
|
2014-10-31 22:53:58 +01:00
|
|
|
} else {
|
|
|
|
InternetAddressMailbox *mailbox = INTERNET_ADDRESS_MAILBOX (address);
|
|
|
|
mailbox_t mbx = {
|
|
|
|
.name = internet_address_get_name (address),
|
|
|
|
.addr = internet_address_mailbox_get_addr (mailbox),
|
|
|
|
};
|
|
|
|
|
2015-09-03 21:39:59 +02:00
|
|
|
/* OUTPUT_COUNT only works with deduplication */
|
|
|
|
if (ctx->dedup != DEDUP_NONE &&
|
|
|
|
is_duplicate (ctx, mbx.name, mbx.addr))
|
2014-11-05 01:25:57 +01:00
|
|
|
continue;
|
|
|
|
|
2015-09-03 21:40:03 +02:00
|
|
|
/* OUTPUT_COUNT and DEDUP_ADDRESS require a full pass. */
|
|
|
|
if (ctx->output & OUTPUT_COUNT || ctx->dedup == DEDUP_ADDRESS)
|
2014-11-05 01:25:58 +01:00
|
|
|
continue;
|
|
|
|
|
2014-11-05 01:25:50 +01:00
|
|
|
print_mailbox (ctx, &mbx);
|
2014-10-31 22:53:58 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-11-05 01:25:58 +01:00
|
|
|
/* Print or prepare for printing addresses from a message header. */
|
2014-10-31 22:53:58 +01:00
|
|
|
static void
|
2014-11-05 01:25:50 +01:00
|
|
|
process_address_header (const search_context_t *ctx, const char *value)
|
2014-10-31 22:53:58 +01:00
|
|
|
{
|
|
|
|
InternetAddressList *list;
|
|
|
|
|
|
|
|
if (value == NULL)
|
|
|
|
return;
|
|
|
|
|
2019-05-02 15:19:45 +02:00
|
|
|
list = internet_address_list_parse (NULL, value);
|
2014-10-31 22:53:58 +01:00
|
|
|
if (list == NULL)
|
|
|
|
return;
|
|
|
|
|
2014-11-05 01:25:50 +01:00
|
|
|
process_address_list (ctx, list);
|
2014-10-31 22:53:58 +01:00
|
|
|
|
|
|
|
g_object_unref (list);
|
|
|
|
}
|
|
|
|
|
2014-11-05 01:25:57 +01:00
|
|
|
/* Destructor for talloc-allocated GHashTable keys and values. */
|
|
|
|
static void
|
|
|
|
_talloc_free_for_g_hash (void *ptr)
|
|
|
|
{
|
|
|
|
talloc_free (ptr);
|
|
|
|
}
|
|
|
|
|
2014-11-05 01:25:58 +01:00
|
|
|
static void
|
2015-09-25 18:48:20 +02:00
|
|
|
_list_free_for_g_hash (void *ptr)
|
2014-11-05 01:25:58 +01:00
|
|
|
{
|
2015-09-25 18:48:20 +02:00
|
|
|
g_list_free_full (ptr, _talloc_free_for_g_hash);
|
|
|
|
}
|
2014-11-05 01:25:58 +01:00
|
|
|
|
2015-09-03 21:40:03 +02:00
|
|
|
/* Print the most common variant of a list of unique mailboxes, and
|
|
|
|
* conflate the counts. */
|
|
|
|
static void
|
|
|
|
print_popular (const search_context_t *ctx, GList *list)
|
|
|
|
{
|
|
|
|
GList *l;
|
|
|
|
mailbox_t *mailbox = NULL, *m;
|
|
|
|
int max = 0;
|
|
|
|
int total = 0;
|
|
|
|
|
|
|
|
for (l = list; l; l = l->next) {
|
|
|
|
m = l->data;
|
|
|
|
total += m->count;
|
|
|
|
if (m->count > max) {
|
|
|
|
mailbox = m;
|
|
|
|
max = m->count;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (! mailbox)
|
2019-06-13 12:31:01 +02:00
|
|
|
INTERNAL_ERROR ("Empty list in address hash table\n");
|
2015-09-03 21:40:03 +02:00
|
|
|
|
|
|
|
/* The original count is no longer needed, so overwrite. */
|
|
|
|
mailbox->count = total;
|
|
|
|
|
|
|
|
print_mailbox (ctx, mailbox);
|
|
|
|
}
|
|
|
|
|
2015-09-25 18:48:20 +02:00
|
|
|
static void
|
|
|
|
print_list_value (void *mailbox, void *context)
|
|
|
|
{
|
|
|
|
print_mailbox (context, mailbox);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
print_hash_value (unused (void *key), void *list, void *context)
|
|
|
|
{
|
2015-09-03 21:40:03 +02:00
|
|
|
const search_context_t *ctx = context;
|
|
|
|
|
|
|
|
if (ctx->dedup == DEDUP_ADDRESS)
|
|
|
|
print_popular (ctx, list);
|
|
|
|
else
|
|
|
|
g_list_foreach (list, print_list_value, context);
|
2014-11-05 01:25:58 +01:00
|
|
|
}
|
|
|
|
|
2014-11-01 10:31:06 +01:00
|
|
|
static int
|
|
|
|
_count_filenames (notmuch_message_t *message)
|
|
|
|
{
|
|
|
|
notmuch_filenames_t *filenames;
|
|
|
|
int i = 0;
|
|
|
|
|
|
|
|
filenames = notmuch_message_get_filenames (message);
|
|
|
|
|
|
|
|
while (notmuch_filenames_valid (filenames)) {
|
2019-06-13 12:31:01 +02:00
|
|
|
notmuch_filenames_move_to_next (filenames);
|
|
|
|
i++;
|
2014-11-01 10:31:06 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
notmuch_filenames_destroy (filenames);
|
|
|
|
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
2010-10-28 20:19:53 +02:00
|
|
|
static int
|
2014-11-05 01:25:50 +01:00
|
|
|
do_search_messages (search_context_t *ctx)
|
2010-10-28 20:19:53 +02:00
|
|
|
{
|
|
|
|
notmuch_message_t *message;
|
|
|
|
notmuch_messages_t *messages;
|
2011-06-25 01:26:55 +02:00
|
|
|
notmuch_filenames_t *filenames;
|
2014-11-05 01:25:50 +01:00
|
|
|
sprinter_t *format = ctx->format;
|
2011-11-15 21:08:49 +01:00
|
|
|
int i;
|
2015-09-06 15:15:47 +02:00
|
|
|
notmuch_status_t status;
|
2011-11-15 21:08:49 +01:00
|
|
|
|
2014-11-05 01:25:50 +01:00
|
|
|
if (ctx->offset < 0) {
|
2015-09-27 17:31:58 +02:00
|
|
|
unsigned count;
|
|
|
|
notmuch_status_t status;
|
2017-02-26 22:21:34 +01:00
|
|
|
status = notmuch_query_count_messages (ctx->query, &count);
|
2015-09-27 17:31:58 +02:00
|
|
|
if (print_status_query ("notmuch search", ctx->query, status))
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
ctx->offset += count;
|
2014-11-05 01:25:50 +01:00
|
|
|
if (ctx->offset < 0)
|
|
|
|
ctx->offset = 0;
|
2011-11-15 21:08:49 +01:00
|
|
|
}
|
2010-10-28 20:19:53 +02:00
|
|
|
|
2017-02-26 22:21:32 +01:00
|
|
|
status = notmuch_query_search_messages (ctx->query, &messages);
|
2015-09-06 15:15:47 +02:00
|
|
|
if (print_status_query ("notmuch search", ctx->query, status))
|
2010-10-28 20:19:53 +02:00
|
|
|
return 1;
|
|
|
|
|
2012-07-23 12:39:46 +02:00
|
|
|
format->begin_list (format);
|
2011-01-30 20:26:04 +01:00
|
|
|
|
2011-11-15 21:08:49 +01:00
|
|
|
for (i = 0;
|
2014-11-05 01:25:50 +01:00
|
|
|
notmuch_messages_valid (messages) && (ctx->limit < 0 || i < ctx->offset + ctx->limit);
|
2019-06-13 12:31:01 +02:00
|
|
|
notmuch_messages_move_to_next (messages), i++) {
|
2014-11-05 01:25:50 +01:00
|
|
|
if (i < ctx->offset)
|
2011-11-15 21:08:49 +01:00
|
|
|
continue;
|
|
|
|
|
2010-10-28 20:19:53 +02:00
|
|
|
message = notmuch_messages_get (messages);
|
|
|
|
|
2014-11-05 01:25:50 +01:00
|
|
|
if (ctx->output == OUTPUT_FILES) {
|
2013-08-17 14:11:26 +02:00
|
|
|
int j;
|
2011-06-25 01:26:55 +02:00
|
|
|
filenames = notmuch_message_get_filenames (message);
|
|
|
|
|
2013-08-17 14:11:26 +02:00
|
|
|
for (j = 1;
|
2011-06-25 01:26:55 +02:00
|
|
|
notmuch_filenames_valid (filenames);
|
2019-06-13 12:31:01 +02:00
|
|
|
notmuch_filenames_move_to_next (filenames), j++) {
|
2014-11-05 01:25:50 +01:00
|
|
|
if (ctx->dupe < 0 || ctx->dupe == j) {
|
2013-08-17 14:11:26 +02:00
|
|
|
format->string (format, notmuch_filenames_get (filenames));
|
|
|
|
format->separator (format);
|
|
|
|
}
|
2011-06-25 01:26:55 +02:00
|
|
|
}
|
2019-06-13 12:31:01 +02:00
|
|
|
|
|
|
|
notmuch_filenames_destroy ( filenames );
|
2011-06-25 01:26:55 +02:00
|
|
|
|
2014-11-05 01:25:50 +01:00
|
|
|
} else if (ctx->output == OUTPUT_MESSAGES) {
|
2019-06-13 12:31:01 +02:00
|
|
|
/* special case 1 for speed */
|
|
|
|
if (ctx->dupe <= 1 || ctx->dupe <= _count_filenames (message)) {
|
|
|
|
format->set_prefix (format, "id");
|
|
|
|
format->string (format,
|
|
|
|
notmuch_message_get_message_id (message));
|
|
|
|
format->separator (format);
|
|
|
|
}
|
2014-10-31 22:53:58 +01:00
|
|
|
} else {
|
2014-11-05 01:25:50 +01:00
|
|
|
if (ctx->output & OUTPUT_SENDER) {
|
2014-10-31 22:53:58 +01:00
|
|
|
const char *addrs;
|
|
|
|
|
|
|
|
addrs = notmuch_message_get_header (message, "from");
|
2014-11-05 01:25:50 +01:00
|
|
|
process_address_header (ctx, addrs);
|
2014-10-31 22:53:58 +01:00
|
|
|
}
|
|
|
|
|
2014-11-05 01:25:50 +01:00
|
|
|
if (ctx->output & OUTPUT_RECIPIENTS) {
|
2014-10-31 22:53:58 +01:00
|
|
|
const char *hdrs[] = { "to", "cc", "bcc" };
|
|
|
|
const char *addrs;
|
|
|
|
size_t j;
|
|
|
|
|
|
|
|
for (j = 0; j < ARRAY_SIZE (hdrs); j++) {
|
|
|
|
addrs = notmuch_message_get_header (message, hdrs[j]);
|
2014-11-05 01:25:50 +01:00
|
|
|
process_address_header (ctx, addrs);
|
2014-10-31 22:53:58 +01:00
|
|
|
}
|
|
|
|
}
|
2010-10-28 20:33:55 +02:00
|
|
|
}
|
2010-10-28 20:19:53 +02:00
|
|
|
|
|
|
|
notmuch_message_destroy (message);
|
|
|
|
}
|
|
|
|
|
2015-09-03 21:40:03 +02:00
|
|
|
if (ctx->addresses &&
|
|
|
|
(ctx->output & OUTPUT_COUNT || ctx->dedup == DEDUP_ADDRESS))
|
2014-11-05 01:25:58 +01:00
|
|
|
g_hash_table_foreach (ctx->addresses, print_hash_value, ctx);
|
|
|
|
|
2010-10-28 20:19:53 +02:00
|
|
|
notmuch_messages_destroy (messages);
|
|
|
|
|
2012-07-23 12:39:46 +02:00
|
|
|
format->end (format);
|
2010-11-01 17:15:40 +01:00
|
|
|
|
2010-10-28 20:19:53 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2014-11-05 01:25:51 +01:00
|
|
|
do_search_tags (const search_context_t *ctx)
|
2010-10-28 20:19:53 +02:00
|
|
|
{
|
|
|
|
notmuch_messages_t *messages = NULL;
|
|
|
|
notmuch_tags_t *tags;
|
|
|
|
const char *tag;
|
2014-11-05 01:25:50 +01:00
|
|
|
sprinter_t *format = ctx->format;
|
|
|
|
notmuch_query_t *query = ctx->query;
|
2014-11-05 01:25:51 +01:00
|
|
|
notmuch_database_t *notmuch = ctx->notmuch;
|
2010-10-28 20:19:53 +02:00
|
|
|
|
2012-03-01 23:30:43 +01:00
|
|
|
/* should the following only special case if no excluded terms
|
|
|
|
* specified? */
|
|
|
|
|
2010-10-28 20:19:53 +02:00
|
|
|
/* Special-case query of "*" for better performance. */
|
|
|
|
if (strcmp (notmuch_query_get_query_string (query), "*") == 0) {
|
|
|
|
tags = notmuch_database_get_all_tags (notmuch);
|
|
|
|
} else {
|
2015-09-06 15:15:47 +02:00
|
|
|
notmuch_status_t status;
|
2017-02-26 22:21:32 +01:00
|
|
|
status = notmuch_query_search_messages (query, &messages);
|
2015-09-06 15:15:47 +02:00
|
|
|
if (print_status_query ("notmuch search", query, status))
|
2010-10-28 20:19:53 +02:00
|
|
|
return 1;
|
|
|
|
|
|
|
|
tags = notmuch_messages_collect_tags (messages);
|
|
|
|
}
|
|
|
|
if (tags == NULL)
|
|
|
|
return 1;
|
|
|
|
|
2012-07-23 12:39:46 +02:00
|
|
|
format->begin_list (format);
|
2011-01-30 20:26:04 +01:00
|
|
|
|
2010-10-28 20:19:53 +02:00
|
|
|
for (;
|
|
|
|
notmuch_tags_valid (tags);
|
2019-06-13 12:31:01 +02:00
|
|
|
notmuch_tags_move_to_next (tags)) {
|
2010-10-28 20:19:53 +02:00
|
|
|
tag = notmuch_tags_get (tags);
|
|
|
|
|
2012-07-23 12:39:46 +02:00
|
|
|
format->string (format, tag);
|
|
|
|
format->separator (format);
|
2010-10-28 20:19:53 +02:00
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
notmuch_tags_destroy (tags);
|
|
|
|
|
|
|
|
if (messages)
|
|
|
|
notmuch_messages_destroy (messages);
|
2010-10-23 02:57:02 +02:00
|
|
|
|
2012-07-23 12:39:46 +02:00
|
|
|
format->end (format);
|
2010-11-24 02:58:00 +01:00
|
|
|
|
2010-10-23 02:57:02 +02:00
|
|
|
return 0;
|
2009-11-18 04:11:05 +01:00
|
|
|
}
|
|
|
|
|
2014-11-05 01:25:53 +01:00
|
|
|
static int
|
2020-08-08 16:16:52 +02:00
|
|
|
_notmuch_search_prepare (search_context_t *ctx, int argc, char *argv[])
|
2009-11-10 21:03:05 +01:00
|
|
|
{
|
|
|
|
char *query_str;
|
2020-08-08 16:16:52 +02:00
|
|
|
|
|
|
|
if (! ctx->talloc_ctx)
|
|
|
|
ctx->talloc_ctx = talloc_new (NULL);
|
2009-11-13 05:47:12 +01:00
|
|
|
|
2014-11-05 01:25:52 +01:00
|
|
|
switch (ctx->format_sel) {
|
2011-12-04 16:26:22 +01:00
|
|
|
case NOTMUCH_FORMAT_TEXT:
|
2020-08-08 16:16:52 +02:00
|
|
|
ctx->format = sprinter_text_create (ctx->talloc_ctx, stdout);
|
2011-12-04 16:26:22 +01:00
|
|
|
break;
|
2012-12-16 23:05:11 +01:00
|
|
|
case NOTMUCH_FORMAT_TEXT0:
|
2014-11-05 01:25:52 +01:00
|
|
|
if (ctx->output == OUTPUT_SUMMARY) {
|
2012-12-16 23:05:11 +01:00
|
|
|
fprintf (stderr, "Error: --format=text0 is not compatible with --output=summary.\n");
|
2014-01-10 22:28:53 +01:00
|
|
|
return EXIT_FAILURE;
|
2012-12-16 23:05:11 +01:00
|
|
|
}
|
2020-08-08 16:16:52 +02:00
|
|
|
ctx->format = sprinter_text0_create (ctx->talloc_ctx, stdout);
|
2012-12-16 23:05:11 +01:00
|
|
|
break;
|
2011-12-04 16:26:22 +01:00
|
|
|
case NOTMUCH_FORMAT_JSON:
|
2020-08-08 16:16:52 +02:00
|
|
|
ctx->format = sprinter_json_create (ctx->talloc_ctx, stdout);
|
2011-12-04 16:26:22 +01:00
|
|
|
break;
|
2012-12-06 22:12:13 +01:00
|
|
|
case NOTMUCH_FORMAT_SEXP:
|
2020-08-08 16:16:52 +02:00
|
|
|
ctx->format = sprinter_sexp_create (ctx->talloc_ctx, stdout);
|
2012-12-06 22:12:13 +01:00
|
|
|
break;
|
2012-07-23 12:39:46 +02:00
|
|
|
default:
|
|
|
|
/* this should never happen */
|
2019-06-13 12:31:01 +02:00
|
|
|
INTERNAL_ERROR ("no output format selected");
|
2011-12-04 16:26:22 +01:00
|
|
|
}
|
2009-11-10 21:03:05 +01:00
|
|
|
|
2012-12-16 04:17:24 +01:00
|
|
|
notmuch_exit_if_unsupported_format ();
|
|
|
|
|
2015-04-06 00:39:55 +02:00
|
|
|
notmuch_exit_if_unmatched_db_uuid (ctx->notmuch);
|
|
|
|
|
2014-11-05 01:25:53 +01:00
|
|
|
query_str = query_string_from_args (ctx->notmuch, argc, argv);
|
2009-11-12 05:29:30 +01:00
|
|
|
if (query_str == NULL) {
|
2009-11-18 00:23:42 +01:00
|
|
|
fprintf (stderr, "Out of memory.\n");
|
2014-01-10 22:28:53 +01:00
|
|
|
return EXIT_FAILURE;
|
2009-11-12 05:29:30 +01:00
|
|
|
}
|
2009-11-18 12:29:30 +01:00
|
|
|
if (*query_str == '\0') {
|
|
|
|
fprintf (stderr, "Error: notmuch search requires at least one search term.\n");
|
2014-01-10 22:28:53 +01:00
|
|
|
return EXIT_FAILURE;
|
2009-11-18 12:29:30 +01:00
|
|
|
}
|
2009-11-10 21:03:05 +01:00
|
|
|
|
2014-11-05 01:25:52 +01:00
|
|
|
ctx->query = notmuch_query_create (ctx->notmuch, query_str);
|
|
|
|
if (ctx->query == NULL) {
|
2009-11-10 21:03:05 +01:00
|
|
|
fprintf (stderr, "Out of memory\n");
|
2014-01-10 22:28:53 +01:00
|
|
|
return EXIT_FAILURE;
|
2009-11-10 21:03:05 +01:00
|
|
|
}
|
|
|
|
|
2014-11-05 01:25:52 +01:00
|
|
|
notmuch_query_set_sort (ctx->query, ctx->sort);
|
2009-11-13 07:35:16 +01:00
|
|
|
|
2014-11-05 01:25:52 +01:00
|
|
|
if (ctx->exclude == NOTMUCH_EXCLUDE_FLAG && ctx->output != OUTPUT_SUMMARY) {
|
2012-04-07 18:10:05 +02:00
|
|
|
/* If we are not doing summary output there is nowhere to
|
|
|
|
* print the excluded flag so fall back on including the
|
|
|
|
* excluded messages. */
|
|
|
|
fprintf (stderr, "Warning: this output format cannot flag excluded messages.\n");
|
2014-11-05 01:25:52 +01:00
|
|
|
ctx->exclude = NOTMUCH_EXCLUDE_FALSE;
|
2012-04-07 18:10:05 +02:00
|
|
|
}
|
|
|
|
|
2014-11-05 01:25:52 +01:00
|
|
|
if (ctx->exclude != NOTMUCH_EXCLUDE_FALSE) {
|
2020-08-08 16:16:52 +02:00
|
|
|
notmuch_config_values_t *exclude_tags;
|
2017-02-18 16:08:04 +01:00
|
|
|
notmuch_status_t status;
|
2012-03-01 23:30:33 +01:00
|
|
|
|
2020-08-08 16:16:52 +02:00
|
|
|
for (exclude_tags = notmuch_config_get_values (ctx->notmuch, NOTMUCH_CONFIG_EXCLUDE_TAGS);
|
|
|
|
notmuch_config_values_valid (exclude_tags);
|
|
|
|
notmuch_config_values_move_to_next (exclude_tags)) {
|
2017-02-18 16:08:04 +01:00
|
|
|
|
2020-08-08 16:16:52 +02:00
|
|
|
status = notmuch_query_add_tag_exclude (ctx->query,
|
|
|
|
notmuch_config_values_get (exclude_tags));
|
2017-02-18 16:08:04 +01:00
|
|
|
if (status && status != NOTMUCH_STATUS_IGNORED) {
|
|
|
|
print_status_query ("notmuch search", ctx->query, status);
|
|
|
|
return EXIT_FAILURE;
|
|
|
|
}
|
|
|
|
}
|
2014-11-05 01:25:52 +01:00
|
|
|
notmuch_query_set_omit_excluded (ctx->query, ctx->exclude);
|
2012-03-01 23:30:33 +01:00
|
|
|
}
|
2012-01-15 01:17:34 +01:00
|
|
|
|
2014-11-05 01:25:53 +01:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
_notmuch_search_cleanup (search_context_t *ctx)
|
|
|
|
{
|
|
|
|
notmuch_query_destroy (ctx->query);
|
|
|
|
notmuch_database_destroy (ctx->notmuch);
|
|
|
|
|
|
|
|
talloc_free (ctx->format);
|
|
|
|
}
|
|
|
|
|
2014-11-05 01:25:55 +01:00
|
|
|
static search_context_t search_context = {
|
|
|
|
.format_sel = NOTMUCH_FORMAT_TEXT,
|
|
|
|
.exclude = NOTMUCH_EXCLUDE_TRUE,
|
|
|
|
.sort = NOTMUCH_SORT_NEWEST_FIRST,
|
|
|
|
.output = 0,
|
|
|
|
.offset = 0,
|
|
|
|
.limit = -1, /* unlimited */
|
|
|
|
.dupe = -1,
|
2015-09-03 21:39:59 +02:00
|
|
|
.dedup = DEDUP_MAILBOX,
|
2014-11-05 01:25:55 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
static const notmuch_opt_desc_t common_options[] = {
|
cli: use designated initializers for opt desc
Several changes at once, just to not have to change the same lines
several times over:
- Use designated initializers to initialize opt desc arrays.
- Only initialize the needed fields.
- Remove arg_id (short options) as unused.
- Replace opt_type and output_var with several type safe output
variables, where the output variable being non-NULL determines the
type. Introduce checks to ensure only one is set. The downside is
some waste of const space per argument; this could be saved by
retaining opt_type and using a union, but that's still pretty
verbose.
- Fix some variables due to the type safety. Mostly a good thing, but
leads to some enums being changed to ints. This is pedantically
correct, but somewhat annoying. We could also cast, but that defeats
the purpose a bit.
- Terminate the opt desc arrays using {}.
The output variable type safety and the ability to add new fields for
just some output types or arguments are the big wins. For example, if
we wanted to add a variable to set when the argument is present, we
could do so for just the arguments that need it.
Beauty is in the eye of the beholder, but I think this looks nice when
defining the arguments, and reduces some of the verbosity we have
there.
2017-10-01 22:53:11 +02:00
|
|
|
{ .opt_keyword = &search_context.sort, .name = "sort", .keywords =
|
2019-06-13 12:31:01 +02:00
|
|
|
(notmuch_keyword_t []){ { "oldest-first", NOTMUCH_SORT_OLDEST_FIRST },
|
|
|
|
{ "newest-first", NOTMUCH_SORT_NEWEST_FIRST },
|
|
|
|
{ 0, 0 } } },
|
cli: use designated initializers for opt desc
Several changes at once, just to not have to change the same lines
several times over:
- Use designated initializers to initialize opt desc arrays.
- Only initialize the needed fields.
- Remove arg_id (short options) as unused.
- Replace opt_type and output_var with several type safe output
variables, where the output variable being non-NULL determines the
type. Introduce checks to ensure only one is set. The downside is
some waste of const space per argument; this could be saved by
retaining opt_type and using a union, but that's still pretty
verbose.
- Fix some variables due to the type safety. Mostly a good thing, but
leads to some enums being changed to ints. This is pedantically
correct, but somewhat annoying. We could also cast, but that defeats
the purpose a bit.
- Terminate the opt desc arrays using {}.
The output variable type safety and the ability to add new fields for
just some output types or arguments are the big wins. For example, if
we wanted to add a variable to set when the argument is present, we
could do so for just the arguments that need it.
Beauty is in the eye of the beholder, but I think this looks nice when
defining the arguments, and reduces some of the verbosity we have
there.
2017-10-01 22:53:11 +02:00
|
|
|
{ .opt_keyword = &search_context.format_sel, .name = "format", .keywords =
|
2019-06-13 12:31:01 +02:00
|
|
|
(notmuch_keyword_t []){ { "json", NOTMUCH_FORMAT_JSON },
|
|
|
|
{ "sexp", NOTMUCH_FORMAT_SEXP },
|
|
|
|
{ "text", NOTMUCH_FORMAT_TEXT },
|
|
|
|
{ "text0", NOTMUCH_FORMAT_TEXT0 },
|
|
|
|
{ 0, 0 } } },
|
cli: use designated initializers for opt desc
Several changes at once, just to not have to change the same lines
several times over:
- Use designated initializers to initialize opt desc arrays.
- Only initialize the needed fields.
- Remove arg_id (short options) as unused.
- Replace opt_type and output_var with several type safe output
variables, where the output variable being non-NULL determines the
type. Introduce checks to ensure only one is set. The downside is
some waste of const space per argument; this could be saved by
retaining opt_type and using a union, but that's still pretty
verbose.
- Fix some variables due to the type safety. Mostly a good thing, but
leads to some enums being changed to ints. This is pedantically
correct, but somewhat annoying. We could also cast, but that defeats
the purpose a bit.
- Terminate the opt desc arrays using {}.
The output variable type safety and the ability to add new fields for
just some output types or arguments are the big wins. For example, if
we wanted to add a variable to set when the argument is present, we
could do so for just the arguments that need it.
Beauty is in the eye of the beholder, but I think this looks nice when
defining the arguments, and reduces some of the verbosity we have
there.
2017-10-01 22:53:11 +02:00
|
|
|
{ .opt_int = ¬much_format_version, .name = "format-version" },
|
|
|
|
{ }
|
2014-11-05 01:25:55 +01:00
|
|
|
};
|
|
|
|
|
2014-11-05 01:25:53 +01:00
|
|
|
int
|
2021-03-13 13:45:34 +01:00
|
|
|
notmuch_search_command (unused(notmuch_config_t *config), notmuch_database_t *notmuch,
|
|
|
|
int argc, char *argv[])
|
2014-11-05 01:25:53 +01:00
|
|
|
{
|
|
|
|
search_context_t *ctx = &search_context;
|
|
|
|
int opt_index, ret;
|
|
|
|
|
|
|
|
notmuch_opt_desc_t options[] = {
|
cli: use designated initializers for opt desc
Several changes at once, just to not have to change the same lines
several times over:
- Use designated initializers to initialize opt desc arrays.
- Only initialize the needed fields.
- Remove arg_id (short options) as unused.
- Replace opt_type and output_var with several type safe output
variables, where the output variable being non-NULL determines the
type. Introduce checks to ensure only one is set. The downside is
some waste of const space per argument; this could be saved by
retaining opt_type and using a union, but that's still pretty
verbose.
- Fix some variables due to the type safety. Mostly a good thing, but
leads to some enums being changed to ints. This is pedantically
correct, but somewhat annoying. We could also cast, but that defeats
the purpose a bit.
- Terminate the opt desc arrays using {}.
The output variable type safety and the ability to add new fields for
just some output types or arguments are the big wins. For example, if
we wanted to add a variable to set when the argument is present, we
could do so for just the arguments that need it.
Beauty is in the eye of the beholder, but I think this looks nice when
defining the arguments, and reduces some of the verbosity we have
there.
2017-10-01 22:53:11 +02:00
|
|
|
{ .opt_keyword = &ctx->output, .name = "output", .keywords =
|
2019-06-13 12:31:01 +02:00
|
|
|
(notmuch_keyword_t []){ { "summary", OUTPUT_SUMMARY },
|
|
|
|
{ "threads", OUTPUT_THREADS },
|
|
|
|
{ "messages", OUTPUT_MESSAGES },
|
|
|
|
{ "files", OUTPUT_FILES },
|
|
|
|
{ "tags", OUTPUT_TAGS },
|
|
|
|
{ 0, 0 } } },
|
|
|
|
{ .opt_keyword = &ctx->exclude, .name = "exclude", .keywords =
|
|
|
|
(notmuch_keyword_t []){ { "true", NOTMUCH_EXCLUDE_TRUE },
|
|
|
|
{ "false", NOTMUCH_EXCLUDE_FALSE },
|
|
|
|
{ "flag", NOTMUCH_EXCLUDE_FLAG },
|
|
|
|
{ "all", NOTMUCH_EXCLUDE_ALL },
|
|
|
|
{ 0, 0 } } },
|
cli: use designated initializers for opt desc
Several changes at once, just to not have to change the same lines
several times over:
- Use designated initializers to initialize opt desc arrays.
- Only initialize the needed fields.
- Remove arg_id (short options) as unused.
- Replace opt_type and output_var with several type safe output
variables, where the output variable being non-NULL determines the
type. Introduce checks to ensure only one is set. The downside is
some waste of const space per argument; this could be saved by
retaining opt_type and using a union, but that's still pretty
verbose.
- Fix some variables due to the type safety. Mostly a good thing, but
leads to some enums being changed to ints. This is pedantically
correct, but somewhat annoying. We could also cast, but that defeats
the purpose a bit.
- Terminate the opt desc arrays using {}.
The output variable type safety and the ability to add new fields for
just some output types or arguments are the big wins. For example, if
we wanted to add a variable to set when the argument is present, we
could do so for just the arguments that need it.
Beauty is in the eye of the beholder, but I think this looks nice when
defining the arguments, and reduces some of the verbosity we have
there.
2017-10-01 22:53:11 +02:00
|
|
|
{ .opt_int = &ctx->offset, .name = "offset" },
|
|
|
|
{ .opt_int = &ctx->limit, .name = "limit" },
|
|
|
|
{ .opt_int = &ctx->dupe, .name = "duplicate" },
|
|
|
|
{ .opt_inherit = common_options },
|
|
|
|
{ .opt_inherit = notmuch_shared_options },
|
|
|
|
{ }
|
2014-11-05 01:25:53 +01:00
|
|
|
};
|
|
|
|
|
2020-08-08 16:16:52 +02:00
|
|
|
ctx->notmuch = notmuch;
|
2014-11-05 01:25:56 +01:00
|
|
|
ctx->output = OUTPUT_SUMMARY;
|
2014-11-05 01:25:53 +01:00
|
|
|
opt_index = parse_arguments (argc, argv, options, 1);
|
|
|
|
if (opt_index < 0)
|
|
|
|
return EXIT_FAILURE;
|
|
|
|
|
2015-04-05 15:13:03 +02:00
|
|
|
notmuch_process_shared_options (argv[0]);
|
|
|
|
|
2014-11-05 01:25:53 +01:00
|
|
|
if (ctx->output != OUTPUT_FILES && ctx->output != OUTPUT_MESSAGES &&
|
|
|
|
ctx->dupe != -1) {
|
2021-03-13 13:45:34 +01:00
|
|
|
fprintf (stderr,
|
|
|
|
"Error: --duplicate=N is only supported with --output=files and --output=messages.\n");
|
2019-06-13 12:31:01 +02:00
|
|
|
return EXIT_FAILURE;
|
2014-11-05 01:25:53 +01:00
|
|
|
}
|
|
|
|
|
2020-08-08 16:16:52 +02:00
|
|
|
if (_notmuch_search_prepare (ctx, argc - opt_index, argv + opt_index))
|
2014-11-05 01:25:53 +01:00
|
|
|
return EXIT_FAILURE;
|
|
|
|
|
2014-11-05 01:25:56 +01:00
|
|
|
switch (ctx->output) {
|
|
|
|
case OUTPUT_SUMMARY:
|
|
|
|
case OUTPUT_THREADS:
|
2014-11-05 01:25:52 +01:00
|
|
|
ret = do_search_threads (ctx);
|
2014-11-05 01:25:56 +01:00
|
|
|
break;
|
|
|
|
case OUTPUT_MESSAGES:
|
|
|
|
case OUTPUT_FILES:
|
2014-11-05 01:25:52 +01:00
|
|
|
ret = do_search_messages (ctx);
|
2014-11-05 01:25:56 +01:00
|
|
|
break;
|
|
|
|
case OUTPUT_TAGS:
|
2014-11-05 01:25:52 +01:00
|
|
|
ret = do_search_tags (ctx);
|
2014-11-05 01:25:56 +01:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
INTERNAL_ERROR ("Unexpected output");
|
2010-10-28 20:19:53 +02:00
|
|
|
}
|
|
|
|
|
2014-11-05 01:25:53 +01:00
|
|
|
_notmuch_search_cleanup (ctx);
|
2012-07-23 12:39:46 +02:00
|
|
|
|
2014-01-10 22:28:53 +01:00
|
|
|
return ret ? EXIT_FAILURE : EXIT_SUCCESS;
|
2009-11-10 21:03:05 +01:00
|
|
|
}
|
2014-11-05 01:25:55 +01:00
|
|
|
|
|
|
|
int
|
2021-03-13 13:45:34 +01:00
|
|
|
notmuch_address_command (unused(notmuch_config_t *config), notmuch_database_t *notmuch,
|
|
|
|
int argc, char *argv[])
|
2014-11-05 01:25:55 +01:00
|
|
|
{
|
|
|
|
search_context_t *ctx = &search_context;
|
|
|
|
int opt_index, ret;
|
|
|
|
|
|
|
|
notmuch_opt_desc_t options[] = {
|
cli: use designated initializers for opt desc
Several changes at once, just to not have to change the same lines
several times over:
- Use designated initializers to initialize opt desc arrays.
- Only initialize the needed fields.
- Remove arg_id (short options) as unused.
- Replace opt_type and output_var with several type safe output
variables, where the output variable being non-NULL determines the
type. Introduce checks to ensure only one is set. The downside is
some waste of const space per argument; this could be saved by
retaining opt_type and using a union, but that's still pretty
verbose.
- Fix some variables due to the type safety. Mostly a good thing, but
leads to some enums being changed to ints. This is pedantically
correct, but somewhat annoying. We could also cast, but that defeats
the purpose a bit.
- Terminate the opt desc arrays using {}.
The output variable type safety and the ability to add new fields for
just some output types or arguments are the big wins. For example, if
we wanted to add a variable to set when the argument is present, we
could do so for just the arguments that need it.
Beauty is in the eye of the beholder, but I think this looks nice when
defining the arguments, and reduces some of the verbosity we have
there.
2017-10-01 22:53:11 +02:00
|
|
|
{ .opt_flags = &ctx->output, .name = "output", .keywords =
|
2019-06-13 12:31:01 +02:00
|
|
|
(notmuch_keyword_t []){ { "sender", OUTPUT_SENDER },
|
|
|
|
{ "recipients", OUTPUT_RECIPIENTS },
|
|
|
|
{ "count", OUTPUT_COUNT },
|
|
|
|
{ "address", OUTPUT_ADDRESS },
|
|
|
|
{ 0, 0 } } },
|
cli: use designated initializers for opt desc
Several changes at once, just to not have to change the same lines
several times over:
- Use designated initializers to initialize opt desc arrays.
- Only initialize the needed fields.
- Remove arg_id (short options) as unused.
- Replace opt_type and output_var with several type safe output
variables, where the output variable being non-NULL determines the
type. Introduce checks to ensure only one is set. The downside is
some waste of const space per argument; this could be saved by
retaining opt_type and using a union, but that's still pretty
verbose.
- Fix some variables due to the type safety. Mostly a good thing, but
leads to some enums being changed to ints. This is pedantically
correct, but somewhat annoying. We could also cast, but that defeats
the purpose a bit.
- Terminate the opt desc arrays using {}.
The output variable type safety and the ability to add new fields for
just some output types or arguments are the big wins. For example, if
we wanted to add a variable to set when the argument is present, we
could do so for just the arguments that need it.
Beauty is in the eye of the beholder, but I think this looks nice when
defining the arguments, and reduces some of the verbosity we have
there.
2017-10-01 22:53:11 +02:00
|
|
|
{ .opt_keyword = &ctx->exclude, .name = "exclude", .keywords =
|
2019-06-13 12:31:01 +02:00
|
|
|
(notmuch_keyword_t []){ { "true", NOTMUCH_EXCLUDE_TRUE },
|
|
|
|
{ "false", NOTMUCH_EXCLUDE_FALSE },
|
|
|
|
{ 0, 0 } } },
|
cli: use designated initializers for opt desc
Several changes at once, just to not have to change the same lines
several times over:
- Use designated initializers to initialize opt desc arrays.
- Only initialize the needed fields.
- Remove arg_id (short options) as unused.
- Replace opt_type and output_var with several type safe output
variables, where the output variable being non-NULL determines the
type. Introduce checks to ensure only one is set. The downside is
some waste of const space per argument; this could be saved by
retaining opt_type and using a union, but that's still pretty
verbose.
- Fix some variables due to the type safety. Mostly a good thing, but
leads to some enums being changed to ints. This is pedantically
correct, but somewhat annoying. We could also cast, but that defeats
the purpose a bit.
- Terminate the opt desc arrays using {}.
The output variable type safety and the ability to add new fields for
just some output types or arguments are the big wins. For example, if
we wanted to add a variable to set when the argument is present, we
could do so for just the arguments that need it.
Beauty is in the eye of the beholder, but I think this looks nice when
defining the arguments, and reduces some of the verbosity we have
there.
2017-10-01 22:53:11 +02:00
|
|
|
{ .opt_keyword = &ctx->dedup, .name = "deduplicate", .keywords =
|
2019-06-13 12:31:01 +02:00
|
|
|
(notmuch_keyword_t []){ { "no", DEDUP_NONE },
|
|
|
|
{ "mailbox", DEDUP_MAILBOX },
|
|
|
|
{ "address", DEDUP_ADDRESS },
|
|
|
|
{ 0, 0 } } },
|
cli: use designated initializers for opt desc
Several changes at once, just to not have to change the same lines
several times over:
- Use designated initializers to initialize opt desc arrays.
- Only initialize the needed fields.
- Remove arg_id (short options) as unused.
- Replace opt_type and output_var with several type safe output
variables, where the output variable being non-NULL determines the
type. Introduce checks to ensure only one is set. The downside is
some waste of const space per argument; this could be saved by
retaining opt_type and using a union, but that's still pretty
verbose.
- Fix some variables due to the type safety. Mostly a good thing, but
leads to some enums being changed to ints. This is pedantically
correct, but somewhat annoying. We could also cast, but that defeats
the purpose a bit.
- Terminate the opt desc arrays using {}.
The output variable type safety and the ability to add new fields for
just some output types or arguments are the big wins. For example, if
we wanted to add a variable to set when the argument is present, we
could do so for just the arguments that need it.
Beauty is in the eye of the beholder, but I think this looks nice when
defining the arguments, and reduces some of the verbosity we have
there.
2017-10-01 22:53:11 +02:00
|
|
|
{ .opt_inherit = common_options },
|
|
|
|
{ .opt_inherit = notmuch_shared_options },
|
|
|
|
{ }
|
2014-11-05 01:25:55 +01:00
|
|
|
};
|
|
|
|
|
2020-08-08 16:16:52 +02:00
|
|
|
ctx->notmuch = notmuch;
|
|
|
|
|
2014-11-05 01:25:55 +01:00
|
|
|
opt_index = parse_arguments (argc, argv, options, 1);
|
|
|
|
if (opt_index < 0)
|
|
|
|
return EXIT_FAILURE;
|
|
|
|
|
2015-04-05 15:13:03 +02:00
|
|
|
notmuch_process_shared_options (argv[0]);
|
|
|
|
|
2014-11-07 19:31:50 +01:00
|
|
|
if (! (ctx->output & (OUTPUT_SENDER | OUTPUT_RECIPIENTS)))
|
|
|
|
ctx->output |= OUTPUT_SENDER;
|
2014-11-05 01:25:55 +01:00
|
|
|
|
2015-09-03 21:39:59 +02:00
|
|
|
if (ctx->output & OUTPUT_COUNT && ctx->dedup == DEDUP_NONE) {
|
|
|
|
fprintf (stderr, "--output=count is not applicable with --deduplicate=no\n");
|
|
|
|
return EXIT_FAILURE;
|
|
|
|
}
|
|
|
|
|
2020-08-08 16:16:52 +02:00
|
|
|
if (_notmuch_search_prepare (ctx, argc - opt_index, argv + opt_index))
|
2014-11-05 01:25:55 +01:00
|
|
|
return EXIT_FAILURE;
|
|
|
|
|
2015-09-25 18:48:20 +02:00
|
|
|
ctx->addresses = g_hash_table_new_full (strcase_hash, strcase_equal,
|
|
|
|
_talloc_free_for_g_hash,
|
|
|
|
_list_free_for_g_hash);
|
2014-11-05 01:25:57 +01:00
|
|
|
|
2015-09-03 21:40:05 +02:00
|
|
|
/* The order is not guaranteed if a full pass is required, so go
|
|
|
|
* for fastest. */
|
|
|
|
if (ctx->output & OUTPUT_COUNT || ctx->dedup == DEDUP_ADDRESS)
|
|
|
|
notmuch_query_set_sort (ctx->query, NOTMUCH_SORT_UNSORTED);
|
|
|
|
|
2014-11-05 01:25:55 +01:00
|
|
|
ret = do_search_messages (ctx);
|
|
|
|
|
2014-11-05 01:25:57 +01:00
|
|
|
g_hash_table_unref (ctx->addresses);
|
|
|
|
|
|
|
|
|
2014-11-05 01:25:55 +01:00
|
|
|
_notmuch_search_cleanup (ctx);
|
|
|
|
|
|
|
|
return ret ? EXIT_FAILURE : EXIT_SUCCESS;
|
|
|
|
}
|