comparator.c
10.6 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
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
/* GNU mailutils - a suite of utilities for electronic mail
Copyright (C) 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
This program 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 2, 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <sieve.h>
#include <fnmatch.h>
#include <regex.h>
typedef struct {
char *name;
int required;
sieve_comparator_t comp[MU_SIEVE_MATCH_LAST];
} sieve_comparator_record_t;
int
sieve_register_comparator (sieve_machine_t mach,
const char *name,
int required,
sieve_comparator_t is, sieve_comparator_t contains,
sieve_comparator_t matches,
sieve_comparator_t regex)
{
sieve_comparator_record_t *rp;
if (!mach->comp_list)
{
int rc = list_create (&mach->comp_list);
if (rc)
return rc;
}
rp = sieve_palloc (&mach->memory_pool, sizeof (*rp));
rp->required = required;
rp->name = name;
rp->comp[MU_SIEVE_MATCH_IS] = is;
rp->comp[MU_SIEVE_MATCH_CONTAINS] = contains;
rp->comp[MU_SIEVE_MATCH_MATCHES] = matches;
rp->comp[MU_SIEVE_MATCH_REGEX] = regex;
return list_append (mach->comp_list, rp);
}
sieve_comparator_record_t *
_lookup (list_t list, const char *name)
{
iterator_t itr;
sieve_comparator_record_t *reg;
if (!list || iterator_create (&itr, list))
return NULL;
for (iterator_first (itr); !iterator_is_done (itr); iterator_next (itr))
{
iterator_current (itr, (void **)®);
if (strcmp (reg->name, name) == 0)
break;
else
reg = NULL;
}
iterator_destroy (&itr);
return reg;
}
int
sieve_require_comparator (sieve_machine_t mach, const char *name)
{
sieve_comparator_record_t *reg = _lookup (mach->comp_list, name);
if (!reg)
return 1;
reg->required = 1;
return 0;
}
sieve_comparator_t
sieve_comparator_lookup (sieve_machine_t mach, const char *name, int matchtype)
{
sieve_comparator_record_t *reg = _lookup (mach->comp_list, name);
if (reg && reg->comp[matchtype])
return reg->comp[matchtype];
return NULL;
}
static int
_find_comparator (void *item, void *data)
{
sieve_runtime_tag_t *tag = item;
if (strcmp (tag->tag, "comparator") == 0)
{
*(sieve_comparator_t*)data = tag->arg->v.ptr;
return 1;
}
return 0;
}
sieve_comparator_t
sieve_get_comparator (sieve_machine_t mach, list_t tags)
{
sieve_comparator_t comp = NULL;
list_do (tags, _find_comparator, &comp);
return comp ? comp : sieve_comparator_lookup (mach,
"i;ascii-casemap",
MU_SIEVE_MATCH_IS);
}
/* Compile time support */
struct regex_data {
int flags;
list_t list;
};
#ifndef FNM_CASEFOLD
static int
_pattern_upcase (void *item, void *data)
{
char *p;
for (p = item; *p; p++)
*p = toupper (*p);
return 0;
}
#endif
static int
_regex_compile (void *item, void *data)
{
struct regex_data *rd = data;
int rc;
regex_t *preg = sieve_palloc (&sieve_machine->memory_pool, sizeof (*preg));
rc = regcomp (preg, (char*)item, rd->flags);
if (rc)
{
size_t size = regerror (rc, preg, NULL, 0);
char *errbuf = malloc (size + 1);
if (errbuf)
{
regerror (rc, preg, errbuf, size);
sieve_compile_error (sieve_filename, sieve_line_num,
"regex error: %s", errbuf);
free (errbuf);
}
else
sieve_compile_error (sieve_filename, sieve_line_num,
"regex error");
return rc;
}
list_append (rd->list, preg);
return 0;
}
static int
_free_regex (void *item, void *unused)
{
regfree ((regex_t*)item);
return 0;
}
static void
_free_reglist (void *data)
{
list_t list = data;
list_do (list, _free_regex, NULL);
list_destroy (&list);
}
int
sieve_match_part_checker (const char *name, list_t tags, list_t args)
{
iterator_t itr;
sieve_runtime_tag_t *match = NULL;
sieve_runtime_tag_t *comp = NULL;
sieve_comparator_t compfun;
char *compname;
int matchtype;
int err = 0;
if (!tags || iterator_create (&itr, tags))
return 0;
for (iterator_first (itr); !err && !iterator_is_done (itr);
iterator_next (itr))
{
sieve_runtime_tag_t *t;
iterator_current (itr, (void **)&t);
if (strcmp (t->tag, "is") == 0
|| strcmp (t->tag, "contains") == 0
|| strcmp (t->tag, "matches") == 0
|| strcmp (t->tag, "regex") == 0)
{
if (match)
err = 1;
else
match = t;
}
else if (strcmp (t->tag, "comparator") == 0)
comp = t;
}
iterator_destroy (&itr);
if (err)
{
sieve_compile_error (sieve_filename, sieve_line_num,
"match type specified twice in call to `%s'",
name);
return 1;
}
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;
if (match)
list_remove (tags, match);
compname = comp ? comp->arg->v.string : "i;ascii-casemap";
compfun = sieve_comparator_lookup (sieve_machine, compname, matchtype);
if (!compfun)
{
sieve_compile_error (sieve_filename, sieve_line_num,
"comparator `%s' is incompatible with match type `%s' in call to `%s'",
compname, match ? match->tag : "is", name);
return 1;
}
if (comp)
{
sieve_pfree (&sieve_machine->memory_pool, comp->arg);
}
else
{
comp = sieve_palloc (&sieve_machine->memory_pool,
sizeof (*comp));
comp->tag = "comparator";
list_append (tags, comp);
}
comp->arg = sieve_value_create (SVT_POINTER, compfun);
if (matchtype == MU_SIEVE_MATCH_REGEX)
{
/* To speed up things, compile all patterns at once.
Notice that it is supposed that patterns are in arg 2 */
sieve_value_t *val, *newval;
struct regex_data rd;
int rc;
if (list_get (args, 1, (void**)&val))
return 0;
if (strcmp (compname, "i;ascii-casemap") == 0)
rd.flags = REG_ICASE;
else
rd.flags = 0;
list_create (&rd.list);
rc = sieve_vlist_do (val, _regex_compile, &rd);
sieve_machine_add_destructor (sieve_machine, _free_reglist, rd.list);
if (rc)
return rc;
newval = sieve_value_create (SVT_STRING_LIST, rd.list);
list_replace (args, val, newval);
}
#ifndef FNM_CASEFOLD
else if (matchtype == MU_SIEVE_MATCH_MATCHES
&& strcmp (compname, "i;ascii-casemap") == 0)
{
int rc;
sieve_value_t *val;
if (list_get (args, 1, (void**)&val))
return 0;
rc = sieve_vlist_do (val, _pattern_upcase, NULL);
if (rc)
return rc;
}
#endif
return 0;
}
/* Particular comparators */
/* :comparator i;octet */
static int
i_octet_is (const char *pattern, const char *text)
{
return strcmp (pattern, text) == 0;
}
static int
i_octet_contains (const char *pattern, const char *text)
{
return strstr (text, pattern) != NULL;
}
static int
i_octet_matches (const char *pattern, const char *text)
{
return fnmatch (pattern, text, 0) == 0;
}
/* FIXME */
static int
i_octet_regex (const char *pattern, const char *text)
{
return regexec ((regex_t *) pattern, text, 0, NULL, 0) == 0;
}
/* :comparator i;ascii-casemap */
static int
i_ascii_casemap_is (const char *pattern, const char *text)
{
return strcasecmp (pattern, text) == 0;
}
/* Based on strstr from GNU libc (Stephen R. van den Berg,
berg@pool.informatik.rwth-aachen.de) */
static int
i_ascii_casemap_contains (const char *pattern, const char *text)
{
register const unsigned char *haystack, *needle;
register unsigned int b, c;
#define U(c) toupper (c)
haystack = (const unsigned char *)text;
if ((b = U (*(needle = (const unsigned char*)pattern))))
{
haystack--;
do
{
if (!(c = *++haystack))
goto ret0;
}
while (U (c) != b);
if (!(c = *++needle))
goto foundneedle;
c = U (c);
++needle;
goto jin;
for (;;)
{
register unsigned int a;
register const unsigned char *rhaystack, *rneedle;
do
{
if (!(a = *++haystack))
goto ret0;
if (U (a) == b)
break;
if (!(a = *++haystack))
goto ret0;
shloop: }
while (U (a) != b);
jin: if (!(a = *++haystack))
goto ret0;
if (U (a) != c)
goto shloop;
if (U (*(rhaystack = haystack-- + 1)) ==
(a = U (*(rneedle = needle))))
do
{
if (!a)
goto foundneedle;
if (U (*++rhaystack) != (a = U (*++needle)))
break;
if (!a)
goto foundneedle;
}
while (U (*++rhaystack) == (a = U (*++needle)));
needle = rneedle;
if (!a)
break;
}
}
foundneedle:
return 1;
ret0:
return 0;
#undef U
}
static int
i_ascii_casemap_matches (const char *pattern, const char *text)
{
#ifdef FNM_CASEFOLD
return fnmatch (pattern, text, FNM_CASEFOLD) == 0;
#else
int rc;
char *p = strdup (text);
_pattern_upcase (p, NULL);
rc = fnmatch (pattern, p, 0) == 0;
free (p);
return rc;
#endif
}
static int
i_ascii_casemap_regex (const char *pattern, const char *text)
{
return regexec ((regex_t *) pattern, text, 0, NULL, 0) == 0;
}
/* :comparator i;ascii-numeric */
static int
i_ascii_numeric_is (const char *pattern, const char *text)
{
if (isdigit ((int) *pattern))
{
if (isdigit ((int) *text))
return strtol (pattern, NULL, 10) == strtol (text, NULL, 10);
else
return 0;
}
else if (isdigit ((int) *text))
return 0;
else
return 1;
}
void
sieve_register_standard_comparators (sieve_machine_t mach)
{
sieve_register_comparator (mach,
"i;octet",
1,
i_octet_is,
i_octet_contains,
i_octet_matches,
i_octet_regex);
sieve_register_comparator (mach,
"i;ascii-casemap",
1,
i_ascii_casemap_is,
i_ascii_casemap_contains,
i_ascii_casemap_matches,
i_ascii_casemap_regex);
sieve_register_comparator (mach,
"i;ascii-numeric",
0,
i_ascii_numeric_is,
NULL,
NULL,
NULL);
}