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
|
/* Copyright (c) 2010-2011, Vsevolod Stakhov
* 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 ''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 AUTHOR 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 "message.h"
#include "lua/lua_common.h"
extern struct rspamd_main *rspamd_main;
/**
* Return worker's control structure by its type
* @param type
* @return worker's control structure or NULL
*/
worker_t*
get_worker_by_type (GQuark type)
{
worker_t **cur;
cur = &workers[0];
while (*cur) {
if (g_quark_from_string ((*cur)->name) == type) {
return *cur;
}
cur ++;
}
return NULL;
}
double
set_counter (const gchar *name, guint32 value)
{
struct counter_data *cd;
double alpha;
gchar *key;
cd = rspamd_hash_lookup (rspamd_main->counters, (gpointer) name);
if (cd == NULL) {
cd = rspamd_mempool_alloc_shared (rspamd_main->counters->pool, sizeof (struct counter_data));
cd->value = value;
cd->number = 0;
key = rspamd_mempool_strdup_shared (rspamd_main->counters->pool, name);
rspamd_hash_insert (rspamd_main->counters, (gpointer) key, (gpointer) cd);
}
else {
/* Calculate new value */
rspamd_mempool_wlock_rwlock (rspamd_main->counters->lock);
alpha = 2. / (++cd->number + 1);
cd->value = cd->value * (1. - alpha) + value * alpha;
rspamd_mempool_wunlock_rwlock (rspamd_main->counters->lock);
}
return cd->value;
}
struct event_base *
prepare_worker (struct rspamd_worker *worker, const char *name,
rspamd_sig_handler_t sig_handler,
void (*accept_handler)(int, short, void *))
{
struct event_base *ev_base;
struct event *accept_event;
struct sigaction signals;
GList *cur;
gint listen_socket;
#ifdef WITH_PROFILER
extern void _start (void), etext (void);
monstartup ((u_long) & _start, (u_long) & etext);
#endif
gperf_profiler_init (worker->srv->cfg, name);
worker->srv->pid = getpid ();
ev_base = event_init ();
init_signals (&signals, sig_handler);
sigprocmask (SIG_UNBLOCK, &signals.sa_mask, NULL);
/* Accept all sockets */
cur = worker->cf->listen_socks;
while (cur) {
listen_socket = GPOINTER_TO_INT (cur->data);
if (listen_socket != -1) {
accept_event = g_slice_alloc0 (sizeof (struct event));
event_set (accept_event, listen_socket, EV_READ | EV_PERSIST,
accept_handler, worker);
event_base_set (ev_base, accept_event);
event_add (accept_event, NULL);
worker->accept_events = g_list_prepend (worker->accept_events, accept_event);
}
cur = g_list_next (cur);
}
return ev_base;
}
void
worker_stop_accept (struct rspamd_worker *worker)
{
GList *cur;
struct event *event;
/* Remove all events */
cur = worker->accept_events;
while (cur) {
event = cur->data;
event_del (event);
cur = g_list_next (cur);
g_slice_free1 (sizeof (struct event), event);
}
if (worker->accept_events != NULL) {
g_list_free (worker->accept_events);
}
}
/*
* Called if all filters are processed
* @return TRUE if session should be terminated
*/
gboolean
rspamd_task_fin (void *arg)
{
struct rspamd_task *task = (struct rspamd_task *) arg;
gint r;
GError *err = NULL;
/* Task is already finished or skipped */
if (task->state == WRITE_REPLY) {
if (task->fin_callback) {
task->fin_callback (task->fin_arg);
}
else {
rspamd_protocol_write_reply (task);
}
return TRUE;
}
/* We processed all filters and want to process statfiles */
if (task->state != WAIT_POST_FILTER && task->state != WAIT_PRE_FILTER) {
/* Process all statfiles */
if (task->classify_pool == NULL) {
/* Non-threaded version */
process_statfiles (task);
}
else {
/* Just process composites */
make_composites (task);
}
if (task->cfg->post_filters) {
/* More to process */
/* Special state */
task->state = WAIT_POST_FILTER;
return FALSE;
}
}
/* We are on post-filter waiting state */
if (task->state != WAIT_PRE_FILTER) {
/* Check if we have all events finished */
task->state = WRITE_REPLY;
if (task->fin_callback) {
task->fin_callback (task->fin_arg);
}
else {
rspamd_protocol_write_reply (task);
}
}
else {
/* We were waiting for pre-filter */
if (task->pre_result.action != METRIC_ACTION_NOACTION) {
/* Write result based on pre filters */
task->state = WRITE_REPLY;
if (task->fin_callback) {
task->fin_callback (task->fin_arg);
}
else {
rspamd_protocol_write_reply (task);
}
return TRUE;
}
else {
task->state = WAIT_FILTER;
r = process_filters (task);
if (r == -1) {
task->last_error = "Filter processing error";
task->error_code = RSPAMD_FILTER_ERROR;
task->state = WRITE_REPLY;
rspamd_protocol_write_reply (task);
return TRUE;
}
/* Add task to classify to classify pool */
if (!task->is_skipped && task->classify_pool) {
register_async_thread (task->s);
g_thread_pool_push (task->classify_pool, task, &err);
if (err != NULL) {
msg_err ("cannot pull task to the pool: %s", err->message);
remove_async_thread (task->s);
g_error_free (err);
}
}
if (task->is_skipped) {
rspamd_protocol_write_reply (task);
}
else {
return FALSE;
}
}
}
return TRUE;
}
/*
* Called if session was restored inside fin callback
*/
void
rspamd_task_restore (void *arg)
{
struct rspamd_task *task = (struct rspamd_task *) arg;
/* Call post filters */
if (task->state == WAIT_POST_FILTER) {
lua_call_post_filters (task);
}
task->s->wanna_die = TRUE;
}
|
