comparator.c
11.5 KB
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
/* GNU Mailutils -- a suite of utilities for electronic mail
Copyright (C) 1999-2002, 2004-2005, 2007-2012, 2014-2017 Free
Software Foundation, Inc.
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 3 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General
Public License along with this library. If not, see
<http://www.gnu.org/licenses/>. */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <sieve-priv.h>
#include <regex.h>
#include <mailutils/cctype.h>
#include <mailutils/cstr.h>
void
mu_sieve_register_comparator (mu_sieve_machine_t mach,
const char *name,
int required,
mu_sieve_comparator_t is,
mu_sieve_comparator_t contains,
mu_sieve_comparator_t matches,
mu_sieve_comparator_t regex,
mu_sieve_comparator_t eq)
{
mu_sieve_registry_t *reg = mu_sieve_registry_add (mach, name);
reg->type = mu_sieve_record_comparator;
reg->required = required;
reg->name = name;
reg->v.comp[MU_SIEVE_MATCH_IS] = is;
reg->v.comp[MU_SIEVE_MATCH_CONTAINS] = contains;
reg->v.comp[MU_SIEVE_MATCH_MATCHES] = matches;
reg->v.comp[MU_SIEVE_MATCH_REGEX] = regex;
reg->v.comp[MU_SIEVE_MATCH_EQ] = eq;
}
mu_sieve_comparator_t
mu_sieve_comparator_lookup (mu_sieve_machine_t mach, const char *name,
int matchtype)
{
mu_sieve_registry_t *reg =
mu_sieve_registry_lookup (mach, name, mu_sieve_record_comparator);
if (reg && reg->v.comp[matchtype])
return reg->v.comp[matchtype];
return NULL;
}
static int i_ascii_casemap_is (mu_sieve_machine_t mach,
mu_sieve_string_t *pattern, const char *text);
mu_sieve_comparator_t
mu_sieve_get_comparator (mu_sieve_machine_t mach)
{
if (!mach->comparator)
return i_ascii_casemap_is;
return mach->comparator;
}
/* Compile time support */
static void
compile_pattern (mu_sieve_machine_t mach, mu_sieve_string_t *pattern, int flags)
{
int rc;
regex_t *preg;
char *str;
str = mu_sieve_string_get (mach, pattern);
if (pattern->rx)
{
if (!pattern->changed)
return;
preg = pattern->rx;
regfree (preg);
}
else
preg = mu_sieve_malloc (mach, sizeof (*preg));
rc = regcomp (preg, str, REG_EXTENDED | flags);
if (rc)
{
size_t size = regerror (rc, preg, NULL, 0);
char *errbuf = malloc (size + 1);
if (errbuf)
{
regerror (rc, preg, errbuf, size);
mu_sieve_error (mach, _("regex error: %s"), errbuf);
free (errbuf);
}
else
mu_sieve_error (mach, _("regex error"));
mu_sieve_abort (mach);
}
pattern->rx = preg;
}
static void
compile_wildcard (mu_sieve_machine_t mach, mu_sieve_string_t *pattern,
int flags)
{
int rc;
regex_t *preg;
char *str;
str = mu_sieve_string_get (mach, pattern);
if (pattern->rx)
{
if (!pattern->changed)
return;
preg = pattern->rx;
regfree (preg);
}
else
preg = mu_sieve_malloc (mach, sizeof (*preg));
if (mu_sieve_has_variables (mach))
flags |= MU_GLOBF_SUB;
rc = mu_glob_compile (preg, str, flags);
if (rc)
{
mu_sieve_error (mach, _("can't compile pattern"));
mu_sieve_abort (mach);
}
pattern->rx = preg;
}
static int
comp_false (mu_sieve_machine_t mach, mu_sieve_string_t *pattern,
const char *text)
{
return 0;
}
int
mu_sieve_match_part_checker (mu_sieve_machine_t mach)
{
size_t i;
mu_sieve_value_t *match = NULL;
mu_sieve_comparator_t compfun = NULL;
char *compname = NULL;
int matchtype;
if (mach->tagcount == 0)
return 0;
for (i = 0; i < mach->tagcount; i++)
{
mu_sieve_value_t *t = mu_sieve_get_tag_n (mach, i);
if (strcmp (t->tag, "is") == 0
|| strcmp (t->tag, "contains") == 0
|| strcmp (t->tag, "matches") == 0
|| strcmp (t->tag, "regex") == 0
|| strcmp (t->tag, "count") == 0
|| strcmp (t->tag, "value") == 0)
{
if (match)
{
mu_diag_at_locus (MU_LOG_ERROR, &mach->locus,
_("match type specified twice in call to `%s'"),
mach->identifier);
mu_i_sv_error (mach);
return 1;
}
else
match = t;
}
else if (strcmp (t->tag, "comparator") == 0)
{
if (t->type != SVT_STRING)
abort ();
compname = mu_sieve_string (mach, &t->v.list, 0);
}
}
if (!match || strcmp (match->tag, "is") == 0)
matchtype = MU_SIEVE_MATCH_IS;
else if (strcmp (match->tag, "contains") == 0)
matchtype = MU_SIEVE_MATCH_CONTAINS;
else if (strcmp (match->tag, "matches") == 0)
matchtype = MU_SIEVE_MATCH_MATCHES;
else if (strcmp (match->tag, "regex") == 0)
matchtype = MU_SIEVE_MATCH_REGEX;
else if (match->type == SVT_STRING)
{
char *str = mu_sieve_string (mach, &match->v.list, 0);
if (strcmp (match->tag, "count") == 0)
{
mu_sieve_value_t *val;
mu_sieve_string_t *argstr;
if (compname && strcmp (compname, "i;ascii-numeric"))
{
mu_diag_at_locus (MU_LOG_ERROR, &mach->locus,
/* TRANSLATORS: Do not translate ':count'.
It is the name of a Sieve tag */
_("comparator %s is incompatible with "
":count in call to `%s'"),
compname,
mach->identifier);
mu_i_sv_error (mach);
return 1;
}
matchtype = MU_SIEVE_MATCH_LAST; /* to not leave it undefined */
compname = "false";
compfun = comp_false;
val = mu_sieve_get_arg_untyped (mach, 1);
/* NOTE: Type of val is always SVT_STRING_LIST */
switch (val->type)
{
case SVT_STRING:
break;
case SVT_STRING_LIST:
if (val->v.list.count == 1)
break;
/* fall through */
default:
mu_diag_at_locus (MU_LOG_ERROR, &mach->locus,
_(":count requires second argument to be a list of one element"));
mu_i_sv_error (mach);
return 1;
}
argstr = mu_sieve_string_raw (mach, &val->v.list, 0);
if (argstr->constant)
{
char *p = mu_str_skip_class (argstr->orig, MU_CTYPE_DIGIT);
if (*p)
{
mu_diag_at_locus (MU_LOG_ERROR, &mach->locus,
_("second argument cannot be converted to number"));
mu_i_sv_error (mach);
return 1;
}
}
}
else
matchtype = MU_SIEVE_MATCH_EQ;
if (mu_sieve_str_to_relcmp (str, NULL, NULL))
{
mu_diag_at_locus (MU_LOG_ERROR, &mach->locus,
_("invalid relational match `%s' in call to `%s'"),
str, mach->identifier);
mu_i_sv_error (mach);
return 1;
}
}
else
{
mu_error (_("%s:%d: INTERNAL ERROR, please report"), __FILE__, __LINE__);
abort ();
}
if (!compfun)
{
if (!compname)
compname = "i;ascii-casemap";
compfun = mu_sieve_comparator_lookup (mach, compname, matchtype);
if (!compfun)
{
mu_diag_at_locus (MU_LOG_ERROR, &mach->locus,
_("comparator `%s' is incompatible with match type `%s' in call to `%s'"),
compname, match ? match->tag : "is",
mach->identifier);
mu_i_sv_error (mach);
return 1;
}
}
mach->comparator = compfun;
return 0;
}
static int
regmatch (mu_sieve_machine_t mach, mu_sieve_string_t *pattern, char const *text)
{
regex_t *reg = pattern->rx;
regmatch_t *match_buf = NULL;
size_t match_count = 0;
if (mu_sieve_has_variables (mach))
{
match_count = reg->re_nsub + 1;
while (mach->match_max < match_count)
mu_i_sv_2nrealloc (mach, (void **) &mach->match_buf,
&mach->match_max,
sizeof (mach->match_buf[0]));
mach->match_count = match_count;
mu_sieve_free (mach, mach->match_string);
mach->match_string = mu_sieve_strdup (mach, text);
match_buf = mach->match_buf;
}
return regexec (reg, text, match_count, match_buf, 0) == 0;
}
/* Particular comparators */
/* :comparator i;octet */
static int
i_octet_is (mu_sieve_machine_t mach, mu_sieve_string_t *pattern,
const char *text)
{
return strcmp (mu_sieve_string_get (mach, pattern), text) == 0;
}
static int
i_octet_contains (mu_sieve_machine_t mach, mu_sieve_string_t *pattern,
const char *text)
{
return strstr (text, mu_sieve_string_get (mach, pattern)) != NULL;
}
static int
i_octet_matches (mu_sieve_machine_t mach, mu_sieve_string_t *pattern,
const char *text)
{
compile_wildcard (mach, pattern, 0);
return regmatch (mach, pattern, text);
}
static int
i_octet_regex (mu_sieve_machine_t mach, mu_sieve_string_t *pattern,
const char *text)
{
compile_pattern (mach, pattern, 0);
return regmatch (mach, pattern, text);
}
static int
i_octet_eq (mu_sieve_machine_t mach,
mu_sieve_string_t *pattern, const char *text)
{
return strcmp (text, mu_sieve_string_get (mach, pattern));
}
/* :comparator i;ascii-casemap */
static int
i_ascii_casemap_is (mu_sieve_machine_t mach,
mu_sieve_string_t *pattern, const char *text)
{
return mu_c_strcasecmp (mu_sieve_string_get (mach, pattern), text) == 0;
}
static int
i_ascii_casemap_contains (mu_sieve_machine_t mach,
mu_sieve_string_t *pattern, const char *text)
{
return mu_c_strcasestr (text, mu_sieve_string_get (mach, pattern)) != NULL;
}
static int
i_ascii_casemap_matches (mu_sieve_machine_t mach,
mu_sieve_string_t *pattern, const char *text)
{
compile_wildcard (mach, pattern, MU_GLOBF_ICASE);
return regmatch (mach, pattern, text);
}
static int
i_ascii_casemap_regex (mu_sieve_machine_t mach,
mu_sieve_string_t *pattern, const char *text)
{
compile_pattern (mach, pattern, REG_ICASE);
return regmatch (mach, pattern, text);
}
static int
i_ascii_casemap_eq (mu_sieve_machine_t mach,
mu_sieve_string_t *pattern, const char *text)
{
return mu_c_strcasecmp (text, mu_sieve_string_get (mach, pattern));
}
/* :comparator i;ascii-numeric */
static int
i_ascii_numeric_is (mu_sieve_machine_t mach,
mu_sieve_string_t *pattern, const char *text)
{
char *str = mu_sieve_string_get (mach, pattern);
if (mu_isdigit (*str))
{
if (mu_isdigit (*text))
/* FIXME: Error checking */
return strtol (str, NULL, 10) == strtol (text, NULL, 10);
else
return 0;
}
else if (mu_isdigit (*text))
return 0;
else
return 1;
}
static int
i_ascii_numeric_eq (mu_sieve_machine_t mach,
mu_sieve_string_t *pattern, const char *text)
{
char *str = mu_sieve_string_get (mach, pattern);
if (mu_isdigit (*str))
{
if (mu_isdigit (*text))
{
size_t a = strtoul (str, NULL, 10);
size_t b = strtoul (text, NULL, 10);
if (b > a)
return 1;
else if (b < a)
return -1;
return 0;
}
else
return 1;
}
else
return 1;
}
void
mu_i_sv_register_standard_comparators (mu_sieve_machine_t mach)
{
mu_sieve_register_comparator (mach,
"i;octet",
1,
i_octet_is,
i_octet_contains,
i_octet_matches,
i_octet_regex,
i_octet_eq);
mu_sieve_register_comparator (mach,
"i;ascii-casemap",
1,
i_ascii_casemap_is,
i_ascii_casemap_contains,
i_ascii_casemap_matches,
i_ascii_casemap_regex,
i_ascii_casemap_eq);
mu_sieve_register_comparator (mach,
"i;ascii-numeric",
0,
i_ascii_numeric_is,
NULL,
NULL,
NULL,
i_ascii_numeric_eq);
}