-
-
Notifications
You must be signed in to change notification settings - Fork 303
/
pattern.c
2095 lines (1904 loc) · 55 KB
/
pattern.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/**
* Copyright (C) 1996-2000,2006-2007,2010 Michael R. Elkins <me@mutt.org>, and others
*
* This program is free software: you can redistribute it and/or modify it under
* the terms of the GNU General Public License as published by the Free Software
* Foundation, either version 2 of the License, or (at your option) any later
* version.
*
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
* details.
*
* You should have received a copy of the GNU General Public License along with
* this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "config.h"
#include <stddef.h>
#include <ctype.h>
#include <libintl.h>
#include <limits.h>
#include <regex.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/stat.h>
#include <time.h>
#include <unistd.h>
#include <wchar.h>
#include <wctype.h>
#include "mutt.h"
#include "pattern.h"
#include "address.h"
#include "ascii.h"
#include "body.h"
#include "buffer.h"
#include "context.h"
#include "copy.h"
#include "envelope.h"
#include "globals.h"
#include "group.h"
#include "header.h"
#include "keymap_defs.h"
#include "lib.h"
#include "list.h"
#include "mailbox.h"
#include "mutt_curses.h"
#include "mutt_menu.h"
#include "mutt_regex.h"
#include "ncrypt/ncrypt.h"
#include "options.h"
#include "protos.h"
#include "state.h"
#include "thread.h"
#ifdef USE_IMAP
#include "imap/imap.h"
#include "mx.h"
#endif
#ifdef USE_NOTMUCH
#include "mutt_notmuch.h"
#endif
/* Error codes for eat_range_by_regexp */
enum EatRangeError
{
RANGE_E_OK,
RANGE_E_SYNTAX,
RANGE_E_CTX,
};
static bool eat_regexp(struct Pattern *pat, struct Buffer *s, struct Buffer *err)
{
struct Buffer buf;
char errmsg[STRING];
int r;
char *pexpr = NULL;
mutt_buffer_init(&buf);
pexpr = s->dptr;
if (mutt_extract_token(&buf, s, MUTT_TOKEN_PATTERN | MUTT_TOKEN_COMMENT) != 0 || !buf.data)
{
snprintf(err->data, err->dsize, _("Error in expression: %s"), pexpr);
return false;
}
if (!*buf.data)
{
snprintf(err->data, err->dsize, "%s", _("Empty expression"));
return false;
}
if (pat->stringmatch)
{
pat->p.str = safe_strdup(buf.data);
pat->ign_case = mutt_which_case(buf.data) == REG_ICASE;
FREE(&buf.data);
}
else if (pat->groupmatch)
{
pat->p.g = mutt_pattern_group(buf.data);
FREE(&buf.data);
}
else
{
pat->p.rx = safe_malloc(sizeof(regex_t));
r = REGCOMP(pat->p.rx, buf.data, REG_NEWLINE | REG_NOSUB | mutt_which_case(buf.data));
if (r)
{
regerror(r, pat->p.rx, errmsg, sizeof(errmsg));
mutt_buffer_printf(err, "'%s': %s", buf.data, errmsg);
FREE(&buf.data);
FREE(&pat->p.rx);
return false;
}
FREE(&buf.data);
}
return true;
}
/* Ny years
Nm months
Nw weeks
Nd days */
static const char *get_offset(struct tm *tm, const char *s, int sign)
{
char *ps = NULL;
int offset = strtol(s, &ps, 0);
if ((sign < 0 && offset > 0) || (sign > 0 && offset < 0))
offset = -offset;
switch (*ps)
{
case 'y':
tm->tm_year += offset;
break;
case 'm':
tm->tm_mon += offset;
break;
case 'w':
tm->tm_mday += 7 * offset;
break;
case 'd':
tm->tm_mday += offset;
break;
default:
return s;
}
mutt_normalize_time(tm);
return (ps + 1);
}
static const char *get_date(const char *s, struct tm *t, struct Buffer *err)
{
char *p = NULL;
time_t now = time(NULL);
struct tm *tm = localtime(&now);
t->tm_mday = strtol(s, &p, 10);
if (t->tm_mday < 1 || t->tm_mday > 31)
{
snprintf(err->data, err->dsize, _("Invalid day of month: %s"), s);
return NULL;
}
if (*p != '/')
{
/* fill in today's month and year */
t->tm_mon = tm->tm_mon;
t->tm_year = tm->tm_year;
return p;
}
p++;
t->tm_mon = strtol(p, &p, 10) - 1;
if (t->tm_mon < 0 || t->tm_mon > 11)
{
snprintf(err->data, err->dsize, _("Invalid month: %s"), p);
return NULL;
}
if (*p != '/')
{
t->tm_year = tm->tm_year;
return p;
}
p++;
t->tm_year = strtol(p, &p, 10);
if (t->tm_year < 70) /* year 2000+ */
t->tm_year += 100;
else if (t->tm_year > 1900)
t->tm_year -= 1900;
return p;
}
/* The regexes in a modern format */
#define RANGE_NUM_RX "([[:digit:]]+|0x[[:xdigit:]]+)[MmKk]?"
#define RANGE_REL_SLOT_RX "[[:blank:]]*([.^$]|-?" RANGE_NUM_RX ")?[[:blank:]]*"
#define RANGE_REL_RX "^" RANGE_REL_SLOT_RX "," RANGE_REL_SLOT_RX
/* Almost the same, but no negative numbers allowed */
#define RANGE_ABS_SLOT_RX "[[:blank:]]*([.^$]|" RANGE_NUM_RX ")?[[:blank:]]*"
#define RANGE_ABS_RX "^" RANGE_ABS_SLOT_RX "-" RANGE_ABS_SLOT_RX
/* First group is intentionally empty */
#define RANGE_LT_RX "^()[[:blank:]]*(<[[:blank:]]*" RANGE_NUM_RX ")[[:blank:]]*"
#define RANGE_GT_RX "^()[[:blank:]]*(>[[:blank:]]*" RANGE_NUM_RX ")[[:blank:]]*"
/* Single group for min and max */
#define RANGE_BARE_RX "^[[:blank:]]*([.^$]|" RANGE_NUM_RX ")[[:blank:]]*"
#define RANGE_RX_GROUPS 5
struct RangeRegex
{
const char *raw; /**< regexp as string */
int lgrp; /**< paren group matching the left side */
int rgrp; /**< paren group matching the right side */
int ready; /**< compiled yet? */
regex_t cooked; /**< compiled form */
};
enum
{
RANGE_K_REL,
RANGE_K_ABS,
RANGE_K_LT,
RANGE_K_GT,
RANGE_K_BARE,
/* add new ones HERE */
RANGE_K_INVALID
};
static struct RangeRegex range_regexps[] = {
[RANGE_K_REL] = {.raw = RANGE_REL_RX, .lgrp = 1, .rgrp = 3, .ready = 0 },
[RANGE_K_ABS] = {.raw = RANGE_ABS_RX, .lgrp = 1, .rgrp = 3, .ready = 0 },
[RANGE_K_LT] = {.raw = RANGE_LT_RX, .lgrp = 1, .rgrp = 2, .ready = 0 },
[RANGE_K_GT] = {.raw = RANGE_GT_RX, .lgrp = 2, .rgrp = 1, .ready = 0 },
[RANGE_K_BARE] = {.raw = RANGE_BARE_RX, .lgrp = 1, .rgrp = 1, .ready = 0 },
};
#define KILO 1024
#define MEGA 1048576
#define HMSG(h) (((h)->msgno) + 1)
#define CTX_MSGNO(c) (HMSG((c)->hdrs[(c)->v2r[(c)->menu->current]]))
#define MUTT_MAXRANGE -1
/* constants for parse_date_range() */
#define MUTT_PDR_NONE 0x0000
#define MUTT_PDR_MINUS 0x0001
#define MUTT_PDR_PLUS 0x0002
#define MUTT_PDR_WINDOW 0x0004
#define MUTT_PDR_ABSOLUTE 0x0008
#define MUTT_PDR_DONE 0x0010
#define MUTT_PDR_ERROR 0x0100
#define MUTT_PDR_ERRORDONE (MUTT_PDR_ERROR | MUTT_PDR_DONE)
#define RANGE_DOT '.'
#define RANGE_CIRCUM '^'
#define RANGE_DOLLAR '$'
#define RANGE_LT '<'
#define RANGE_GT '>'
/* range sides: left or right */
enum
{
RANGE_S_LEFT,
RANGE_S_RIGHT
};
static const char *parse_date_range(const char *pc, struct tm *min, struct tm *max,
int haveMin, struct tm *baseMin, struct Buffer *err)
{
int flag = MUTT_PDR_NONE;
while (*pc && ((flag & MUTT_PDR_DONE) == 0))
{
const char *pt = NULL;
char ch = *pc++;
SKIPWS(pc);
switch (ch)
{
case '-':
{
/* try a range of absolute date minus offset of Ndwmy */
pt = get_offset(min, pc, -1);
if (pc == pt)
{
if (flag == MUTT_PDR_NONE)
{ /* nothing yet and no offset parsed => absolute date? */
if (!get_date(pc, max, err))
flag |= (MUTT_PDR_ABSOLUTE | MUTT_PDR_ERRORDONE); /* done bad */
else
{
/* reestablish initial base minimum if not specified */
if (!haveMin)
memcpy(min, baseMin, sizeof(struct tm));
flag |= (MUTT_PDR_ABSOLUTE | MUTT_PDR_DONE); /* done good */
}
}
else
flag |= MUTT_PDR_ERRORDONE;
}
else
{
pc = pt;
if (flag == MUTT_PDR_NONE && !haveMin)
{ /* the very first "-3d" without a previous absolute date */
max->tm_year = min->tm_year;
max->tm_mon = min->tm_mon;
max->tm_mday = min->tm_mday;
}
flag |= MUTT_PDR_MINUS;
}
}
break;
case '+':
{ /* enlarge plusRange */
pt = get_offset(max, pc, 1);
if (pc == pt)
flag |= MUTT_PDR_ERRORDONE;
else
{
pc = pt;
flag |= MUTT_PDR_PLUS;
}
}
break;
case '*':
{ /* enlarge window in both directions */
pt = get_offset(min, pc, -1);
if (pc == pt)
flag |= MUTT_PDR_ERRORDONE;
else
{
pc = get_offset(max, pc, 1);
flag |= MUTT_PDR_WINDOW;
}
}
break;
default:
flag |= MUTT_PDR_ERRORDONE;
}
SKIPWS(pc);
}
if ((flag & MUTT_PDR_ERROR) && !(flag & MUTT_PDR_ABSOLUTE))
{ /* get_date has its own error message, don't overwrite it here */
snprintf(err->data, err->dsize, _("Invalid relative date: %s"), pc - 1);
}
return ((flag & MUTT_PDR_ERROR) ? NULL : pc);
}
static void adjust_date_range(struct tm *min, struct tm *max)
{
if (min->tm_year > max->tm_year ||
(min->tm_year == max->tm_year && min->tm_mon > max->tm_mon) ||
(min->tm_year == max->tm_year && min->tm_mon == max->tm_mon && min->tm_mday > max->tm_mday))
{
int tmp;
tmp = min->tm_year;
min->tm_year = max->tm_year;
max->tm_year = tmp;
tmp = min->tm_mon;
min->tm_mon = max->tm_mon;
max->tm_mon = tmp;
tmp = min->tm_mday;
min->tm_mday = max->tm_mday;
max->tm_mday = tmp;
min->tm_hour = min->tm_min = min->tm_sec = 0;
max->tm_hour = 23;
max->tm_min = max->tm_sec = 59;
}
}
static bool eat_date(struct Pattern *pat, struct Buffer *s, struct Buffer *err)
{
struct Buffer buffer;
struct tm min, max;
char *pexpr = NULL;
mutt_buffer_init(&buffer);
pexpr = s->dptr;
if (mutt_extract_token(&buffer, s, MUTT_TOKEN_COMMENT | MUTT_TOKEN_PATTERN) != 0 ||
!buffer.data)
{
snprintf(err->data, err->dsize, _("Error in expression: %s"), pexpr);
return false;
}
if (!*buffer.data)
{
snprintf(err->data, err->dsize, "%s", _("Empty expression"));
return false;
}
memset(&min, 0, sizeof(min));
/* the `0' time is Jan 1, 1970 UTC, so in order to prevent a negative time
when doing timezone conversion, we use Jan 2, 1970 UTC as the base
here */
min.tm_mday = 2;
min.tm_year = 70;
memset(&max, 0, sizeof(max));
/* Arbitrary year in the future. Don't set this too high
or mutt_mktime() returns something larger than will
fit in a time_t on some systems */
max.tm_year = 130;
max.tm_mon = 11;
max.tm_mday = 31;
max.tm_hour = 23;
max.tm_min = 59;
max.tm_sec = 59;
if (strchr("<>=", buffer.data[0]))
{
/* offset from current time
<3d less than three days ago
>3d more than three days ago
=3d exactly three days ago */
time_t now = time(NULL);
struct tm *tm = localtime(&now);
int exact = 0;
if (buffer.data[0] == '<')
{
memcpy(&min, tm, sizeof(min));
tm = &min;
}
else
{
memcpy(&max, tm, sizeof(max));
tm = &max;
if (buffer.data[0] == '=')
exact++;
}
tm->tm_hour = 23;
tm->tm_min = tm->tm_sec = 59;
/* force negative offset */
get_offset(tm, buffer.data + 1, -1);
if (exact)
{
/* start at the beginning of the day in question */
memcpy(&min, &max, sizeof(max));
min.tm_hour = min.tm_sec = min.tm_min = 0;
}
}
else
{
const char *pc = buffer.data;
int haveMin = false;
int untilNow = false;
if (isdigit((unsigned char) *pc))
{
/* minimum date specified */
if ((pc = get_date(pc, &min, err)) == NULL)
{
FREE(&buffer.data);
return false;
}
haveMin = true;
SKIPWS(pc);
if (*pc == '-')
{
const char *pt = pc + 1;
SKIPWS(pt);
untilNow = (*pt == '\0');
}
}
if (!untilNow)
{ /* max date or relative range/window */
struct tm baseMin;
if (!haveMin)
{ /* save base minimum and set current date, e.g. for "-3d+1d" */
time_t now = time(NULL);
struct tm *tm = localtime(&now);
memcpy(&baseMin, &min, sizeof(baseMin));
memcpy(&min, tm, sizeof(min));
min.tm_hour = min.tm_sec = min.tm_min = 0;
}
/* preset max date for relative offsets,
if nothing follows we search for messages on a specific day */
max.tm_year = min.tm_year;
max.tm_mon = min.tm_mon;
max.tm_mday = min.tm_mday;
if (!parse_date_range(pc, &min, &max, haveMin, &baseMin, err))
{ /* bail out on any parsing error */
FREE(&buffer.data);
return false;
}
}
}
/* Since we allow two dates to be specified we'll have to adjust that. */
adjust_date_range(&min, &max);
pat->min = mutt_mktime(&min, 1);
pat->max = mutt_mktime(&max, 1);
FREE(&buffer.data);
return true;
}
static bool eat_range(struct Pattern *pat, struct Buffer *s, struct Buffer *err)
{
char *tmp = NULL;
bool do_exclusive = false;
bool skip_quote = false;
/*
* If simple_search is set to "~m %s", the range will have double quotes
* around it...
*/
if (*s->dptr == '"')
{
s->dptr++;
skip_quote = true;
}
if (*s->dptr == '<')
do_exclusive = true;
if ((*s->dptr != '-') && (*s->dptr != '<'))
{
/* range minimum */
if (*s->dptr == '>')
{
pat->max = MUTT_MAXRANGE;
pat->min = strtol(s->dptr + 1, &tmp, 0) + 1; /* exclusive range */
}
else
pat->min = strtol(s->dptr, &tmp, 0);
if (toupper((unsigned char) *tmp) == 'K') /* is there a prefix? */
{
pat->min *= 1024;
tmp++;
}
else if (toupper((unsigned char) *tmp) == 'M')
{
pat->min *= 1048576;
tmp++;
}
if (*s->dptr == '>')
{
s->dptr = tmp;
return true;
}
if (*tmp != '-')
{
/* exact value */
pat->max = pat->min;
s->dptr = tmp;
return true;
}
tmp++;
}
else
{
s->dptr++;
tmp = s->dptr;
}
if (isdigit((unsigned char) *tmp))
{
/* range maximum */
pat->max = strtol(tmp, &tmp, 0);
if (toupper((unsigned char) *tmp) == 'K')
{
pat->max *= 1024;
tmp++;
}
else if (toupper((unsigned char) *tmp) == 'M')
{
pat->max *= 1048576;
tmp++;
}
if (do_exclusive)
(pat->max)--;
}
else
pat->max = MUTT_MAXRANGE;
if (skip_quote && *tmp == '"')
tmp++;
SKIPWS(tmp);
s->dptr = tmp;
return true;
}
static int report_regerror(int regerr, regex_t *preg, struct Buffer *err)
{
size_t ds = err->dsize;
if (regerror(regerr, preg, err->data, ds) > ds)
mutt_debug(2, "warning: buffer too small for regerror\n");
/* The return value is fixed, exists only to shorten code at callsite */
return RANGE_E_SYNTAX;
}
static bool is_context_available(struct Buffer *s, regmatch_t pmatch[],
int kind, struct Buffer *err)
{
char *context_loc = NULL;
const char *context_req_chars[] = {
[RANGE_K_REL] = ".0123456789",
[RANGE_K_ABS] = ".",
[RANGE_K_LT] = "",
[RANGE_K_GT] = "",
[RANGE_K_BARE] = ".",
};
/* First decide if we're going to need the context at all.
* Relative patterns need it iff they contain a dot or a number.
* Absolute patterns only need it if they contain a dot. */
context_loc = strpbrk(s->dptr + pmatch[0].rm_so, context_req_chars[kind]);
if (!context_loc || (context_loc >= &s->dptr[pmatch[0].rm_eo]))
return true;
/* We need a current message. Do we actually have one? */
if (Context && Context->menu)
return true;
/* Nope. */
strfcpy(err->data, _("No current message"), err->dsize);
return false;
}
static int scan_range_num(struct Buffer *s, regmatch_t pmatch[], int group, int kind)
{
int num;
unsigned char c;
/* this cast looks dangerous, but is already all over this code
* (explicit or not) */
num = (int) strtol(&s->dptr[pmatch[group].rm_so], NULL, 0);
c = (unsigned char) (s->dptr[pmatch[group].rm_eo - 1]);
if (toupper(c) == 'K')
num *= KILO;
else if (toupper(c) == 'M')
num *= MEGA;
switch (kind)
{
case RANGE_K_REL:
return num + CTX_MSGNO(Context);
case RANGE_K_LT:
return num - 1;
case RANGE_K_GT:
return num + 1;
default:
return num;
}
}
static int scan_range_slot(struct Buffer *s, regmatch_t pmatch[], int grp, int side, int kind)
{
unsigned char c;
/* This means the left or right subpattern was empty, e.g. ",." */
if ((pmatch[grp].rm_so == -1) || (pmatch[grp].rm_so == pmatch[grp].rm_eo))
{
if (side == RANGE_S_LEFT)
return 1;
else if (side == RANGE_S_RIGHT)
return Context->msgcount;
}
/* We have something, so determine what */
c = (unsigned char) (s->dptr[pmatch[grp].rm_so]);
switch (c)
{
case RANGE_CIRCUM:
return 1;
case RANGE_DOLLAR:
return Context->msgcount;
case RANGE_DOT:
return CTX_MSGNO(Context);
case RANGE_LT:
case RANGE_GT:
return scan_range_num(s, pmatch, grp + 1, kind);
default:
/* Only other possibility: a number */
return scan_range_num(s, pmatch, grp, kind);
}
}
static void order_range(struct Pattern *pat)
{
int num;
if (pat->min <= pat->max)
return;
num = pat->min;
pat->min = pat->max;
pat->max = num;
}
static int eat_range_by_regexp(struct Pattern *pat, struct Buffer *s, int kind,
struct Buffer *err)
{
int regerr;
regmatch_t pmatch[RANGE_RX_GROUPS];
struct RangeRegex *pspec = &range_regexps[kind];
/* First time through, compile the big regexp */
if (!pspec->ready)
{
regerr = regcomp(&pspec->cooked, pspec->raw, REG_EXTENDED);
if (regerr)
return report_regerror(regerr, &pspec->cooked, err);
pspec->ready = 1;
}
/* Match the pattern buffer against the compiled regexp.
* No match means syntax error. */
regerr = regexec(&pspec->cooked, s->dptr, RANGE_RX_GROUPS, pmatch, 0);
if (regerr)
return report_regerror(regerr, &pspec->cooked, err);
if (!is_context_available(s, pmatch, kind, err))
return RANGE_E_CTX;
/* Snarf the contents of the two sides of the range. */
pat->min = scan_range_slot(s, pmatch, pspec->lgrp, RANGE_S_LEFT, kind);
pat->max = scan_range_slot(s, pmatch, pspec->rgrp, RANGE_S_RIGHT, kind);
mutt_debug(1, "pat->min=%d pat->max=%d\n", pat->min, pat->max);
/* Special case for a bare 0. */
if ((kind == RANGE_K_BARE) && (pat->min == 0) && (pat->max == 0))
{
if (!Context->menu)
{
strfcpy(err->data, _("No current message"), err->dsize);
return RANGE_E_CTX;
}
pat->min = pat->max = CTX_MSGNO(Context);
}
/* Since we don't enforce order, we must swap bounds if they're backward */
order_range(pat);
/* Slide pointer past the entire match. */
s->dptr += pmatch[0].rm_eo;
return RANGE_E_OK;
}
static bool eat_message_range(struct Pattern *pat, struct Buffer *s, struct Buffer *err)
{
bool skip_quote = false;
/* We need a Context for pretty much anything. */
if (!Context)
{
strfcpy(err->data, _("No Context"), err->dsize);
return false;
}
/*
* If simple_search is set to "~m %s", the range will have double quotes
* around it...
*/
if (*s->dptr == '"')
{
s->dptr++;
skip_quote = true;
}
for (int i_kind = 0; i_kind != RANGE_K_INVALID; ++i_kind)
{
switch (eat_range_by_regexp(pat, s, i_kind, err))
{
case RANGE_E_CTX:
/* This means it matched syntactically but lacked context.
* No point in continuing. */
break;
case RANGE_E_SYNTAX:
/* Try another syntax, then */
continue;
case RANGE_E_OK:
if (skip_quote && (*s->dptr == '"'))
s->dptr++;
SKIPWS(s->dptr);
return true;
}
}
return false;
}
static const struct PatternFlags
{
int tag; /**< character used to represent this op */
int op; /**< operation to perform */
int class;
bool (*eat_arg)(struct Pattern *, struct Buffer *, struct Buffer *);
} Flags[] = {
{ 'A', MUTT_ALL, 0, NULL },
{ 'b', MUTT_BODY, MUTT_FULL_MSG, eat_regexp },
{ 'B', MUTT_WHOLE_MSG, MUTT_FULL_MSG, eat_regexp },
{ 'c', MUTT_CC, 0, eat_regexp },
{ 'C', MUTT_RECIPIENT, 0, eat_regexp },
{ 'd', MUTT_DATE, 0, eat_date },
{ 'D', MUTT_DELETED, 0, NULL },
{ 'e', MUTT_SENDER, 0, eat_regexp },
{ 'E', MUTT_EXPIRED, 0, NULL },
{ 'f', MUTT_FROM, 0, eat_regexp },
{ 'F', MUTT_FLAG, 0, NULL },
{ 'g', MUTT_CRYPT_SIGN, 0, NULL },
{ 'G', MUTT_CRYPT_ENCRYPT, 0, NULL },
{ 'h', MUTT_HEADER, MUTT_FULL_MSG, eat_regexp },
{ 'H', MUTT_HORMEL, 0, eat_regexp },
{ 'i', MUTT_ID, 0, eat_regexp },
{ 'k', MUTT_PGP_KEY, 0, NULL },
{ 'l', MUTT_LIST, 0, NULL },
{ 'L', MUTT_ADDRESS, 0, eat_regexp },
{ 'm', MUTT_MESSAGE, 0, eat_message_range },
{ 'n', MUTT_SCORE, 0, eat_range },
{ 'N', MUTT_NEW, 0, NULL },
{ 'O', MUTT_OLD, 0, NULL },
{ 'p', MUTT_PERSONAL_RECIP, 0, NULL },
{ 'P', MUTT_PERSONAL_FROM, 0, NULL },
{ 'Q', MUTT_REPLIED, 0, NULL },
{ 'r', MUTT_DATE_RECEIVED, 0, eat_date },
{ 'R', MUTT_READ, 0, NULL },
{ 's', MUTT_SUBJECT, 0, eat_regexp },
{ 'S', MUTT_SUPERSEDED, 0, NULL },
{ 't', MUTT_TO, 0, eat_regexp },
{ 'T', MUTT_TAG, 0, NULL },
{ 'u', MUTT_SUBSCRIBED_LIST, 0, NULL },
{ 'U', MUTT_UNREAD, 0, NULL },
{ 'v', MUTT_COLLAPSED, 0, NULL },
{ 'V', MUTT_CRYPT_VERIFIED, 0, NULL },
#ifdef USE_NNTP
{ 'w', MUTT_NEWSGROUPS, 0, eat_regexp },
#endif
{ 'x', MUTT_REFERENCE, 0, eat_regexp },
{ 'X', MUTT_MIMEATTACH, 0, eat_range },
{ 'y', MUTT_XLABEL, 0, eat_regexp },
#ifdef USE_NOTMUCH
{ 'Y', MUTT_NOTMUCH_LABEL, 0, eat_regexp },
#endif
{ 'z', MUTT_SIZE, 0, eat_range },
{ '=', MUTT_DUPLICATED, 0, NULL },
{ '$', MUTT_UNREFERENCED, 0, NULL },
{ '#', MUTT_BROKEN, 0, NULL },
{ '/', MUTT_SERVERSEARCH, 0, eat_regexp },
{ 0, 0, 0, NULL },
};
static struct Pattern *SearchPattern = NULL; /* current search pattern */
static char LastSearch[STRING] = { 0 }; /* last pattern searched for */
static char LastSearchExpn[LONG_STRING] = { 0 }; /* expanded version of
LastSearch */
/* if no uppercase letters are given, do a case-insensitive search */
int mutt_which_case(const char *s)
{
wchar_t w;
mbstate_t mb;
size_t l;
memset(&mb, 0, sizeof(mb));
for (; (l = mbrtowc(&w, s, MB_CUR_MAX, &mb)) != 0; s += l)
{
if (l == (size_t) -2)
continue; /* shift sequences */
if (l == (size_t) -1)
return 0; /* error; assume case-sensitive */
if (iswalpha((wint_t) w) && iswupper((wint_t) w))
return 0; /* case-sensitive */
}
return REG_ICASE; /* case-insensitive */
}
static int patmatch(const struct Pattern *pat, const char *buf)
{
if (pat->stringmatch)
return pat->ign_case ? !strcasestr(buf, pat->p.str) : !strstr(buf, pat->p.str);
else if (pat->groupmatch)
return !mutt_group_match(pat->p.g, buf);
else
return regexec(pat->p.rx, buf, 0, NULL, 0);
}
static int msg_search(struct Context *ctx, struct Pattern *pat, int msgno)
{
struct Message *msg = NULL;
struct State s;
FILE *fp = NULL;
long lng = 0;
int match = 0;
struct Header *h = ctx->hdrs[msgno];
char *buf = NULL;
size_t blen;
#ifdef USE_FMEMOPEN
char *temp = NULL;
size_t tempsize;
#else
char tempfile[_POSIX_PATH_MAX];
struct stat st;
#endif
if ((msg = mx_open_message(ctx, msgno)) != NULL)
{
if (option(OPTTHOROUGHSRC))
{
/* decode the header / body */
memset(&s, 0, sizeof(s));
s.fpin = msg->fp;
s.flags = MUTT_CHARCONV;
#ifdef USE_FMEMOPEN
s.fpout = open_memstream(&temp, &tempsize);
if (!s.fpout)
{
mutt_perror(_("Error opening memstream"));
return 0;
}
#else
mutt_mktemp(tempfile, sizeof(tempfile));
if ((s.fpout = safe_fopen(tempfile, "w+")) == NULL)
{
mutt_perror(tempfile);
return 0;
}
#endif
if (pat->op != MUTT_BODY)
mutt_copy_header(msg->fp, h, s.fpout, CH_FROM | CH_DECODE, NULL);
if (pat->op != MUTT_HEADER)
{
mutt_parse_mime_message(ctx, h);
if (WithCrypto && (h->security & ENCRYPT) && !crypt_valid_passphrase(h->security))
{
mx_close_message(ctx, &msg);
if (s.fpout)
{
safe_fclose(&s.fpout);
#ifdef USE_FMEMOPEN
FREE(&temp);
#else
unlink(tempfile);
#endif
}
return 0;
}
fseeko(msg->fp, h->offset, SEEK_SET);
mutt_body_handler(h->content, &s);
}
#ifdef USE_FMEMOPEN
fclose(s.fpout);
lng = tempsize;
if (tempsize)
{
fp = fmemopen(temp, tempsize, "r");
if (!fp)
{
mutt_perror(_("Error re-opening memstream"));
return 0;
}
}
else
{ /* fmemopen cannot handle empty buffers */
fp = safe_fopen("/dev/null", "r");
if (!fp)
{
mutt_perror(_("Error opening /dev/null"));
return 0;
}
}
#else
fp = s.fpout;
fflush(fp);
fseek(fp, 0, SEEK_SET);
fstat(fileno(fp), &st);
lng = (long) st.st_size;
#endif
}
else
{
/* raw header / body */