camel/camel-folder-search.c

   1 /* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
   2 /*
   3  *  Copyright (C) 1999-2008 Novell, Inc. (www.novell.com)
   4  *
   5  *  Authors: Michael Zucchi <notzed@ximian.com>
   6  *
   7  * This program is free software; you can redistribute it and/or
   8  * modify it under the terms of version 2 of the GNU Lesser General Public
   9  * License as published by the Free Software Foundation.
  10  *
  11  * This program is distributed in the hope that it will be useful,
  12  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  14  * General Public License for more details.
  15  *
  16  * You should have received a copy of the GNU Lesser General Public
  17  * License along with this program; if not, write to the
  18  * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
  19  * Boston, MA 02110-1301, USA.
  20  */
  21
  22 /* This is a helper class for folders to implement the search function.
  23    It implements enough to do basic searches on folders that can provide
  24    an in-memory summary and a body index. */
  25
  26 #ifdef HAVE_CONFIG_H
  27 #include <config.h>
  28 #endif
  29
  30 /* POSIX requires <sys/types.h> be included before <regex.h> */
  31 #include <sys/types.h>
  32
  33 #include <ctype.h>
  34 #include <regex.h>
  35 #include <stdio.h>
  36 #include <string.h>
  37
  38 #include <glib.h>
  39 #include <glib/gi18n-lib.h>
  40
  41 #include "camel-exception.h"
  42 #include "camel-folder-search.h"
  43 #include "camel-folder-thread.h"
  44 #include "camel-iconv.h"
  45 #include "camel-medium.h"
  46 #include "camel-mime-message.h"
  47 #include "camel-multipart.h"
  48 #include "camel-search-private.h"
  49 #include "camel-stream-mem.h"
  50 #include "camel-db.h"
  51 #include "camel-debug.h"
  52 #include "camel-store.h"
  53 #include "camel-vee-folder.h"
  54 #include "camel-string-utils.h"
  55 #include "camel-search-sql.h"
  56 #include "camel-search-sql-sexp.h"
  57
  58 #define d(x)
  59 #define r(x)
  60 #define dd(x) if (camel_debug("search")) x
  61
  62 struct _CamelFolderSearchPrivate {
  63         CamelException *ex;
  64
  65         CamelFolderThread *threads;
  66         GHashTable *threads_hash;
  67 };
  68
  69 #define _PRIVATE(o) (((CamelFolderSearch *)(o))->priv)
  70
  71 static ESExpResult *search_not(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search);
  72
  73 static ESExpResult *search_header_contains(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search);
  74 static ESExpResult *search_header_matches(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search);
  75 static ESExpResult *search_header_starts_with(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search);
  76 static ESExpResult *search_header_ends_with(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search);
  77 static ESExpResult *search_header_exists(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search);
  78 static ESExpResult *search_header_soundex(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search);
  79 static ESExpResult *search_header_regex(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search);
  80 static ESExpResult *search_header_full_regex(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search);
  81 static ESExpResult *search_match_all(struct _ESExp *f, int argc, struct _ESExpTerm **argv, CamelFolderSearch *search);
  82 static ESExpResult *search_match_threads(struct _ESExp *f, int argc, struct _ESExpTerm **argv, CamelFolderSearch *s);
  83 static ESExpResult *search_body_contains(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search);
  84 static ESExpResult *search_body_regex(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search);
  85 static ESExpResult *search_user_flag(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *s);
  86 static ESExpResult *search_user_tag(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *s);
  87 static ESExpResult *search_system_flag(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *s);
  88 static ESExpResult *search_get_sent_date(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *s);
  89 static ESExpResult *search_get_received_date(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *s);
  90 static ESExpResult *search_get_current_date(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *s);
  91 static ESExpResult *search_get_size(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *s);
  92 static ESExpResult *search_uid(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *s);
  93 static ESExpResult *search_message_location(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *s);
  94
  95 static ESExpResult *search_dummy(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search);
  96
  97 static void camel_folder_search_class_init (CamelFolderSearchClass *klass);
  98 static void camel_folder_search_init       (CamelFolderSearch *obj);
  99 static void camel_folder_search_finalize   (CamelObject *obj);
 100
 101 static int read_uid_callback (void * ref, int ncol, char ** cols, char **name);
 102
 103 static CamelObjectClass *camel_folder_search_parent;
 104
 105 static void
 106 camel_folder_search_class_init (CamelFolderSearchClass *klass)
 107 {
 108         camel_folder_search_parent = camel_type_get_global_classfuncs (camel_object_get_type ());
 109
 110         klass->not = search_not;
 111
 112         klass->match_all = search_match_all;
 113         klass->match_threads = search_match_threads;
 114         klass->body_contains = search_body_contains;
 115         klass->body_regex = search_body_regex;
 116         klass->header_contains = search_header_contains;
 117         klass->header_matches = search_header_matches;
 118         klass->header_starts_with = search_header_starts_with;
 119         klass->header_ends_with = search_header_ends_with;
 120         klass->header_exists = search_header_exists;
 121         klass->header_soundex = search_header_soundex;
 122         klass->header_regex = search_header_regex;
 123         klass->header_full_regex = search_header_full_regex;
 124         klass->user_tag = search_user_tag;
 125         klass->user_flag = search_user_flag;
 126         klass->system_flag = search_system_flag;
 127         klass->get_sent_date = search_get_sent_date;
 128         klass->get_received_date = search_get_received_date;
 129         klass->get_current_date = search_get_current_date;
 130         klass->get_size = search_get_size;
 131         klass->uid = search_uid;
 132         klass->message_location = search_message_location;
 133 }
 134
 135 static void
 136 camel_folder_search_init (CamelFolderSearch *obj)
 137 {
 138         struct _CamelFolderSearchPrivate *p;
 139
 140         p = _PRIVATE(obj) = g_malloc0(sizeof(*p));
 141
 142         obj->sexp = e_sexp_new();
 143 }
 144
 145 static void
 146 camel_folder_search_finalize (CamelObject *obj)
 147 {
 148         CamelFolderSearch *search = (CamelFolderSearch *)obj;
 149         struct _CamelFolderSearchPrivate *p = _PRIVATE(obj);
 150
 151         if (search->sexp)
 152                 e_sexp_unref(search->sexp);
 153
 154         g_free(search->last_search);
 155         g_free(p);
 156 }
 157
 158 CamelType
 159 camel_folder_search_get_type (void)
 160 {
 161         static CamelType type = CAMEL_INVALID_TYPE;
 162
 163         if (type == CAMEL_INVALID_TYPE) {
 164                 type = camel_type_register (camel_object_get_type (), "CamelFolderSearch",
 165                                             sizeof (CamelFolderSearch),
 166                                             sizeof (CamelFolderSearchClass),
 167                                             (CamelObjectClassInitFunc) camel_folder_search_class_init,
 168                                             NULL,
 169                                             (CamelObjectInitFunc) camel_folder_search_init,
 170                                             (CamelObjectFinalizeFunc) camel_folder_search_finalize);
 171         }
 172
 173         return type;
 174 }
 175
 176 #ifdef offsetof
 177 #define CAMEL_STRUCT_OFFSET(type, field)        ((gint) offsetof (type, field))
 178 #else
 179 #define CAMEL_STRUCT_OFFSET(type, field)        ((gint) ((gchar*) &((type *) 0)->field))
 180 #endif
 181
 182 static struct {
 183         char *name;
 184         int offset;
 185         int flags;              /* 0x02 = immediate, 0x01 = always enter */
 186 } builtins[] = {
 187         /* these have default implementations in e-sexp */
 188         { "and", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, and), 2 },
 189         { "or", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, or), 2 },
 190         /* we need to override this one though to implement an 'array not' */
 191         { "not", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, not), 0 },
 192         { "<", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, lt), 2 },
 193         { ">", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, gt), 2 },
 194         { "=", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, eq), 2 },
 195
 196         /* these we have to use our own default if there is none */
 197         /* they should all be defined in the language? so it parses, or should they not?? */
 198         { "match-all", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, match_all), 3 },
 199         { "match-threads", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, match_threads), 3 },
 200         { "body-contains", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, body_contains), 1 },
 201         { "body-regex",  CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, body_regex), 1  },
 202         { "header-contains", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, header_contains), 1 },
 203         { "header-matches", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, header_matches), 1 },
 204         { "header-starts-with", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, header_starts_with), 1 },
 205         { "header-ends-with", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, header_ends_with), 1 },
 206         { "header-exists", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, header_exists), 1 },
 207         { "header-soundex", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, header_soundex), 1 },
 208         { "header-regex", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, header_regex), 1 },
 209         { "header-full-regex", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, header_full_regex), 1 },
 210         { "user-tag", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, user_tag), 1 },
 211         { "user-flag", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, user_flag), 1 },
 212         { "system-flag", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, system_flag), 1 },
 213         { "get-sent-date", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, get_sent_date), 1 },
 214         { "get-received-date", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, get_received_date), 1 },
 215         { "get-current-date", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, get_current_date), 1 },
 216         { "get-size", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, get_size), 1 },
 217         { "uid", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, uid), 1 },
 218         { "message-location", CAMEL_STRUCT_OFFSET(CamelFolderSearchClass, message_location), 1 },
 219 };
 220
 221 void
 222 camel_folder_search_construct (CamelFolderSearch *search)
 223 {
 224         int i;
 225         CamelFolderSearchClass *klass = (CamelFolderSearchClass *)CAMEL_OBJECT_GET_CLASS(search);
 226
 227         for (i=0;i<sizeof(builtins)/sizeof(builtins[0]);i++) {
 228                 void *func;
 229                 /* c is sure messy sometimes */
 230                 func = *((void **)(((char *)klass)+builtins[i].offset));
 231                 if (func == NULL && builtins[i].flags&1) {
 232                         g_warning("Search class doesn't implement '%s' method: %s", builtins[i].name, camel_type_to_name(CAMEL_OBJECT_GET_CLASS(search)));
 233                         func = (void *)search_dummy;
 234                 }
 235                 if (func != NULL) {
 236                         if (builtins[i].flags&2) {
 237                                 e_sexp_add_ifunction(search->sexp, 0, builtins[i].name, (ESExpIFunc *)func, search);
 238                         } else {
 239                                 e_sexp_add_function(search->sexp, 0, builtins[i].name, (ESExpFunc *)func, search);
 240                         }
 241                 }
 242         }
 243 }
 244
 245 /**
 246  * camel_folder_search_new:
 247  *
 248  * Create a new CamelFolderSearch object.
 249  *
 250  * A CamelFolderSearch is a subclassable, extensible s-exp
 251  * evaluator which enforces a particular set of s-expressions.
 252  * Particular methods may be overriden by an implementation to
 253  * implement a search for any sort of backend.
 254  *
 255  * Return value: A new CamelFolderSearch widget.
 256  **/
 257 CamelFolderSearch *
 258 camel_folder_search_new (void)
 259 {
 260         CamelFolderSearch *new = CAMEL_FOLDER_SEARCH (camel_object_new (camel_folder_search_get_type ()));
 261
 262         camel_folder_search_construct(new);
 263         return new;
 264 }
 265
 266 /**
 267  * camel_folder_search_set_folder:
 268  * @search:
 269  * @folder: A folder.
 270  *
 271  * Set the folder attribute of the search.  This is currently unused, but
 272  * could be used to perform a slow-search when indexes and so forth are not
 273  * available.  Or for use by subclasses.
 274  **/
 275 void
 276 camel_folder_search_set_folder(CamelFolderSearch *search, CamelFolder *folder)
 277 {
 278         search->folder = folder;
 279 }
 280
 281 /**
 282  * camel_folder_search_set_summary:
 283  * @search:
 284  * @summary: An array of CamelMessageInfo pointers.
 285  *
 286  * Set the array of summary objects representing the span of the search.
 287  *
 288  * If this is not set, then a subclass must provide the functions
 289  * for searching headers and for the match-all operator.
 290  **/
 291 void
 292 camel_folder_search_set_summary(CamelFolderSearch *search, GPtrArray *summary)
 293 {
 294         search->summary = summary;
 295 }
 296
 297 /**
 298  * camel_folder_search_set_body_index:
 299  * @search:
 300  * @index:
 301  *
 302  * Set the index representing the contents of all messages
 303  * in this folder.  If this is not set, then the folder implementation
 304  * should sub-class the CamelFolderSearch and provide its own
 305  * body-contains function.
 306  **/
 307 void
 308 camel_folder_search_set_body_index(CamelFolderSearch *search, CamelIndex *index)
 309 {
 310         if (search->body_index)
 311                 camel_object_unref((CamelObject *)search->body_index);
 312         search->body_index = index;
 313         if (index)
 314                 camel_object_ref((CamelObject *)index);
 315 }
 316
 317 /**
 318  * camel_folder_search_execute_expression:
 319  * @search:
 320  * @expr:
 321  * @ex:
 322  *
 323  * Execute the search expression @expr, returning an array of
 324  * all matches as a GPtrArray of uid's of matching messages.
 325  *
 326  * Note that any settings such as set_body_index(), set_folder(),
 327  * and so on are reset to #NULL once the search has completed.
 328  *
 329  * TODO: The interface should probably return summary items instead
 330  * (since they are much more useful to any client).
 331  *
 332  * Return value: A GPtrArray of strings of all matching messages.
 333  * This must only be freed by camel_folder_search_free_result.
 334  **/
 335 GPtrArray *
 336 camel_folder_search_execute_expression(CamelFolderSearch *search, const char *expr, CamelException *ex)
 337 {
 338         ESExpResult *r;
 339         GPtrArray *matches;
 340         int i;
 341         GHashTable *results;
 342         struct _CamelFolderSearchPrivate *p = _PRIVATE(search);
 343
 344         p->ex = ex;
 345
 346         /* only re-parse if the search has changed */
 347         if (search->last_search == NULL
 348             || strcmp(search->last_search, expr)) {
 349                 e_sexp_input_text(search->sexp, expr, strlen(expr));
 350                 if (e_sexp_parse(search->sexp) == -1) {
 351                         camel_exception_setv(ex, 1, _("Cannot parse search expression: %s:\n%s"), e_sexp_error(search->sexp), expr);
 352                         return NULL;
 353                 }
 354
 355                 g_free(search->last_search);
 356                 search->last_search = g_strdup(expr);
 357         }
 358         r = e_sexp_eval(search->sexp);
 359         if (r == NULL) {
 360                 if (!camel_exception_is_set(ex))
 361                         camel_exception_setv(ex, 1, _("Error executing search expression: %s:\n%s"), e_sexp_error(search->sexp), expr);
 362                 return NULL;
 363         }
 364
 365         matches = g_ptr_array_new();
 366
 367         /* now create a folder summary to return?? */
 368         if (r->type == ESEXP_RES_ARRAY_PTR) {
 369                 d(printf("got result ...\n"));
 370                 if (search->summary) {
 371                         /* reorder result in summary order */
 372                         results = g_hash_table_new(g_str_hash, g_str_equal);
 373                         for (i=0;i<r->value.ptrarray->len;i++) {
 374                                 d(printf("adding match: %s\n", (char *)g_ptr_array_index(r->value.ptrarray, i)));
 375                                 g_hash_table_insert(results, g_ptr_array_index(r->value.ptrarray, i), GINT_TO_POINTER (1));
 376                         }
 377                         for (i=0;i<search->summary->len;i++) {
 378                                 char *uid = g_ptr_array_index(search->summary, i);
 379                                 if (g_hash_table_lookup(results, uid)) {
 380                                         g_ptr_array_add(matches, (gpointer) camel_pstring_strdup(uid));
 381                                 }
 382                         }
 383                         g_hash_table_destroy(results);
 384                 } else {
 385                         for (i=0;i<r->value.ptrarray->len;i++) {
 386                                 d(printf("adding match: %s\n", (char *)g_ptr_array_index(r->value.ptrarray, i)));
 387                                 g_ptr_array_add(matches, (gpointer) camel_pstring_strdup(g_ptr_array_index(r->value.ptrarray, i)));
 388                         }
 389                 }
 390         } else {
 391                 g_warning("Search returned an invalid result type");
 392         }
 393
 394         e_sexp_result_free(search->sexp, r);
 395
 396         if (p->threads)
 397                 camel_folder_thread_messages_unref(p->threads);
 398         if (p->threads_hash)
 399                 g_hash_table_destroy(p->threads_hash);
 400
 401         p->threads = NULL;
 402         p->threads_hash = NULL;
 403         search->folder = NULL;
 404         search->summary = NULL;
 405         search->current = NULL;
 406         search->body_index = NULL;
 407
 408         return matches;
 409 }
 410
 411 /**
 412  * camel_folder_search_count:
 413  * @search:
 414  * @expr:
 415  * @uids: to search against, NULL for all uid's.
 416  * @ex:
 417  *
 418  * Run a search.  Search must have had Folder already set on it, and
 419  * it must implement summaries.
 420  *
 421  * Return value: Number of messages that match the query.
 422  **/
 423
 424 guint32
 425 camel_folder_search_count(CamelFolderSearch *search, const char *expr, CamelException *ex)
 426 {
 427         ESExpResult *r;
 428         GPtrArray *summary_set;
 429         int i;
 430         CamelDB *cdb;
 431         char *sql_query, *tmp, *tmp1;
 432         GHashTable *results;
 433         guint32 count = 0;
 434
 435         struct _CamelFolderSearchPrivate *p = _PRIVATE(search);
 436
 437         g_assert(search->folder);
 438
 439         p->ex = ex;
 440
 441         /* We route body-contains search and thread based search through memory and not via db. */
 442         if (strstr((const char *) expr, "body-contains") || strstr((const char *) expr, "match-threads")) {
 443                 /* setup our search list only contains those we're interested in */
 444                 search->summary = camel_folder_get_summary(search->folder);
 445
 446                 summary_set = search->summary;
 447
 448                 /* only re-parse if the search has changed */
 449                 if (search->last_search == NULL
 450                     || strcmp(search->last_search, expr)) {
 451                         e_sexp_input_text(search->sexp, expr, strlen(expr));
 452                         if (e_sexp_parse(search->sexp) == -1) {
 453                                 camel_exception_setv(ex, 1, _("Cannot parse search expression: %s:\n%s"), e_sexp_error(search->sexp), expr);
 454                                 goto fail;
 455                         }
 456
 457                         g_free(search->last_search);
 458                         search->last_search = g_strdup(expr);
 459                 }
 460                 r = e_sexp_eval(search->sexp);
 461                 if (r == NULL) {
 462                         if (!camel_exception_is_set(ex))
 463                                 camel_exception_setv(ex, 1, _("Error executing search expression: %s:\n%s"), e_sexp_error(search->sexp), expr);
 464                         goto fail;
 465                 }
 466
 467                 /* now create a folder summary to return?? */
 468                 if (r->type == ESEXP_RES_ARRAY_PTR) {
 469                         d(printf("got result\n"));
 470
 471                         /* reorder result in summary order */
 472                         results = g_hash_table_new(g_str_hash, g_str_equal);
 473                         for (i=0;i<r->value.ptrarray->len;i++) {
 474                                 d(printf("adding match: %s\n", (char *)g_ptr_array_index(r->value.ptrarray, i)));
 475                                 g_hash_table_insert(results, g_ptr_array_index(r->value.ptrarray, i), GINT_TO_POINTER (1));
 476                         }
 477
 478                         for (i=0;i<summary_set->len;i++) {
 479                                 char *uid = g_ptr_array_index(summary_set, i);
 480                                 if (g_hash_table_lookup(results, uid))
 481                                         count++;
 482                         }
 483                         g_hash_table_destroy(results);
 484                 }
 485
 486                 e_sexp_result_free(search->sexp, r);
 487
 488         } else {
 489                 /* Sync the db, so that we search the db for changes */
 490                 camel_folder_summary_save_to_db (search->folder->summary, ex);
 491
 492                 dd(printf ("sexp is : [%s]\n", expr));
 493                 if (g_getenv("SQL_SEARCH_OLD"))
 494                         sql_query = camel_sexp_to_sql (expr);
 495                 else
 496                         sql_query = camel_sexp_to_sql_sexp (expr);
 497                 tmp1 = camel_db_sqlize_string(search->folder->full_name);
 498                 tmp = g_strdup_printf ("SELECT COUNT (*) FROM %s %s %s", tmp1, sql_query ? "WHERE":"", sql_query?sql_query:"");
 499                 camel_db_free_sqlized_string (tmp1);
 500                 g_free (sql_query);
 501                 dd(printf("Equivalent sql %s\n", tmp));
 502
 503                 cdb = (CamelDB *) (search->folder->parent_store->cdb_r);
 504                 camel_db_count_message_info  (cdb, tmp, &count, ex);
 505                 if (ex && camel_exception_is_set(ex)) {
 506                         const char *exception = camel_exception_get_description (ex);
 507                         if (strncmp(exception, "no such table", 13) == 0) {
 508                                 d(g_warning ("Error during searching %s: %s\n", tmp, exception));
 509                                 camel_exception_clear (ex); /* Suppress no such table */
 510                         }
 511                 }
 512                 g_free (tmp);
 513
 514         }
 515
 516 fail:
 517         /* these might be allocated by match-threads */
 518         if (p->threads)
 519                 camel_folder_thread_messages_unref(p->threads);
 520         if (p->threads_hash)
 521                 g_hash_table_destroy(p->threads_hash);
 522         if (search->summary_set)
 523                 g_ptr_array_free(search->summary_set, TRUE);
 524         if (search->summary)
 525                 camel_folder_free_summary(search->folder, search->summary);
 526
 527         p->threads = NULL;
 528         p->threads_hash = NULL;
 529         search->folder = NULL;
 530         search->summary = NULL;
 531         search->summary_set = NULL;
 532         search->current = NULL;
 533         search->body_index = NULL;
 534
 535         return count;
 536 }
 537
 538 static gboolean
 539 do_search_in_memory (const char *expr)
 540 {
 541         /* if the expression contains any of these tokens, then perform a memory search, instead of the SQL one */
 542         const char *in_memory_tokens[] = { "body-contains", "body-regex", "match-threads", "message-location", "header-soundex", "header-regex", "header-full-regex", "header-contains", NULL };
 543         int i;
 544
 545         if (!expr)
 546                 return FALSE;
 547
 548         for (i = 0; in_memory_tokens [i]; i++) {
 549                 if (strstr (expr, in_memory_tokens [i]))
 550                         return TRUE;
 551         }
 552
 553         return FALSE;
 554 }
 555
 556 /**
 557  * camel_folder_search_search:
 558  * @search:
 559  * @expr:
 560  * @uids: to search against, NULL for all uid's.
 561  * @ex:
 562  *
 563  * Run a search.  Search must have had Folder already set on it, and
 564  * it must implement summaries.
 565  *
 566  * Return value:
 567  **/
 568 GPtrArray *
 569 camel_folder_search_search(CamelFolderSearch *search, const char *expr, GPtrArray *uids, CamelException *ex)
 570 {
 571         ESExpResult *r;
 572         GPtrArray *matches = NULL, *summary_set;
 573         int i;
 574         CamelDB *cdb;
 575         char *sql_query, *tmp, *tmp1;
 576         GHashTable *results;
 577
 578         struct _CamelFolderSearchPrivate *p = _PRIVATE(search);
 579
 580         g_assert(search->folder);
 581
 582         p->ex = ex;
 583
 584         /* We route body-contains / thread based search and uid search through memory and not via db. */
 585         if (uids || do_search_in_memory (expr)) {
 586                 /* setup our search list only contains those we're interested in */
 587                 search->summary = camel_folder_get_summary(search->folder);
 588
 589                 if (uids) {
 590                         GHashTable *uids_hash = g_hash_table_new(g_str_hash, g_str_equal);
 591
 592                         summary_set = search->summary_set = g_ptr_array_new();
 593                         for (i=0;i<uids->len;i++)
 594                                 g_hash_table_insert(uids_hash, uids->pdata[i], uids->pdata[i]);
 595                         for (i=0;i<search->summary->len;i++)
 596                                 if (g_hash_table_lookup(uids_hash, search->summary->pdata[i]))
 597                                         g_ptr_array_add(search->summary_set, search->summary->pdata[i]);
 598                         g_hash_table_destroy(uids_hash);
 599                 } else {
 600                         summary_set = search->summary;
 601                 }
 602
 603                 /* only re-parse if the search has changed */
 604                 if (search->last_search == NULL
 605                     || strcmp(search->last_search, expr)) {
 606                         e_sexp_input_text(search->sexp, expr, strlen(expr));
 607                         if (e_sexp_parse(search->sexp) == -1) {
 608                                 camel_exception_setv(ex, 1, _("Cannot parse search expression: %s:\n%s"), e_sexp_error(search->sexp), expr);
 609                                 goto fail;
 610                         }
 611
 612                         g_free(search->last_search);
 613                         search->last_search = g_strdup(expr);
 614                 }
 615                 r = e_sexp_eval(search->sexp);
 616                 if (r == NULL) {
 617                         if (!camel_exception_is_set(ex))
 618                                 camel_exception_setv(ex, 1, _("Error executing search expression: %s:\n%s"), e_sexp_error(search->sexp), expr);
 619                         goto fail;
 620                 }
 621
 622                 matches = g_ptr_array_new();
 623
 624                 /* now create a folder summary to return?? */
 625                 if (r->type == ESEXP_RES_ARRAY_PTR) {
 626                         d(printf("got result\n"));
 627
 628                         /* reorder result in summary order */
 629                         results = g_hash_table_new(g_str_hash, g_str_equal);
 630                         for (i=0;i<r->value.ptrarray->len;i++) {
 631                                 d(printf("adding match: %s\n", (char *)g_ptr_array_index(r->value.ptrarray, i)));
 632                                 g_hash_table_insert(results, g_ptr_array_index(r->value.ptrarray, i), GINT_TO_POINTER (1));
 633                         }
 634
 635                         for (i=0;i<summary_set->len;i++) {
 636                                 char *uid = g_ptr_array_index(summary_set, i);
 637                                 if (g_hash_table_lookup(results, uid))
 638                                         g_ptr_array_add(matches, (gpointer) camel_pstring_strdup(uid));
 639                         }
 640                         g_hash_table_destroy(results);
 641                 }
 642
 643                 e_sexp_result_free(search->sexp, r);
 644
 645         } else {
 646                 /* Sync the db, so that we search the db for changes */
 647                 camel_folder_summary_save_to_db (search->folder->summary, ex);
 648
 649                 dd(printf ("sexp is : [%s]\n", expr));
 650                 if (g_getenv("SQL_SEARCH_OLD"))
 651                         sql_query = camel_sexp_to_sql (expr);
 652                 else
 653                         sql_query = camel_sexp_to_sql_sexp (expr);
 654                 tmp1 = camel_db_sqlize_string(search->folder->full_name);
 655                 tmp = g_strdup_printf ("SELECT uid FROM %s %s %s", tmp1, sql_query ? "WHERE":"", sql_query?sql_query:"");
 656                 camel_db_free_sqlized_string (tmp1);
 657                 g_free (sql_query);
 658                 dd(printf("Equivalent sql %s\n", tmp));
 659
 660                 matches = g_ptr_array_new();
 661                 cdb = (CamelDB *) (search->folder->parent_store->cdb_r);
 662                 camel_db_select (cdb, tmp, (CamelDBSelectCB) read_uid_callback, matches, ex);
 663                 if (ex && camel_exception_is_set(ex)) {
 664                         const char *exception = camel_exception_get_description (ex);
 665                         if (strncmp(exception, "no such table", 13) == 0) {
 666                                 d(g_warning ("Error during searching %s: %s\n", tmp, exception));
 667                                 camel_exception_clear (ex); /* Suppress no such table */
 668                         }
 669                 }
 670                 g_free (tmp);
 671
 672         }
 673
 674 fail:
 675         /* these might be allocated by match-threads */
 676         if (p->threads)
 677                 camel_folder_thread_messages_unref(p->threads);
 678         if (p->threads_hash)
 679                 g_hash_table_destroy(p->threads_hash);
 680         if (search->summary_set)
 681                 g_ptr_array_free(search->summary_set, TRUE);
 682         if (search->summary)
 683                 camel_folder_free_summary(search->folder, search->summary);
 684
 685         p->threads = NULL;
 686         p->threads_hash = NULL;
 687         search->folder = NULL;
 688         search->summary = NULL;
 689         search->summary_set = NULL;
 690         search->current = NULL;
 691         search->body_index = NULL;
 692
 693         return matches;
 694 }
 695
 696 void camel_folder_search_free_result(CamelFolderSearch *search, GPtrArray *result)
 697 {
 698         g_ptr_array_foreach (result, (GFunc) camel_pstring_free, NULL);
 699         g_ptr_array_free(result, TRUE);
 700 }
 701
 702 /* dummy function, returns false always, or an empty match array */
 703 static ESExpResult *
 704 search_dummy(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search)
 705 {
 706         ESExpResult *r;
 707
 708         if (search->current == NULL) {
 709                 r = e_sexp_result_new(f, ESEXP_RES_BOOL);
 710                 r->value.bool = FALSE;
 711         } else {
 712                 r = e_sexp_result_new(f, ESEXP_RES_ARRAY_PTR);
 713                 r->value.ptrarray = g_ptr_array_new();
 714         }
 715
 716         return r;
 717 }
 718
 719 /* impelemnt an 'array not', i.e. everything in the summary, not in the supplied array */
 720 static ESExpResult *
 721 search_not(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search)
 722 {
 723         ESExpResult *r;
 724         int i;
 725
 726         if (argc>0) {
 727                 if (argv[0]->type == ESEXP_RES_ARRAY_PTR) {
 728                         GPtrArray *v = argv[0]->value.ptrarray;
 729                         const char *uid;
 730
 731                         r = e_sexp_result_new(f, ESEXP_RES_ARRAY_PTR);
 732                         r->value.ptrarray = g_ptr_array_new();
 733
 734                         /* not against a single message?*/
 735                         if (search->current) {
 736                                 int found = FALSE;
 737
 738                                 uid = camel_message_info_uid(search->current);
 739                                 for (i=0;!found && i<v->len;i++) {
 740                                         if (strcmp(uid, v->pdata[i]) == 0)
 741                                                 found = TRUE;
 742                                 }
 743
 744                                 if (!found)
 745                                         g_ptr_array_add(r->value.ptrarray, (char *)uid);
 746                         } else if (search->summary == NULL) {
 747                                 g_warning("No summary set, 'not' against an array requires a summary");
 748                         } else {
 749                                 /* 'not' against the whole summary */
 750                                 GHashTable *have = g_hash_table_new(g_str_hash, g_str_equal);
 751                                 char **s;
 752                                 char **m;
 753
 754                                 s = (char **)v->pdata;
 755                                 for (i=0;i<v->len;i++)
 756                                         g_hash_table_insert(have, s[i], s[i]);
 757
 758                                 v = search->summary_set?search->summary_set:search->summary;
 759                                 m = (char **)v->pdata;
 760                                 for (i=0;i<v->len;i++) {
 761                                         char *uid = m[i];
 762
 763                                         if (g_hash_table_lookup(have, uid) == NULL)
 764                                                 g_ptr_array_add(r->value.ptrarray, uid);
 765                                 }
 766                                 g_hash_table_destroy(have);
 767                         }
 768                 } else {
 769                         int res = TRUE;
 770
 771                         if (argv[0]->type == ESEXP_RES_BOOL)
 772                                 res = ! argv[0]->value.bool;
 773
 774                         r = e_sexp_result_new(f, ESEXP_RES_BOOL);
 775                         r->value.bool = res;
 776                 }
 777         } else {
 778                 r = e_sexp_result_new(f, ESEXP_RES_BOOL);
 779                 r->value.bool = TRUE;
 780         }
 781
 782         return r;
 783 }
 784
 785 static ESExpResult *
 786 search_match_all(struct _ESExp *f, int argc, struct _ESExpTerm **argv, CamelFolderSearch *search)
 787 {
 788         int i;
 789         ESExpResult *r, *r1;
 790         gchar *error_msg;
 791         GPtrArray *v;
 792
 793         if (argc>1) {
 794                 g_warning("match-all only takes a single argument, other arguments ignored");
 795         }
 796
 797         /* we are only matching a single message?  or already inside a match-all? */
 798         if (search->current) {
 799                 d(printf("matching against 1 message: %s\n", camel_message_info_subject(search->current)));
 800
 801                 r = e_sexp_result_new(f, ESEXP_RES_BOOL);
 802                 r->value.bool = FALSE;
 803
 804                 if (argc>0) {
 805                         r1 = e_sexp_term_eval(f, argv[0]);
 806                         if (r1->type == ESEXP_RES_BOOL) {
 807                                 r->value.bool = r1->value.bool;
 808                         } else {
 809                                 g_warning("invalid syntax, matches require a single bool result");
 810                                 error_msg = g_strdup_printf(_("(%s) requires a single bool result"), "match-all");
 811                                 e_sexp_fatal_error(f, error_msg);
 812                                 g_free(error_msg);
 813                         }
 814                         e_sexp_result_free(f, r1);
 815                 } else {
 816                         r->value.bool = TRUE;
 817                 }
 818                 return r;
 819         }
 820
 821         r = e_sexp_result_new(f, ESEXP_RES_ARRAY_PTR);
 822         r->value.ptrarray = g_ptr_array_new();
 823
 824         if (search->summary == NULL) {
 825                 /* TODO: make it work - e.g. use the folder and so forth for a slower search */
 826                 g_warning("No summary supplied, match-all doesn't work with no summary");
 827                 g_assert(0);
 828                 return r;
 829         }
 830
 831         v = search->summary_set?search->summary_set:search->summary;
 832
 833         if (v->len > g_hash_table_size (search->folder->summary->loaded_infos) && !CAMEL_IS_VEE_FOLDER (search->folder)) {
 834                 camel_folder_summary_reload_from_db (search->folder->summary, search->priv->ex);
 835         }
 836
 837
 838         for (i=0;i<v->len;i++) {
 839                 const char *uid;
 840
 841                 search->current = camel_folder_summary_uid (search->folder->summary, v->pdata[i]);
 842                 if (!search->current)
 843                         continue;
 844                 uid = camel_message_info_uid(search->current);
 845
 846                 if (argc>0) {
 847                         r1 = e_sexp_term_eval(f, argv[0]);
 848                         if (r1->type == ESEXP_RES_BOOL) {
 849                                 if (r1->value.bool)
 850                                         g_ptr_array_add(r->value.ptrarray, (char *)uid);
 851                         } else {
 852                                 g_warning("invalid syntax, matches require a single bool result");
 853                                 error_msg = g_strdup_printf(_("(%s) requires a single bool result"), "match-all");
 854                                 e_sexp_fatal_error(f, error_msg);
 855                                 g_free(error_msg);
 856                         }
 857                         e_sexp_result_free(f, r1);
 858                 } else {
 859                         g_ptr_array_add(r->value.ptrarray, (char *)uid);
 860                 }
 861                 camel_message_info_free (search->current);
 862         }
 863         search->current = NULL;
 864         return r;
 865 }
 866
 867 static void
 868 fill_thread_table(struct _CamelFolderThreadNode *root, GHashTable *id_hash)
 869 {
 870         while (root) {
 871                 g_hash_table_insert(id_hash, (char *)camel_message_info_uid(root->message), root);
 872                 if (root->child)
 873                         fill_thread_table(root->child, id_hash);
 874                 root = root->next;
 875         }
 876 }
 877
 878 static void
 879 add_thread_results(struct _CamelFolderThreadNode *root, GHashTable *result_hash)
 880 {
 881         while (root) {
 882                 g_hash_table_insert(result_hash, (char *)camel_message_info_uid(root->message), GINT_TO_POINTER (1));
 883                 if (root->child)
 884                         add_thread_results(root->child, result_hash);
 885                 root = root->next;
 886         }
 887 }
 888
 889 static void
 890 add_results(char *uid, void *dummy, GPtrArray *result)
 891 {
 892         g_ptr_array_add(result, uid);
 893 }
 894
 895 static ESExpResult *
 896 search_match_threads(struct _ESExp *f, int argc, struct _ESExpTerm **argv, CamelFolderSearch *search)
 897 {
 898         ESExpResult *r;
 899         struct _CamelFolderSearchPrivate *p = search->priv;
 900         int i, type;
 901         GHashTable *results;
 902         gchar *error_msg;
 903
 904         /* not supported in match-all */
 905         if (search->current) {
 906                 error_msg = g_strdup_printf(_("(%s) not allowed inside %s"), "match-threads", "match-all");
 907                 e_sexp_fatal_error(f, error_msg);
 908                 g_free(error_msg);
 909         }
 910
 911         if (argc == 0) {
 912                 error_msg = g_strdup_printf(_("(%s) requires a match type string"), "match-threads");
 913                 e_sexp_fatal_error(f, error_msg);
 914                 g_free(error_msg);
 915         }
 916
 917         r = e_sexp_term_eval(f, argv[0]);
 918         if (r->type != ESEXP_RES_STRING) {
 919                 error_msg = g_strdup_printf(_("(%s) requires a match type string"), "match-threads");
 920                 e_sexp_fatal_error(f, error_msg);
 921                 g_free(error_msg);
 922         }
 923
 924         type = 0;
 925         if (!strcmp(r->value.string, "none"))
 926                 type = 0;
 927         else if (!strcmp(r->value.string, "all"))
 928                 type = 1;
 929         else if (!strcmp(r->value.string, "replies"))
 930                 type = 2;
 931         else if (!strcmp(r->value.string, "replies_parents"))
 932                 type = 3;
 933         else if (!strcmp(r->value.string, "single"))
 934                 type = 4;
 935         e_sexp_result_free(f, r);
 936
 937         /* behave as (begin does */
 938         r = NULL;
 939         for (i=1;i<argc;i++) {
 940                 if (r)
 941                         e_sexp_result_free(f, r);
 942                 r = e_sexp_term_eval(f, argv[i]);
 943         }
 944
 945         if (r == NULL || r->type != ESEXP_RES_ARRAY_PTR) {
 946                 error_msg = g_strdup_printf(_("(%s) expects an array result"), "match-threads");
 947                 e_sexp_fatal_error(f, error_msg);
 948                 g_free(error_msg);
 949         }
 950
 951         if (type == 0)
 952                 return r;
 953
 954         if (search->folder == NULL) {
 955                 error_msg = g_strdup_printf(_("(%s) requires the folder set"), "match-threads");
 956                 e_sexp_fatal_error(f, error_msg);
 957                 g_free(error_msg);
 958         }
 959
 960         /* cache this, so we only have to re-calculate once per search at most */
 961         if (p->threads == NULL) {
 962                 p->threads = camel_folder_thread_messages_new(search->folder, NULL, TRUE);
 963                 p->threads_hash = g_hash_table_new(g_str_hash, g_str_equal);
 964
 965                 fill_thread_table(p->threads->tree, p->threads_hash);
 966         }
 967
 968         results = g_hash_table_new(g_str_hash, g_str_equal);
 969         for (i=0;i<r->value.ptrarray->len;i++) {
 970                 struct _CamelFolderThreadNode *node, *scan;
 971
 972                 if (type != 4)
 973                         g_hash_table_insert(results, g_ptr_array_index(r->value.ptrarray, i), GINT_TO_POINTER(1));
 974
 975                 node = g_hash_table_lookup(p->threads_hash, (char *)g_ptr_array_index(r->value.ptrarray, i));
 976                 if (node == NULL) /* this shouldn't happen but why cry over spilt milk */
 977                         continue;
 978
 979                 /* select messages in thread according to search criteria */
 980                 if (type == 4) {
 981                         if (node->child == NULL && node->parent == NULL)
 982                                 g_hash_table_insert(results, (char *)camel_message_info_uid(node->message), GINT_TO_POINTER(1));
 983                 } else {
 984                         if (type == 3) {
 985                                 scan = node;
 986                                 while (scan && scan->parent) {
 987                                         scan = scan->parent;
 988                                         g_hash_table_insert(results, (char *)camel_message_info_uid(scan->message), GINT_TO_POINTER(1));
 989                                 }
 990                         } else if (type == 1) {
 991                                 while (node && node->parent)
 992                                         node = node->parent;
 993                         }
 994                         g_hash_table_insert(results, (char *)camel_message_info_uid(node->message), GINT_TO_POINTER(1));
 995                         if (node->child)
 996                                 add_thread_results(node->child, results);
 997                 }
 998         }
 999         e_sexp_result_free(f, r);
1000
1001         r = e_sexp_result_new(f, ESEXP_RES_ARRAY_PTR);
1002         r->value.ptrarray = g_ptr_array_new();
1003
1004         g_hash_table_foreach(results, (GHFunc)add_results, r->value.ptrarray);
1005         g_hash_table_destroy(results);
1006
1007         return r;
1008 }
1009
1010 static CamelMimeMessage *
1011 get_current_message (CamelFolderSearch *search)
1012 {
1013         CamelException x = CAMEL_EXCEPTION_INITIALISER;
1014         CamelMimeMessage *res;
1015
1016         if (!search || !search->folder || !search->current)
1017                 return NULL;
1018
1019         res = camel_folder_get_message (search->folder, search->current->uid, &x);
1020
1021         if (!res)
1022                 camel_exception_clear (&x);
1023
1024         return res;
1025 }
1026
1027 static ESExpResult *
1028 check_header (struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search, camel_search_match_t how)
1029 {
1030         ESExpResult *r;
1031         int truth = FALSE;
1032
1033         r(printf("executing check-header %d\n", how));
1034
1035         /* are we inside a match-all? */
1036         if (search->current && argc>1
1037             && argv[0]->type == ESEXP_RES_STRING) {
1038                 char *headername;
1039                 const char *header = NULL, *charset = NULL;
1040                 char strbuf[32];
1041                 int i, j;
1042                 camel_search_t type = CAMEL_SEARCH_TYPE_ASIS;
1043                 struct _camel_search_words *words;
1044                 CamelMimeMessage *message = NULL;
1045                 struct _camel_header_raw *raw_header;
1046
1047                 /* only a subset of headers are supported .. */
1048                 headername = argv[0]->value.string;
1049                 if (!g_ascii_strcasecmp(headername, "subject")) {
1050                         header = camel_message_info_subject(search->current);
1051                 } else if (!g_ascii_strcasecmp(headername, "date")) {
1052                         /* FIXME: not a very useful form of the date */
1053                         sprintf(strbuf, "%d", (int)camel_message_info_date_sent(search->current));
1054                         header = strbuf;
1055                 } else if (!g_ascii_strcasecmp(headername, "from")) {
1056                         header = camel_message_info_from(search->current);
1057                         type = CAMEL_SEARCH_TYPE_ADDRESS;
1058                 } else if (!g_ascii_strcasecmp(headername, "to")) {
1059                         header = camel_message_info_to(search->current);
1060                         type = CAMEL_SEARCH_TYPE_ADDRESS;
1061                 } else if (!g_ascii_strcasecmp(headername, "cc")) {
1062                         header = camel_message_info_cc(search->current);
1063                         type = CAMEL_SEARCH_TYPE_ADDRESS;
1064                 } else if (!g_ascii_strcasecmp(headername, "x-camel-mlist")) {
1065                         header = camel_message_info_mlist(search->current);
1066                         type = CAMEL_SEARCH_TYPE_MLIST;
1067                 } else {
1068                         message = get_current_message (search);
1069                         if (message) {
1070                                 CamelContentType *ct = camel_mime_part_get_content_type (CAMEL_MIME_PART (message));
1071
1072                                 if (ct) {
1073                                         charset = camel_content_type_param (ct, "charset");
1074                                         charset = camel_iconv_charset_name (charset);
1075                                 }
1076                         }
1077                 }
1078
1079                 if (header == NULL)
1080                         header = "";
1081
1082                 /* performs an OR of all words */
1083                 for (i=1;i<argc && !truth;i++) {
1084                         if (argv[i]->type == ESEXP_RES_STRING) {
1085                                 if (argv[i]->value.string[0] == 0) {
1086                                         truth = TRUE;
1087                                 } else if (how == CAMEL_SEARCH_MATCH_CONTAINS) {
1088                                         /* doesn't make sense to split words on anything but contains i.e. we can't have an ending match different words */
1089                                         words = camel_search_words_split((const unsigned char *) argv[i]->value.string);
1090                                         truth = TRUE;
1091                                         for (j=0;j<words->len && truth;j++) {
1092                                                 if (message) {
1093                                                         for (raw_header = ((CamelMimePart *)message)->headers; raw_header; raw_header = raw_header->next) {
1094                                                                 if (!g_ascii_strcasecmp (raw_header->name, headername)) {
1095                                                                         if (camel_search_header_match (raw_header->value, words->words[j]->word, how, type, charset))
1096                                                                                 break;;
1097                                                                 }
1098                                                         }
1099
1100                                                         truth = raw_header != NULL;
1101                                                 } else
1102                                                         truth = camel_search_header_match(header, words->words[j]->word, how, type, charset);
1103                                         }
1104                                         camel_search_words_free(words);
1105                                 } else {
1106                                         if (message) {
1107                                                 for (raw_header = ((CamelMimePart *)message)->headers; raw_header && !truth; raw_header = raw_header->next) {
1108                                                         if (!g_ascii_strcasecmp (raw_header->name, headername)) {
1109                                                                 truth = camel_search_header_match(raw_header->value, argv[i]->value.string, how, type, charset);
1110                                                         }
1111                                                 }
1112                                         } else
1113                                                 truth = camel_search_header_match(header, argv[i]->value.string, how, type, charset);
1114                                 }
1115                         }
1116                 }
1117
1118                 if (message)
1119                         camel_object_unref (message);
1120         }
1121         /* TODO: else, find all matches */
1122
1123         r = e_sexp_result_new(f, ESEXP_RES_BOOL);
1124         r->value.bool = truth;
1125
1126         return r;
1127 }
1128
1129 /*
1130 static void
1131 l_printf(char *node)
1132 {
1133 printf("%s\t", node);
1134 }
1135 */
1136
1137 static ESExpResult *
1138 search_header_contains(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search)
1139 {
1140         return check_header(f, argc, argv, search, CAMEL_SEARCH_MATCH_CONTAINS);
1141 }
1142
1143 static ESExpResult *
1144 search_header_matches(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search)
1145 {
1146         return check_header(f, argc, argv, search, CAMEL_SEARCH_MATCH_EXACT);
1147 }
1148
1149 static ESExpResult *
1150 search_header_starts_with (struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search)
1151 {
1152         return check_header(f, argc, argv, search, CAMEL_SEARCH_MATCH_STARTS);
1153 }
1154
1155 static ESExpResult *
1156 search_header_ends_with (struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search)
1157 {
1158         return check_header(f, argc, argv, search, CAMEL_SEARCH_MATCH_ENDS);
1159 }
1160
1161 static ESExpResult *
1162 search_header_exists (struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search)
1163 {
1164         ESExpResult *r;
1165
1166         r(printf ("executing header-exists\n"));
1167
1168         if (search->current) {
1169                 r = e_sexp_result_new(f, ESEXP_RES_BOOL);
1170                 if (argc == 1 && argv[0]->type == ESEXP_RES_STRING)
1171                         r->value.bool = camel_medium_get_header(CAMEL_MEDIUM(search->current), argv[0]->value.string) != NULL;
1172
1173         } else {
1174                 r = e_sexp_result_new(f, ESEXP_RES_ARRAY_PTR);
1175                 r->value.ptrarray = g_ptr_array_new();
1176         }
1177
1178         return r;
1179 }
1180
1181 static ESExpResult *
1182 search_header_soundex (struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search)
1183 {
1184         return check_header (f, argc, argv, search, CAMEL_SEARCH_MATCH_SOUNDEX);
1185 }
1186
1187 static ESExpResult *
1188 search_header_regex (struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search)
1189 {
1190         ESExpResult *r;
1191         CamelMimeMessage *msg;
1192
1193         msg = get_current_message (search);
1194
1195         if (msg) {
1196                 regex_t pattern;
1197                 const char *contents;
1198
1199                 r = e_sexp_result_new (f, ESEXP_RES_BOOL);
1200
1201                 if (argc > 1 && argv[0]->type == ESEXP_RES_STRING
1202                     && (contents = camel_medium_get_header (CAMEL_MEDIUM (msg), argv[0]->value.string))
1203                     && camel_search_build_match_regex (&pattern, CAMEL_SEARCH_MATCH_REGEX|CAMEL_SEARCH_MATCH_ICASE, argc-1, argv+1, search->priv->ex) == 0) {
1204                         r->value.bool = regexec (&pattern, contents, 0, NULL, 0) == 0;
1205                         regfree (&pattern);
1206                 } else
1207                         r->value.bool = FALSE;
1208
1209                 camel_object_unref (msg);
1210         } else {
1211                 r = e_sexp_result_new (f, ESEXP_RES_ARRAY_PTR);
1212                 r->value.ptrarray = g_ptr_array_new();
1213         }
1214
1215         return r;
1216 }
1217
1218 static gchar *
1219 get_full_header (CamelMimeMessage *message)
1220 {
1221         CamelMimePart *mp = CAMEL_MIME_PART (message);
1222         GString *str = g_string_new ("");
1223         struct _camel_header_raw *h;
1224
1225         for (h = mp->headers; h; h = h->next) {
1226                 if (h->value != NULL) {
1227                         g_string_append (str, h->name);
1228                         if (isspace (h->value[0]))
1229                                 g_string_append (str, ":");
1230                         else
1231                                 g_string_append (str, ": ");
1232                         g_string_append (str, h->value);
1233                         g_string_append_c (str, '\n');
1234                 }
1235         }
1236
1237         return g_string_free (str, FALSE);
1238 }
1239
1240 static ESExpResult *
1241 search_header_full_regex (struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search)
1242 {
1243         ESExpResult *r;
1244         CamelMimeMessage *msg;
1245
1246         msg = get_current_message (search);
1247
1248         if (msg) {
1249                 regex_t pattern;
1250
1251                 r = e_sexp_result_new (f, ESEXP_RES_BOOL);
1252
1253                 if (camel_search_build_match_regex (&pattern, CAMEL_SEARCH_MATCH_REGEX|CAMEL_SEARCH_MATCH_ICASE|CAMEL_SEARCH_MATCH_NEWLINE, argc, argv, search->priv->ex) == 0) {
1254                         char *contents;
1255
1256                         contents = get_full_header (msg);
1257                         r->value.bool = regexec (&pattern, contents, 0, NULL, 0) == 0;
1258
1259                         g_free (contents);
1260                         regfree (&pattern);
1261                 } else
1262                         r->value.bool = FALSE;
1263
1264                 camel_object_unref (msg);
1265         } else {
1266                 r = e_sexp_result_new (f, ESEXP_RES_ARRAY_PTR);
1267                 r->value.ptrarray = g_ptr_array_new();
1268         }
1269
1270         return r;
1271 }
1272
1273 /* this is just to OR results together */
1274 struct IterData {
1275         int count;
1276         GPtrArray *uids;
1277 };
1278
1279 /* or, store all unique values */
1280 static void
1281 htor(char *key, int value, struct IterData *iter_data)
1282 {
1283         g_ptr_array_add(iter_data->uids, key);
1284 }
1285
1286 /* and, only store duplicates */
1287 static void
1288 htand(char *key, int value, struct IterData *iter_data)
1289 {
1290         if (value == iter_data->count)
1291                 g_ptr_array_add(iter_data->uids, key);
1292 }
1293
1294 static int
1295 match_message_index(CamelIndex *idx, const char *uid, const char *match, CamelException *ex)
1296 {
1297         CamelIndexCursor *wc, *nc;
1298         const char *word, *name;
1299         int truth = FALSE;
1300
1301         wc = camel_index_words(idx);
1302         if (wc) {
1303                 while (!truth && (word = camel_index_cursor_next(wc))) {
1304                         if (camel_ustrstrcase(word,match) != NULL) {
1305                                 /* perf: could have the wc cursor return the name cursor */
1306                                 nc = camel_index_find(idx, word);
1307                                 if (nc) {
1308                                         while (!truth && (name = camel_index_cursor_next(nc)))
1309                                                 truth = strcmp(name, uid) == 0;
1310                                         camel_object_unref((CamelObject *)nc);
1311                                 }
1312                         }
1313                 }
1314                 camel_object_unref((CamelObject *)wc);
1315         }
1316
1317         return truth;
1318 }
1319
1320 /*
1321  "one two" "three" "four five"
1322
1323   one and two
1324 or
1325   three
1326 or
1327   four and five
1328 */
1329
1330 /* returns messages which contain all words listed in words */
1331 static GPtrArray *
1332 match_words_index(CamelFolderSearch *search, struct _camel_search_words *words, CamelException *ex)
1333 {
1334         GPtrArray *result = g_ptr_array_new();
1335         GHashTable *ht = g_hash_table_new(g_str_hash, g_str_equal);
1336         struct IterData lambdafoo;
1337         CamelIndexCursor *wc, *nc;
1338         const char *word, *name;
1339         int i;
1340
1341         /* we can have a maximum of 32 words, as we use it as the AND mask */
1342
1343         wc = camel_index_words(search->body_index);
1344         if (wc) {
1345                 while ((word = camel_index_cursor_next(wc))) {
1346                         for (i=0;i<words->len;i++) {
1347                                 if (camel_ustrstrcase(word, words->words[i]->word) != NULL) {
1348                                         /* perf: could have the wc cursor return the name cursor */
1349                                         nc = camel_index_find(search->body_index, word);
1350                                         if (nc) {
1351                                                 while ((name = camel_index_cursor_next(nc))) {
1352                                                                 int mask;
1353
1354                                                                 mask = (GPOINTER_TO_INT(g_hash_table_lookup(ht, name))) | (1<<i);
1355                                                                 g_hash_table_insert(ht, (char *) camel_pstring_peek(name), GINT_TO_POINTER(mask));
1356                                                 }
1357                                                 camel_object_unref((CamelObject *)nc);
1358                                         }
1359                                 }
1360                         }
1361                 }
1362                 camel_object_unref((CamelObject *)wc);
1363
1364                 lambdafoo.uids = result;
1365                 lambdafoo.count = (1<<words->len) - 1;
1366                 g_hash_table_foreach(ht, (GHFunc)htand, &lambdafoo);
1367                 g_hash_table_destroy(ht);
1368         }
1369
1370         return result;
1371 }
1372
1373 static gboolean
1374 match_words_1message (CamelDataWrapper *object, struct _camel_search_words *words, guint32 *mask)
1375 {
1376         CamelDataWrapper *containee;
1377         int truth = FALSE;
1378         int parts, i;
1379
1380         containee = camel_medium_get_content_object (CAMEL_MEDIUM (object));
1381
1382         if (containee == NULL)
1383                 return FALSE;
1384
1385         /* using the object types is more accurate than using the mime/types */
1386         if (CAMEL_IS_MULTIPART (containee)) {
1387                 parts = camel_multipart_get_number (CAMEL_MULTIPART (containee));
1388                 for (i = 0; i < parts && truth == FALSE; i++) {
1389                         CamelDataWrapper *part = (CamelDataWrapper *)camel_multipart_get_part (CAMEL_MULTIPART (containee), i);
1390                         if (part)
1391                                 truth = match_words_1message(part, words, mask);
1392                 }
1393         } else if (CAMEL_IS_MIME_MESSAGE (containee)) {
1394                 /* for messages we only look at its contents */
1395                 truth = match_words_1message((CamelDataWrapper *)containee, words, mask);
1396         } else if (camel_content_type_is(CAMEL_DATA_WRAPPER (containee)->mime_type, "text", "*")) {
1397                 /* for all other text parts, we look inside, otherwise we dont care */
1398                 CamelStreamMem *mem = (CamelStreamMem *)camel_stream_mem_new ();
1399
1400                 /* FIXME: The match should be part of a stream op */
1401                 camel_data_wrapper_decode_to_stream (containee, CAMEL_STREAM (mem));
1402                 camel_stream_write (CAMEL_STREAM (mem), "", 1);
1403                 for (i=0;i<words->len;i++) {
1404                         /* FIXME: This is horridly slow, and should use a real search algorithm */
1405                         if (camel_ustrstrcase((const char *) mem->buffer->data, words->words[i]->word) != NULL) {
1406                                 *mask |= (1<<i);
1407                                 /* shortcut a match */
1408                                 if (*mask == (1<<(words->len))-1)
1409                                         return TRUE;
1410                         }
1411                 }
1412
1413                 camel_object_unref (mem);
1414         }
1415
1416         return truth;
1417 }
1418
1419 static gboolean
1420 match_words_message(CamelFolder *folder, const char *uid, struct _camel_search_words *words, CamelException *ex)
1421 {
1422         guint32 mask;
1423         CamelMimeMessage *msg;
1424         CamelException x = CAMEL_EXCEPTION_INITIALISER;
1425         int truth;
1426
1427         msg = camel_folder_get_message(folder, uid, &x);
1428         if (msg) {
1429                 mask = 0;
1430                 truth = match_words_1message((CamelDataWrapper *)msg, words, &mask);
1431                 camel_object_unref((CamelObject *)msg);
1432         } else {
1433                 camel_exception_clear(&x);
1434                 truth = FALSE;
1435         }
1436
1437         return truth;
1438 }
1439
1440 static GPtrArray *
1441 match_words_messages(CamelFolderSearch *search, struct _camel_search_words *words, CamelException *ex)
1442 {
1443         int i;
1444         GPtrArray *matches = g_ptr_array_new();
1445
1446         if (search->body_index) {
1447                 GPtrArray *indexed;
1448                 struct _camel_search_words *simple;
1449
1450                 simple = camel_search_words_simple(words);
1451                 indexed = match_words_index(search, simple, ex);
1452                 camel_search_words_free(simple);
1453
1454                 for (i=0;i<indexed->len;i++) {
1455                         const char *uid = g_ptr_array_index(indexed, i);
1456
1457                         if (match_words_message(search->folder, uid, words, ex))
1458                                 g_ptr_array_add(matches, (char *)uid);
1459                 }
1460
1461                 g_ptr_array_free(indexed, TRUE);
1462         } else {
1463                 GPtrArray *v = search->summary_set?search->summary_set:search->summary;
1464
1465                 for (i=0;i<v->len;i++) {
1466                         char *uid  = g_ptr_array_index(v, i);
1467
1468                         if (match_words_message(search->folder, uid, words, ex))
1469                                 g_ptr_array_add(matches, (char *)uid);
1470                 }
1471         }
1472
1473         return matches;
1474 }
1475
1476 static ESExpResult *
1477 search_body_contains(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search)
1478 {
1479         int i, j;
1480         CamelException *ex = search->priv->ex;
1481         struct _camel_search_words *words;
1482         ESExpResult *r;
1483         struct IterData lambdafoo;
1484
1485         if (search->current) {
1486                 int truth = FALSE;
1487
1488                 if (argc == 1 && argv[0]->value.string[0] == 0) {
1489                         truth = TRUE;
1490                 } else {
1491                         for (i=0;i<argc && !truth;i++) {
1492                                 if (argv[i]->type == ESEXP_RES_STRING) {
1493                                         words = camel_search_words_split((const unsigned char *) argv[i]->value.string);
1494                                         truth = TRUE;
1495                                         if ((words->type & CAMEL_SEARCH_WORD_COMPLEX) == 0 && search->body_index) {
1496                                                 for (j=0;j<words->len && truth;j++)
1497                                                         truth = match_message_index(search->body_index, camel_message_info_uid(search->current), words->words[j]->word, ex);
1498                                         } else {
1499                                                 /* TODO: cache current message incase of multiple body search terms */
1500                                                 truth = match_words_message(search->folder, camel_message_info_uid(search->current), words, ex);
1501                                         }
1502                                         camel_search_words_free(words);
1503                                 }
1504                         }
1505                 }
1506                 r = e_sexp_result_new(f, ESEXP_RES_BOOL);
1507                 r->value.bool = truth;
1508         } else {
1509                 r = e_sexp_result_new(f, ESEXP_RES_ARRAY_PTR);
1510                 r->value.ptrarray = g_ptr_array_new();
1511
1512                 if (argc == 1 && argv[0]->value.string[0] == 0) {
1513                         GPtrArray *v = search->summary_set?search->summary_set:search->summary;
1514
1515                         for (i=0;i<v->len;i++) {
1516                                 char *uid = g_ptr_array_index(v, i);
1517
1518                                 g_ptr_array_add(r->value.ptrarray, uid);
1519                         }
1520                 } else {
1521                         GHashTable *ht = g_hash_table_new(g_str_hash, g_str_equal);
1522                         GPtrArray *matches;
1523
1524                         for (i=0;i<argc;i++) {
1525                                 if (argv[i]->type == ESEXP_RES_STRING) {
1526                                         words = camel_search_words_split((const unsigned char *) argv[i]->value.string);
1527                                         if ((words->type & CAMEL_SEARCH_WORD_COMPLEX) == 0 && search->body_index) {
1528                                                 matches = match_words_index(search, words, ex);
1529                                         } else {
1530                                                 matches = match_words_messages(search, words, ex);
1531                                         }
1532                                         for (j=0;j<matches->len;j++) {
1533                                                 g_hash_table_insert(ht, matches->pdata[j], matches->pdata[j]);
1534                                         }
1535                                         g_ptr_array_free(matches, TRUE);
1536                                         camel_search_words_free(words);
1537                                 }
1538                         }
1539                         lambdafoo.uids = r->value.ptrarray;
1540                         g_hash_table_foreach(ht, (GHFunc)htor, &lambdafoo);
1541                         g_hash_table_destroy(ht);
1542                 }
1543         }
1544
1545         return r;
1546 }
1547
1548 static ESExpResult *
1549 search_body_regex (struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search)
1550 {
1551         ESExpResult *r;
1552         CamelMimeMessage *msg = get_current_message (search);
1553
1554         if (msg) {
1555                 regex_t pattern;
1556
1557                 r = e_sexp_result_new (f, ESEXP_RES_BOOL);
1558
1559                 if (camel_search_build_match_regex (&pattern, CAMEL_SEARCH_MATCH_ICASE|CAMEL_SEARCH_MATCH_REGEX|CAMEL_SEARCH_MATCH_NEWLINE, argc, argv, search->priv->ex) == 0) {
1560                         r->value.bool = camel_search_message_body_contains ((CamelDataWrapper *) msg, &pattern);
1561                         regfree (&pattern);
1562                 } else
1563                         r->value.bool = FALSE;
1564
1565                 camel_object_unref (msg);
1566         } else {
1567                 regex_t pattern;
1568
1569                 r = e_sexp_result_new(f, ESEXP_RES_ARRAY_PTR);
1570                 r->value.ptrarray = g_ptr_array_new ();
1571
1572                 if (camel_search_build_match_regex (&pattern, CAMEL_SEARCH_MATCH_ICASE|CAMEL_SEARCH_MATCH_REGEX|CAMEL_SEARCH_MATCH_NEWLINE, argc, argv, search->priv->ex) == 0) {
1573                         int i;
1574                         GPtrArray *v = search->summary_set?search->summary_set:search->summary;
1575                         CamelException x = CAMEL_EXCEPTION_INITIALISER;
1576                         CamelMimeMessage *message;
1577
1578                         for (i = 0; i < v->len; i++) {
1579                                 char *uid = g_ptr_array_index(v, i);
1580
1581                                 message = camel_folder_get_message (search->folder, uid, &x);
1582                                 if (message) {
1583                                         if (camel_search_message_body_contains ((CamelDataWrapper *) message, &pattern)) {
1584                                                 g_ptr_array_add (r->value.ptrarray, uid);
1585                                         }
1586
1587                                         camel_object_unref ((CamelObject *)message);
1588                                 } else {
1589                                         camel_exception_clear (&x);
1590                                 }
1591                         }
1592
1593                         regfree (&pattern);
1594                 }
1595         }
1596
1597         return r;
1598 }
1599
1600 static ESExpResult *
1601 search_user_flag(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search)
1602 {
1603         ESExpResult *r;
1604         int i;
1605
1606         r(printf("executing user-flag\n"));
1607
1608         /* are we inside a match-all? */
1609         if (search->current) {
1610                 int truth = FALSE;
1611                 /* performs an OR of all words */
1612                 for (i=0;i<argc && !truth;i++) {
1613                         if (argv[i]->type == ESEXP_RES_STRING
1614                             && camel_message_info_user_flag(search->current, argv[i]->value.string)) {
1615                                 truth = TRUE;
1616                                 break;
1617                         }
1618                 }
1619                 r = e_sexp_result_new(f, ESEXP_RES_BOOL);
1620                 r->value.bool = truth;
1621         } else {
1622                 r = e_sexp_result_new(f, ESEXP_RES_ARRAY_PTR);
1623                 r->value.ptrarray = g_ptr_array_new();
1624         }
1625
1626         return r;
1627 }
1628
1629 static ESExpResult *
1630 search_system_flag (struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search)
1631 {
1632         ESExpResult *r;
1633
1634         r(printf ("executing system-flag\n"));
1635
1636         if (search->current) {
1637                 gboolean truth = FALSE;
1638
1639                 if (argc == 1)
1640                         truth = camel_system_flag_get (camel_message_info_flags(search->current), argv[0]->value.string);
1641
1642                 r = e_sexp_result_new(f, ESEXP_RES_BOOL);
1643                 r->value.bool = truth;
1644         } else {
1645                 r = e_sexp_result_new(f, ESEXP_RES_ARRAY_PTR);
1646                 r->value.ptrarray = g_ptr_array_new ();
1647         }
1648
1649         return r;
1650 }
1651
1652 static ESExpResult *
1653 search_user_tag(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search)
1654 {
1655         const char *value = NULL;
1656         ESExpResult *r;
1657
1658         r(printf("executing user-tag\n"));
1659
1660         if (search->current && argc == 1)
1661                 value = camel_message_info_user_tag(search->current, argv[0]->value.string);
1662
1663         r = e_sexp_result_new(f, ESEXP_RES_STRING);
1664         r->value.string = g_strdup (value ? value : "");
1665
1666         return r;
1667 }
1668
1669 static ESExpResult *
1670 search_get_sent_date(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *s)
1671 {
1672         ESExpResult *r;
1673
1674         r(printf("executing get-sent-date\n"));
1675
1676         /* are we inside a match-all? */
1677         if (s->current) {
1678                 r = e_sexp_result_new(f, ESEXP_RES_INT);
1679
1680                 r->value.number = camel_message_info_date_sent(s->current);
1681         } else {
1682                 r = e_sexp_result_new(f, ESEXP_RES_ARRAY_PTR);
1683                 r->value.ptrarray = g_ptr_array_new ();
1684         }
1685
1686         return r;
1687 }
1688
1689 static ESExpResult *
1690 search_get_received_date(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *s)
1691 {
1692         ESExpResult *r;
1693
1694         r(printf("executing get-received-date\n"));
1695
1696         /* are we inside a match-all? */
1697         if (s->current) {
1698                 r = e_sexp_result_new(f, ESEXP_RES_INT);
1699
1700                 r->value.number = camel_message_info_date_received(s->current);
1701         } else {
1702                 r = e_sexp_result_new(f, ESEXP_RES_ARRAY_PTR);
1703                 r->value.ptrarray = g_ptr_array_new ();
1704         }
1705
1706         return r;
1707 }
1708
1709 static ESExpResult *
1710 search_get_current_date(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *s)
1711 {
1712         ESExpResult *r;
1713
1714         r(printf("executing get-current-date\n"));
1715
1716         r = e_sexp_result_new(f, ESEXP_RES_INT);
1717         r->value.number = time (NULL);
1718         return r;
1719 }
1720
1721 static ESExpResult *
1722 search_get_size (struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *s)
1723 {
1724         ESExpResult *r;
1725
1726         r(printf("executing get-size\n"));
1727
1728         /* are we inside a match-all? */
1729         if (s->current) {
1730                 r = e_sexp_result_new (f, ESEXP_RES_INT);
1731                 r->value.number = camel_message_info_size(s->current) / 1024;
1732         } else {
1733                 r = e_sexp_result_new (f, ESEXP_RES_ARRAY_PTR);
1734                 r->value.ptrarray = g_ptr_array_new ();
1735         }
1736
1737         return r;
1738 }
1739
1740 static ESExpResult *
1741 search_uid(struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search)
1742 {
1743         ESExpResult *r;
1744         int i;
1745
1746         r(printf("executing uid\n"));
1747
1748         /* are we inside a match-all? */
1749         if (search->current) {
1750                 int truth = FALSE;
1751                 const char *uid = camel_message_info_uid(search->current);
1752
1753                 /* performs an OR of all words */
1754                 for (i=0;i<argc && !truth;i++) {
1755                         if (argv[i]->type == ESEXP_RES_STRING
1756                             && !strcmp(uid, argv[i]->value.string)) {
1757                                 truth = TRUE;
1758                                 break;
1759                         }
1760                 }
1761                 r = e_sexp_result_new(f, ESEXP_RES_BOOL);
1762                 r->value.bool = truth;
1763         } else {
1764                 r = e_sexp_result_new(f, ESEXP_RES_ARRAY_PTR);
1765                 r->value.ptrarray = g_ptr_array_new();
1766                 for (i=0;i<argc;i++) {
1767                         if (argv[i]->type == ESEXP_RES_STRING)
1768                                 g_ptr_array_add(r->value.ptrarray, argv[i]->value.string);
1769                 }
1770         }
1771
1772         return r;
1773 }
1774
1775 static int
1776 read_uid_callback (void * ref, int ncol, char ** cols, char **name)
1777 {
1778         GPtrArray *matches;
1779
1780         matches = (GPtrArray *) ref;
1781
1782         g_ptr_array_add (matches, (gpointer) camel_pstring_strdup (cols [0]));
1783         return 0;
1784 }
1785
1786 static ESExpResult *
1787 search_message_location (struct _ESExp *f, int argc, struct _ESExpResult **argv, CamelFolderSearch *search)
1788 {
1789         ESExpResult *r;
1790         gboolean same = FALSE;
1791
1792         if (argc == 1 && argv[0]->type == ESEXP_RES_STRING) {
1793                 if (argv[0]->value.string && search->folder && search->folder->parent_store && camel_folder_get_full_name (search->folder)) {
1794                         CamelFolderInfo *fi = camel_store_get_folder_info (search->folder->parent_store, camel_folder_get_full_name (search->folder), 0, NULL);
1795                         if (fi) {
1796                                 same = g_str_equal (fi->uri ? fi->uri : "", argv[0]->value.string);
1797
1798                                 camel_store_free_folder_info (search->folder->parent_store, fi);
1799                         }
1800                 }
1801         }
1802
1803         if (search->current) {
1804                 r = e_sexp_result_new (f, ESEXP_RES_BOOL);
1805                 r->value.bool = same ? TRUE : FALSE;
1806         } else {
1807                 r = e_sexp_result_new (f, ESEXP_RES_ARRAY_PTR);
1808                 r->value.ptrarray = g_ptr_array_new ();
1809
1810                 if (same) {
1811                         /* all matches */
1812                         int i;
1813                         GPtrArray *v = search->summary_set ? search->summary_set : search->summary;
1814
1815                         for (i = 0; i < v->len; i++) {
1816                                 char *uid = g_ptr_array_index (v, i);
1817
1818                                 g_ptr_array_add (r->value.ptrarray, uid);
1819                         }
1820                 }
1821         }
1822
1823         return r;
1824 }