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
|
/* Copyright (c) 2002-2010 Dovecot Sieve authors, see the included COPYING file
*/
#include "lib.h"
#include "mempool.h"
#include "hash.h"
#include "array.h"
#include "sieve-extensions.h"
#include "sieve-commands.h"
#include "sieve-code.h"
#include "sieve-binary.h"
#include "sieve-validator.h"
#include "sieve-generator.h"
#include "sieve-interpreter.h"
#include "sieve-dump.h"
#include "sieve-comparators.h"
#include "sieve-match-types.h"
#include "sieve-match.h"
/*
* Matching implementation
*/
struct sieve_match_context *sieve_match_begin
(struct sieve_interpreter *interp, const struct sieve_match_type *mcht,
const struct sieve_comparator *cmp,
const struct sieve_match_key_extractor *kextract,
struct sieve_coded_stringlist *key_list)
{
struct sieve_match_context *mctx;
pool_t pool;
pool = pool_alloconly_create("sieve_match_context", 1024);
mctx = p_new(pool, struct sieve_match_context, 1);
mctx->pool = pool;
mctx->interp = interp;
mctx->match_type = mcht;
mctx->comparator = cmp;
mctx->kextract = kextract;
mctx->key_list = key_list;
if ( mcht->def != NULL && mcht->def->match_init != NULL ) {
mcht->def->match_init(mctx);
}
return mctx;
}
int sieve_match_value
(struct sieve_match_context *mctx, const char *value, size_t val_size)
{
const struct sieve_match_type *mcht = mctx->match_type;
sieve_coded_stringlist_reset(mctx->key_list);
bool ok = TRUE;
/* Reject unimplemented match-type */
if ( mcht->def == NULL || mcht->def->match == NULL )
return FALSE;
/* Match to all key values */
if ( mcht->def->is_iterative ) {
unsigned int key_index = 0;
string_t *key_item = NULL;
int ret = 0;
while ( (ok=sieve_coded_stringlist_next_item(mctx->key_list, &key_item))
&& key_item != NULL ) {
T_BEGIN {
if ( mctx->kextract != NULL && mcht->def->allow_key_extract ) {
const struct sieve_match_key_extractor *kext = mctx->kextract;
void *kctx;
if ( (ret=kext->init(&kctx, key_item)) > 0 ) {
const char *key;
size_t key_size;
while ( (ret=kext->extract_key(kctx, &key, &key_size)) > 0 ) {
ret = mcht->def->match
(mctx, value, val_size, key, key_size, key_index);
if ( ret != 0 ) break;
}
}
} else {
ret = mcht->def->match(mctx, value, val_size, str_c(key_item),
str_len(key_item), key_index);
}
} T_END;
if ( ret != 0 )
break;
key_index++;
}
if ( !ok )
return -1;
if ( ret < 0 )
return ret;
if ( ret > 0 )
return TRUE;
} else {
bool result;
T_BEGIN {
result = mcht->def->match(mctx, value, val_size, NULL, 0, -1);
} T_END;
return result;
}
return FALSE;
}
int sieve_match_end(struct sieve_match_context **mctx)
{
const struct sieve_match_type *mcht = (*mctx)->match_type;
int ret = FALSE;
if ( mcht->def != NULL && mcht->def->match_deinit != NULL ) {
ret = mcht->def->match_deinit(*mctx);
}
pool_unref(&(*mctx)->pool);
*mctx = NULL;
return ret;
}
/*
* Reading match operands
*/
bool sieve_match_dump_optional_operands
(const struct sieve_dumptime_env *denv, sieve_size_t *address, int *opt_code)
{
if ( *opt_code != SIEVE_MATCH_OPT_END ||
sieve_operand_optional_present(denv->sbin, address) ) {
do {
if ( !sieve_operand_optional_read(denv->sbin, address, opt_code) )
return FALSE;
switch ( *opt_code ) {
case SIEVE_MATCH_OPT_END:
break;
case SIEVE_MATCH_OPT_COMPARATOR:
if ( !sieve_opr_comparator_dump(denv, address) )
return FALSE;
break;
case SIEVE_MATCH_OPT_MATCH_TYPE:
if ( !sieve_opr_match_type_dump(denv, address) )
return FALSE;
break;
default:
return TRUE;
}
} while ( *opt_code != SIEVE_MATCH_OPT_END );
}
return TRUE;
}
int sieve_match_read_optional_operands
(const struct sieve_runtime_env *renv, sieve_size_t *address, int *opt_code,
struct sieve_comparator *cmp, struct sieve_match_type *mcht)
{
/* Handle any optional arguments */
if ( *opt_code != SIEVE_MATCH_OPT_END ||
sieve_operand_optional_present(renv->sbin, address) ) {
do {
if ( !sieve_operand_optional_read(renv->sbin, address, opt_code) ) {
sieve_runtime_trace_error(renv, "invalid optional operand");
return SIEVE_EXEC_BIN_CORRUPT;
}
switch ( *opt_code ) {
case SIEVE_MATCH_OPT_END:
break;
case SIEVE_MATCH_OPT_COMPARATOR:
if ( !sieve_opr_comparator_read(renv, address, cmp) ) {
sieve_runtime_trace_error(renv, "invalid comparator operand");
return SIEVE_EXEC_BIN_CORRUPT;
}
break;
case SIEVE_MATCH_OPT_MATCH_TYPE:
if ( !sieve_opr_match_type_read(renv, address, mcht) ) {
sieve_runtime_trace_error(renv, "invalid match type operand");
return SIEVE_EXEC_BIN_CORRUPT;
}
break;
default:
return SIEVE_EXEC_OK;
}
} while ( *opt_code != SIEVE_MATCH_OPT_END );
}
return SIEVE_EXEC_OK;
}
|
