tests.c
9.31 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
/* GNU Mailutils -- a suite of utilities for electronic mail
Copyright (C) 1999-2005, 2007-2012, 2014-2016 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 <sieve-priv.h>
typedef int (*address_aget_t) (mu_address_t addr, size_t no, char **buf);
address_aget_t
sieve_get_address_part (mu_sieve_machine_t mach)
{
size_t i;
for (i = 0; i < mach->tagcount; i++)
{
mu_sieve_value_t *t = mu_sieve_get_tag_n (mach, i);
if (strcmp (t->tag, "all") == 0)
return mu_address_aget_email;
else if (strcmp (t->tag, "domain") == 0)
return mu_address_aget_domain;
else if (strcmp (t->tag, "localpart") == 0)
return mu_address_aget_local_part;
}
/* RFC 3028, 2.7.4. Comparisons Against Addresses:
If an optional address-part is omitted, the default is ":all". */
return mu_address_aget_email;
}
/* Structure shared between address and envelope tests */
struct address_closure
{
address_aget_t aget; /* appropriate address_aget_ function */
void *data; /* Either mu_header_t or mu_envelope_t */
mu_address_t addr; /* Obtained address */
};
int
mu_sieve_relational_count (mu_sieve_machine_t mach, size_t count, int retval)
{
char *relcmp;
if (mu_sieve_get_tag (mach, "count", SVT_STRING, &relcmp))
{
size_t limit;
char *str, *p;
struct mu_sieve_slice slice;
mu_sieve_relcmpn_t stest;
mu_sieve_get_arg (mach, 1, SVT_STRING_LIST, &slice);
str = mu_sieve_string (mach, &slice, 0);
limit = strtoul (str, &p, 10);
if (*p)
{
mu_sieve_error (mach, _("%s: not an integer"), str);
mu_sieve_abort (mach);
}
mu_sieve_str_to_relcmp (relcmp, NULL, &stest);
return stest (count, limit);
}
return retval;
}
int
retrieve_address (void *item, void *data, int idx, char **pval)
{
struct address_closure *ap = data;
char *val;
int rc;
if (!ap->addr)
{
if (mu_header_aget_value ((mu_header_t)ap->data, (char*)item, &val))
return 1;
rc = mu_address_create (&ap->addr, val);
free (val);
if (rc)
return rc;
}
rc = ap->aget (ap->addr, idx+1, pval);
if (rc)
mu_address_destroy (&ap->addr);
return rc;
}
int
sieve_test_address (mu_sieve_machine_t mach)
{
mu_sieve_value_t *h, *v;
mu_header_t header = NULL;
mu_sieve_comparator_t comp = mu_sieve_get_comparator (mach);
mu_sieve_relcmp_t test = mu_sieve_get_relcmp (mach);
struct address_closure clos;
int rc;
size_t count = 0;
h = mu_sieve_get_arg_untyped (mach, 0);
v = mu_sieve_get_arg_untyped (mach, 1);
mu_message_get_header (mu_sieve_get_message (mach), &header);
clos.data = header;
clos.aget = sieve_get_address_part (mach);
clos.addr = NULL;
rc = mu_sieve_vlist_compare (mach, h, v, comp, test, retrieve_address, &clos,
&count);
mu_address_destroy (&clos.addr);
return mu_sieve_relational_count (mach, count, rc);
}
struct header_closure
{
mu_header_t header;
int index;
};
int
retrieve_header (void *item, void *data, int idx, char **pval)
{
struct header_closure *hc = data;
char buf[512];
size_t n;
if (idx == 0)
hc->index = 1;
while (!mu_header_get_field_name (hc->header, hc->index, buf, sizeof(buf), &n))
{
int i = hc->index++;
if (mu_c_strcasecmp (buf, (char*)item) == 0)
{
if (mu_header_aget_field_value_unfold (hc->header, i, pval))
return 1;
return 0;
}
}
return 1;
}
int
sieve_test_header (mu_sieve_machine_t mach)
{
mu_sieve_value_t *h, *v;
mu_sieve_comparator_t comp = mu_sieve_get_comparator (mach);
mu_sieve_relcmp_t test = mu_sieve_get_relcmp (mach);
size_t count = 0, mcount = 0;
struct header_closure clos;
h = mu_sieve_get_arg_untyped (mach, 0);
v = mu_sieve_get_arg_untyped (mach, 1);
if (mu_sieve_get_tag (mach, "mime", SVT_VOID, NULL))
{
int ismime = 0;
mu_message_is_multipart (mach->msg, &ismime);
if (ismime)
{
size_t i, nparts = 0;
mu_message_get_num_parts (mach->msg, &nparts);
for (i = 1; i <= nparts; i++)
{
mu_message_t message = NULL;
if (mu_message_get_part (mach->msg, i, &message) == 0)
{
mu_message_get_header (message, &clos.header);
if (mu_sieve_vlist_compare (mach, h, v, comp, test,
retrieve_header, &clos, &mcount))
return 1;
}
}
}
}
mu_message_get_header (mach->msg, &clos.header);
if (mu_sieve_vlist_compare (mach, h, v, comp, test, retrieve_header, &clos,
&count))
return 1;
return mu_sieve_relational_count (mach, count + mcount, 0);
}
int
retrieve_envelope (void *item, void *data, int idx, char **pval)
{
struct address_closure *ap = data;
int rc;
if (!ap->addr)
{
const char *buf;
if (mu_c_strcasecmp ((char*)item, "from") != 0)
return 1;
if (mu_envelope_sget_sender ((mu_envelope_t)ap->data, &buf))
return 1;
rc = mu_address_create (&ap->addr, buf);
if (rc)
return rc;
}
rc = ap->aget (ap->addr, idx+1, pval);
if (rc)
mu_address_destroy (&ap->addr);
return rc;
}
int
sieve_test_envelope (mu_sieve_machine_t mach)
{
mu_sieve_value_t *h, *v;
mu_sieve_comparator_t comp = mu_sieve_get_comparator (mach);
mu_sieve_relcmp_t test = mu_sieve_get_relcmp (mach);
struct address_closure clos;
int rc;
size_t count = 0;
h = mu_sieve_get_arg_untyped (mach, 0);
v = mu_sieve_get_arg_untyped (mach, 1);
mu_message_get_envelope (mu_sieve_get_message (mach),
(mu_envelope_t*)&clos.data);
clos.aget = sieve_get_address_part (mach);
clos.addr = NULL;
rc = mu_sieve_vlist_compare (mach, h, v, comp, test, retrieve_envelope, &clos,
&count);
mu_address_destroy (&clos.addr);
return mu_sieve_relational_count (mach, count, rc);
}
int
sieve_test_size (mu_sieve_machine_t mach)
{
int rc = 1;
size_t size;
size_t arg;
mu_sieve_get_arg (mach, 0, SVT_NUMBER, &arg);
mu_message_size (mu_sieve_get_message (mach), &size);
if (mach->tagcount)
{
mu_sieve_value_t *tag = mu_sieve_get_tag_n (mach, 0);
if (strcmp (tag->tag, "over") == 0)
rc = size > arg;
else if (strcmp (tag->tag, "under") == 0)
rc = size < arg;
else
abort ();
}
else
rc = size == arg;
return rc;
}
int
_test_exists (void *item, void *data)
{
mu_header_t hdr = data;
size_t n;
return mu_header_get_value (hdr, (char*)item, NULL, 0, &n);
}
int
sieve_test_exists (mu_sieve_machine_t mach)
{
mu_header_t header = NULL;
mu_sieve_value_t *val;
mu_message_get_header (mu_sieve_get_message (mach), &header);
val = mu_sieve_get_arg_untyped (mach, 0);
return mu_sieve_vlist_do (mach, val, _test_exists, header) == 0;
}
static mu_sieve_tag_def_t address_part_tags[] = {
{ "localpart", SVT_VOID },
{ "domain", SVT_VOID },
{ "all", SVT_VOID },
{ NULL }
};
mu_sieve_tag_def_t mu_sieve_match_part_tags[] = {
{ "is", SVT_VOID },
{ "contains", SVT_VOID },
{ "matches", SVT_VOID },
{ "regex", SVT_VOID },
{ "count", SVT_STRING },
{ "value", SVT_STRING },
{ "comparator", SVT_STRING },
{ NULL }
};
static mu_sieve_tag_def_t size_tags[] = {
{ "over", SVT_VOID },
{ "under", SVT_VOID },
{ NULL }
};
static mu_sieve_tag_def_t mime_tags[] = {
{ "mime", SVT_VOID },
{ NULL }
};
#define ADDRESS_PART_GROUP \
{ address_part_tags, NULL }
#define MATCH_PART_GROUP \
{ mu_sieve_match_part_tags, mu_sieve_match_part_checker }
#define SIZE_GROUP { size_tags, NULL }
#define MIME_GROUP \
{ mime_tags, NULL }
mu_sieve_tag_group_t address_tag_groups[] = {
ADDRESS_PART_GROUP,
MATCH_PART_GROUP,
{ NULL }
};
mu_sieve_data_type address_req_args[] = {
SVT_STRING_LIST,
SVT_STRING_LIST,
SVT_VOID
};
mu_sieve_tag_group_t size_tag_groups[] = {
SIZE_GROUP,
{ NULL }
};
mu_sieve_data_type size_req_args[] = {
SVT_NUMBER,
SVT_VOID
};
mu_sieve_tag_group_t envelope_tag_groups[] = {
ADDRESS_PART_GROUP,
MATCH_PART_GROUP,
{ NULL }
};
mu_sieve_data_type exists_req_args[] = {
SVT_STRING_LIST,
SVT_VOID
};
mu_sieve_tag_group_t header_tag_groups[] = {
MATCH_PART_GROUP,
MIME_GROUP,
{ NULL }
};
void
mu_i_sv_register_standard_tests (mu_sieve_machine_t mach)
{
/* true and false are built-ins */
mu_sieve_register_test (mach, "address", sieve_test_address,
address_req_args, address_tag_groups, 1);
mu_sieve_register_test (mach, "size", sieve_test_size,
size_req_args, size_tag_groups, 1);
mu_sieve_register_test (mach, "envelope", sieve_test_envelope,
address_req_args, envelope_tag_groups, 1);
mu_sieve_register_test (mach, "exists", sieve_test_exists,
exists_req_args, NULL, 1);
mu_sieve_register_test (mach, "header", sieve_test_header,
address_req_args, header_tag_groups, 1);
}