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
|
/*
* Copyright (c) 2009, Rambler media
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY Rambler media ''AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL Rambler BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "main.h"
#include "util.h"
#include "view.h"
#include "expressions.h"
#include "cfg_file.h"
#include "map.h"
struct rspamd_view *
init_view (memory_pool_t * pool)
{
struct rspamd_view *new;
new = memory_pool_alloc0 (pool, sizeof (struct rspamd_view));
new->pool = pool;
new->from_hash = g_hash_table_new (rspamd_strcase_hash, rspamd_strcase_equal);
new->symbols_hash = g_hash_table_new (rspamd_strcase_hash, rspamd_strcase_equal);
new->ip_tree = radix_tree_create ();
new->client_ip_tree = radix_tree_create ();
memory_pool_add_destructor (new->pool, (pool_destruct_func) g_hash_table_destroy, new->symbols_hash);
return new;
}
gboolean
add_view_from (struct rspamd_view * view, char *line)
{
struct rspamd_regexp *re = NULL;
if (add_map (line, read_host_list, fin_host_list, (void **)&view->from_hash)) {
return TRUE;
}
else if ((re = parse_regexp (view->pool, line, TRUE)) != NULL) {
view->from_re_list = g_list_prepend (view->from_re_list, re);
return TRUE;
}
return FALSE;
}
gboolean
add_view_symbols (struct rspamd_view * view, char *line)
{
struct rspamd_regexp *re = NULL;
GList *symbols;
if (add_map (line, read_host_list, fin_host_list, (void **)&view->symbols_hash)) {
return TRUE;
}
else if ((re = parse_regexp (view->pool, line, TRUE)) != NULL) {
view->symbols_re_list = g_list_prepend (view->symbols_re_list, re);
return TRUE;
}
else {
/* Try to parse symbols line as comma separated list */
symbols = parse_comma_list (view->pool, line);
while (symbols) {
g_hash_table_insert (view->symbols_hash, (char *)symbols->data, symbols->data);
/* Symbols list would be free at pool destruction */
symbols = g_list_next (symbols);
}
}
return FALSE;
}
gboolean
add_view_ip (struct rspamd_view * view, char *line)
{
if (add_map (line, read_radix_list, fin_radix_list, (void **)&view->ip_tree)) {
return TRUE;
}
return FALSE;
}
gboolean
add_view_client_ip (struct rspamd_view * view, char *line)
{
if (add_map (line, read_radix_list, fin_radix_list, (void **)&view->client_ip_tree)) {
return TRUE;
}
return FALSE;
}
static struct rspamd_view *
find_view_by_ip (GList * views, struct worker_task *task)
{
GList *cur;
struct rspamd_view *v;
if (task->from_addr.s_addr == INADDR_NONE) {
return NULL;
}
cur = views;
while (cur) {
v = cur->data;
if (radix32tree_find (v->ip_tree, ntohl (task->from_addr.s_addr)) != RADIX_NO_VALUE) {
return v;
}
cur = g_list_next (cur);
}
return NULL;
}
static struct rspamd_view *
find_view_by_client_ip (GList * views, struct worker_task *task)
{
GList *cur;
struct rspamd_view *v;
if (task->client_addr.s_addr == INADDR_NONE) {
return NULL;
}
cur = views;
while (cur) {
v = cur->data;
if (radix32tree_find (v->client_ip_tree, ntohl (task->client_addr.s_addr)) != RADIX_NO_VALUE) {
return v;
}
cur = g_list_next (cur);
}
return NULL;
}
static struct rspamd_view *
find_view_by_from (GList * views, struct worker_task *task)
{
GList *cur, *cur_re;
struct rspamd_view *v;
struct rspamd_regexp *re;
if (task->from == NULL) {
return NULL;
}
cur = views;
while (cur) {
v = cur->data;
/* First try to lookup in hashtable */
if (g_hash_table_lookup (v->from_hash, task->from) != NULL) {
return v;
}
/* Then try to match re */
cur_re = v->from_re_list;
while (cur_re) {
re = cur_re->data;
if (g_regex_match (re->regexp, task->from, 0, NULL) == TRUE) {
return v;
}
cur_re = g_list_next (cur_re);
}
cur = g_list_next (cur);
}
return NULL;
}
static gboolean
match_view_symbol (struct rspamd_view *v, const char *symbol)
{
GList *cur;
struct rspamd_regexp *re;
/* Special case */
if (symbol == NULL) {
return TRUE;
}
/* First try to lookup in hashtable */
if (g_hash_table_lookup (v->symbols_hash, symbol) != NULL) {
return TRUE;
}
/* Then try to match re */
cur = v->symbols_re_list;
while (cur) {
re = cur->data;
if (g_regex_match (re->regexp, symbol, 0, NULL) == TRUE) {
return TRUE;
}
cur = g_list_next (cur);
}
return FALSE;
}
gboolean
check_view (GList * views, const char *symbol, struct worker_task * task)
{
struct rspamd_view *selected = NULL;
if (views == NULL || (task->view == NULL && task->view_checked == TRUE)) {
/* If now views defined just return TRUE to check each symbol */
return TRUE;
}
if (task->view != NULL) {
goto check_symbol;
}
if ((selected = find_view_by_ip (views, task)) == NULL) {
if ((selected = find_view_by_client_ip (views, task)) == NULL) {
if ((selected = find_view_by_from (views, task)) == NULL) {
/* No matching view for this task */
task->view_checked = TRUE;
return TRUE;
}
}
}
task->view_checked = TRUE;
task->view = selected;
check_symbol:
/* selected is now not NULL */
if (task->view->skip_check) {
return FALSE;
}
if (match_view_symbol (task->view, symbol)) {
return TRUE;
}
return FALSE;
}
gboolean
check_skip (GList * views, struct worker_task * task)
{
if (check_view (views, NULL, task) == FALSE) {
return TRUE;
}
return FALSE;
}
|