2 * Copyright notice from original mutt:
3 * Copyright (C) 1996-2000 Michael R. Elkins <me@mutt.org>, and others
5 * This file is part of mutt-ng, see http://www.muttng.org/.
6 * It's licensed under the GNU General Public License,
7 * please see the file GPL in the top level source directory.
14 #include <lib-lib/mem.h>
33 #include "imap/imap.h"
43 #include "mutt_crypt.h"
45 static int eat_regexp (pattern_t * pat, BUFFER *, BUFFER *);
46 static int eat_date (pattern_t * pat, BUFFER *, BUFFER *);
47 static int eat_range (pattern_t * pat, BUFFER *, BUFFER *);
48 static int patmatch (const pattern_t* pat, const char* buf);
50 struct pattern_flags {
51 int tag; /* character used to represent this op */
52 int op; /* operation to perform */
54 int (*eat_arg) (pattern_t *, BUFFER *, BUFFER *);
57 'A', M_ALL, 0, NULL}, {
58 'b', M_BODY, M_FULL_MSG, eat_regexp}, {
59 'B', M_WHOLE_MSG, M_FULL_MSG, eat_regexp}, {
60 'c', M_CC, 0, eat_regexp}, {
61 'C', M_RECIPIENT, 0, eat_regexp}, {
62 'd', M_DATE, 0, eat_date}, {
63 'D', M_DELETED, 0, NULL}, {
64 'e', M_SENDER, 0, eat_regexp}, {
65 'E', M_EXPIRED, 0, NULL}, {
66 'f', M_FROM, 0, eat_regexp}, {
67 'F', M_FLAG, 0, NULL}, {
68 'g', M_CRYPT_SIGN, 0, NULL}, {
69 'G', M_CRYPT_ENCRYPT, 0, NULL}, {
70 'h', M_HEADER, M_FULL_MSG, eat_regexp}, {
71 'H', M_HORMEL, 0, eat_regexp}, {
72 'i', M_ID, 0, eat_regexp}, {
73 'k', M_PGP_KEY, 0, NULL}, {
74 'L', M_ADDRESS, 0, eat_regexp}, {
75 'l', M_LIST, 0, NULL}, {
76 'm', M_MESSAGE, 0, eat_range}, {
77 'M', M_MULTIPART, 0, NULL}, {
78 'n', M_SCORE, 0, eat_range}, {
79 'N', M_NEW, 0, NULL}, {
80 'O', M_OLD, 0, NULL}, {
81 'p', M_PERSONAL_RECIP, 0, NULL}, {
82 'P', M_PERSONAL_FROM, 0, NULL}, {
83 'Q', M_REPLIED, 0, NULL}, {
84 'R', M_READ, 0, NULL}, {
85 'r', M_DATE_RECEIVED, 0, eat_date}, {
86 's', M_SUBJECT, 0, eat_regexp}, {
87 'S', M_SUPERSEDED, 0, NULL}, {
88 'T', M_TAG, 0, NULL}, {
89 't', M_TO, 0, eat_regexp}, {
90 'U', M_UNREAD, 0, NULL}, {
91 'u', M_SUBSCRIBED_LIST, 0, NULL}, {
92 'v', M_COLLAPSED, 0, NULL}, {
93 'V', M_CRYPT_VERIFIED, 0, NULL},
96 'w', M_NEWSGROUPS, 0, eat_regexp},
99 'x', M_REFERENCE, 0, eat_regexp}, {
100 'X', M_MIMEATTACH, 0, eat_range}, {
101 'y', M_XLABEL, 0, eat_regexp}, {
102 'z', M_SIZE, 0, eat_range}, {
103 '=', M_DUPLICATED, 0, NULL}, {
104 '$', M_UNREFERENCED, 0, NULL}, {
105 '*', M_REALNAME, 0, NULL}, {
109 static pattern_t *SearchPattern = NULL; /* current search pattern */
110 static char LastSearch[STRING] = { 0 }; /* last pattern searched for */
111 static char LastSearchExpn[LONG_STRING] = { 0 }; /* expanded version of
114 #define M_MAXRANGE -1
116 /* constants for parse_date_range() */
117 #define M_PDR_NONE 0x0000
118 #define M_PDR_MINUS 0x0001
119 #define M_PDR_PLUS 0x0002
120 #define M_PDR_WINDOW 0x0004
121 #define M_PDR_ABSOLUTE 0x0008
122 #define M_PDR_DONE 0x0010
123 #define M_PDR_ERROR 0x0100
124 #define M_PDR_ERRORDONE (M_PDR_ERROR | M_PDR_DONE)
127 int mutt_getvaluebychar (char ch, struct mapping_t *table)
131 for (i = 0; table[i].name; i++) {
132 if (ch == table[i].name[0])
133 return table[i].value;
139 /* if no uppercase letters are given, do a case-insensitive search */
140 int mutt_which_case (const char *s)
143 if (isalpha ((unsigned char) *s) && isupper ((unsigned char) *s))
144 return 0; /* case-sensitive */
147 return REG_ICASE; /* case-insensitive */
151 msg_search (CONTEXT *ctx, pattern_t* pat, int msgno)
153 char tempfile[_POSIX_PATH_MAX];
160 HEADER *h = ctx->hdrs[msgno];
164 if ((msg = mx_open_message (ctx, msgno)) != NULL) {
165 if (option (OPTTHOROUGHSRC)) {
166 /* decode the header / body */
167 memset (&s, 0, sizeof (s));
169 s.flags = M_CHARCONV;
170 mutt_mktemp (tempfile);
171 if ((s.fpout = safe_fopen (tempfile, "w+")) == NULL) {
172 mutt_perror (tempfile);
176 if (pat->op != M_BODY)
177 mutt_copy_header (msg->fp, h, s.fpout, CH_FROM | CH_DECODE, NULL);
179 if (pat->op != M_HEADER) {
180 mutt_parse_mime_message (ctx, h);
182 if (WithCrypto && (h->security & ENCRYPT)
183 && !crypt_valid_passphrase (h->security)) {
184 mx_close_message (&msg);
192 fseeko (msg->fp, h->offset, 0);
193 mutt_body_handler (h->content, &s);
199 fstat (fileno (fp), &st);
200 lng = (long) st.st_size;
203 /* raw header / body */
205 if (pat->op != M_BODY) {
206 fseeko (fp, h->offset, 0);
207 lng = h->content->offset - h->offset;
209 if (pat->op != M_HEADER) {
210 if (pat->op == M_BODY)
211 fseeko (fp, h->content->offset, 0);
212 lng += h->content->length;
216 buf = p_new(char, blen = STRING);
218 /* search the file "fp" */
220 if (pat->op == M_HEADER) {
221 if (*(buf = mutt_read_rfc822_line (fp, buf, &blen)) == '\0')
223 } else if (fgets (buf, blen - 1, fp) == NULL)
224 break; /* don't loop forever */
225 if (patmatch (pat, buf) == 0) {
229 lng -= str_len (buf);
234 mx_close_message (&msg);
236 if (option (OPTTHOROUGHSRC)) {
245 int eat_regexp (pattern_t * pat, BUFFER * s, BUFFER * err)
250 memset (&buf, 0, sizeof (buf));
252 if (mutt_extract_token (&buf, s, M_TOKEN_PATTERN | M_TOKEN_COMMENT) != 0 ||
254 snprintf (err->data, err->dsize, _("Error in expression: %s"), s->dptr);
259 snprintf (err->data, err->dsize, _("Empty expression"));
264 /* If there are no RE metacharacters, use simple search anyway */
265 if (!pat->stringmatch && !strpbrk (buf.data, "|[{.*+?^$"))
266 pat->stringmatch = 1;
269 if (pat->stringmatch) {
270 pat->str = str_dup (buf.data);
273 pat->rx = p_new(regex_t, 1);
274 r = REGCOMP (pat->rx, buf.data, REG_NEWLINE | REG_NOSUB | mutt_which_case (buf.data));
277 regerror (r, pat->rx, err->data, err->dsize);
286 static int patmatch (const pattern_t* pat, const char* buf) {
287 if (pat->stringmatch)
288 return !strstr (buf, pat->str);
290 return regexec (pat->rx, buf, 0, NULL, 0);
293 int eat_range (pattern_t * pat, BUFFER * s, BUFFER * err)
296 int do_exclusive = 0;
300 * If simple_search is set to "~m %s", the range will have double quotes
303 if (*s->dptr == '"') {
309 if ((*s->dptr != '-') && (*s->dptr != '<')) {
311 if (*s->dptr == '>') {
312 pat->max = M_MAXRANGE;
313 pat->min = strtol (s->dptr + 1, &tmp, 0) + 1; /* exclusive range */
316 pat->min = strtol (s->dptr, &tmp, 0);
317 if (toupper ((unsigned char) *tmp) == 'K') { /* is there a prefix? */
321 else if (toupper ((unsigned char) *tmp) == 'M') {
325 if (*s->dptr == '>') {
342 if (isdigit ((unsigned char) *tmp)) {
344 pat->max = strtol (tmp, &tmp, 0);
345 if (toupper ((unsigned char) *tmp) == 'K') {
349 else if (toupper ((unsigned char) *tmp) == 'M') {
357 pat->max = M_MAXRANGE;
359 if (skip_quote && *tmp == '"')
367 static const char *getDate (const char *s, struct tm *t, BUFFER * err)
370 time_t now = time (NULL);
371 struct tm *tm = localtime (&now);
373 t->tm_mday = strtol (s, &p, 10);
374 if (t->tm_mday < 1 || t->tm_mday > 31) {
375 snprintf (err->data, err->dsize, _("Invalid day of month: %s"), s);
379 /* fill in today's month and year */
380 t->tm_mon = tm->tm_mon;
381 t->tm_year = tm->tm_year;
385 t->tm_mon = strtol (p, &p, 10) - 1;
386 if (t->tm_mon < 0 || t->tm_mon > 11) {
387 snprintf (err->data, err->dsize, _("Invalid month: %s"), p);
391 t->tm_year = tm->tm_year;
395 t->tm_year = strtol (p, &p, 10);
396 if (t->tm_year < 70) /* year 2000+ */
398 else if (t->tm_year > 1900)
407 static const char *get_offset (struct tm *tm, const char *s, int sign)
410 int offset = strtol (s, &ps, 0);
412 if ((sign < 0 && offset > 0) || (sign > 0 && offset < 0))
417 tm->tm_year += offset;
420 tm->tm_mon += offset;
423 tm->tm_mday += 7 * offset;
426 tm->tm_mday += offset;
431 mutt_normalize_time (tm);
435 static void adjust_date_range (struct tm *min, struct tm *max)
437 if (min->tm_year > max->tm_year
438 || (min->tm_year == max->tm_year && min->tm_mon > max->tm_mon)
439 || (min->tm_year == max->tm_year && min->tm_mon == max->tm_mon
440 && min->tm_mday > max->tm_mday)) {
444 min->tm_year = max->tm_year;
448 min->tm_mon = max->tm_mon;
452 min->tm_mday = max->tm_mday;
455 min->tm_hour = min->tm_min = min->tm_sec = 0;
457 max->tm_min = max->tm_sec = 59;
461 static const char *parse_date_range (const char *pc, struct tm *min,
462 struct tm *max, int haveMin,
463 struct tm *baseMin, BUFFER * err)
465 int flag = M_PDR_NONE;
467 while (*pc && ((flag & M_PDR_DONE) == 0)) {
475 /* try a range of absolute date minus offset of Ndwmy */
476 pt = get_offset (min, pc, -1);
478 if (flag == M_PDR_NONE) { /* nothing yet and no offset parsed => absolute date? */
479 if (!getDate (pc, max, err))
480 flag |= (M_PDR_ABSOLUTE | M_PDR_ERRORDONE); /* done bad */
482 /* reestablish initial base minimum if not specified */
484 memcpy (min, baseMin, sizeof (struct tm));
485 flag |= (M_PDR_ABSOLUTE | M_PDR_DONE); /* done good */
489 flag |= M_PDR_ERRORDONE;
493 if (flag == M_PDR_NONE && !haveMin) { /* the very first "-3d" without a previous absolute date */
494 max->tm_year = min->tm_year;
495 max->tm_mon = min->tm_mon;
496 max->tm_mday = min->tm_mday;
503 { /* enlarge plusRange */
504 pt = get_offset (max, pc, 1);
506 flag |= M_PDR_ERRORDONE;
514 { /* enlarge window in both directions */
515 pt = get_offset (min, pc, -1);
517 flag |= M_PDR_ERRORDONE;
519 pc = get_offset (max, pc, 1);
520 flag |= M_PDR_WINDOW;
525 flag |= M_PDR_ERRORDONE;
529 if ((flag & M_PDR_ERROR) && !(flag & M_PDR_ABSOLUTE)) { /* getDate has its own error message, don't overwrite it here */
530 snprintf (err->data, err->dsize, _("Invalid relative date: %s"), pc - 1);
532 return ((flag & M_PDR_ERROR) ? NULL : pc);
535 static int eat_date (pattern_t * pat, BUFFER * s, BUFFER * err)
540 memset (&buffer, 0, sizeof (buffer));
541 if (mutt_extract_token (&buffer, s, M_TOKEN_COMMENT | M_TOKEN_PATTERN) != 0
543 strfcpy (err->data, _("error in expression"), err->dsize);
547 memset (&min, 0, sizeof (min));
548 /* the `0' time is Jan 1, 1970 UTC, so in order to prevent a negative time
549 when doing timezone conversion, we use Jan 2, 1970 UTC as the base
554 memset (&max, 0, sizeof (max));
556 /* Arbitrary year in the future. Don't set this too high
557 or mutt_mktime() returns something larger than will
558 fit in a time_t on some systems */
566 if (strchr ("<>=", buffer.data[0])) {
567 /* offset from current time
568 <3d less than three days ago
569 >3d more than three days ago
570 =3d exactly three days ago */
571 time_t now = time (NULL);
572 struct tm *tm = localtime (&now);
575 if (buffer.data[0] == '<') {
576 memcpy (&min, tm, sizeof (min));
580 memcpy (&max, tm, sizeof (max));
583 if (buffer.data[0] == '=')
587 tm->tm_min = tm->tm_sec = 59;
589 /* force negative offset */
590 get_offset (tm, buffer.data + 1, -1);
593 /* start at the beginning of the day in question */
594 memcpy (&min, &max, sizeof (max));
595 min.tm_hour = min.tm_sec = min.tm_min = 0;
599 const char *pc = buffer.data;
602 int untilNow = FALSE;
604 if (isdigit ((unsigned char) *pc)) {
605 /* mininum date specified */
606 if ((pc = getDate (pc, &min, err)) == NULL) {
607 p_delete(&buffer.data);
613 const char *pt = pc + 1;
616 untilNow = (*pt == '\0');
620 if (!untilNow) { /* max date or relative range/window */
624 if (!haveMin) { /* save base minimum and set current date, e.g. for "-3d+1d" */
625 time_t now = time (NULL);
626 struct tm *tm = localtime (&now);
628 memcpy (&baseMin, &min, sizeof (baseMin));
629 memcpy (&min, tm, sizeof (min));
630 min.tm_hour = min.tm_sec = min.tm_min = 0;
633 /* preset max date for relative offsets,
634 if nothing follows we search for messages on a specific day */
635 max.tm_year = min.tm_year;
636 max.tm_mon = min.tm_mon;
637 max.tm_mday = min.tm_mday;
639 if (!parse_date_range (pc, &min, &max, haveMin, &baseMin, err)) { /* bail out on any parsing error */
640 p_delete(&buffer.data);
646 /* Since we allow two dates to be specified we'll have to adjust that. */
647 adjust_date_range (&min, &max);
649 pat->min = mutt_mktime (&min, 1);
650 pat->max = mutt_mktime (&max, 1);
652 p_delete(&buffer.data);
657 static struct pattern_flags *lookup_tag (char tag)
661 for (i = 0; Flags[i].tag; i++)
662 if (Flags[i].tag == tag)
667 static /* const */ char *find_matching_paren ( /* const */ char *s)
674 else if (*s == ')') {
683 void mutt_pattern_free (pattern_t ** pat)
697 mutt_pattern_free (&tmp->child);
702 pattern_t *mutt_pattern_comp ( /* const */ char *s, int flags, BUFFER * err)
704 pattern_t *curlist = NULL;
706 pattern_t *last = NULL;
710 int implicit = 1; /* used to detect logical AND operator */
711 struct pattern_flags *entry;
716 memset (&ps, 0, sizeof (ps));
718 ps.dsize = str_len (s);
734 snprintf (err->data, err->dsize, _("error in pattern at: %s"),
739 /* A & B | C == (A & B) | C */
740 tmp = new_pattern ();
742 tmp->child = curlist;
758 if (implicit && or) {
759 /* A | B & C == (A | B) & C */
760 tmp = new_pattern ();
762 tmp->child = curlist;
768 tmp = new_pattern ();
770 tmp->alladdr = alladdr;
771 tmp->stringmatch = (*ps.dptr == '=') ? 1 : 0;
781 ps.dptr++; /* move past the ~ */
782 if ((entry = lookup_tag (*ps.dptr)) == NULL) {
783 snprintf (err->data, err->dsize, _("%c: invalid command"), *ps.dptr);
784 mutt_pattern_free (&curlist);
787 if (entry->class && (flags & entry->class) == 0) {
788 snprintf (err->data, err->dsize, _("%c: not supported in this mode"),
790 mutt_pattern_free (&curlist);
795 ps.dptr++; /* eat the operator and any optional whitespace */
798 if (entry->eat_arg) {
800 snprintf (err->data, err->dsize, _("missing parameter"));
801 mutt_pattern_free (&curlist);
804 if (entry->eat_arg (tmp, &ps, err) == -1) {
805 mutt_pattern_free (&curlist);
812 p = find_matching_paren (ps.dptr + 1);
814 snprintf (err->data, err->dsize, _("mismatched parenthesis: %s"),
816 mutt_pattern_free (&curlist);
819 /* compile the sub-expression */
820 buf = str_substrdup (ps.dptr + 1, p);
821 if ((tmp = mutt_pattern_comp (buf, flags, err)) == NULL) {
823 mutt_pattern_free (&curlist);
833 tmp->alladdr |= alladdr;
836 ps.dptr = p + 1; /* restore location */
839 snprintf (err->data, err->dsize, _("error in pattern at: %s"), ps.dptr);
840 mutt_pattern_free (&curlist);
845 strfcpy (err->data, _("empty pattern"), err->dsize);
849 tmp = new_pattern ();
850 tmp->op = or ? M_OR : M_AND;
851 tmp->child = curlist;
858 perform_and (pattern_t * pat, pattern_exec_flag flags, CONTEXT * ctx,
861 for (; pat; pat = pat->next)
862 if (mutt_pattern_exec (pat, flags, ctx, hdr) <= 0)
868 perform_or (struct pattern_t *pat, pattern_exec_flag flags, CONTEXT * ctx,
871 for (; pat; pat = pat->next)
872 if (mutt_pattern_exec (pat, flags, ctx, hdr) > 0)
877 static int match_adrlist (pattern_t* pat, int match_personal, int alladdr,
885 for (a = va_arg (ap, ADDRESS *); a; a = a->next) {
887 ((a->mailbox && patmatch (pat, a->mailbox) == 0) ||
888 (match_personal && a->personal &&
889 patmatch (pat, a->personal) == 0))) {
891 return (!pat->alladdr); /* Found match, or non-match if alladdr */
896 return pat->alladdr; /* No matches, or all matches if alladdr */
899 static int match_reference (pattern_t* pat, LIST * refs)
901 for (; refs; refs = refs->next)
902 if (patmatch (pat, refs->data) == 0)
907 int mutt_is_list_recipient (int alladdr, ADDRESS * a1, ADDRESS * a2)
909 for (; a1; a1 = a1->next)
910 if (alladdr ^ mutt_is_subscribed_list (a1))
912 for (; a2; a2 = a2->next)
913 if (alladdr ^ mutt_is_subscribed_list (a2))
918 int mutt_is_list_cc (int alladdr, ADDRESS * a1, ADDRESS * a2)
920 for (; a1; a1 = a1->next)
921 if (alladdr ^ mutt_is_mail_list (a1))
923 for (; a2; a2 = a2->next)
924 if (alladdr ^ mutt_is_mail_list (a2))
929 static int match_user (int alladdr, ADDRESS * a1, ADDRESS * a2)
931 for (; a1; a1 = a1->next)
932 if (alladdr ^ mutt_addr_is_user (a1))
934 for (; a2; a2 = a2->next)
935 if (alladdr ^ mutt_addr_is_user (a2))
940 /* test if name is considered a real name, i.e. consists of at least 2
941 * space-separated words of which none may end in a dot
943 static int valid_realname (const char *name)
945 const char *p = name;
952 /* skip abbr. parts of names (e.g. 'J. User') */
960 M_MATCH_FULL_ADDRESS match both personal and machine address */
962 mutt_pattern_exec (struct pattern_t *pat, pattern_exec_flag flags,
963 CONTEXT * ctx, HEADER * h)
967 return (pat->not ^ (perform_and (pat->child, flags, ctx, h) > 0));
969 return (pat->not ^ (perform_or (pat->child, flags, ctx, h) > 0));
973 return (pat->not ^ h->expired);
975 return (pat->not ^ h->superseded);
977 return (pat->not ^ h->flagged);
979 return (pat->not ^ h->tagged);
981 return (pat->not ? h->old || h->read : !(h->old || h->read));
983 return (pat->not ? h->read : !h->read);
985 return (pat->not ^ h->replied);
987 return (pat->not ? (!h->old || h->read) : (h->old && !h->read));
989 return (pat->not ^ h->read);
991 return (pat->not ^ h->deleted);
993 return (pat->not ^ (h->msgno >= pat->min - 1 && (pat->max == M_MAXRANGE ||
998 not ^ (h->date_sent >= pat->min && h->date_sent <= pat->max));
999 case M_DATE_RECEIVED:
1000 return (pat->not ^ (h->received >= pat->min && h->received <= pat->max));
1005 /* IMAP search sets h->matched at search compile time */
1006 if (ctx->magic == M_IMAP && pat->stringmatch)
1007 return (h->matched);
1009 return (pat->not ^ msg_search (ctx, pat, h->msgno));
1011 return (pat->not ^ match_adrlist (pat, flags & M_MATCH_FULL_ADDRESS,
1012 pat->alladdr, 1, h->env->sender));
1014 return (pat->not ^ match_adrlist (pat, flags & M_MATCH_FULL_ADDRESS,
1015 pat->alladdr, 1, h->env->from));
1017 return (pat->not ^ match_adrlist (pat, flags & M_MATCH_FULL_ADDRESS,
1018 pat->alladdr, 1, h->env->to));
1020 return (pat->not ^ match_adrlist (pat, flags & M_MATCH_FULL_ADDRESS,
1021 pat->alladdr, 1, h->env->cc));
1024 not ^ (h->env && h->env->subject
1025 && patmatch (pat, h->env->subject) == 0));
1028 not ^ (h->env && h->env->message_id
1029 && patmatch (pat, h->env->message_id) == 0));
1031 return (pat->not ^ (h->score >= pat->min && (pat->max == M_MAXRANGE ||
1032 h->score <= pat->max)));
1035 not ^ (h->content->length >= pat->min
1036 && (pat->max == M_MAXRANGE
1037 || h->content->length <= pat->max)));
1039 return (pat->not ^ match_reference (pat, h->env->references));
1043 && match_adrlist (pat, flags & M_MATCH_FULL_ADDRESS,
1044 pat->alladdr, 4, h->env->from,
1045 h->env->sender, h->env->to,
1050 && match_adrlist (pat, flags & M_MATCH_FULL_ADDRESS,
1051 pat->alladdr, 2, h->env->to,
1056 && mutt_is_list_cc (pat->alladdr, h->env->to,
1058 case M_SUBSCRIBED_LIST:
1061 && mutt_is_list_recipient (pat->alladdr, h->env->to,
1063 case M_PERSONAL_RECIP:
1066 && match_user (pat->alladdr, h->env->to, h->env->cc)));
1067 case M_PERSONAL_FROM:
1069 not ^ (h->env && match_user (pat->alladdr, h->env->from, NULL)));
1071 return (pat->not ^ (h->collapsed && h->num_hidden > 1));
1075 return (pat->not ^ ((h->security & SIGN) ? 1 : 0));
1076 case M_CRYPT_VERIFIED:
1079 return (pat->not ^ ((h->security & GOODSIGN) ? 1 : 0));
1080 case M_CRYPT_ENCRYPT:
1083 return (pat->not ^ ((h->security & ENCRYPT) ? 1 : 0));
1085 if (!(WithCrypto & APPLICATION_PGP))
1087 return (pat->not ^ ((h->security & APPLICATION_PGP)
1088 && (h->security & PGPKEY)));
1091 not ^ (h->env->x_label
1092 && patmatch (pat, h->env->x_label) == 0));
1095 not ^ (h->env->spam && h->env->spam->data
1096 && patmatch (pat, h->env->spam->data) == 0));
1098 return (pat->not ^ (h->thread && h->thread->duplicate_thread));
1104 if (h->content->parts)
1105 count = mutt_count_body_parts(h, 0);
1107 mutt_parse_mime_message(ctx, h);
1108 count = mutt_count_body_parts(h, 0);
1109 mutt_free_body(&h->content->parts);
1112 return (pat->not ^ (count >= pat->min && (pat->max == M_MAXRANGE ||
1113 count <= pat->max)));
1116 case M_UNREFERENCED:
1117 return (pat->not ^ (h->thread && !h->thread->child));
1119 return (pat->not ^ (h->content && h->content->type == TYPEMULTIPART));
1122 * we have a match if
1123 * - From: matches $alternates
1124 * - or we have an alias for current address
1125 * - or From: contains valid email address _and_ name has >= 2 fields
1128 not ^ (h->env && h->env->from && (mutt_addr_is_user (h->env->from)
1130 (alias_reverse_lookup
1131 (h->env->from) != NULL)
1132 || (h->env->from->personal
1133 && valid_realname (h->env->
1136 && h->env->from->mailbox)
1141 not ^ (h->env->newsgroups
1142 && patmatch (pat, h->env->newsgroups) == 0));
1145 mutt_error (_("error: unknown op %d (report this error)."), pat->op);
1149 static void quote_simple (char *tmp, size_t len, const char *p)
1154 while (*p && i < len - 3) {
1155 if (*p == '\\' || *p == '"')
1163 /* convert a simple search into a real request */
1164 void mutt_check_simple (char *s, size_t len, const char *simple)
1166 char tmp[LONG_STRING];
1168 /* XXX - is ascii_strcasecmp() right here, or should we use locale's
1172 if (!strchr (s, '~') && !strchr (s, '=')) { /* yup, so spoof a real request */
1173 /* convert old tokens into the new format */
1174 if (ascii_strcasecmp ("all", s) == 0 || !str_cmp ("^", s) || !str_cmp (".", s)) /* ~A is more efficient */
1175 strfcpy (s, "~A", len);
1176 else if (ascii_strcasecmp ("del", s) == 0)
1177 strfcpy (s, "~D", len);
1178 else if (ascii_strcasecmp ("flag", s) == 0)
1179 strfcpy (s, "~F", len);
1180 else if (ascii_strcasecmp ("new", s) == 0)
1181 strfcpy (s, "~N", len);
1182 else if (ascii_strcasecmp ("old", s) == 0)
1183 strfcpy (s, "~O", len);
1184 else if (ascii_strcasecmp ("repl", s) == 0)
1185 strfcpy (s, "~Q", len);
1186 else if (ascii_strcasecmp ("read", s) == 0)
1187 strfcpy (s, "~R", len);
1188 else if (ascii_strcasecmp ("tag", s) == 0)
1189 strfcpy (s, "~T", len);
1190 else if (ascii_strcasecmp ("unread", s) == 0)
1191 strfcpy (s, "~U", len);
1193 quote_simple (tmp, sizeof (tmp), s);
1194 mutt_expand_fmt (s, len, simple, tmp);
1199 int mutt_pattern_func (int op, char *prompt)
1202 char buf[LONG_STRING] = "", *simple, error[STRING];
1206 strfcpy (buf, NONULL (Context->pattern), sizeof (buf));
1207 if (prompt || op != M_LIMIT)
1208 if (mutt_get_field (prompt, buf, sizeof (buf), M_PATTERN | M_CLEAR) != 0 || !buf[0])
1211 mutt_message _("Compiling search pattern...");
1213 simple = str_dup (buf);
1214 mutt_check_simple (buf, sizeof (buf), NONULL (SimpleSearch));
1217 err.dsize = sizeof (error);
1218 if ((pat = mutt_pattern_comp (buf, M_FULL_MSG, &err)) == NULL) {
1220 mutt_error ("%s", err.data);
1225 if (Context->magic == M_IMAP && imap_search (Context, pat) < 0)
1229 mutt_message _("Executing command on matching messages...");
1231 #define THIS_BODY Context->hdrs[i]->content
1233 if (op == M_LIMIT) {
1234 Context->vcount = 0;
1236 Context->collapsed = 0;
1238 for (i = 0; i < Context->msgcount; i++) {
1239 /* new limit pattern implicitly uncollapses all threads */
1240 Context->hdrs[i]->virtual = -1;
1241 Context->hdrs[i]->limited = 0;
1242 Context->hdrs[i]->collapsed = 0;
1243 Context->hdrs[i]->num_hidden = 0;
1244 if (mutt_pattern_exec
1245 (pat, M_MATCH_FULL_ADDRESS, Context, Context->hdrs[i])) {
1246 Context->hdrs[i]->virtual = Context->vcount;
1247 Context->hdrs[i]->limited = 1;
1248 Context->v2r[Context->vcount] = i;
1250 Context->vsize += THIS_BODY->length + THIS_BODY->offset -
1251 THIS_BODY->hdr_offset;
1256 for (i = 0; i < Context->vcount; i++) {
1257 if (mutt_pattern_exec
1258 (pat, M_MATCH_FULL_ADDRESS, Context,
1259 Context->hdrs[Context->v2r[i]])) {
1262 mutt_set_flag (Context, Context->hdrs[Context->v2r[i]], M_PURGED,
1265 mutt_set_flag (Context, Context->hdrs[Context->v2r[i]], M_DELETE,
1270 mutt_set_flag (Context, Context->hdrs[Context->v2r[i]], M_TAG,
1280 mutt_clear_error ();
1282 if (op == M_LIMIT) {
1283 /* drop previous limit pattern */
1284 p_delete(&Context->pattern);
1285 if (Context->limit_pattern)
1286 mutt_pattern_free (&Context->limit_pattern);
1287 if (Context->msgcount && !Context->vcount) {
1288 mutt_error _("No messages matched criteria.");
1291 /* record new limit pattern, unless match all */
1292 if (str_ncmp (buf, "~A", 2) != 0) {
1293 Context->pattern = simple;
1294 simple = NULL; /* don't clobber it */
1295 Context->limit_pattern = mutt_pattern_comp (buf, M_FULL_MSG, &err);
1299 mutt_pattern_free (&pat);
1303 int mutt_search_command (int cur, int op)
1307 char temp[LONG_STRING];
1313 if (op != OP_SEARCH_NEXT && op != OP_SEARCH_OPPOSITE) {
1314 strfcpy (buf, LastSearch, sizeof (buf));
1315 if (mutt_get_field ((op == OP_SEARCH) ? _("Search for: ") :
1316 _("Reverse search for: "), buf, sizeof (buf),
1317 M_CLEAR | M_PATTERN) != 0 || !buf[0])
1320 if (op == OP_SEARCH)
1321 unset_option (OPTSEARCHREVERSE);
1323 set_option (OPTSEARCHREVERSE);
1325 /* compare the *expanded* version of the search pattern in case
1326 $simple_search has changed while we were searching */
1327 strfcpy (temp, buf, sizeof (temp));
1328 mutt_check_simple (temp, sizeof (temp), NONULL (SimpleSearch));
1330 if (!SearchPattern || str_cmp (temp, LastSearchExpn)) {
1331 set_option (OPTSEARCHINVALID);
1332 strfcpy (LastSearch, buf, sizeof (LastSearch));
1333 mutt_message _("Compiling search pattern...");
1335 mutt_pattern_free (&SearchPattern);
1337 err.dsize = sizeof (error);
1338 if ((SearchPattern =
1339 mutt_pattern_comp (temp, M_FULL_MSG, &err)) == NULL) {
1340 mutt_error ("%s", error);
1343 mutt_clear_error ();
1346 else if (!SearchPattern) {
1347 mutt_error _("No search pattern.");
1352 if (option (OPTSEARCHINVALID)) {
1353 for (i = 0; i < Context->msgcount; i++)
1354 Context->hdrs[i]->searched = 0;
1356 if (Context->magic == M_IMAP && imap_search (Context, SearchPattern) < 0)
1359 unset_option (OPTSEARCHINVALID);
1362 incr = (option (OPTSEARCHREVERSE)) ? -1 : 1;
1363 if (op == OP_SEARCH_OPPOSITE)
1366 for (i = cur + incr, j = 0; j != Context->vcount; j++) {
1367 if (i > Context->vcount - 1) {
1369 if (option (OPTWRAPSEARCH))
1370 mutt_message (_("Search wrapped to top."));
1373 mutt_message _("Search hit bottom without finding match");
1379 i = Context->vcount - 1;
1380 if (option (OPTWRAPSEARCH))
1381 mutt_message (_("Search wrapped to bottom."));
1384 mutt_message _("Search hit top without finding match");
1390 h = Context->hdrs[Context->v2r[i]];
1392 /* if we've already evaulated this message, use the cached value */
1397 /* remember that we've already searched this message */
1401 (SearchPattern, M_MATCH_FULL_ADDRESS, Context, h) > 0)))
1406 mutt_error _("Search interrupted.");
1415 mutt_error _("Not found.");