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.
27 #include "mutt_crypt.h"
29 static int eat_regexp (pattern_t * pat, BUFFER *, BUFFER *);
30 static int eat_date (pattern_t * pat, BUFFER *, BUFFER *);
31 static int eat_range (pattern_t * pat, BUFFER *, BUFFER *);
33 struct pattern_flags {
34 int tag; /* character used to represent this op */
35 int op; /* operation to perform */
37 int (*eat_arg) (pattern_t *, BUFFER *, BUFFER *);
40 'A', M_ALL, 0, NULL}, {
41 'b', M_BODY, M_FULL_MSG, eat_regexp}, {
42 'B', M_WHOLE_MSG, M_FULL_MSG, eat_regexp}, {
43 'c', M_CC, 0, eat_regexp}, {
44 'C', M_RECIPIENT, 0, eat_regexp}, {
45 'd', M_DATE, 0, eat_date}, {
46 'D', M_DELETED, 0, NULL}, {
47 'e', M_SENDER, 0, eat_regexp}, {
48 'E', M_EXPIRED, 0, NULL}, {
49 'f', M_FROM, 0, eat_regexp}, {
50 'F', M_FLAG, 0, NULL}, {
51 'g', M_CRYPT_SIGN, 0, NULL}, {
52 'G', M_CRYPT_ENCRYPT, 0, NULL}, {
53 'h', M_HEADER, M_FULL_MSG, eat_regexp}, {
54 'H', M_HORMEL, 0, eat_regexp}, {
55 'i', M_ID, 0, eat_regexp}, {
56 'k', M_PGP_KEY, 0, NULL}, {
57 'L', M_ADDRESS, 0, eat_regexp}, {
58 'l', M_LIST, 0, NULL}, {
59 'm', M_MESSAGE, 0, eat_range}, {
60 'n', M_SCORE, 0, eat_range}, {
61 'N', M_NEW, 0, NULL}, {
62 'O', M_OLD, 0, NULL}, {
63 'p', M_PERSONAL_RECIP, 0, NULL}, {
64 'P', M_PERSONAL_FROM, 0, NULL}, {
65 'Q', M_REPLIED, 0, NULL}, {
66 'R', M_READ, 0, NULL}, {
67 'r', M_DATE_RECEIVED, 0, eat_date}, {
68 's', M_SUBJECT, 0, eat_regexp}, {
69 'S', M_SUPERSEDED, 0, NULL}, {
70 'T', M_TAG, 0, NULL}, {
71 't', M_TO, 0, eat_regexp}, {
72 'U', M_UNREAD, 0, NULL}, {
73 'v', M_COLLAPSED, 0, NULL}, {
74 'V', M_CRYPT_VERIFIED, 0, NULL},
77 'w', M_NEWSGROUPS, 0, eat_regexp},
80 'x', M_REFERENCE, 0, eat_regexp}, {
81 'y', M_XLABEL, 0, eat_regexp}, {
82 'z', M_SIZE, 0, eat_range}, {
83 '=', M_DUPLICATED, 0, NULL}, {
84 '$', M_UNREFERENCED, 0, NULL}, {
85 '*', M_REALNAME, 0, NULL}, {
89 static pattern_t *SearchPattern = NULL; /* current search pattern */
90 static char LastSearch[STRING] = { 0 }; /* last pattern searched for */
91 static char LastSearchExpn[LONG_STRING] = { 0 }; /* expanded version of
96 /* constants for parse_date_range() */
97 #define M_PDR_NONE 0x0000
98 #define M_PDR_MINUS 0x0001
99 #define M_PDR_PLUS 0x0002
100 #define M_PDR_WINDOW 0x0004
101 #define M_PDR_ABSOLUTE 0x0008
102 #define M_PDR_DONE 0x0010
103 #define M_PDR_ERROR 0x0100
104 #define M_PDR_ERRORDONE (M_PDR_ERROR | M_PDR_DONE)
107 int mutt_getvaluebychar (char ch, struct mapping_t *table)
111 for (i = 0; table[i].name; i++) {
112 if (ch == table[i].name[0])
113 return table[i].value;
119 /* if no uppercase letters are given, do a case-insensitive search */
120 int mutt_which_case (const char *s)
123 if (isalpha ((unsigned char) *s) && isupper ((unsigned char) *s))
124 return 0; /* case-sensitive */
127 return REG_ICASE; /* case-insensitive */
131 msg_search (CONTEXT * ctx, regex_t * rx, char *buf, size_t blen, int op,
134 char tempfile[_POSIX_PATH_MAX];
141 HEADER *h = ctx->hdrs[msgno];
143 if ((msg = mx_open_message (ctx, msgno)) != NULL) {
144 if (option (OPTTHOROUGHSRC)) {
145 /* decode the header / body */
146 memset (&s, 0, sizeof (s));
148 s.flags = M_CHARCONV;
149 mutt_mktemp (tempfile);
150 if ((s.fpout = safe_fopen (tempfile, "w+")) == NULL) {
151 mutt_perror (tempfile);
156 mutt_copy_header (msg->fp, h, s.fpout, CH_FROM | CH_DECODE, NULL);
158 if (op != M_HEADER) {
159 mutt_parse_mime_message (ctx, h);
161 if (WithCrypto && (h->security & ENCRYPT)
162 && !crypt_valid_passphrase (h->security)) {
163 mx_close_message (&msg);
171 fseek (msg->fp, h->offset, 0);
172 mutt_body_handler (h->content, &s);
178 fstat (fileno (fp), &st);
179 lng = (long) st.st_size;
182 /* raw header / body */
185 fseek (fp, h->offset, 0);
186 lng = h->content->offset - h->offset;
188 if (op != M_HEADER) {
190 fseek (fp, h->content->offset, 0);
191 lng += h->content->length;
195 /* search the file "fp" */
197 if (fgets (buf, blen - 1, fp) == NULL)
198 break; /* don't loop forever */
199 if (regexec (rx, buf, 0, NULL, 0) == 0) {
203 lng -= mutt_strlen (buf);
206 mx_close_message (&msg);
208 if (option (OPTTHOROUGHSRC)) {
217 int eat_regexp (pattern_t * pat, BUFFER * s, BUFFER * err)
222 memset (&buf, 0, sizeof (buf));
223 if (mutt_extract_token (&buf, s, M_TOKEN_PATTERN | M_TOKEN_COMMENT) != 0 ||
225 snprintf (err->data, err->dsize, _("Error in expression: %s"), s->dptr);
228 pat->rx = safe_malloc (sizeof (regex_t));
230 REGCOMP (pat->rx, buf.data,
231 REG_NEWLINE | REG_NOSUB | mutt_which_case (buf.data));
234 regerror (r, pat->rx, err->data, err->dsize);
242 int eat_range (pattern_t * pat, BUFFER * s, BUFFER * err)
245 int do_exclusive = 0;
249 * If simple_search is set to "~m %s", the range will have double quotes
252 if (*s->dptr == '"') {
258 if ((*s->dptr != '-') && (*s->dptr != '<')) {
260 if (*s->dptr == '>') {
261 pat->max = M_MAXRANGE;
262 pat->min = strtol (s->dptr + 1, &tmp, 0) + 1; /* exclusive range */
265 pat->min = strtol (s->dptr, &tmp, 0);
266 if (toupper ((unsigned char) *tmp) == 'K') { /* is there a prefix? */
270 else if (toupper ((unsigned char) *tmp) == 'M') {
274 if (*s->dptr == '>') {
291 if (isdigit ((unsigned char) *tmp)) {
293 pat->max = strtol (tmp, &tmp, 0);
294 if (toupper ((unsigned char) *tmp) == 'K') {
298 else if (toupper ((unsigned char) *tmp) == 'M') {
306 pat->max = M_MAXRANGE;
308 if (skip_quote && *tmp == '"')
316 static const char *getDate (const char *s, struct tm *t, BUFFER * err)
319 time_t now = time (NULL);
320 struct tm *tm = localtime (&now);
322 t->tm_mday = strtol (s, &p, 10);
323 if (t->tm_mday < 1 || t->tm_mday > 31) {
324 snprintf (err->data, err->dsize, _("Invalid day of month: %s"), s);
328 /* fill in today's month and year */
329 t->tm_mon = tm->tm_mon;
330 t->tm_year = tm->tm_year;
334 t->tm_mon = strtol (p, &p, 10) - 1;
335 if (t->tm_mon < 0 || t->tm_mon > 11) {
336 snprintf (err->data, err->dsize, _("Invalid month: %s"), p);
340 t->tm_year = tm->tm_year;
344 t->tm_year = strtol (p, &p, 10);
345 if (t->tm_year < 70) /* year 2000+ */
347 else if (t->tm_year > 1900)
356 static const char *get_offset (struct tm *tm, const char *s, int sign)
359 int offset = strtol (s, &ps, 0);
361 if ((sign < 0 && offset > 0) || (sign > 0 && offset < 0))
366 tm->tm_year += offset;
369 tm->tm_mon += offset;
372 tm->tm_mday += 7 * offset;
375 tm->tm_mday += offset;
380 mutt_normalize_time (tm);
384 static void adjust_date_range (struct tm *min, struct tm *max)
386 if (min->tm_year > max->tm_year
387 || (min->tm_year == max->tm_year && min->tm_mon > max->tm_mon)
388 || (min->tm_year == max->tm_year && min->tm_mon == max->tm_mon
389 && min->tm_mday > max->tm_mday)) {
393 min->tm_year = max->tm_year;
397 min->tm_mon = max->tm_mon;
401 min->tm_mday = max->tm_mday;
404 min->tm_hour = min->tm_min = min->tm_sec = 0;
406 max->tm_min = max->tm_sec = 59;
410 static const char *parse_date_range (const char *pc, struct tm *min,
411 struct tm *max, int haveMin,
412 struct tm *baseMin, BUFFER * err)
414 int flag = M_PDR_NONE;
416 while (*pc && ((flag & M_PDR_DONE) == 0)) {
424 /* try a range of absolute date minus offset of Ndwmy */
425 pt = get_offset (min, pc, -1);
427 if (flag == M_PDR_NONE) { /* nothing yet and no offset parsed => absolute date? */
428 if (!getDate (pc, max, err))
429 flag |= (M_PDR_ABSOLUTE | M_PDR_ERRORDONE); /* done bad */
431 /* reestablish initial base minimum if not specified */
433 memcpy (min, baseMin, sizeof (struct tm));
434 flag |= (M_PDR_ABSOLUTE | M_PDR_DONE); /* done good */
438 flag |= M_PDR_ERRORDONE;
442 if (flag == M_PDR_NONE && !haveMin) { /* the very first "-3d" without a previous absolute date */
443 max->tm_year = min->tm_year;
444 max->tm_mon = min->tm_mon;
445 max->tm_mday = min->tm_mday;
452 { /* enlarge plusRange */
453 pt = get_offset (max, pc, 1);
455 flag |= M_PDR_ERRORDONE;
463 { /* enlarge window in both directions */
464 pt = get_offset (min, pc, -1);
466 flag |= M_PDR_ERRORDONE;
468 pc = get_offset (max, pc, 1);
469 flag |= M_PDR_WINDOW;
474 flag |= M_PDR_ERRORDONE;
478 if ((flag & M_PDR_ERROR) && !(flag & M_PDR_ABSOLUTE)) { /* getDate has its own error message, don't overwrite it here */
479 snprintf (err->data, err->dsize, _("Invalid relative date: %s"), pc - 1);
481 return ((flag & M_PDR_ERROR) ? NULL : pc);
484 static int eat_date (pattern_t * pat, BUFFER * s, BUFFER * err)
489 memset (&buffer, 0, sizeof (buffer));
490 if (mutt_extract_token (&buffer, s, M_TOKEN_COMMENT | M_TOKEN_PATTERN) != 0
492 strfcpy (err->data, _("error in expression"), err->dsize);
496 memset (&min, 0, sizeof (min));
497 /* the `0' time is Jan 1, 1970 UTC, so in order to prevent a negative time
498 when doing timezone conversion, we use Jan 2, 1970 UTC as the base
503 memset (&max, 0, sizeof (max));
505 /* Arbitrary year in the future. Don't set this too high
506 or mutt_mktime() returns something larger than will
507 fit in a time_t on some systems */
515 if (strchr ("<>=", buffer.data[0])) {
516 /* offset from current time
517 <3d less than three days ago
518 >3d more than three days ago
519 =3d exactly three days ago */
520 time_t now = time (NULL);
521 struct tm *tm = localtime (&now);
524 if (buffer.data[0] == '<') {
525 memcpy (&min, tm, sizeof (min));
529 memcpy (&max, tm, sizeof (max));
532 if (buffer.data[0] == '=')
536 tm->tm_min = tm->tm_sec = 59;
538 /* force negative offset */
539 get_offset (tm, buffer.data + 1, -1);
542 /* start at the beginning of the day in question */
543 memcpy (&min, &max, sizeof (max));
544 min.tm_hour = min.tm_sec = min.tm_min = 0;
548 const char *pc = buffer.data;
551 int untilNow = FALSE;
553 if (isdigit ((unsigned char) *pc)) {
554 /* mininum date specified */
555 if ((pc = getDate (pc, &min, err)) == NULL) {
562 const char *pt = pc + 1;
565 untilNow = (*pt == '\0');
569 if (!untilNow) { /* max date or relative range/window */
573 if (!haveMin) { /* save base minimum and set current date, e.g. for "-3d+1d" */
574 time_t now = time (NULL);
575 struct tm *tm = localtime (&now);
577 memcpy (&baseMin, &min, sizeof (baseMin));
578 memcpy (&min, tm, sizeof (min));
579 min.tm_hour = min.tm_sec = min.tm_min = 0;
582 /* preset max date for relative offsets,
583 if nothing follows we search for messages on a specific day */
584 max.tm_year = min.tm_year;
585 max.tm_mon = min.tm_mon;
586 max.tm_mday = min.tm_mday;
588 if (!parse_date_range (pc, &min, &max, haveMin, &baseMin, err)) { /* bail out on any parsing error */
595 /* Since we allow two dates to be specified we'll have to adjust that. */
596 adjust_date_range (&min, &max);
598 pat->min = mutt_mktime (&min, 1);
599 pat->max = mutt_mktime (&max, 1);
606 static struct pattern_flags *lookup_tag (char tag)
610 for (i = 0; Flags[i].tag; i++)
611 if (Flags[i].tag == tag)
616 static /* const */ char *find_matching_paren ( /* const */ char *s)
623 else if (*s == ')') {
632 void mutt_pattern_free (pattern_t ** pat)
645 mutt_pattern_free (&tmp->child);
650 pattern_t *mutt_pattern_comp ( /* const */ char *s, int flags, BUFFER * err)
652 pattern_t *curlist = NULL;
654 pattern_t *last = NULL;
658 int implicit = 1; /* used to detect logical AND operator */
659 struct pattern_flags *entry;
664 memset (&ps, 0, sizeof (ps));
666 ps.dsize = mutt_strlen (s);
682 snprintf (err->data, err->dsize, _("error in pattern at: %s"),
687 /* A & B | C == (A & B) | C */
688 tmp = new_pattern ();
690 tmp->child = curlist;
704 if (implicit && or) {
705 /* A | B & C == (A | B) & C */
706 tmp = new_pattern ();
708 tmp->child = curlist;
714 tmp = new_pattern ();
716 tmp->alladdr = alladdr;
726 ps.dptr++; /* move past the ~ */
727 if ((entry = lookup_tag (*ps.dptr)) == NULL) {
728 snprintf (err->data, err->dsize, _("%c: invalid command"), *ps.dptr);
729 mutt_pattern_free (&curlist);
732 if (entry->class && (flags & entry->class) == 0) {
733 snprintf (err->data, err->dsize, _("%c: not supported in this mode"),
735 mutt_pattern_free (&curlist);
740 ps.dptr++; /* eat the operator and any optional whitespace */
743 if (entry->eat_arg) {
745 snprintf (err->data, err->dsize, _("missing parameter"));
746 mutt_pattern_free (&curlist);
749 if (entry->eat_arg (tmp, &ps, err) == -1) {
750 mutt_pattern_free (&curlist);
757 p = find_matching_paren (ps.dptr + 1);
759 snprintf (err->data, err->dsize, _("mismatched parenthesis: %s"),
761 mutt_pattern_free (&curlist);
764 /* compile the sub-expression */
765 buf = mutt_substrdup (ps.dptr + 1, p);
766 if ((tmp = mutt_pattern_comp (buf, flags, err)) == NULL) {
768 mutt_pattern_free (&curlist);
778 tmp->alladdr |= alladdr;
781 ps.dptr = p + 1; /* restore location */
784 snprintf (err->data, err->dsize, _("error in pattern at: %s"), ps.dptr);
785 mutt_pattern_free (&curlist);
790 strfcpy (err->data, _("empty pattern"), err->dsize);
794 tmp = new_pattern ();
795 tmp->op = or ? M_OR : M_AND;
796 tmp->child = curlist;
803 perform_and (pattern_t * pat, pattern_exec_flag flags, CONTEXT * ctx,
806 for (; pat; pat = pat->next)
807 if (mutt_pattern_exec (pat, flags, ctx, hdr) <= 0)
813 perform_or (struct pattern_t *pat, pattern_exec_flag flags, CONTEXT * ctx,
816 for (; pat; pat = pat->next)
817 if (mutt_pattern_exec (pat, flags, ctx, hdr) > 0)
822 static int match_adrlist (regex_t * rx, int match_personal, int alladdr,
830 for (a = va_arg (ap, ADDRESS *); a; a = a->next) {
832 ((a->mailbox && regexec (rx, a->mailbox, 0, NULL, 0) == 0) ||
833 (match_personal && a->personal &&
834 regexec (rx, a->personal, 0, NULL, 0) == 0))) {
836 return (!alladdr); /* Found match, or non-match if alladdr */
841 return alladdr; /* No matches, or all matches if alladdr */
844 static int match_reference (regex_t * rx, LIST * refs)
846 for (; refs; refs = refs->next)
847 if (regexec (rx, refs->data, 0, NULL, 0) == 0)
852 int mutt_is_list_recipient (int alladdr, ADDRESS * a1, ADDRESS * a2)
854 for (; a1; a1 = a1->next)
855 if (alladdr ^ mutt_is_subscribed_list (a1))
857 for (; a2; a2 = a2->next)
858 if (alladdr ^ mutt_is_subscribed_list (a2))
863 int mutt_is_list_cc (int alladdr, ADDRESS * a1, ADDRESS * a2)
865 for (; a1; a1 = a1->next)
866 if (alladdr ^ mutt_is_mail_list (a1))
868 for (; a2; a2 = a2->next)
869 if (alladdr ^ mutt_is_mail_list (a2))
874 static int match_user (int alladdr, ADDRESS * a1, ADDRESS * a2)
876 for (; a1; a1 = a1->next)
877 if (alladdr ^ mutt_addr_is_user (a1))
879 for (; a2; a2 = a2->next)
880 if (alladdr ^ mutt_addr_is_user (a2))
885 /* test if name is considered a real name, i.e. consists of at least 2
886 * space-separated words of which none may end in a dot
888 static int valid_realname (const char *name)
890 const char *p = name;
897 /* skip abbr. parts of names (e.g. 'J. User') */
905 M_MATCH_FULL_ADDRESS match both personal and machine address */
907 mutt_pattern_exec (struct pattern_t *pat, pattern_exec_flag flags,
908 CONTEXT * ctx, HEADER * h)
914 return (pat->not ^ (perform_and (pat->child, flags, ctx, h) > 0));
916 return (pat->not ^ (perform_or (pat->child, flags, ctx, h) > 0));
920 return (pat->not ^ h->expired);
922 return (pat->not ^ h->superseded);
924 return (pat->not ^ h->flagged);
926 return (pat->not ^ h->tagged);
928 return (pat->not ? h->old || h->read : !(h->old || h->read));
930 return (pat->not ? h->read : !h->read);
932 return (pat->not ^ h->replied);
934 return (pat->not ? (!h->old || h->read) : (h->old && !h->read));
936 return (pat->not ^ h->read);
938 return (pat->not ^ h->deleted);
940 return (pat->not ^ (h->msgno >= pat->min - 1 && (pat->max == M_MAXRANGE ||
945 not ^ (h->date_sent >= pat->min && h->date_sent <= pat->max));
946 case M_DATE_RECEIVED:
947 return (pat->not ^ (h->received >= pat->min && h->received <= pat->max));
952 not ^ msg_search (ctx, pat->rx, buf, sizeof (buf), pat->op,
955 return (pat->not ^ match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
956 pat->alladdr, 1, h->env->sender));
958 return (pat->not ^ match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
959 pat->alladdr, 1, h->env->from));
961 return (pat->not ^ match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
962 pat->alladdr, 1, h->env->to));
964 return (pat->not ^ match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
965 pat->alladdr, 1, h->env->cc));
968 not ^ (h->env && h->env->subject
969 && regexec (pat->rx, h->env->subject, 0, NULL, 0) == 0));
972 not ^ (h->env && h->env->message_id
973 && regexec (pat->rx, h->env->message_id, 0, NULL,
976 return (pat->not ^ (h->score >= pat->min && (pat->max == M_MAXRANGE ||
977 h->score <= pat->max)));
980 not ^ (h->content->length >= pat->min
981 && (pat->max == M_MAXRANGE
982 || h->content->length <= pat->max)));
984 return (pat->not ^ match_reference (pat->rx, h->env->references));
988 && match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
989 pat->alladdr, 4, h->env->from,
990 h->env->sender, h->env->to,
995 && match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
996 pat->alladdr, 2, h->env->to,
1001 && mutt_is_list_recipient (pat->alladdr, h->env->to,
1003 case M_PERSONAL_RECIP:
1006 && match_user (pat->alladdr, h->env->to, h->env->cc)));
1007 case M_PERSONAL_FROM:
1009 not ^ (h->env && match_user (pat->alladdr, h->env->from, NULL)));
1011 return (pat->not ^ (h->collapsed && h->num_hidden > 1));
1015 return (pat->not ^ ((h->security & SIGN) ? 1 : 0));
1016 case M_CRYPT_VERIFIED:
1019 return (pat->not ^ ((h->security & GOODSIGN) ? 1 : 0));
1020 case M_CRYPT_ENCRYPT:
1023 return (pat->not ^ ((h->security & ENCRYPT) ? 1 : 0));
1025 if (!(WithCrypto & APPLICATION_PGP))
1027 return (pat->not ^ ((h->security & APPLICATION_PGP)
1028 && (h->security & PGPKEY)));
1031 not ^ (h->env->x_label
1032 && regexec (pat->rx, h->env->x_label, 0, NULL, 0) == 0));
1035 not ^ (h->env->spam && h->env->spam->data
1036 && regexec (pat->rx, h->env->spam->data, 0, NULL,
1039 return (pat->not ^ (h->thread && h->thread->duplicate_thread));
1040 case M_UNREFERENCED:
1041 return (pat->not ^ (h->thread && !h->thread->child));
1044 * we have a match if
1045 * - From: matches $alternates
1046 * - or we have an alias for current address
1047 * - or From: contains valid email address _and_ name has >= 2 fields
1050 not ^ (h->env && h->env->from && (mutt_addr_is_user (h->env->from)
1052 (alias_reverse_lookup
1053 (h->env->from) != NULL)
1054 || (h->env->from->personal
1055 && valid_realname (h->env->
1058 && h->env->from->mailbox)
1063 not ^ (h->env->newsgroups
1064 && regexec (pat->rx, h->env->newsgroups, 0, NULL,
1068 mutt_error (_("error: unknown op %d (report this error)."), pat->op);
1072 static void quote_simple (char *tmp, size_t len, const char *p)
1077 while (*p && i < len - 3) {
1078 if (*p == '\\' || *p == '"')
1086 /* convert a simple search into a real request */
1087 void mutt_check_simple (char *s, size_t len, const char *simple)
1089 char tmp[LONG_STRING];
1091 /* XXX - is ascii_strcasecmp() right here, or should we use locale's
1095 if (!strchr (s, '~')) { /* yup, so spoof a real request */
1096 /* convert old tokens into the new format */
1097 if (ascii_strcasecmp ("all", s) == 0 || !mutt_strcmp ("^", s) || !mutt_strcmp (".", s)) /* ~A is more efficient */
1098 strfcpy (s, "~A", len);
1099 else if (ascii_strcasecmp ("del", s) == 0)
1100 strfcpy (s, "~D", len);
1101 else if (ascii_strcasecmp ("flag", s) == 0)
1102 strfcpy (s, "~F", len);
1103 else if (ascii_strcasecmp ("new", s) == 0)
1104 strfcpy (s, "~N", len);
1105 else if (ascii_strcasecmp ("old", s) == 0)
1106 strfcpy (s, "~O", len);
1107 else if (ascii_strcasecmp ("repl", s) == 0)
1108 strfcpy (s, "~Q", len);
1109 else if (ascii_strcasecmp ("read", s) == 0)
1110 strfcpy (s, "~R", len);
1111 else if (ascii_strcasecmp ("tag", s) == 0)
1112 strfcpy (s, "~T", len);
1113 else if (ascii_strcasecmp ("unread", s) == 0)
1114 strfcpy (s, "~U", len);
1116 quote_simple (tmp, sizeof (tmp), s);
1117 mutt_expand_fmt (s, len, simple, tmp);
1122 int mutt_pattern_func (int op, char *prompt)
1125 char buf[LONG_STRING] = "", *simple, error[STRING];
1129 strfcpy (buf, NONULL (Context->pattern), sizeof (buf));
1130 if (prompt || op != M_LIMIT)
1131 if (mutt_get_field (prompt, buf, sizeof (buf), M_PATTERN | M_CLEAR) != 0
1135 mutt_message _("Compiling search pattern...");
1137 simple = safe_strdup (buf);
1138 mutt_check_simple (buf, sizeof (buf), NONULL (SimpleSearch));
1141 err.dsize = sizeof (error);
1142 if ((pat = mutt_pattern_comp (buf, M_FULL_MSG, &err)) == NULL) {
1144 mutt_error ("%s", err.data);
1148 mutt_message _("Executing command on matching messages...");
1150 #define THIS_BODY Context->hdrs[i]->content
1152 if (op == M_LIMIT) {
1153 Context->vcount = 0;
1155 Context->collapsed = 0;
1157 for (i = 0; i < Context->msgcount; i++) {
1158 /* new limit pattern implicitly uncollapses all threads */
1159 Context->hdrs[i]->virtual = -1;
1160 Context->hdrs[i]->limited = 0;
1161 Context->hdrs[i]->collapsed = 0;
1162 Context->hdrs[i]->num_hidden = 0;
1163 if (mutt_pattern_exec
1164 (pat, M_MATCH_FULL_ADDRESS, Context, Context->hdrs[i])) {
1165 Context->hdrs[i]->virtual = Context->vcount;
1166 Context->hdrs[i]->limited = 1;
1167 Context->v2r[Context->vcount] = i;
1169 Context->vsize += THIS_BODY->length + THIS_BODY->offset -
1170 THIS_BODY->hdr_offset;
1175 for (i = 0; i < Context->vcount; i++) {
1176 if (mutt_pattern_exec
1177 (pat, M_MATCH_FULL_ADDRESS, Context,
1178 Context->hdrs[Context->v2r[i]])) {
1181 mutt_set_flag (Context, Context->hdrs[Context->v2r[i]], M_PURGED,
1184 mutt_set_flag (Context, Context->hdrs[Context->v2r[i]], M_DELETE,
1189 mutt_set_flag (Context, Context->hdrs[Context->v2r[i]], M_TAG,
1199 mutt_clear_error ();
1201 if (op == M_LIMIT) {
1202 FREE (&Context->pattern);
1203 if (Context->limit_pattern)
1204 mutt_pattern_free (&Context->limit_pattern);
1205 if (!Context->vcount) {
1206 mutt_error _("No messages matched criteria.");
1209 Context->vcount = Context->msgcount;
1210 /* restore full display */
1211 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) {
1218 Context->pattern = simple;
1219 simple = NULL; /* don't clobber it */
1220 Context->limit_pattern = mutt_pattern_comp (buf, M_FULL_MSG, &err);
1224 mutt_pattern_free (&pat);
1228 int mutt_search_command (int cur, int op)
1232 char temp[LONG_STRING];
1238 if (op != OP_SEARCH_NEXT && op != OP_SEARCH_OPPOSITE) {
1239 strfcpy (buf, LastSearch, sizeof (buf));
1240 if (mutt_get_field ((op == OP_SEARCH) ? _("Search for: ") :
1241 _("Reverse search for: "), buf, sizeof (buf),
1242 M_CLEAR | M_PATTERN) != 0 || !buf[0])
1245 if (op == OP_SEARCH)
1246 unset_option (OPTSEARCHREVERSE);
1248 set_option (OPTSEARCHREVERSE);
1250 /* compare the *expanded* version of the search pattern in case
1251 $simple_search has changed while we were searching */
1252 strfcpy (temp, buf, sizeof (temp));
1253 mutt_check_simple (temp, sizeof (temp), NONULL (SimpleSearch));
1255 if (!SearchPattern || mutt_strcmp (temp, LastSearchExpn)) {
1256 set_option (OPTSEARCHINVALID);
1257 strfcpy (LastSearch, buf, sizeof (LastSearch));
1258 mutt_message _("Compiling search pattern...");
1260 mutt_pattern_free (&SearchPattern);
1262 err.dsize = sizeof (error);
1263 if ((SearchPattern =
1264 mutt_pattern_comp (temp, M_FULL_MSG, &err)) == NULL) {
1265 mutt_error ("%s", error);
1268 mutt_clear_error ();
1271 else if (!SearchPattern) {
1272 mutt_error _("No search pattern.");
1277 if (option (OPTSEARCHINVALID)) {
1278 for (i = 0; i < Context->msgcount; i++)
1279 Context->hdrs[i]->searched = 0;
1280 unset_option (OPTSEARCHINVALID);
1283 incr = (option (OPTSEARCHREVERSE)) ? -1 : 1;
1284 if (op == OP_SEARCH_OPPOSITE)
1287 for (i = cur + incr, j = 0; j != Context->vcount; j++) {
1288 if (i > Context->vcount - 1) {
1290 if (option (OPTWRAPSEARCH))
1291 mutt_message (_("Search wrapped to top."));
1294 mutt_message _("Search hit bottom without finding match");
1300 i = Context->vcount - 1;
1301 if (option (OPTWRAPSEARCH))
1302 mutt_message (_("Search wrapped to bottom."));
1305 mutt_message _("Search hit top without finding match");
1311 h = Context->hdrs[Context->v2r[i]];
1313 /* if we've already evaulated this message, use the cached value */
1318 /* remember that we've already searched this message */
1322 (SearchPattern, M_MATCH_FULL_ADDRESS, Context, h) > 0)))
1327 mutt_error _("Search interrupted.");
1336 mutt_error _("Not found.");