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.
31 #include "mutt_crypt.h"
33 static int eat_regexp (pattern_t * pat, BUFFER *, BUFFER *);
34 static int eat_date (pattern_t * pat, BUFFER *, BUFFER *);
35 static int eat_range (pattern_t * pat, BUFFER *, BUFFER *);
37 struct pattern_flags {
38 int tag; /* character used to represent this op */
39 int op; /* operation to perform */
41 int (*eat_arg) (pattern_t *, BUFFER *, BUFFER *);
44 'A', M_ALL, 0, NULL}, {
45 'b', M_BODY, M_FULL_MSG, eat_regexp}, {
46 'B', M_WHOLE_MSG, M_FULL_MSG, eat_regexp}, {
47 'c', M_CC, 0, eat_regexp}, {
48 'C', M_RECIPIENT, 0, eat_regexp}, {
49 'd', M_DATE, 0, eat_date}, {
50 'D', M_DELETED, 0, NULL}, {
51 'e', M_SENDER, 0, eat_regexp}, {
52 'E', M_EXPIRED, 0, NULL}, {
53 'f', M_FROM, 0, eat_regexp}, {
54 'F', M_FLAG, 0, NULL}, {
55 'g', M_CRYPT_SIGN, 0, NULL}, {
56 'G', M_CRYPT_ENCRYPT, 0, NULL}, {
57 'h', M_HEADER, M_FULL_MSG, eat_regexp}, {
58 'H', M_HORMEL, 0, eat_regexp}, {
59 'i', M_ID, 0, eat_regexp}, {
60 'k', M_PGP_KEY, 0, NULL}, {
61 'L', M_ADDRESS, 0, eat_regexp}, {
62 'l', M_LIST, 0, NULL}, {
63 'm', M_MESSAGE, 0, eat_range}, {
64 'n', M_SCORE, 0, eat_range}, {
65 'N', M_NEW, 0, NULL}, {
66 'O', M_OLD, 0, NULL}, {
67 'p', M_PERSONAL_RECIP, 0, NULL}, {
68 'P', M_PERSONAL_FROM, 0, NULL}, {
69 'Q', M_REPLIED, 0, NULL}, {
70 'R', M_READ, 0, NULL}, {
71 'r', M_DATE_RECEIVED, 0, eat_date}, {
72 's', M_SUBJECT, 0, eat_regexp}, {
73 'S', M_SUPERSEDED, 0, NULL}, {
74 'T', M_TAG, 0, NULL}, {
75 't', M_TO, 0, eat_regexp}, {
76 'U', M_UNREAD, 0, NULL}, {
77 'v', M_COLLAPSED, 0, NULL}, {
78 'V', M_CRYPT_VERIFIED, 0, NULL},
81 '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}, {
88 '$', M_UNREFERENCED, 0, NULL}, {
89 '*', M_REALNAME, 0, NULL}, {
93 static pattern_t *SearchPattern = NULL; /* current search pattern */
94 static char LastSearch[STRING] = { 0 }; /* last pattern searched for */
95 static char LastSearchExpn[LONG_STRING] = { 0 }; /* expanded version of
100 /* constants for parse_date_range() */
101 #define M_PDR_NONE 0x0000
102 #define M_PDR_MINUS 0x0001
103 #define M_PDR_PLUS 0x0002
104 #define M_PDR_WINDOW 0x0004
105 #define M_PDR_ABSOLUTE 0x0008
106 #define M_PDR_DONE 0x0010
107 #define M_PDR_ERROR 0x0100
108 #define M_PDR_ERRORDONE (M_PDR_ERROR | M_PDR_DONE)
111 int mutt_getvaluebychar (char ch, struct mapping_t *table)
115 for (i = 0; table[i].name; i++) {
116 if (ch == table[i].name[0])
117 return table[i].value;
123 /* if no uppercase letters are given, do a case-insensitive search */
124 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,
138 char tempfile[_POSIX_PATH_MAX];
145 HEADER *h = ctx->hdrs[msgno];
147 if ((msg = mx_open_message (ctx, msgno)) != NULL) {
148 if (option (OPTTHOROUGHSRC)) {
149 /* decode the header / body */
150 memset (&s, 0, sizeof (s));
152 s.flags = M_CHARCONV;
153 mutt_mktemp (tempfile);
154 if ((s.fpout = safe_fopen (tempfile, "w+")) == NULL) {
155 mutt_perror (tempfile);
160 mutt_copy_header (msg->fp, h, s.fpout, CH_FROM | CH_DECODE, NULL);
162 if (op != M_HEADER) {
163 mutt_parse_mime_message (ctx, h);
165 if (WithCrypto && (h->security & ENCRYPT)
166 && !crypt_valid_passphrase (h->security)) {
167 mx_close_message (&msg);
175 fseek (msg->fp, h->offset, 0);
176 mutt_body_handler (h->content, &s);
182 fstat (fileno (fp), &st);
183 lng = (long) st.st_size;
186 /* raw header / body */
189 fseek (fp, h->offset, 0);
190 lng = h->content->offset - h->offset;
192 if (op != M_HEADER) {
194 fseek (fp, h->content->offset, 0);
195 lng += h->content->length;
199 /* search the file "fp" */
201 if (fgets (buf, blen - 1, fp) == NULL)
202 break; /* don't loop forever */
203 if (regexec (rx, buf, 0, NULL, 0) == 0) {
207 lng -= mutt_strlen (buf);
210 mx_close_message (&msg);
212 if (option (OPTTHOROUGHSRC)) {
221 int eat_regexp (pattern_t * pat, BUFFER * s, BUFFER * err)
226 memset (&buf, 0, sizeof (buf));
227 if (mutt_extract_token (&buf, s, M_TOKEN_PATTERN | M_TOKEN_COMMENT) != 0 ||
229 snprintf (err->data, err->dsize, _("Error in expression: %s"), s->dptr);
232 pat->rx = safe_malloc (sizeof (regex_t));
234 REGCOMP (pat->rx, buf.data,
235 REG_NEWLINE | REG_NOSUB | mutt_which_case (buf.data));
238 regerror (r, pat->rx, err->data, err->dsize);
246 int eat_range (pattern_t * pat, BUFFER * s, BUFFER * err)
249 int do_exclusive = 0;
253 * If simple_search is set to "~m %s", the range will have double quotes
256 if (*s->dptr == '"') {
262 if ((*s->dptr != '-') && (*s->dptr != '<')) {
264 if (*s->dptr == '>') {
265 pat->max = M_MAXRANGE;
266 pat->min = strtol (s->dptr + 1, &tmp, 0) + 1; /* exclusive range */
269 pat->min = strtol (s->dptr, &tmp, 0);
270 if (toupper ((unsigned char) *tmp) == 'K') { /* is there a prefix? */
274 else if (toupper ((unsigned char) *tmp) == 'M') {
278 if (*s->dptr == '>') {
295 if (isdigit ((unsigned char) *tmp)) {
297 pat->max = strtol (tmp, &tmp, 0);
298 if (toupper ((unsigned char) *tmp) == 'K') {
302 else if (toupper ((unsigned char) *tmp) == 'M') {
310 pat->max = M_MAXRANGE;
312 if (skip_quote && *tmp == '"')
320 static const char *getDate (const char *s, struct tm *t, BUFFER * err)
323 time_t now = time (NULL);
324 struct tm *tm = localtime (&now);
326 t->tm_mday = strtol (s, &p, 10);
327 if (t->tm_mday < 1 || t->tm_mday > 31) {
328 snprintf (err->data, err->dsize, _("Invalid day of month: %s"), s);
332 /* fill in today's month and year */
333 t->tm_mon = tm->tm_mon;
334 t->tm_year = tm->tm_year;
338 t->tm_mon = strtol (p, &p, 10) - 1;
339 if (t->tm_mon < 0 || t->tm_mon > 11) {
340 snprintf (err->data, err->dsize, _("Invalid month: %s"), p);
344 t->tm_year = tm->tm_year;
348 t->tm_year = strtol (p, &p, 10);
349 if (t->tm_year < 70) /* year 2000+ */
351 else if (t->tm_year > 1900)
360 static const char *get_offset (struct tm *tm, const char *s, int sign)
363 int offset = strtol (s, &ps, 0);
365 if ((sign < 0 && offset > 0) || (sign > 0 && offset < 0))
370 tm->tm_year += offset;
373 tm->tm_mon += offset;
376 tm->tm_mday += 7 * offset;
379 tm->tm_mday += offset;
384 mutt_normalize_time (tm);
388 static void adjust_date_range (struct tm *min, struct tm *max)
390 if (min->tm_year > max->tm_year
391 || (min->tm_year == max->tm_year && min->tm_mon > max->tm_mon)
392 || (min->tm_year == max->tm_year && min->tm_mon == max->tm_mon
393 && min->tm_mday > max->tm_mday)) {
397 min->tm_year = max->tm_year;
401 min->tm_mon = max->tm_mon;
405 min->tm_mday = max->tm_mday;
408 min->tm_hour = min->tm_min = min->tm_sec = 0;
410 max->tm_min = max->tm_sec = 59;
414 static const char *parse_date_range (const char *pc, struct tm *min,
415 struct tm *max, int haveMin,
416 struct tm *baseMin, BUFFER * err)
418 int flag = M_PDR_NONE;
420 while (*pc && ((flag & M_PDR_DONE) == 0)) {
428 /* try a range of absolute date minus offset of Ndwmy */
429 pt = get_offset (min, pc, -1);
431 if (flag == M_PDR_NONE) { /* nothing yet and no offset parsed => absolute date? */
432 if (!getDate (pc, max, err))
433 flag |= (M_PDR_ABSOLUTE | M_PDR_ERRORDONE); /* done bad */
435 /* reestablish initial base minimum if not specified */
437 memcpy (min, baseMin, sizeof (struct tm));
438 flag |= (M_PDR_ABSOLUTE | M_PDR_DONE); /* done good */
442 flag |= M_PDR_ERRORDONE;
446 if (flag == M_PDR_NONE && !haveMin) { /* the very first "-3d" without a previous absolute date */
447 max->tm_year = min->tm_year;
448 max->tm_mon = min->tm_mon;
449 max->tm_mday = min->tm_mday;
456 { /* enlarge plusRange */
457 pt = get_offset (max, pc, 1);
459 flag |= M_PDR_ERRORDONE;
467 { /* enlarge window in both directions */
468 pt = get_offset (min, pc, -1);
470 flag |= M_PDR_ERRORDONE;
472 pc = get_offset (max, pc, 1);
473 flag |= M_PDR_WINDOW;
478 flag |= M_PDR_ERRORDONE;
482 if ((flag & M_PDR_ERROR) && !(flag & M_PDR_ABSOLUTE)) { /* getDate has its own error message, don't overwrite it here */
483 snprintf (err->data, err->dsize, _("Invalid relative date: %s"), pc - 1);
485 return ((flag & M_PDR_ERROR) ? NULL : pc);
488 static int eat_date (pattern_t * pat, BUFFER * s, BUFFER * err)
493 memset (&buffer, 0, sizeof (buffer));
494 if (mutt_extract_token (&buffer, s, M_TOKEN_COMMENT | M_TOKEN_PATTERN) != 0
496 strfcpy (err->data, _("error in expression"), err->dsize);
500 memset (&min, 0, sizeof (min));
501 /* the `0' time is Jan 1, 1970 UTC, so in order to prevent a negative time
502 when doing timezone conversion, we use Jan 2, 1970 UTC as the base
507 memset (&max, 0, sizeof (max));
509 /* Arbitrary year in the future. Don't set this too high
510 or mutt_mktime() returns something larger than will
511 fit in a time_t on some systems */
519 if (strchr ("<>=", buffer.data[0])) {
520 /* offset from current time
521 <3d less than three days ago
522 >3d more than three days ago
523 =3d exactly three days ago */
524 time_t now = time (NULL);
525 struct tm *tm = localtime (&now);
528 if (buffer.data[0] == '<') {
529 memcpy (&min, tm, sizeof (min));
533 memcpy (&max, tm, sizeof (max));
536 if (buffer.data[0] == '=')
540 tm->tm_min = tm->tm_sec = 59;
542 /* force negative offset */
543 get_offset (tm, buffer.data + 1, -1);
546 /* start at the beginning of the day in question */
547 memcpy (&min, &max, sizeof (max));
548 min.tm_hour = min.tm_sec = min.tm_min = 0;
552 const char *pc = buffer.data;
555 int untilNow = FALSE;
557 if (isdigit ((unsigned char) *pc)) {
558 /* mininum date specified */
559 if ((pc = getDate (pc, &min, err)) == NULL) {
566 const char *pt = pc + 1;
569 untilNow = (*pt == '\0');
573 if (!untilNow) { /* max date or relative range/window */
577 if (!haveMin) { /* save base minimum and set current date, e.g. for "-3d+1d" */
578 time_t now = time (NULL);
579 struct tm *tm = localtime (&now);
581 memcpy (&baseMin, &min, sizeof (baseMin));
582 memcpy (&min, tm, sizeof (min));
583 min.tm_hour = min.tm_sec = min.tm_min = 0;
586 /* preset max date for relative offsets,
587 if nothing follows we search for messages on a specific day */
588 max.tm_year = min.tm_year;
589 max.tm_mon = min.tm_mon;
590 max.tm_mday = min.tm_mday;
592 if (!parse_date_range (pc, &min, &max, haveMin, &baseMin, err)) { /* bail out on any parsing error */
599 /* Since we allow two dates to be specified we'll have to adjust that. */
600 adjust_date_range (&min, &max);
602 pat->min = mutt_mktime (&min, 1);
603 pat->max = mutt_mktime (&max, 1);
610 static struct pattern_flags *lookup_tag (char tag)
614 for (i = 0; Flags[i].tag; i++)
615 if (Flags[i].tag == tag)
620 static /* const */ char *find_matching_paren ( /* const */ char *s)
627 else if (*s == ')') {
636 void mutt_pattern_free (pattern_t ** pat)
649 mutt_pattern_free (&tmp->child);
654 pattern_t *mutt_pattern_comp ( /* const */ char *s, int flags, BUFFER * err)
656 pattern_t *curlist = NULL;
658 pattern_t *last = NULL;
662 int implicit = 1; /* used to detect logical AND operator */
663 struct pattern_flags *entry;
668 memset (&ps, 0, sizeof (ps));
670 ps.dsize = mutt_strlen (s);
686 snprintf (err->data, err->dsize, _("error in pattern at: %s"),
691 /* A & B | C == (A & B) | C */
692 tmp = new_pattern ();
694 tmp->child = curlist;
708 if (implicit && or) {
709 /* A | B & C == (A | B) & C */
710 tmp = new_pattern ();
712 tmp->child = curlist;
718 tmp = new_pattern ();
720 tmp->alladdr = alladdr;
730 ps.dptr++; /* move past the ~ */
731 if ((entry = lookup_tag (*ps.dptr)) == NULL) {
732 snprintf (err->data, err->dsize, _("%c: invalid command"), *ps.dptr);
733 mutt_pattern_free (&curlist);
736 if (entry->class && (flags & entry->class) == 0) {
737 snprintf (err->data, err->dsize, _("%c: not supported in this mode"),
739 mutt_pattern_free (&curlist);
744 ps.dptr++; /* eat the operator and any optional whitespace */
747 if (entry->eat_arg) {
749 snprintf (err->data, err->dsize, _("missing parameter"));
750 mutt_pattern_free (&curlist);
753 if (entry->eat_arg (tmp, &ps, err) == -1) {
754 mutt_pattern_free (&curlist);
761 p = find_matching_paren (ps.dptr + 1);
763 snprintf (err->data, err->dsize, _("mismatched parenthesis: %s"),
765 mutt_pattern_free (&curlist);
768 /* compile the sub-expression */
769 buf = mutt_substrdup (ps.dptr + 1, p);
770 if ((tmp = mutt_pattern_comp (buf, flags, err)) == NULL) {
772 mutt_pattern_free (&curlist);
782 tmp->alladdr |= alladdr;
785 ps.dptr = p + 1; /* restore location */
788 snprintf (err->data, err->dsize, _("error in pattern at: %s"), ps.dptr);
789 mutt_pattern_free (&curlist);
794 strfcpy (err->data, _("empty pattern"), err->dsize);
798 tmp = new_pattern ();
799 tmp->op = or ? M_OR : M_AND;
800 tmp->child = curlist;
807 perform_and (pattern_t * pat, pattern_exec_flag flags, CONTEXT * ctx,
810 for (; pat; pat = pat->next)
811 if (mutt_pattern_exec (pat, flags, ctx, hdr) <= 0)
817 perform_or (struct pattern_t *pat, pattern_exec_flag flags, CONTEXT * ctx,
820 for (; pat; pat = pat->next)
821 if (mutt_pattern_exec (pat, flags, ctx, hdr) > 0)
826 static int match_adrlist (regex_t * rx, int match_personal, int alladdr,
834 for (a = va_arg (ap, ADDRESS *); a; a = a->next) {
836 ((a->mailbox && regexec (rx, a->mailbox, 0, NULL, 0) == 0) ||
837 (match_personal && a->personal &&
838 regexec (rx, a->personal, 0, NULL, 0) == 0))) {
840 return (!alladdr); /* Found match, or non-match if alladdr */
845 return alladdr; /* No matches, or all matches if alladdr */
848 static int match_reference (regex_t * rx, LIST * refs)
850 for (; refs; refs = refs->next)
851 if (regexec (rx, refs->data, 0, NULL, 0) == 0)
856 int mutt_is_list_recipient (int alladdr, ADDRESS * a1, ADDRESS * a2)
858 for (; a1; a1 = a1->next)
859 if (alladdr ^ mutt_is_subscribed_list (a1))
861 for (; a2; a2 = a2->next)
862 if (alladdr ^ mutt_is_subscribed_list (a2))
867 int mutt_is_list_cc (int alladdr, ADDRESS * a1, ADDRESS * a2)
869 for (; a1; a1 = a1->next)
870 if (alladdr ^ mutt_is_mail_list (a1))
872 for (; a2; a2 = a2->next)
873 if (alladdr ^ mutt_is_mail_list (a2))
878 static int match_user (int alladdr, ADDRESS * a1, ADDRESS * a2)
880 for (; a1; a1 = a1->next)
881 if (alladdr ^ mutt_addr_is_user (a1))
883 for (; a2; a2 = a2->next)
884 if (alladdr ^ mutt_addr_is_user (a2))
889 /* test if name is considered a real name, i.e. consists of at least 2
890 * space-separated words of which none may end in a dot
892 static int valid_realname (const char *name)
894 const char *p = name;
901 /* skip abbr. parts of names (e.g. 'J. User') */
909 M_MATCH_FULL_ADDRESS match both personal and machine address */
911 mutt_pattern_exec (struct pattern_t *pat, pattern_exec_flag flags,
912 CONTEXT * ctx, HEADER * h)
918 return (pat->not ^ (perform_and (pat->child, flags, ctx, h) > 0));
920 return (pat->not ^ (perform_or (pat->child, flags, ctx, h) > 0));
924 return (pat->not ^ h->expired);
926 return (pat->not ^ h->superseded);
928 return (pat->not ^ h->flagged);
930 return (pat->not ^ h->tagged);
932 return (pat->not ? h->old || h->read : !(h->old || h->read));
934 return (pat->not ? h->read : !h->read);
936 return (pat->not ^ h->replied);
938 return (pat->not ? (!h->old || h->read) : (h->old && !h->read));
940 return (pat->not ^ h->read);
942 return (pat->not ^ h->deleted);
944 return (pat->not ^ (h->msgno >= pat->min - 1 && (pat->max == M_MAXRANGE ||
949 not ^ (h->date_sent >= pat->min && h->date_sent <= pat->max));
950 case M_DATE_RECEIVED:
951 return (pat->not ^ (h->received >= pat->min && h->received <= pat->max));
956 not ^ msg_search (ctx, pat->rx, buf, sizeof (buf), pat->op,
959 return (pat->not ^ match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
960 pat->alladdr, 1, h->env->sender));
962 return (pat->not ^ match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
963 pat->alladdr, 1, h->env->from));
965 return (pat->not ^ match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
966 pat->alladdr, 1, h->env->to));
968 return (pat->not ^ match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
969 pat->alladdr, 1, h->env->cc));
972 not ^ (h->env && h->env->subject
973 && regexec (pat->rx, h->env->subject, 0, NULL, 0) == 0));
976 not ^ (h->env && h->env->message_id
977 && regexec (pat->rx, h->env->message_id, 0, NULL,
980 return (pat->not ^ (h->score >= pat->min && (pat->max == M_MAXRANGE ||
981 h->score <= pat->max)));
984 not ^ (h->content->length >= pat->min
985 && (pat->max == M_MAXRANGE
986 || h->content->length <= pat->max)));
988 return (pat->not ^ match_reference (pat->rx, h->env->references));
992 && match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
993 pat->alladdr, 4, h->env->from,
994 h->env->sender, h->env->to,
999 && match_adrlist (pat->rx, flags & M_MATCH_FULL_ADDRESS,
1000 pat->alladdr, 2, h->env->to,
1005 && mutt_is_list_recipient (pat->alladdr, h->env->to,
1007 case M_PERSONAL_RECIP:
1010 && match_user (pat->alladdr, h->env->to, h->env->cc)));
1011 case M_PERSONAL_FROM:
1013 not ^ (h->env && match_user (pat->alladdr, h->env->from, NULL)));
1015 return (pat->not ^ (h->collapsed && h->num_hidden > 1));
1019 return (pat->not ^ ((h->security & SIGN) ? 1 : 0));
1020 case M_CRYPT_VERIFIED:
1023 return (pat->not ^ ((h->security & GOODSIGN) ? 1 : 0));
1024 case M_CRYPT_ENCRYPT:
1027 return (pat->not ^ ((h->security & ENCRYPT) ? 1 : 0));
1029 if (!(WithCrypto & APPLICATION_PGP))
1031 return (pat->not ^ ((h->security & APPLICATION_PGP)
1032 && (h->security & PGPKEY)));
1035 not ^ (h->env->x_label
1036 && regexec (pat->rx, h->env->x_label, 0, NULL, 0) == 0));
1039 not ^ (h->env->spam && h->env->spam->data
1040 && regexec (pat->rx, h->env->spam->data, 0, NULL,
1043 return (pat->not ^ (h->thread && h->thread->duplicate_thread));
1044 case M_UNREFERENCED:
1045 return (pat->not ^ (h->thread && !h->thread->child));
1048 * we have a match if
1049 * - From: matches $alternates
1050 * - or we have an alias for current address
1051 * - or From: contains valid email address _and_ name has >= 2 fields
1054 not ^ (h->env && h->env->from && (mutt_addr_is_user (h->env->from)
1056 (alias_reverse_lookup
1057 (h->env->from) != NULL)
1058 || (h->env->from->personal
1059 && valid_realname (h->env->
1062 && h->env->from->mailbox)
1067 not ^ (h->env->newsgroups
1068 && regexec (pat->rx, h->env->newsgroups, 0, NULL,
1072 mutt_error (_("error: unknown op %d (report this error)."), pat->op);
1076 static void quote_simple (char *tmp, size_t len, const char *p)
1081 while (*p && i < len - 3) {
1082 if (*p == '\\' || *p == '"')
1090 /* convert a simple search into a real request */
1091 void mutt_check_simple (char *s, size_t len, const char *simple)
1093 char tmp[LONG_STRING];
1095 /* XXX - is ascii_strcasecmp() right here, or should we use locale's
1099 if (!strchr (s, '~')) { /* yup, so spoof a real request */
1100 /* convert old tokens into the new format */
1101 if (ascii_strcasecmp ("all", s) == 0 || !mutt_strcmp ("^", s) || !mutt_strcmp (".", s)) /* ~A is more efficient */
1102 strfcpy (s, "~A", len);
1103 else if (ascii_strcasecmp ("del", s) == 0)
1104 strfcpy (s, "~D", len);
1105 else if (ascii_strcasecmp ("flag", s) == 0)
1106 strfcpy (s, "~F", len);
1107 else if (ascii_strcasecmp ("new", s) == 0)
1108 strfcpy (s, "~N", len);
1109 else if (ascii_strcasecmp ("old", s) == 0)
1110 strfcpy (s, "~O", len);
1111 else if (ascii_strcasecmp ("repl", s) == 0)
1112 strfcpy (s, "~Q", len);
1113 else if (ascii_strcasecmp ("read", s) == 0)
1114 strfcpy (s, "~R", len);
1115 else if (ascii_strcasecmp ("tag", s) == 0)
1116 strfcpy (s, "~T", len);
1117 else if (ascii_strcasecmp ("unread", s) == 0)
1118 strfcpy (s, "~U", len);
1120 quote_simple (tmp, sizeof (tmp), s);
1121 mutt_expand_fmt (s, len, simple, tmp);
1126 int mutt_pattern_func (int op, char *prompt)
1129 char buf[LONG_STRING] = "", *simple, error[STRING];
1133 strfcpy (buf, NONULL (Context->pattern), sizeof (buf));
1134 if (prompt || op != M_LIMIT)
1135 if (mutt_get_field (prompt, buf, sizeof (buf), M_PATTERN | M_CLEAR) != 0
1139 mutt_message _("Compiling search pattern...");
1141 simple = safe_strdup (buf);
1142 mutt_check_simple (buf, sizeof (buf), NONULL (SimpleSearch));
1145 err.dsize = sizeof (error);
1146 if ((pat = mutt_pattern_comp (buf, M_FULL_MSG, &err)) == NULL) {
1148 mutt_error ("%s", err.data);
1152 mutt_message _("Executing command on matching messages...");
1154 #define THIS_BODY Context->hdrs[i]->content
1156 if (op == M_LIMIT) {
1157 Context->vcount = 0;
1159 Context->collapsed = 0;
1161 for (i = 0; i < Context->msgcount; i++) {
1162 /* new limit pattern implicitly uncollapses all threads */
1163 Context->hdrs[i]->virtual = -1;
1164 Context->hdrs[i]->limited = 0;
1165 Context->hdrs[i]->collapsed = 0;
1166 Context->hdrs[i]->num_hidden = 0;
1167 if (mutt_pattern_exec
1168 (pat, M_MATCH_FULL_ADDRESS, Context, Context->hdrs[i])) {
1169 Context->hdrs[i]->virtual = Context->vcount;
1170 Context->hdrs[i]->limited = 1;
1171 Context->v2r[Context->vcount] = i;
1173 Context->vsize += THIS_BODY->length + THIS_BODY->offset -
1174 THIS_BODY->hdr_offset;
1179 for (i = 0; i < Context->vcount; i++) {
1180 if (mutt_pattern_exec
1181 (pat, M_MATCH_FULL_ADDRESS, Context,
1182 Context->hdrs[Context->v2r[i]])) {
1185 mutt_set_flag (Context, Context->hdrs[Context->v2r[i]], M_PURGED,
1188 mutt_set_flag (Context, Context->hdrs[Context->v2r[i]], M_DELETE,
1193 mutt_set_flag (Context, Context->hdrs[Context->v2r[i]], M_TAG,
1203 mutt_clear_error ();
1205 if (op == M_LIMIT) {
1206 FREE (&Context->pattern);
1207 if (Context->limit_pattern)
1208 mutt_pattern_free (&Context->limit_pattern);
1209 if (!Context->vcount) {
1210 mutt_error _("No messages matched criteria.");
1213 Context->vcount = Context->msgcount;
1214 /* restore full display */
1215 for (i = 0; i < Context->msgcount; i++) {
1216 Context->hdrs[i]->virtual = i;
1217 Context->v2r[i] = i;
1221 else if (mutt_strncmp (buf, "~A", 2) != 0) {
1222 Context->pattern = simple;
1223 simple = NULL; /* don't clobber it */
1224 Context->limit_pattern = mutt_pattern_comp (buf, M_FULL_MSG, &err);
1228 mutt_pattern_free (&pat);
1232 int mutt_search_command (int cur, int op)
1236 char temp[LONG_STRING];
1242 if (op != OP_SEARCH_NEXT && op != OP_SEARCH_OPPOSITE) {
1243 strfcpy (buf, LastSearch, sizeof (buf));
1244 if (mutt_get_field ((op == OP_SEARCH) ? _("Search for: ") :
1245 _("Reverse search for: "), buf, sizeof (buf),
1246 M_CLEAR | M_PATTERN) != 0 || !buf[0])
1249 if (op == OP_SEARCH)
1250 unset_option (OPTSEARCHREVERSE);
1252 set_option (OPTSEARCHREVERSE);
1254 /* compare the *expanded* version of the search pattern in case
1255 $simple_search has changed while we were searching */
1256 strfcpy (temp, buf, sizeof (temp));
1257 mutt_check_simple (temp, sizeof (temp), NONULL (SimpleSearch));
1259 if (!SearchPattern || mutt_strcmp (temp, LastSearchExpn)) {
1260 set_option (OPTSEARCHINVALID);
1261 strfcpy (LastSearch, buf, sizeof (LastSearch));
1262 mutt_message _("Compiling search pattern...");
1264 mutt_pattern_free (&SearchPattern);
1266 err.dsize = sizeof (error);
1267 if ((SearchPattern =
1268 mutt_pattern_comp (temp, M_FULL_MSG, &err)) == NULL) {
1269 mutt_error ("%s", error);
1272 mutt_clear_error ();
1275 else if (!SearchPattern) {
1276 mutt_error _("No search pattern.");
1281 if (option (OPTSEARCHINVALID)) {
1282 for (i = 0; i < Context->msgcount; i++)
1283 Context->hdrs[i]->searched = 0;
1284 unset_option (OPTSEARCHINVALID);
1287 incr = (option (OPTSEARCHREVERSE)) ? -1 : 1;
1288 if (op == OP_SEARCH_OPPOSITE)
1291 for (i = cur + incr, j = 0; j != Context->vcount; j++) {
1292 if (i > Context->vcount - 1) {
1294 if (option (OPTWRAPSEARCH))
1295 mutt_message (_("Search wrapped to top."));
1298 mutt_message _("Search hit bottom without finding match");
1304 i = Context->vcount - 1;
1305 if (option (OPTWRAPSEARCH))
1306 mutt_message (_("Search wrapped to bottom."));
1309 mutt_message _("Search hit top without finding match");
1315 h = Context->hdrs[Context->v2r[i]];
1317 /* if we've already evaulated this message, use the cached value */
1322 /* remember that we've already searched this message */
1326 (SearchPattern, M_MATCH_FULL_ADDRESS, Context, h) > 0)))
1331 mutt_error _("Search interrupted.");
1340 mutt_error _("Not found.");