Mercurial > dovecot > original-hg > dovecot-1.2
view src/lib-storage/index/index-search.c @ 8481:9db582413fef HEAD
Moved search update result checks to search_next_update_seq().
author | Timo Sirainen <tss@iki.fi> |
---|---|
date | Sun, 23 Nov 2008 02:36:55 +0200 |
parents | bcdbf33ae9b8 |
children | 8a511d7da23f |
line wrap: on
line source
/* Copyright (c) 2002-2008 Dovecot authors, see the included COPYING file */ #include "lib.h" #include "ioloop.h" #include "array.h" #include "istream.h" #include "utc-offset.h" #include "str.h" #include "message-address.h" #include "message-date.h" #include "message-search.h" #include "message-parser.h" #include "mail-index-modseq.h" #include "index-storage.h" #include "index-mail.h" #include "index-sort.h" #include "mail-search.h" #include "mailbox-search-result-private.h" #include <stdlib.h> #include <ctype.h> #define TXT_UNKNOWN_CHARSET "[BADCHARSET] Unknown charset" #define TXT_INVALID_SEARCH_KEY "Invalid search key" #define SEARCH_NONBLOCK_COUNT 20 #define SEARCH_NOTIFY_INTERVAL_SECS 10 struct index_search_context { struct mail_search_context mail_ctx; struct mail_index_view *view; struct index_mailbox *ibox; uint32_t seq1, seq2; struct mail *mail; struct index_mail *imail; struct mail_thread_context *thread_ctx; const char *error; struct timeval search_start_time, last_notify; unsigned int failed:1; unsigned int sorted:1; unsigned int have_seqsets:1; unsigned int have_index_args:1; }; struct search_header_context { struct index_search_context *index_context; struct mail_search_arg *args; struct message_header_line *hdr; unsigned int parse_headers:1; unsigned int custom_header:1; unsigned int threading:1; }; struct search_body_context { struct index_search_context *index_ctx; struct istream *input; const struct message_part *part; }; static const enum message_header_parser_flags hdr_parser_flags = MESSAGE_HEADER_PARSER_FLAG_CLEAN_ONELINE; static void search_parse_msgset_args(const struct mail_index_header *hdr, struct mail_search_arg *args, uint32_t *seq1_r, uint32_t *seq2_r); static void search_init_arg(struct mail_search_arg *arg, struct index_search_context *ctx) { switch (arg->type) { case SEARCH_SEQSET: ctx->have_seqsets = TRUE; break; case SEARCH_UIDSET: case SEARCH_INTHREAD: case SEARCH_FLAGS: case SEARCH_KEYWORDS: case SEARCH_MODSEQ: if (arg->type == SEARCH_MODSEQ) mail_index_modseq_enable(ctx->ibox->index); ctx->have_index_args = TRUE; break; case SEARCH_ALL: if (!arg->not) arg->match_always = TRUE; break; default: break; } } static void search_seqset_arg(struct mail_search_arg *arg, struct index_search_context *ctx) { if (arg->type == SEARCH_SEQSET) { if (seq_range_exists(&arg->value.seqset, ctx->mail_ctx.seq)) ARG_SET_RESULT(arg, 1); else ARG_SET_RESULT(arg, 0); } } static int search_arg_match_keywords(struct index_search_context *ctx, struct mail_search_arg *arg) { ARRAY_TYPE(keyword_indexes) keyword_indexes_arr; const struct mail_keywords *search_kws = arg->value.keywords; const unsigned int *keyword_indexes; unsigned int i, j, count; t_array_init(&keyword_indexes_arr, 128); mail_index_lookup_keywords(ctx->view, ctx->mail_ctx.seq, &keyword_indexes_arr); keyword_indexes = array_get(&keyword_indexes_arr, &count); /* there probably aren't many keywords, so O(n*m) for now */ for (i = 0; i < search_kws->count; i++) { for (j = 0; j < count; j++) { if (search_kws->idx[i] == keyword_indexes[j]) break; } if (j == count) return 0; } return 1; } /* Returns >0 = matched, 0 = not matched, -1 = unknown */ static int search_arg_match_index(struct index_search_context *ctx, struct mail_search_arg *arg, const struct mail_index_record *rec) { enum mail_flags flags; uint64_t modseq; int ret; switch (arg->type) { case SEARCH_UIDSET: case SEARCH_INTHREAD: return seq_range_exists(&arg->value.seqset, rec->uid); case SEARCH_FLAGS: /* recent flag shouldn't be set, but indexes from v1.0.x may contain it. */ flags = rec->flags & ~MAIL_RECENT; if ((arg->value.flags & MAIL_RECENT) != 0 && index_mailbox_is_recent(ctx->ibox, rec->uid)) flags |= MAIL_RECENT; return (flags & arg->value.flags) == arg->value.flags; case SEARCH_KEYWORDS: T_BEGIN { ret = search_arg_match_keywords(ctx, arg); } T_END; return ret; case SEARCH_MODSEQ: { if (arg->value.flags != 0) { modseq = mail_index_modseq_lookup_flags(ctx->view, arg->value.flags, ctx->mail_ctx.seq); } else if (arg->value.keywords != NULL) { modseq = mail_index_modseq_lookup_keywords(ctx->view, arg->value.keywords, ctx->mail_ctx.seq); } else { modseq = mail_index_modseq_lookup(ctx->view, ctx->mail_ctx.seq); } return modseq >= arg->value.modseq->modseq; } default: return -1; } } static void search_index_arg(struct mail_search_arg *arg, struct index_search_context *ctx) { const struct mail_index_record *rec; rec = mail_index_lookup(ctx->view, ctx->mail_ctx.seq); switch (search_arg_match_index(ctx, arg, rec)) { case -1: /* unknown */ break; case 0: ARG_SET_RESULT(arg, 0); break; default: ARG_SET_RESULT(arg, 1); break; } } /* Returns >0 = matched, 0 = not matched, -1 = unknown */ static int search_arg_match_cached(struct index_search_context *ctx, struct mail_search_arg *arg) { const char *str; struct tm *tm; uoff_t virtual_size; time_t date; int timezone_offset; switch (arg->type) { /* internal dates */ case SEARCH_BEFORE: case SEARCH_ON: case SEARCH_SINCE: if (mail_get_received_date(ctx->mail, &date) < 0) return -1; if ((arg->value.search_flags & MAIL_SEARCH_ARG_FLAG_USE_TZ) == 0) { tm = localtime(&date); date += utc_offset(tm, date)*60; } switch (arg->type) { case SEARCH_BEFORE: return date < arg->value.time; case SEARCH_ON: return date >= arg->value.time && date < arg->value.time + 3600*24; case SEARCH_SINCE: return date >= arg->value.time; default: /* unreachable */ break; } /* sent dates */ case SEARCH_SENTBEFORE: case SEARCH_SENTON: case SEARCH_SENTSINCE: /* NOTE: RFC-3501 specifies that timezone is ignored in searches. date is returned as UTC, so change it. */ if (mail_get_date(ctx->mail, &date, &timezone_offset) < 0) return -1; if ((arg->value.search_flags & MAIL_SEARCH_ARG_FLAG_USE_TZ) == 0) date += timezone_offset * 60; switch (arg->type) { case SEARCH_SENTBEFORE: return date < arg->value.time; case SEARCH_SENTON: return date >= arg->value.time && date < arg->value.time + 3600*24; case SEARCH_SENTSINCE: return date >= arg->value.time; default: /* unreachable */ break; } /* sizes */ case SEARCH_SMALLER: case SEARCH_LARGER: if (mail_get_virtual_size(ctx->mail, &virtual_size) < 0) return -1; if (arg->type == SEARCH_SMALLER) return virtual_size < arg->value.size; else return virtual_size > arg->value.size; case SEARCH_GUID: if (mail_get_special(ctx->mail, MAIL_FETCH_GUID, &str) < 0) return -1; return strcmp(str, arg->value.str) == 0; case SEARCH_MAILBOX: if (mail_get_special(ctx->mail, MAIL_FETCH_MAILBOX_NAME, &str) < 0) return -1; if (strcasecmp(str, "INBOX") == 0) return strcasecmp(arg->value.str, "INBOX") == 0; return strcmp(str, arg->value.str) == 0; default: return -1; } } static void search_cached_arg(struct mail_search_arg *arg, struct index_search_context *ctx) { switch (search_arg_match_cached(ctx, arg)) { case -1: /* unknown */ break; case 0: ARG_SET_RESULT(arg, 0); break; default: ARG_SET_RESULT(arg, 1); break; } } static int search_sent(enum mail_search_arg_type type, time_t search_time, const unsigned char *sent_value, size_t sent_value_len) { time_t sent_time; int timezone_offset; if (sent_value == NULL) return 0; /* NOTE: RFC-3501 specifies that timezone is ignored in searches. sent_time is returned as UTC, so change it. */ if (!message_date_parse(sent_value, sent_value_len, &sent_time, &timezone_offset)) return 0; sent_time += timezone_offset * 60; switch (type) { case SEARCH_SENTBEFORE: return sent_time < search_time; case SEARCH_SENTON: return sent_time >= search_time && sent_time < search_time + 3600*24; case SEARCH_SENTSINCE: return sent_time >= search_time; default: i_unreached(); } } static struct message_search_context * msg_search_arg_context(struct index_search_context *ctx, struct mail_search_arg *arg) { struct message_search_context *arg_ctx = arg->context; enum message_search_flags flags; int ret; if (arg_ctx != NULL) return arg_ctx; flags = (arg->type == SEARCH_BODY || arg->type == SEARCH_BODY_FAST) ? MESSAGE_SEARCH_FLAG_SKIP_HEADERS : 0; ret = message_search_init(arg->value.str, ctx->mail_ctx.args->charset, flags, &arg_ctx); if (ret > 0) { arg->context = arg_ctx; return arg_ctx; } if (ret == 0) ctx->error = TXT_UNKNOWN_CHARSET; else ctx->error = TXT_INVALID_SEARCH_KEY; return NULL; } static void compress_lwsp(string_t *dest, const unsigned char *src, unsigned int src_len) { unsigned int i; bool prev_lwsp = TRUE; for (i = 0; i < src_len; i++) { if (IS_LWSP(src[i])) { if (!prev_lwsp) { prev_lwsp = TRUE; str_append_c(dest, ' '); } } else { prev_lwsp = FALSE; str_append_c(dest, src[i]); } } } static void search_header_arg(struct mail_search_arg *arg, struct search_header_context *ctx) { struct message_search_context *msg_search_ctx; struct message_block block; struct message_header_line hdr; int ret; /* first check that the field name matches to argument. */ switch (arg->type) { case SEARCH_SENTBEFORE: case SEARCH_SENTON: case SEARCH_SENTSINCE: /* date is handled differently than others */ if (strcasecmp(ctx->hdr->name, "Date") == 0) { if (ctx->hdr->continues) { ctx->hdr->use_full_value = TRUE; return; } ret = search_sent(arg->type, arg->value.time, ctx->hdr->full_value, ctx->hdr->full_value_len); ARG_SET_RESULT(arg, ret); } return; case SEARCH_HEADER: case SEARCH_HEADER_ADDRESS: case SEARCH_HEADER_COMPRESS_LWSP: ctx->custom_header = TRUE; if (strcasecmp(ctx->hdr->name, arg->hdr_field_name) != 0) return; break; default: return; } if (arg->value.str[0] == '\0') { /* we're just testing existence of the field. always matches. */ ARG_SET_RESULT(arg, 1); return; } if (ctx->hdr->continues) { ctx->hdr->use_full_value = TRUE; return; } memset(&block, 0, sizeof(block)); /* We're searching only for values, so drop header name and middle parts. We use header searching so that MIME words will be decoded. */ hdr = *ctx->hdr; hdr.name = ""; hdr.name_len = 0; hdr.middle_len = 0; block.hdr = &hdr; msg_search_ctx = msg_search_arg_context(ctx->index_context, arg); if (msg_search_ctx == NULL) return; T_BEGIN { struct message_address *addr; string_t *str; switch (arg->type) { case SEARCH_HEADER: /* simple match */ break; case SEARCH_HEADER_ADDRESS: /* we have to match against normalized address */ addr = message_address_parse(pool_datastack_create(), ctx->hdr->full_value, ctx->hdr->full_value_len, (unsigned int)-1, TRUE); str = t_str_new(ctx->hdr->value_len); message_address_write(str, addr); hdr.value = hdr.full_value = str_data(str); hdr.value_len = hdr.full_value_len = str_len(str); break; case SEARCH_HEADER_COMPRESS_LWSP: /* convert LWSP to single spaces */ str = t_str_new(hdr.full_value_len); compress_lwsp(str, hdr.full_value, hdr.full_value_len); hdr.value = hdr.full_value = str_data(str); hdr.value_len = hdr.full_value_len = str_len(str); break; default: i_unreached(); } ret = message_search_more(msg_search_ctx, &block) ? 1 : 0; } T_END; ARG_SET_RESULT(arg, ret); } static void search_header_unmatch(struct mail_search_arg *arg, void *context ATTR_UNUSED) { switch (arg->type) { case SEARCH_SENTBEFORE: case SEARCH_SENTON: case SEARCH_SENTSINCE: if (arg->not) { /* date header not found, so we match only for NOT searches */ ARG_SET_RESULT(arg, 0); } break; case SEARCH_HEADER: case SEARCH_HEADER_ADDRESS: case SEARCH_HEADER_COMPRESS_LWSP: ARG_SET_RESULT(arg, 0); break; default: break; } } static void search_header(struct message_header_line *hdr, struct search_header_context *ctx) { if (hdr == NULL) { /* end of headers, mark all unknown SEARCH_HEADERs unmatched */ mail_search_args_foreach(ctx->args, search_header_unmatch, ctx); return; } if (hdr->eoh) return; if (ctx->parse_headers) index_mail_parse_header(NULL, hdr, ctx->index_context->imail); if (ctx->custom_header || strcasecmp(hdr->name, "Date") == 0) { ctx->hdr = hdr; ctx->custom_header = FALSE; mail_search_args_foreach(ctx->args, search_header_arg, ctx); } } static void search_body(struct mail_search_arg *arg, struct search_body_context *ctx) { struct message_search_context *msg_search_ctx; int ret; if (ctx->index_ctx->error != NULL) return; switch (arg->type) { case SEARCH_BODY: case SEARCH_BODY_FAST: case SEARCH_TEXT: case SEARCH_TEXT_FAST: break; default: return; } msg_search_ctx = msg_search_arg_context(ctx->index_ctx, arg); if (msg_search_ctx == NULL) { ARG_SET_RESULT(arg, 0); return; } i_stream_seek(ctx->input, 0); ret = message_search_msg(msg_search_ctx, ctx->input, ctx->part); if (ret < 0 && ctx->input->stream_errno == 0) { /* try again without cached parts */ mail_set_cache_corrupted(ctx->index_ctx->mail, MAIL_FETCH_MESSAGE_PARTS); i_stream_seek(ctx->input, 0); ret = message_search_msg(msg_search_ctx, ctx->input, NULL); i_assert(ret >= 0 || ctx->input->stream_errno != 0); } ARG_SET_RESULT(arg, ret > 0); } static bool search_arg_match_text(struct mail_search_arg *args, struct index_search_context *ctx) { struct istream *input; struct mailbox_header_lookup_ctx *headers_ctx; const char *const *headers; bool have_headers, have_body; /* first check what we need to use */ headers = mail_search_args_analyze(args, &have_headers, &have_body); if (!have_headers && !have_body) return TRUE; if (have_headers) { struct search_header_context hdr_ctx; if (have_body) headers = NULL; if (headers == NULL) { headers_ctx = NULL; if (mail_get_stream(ctx->mail, NULL, NULL, &input) < 0) return FALSE; } else { /* FIXME: do this once in init */ i_assert(*headers != NULL); headers_ctx = mailbox_header_lookup_init(&ctx->ibox->box, headers); if (mail_get_header_stream(ctx->mail, headers_ctx, &input) < 0) { mailbox_header_lookup_unref(&headers_ctx); return FALSE; } } memset(&hdr_ctx, 0, sizeof(hdr_ctx)); hdr_ctx.index_context = ctx; hdr_ctx.custom_header = TRUE; hdr_ctx.args = args; hdr_ctx.parse_headers = headers == NULL && index_mail_want_parse_headers(ctx->imail); if (hdr_ctx.parse_headers) index_mail_parse_header_init(ctx->imail, headers_ctx); message_parse_header(input, NULL, hdr_parser_flags, search_header, &hdr_ctx); if (headers_ctx != NULL) mailbox_header_lookup_unref(&headers_ctx); } else { struct message_size hdr_size; if (mail_get_stream(ctx->mail, &hdr_size, NULL, &input) < 0) return FALSE; i_stream_seek(input, hdr_size.physical_size); } if (have_body) { struct search_body_context body_ctx; memset(&body_ctx, 0, sizeof(body_ctx)); body_ctx.index_ctx = ctx; body_ctx.input = input; (void)mail_get_parts(ctx->mail, &body_ctx.part); mail_search_args_foreach(args, search_body, &body_ctx); } return TRUE; } static bool search_msgset_fix_limits(const struct mail_index_header *hdr, ARRAY_TYPE(seq_range) *seqset, bool not) { struct seq_range *range; unsigned int count; i_assert(hdr->messages_count > 0); range = array_get_modifiable(seqset, &count); if (count > 0) { i_assert(range[0].seq1 != 0); if (range[count-1].seq2 == (uint32_t)-1) { /* "*" used, make sure the last message is in the range (e.g. with count+1:* we still want to include it) */ seq_range_array_add(seqset, 0, hdr->messages_count); } /* remove all non-existing messages */ seq_range_array_remove_range(seqset, hdr->messages_count + 1, (uint32_t)-1); } if (!not) return array_count(seqset) > 0; else { /* if all messages are in the range, it can't match */ range = array_get_modifiable(seqset, &count); return range[0].seq1 != 1 || range[count-1].seq2 != hdr->messages_count; } } static void search_msgset_fix(const struct mail_index_header *hdr, ARRAY_TYPE(seq_range) *seqset, uint32_t *seq1_r, uint32_t *seq2_r, bool not) { const struct seq_range *range; unsigned int count; uint32_t min_seq, max_seq; if (!search_msgset_fix_limits(hdr, seqset, not)) { *seq1_r = (uint32_t)-1; *seq2_r = 0; return; } range = array_get(seqset, &count); if (!not) { min_seq = range[0].seq1; max_seq = range[count-1].seq2; } else { min_seq = range[0].seq1 > 1 ? 1 : range[0].seq2 + 1; max_seq = range[count-1].seq2 < hdr->messages_count ? hdr->messages_count : range[count-1].seq1 - 1; if (min_seq > max_seq) { *seq1_r = (uint32_t)-1; *seq2_r = 0; return; } } if (*seq1_r < min_seq || *seq1_r == 0) *seq1_r = min_seq; if (*seq2_r > max_seq) *seq2_r = max_seq; } static void search_or_parse_msgset_args(const struct mail_index_header *hdr, struct mail_search_arg *args, uint32_t *seq1_r, uint32_t *seq2_r) { uint32_t seq1, seq2, min_seq1 = 0, max_seq2 = 0; for (; args != NULL; args = args->next) { seq1 = 1; seq2 = hdr->messages_count; switch (args->type) { case SEARCH_SUB: i_assert(!args->not); search_parse_msgset_args(hdr, args->value.subargs, &seq1, &seq2); break; case SEARCH_OR: i_assert(!args->not); search_or_parse_msgset_args(hdr, args->value.subargs, &seq1, &seq2); break; case SEARCH_SEQSET: search_msgset_fix(hdr, &args->value.seqset, &seq1, &seq2, args->not); break; default: break; } if (min_seq1 == 0) { min_seq1 = seq1; max_seq2 = seq2; } else { if (seq1 < min_seq1) min_seq1 = seq1; if (seq2 > max_seq2) max_seq2 = seq2; } } i_assert(min_seq1 != 0); if (min_seq1 > *seq1_r) *seq1_r = min_seq1; if (max_seq2 < *seq2_r) *seq2_r = max_seq2; } static void search_parse_msgset_args(const struct mail_index_header *hdr, struct mail_search_arg *args, uint32_t *seq1_r, uint32_t *seq2_r) { for (; args != NULL; args = args->next) { switch (args->type) { case SEARCH_SUB: i_assert(!args->not); search_parse_msgset_args(hdr, args->value.subargs, seq1_r, seq2_r); break; case SEARCH_OR: /* go through our children and use the widest seqset range */ i_assert(!args->not); search_or_parse_msgset_args(hdr, args->value.subargs, seq1_r, seq2_r); break; case SEARCH_SEQSET: search_msgset_fix(hdr, &args->value.seqset, seq1_r, seq2_r, args->not); break; default: break; } } } static void search_limit_lowwater(struct index_search_context *ctx, uint32_t uid_lowwater, uint32_t *first_seq) { uint32_t seq1, seq2; if (uid_lowwater == 0) return; mail_index_lookup_seq_range(ctx->view, uid_lowwater, (uint32_t)-1, &seq1, &seq2); if (*first_seq < seq1) *first_seq = seq1; } static bool search_limit_by_flags(struct index_search_context *ctx, const struct mail_index_header *hdr, struct mail_search_arg *args, uint32_t *seq1, uint32_t *seq2) { for (; args != NULL; args = args->next) { if (args->type != SEARCH_FLAGS) { if (args->type == SEARCH_ALL) { if (args->not) return FALSE; } continue; } if ((args->value.flags & MAIL_SEEN) != 0) { /* SEEN with 0 seen? */ if (!args->not && hdr->seen_messages_count == 0) return FALSE; if (hdr->seen_messages_count == hdr->messages_count) { /* UNSEEN with all seen? */ if (args->not) return FALSE; /* SEEN with all seen */ args->match_always = TRUE; } else if (args->not) { /* UNSEEN with lowwater limiting */ search_limit_lowwater(ctx, hdr->first_unseen_uid_lowwater, seq1); } } if ((args->value.flags & MAIL_DELETED) != 0) { /* DELETED with 0 deleted? */ if (!args->not && hdr->deleted_messages_count == 0) return FALSE; if (hdr->deleted_messages_count == hdr->messages_count) { /* UNDELETED with all deleted? */ if (args->not) return FALSE; /* DELETED with all deleted */ args->match_always = TRUE; } else if (!args->not) { /* DELETED with lowwater limiting */ search_limit_lowwater(ctx, hdr->first_deleted_uid_lowwater, seq1); } } } return *seq1 <= *seq2; } static void search_get_seqset(struct index_search_context *ctx, struct mail_search_arg *args) { const struct mail_index_header *hdr; hdr = mail_index_get_header(ctx->view); if (hdr->messages_count == 0) { /* no messages, don't check sequence ranges. although we could give error message then for FETCH, we shouldn't do it for UID FETCH. */ ctx->seq1 = 1; ctx->seq2 = 0; return; } ctx->seq1 = 1; ctx->seq2 = hdr->messages_count; search_parse_msgset_args(hdr, args, &ctx->seq1, &ctx->seq2); if (ctx->seq1 == 0) { ctx->seq1 = 1; ctx->seq2 = hdr->messages_count; } if (ctx->seq1 > ctx->seq2) { /* no matches */ return; } /* UNSEEN and DELETED in root search level may limit the range */ if (!search_limit_by_flags(ctx, hdr, args, &ctx->seq1, &ctx->seq2)) { /* no matches */ ctx->seq1 = 1; ctx->seq2 = 0; } } static int search_build_subthread(struct mail_thread_iterate_context *iter, ARRAY_TYPE(seq_range) *uids) { struct mail_thread_iterate_context *child_iter; const struct mail_thread_child_node *node; int ret = 0; while ((node = mail_thread_iterate_next(iter, &child_iter)) != NULL) { if (child_iter != NULL) { if (search_build_subthread(child_iter, uids) < 0) ret = -1; } seq_range_array_add(uids, 0, node->uid); } if (mail_thread_iterate_deinit(&iter) < 0) ret = -1; return ret; } static int search_build_inthread_result(struct index_search_context *ctx, struct mail_search_arg *arg) { struct mail_thread_iterate_context *iter, *child_iter; const struct mail_thread_child_node *node; const ARRAY_TYPE(seq_range) *search_uids; ARRAY_TYPE(seq_range) thread_uids; int ret = 0; p_array_init(&arg->value.seqset, ctx->mail_ctx.args->pool, 64); if (mailbox_search_result_build(ctx->mail_ctx.transaction, arg->value.search_args, MAILBOX_SEARCH_RESULT_FLAG_UPDATE | MAILBOX_SEARCH_RESULT_FLAG_QUEUE_SYNC, &arg->value.search_result) < 0) return -1; if (ctx->thread_ctx == NULL) { /* failed earlier */ return -1; } search_uids = mailbox_search_result_get(arg->value.search_result); if (array_count(search_uids) == 0) { /* search found nothing - no threads can match */ return 0; } t_array_init(&thread_uids, 128); iter = mail_thread_iterate_init(ctx->thread_ctx, arg->value.thread_type, FALSE); while ((node = mail_thread_iterate_next(iter, &child_iter)) != NULL) { seq_range_array_add(&thread_uids, 0, node->uid); if (child_iter != NULL) { if (search_build_subthread(child_iter, &thread_uids) < 0) ret = -1; } if (seq_range_array_have_common(&thread_uids, search_uids)) { /* yes, we want this thread */ seq_range_array_merge(&arg->value.seqset, &thread_uids); } array_clear(&thread_uids); } if (mail_thread_iterate_deinit(&iter) < 0) ret = -1; return ret; } static int search_build_inthreads(struct index_search_context *ctx, struct mail_search_arg *arg) { int ret = 0; for (; arg != NULL; arg = arg->next) { switch (arg->type) { case SEARCH_OR: case SEARCH_SUB: if (search_build_inthreads(ctx, arg->value.subargs) < 0) ret = -1; break; case SEARCH_INTHREAD: if (search_build_inthread_result(ctx, arg) < 0) ret = -1; break; default: break; } } return ret; } struct mail_search_context * index_storage_search_init(struct mailbox_transaction_context *_t, struct mail_search_args *args, const enum mail_sort_type *sort_program) { struct index_transaction_context *t = (struct index_transaction_context *)_t; struct index_search_context *ctx; ctx = i_new(struct index_search_context, 1); ctx->mail_ctx.transaction = _t; ctx->ibox = t->ibox; ctx->view = t->trans_view; ctx->mail_ctx.args = args; ctx->mail_ctx.sort_program = index_sort_program_init(_t, sort_program); i_array_init(&ctx->mail_ctx.results, 5); array_create(&ctx->mail_ctx.module_contexts, default_pool, sizeof(void *), 5); mail_search_args_reset(ctx->mail_ctx.args->args, TRUE); if (args->have_inthreads) { if (mail_thread_init(_t->box, NULL, &ctx->thread_ctx) < 0) ctx->failed = TRUE; if (search_build_inthreads(ctx, args->args) < 0) ctx->failed = TRUE; } search_get_seqset(ctx, args->args); (void)mail_search_args_foreach(args->args, search_init_arg, ctx); /* Need to reset results for match_always cases */ mail_search_args_reset(ctx->mail_ctx.args->args, FALSE); return &ctx->mail_ctx; } static void search_arg_deinit(struct mail_search_arg *arg, void *context ATTR_UNUSED) { struct message_search_context *search_ctx = arg->context; if (search_ctx != NULL) { message_search_deinit(&search_ctx); arg->context = NULL; } } int index_storage_search_deinit(struct mail_search_context *_ctx) { struct index_search_context *ctx = (struct index_search_context *)_ctx; int ret; ret = ctx->failed || ctx->error != NULL ? -1 : 0; if (ctx->error != NULL) { mail_storage_set_error(ctx->ibox->box.storage, MAIL_ERROR_PARAMS, ctx->error); } mail_search_args_reset(ctx->mail_ctx.args->args, FALSE); (void)mail_search_args_foreach(ctx->mail_ctx.args->args, search_arg_deinit, NULL); if (ctx->mail_ctx.sort_program != NULL) index_sort_program_deinit(&ctx->mail_ctx.sort_program); if (ctx->thread_ctx != NULL) mail_thread_deinit(&ctx->thread_ctx); array_free(&ctx->mail_ctx.results); array_free(&ctx->mail_ctx.module_contexts); i_free(ctx); return ret; } static bool search_match_next(struct index_search_context *ctx) { struct mail_search_arg *arg; int ret; /* next search only from cached arguments */ ret = mail_search_args_foreach(ctx->mail_ctx.args->args, search_cached_arg, ctx); if (ret >= 0) return ret > 0; /* open the mail file and check the rest */ if (!search_arg_match_text(ctx->mail_ctx.args->args, ctx)) return FALSE; for (arg = ctx->mail_ctx.args->args; arg != NULL; arg = arg->next) { if (arg->result != 1) return FALSE; } return TRUE; } static void index_storage_search_notify(struct mailbox *box, struct index_search_context *ctx) { const struct mail_index_header *hdr; float percentage; unsigned int msecs, secs; if (ctx->last_notify.tv_sec == 0) { /* set the search time in here, in case a plugin already spent some time indexing the mailbox */ ctx->search_start_time = ioloop_timeval; } else if (box->storage->callbacks->notify_ok != NULL) { hdr = mail_index_get_header(ctx->ibox->view); percentage = ctx->mail->seq * 100.0 / hdr->messages_count; msecs = (ioloop_timeval.tv_sec - ctx->search_start_time.tv_sec) * 1000 + (ioloop_timeval.tv_usec - ctx->search_start_time.tv_usec) / 1000; secs = (msecs / (percentage / 100.0) - msecs) / 1000; T_BEGIN { const char *text; text = t_strdup_printf("Searched %d%% of the mailbox, " "ETA %d:%02d", (int)percentage, secs/60, secs%60); box->storage->callbacks-> notify_ok(box, text, box->storage->callback_context); } T_END; } ctx->last_notify = ioloop_timeval; } static bool search_arg_is_static(struct mail_search_arg *arg) { struct mail_search_arg *subarg; switch (arg->type) { case SEARCH_OR: case SEARCH_SUB: /* they're static only if all subargs are static */ subarg = arg->value.subargs; for (; subarg != NULL; subarg = subarg->next) { if (!search_arg_is_static(subarg)) return FALSE; } return TRUE; case SEARCH_SEQSET: /* changes between syncs, but we can't really handle this currently. seqsets should be converted to uidsets first. */ case SEARCH_FLAGS: case SEARCH_KEYWORDS: case SEARCH_MODSEQ: case SEARCH_INTHREAD: break; case SEARCH_ALL: case SEARCH_UIDSET: case SEARCH_BEFORE: case SEARCH_ON: case SEARCH_SINCE: case SEARCH_SENTBEFORE: case SEARCH_SENTON: case SEARCH_SENTSINCE: case SEARCH_SMALLER: case SEARCH_LARGER: case SEARCH_HEADER: case SEARCH_HEADER_ADDRESS: case SEARCH_HEADER_COMPRESS_LWSP: case SEARCH_BODY: case SEARCH_TEXT: case SEARCH_BODY_FAST: case SEARCH_TEXT_FAST: case SEARCH_GUID: case SEARCH_MAILBOX: return TRUE; } return FALSE; } static void search_set_static_matches(struct mail_search_arg *arg) { for (; arg != NULL; arg = arg->next) { if (search_arg_is_static(arg)) arg->result = 1; } } static bool search_has_static_nonmatches(struct mail_search_arg *arg) { for (; arg != NULL; arg = arg->next) { if (arg->result == 0 && search_arg_is_static(arg)) return TRUE; } return FALSE; } int index_storage_search_next_nonblock(struct mail_search_context *_ctx, struct mail *mail, bool *tryagain_r) { struct index_search_context *ctx = (struct index_search_context *)_ctx; struct mailbox *box = _ctx->transaction->box; unsigned int count = 0; bool match = FALSE; *tryagain_r = FALSE; if (ctx->sorted) { /* everything searched at this point already. just returning matches from sort list */ if (!index_sort_list_next(ctx->mail_ctx.sort_program, mail)) return 0; return 1; } ctx->mail = mail; ctx->imail = ((struct mail_private *)mail)->v.get_index_mail(mail); if (ioloop_time - ctx->last_notify.tv_sec >= SEARCH_NOTIFY_INTERVAL_SECS) index_storage_search_notify(box, ctx); while (box->v.search_next_update_seq(_ctx)) { mail_set_seq(mail, _ctx->seq); T_BEGIN { match = search_match_next(ctx); if (ctx->mail->expunged) _ctx->seen_lost_data = TRUE; if (!match && search_has_static_nonmatches(_ctx->args->args)) { /* if there are saved search results remember that this message never matches */ mailbox_search_results_never(_ctx, mail->uid); } } T_END; mail_search_args_reset(_ctx->args->args, FALSE); if (ctx->error != NULL) ctx->failed = TRUE; else if (match) { if (_ctx->sort_program == NULL) break; index_sort_list_add(_ctx->sort_program, mail); } if (++count == SEARCH_NONBLOCK_COUNT) { *tryagain_r = TRUE; return 0; } } ctx->mail = NULL; ctx->imail = NULL; if (!match && _ctx->sort_program != NULL && !ctx->failed) { /* finished searching the messages. now sort them and start returning the messages. */ ctx->sorted = TRUE; index_sort_list_finish(_ctx->sort_program); return index_storage_search_next_nonblock(_ctx, mail, tryagain_r); } return ctx->failed ? -1 : (match ? 1 : 0); } bool index_storage_search_next_update_seq(struct mail_search_context *_ctx) { struct index_search_context *ctx = (struct index_search_context *)_ctx; uint32_t uid; int ret; if (_ctx->seq == 0) { /* first time */ _ctx->seq = ctx->seq1; } else { _ctx->seq++; } if (!ctx->have_seqsets && !ctx->have_index_args && _ctx->update_result == NULL) return _ctx->seq <= ctx->seq2; ret = 0; while (_ctx->seq <= ctx->seq2) { /* check if the sequence matches */ ret = mail_search_args_foreach(ctx->mail_ctx.args->args, search_seqset_arg, ctx); if (ret != 0 && ctx->have_index_args) { /* check if flags/keywords match before anything else is done. mail_set_seq() can be a bit slow. */ ret = mail_search_args_foreach(ctx->mail_ctx.args->args, search_index_arg, ctx); } if (ret != 0 && _ctx->update_result != NULL) { /* see if this message never matches */ mail_index_lookup_uid(ctx->view, _ctx->seq, &uid); if (seq_range_exists(&_ctx->update_result->never_uids, uid)) ret = 0; } if (ret != 0) break; /* doesn't, try next one */ _ctx->seq++; mail_search_args_reset(ctx->mail_ctx.args->args, FALSE); } if (ret != 0 && _ctx->update_result != NULL) { mail_index_lookup_uid(ctx->view, _ctx->seq, &uid); if (seq_range_exists(&_ctx->update_result->uids, uid)) { /* we already know that the static data matches. mark it as such. */ search_set_static_matches(_ctx->args->args); } } return ret != 0; }