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
|
/* 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"
extern struct rspamd_main *rspamd_main;
/*
* Destructor for recipients list in a task
*/
static void
rcpt_destruct (void *pointer)
{
struct worker_task *task = (struct worker_task *) pointer;
if (task->rcpt) {
g_list_free (task->rcpt);
}
}
/*
* Create new task
*/
struct worker_task *
construct_task (struct rspamd_worker *worker)
{
struct worker_task *new_task;
new_task = g_slice_alloc0 (sizeof (struct worker_task));
new_task->worker = worker;
new_task->state = READ_COMMAND;
if (worker) {
new_task->cfg = worker->srv->cfg;
}
new_task->view_checked = FALSE;
#ifdef HAVE_CLOCK_GETTIME
# ifdef HAVE_CLOCK_PROCESS_CPUTIME_ID
clock_gettime (CLOCK_PROCESS_CPUTIME_ID, &new_task->ts);
# elif defined(HAVE_CLOCK_VIRTUAL)
clock_gettime (CLOCK_VIRTUAL, &new_task->ts);
# else
clock_gettime (CLOCK_REALTIME, &new_task->ts);
# endif
#endif
if (gettimeofday (&new_task->tv, NULL) == -1) {
msg_warn ("gettimeofday failed: %s", strerror (errno));
}
new_task->task_pool = memory_pool_new (memory_pool_get_size ());
/* Add destructor for recipients list (it would be better to use anonymous function here */
memory_pool_add_destructor (new_task->task_pool,
(pool_destruct_func) rcpt_destruct, new_task);
new_task->results = g_hash_table_new (rspamd_str_hash, rspamd_str_equal);
memory_pool_add_destructor (new_task->task_pool,
(pool_destruct_func) g_hash_table_destroy,
new_task->results);
new_task->re_cache = g_hash_table_new (rspamd_str_hash, rspamd_str_equal);
memory_pool_add_destructor (new_task->task_pool,
(pool_destruct_func) g_hash_table_destroy,
new_task->re_cache);
new_task->raw_headers = g_hash_table_new (rspamd_strcase_hash, rspamd_strcase_equal);
memory_pool_add_destructor (new_task->task_pool,
(pool_destruct_func) g_hash_table_destroy,
new_task->raw_headers);
new_task->emails = g_tree_new (compare_email_func);
memory_pool_add_destructor (new_task->task_pool,
(pool_destruct_func) g_tree_destroy,
new_task->emails);
new_task->urls = g_tree_new (compare_url_func);
memory_pool_add_destructor (new_task->task_pool,
(pool_destruct_func) g_tree_destroy,
new_task->urls);
new_task->sock = -1;
new_task->is_mime = TRUE;
new_task->pre_result.action = METRIC_ACTION_NOACTION;
return new_task;
}
/**
* 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;
}
/*
* Free all structures of worker_task
*/
void
free_task (struct worker_task *task, gboolean is_soft)
{
GList *part;
struct mime_part *p;
if (task) {
debug_task ("free pointer %p", task);
while ((part = g_list_first (task->parts))) {
task->parts = g_list_remove_link (task->parts, part);
p = (struct mime_part *) part->data;
g_byte_array_free (p->content, TRUE);
g_list_free_1 (part);
}
if (task->text_parts) {
g_list_free (task->text_parts);
}
if (task->images) {
g_list_free (task->images);
}
if (task->messages) {
g_list_free (task->messages);
}
if (task->received) {
g_list_free (task->received);
}
memory_pool_delete (task->task_pool);
if (task->dispatcher) {
if (is_soft) {
/* Plan dispatcher shutdown */
task->dispatcher->wanna_die = 1;
}
else {
rspamd_remove_dispatcher (task->dispatcher);
}
}
if (task->sock != -1) {
close (task->sock);
}
g_slice_free1 (sizeof (struct worker_task), task);
}
}
void
free_task_hard (gpointer ud)
{
struct worker_task *task = ud;
free_task (task, FALSE);
}
void
free_task_soft (gpointer ud)
{
struct worker_task *task = ud;
free_task (task, FALSE);
}
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 = memory_pool_alloc_shared (rspamd_main->counters->pool, sizeof (struct counter_data));
cd->value = value;
cd->number = 0;
key = memory_pool_strdup_shared (rspamd_main->counters->pool, name);
rspamd_hash_insert (rspamd_main->counters, (gpointer) key, (gpointer) cd);
}
else {
/* Calculate new value */
memory_pool_wlock_rwlock (rspamd_main->counters->lock);
alpha = 2. / (++cd->number + 1);
cd->value = cd->value * (1. - alpha) + value * alpha;
memory_pool_wunlock_rwlock (rspamd_main->counters->lock);
}
return cd->value;
}
|
