1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644
|
/* libimap library.
* Copyright (C) 2003-2008 Pawel Salek.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2, or (at your option)
* any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
* 02111-1307, USA.
*/
#define _POSIX_C_SOURCE 199506L
#define _XOPEN_SOURCE 500
#include <string.h>
#include <glib.h>
#include <time.h>
#include "siobuf.h"
#include "imap_search.h"
#include "imap_private.h"
typedef enum {
IMSE_NOT, IMSE_OR, IMSE_FLAG, IMSE_STRING, IMSE_DATE, IMSE_SIZE,
IMSE_SEQUENCE
} ImapSearchKeyType;
struct ImapSearchKey_ {
struct ImapSearchKey_ *next; /* message must match all the conditions
* on the list. */
ImapSearchKeyType type;
union {
/* IMSE_NOT */
struct ImapSearchKey_ *not;
/* IMSE_OR */
struct { struct ImapSearchKey_ *l, *r; } or;
/* IMSE_FLAG */
struct {
ImapMsgFlag sys_flag; /* only system flags supported ATM */
} flag;
/* IMSE_STRING */
struct {
char *s, *usr; /* string and user header if any */
ImapSearchHeader hdr;
} string;
/* IMSE_DATE: FIXME */
struct { time_t dt; unsigned internal_date:1; int range:2; } date;
/* IMSE_SIZE */
size_t size;
/* IMSE_SEQENCE */
struct { gchar *string; int uid; } seq;
} d;
unsigned negated:1;
};
ImapSearchKey*
imap_search_key_new_not(unsigned negated, ImapSearchKey *list)
{
ImapSearchKey *s = g_new(ImapSearchKey,1);
s->next = NULL;
s->type = IMSE_NOT;
s->negated = negated; /* Usually true */
s->d.not = list;
return s;
}
ImapSearchKey*
imap_search_key_new_or(unsigned negated, ImapSearchKey *a, ImapSearchKey *b)
{
ImapSearchKey *s = g_new(ImapSearchKey,1);
s->next = NULL;
s->type = IMSE_OR;
s->negated = negated;
s->d.or.l = a;
s->d.or.r = b;
return s;
}
ImapSearchKey*
imap_search_key_new_flag(unsigned negated, ImapMsgFlag flg)
{
ImapSearchKey *s = g_new(ImapSearchKey,1);
s->next = NULL;
s->type = IMSE_FLAG;
s->negated = negated;
s->d.flag.sys_flag = flg;
return s;
}
/* imap_search_key_new_string sets the string. It makes sure that
the user header - if specified - is sane.
*/
ImapSearchKey*
imap_search_key_new_string(unsigned negated, ImapSearchHeader hdr,
const char *string, const char *user_hdr)
{
ImapSearchKey *s = g_new(ImapSearchKey,1);
int i;
s->next = NULL;
s->type = IMSE_STRING;
s->negated = negated;
s->d.string.hdr = hdr;
s->d.string.usr = (user_hdr && *user_hdr) ? g_strdup(user_hdr) : NULL;
s->d.string.s = g_strdup(string);
if(s->d.string.usr)
for(i=strlen(s->d.string.usr)-1; i>=0; i--)
if(!IS_ATOM_CHAR(s->d.string.usr[i])) s->d.string.usr[i] = '_';
return s;
}
ImapSearchKey*
imap_search_key_new_size_greater(unsigned negated, size_t sz)
{
ImapSearchKey *s = g_new(ImapSearchKey,1);
s->next = NULL;
s->type = IMSE_SIZE;
s->negated = negated;
s->d.size = sz;
return s;
}
/* imap_search_key_new_date() creates new term that matches earlier or
later dates. It can match both internal date as well as sent
date. */
ImapSearchKey*
imap_search_key_new_date(ImapSearchDateRange range, int internal, time_t tm)
{
ImapSearchKey *s = g_new(ImapSearchKey,1);
s->next = NULL;
s->type = IMSE_DATE;
s->negated = FALSE; /* this field is ignored for date */
s->d.date.dt = tm;
s->d.date.internal_date = internal;
s->d.date.range = range;
return s;
}
ImapSearchKey*
imap_search_key_new_range(unsigned negated, int uid,
unsigned lo, unsigned hi)
{
if(lo<=hi) {
ImapSearchKey *s = g_new(ImapSearchKey,1);
s->next = NULL;
s->type = IMSE_SEQUENCE;
s->negated = negated;
s->d.seq.uid = uid;
s->d.seq.string = lo<hi
? g_strdup_printf("%u:%u", lo, hi)
: g_strdup_printf("%u", lo);
return s;
} else { /* always false */
return NULL;
}
}
ImapSearchKey*
imap_search_key_new_set(unsigned negated, int uid, int cnt, unsigned *seqnos)
{
if(cnt>0) {
ImapSearchKey *s = g_new(ImapSearchKey,1);
s->next = NULL;
s->type = IMSE_SEQUENCE;
s->negated = negated;
s->d.seq.uid = uid;
s->d.seq.string = imap_coalesce_set(cnt, seqnos);
return s;
} else { /* always false */
return NULL;
}
}
void
imap_search_key_free(ImapSearchKey *s)
{
while(s) {
ImapSearchKey *t = s;
switch(s->type) {
case IMSE_NOT:
imap_search_key_free(s->d.not);
break;
case IMSE_OR:
imap_search_key_free(s->d.or.l);
imap_search_key_free(s->d.or.r);
break;
case IMSE_FLAG: break;
case IMSE_STRING:
g_free(s->d.string.usr);
g_free(s->d.string.s);
break;
case IMSE_DATE:
case IMSE_SIZE: break;
case IMSE_SEQUENCE:
g_free(s->d.seq.string);
break;
}
s = s->next;
g_free(t);
}
}
static gboolean
imap_search_checks_body(const ImapSearchKey *s)
{
while(s) {
switch(s->type) {
case IMSE_NOT: /* NOOP */ break;
case IMSE_OR:
if(imap_search_checks_body(s->d.or.l) ||
imap_search_checks_body(s->d.or.r))
return TRUE;
break;
case IMSE_FLAG: break;
case IMSE_STRING:
if(s->d.string.hdr == IMSE_S_BODY)
return TRUE;
case IMSE_DATE:
case IMSE_SIZE:
case IMSE_SEQUENCE:
break;
}
s = s->next;
}
return FALSE;
}
static gboolean
imap_search_checks(const ImapSearchKey *s, ImapSearchKeyType s_type)
{
while(s) {
switch(s->type) {
case IMSE_NOT: /* NOOP */ break;
case IMSE_OR:
if(imap_search_checks(s->d.or.l, s_type) ||
imap_search_checks(s->d.or.r, s_type))
return TRUE;
break;
default:
if(s->type == s_type)
return TRUE;
break;
}
s = s->next;
}
return FALSE;
}
void
imap_search_key_set_next(ImapSearchKey *list, ImapSearchKey *next)
{
if(list->next) g_warning("I may be loosing my tail now!\n");
list->next = next;
}
static void
imap_write_key_flag(ImapMboxHandle *handle, unsigned negated,
ImapMsgFlag flag)
{
const char *s;
if(negated) sio_write(handle->sio, "Un", 2);
switch(flag) {
default:
case IMSGF_SEEN: s = "seen"; break;
case IMSGF_ANSWERED: s = "answered"; break;
case IMSGF_FLAGGED: s = "flagged"; break;
case IMSGF_DELETED: s = "deleted"; break;
case IMSGF_DRAFT: s = "draft"; break;
case IMSGF_RECENT: s = "recent"; break;
}
sio_write(handle->sio, s, strlen(s));
}
static ImapResponse
imap_write_key_string(ImapMboxHandle *handle, ImapSearchKey *k,
unsigned cmdno, int use_literal)
{
const char *s;
g_return_val_if_fail(handle->state != IMHS_DISCONNECTED, IMR_BAD);
if(k->negated) sio_write(handle->sio, "Not ", 4);
switch(k->d.string.hdr) {
case IMSE_S_BCC: s= "Bcc"; break;
case IMSE_S_BODY: s= "Body"; break;
case IMSE_S_CC: s= "Cc"; break;
default: g_warning("Unknown header type!");
case IMSE_S_FROM: s= "From"; break;
case IMSE_S_SUBJECT: s= "Subject"; break;
case IMSE_S_TEXT: s= "Text"; break;
case IMSE_S_TO: s= "To"; break;
case IMSE_S_HEADER: s= "Header"; break;
}
sio_printf(handle->sio, "%s ", s);
if(k->d.string.usr) {
/* we checked on structure creation that the header does not contain
* spaces or 8-bit characters so we can write it simply... */
sio_write(handle->sio, k->d.string.usr, strlen(k->d.string.usr));
sio_write(handle->sio, " ", 1);
}
/* Here comes the difficult part: writing the string. If the server
does not support LITERAL+, we have to either use quoting or use
synchronizing literals which are somewhat painful. That's the
life! */
if(use_literal)
sio_printf(handle->sio, "{%u+}\r\n%s",
(unsigned)strlen(k->d.string.s), k->d.string.s);
else { /* No literal+ suppport, do it the old way */
for (s = k->d.string.s; *s && (*s & 0x80) == 0; s++)
;
if(*s & 0x80) { /* use synchronising literals */
int c;
ImapResponse rc;
unsigned len = strlen(k->d.string.s);
sio_printf(handle->sio, "{%u}\r\n", len);
imap_handle_flush(handle);
do
rc = imap_cmd_step(handle, cmdno);
while(rc == IMR_UNTAGGED);
if (rc != IMR_RESPOND) {
fprintf(stderr, "%s(): unexpected response:\n", __FUNCTION__);
return rc;
}
/* consume to the end of line */
while( (c=sio_getc(handle->sio)) != -1 && c != '\n')
;
if(c == -1) return IMR_SEVERED;
sio_write(handle->sio, k->d.string.s, len);
} else { /* quoting is sufficient */
sio_write(handle->sio, "\"", 1);
for(s=k->d.string.s; *s; s++) {
if(*s == '"') sio_write(handle->sio, "\\\"", 2);
else if(*s == '"') sio_write(handle->sio, "\\\\", 2);
else sio_write(handle->sio, s, 1);
}
sio_write(handle->sio, "\"", 1);
}
}
return IMR_OK;
}
static void
imap_write_key_date(ImapMboxHandle *handle, ImapSearchDateRange range,
gboolean internal, time_t tm)
{
static const char *month[] =
{ "Jan", "Feb", "Mar", "Apr", "May",
"Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec" };
#if GLIB_CHECK_VERSION(2,10,0)
GDate date;
#else
struct tm date;
#endif
if(!internal) sio_write(handle->sio, "SENT", 4);
switch(range) {
case IMSE_D_BEFORE : sio_write(handle->sio, "BEFORE ", 7); break;
case IMSE_D_ON : sio_write(handle->sio, "ON ", 3); break;
default: /* which is -2, the only remaining option */
case IMSE_D_SINCE : sio_write(handle->sio, "SINCE " , 6); break;
}
#if GLIB_CHECK_VERSION(2,10,0)
g_date_set_time_t(&date, tm);
sio_printf(handle->sio, "%02d-%s-%04d",
date.day, month[date.month - 1], date.year);
#else
localtime_r(&tm, &date);
sio_printf(handle->sio, "%02d-%s-%04d",
date.tm_mday, month[date.tm_mon], date.tm_year + 1900);
#endif
}
static void
imap_write_key_size(ImapMboxHandle *handle, gboolean negate, size_t size)
{
if(negate) sio_printf(handle->sio, "NOT LARGER %u", (unsigned)size);
else sio_printf(handle->sio, "LARGER %u", (unsigned)size);
}
static void
imap_write_key_sequence(ImapMboxHandle *handle, gboolean negate,
gboolean uid, const gchar *seq)
{
if(negate) sio_write(handle->sio, "NOT ", 4);
if(uid) sio_write(handle->sio, "UID ", 4);
sio_write(handle->sio, seq, strlen(seq));
}
/* private. */
ImapResponse
imap_write_key(ImapMboxHandle *handle, ImapSearchKey *s, unsigned cmdno,
int use_literal)
{
ImapResponse rc;
g_return_val_if_fail(handle->state != IMHS_DISCONNECTED, IMR_BAD);
while(s) {
switch(s->type) {
case IMSE_NOT:
if(s->negated) sio_write(handle->sio, "Not (", 5);
else sio_write(handle->sio, "(", 1);
rc = imap_write_key(handle, s->d.not, cmdno, use_literal);
if(rc != IMR_OK) return rc;
sio_write(handle->sio, ")", 1);
break;
case IMSE_OR:
if(s->negated) sio_write(handle->sio, "Not Or ", 7);
else sio_write(handle->sio, "Or ", 3);
if(s->d.or.l->next) sio_write(handle->sio, "(", 1);
rc = imap_write_key(handle, s->d.or.l, cmdno, use_literal);
if(rc != IMR_OK) return rc;
if(s->d.or.l->next) sio_write(handle->sio, ") ", 2);
else sio_write(handle->sio, " ", 1);
if(s->d.or.r->next) sio_write(handle->sio, "(", 1);
rc = imap_write_key(handle, s->d.or.r, cmdno, use_literal);
if(rc != IMR_OK) return rc;
if(s->d.or.r->next) sio_write(handle->sio, ")", 1);
break;
case IMSE_FLAG:
imap_write_key_flag(handle, s->negated, s->d.flag.sys_flag);
break;
case IMSE_STRING:
rc = imap_write_key_string(handle, s, cmdno, use_literal);
if(rc != IMR_OK) return rc;
break;
case IMSE_DATE:
imap_write_key_date(handle, s->d.date.range, s->d.date.internal_date,
s->d.date.dt);
break;
case IMSE_SIZE:
imap_write_key_size(handle, s->negated, s->d.size);
break;
case IMSE_SEQUENCE:
imap_write_key_sequence(handle, s->negated,
s->d.seq.uid, s->d.seq.string);
break;
}
s = s->next;
if(s) sio_write(handle->sio, " ", 1);
}
return IMR_OK;
}
static gboolean
execute_flag_only_search(ImapMboxHandle *h, ImapSearchKey *s,
ImapSearchCb cb, void *cb_arg,
ImapResponse *rc);
/** Searches the mailbox and calls the specified callback for all
messages matching the search key. It tries not to search too many
messages at once to avoid session timeouts. The limits on batch
lengths are empirical.
There is one known problem that is due to the fact that we do not
separate between easy (flag) and expensive (body) searches: the
search will be repeated on every flag change. What we (but also
IMAP servers!) could do is to execute the quick search first to
get an idea which messages should be searched for the expensive
parts. This also coincides with splitting searches into mutable
(flags) and immutable terms (anything else).
*/
ImapResponse
imap_search_exec_unlocked(ImapMboxHandle *h, gboolean uid,
ImapSearchKey *s, ImapSearchCb cb, void *cb_arg)
{
static const unsigned BODY_TO_SEARCH_AT_ONCE = 500000;
static const unsigned HEADER_TO_SEARCH_AT_ONCE = 2000;
static const unsigned UIDS_TO_SEARCH_AT_ONCE = 100000;
int can_do_literals =
imap_mbox_handle_can_do(h, IMCAP_LITERAL);
/* We cannot use ESEARCH for UID searches easily. See the imapext
thread starting at:
http://www.imc.org/ietf-imapext/mail-archive/msg03946.html
*/
int can_do_esearch = !uid && imap_mbox_handle_can_do(h, IMCAP_ESEARCH);
ImapResponse ir = IMR_OK;
ImapCmdTag tag;
ImapSearchCb ocb;
void *oarg;
unsigned cmdno, lo, delta;
const gchar *cmd_string;
gboolean split;
IMAP_REQUIRED_STATE1(h, IMHS_SELECTED, IMR_BAD);
if(!s)
return IMR_BAD;
if(execute_flag_only_search(h, s, cb, cb_arg, &ir))
return ir;
if(can_do_esearch)
cmd_string = "Search return (all)";
else
cmd_string = "Search";
ocb = h->search_cb; h->search_cb = (ImapSearchCb)cb;
oarg = h->search_arg; h->search_arg = cb_arg;
if (!imap_handle_idle_disable(h)) return IMR_SEVERED;
split = imap_search_checks(s, IMSE_SEQUENCE);
if(split) {
if(imap_search_checks_body(s)) {
delta = BODY_TO_SEARCH_AT_ONCE;
} else if(imap_search_checks(s, IMSE_STRING)) {
delta = HEADER_TO_SEARCH_AT_ONCE;
} else {
delta = UIDS_TO_SEARCH_AT_ONCE;
}
/* This loop may take long time to execute. Consider providing some
feedback to the user... */
for(lo = 1; ir == IMR_OK && lo<=h->exists; lo += delta) {
unsigned hi = lo + delta-1;
if(hi>h->exists)
hi = h->exists;
cmdno = imap_make_tag(tag);
sio_printf(h->sio, "%s%s %s %u:%u ", tag, uid ? " UID" : "", cmd_string,
lo, hi);
if( (ir=imap_write_key(h, s, cmdno, can_do_literals)) == IMR_OK) {
sio_write(h->sio, "\r\n", 2);
imap_handle_flush(h);
do {
ir = imap_cmd_step(h, cmdno);
} while(ir == IMR_UNTAGGED);
} else break;
}
} else { /* no split */
cmdno = imap_make_tag(tag);
sio_printf(h->sio, "%s%s %s ", tag, uid ? " UID" : "", cmd_string);
if( (ir=imap_write_key(h, s, cmdno, can_do_literals)) == IMR_OK) {
sio_write(h->sio, "\r\n", 2);
imap_handle_flush(h);
do {
ir = imap_cmd_step(h, cmdno);
} while(ir == IMR_UNTAGGED);
}
}
h->search_cb = ocb;
h->search_arg = oarg;
imap_handle_idle_enable(h, 30);
/* Set disconnected state here if necessary? */
return ir;
}
ImapResponse
imap_search_exec(ImapMboxHandle *h, gboolean uid,
ImapSearchKey *s, ImapSearchCb cb, void *cb_arg)
{
ImapResponse rc;
HANDLE_LOCK(h);
rc = imap_search_exec_unlocked(h, uid, s, cb, cb_arg);
HANDLE_UNLOCK(h);
return rc;
}
/* == optimized branch for flag-only searches.. Since we know most of
the flags most of the time, there is no point in repeating some
flag-only searches over and over. We just run a search optimized
for exactly this kind of searches */
static gboolean
collect_needed_flags(ImapSearchKey *s, ImapMsgFlag *flag)
{
gboolean res;
switch(s->type) {
case IMSE_NOT:
res = collect_needed_flags(s->d.not, flag);
break;
case IMSE_OR:
res = collect_needed_flags(s->d.or.l, flag) &&
collect_needed_flags(s->d.or.r, flag);
break;
case IMSE_FLAG:
*flag |= s->d.flag.sys_flag; res = TRUE; break;
case IMSE_SEQUENCE:
if(s->d.seq.uid) /* we do not collect uids yet */
return FALSE;
default:
return FALSE;
}
if(res && s->next)
res = collect_needed_flags(s->next, flag);
return res;
}
static gboolean
search_key_matches(ImapSearchKey *s, ImapMsgFlag flag)
{
gboolean res;
switch(s->type) {
case IMSE_NOT:
res =
!search_key_matches(s->d.not, flag);
break;
case IMSE_OR:
res = (search_key_matches(s->d.or.l, flag) ||
search_key_matches(s->d.or.r, flag));
break;
case IMSE_FLAG:
res = (flag & s->d.flag.sys_flag);
break;
default:
return FALSE;
}
if(s->negated)
res = !res;
if(res && s->next)
res = search_key_matches(s->next, flag);
return res;
}
static gboolean
execute_flag_only_search(ImapMboxHandle *h, ImapSearchKey *s,
ImapSearchCb cb, void *cb_arg,
ImapResponse *rc)
{
ImapMsgFlag needed_flags = 0;
unsigned i;
if(!collect_needed_flags(s, &needed_flags))
return FALSE;
if( (*rc = imap_assure_needed_flags(h, needed_flags)) != IMR_OK)
return FALSE;
for(i=0; i<h->exists; i++) {
ImapFlagCache *f =
&g_array_index(h->flag_cache, ImapFlagCache, i);
if(search_key_matches(s, f->flag_values))
cb(h, i+1, cb_arg);
}
return TRUE;
}
|