2 * Copyright (C) 1996-2000 Michael R. Elkins <me@mutt.org>, and others
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 2 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111, USA.
32 #include "mutt_crypt.h"
34 static int eat_regexp (pattern_t *pat, BUFFER *, BUFFER *);
35 static int eat_date (pattern_t *pat, BUFFER *, BUFFER *);
36 static int eat_range (pattern_t *pat, BUFFER *, BUFFER *);
40 int tag; /* character used to represent this op */
41 int op; /* operation to perform */
43 int (*eat_arg) (pattern_t *, BUFFER *, BUFFER *);
47 { 'A', M_ALL, 0, NULL },
48 { 'b', M_BODY, M_FULL_MSG, eat_regexp },
49 { 'B', M_WHOLE_MSG, M_FULL_MSG, eat_regexp },
50 { 'c', M_CC, 0, eat_regexp },
51 { 'C', M_RECIPIENT, 0, eat_regexp },
52 { 'd', M_DATE, 0, eat_date },
53 { 'D', M_DELETED, 0, NULL },
54 { 'e', M_SENDER, 0, eat_regexp },
55 { 'E', M_EXPIRED, 0, NULL },
56 { 'f', M_FROM, 0, eat_regexp },
57 { 'F', M_FLAG, 0, NULL },
58 { 'g', M_CRYPT_SIGN, 0, NULL },
59 { 'G', M_CRYPT_ENCRYPT, 0, NULL },
60 { 'h', M_HEADER, M_FULL_MSG, eat_regexp },
61 { 'i', M_ID, 0, eat_regexp },
62 { 'k', M_PGP_KEY, 0, NULL },
63 { 'L', M_ADDRESS, 0, eat_regexp },
64 { 'l', M_LIST, 0, NULL },
65 { 'm', M_MESSAGE, 0, eat_range },
66 { 'n', M_SCORE, 0, eat_range },
67 { 'N', M_NEW, 0, NULL },
68 { 'O', M_OLD, 0, NULL },
69 { 'p', M_PERSONAL_RECIP, 0, NULL },
70 { 'P', M_PERSONAL_FROM, 0, NULL },
71 { 'Q', M_REPLIED, 0, NULL },
72 { 'R', M_READ, 0, NULL },
73 { 'r', M_DATE_RECEIVED, 0, eat_date },
74 { 's', M_SUBJECT, 0, eat_regexp },
75 { 'S', M_SUPERSEDED, 0, NULL },
76 { 'T', M_TAG, 0, NULL },
77 { 't', M_TO, 0, eat_regexp },
78 { 'U', M_UNREAD, 0, NULL },
79 { 'v', M_COLLAPSED, 0, NULL },
80 { 'V', M_CRYPT_VERIFIED, 0, NULL },
82 { 'w', M_NEWSGROUPS, 0, eat_regexp },
84 { 'x', M_REFERENCE, 0, eat_regexp },
85 { 'y', M_XLABEL, 0, eat_regexp },
86 { 'z', M_SIZE, 0, eat_range },
87 { '=', M_DUPLICATED, 0, NULL },
91 static pattern_t *SearchPattern = NULL; /* current search pattern */
92 static char LastSearch[STRING] = { 0 }; /* last pattern searched for */
93 static char LastSearchExpn[LONG_STRING] = { 0 }; /* expanded version of
98 /* constants for parse_date_range() */
99 #define M_PDR_NONE 0x0000
100 #define M_PDR_MINUS 0x0001
101 #define M_PDR_PLUS 0x0002
102 #define M_PDR_WINDOW 0x0004
103 #define M_PDR_ABSOLUTE 0x0008
104 #define M_PDR_DONE 0x0010
105 #define M_PDR_ERROR 0x0100
106 #define M_PDR_ERRORDONE (M_PDR_ERROR | M_PDR_DONE)
109 int mutt_getvaluebychar (char ch, struct mapping_t *table)
113 for (i = 0; table[i].name; i++)
115 if (ch == table[i].name[0])
116 return table[i].value;
122 /* if no uppercase letters are given, do a case-insensitive search */
123 int mutt_which_case (const char *s)
127 if (isalpha ((unsigned char) *s) && isupper ((unsigned char) *s))
128 return 0; /* case-sensitive */
131 return REG_ICASE; /* case-insensitive */
135 msg_search (CONTEXT *ctx, regex_t *rx, char *buf, size_t blen, int op, int msgno)
137 char tempfile[_POSIX_PATH_MAX];
144 HEADER *h = ctx->hdrs[msgno];
146 if ((msg = mx_open_message (ctx, msgno)) != NULL)
148 if (option (OPTTHOROUGHSRC))
150 /* decode the header / body */
151 memset (&s, 0, sizeof (s));
153 s.flags = M_CHARCONV;
154 mutt_mktemp (tempfile);
155 if ((s.fpout = safe_fopen (tempfile, "w+")) == NULL)
157 mutt_perror (tempfile);
162 mutt_copy_header (msg->fp, h, s.fpout, CH_FROM | CH_DECODE, NULL);
166 mutt_parse_mime_message (ctx, h);
168 if (WithCrypto && (h->security & ENCRYPT)
169 && !crypt_valid_passphrase(h->security))
171 mx_close_message (&msg);
180 fseek (msg->fp, h->offset, 0);
181 mutt_body_handler (h->content, &s);
187 fstat (fileno (fp), &st);
188 lng = (long) st.st_size;
192 /* raw header / body */
196 fseek (fp, h->offset, 0);
197 lng = h->content->offset - h->offset;
202 fseek (fp, h->content->offset, 0);
203 lng += h->content->length;
207 /* search the file "fp" */
210 if (fgets (buf, blen - 1, fp) == NULL)
211 break; /* don't loop forever */
212 if (regexec (rx, buf, 0, NULL, 0) == 0)
217 lng -= mutt_strlen (buf);
220 mx_close_message (&msg);
222 if (option (OPTTHOROUGHSRC))
232 int eat_regexp (pattern_t *pat, BUFFER *s, BUFFER *err)
237 memset (&buf, 0, sizeof (buf));
238 if (mutt_extract_token (&buf, s, M_TOKEN_PATTERN | M_TOKEN_COMMENT) != 0 ||
241 snprintf (err->data, err->dsize, _("Error in expression: %s"), s->dptr);
244 pat->rx = safe_malloc (sizeof (regex_t));
245 r = REGCOMP (pat->rx, buf.data, REG_NEWLINE | REG_NOSUB | mutt_which_case (buf.data));
249 regerror (r, pat->rx, err->data, err->dsize);
257 int eat_range (pattern_t *pat, BUFFER *s, BUFFER *err)
260 int do_exclusive = 0;
264 * If simple_search is set to "~m %s", the range will have double quotes
274 if ((*s->dptr != '-') && (*s->dptr != '<'))
279 pat->max = M_MAXRANGE;
280 pat->min = strtol (s->dptr + 1, &tmp, 0) + 1; /* exclusive range */
283 pat->min = strtol (s->dptr, &tmp, 0);
284 if (toupper ((unsigned char) *tmp) == 'K') /* is there a prefix? */
289 else if (toupper ((unsigned char) *tmp) == 'M')
314 if (isdigit ((unsigned char) *tmp))
317 pat->max = strtol (tmp, &tmp, 0);
318 if (toupper ((unsigned char) *tmp) == 'K')
323 else if (toupper ((unsigned char) *tmp) == 'M')
332 pat->max = M_MAXRANGE;
334 if (skip_quote && *tmp == '"')
342 static const char *getDate (const char *s, struct tm *t, BUFFER *err)
345 time_t now = time (NULL);
346 struct tm *tm = localtime (&now);
348 t->tm_mday = strtol (s, &p, 10);
349 if (t->tm_mday < 1 || t->tm_mday > 31)
351 snprintf (err->data, err->dsize, _("Invalid day of month: %s"), s);
356 /* fill in today's month and year */
357 t->tm_mon = tm->tm_mon;
358 t->tm_year = tm->tm_year;
362 t->tm_mon = strtol (p, &p, 10) - 1;
363 if (t->tm_mon < 0 || t->tm_mon > 11)
365 snprintf (err->data, err->dsize, _("Invalid month: %s"), p);
370 t->tm_year = tm->tm_year;
374 t->tm_year = strtol (p, &p, 10);
375 if (t->tm_year < 70) /* year 2000+ */
377 else if (t->tm_year > 1900)
386 static const char *get_offset (struct tm *tm, const char *s, int sign)
389 int offset = strtol (s, &ps, 0);
390 if ((sign < 0 && offset > 0) || (sign > 0 && offset < 0))
396 tm->tm_year += offset;
399 tm->tm_mon += offset;
402 tm->tm_mday += 7 * offset;
405 tm->tm_mday += offset;
410 mutt_normalize_time (tm);
414 static void adjust_date_range (struct tm *min, struct tm *max)
416 if (min->tm_year > max->tm_year
417 || (min->tm_year == max->tm_year && min->tm_mon > max->tm_mon)
418 || (min->tm_year == max->tm_year && min->tm_mon == max->tm_mon
419 && min->tm_mday > max->tm_mday))
424 min->tm_year = max->tm_year;
428 min->tm_mon = max->tm_mon;
432 min->tm_mday = max->tm_mday;
435 min->tm_hour = min->tm_min = min->tm_sec = 0;
437 max->tm_min = max->tm_sec = 59;
441 static const char * parse_date_range (const char* pc, struct tm *min,
442 struct tm *max, int haveMin, struct tm *baseMin, BUFFER *err)
444 int flag = M_PDR_NONE;
445 while (*pc && ((flag & M_PDR_DONE) == 0))
454 /* try a range of absolute date minus offset of Ndwmy */
455 pt = get_offset (min, pc, -1);
458 if (flag == M_PDR_NONE)
459 { /* nothing yet and no offset parsed => absolute date? */
460 if (!getDate (pc, max, err))
461 flag |= (M_PDR_ABSOLUTE | M_PDR_ERRORDONE); /* done bad */
464 /* reestablish initial base minimum if not specified */
466 memcpy (min, baseMin, sizeof(struct tm));
467 flag |= (M_PDR_ABSOLUTE | M_PDR_DONE); /* done good */
471 flag |= M_PDR_ERRORDONE;
476 if (flag == M_PDR_NONE && !haveMin)
477 { /* the very first "-3d" without a previous absolute date */
478 max->tm_year = min->tm_year;
479 max->tm_mon = min->tm_mon;
480 max->tm_mday = min->tm_mday;
487 { /* enlarge plusRange */
488 pt = get_offset (max, pc, 1);
490 flag |= M_PDR_ERRORDONE;
499 { /* enlarge window in both directions */
500 pt = get_offset (min, pc, -1);
502 flag |= M_PDR_ERRORDONE;
505 pc = get_offset (max, pc, 1);
506 flag |= M_PDR_WINDOW;
511 flag |= M_PDR_ERRORDONE;
515 if ((flag & M_PDR_ERROR) && !(flag & M_PDR_ABSOLUTE))
516 { /* getDate has its own error message, don't overwrite it here */
517 snprintf (err->data, err->dsize, _("Invalid relative date: %s"), pc-1);
519 return ((flag & M_PDR_ERROR) ? NULL : pc);
522 static int eat_date (pattern_t *pat, BUFFER *s, BUFFER *err)
527 memset (&buffer, 0, sizeof (buffer));
528 if (mutt_extract_token (&buffer, s, M_TOKEN_COMMENT | M_TOKEN_PATTERN) != 0
531 strfcpy (err->data, _("error in expression"), err->dsize);
535 memset (&min, 0, sizeof (min));
536 /* the `0' time is Jan 1, 1970 UTC, so in order to prevent a negative time
537 when doing timezone conversion, we use Jan 2, 1970 UTC as the base
542 memset (&max, 0, sizeof (max));
544 /* Arbitrary year in the future. Don't set this too high
545 or mutt_mktime() returns something larger than will
546 fit in a time_t on some systems */
554 if (strchr ("<>=", buffer.data[0]))
556 /* offset from current time
557 <3d less than three days ago
558 >3d more than three days ago
559 =3d exactly three days ago */
560 time_t now = time (NULL);
561 struct tm *tm = localtime (&now);
564 if (buffer.data[0] == '<')
566 memcpy (&min, tm, sizeof (min));
571 memcpy (&max, tm, sizeof (max));
574 if (buffer.data[0] == '=')
578 tm->tm_min = tm->tm_sec = 59;
580 /* force negative offset */
581 get_offset (tm, buffer.data + 1, -1);
585 /* start at the beginning of the day in question */
586 memcpy (&min, &max, sizeof (max));
587 min.tm_hour = min.tm_sec = min.tm_min = 0;
592 const char *pc = buffer.data;
595 int untilNow = FALSE;
596 if (isdigit ((unsigned char)*pc))
598 /* mininum date specified */
599 if ((pc = getDate (pc, &min, err)) == NULL)
608 const char *pt = pc + 1;
610 untilNow = (*pt == '\0');
615 { /* max date or relative range/window */
620 { /* save base minimum and set current date, e.g. for "-3d+1d" */
621 time_t now = time (NULL);
622 struct tm *tm = localtime (&now);
623 memcpy (&baseMin, &min, sizeof(baseMin));
624 memcpy (&min, tm, sizeof (min));
625 min.tm_hour = min.tm_sec = min.tm_min = 0;
628 /* preset max date for relative offsets,
629 if nothing follows we search for messages on a specific day */
630 max.tm_year = min.tm_year;
631 max.tm_mon = min.tm_mon;
632 max.tm_mday = min.tm_mday;
634 if (!parse_date_range (pc, &min, &max, haveMin, &baseMin, err))
635 { /* bail out on any parsing error */
642 /* Since we allow two dates to be specified we'll have to adjust that. */
643 adjust_date_range (&min, &max);
645 pat->min = mutt_mktime (&min, 1);
646 pat->max = mutt_mktime (&max, 1);
653 static struct pattern_flags *lookup_tag (char tag)
657 for (i = 0; Flags[i].tag; i++)
658 if (Flags[i].tag == tag)
663 static /* const */ char *find_matching_paren (/* const */ char *s)
681 void mutt_pattern_free (pattern_t **pat)
696 mutt_pattern_free (&tmp->child);
701 pattern_t *mutt_pattern_comp (/* const */ char *s, int flags, BUFFER *err)
703 pattern_t *curlist = NULL;
705 pattern_t *last = NULL;
709 int implicit = 1; /* used to detect logical AND operator */
710 struct pattern_flags *entry;
715 memset (&ps, 0, sizeof (ps));
717 ps.dsize = mutt_strlen (s);
737 snprintf (err->data, err->dsize, _("error in pattern at: %s"), ps.dptr);
742 /* A & B | C == (A & B) | C */
743 tmp = new_pattern ();
745 tmp->child = curlist;
761 /* A | B & C == (A | B) & C */
762 tmp = new_pattern ();
764 tmp->child = curlist;
770 tmp = new_pattern ();
772 tmp->alladdr = alladdr;
782 ps.dptr++; /* move past the ~ */
783 if ((entry = lookup_tag (*ps.dptr)) == NULL)
785 snprintf (err->data, err->dsize, _("%c: invalid command"), *ps.dptr);
786 mutt_pattern_free (&curlist);
789 if (entry->class && (flags & entry->class) == 0)
791 snprintf (err->data, err->dsize, _("%c: not supported in this mode"), *ps.dptr);
792 mutt_pattern_free (&curlist);
797 ps.dptr++; /* eat the operator and any optional whitespace */
804 snprintf (err->data, err->dsize, _("missing parameter"));
805 mutt_pattern_free (&curlist);
808 if (entry->eat_arg (tmp, &ps, err) == -1)
810 mutt_pattern_free (&curlist);
817 p = find_matching_paren (ps.dptr + 1);
820 snprintf (err->data, err->dsize, _("mismatched parenthesis: %s"), ps.dptr);
821 mutt_pattern_free (&curlist);
824 /* compile the sub-expression */
825 buf = mutt_substrdup (ps.dptr + 1, p);
826 if ((tmp = mutt_pattern_comp (buf, flags, err)) == NULL)
829 mutt_pattern_free (&curlist);
839 tmp->alladdr |= alladdr;
842 ps.dptr = p + 1; /* restore location */
845 snprintf (err->data, err->dsize, _("error in pattern at: %s"), ps.dptr);
846 mutt_pattern_free (&curlist);
852 strfcpy (err->data, _("empty pattern"), err->dsize);
857 tmp = new_pattern ();
858 tmp->op = or ? M_OR : M_AND;
859 tmp->child = curlist;
866 perform_and (pattern_t *pat, pattern_exec_flag flags, CONTEXT *ctx, HEADER *hdr)
868 for (; pat; pat = pat->next)
869 if (mutt_pattern_exec (pat, flags, ctx, hdr) <= 0)
875 perform_or (struct pattern_t *pat, pattern_exec_flag flags, CONTEXT *ctx, HEADER *hdr)
877 for (; pat; pat = pat->next)
878 if (mutt_pattern_exec (pat, flags, ctx, hdr) > 0)
883 static int match_adrlist (regex_t *rx, int match_personal, int alladdr,
892 for (a = va_arg (ap, ADDRESS *) ; a ; a = a->next)
895 ((a->mailbox && regexec (rx, a->mailbox, 0, NULL, 0) == 0) ||
896 (match_personal && a->personal &&
897 regexec (rx, a->personal, 0, NULL, 0) == 0)))
900 return (! alladdr); /* Found match, or non-match if alladdr */
905 return alladdr; /* No matches, or all matches if alladdr */
908 static int match_reference (regex_t *rx, LIST *refs)
910 for (; refs; refs = refs->next)
911 if (regexec (rx, refs->data, 0, NULL, 0) == 0)
916 int mutt_is_list_recipient (int alladdr, ADDRESS *a1, ADDRESS *a2)
918 for (; a1 ; a1 = a1->next)
919 if (alladdr ^ mutt_is_subscribed_list (a1))
921 for (; a2 ; a2 = a2->next)
922 if (alladdr ^ mutt_is_subscribed_list (a2))
927 int mutt_is_list_cc (int alladdr, ADDRESS *a1, ADDRESS *a2)
929 for (; a1 ; a1 = a1->next)
930 if (alladdr ^ mutt_is_mail_list (a1))
932 for (; a2 ; a2 = a2->next)
933 if (alladdr ^ mutt_is_mail_list (a2))
938 static int match_user (int alladdr, ADDRESS *a1, ADDRESS *a2)
940 for (; a1 ; a1 = a1->next)
941 if (alladdr ^ mutt_addr_is_user (a1))
943 for (; a2 ; a2 = a2->next)
944 if (alladdr ^ mutt_addr_is_user (a2))
950 M_MATCH_FULL_ADDRESS match both personal and machine address */
952 mutt_pattern_exec (struct pattern_t *pat, pattern_exec_flag flags, CONTEXT *ctx, HEADER *h)
959 return (pat->not ^ (perform_and (pat->child, flags, ctx, h) > 0));
961 return (pat->not ^ (perform_or (pat->child, flags, ctx, h) > 0));
965 return (pat->not ^ h->expired);
967 return (pat->not ^ h->superseded);
969 return (pat->not ^ h->flagged);
971 return (pat->not ^ h->tagged);
973 return (pat->not ? h->old || h->read : !(h->old || h->read));
975 return (pat->not ? h->read : !h->read);
977 return (pat->not ^ h->replied);
979 return (pat->not ? (!h->old || h->read) : (h->old && !h->read));
981 return (pat->not ^ h->read);
983 return (pat->not ^ h->deleted);
985 return (pat->not ^ (h->msgno >= pat->min - 1 && (pat->max == M_MAXRANGE ||
986 h->msgno <= pat->max - 1)));
988 return (pat->not ^ (h->date_sent >= pat->min && h->date_sent <= pat->max));
989 case M_DATE_RECEIVED:
990 return (pat->not ^ (h->received >= pat->min && h->received <= pat->max));
994 return (pat->not ^ msg_search (ctx, pat->rx, buf, sizeof (buf), pat->op, h->msgno));
996 return (pat->not ^ match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
997 pat->alladdr, 1, h->env->sender));
999 return (pat->not ^ match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
1000 pat->alladdr, 1, h->env->from));
1002 return (pat->not ^ match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
1003 pat->alladdr, 1, h->env->to));
1005 return (pat->not ^ match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
1006 pat->alladdr, 1, h->env->cc));
1008 return (pat->not ^ (h->env->subject && regexec (pat->rx, h->env->subject, 0, NULL, 0) == 0));
1010 return (pat->not ^ (h->env->message_id && regexec (pat->rx, h->env->message_id, 0, NULL, 0) == 0));
1012 return (pat->not ^ (h->score >= pat->min && (pat->max == M_MAXRANGE ||
1013 h->score <= pat->max)));
1015 return (pat->not ^ (h->content->length >= pat->min && (pat->max == M_MAXRANGE || h->content->length <= pat->max)));
1017 return (pat->not ^ match_reference (pat->rx, h->env->references));
1019 return (pat->not ^ match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
1020 pat->alladdr, 4, h->env->from,
1021 h->env->sender, h->env->to, h->env->cc));
1023 return (pat->not ^ match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
1024 pat->alladdr, 2, h->env->to, h->env->cc));
1026 return (pat->not ^ mutt_is_list_recipient (pat->alladdr, h->env->to, h->env->cc));
1027 case M_PERSONAL_RECIP:
1028 return (pat->not ^ match_user (pat->alladdr, h->env->to, h->env->cc));
1029 case M_PERSONAL_FROM:
1030 return (pat->not ^ match_user (pat->alladdr, h->env->from, NULL));
1032 return (pat->not ^ (h->collapsed && h->num_hidden > 1));
1036 return (pat->not ^ ((h->security & SIGN) ? 1 : 0));
1037 case M_CRYPT_VERIFIED:
1040 return (pat->not ^ ((h->security & GOODSIGN) ? 1 : 0));
1041 case M_CRYPT_ENCRYPT:
1044 return (pat->not ^ ((h->security & ENCRYPT) ? 1 : 0));
1046 if (!(WithCrypto & APPLICATION_PGP))
1048 return (pat->not ^ ((h->security & APPLICATION_PGP) && (h->security & PGPKEY)));
1050 return (pat->not ^ (h->env->x_label && regexec (pat->rx, h->env->x_label, 0, NULL, 0) == 0));
1052 return (pat->not ^ (h->thread && h->thread->duplicate_thread));
1055 return (pat->not ^ (h->env->newsgroups && regexec (pat->rx, h->env->newsgroups, 0, NULL, 0) == 0));
1058 mutt_error (_("error: unknown op %d (report this error)."), pat->op);
1062 static void quote_simple(char *tmp, size_t len, const char *p)
1067 while (*p && i < len - 3)
1069 if (*p == '\\' || *p == '"')
1077 /* convert a simple search into a real request */
1078 void mutt_check_simple (char *s, size_t len, const char *simple)
1080 char tmp[LONG_STRING];
1082 /* XXX - is ascii_strcasecmp() right here, or should we use locale's
1086 if (!strchr (s, '~')) /* yup, so spoof a real request */
1088 /* convert old tokens into the new format */
1089 if (ascii_strcasecmp ("all", s) == 0 ||
1090 !mutt_strcmp ("^", s) || !mutt_strcmp (".", s)) /* ~A is more efficient */
1091 strfcpy (s, "~A", len);
1092 else if (ascii_strcasecmp ("del", s) == 0)
1093 strfcpy (s, "~D", len);
1094 else if (ascii_strcasecmp ("flag", s) == 0)
1095 strfcpy (s, "~F", len);
1096 else if (ascii_strcasecmp ("new", s) == 0)
1097 strfcpy (s, "~N", len);
1098 else if (ascii_strcasecmp ("old", s) == 0)
1099 strfcpy (s, "~O", len);
1100 else if (ascii_strcasecmp ("repl", s) == 0)
1101 strfcpy (s, "~Q", len);
1102 else if (ascii_strcasecmp ("read", s) == 0)
1103 strfcpy (s, "~R", len);
1104 else if (ascii_strcasecmp ("tag", s) == 0)
1105 strfcpy (s, "~T", len);
1106 else if (ascii_strcasecmp ("unread", s) == 0)
1107 strfcpy (s, "~U", len);
1110 quote_simple (tmp, sizeof(tmp), s);
1111 mutt_expand_fmt (s, len, simple, tmp);
1116 int mutt_pattern_func (int op, char *prompt)
1119 char buf[LONG_STRING] = "", *simple, error[STRING];
1123 strfcpy (buf, NONULL (Context->pattern), sizeof (buf));
1124 if (prompt || op != M_LIMIT)
1125 if (mutt_get_field (prompt, buf, sizeof (buf), M_PATTERN | M_CLEAR) != 0 || !buf[0])
1128 mutt_message _("Compiling search pattern...");
1130 simple = safe_strdup (buf);
1131 mutt_check_simple (buf, sizeof (buf), NONULL (SimpleSearch));
1134 err.dsize = sizeof (error);
1135 if ((pat = mutt_pattern_comp (buf, M_FULL_MSG, &err)) == NULL)
1138 mutt_error ("%s", err.data);
1142 mutt_message _("Executing command on matching messages...");
1144 #define THIS_BODY Context->hdrs[i]->content
1148 Context->vcount = 0;
1150 Context->collapsed = 0;
1152 for (i = 0; i < Context->msgcount; i++)
1154 /* new limit pattern implicitly uncollapses all threads */
1155 Context->hdrs[i]->virtual = -1;
1156 Context->hdrs[i]->limited = 0;
1157 Context->hdrs[i]->collapsed = 0;
1158 Context->hdrs[i]->num_hidden = 0;
1159 if (mutt_pattern_exec (pat, M_MATCH_FULL_ADDRESS, Context, Context->hdrs[i]))
1161 Context->hdrs[i]->virtual = Context->vcount;
1162 Context->hdrs[i]->limited = 1;
1163 Context->v2r[Context->vcount] = i;
1165 Context->vsize+=THIS_BODY->length + THIS_BODY->offset -
1166 THIS_BODY->hdr_offset;
1172 for (i = 0; i < Context->vcount; i++)
1174 if (mutt_pattern_exec (pat, M_MATCH_FULL_ADDRESS, Context, Context->hdrs[Context->v2r[i]]))
1179 mutt_set_flag (Context, Context->hdrs[Context->v2r[i]], M_PURGED,
1182 mutt_set_flag (Context, Context->hdrs[Context->v2r[i]], M_DELETE,
1187 mutt_set_flag (Context, Context->hdrs[Context->v2r[i]], M_TAG,
1197 mutt_clear_error ();
1201 FREE (&Context->pattern);
1202 if (Context->limit_pattern)
1203 mutt_pattern_free (&Context->limit_pattern);
1204 if (!Context->vcount)
1206 mutt_error _("No messages matched criteria.");
1208 Context->vcount = Context->msgcount;
1209 /* restore full display */
1210 for (i = 0; i < Context->msgcount; i++)
1212 Context->hdrs[i]->virtual = i;
1213 Context->v2r[i] = i;
1217 else if (mutt_strncmp (buf, "~A", 2) != 0)
1219 Context->pattern = simple;
1220 simple = NULL; /* don't clobber it */
1221 Context->limit_pattern = mutt_pattern_comp (buf, M_FULL_MSG, &err);
1225 mutt_pattern_free (&pat);
1229 int mutt_search_command (int cur, int op)
1233 char temp[LONG_STRING];
1239 if (op != OP_SEARCH_NEXT && op != OP_SEARCH_OPPOSITE)
1241 strfcpy (buf, LastSearch, sizeof (buf));
1242 if (mutt_get_field ((op == OP_SEARCH) ? _("Search for: ") :
1243 _("Reverse search for: "), buf, sizeof (buf),
1244 M_CLEAR | M_PATTERN) != 0 || !buf[0])
1247 if (op == OP_SEARCH)
1248 unset_option (OPTSEARCHREVERSE);
1250 set_option (OPTSEARCHREVERSE);
1252 /* compare the *expanded* version of the search pattern in case
1253 $simple_search has changed while we were searching */
1254 strfcpy (temp, buf, sizeof (temp));
1255 mutt_check_simple (temp, sizeof (temp), NONULL (SimpleSearch));
1257 if (!SearchPattern || mutt_strcmp (temp, LastSearchExpn))
1259 set_option (OPTSEARCHINVALID);
1260 strfcpy (LastSearch, buf, sizeof (LastSearch));
1261 mutt_message _("Compiling search pattern...");
1262 mutt_pattern_free (&SearchPattern);
1264 err.dsize = sizeof (error);
1265 if ((SearchPattern = mutt_pattern_comp (temp, M_FULL_MSG, &err)) == NULL)
1267 mutt_error ("%s", error);
1270 mutt_clear_error ();
1273 else if (!SearchPattern)
1275 mutt_error _("No search pattern.");
1279 if (option (OPTSEARCHINVALID))
1281 for (i = 0; i < Context->msgcount; i++)
1282 Context->hdrs[i]->searched = 0;
1283 unset_option (OPTSEARCHINVALID);
1286 incr = (option (OPTSEARCHREVERSE)) ? -1 : 1;
1287 if (op == OP_SEARCH_OPPOSITE)
1290 for (i = cur + incr, j = 0 ; j != Context->vcount; j++)
1292 if (i > Context->vcount - 1)
1295 if (option (OPTWRAPSEARCH))
1296 mutt_message _("Search wrapped to top.");
1299 mutt_message _("Search hit bottom without finding match");
1305 i = Context->vcount - 1;
1306 if (option (OPTWRAPSEARCH))
1307 mutt_message _("Search wrapped to bottom.");
1310 mutt_message _("Search hit top without finding match");
1315 h = Context->hdrs[Context->v2r[i]];
1318 /* if we've already evaulated this message, use the cached value */
1324 /* remember that we've already searched this message */
1326 if ((h->matched = (mutt_pattern_exec (SearchPattern, M_MATCH_FULL_ADDRESS, Context, h) > 0)))
1332 mutt_error _("Search interrupted.");
1340 mutt_error _("Not found.");