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
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
|
/*-
* Copyright 2016 Vsevolod Stakhov
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "config.h"
#include "mem_pool.h"
#include "scan_result.h"
#include "rspamd.h"
#include "message.h"
#include "lua/lua_common.h"
#include "libserver/cfg_file_private.h"
#include "libmime/scan_result_private.h"
#include "contrib/fastutf8/fastutf8.h"
#include <math.h>
#include "contrib/uthash/utlist.h"
#define msg_debug_metric(...) rspamd_conditional_debug_fast (NULL, NULL, \
rspamd_metric_log_id, "metric", task->task_pool->tag.uid, \
G_STRFUNC, \
__VA_ARGS__)
INIT_LOG_MODULE(metric)
/* Average symbols count to optimize hash allocation */
static struct rspamd_counter_data symbols_count;
static void
rspamd_scan_result_dtor (gpointer d)
{
struct rspamd_scan_result *r = (struct rspamd_scan_result *)d;
struct rspamd_symbol_result *sres;
rspamd_set_counter_ema (&symbols_count, kh_size (r->symbols), 0.5);
if (r->symbol_cbref != -1) {
luaL_unref (r->task->cfg->lua_state, LUA_REGISTRYINDEX, r->symbol_cbref);
}
kh_foreach_value (r->symbols, sres, {
if (sres->options) {
kh_destroy (rspamd_options_hash, sres->options);
}
});
kh_destroy (rspamd_symbols_hash, r->symbols);
kh_destroy (rspamd_symbols_group_hash, r->sym_groups);
}
struct rspamd_scan_result *
rspamd_create_metric_result (struct rspamd_task *task,
const gchar *name, gint lua_sym_cbref)
{
struct rspamd_scan_result *metric_res;
guint i;
metric_res = rspamd_mempool_alloc0 (task->task_pool,
sizeof (struct rspamd_scan_result));
metric_res->symbols = kh_init (rspamd_symbols_hash);
metric_res->sym_groups = kh_init (rspamd_symbols_group_hash);
if (name) {
metric_res->name = rspamd_mempool_strdup (task->task_pool, name);
}
else {
metric_res->name = NULL;
}
metric_res->symbol_cbref = lua_sym_cbref;
metric_res->task = task;
/* Optimize allocation */
kh_resize (rspamd_symbols_group_hash, metric_res->sym_groups, 4);
if (symbols_count.mean > 4) {
kh_resize (rspamd_symbols_hash, metric_res->symbols, symbols_count.mean);
}
else {
kh_resize (rspamd_symbols_hash, metric_res->symbols, 4);
}
if (task->cfg) {
struct rspamd_action *act, *tmp;
metric_res->actions_limits = rspamd_mempool_alloc0 (task->task_pool,
sizeof (struct rspamd_action_result) * HASH_COUNT (task->cfg->actions));
i = 0;
HASH_ITER (hh, task->cfg->actions, act, tmp) {
if (!(act->flags & RSPAMD_ACTION_NO_THRESHOLD)) {
metric_res->actions_limits[i].cur_limit = act->threshold;
}
metric_res->actions_limits[i].action = act;
i ++;
}
metric_res->nactions = i;
}
rspamd_mempool_add_destructor (task->task_pool,
rspamd_scan_result_dtor,
metric_res);
DL_APPEND (task->result, metric_res);
return metric_res;
}
static inline int
rspamd_pr_sort (const struct rspamd_passthrough_result *pra,
const struct rspamd_passthrough_result *prb)
{
return prb->priority - pra->priority;
}
void
rspamd_add_passthrough_result (struct rspamd_task *task, struct rspamd_action *action, guint priority,
double target_score, const gchar *message, const gchar *module, guint flags,
struct rspamd_scan_result *scan_result)
{
struct rspamd_passthrough_result *pr;
if (scan_result == NULL) {
scan_result = task->result;
}
pr = rspamd_mempool_alloc (task->task_pool, sizeof (*pr));
pr->action = action;
pr->priority = priority;
pr->message = message;
pr->module = module;
pr->target_score = target_score;
pr->flags = flags;
DL_APPEND (scan_result->passthrough_result, pr);
DL_SORT (scan_result->passthrough_result, rspamd_pr_sort);
if (!isnan (target_score)) {
msg_info_task ("<%s>: set pre-result to '%s' %s(%.2f): '%s' from %s(%d)",
MESSAGE_FIELD_CHECK (task, message_id), action->name,
flags & RSPAMD_PASSTHROUGH_LEAST ? "*least " : "",
target_score,
message, module, priority);
}
else {
msg_info_task ("<%s>: set pre-result to '%s' %s(no score): '%s' from %s(%d)",
MESSAGE_FIELD_CHECK (task, message_id), action->name,
flags & RSPAMD_PASSTHROUGH_LEAST ? "*least " : "",
message, module, priority);
}
scan_result->nresults ++;
}
static inline gdouble
rspamd_check_group_score (struct rspamd_task *task,
const gchar *symbol,
struct rspamd_symbols_group *gr,
gdouble *group_score,
gdouble w)
{
if (gr != NULL && group_score && gr->max_score > 0.0 && w > 0.0) {
if (*group_score >= gr->max_score && w > 0) {
msg_info_task ("maximum group score %.2f for group %s has been reached,"
" ignoring symbol %s with weight %.2f", gr->max_score,
gr->name, symbol, w);
return NAN;
}
else if (*group_score + w > gr->max_score) {
w = gr->max_score - *group_score;
}
}
return w;
}
#ifndef DBL_EPSILON
#define DBL_EPSILON 2.2204460492503131e-16
#endif
static struct rspamd_symbol_result *
insert_metric_result (struct rspamd_task *task,
const gchar *symbol,
double weight,
const gchar *opt,
struct rspamd_scan_result *metric_res,
enum rspamd_symbol_insert_flags flags,
bool *new_sym)
{
struct rspamd_symbol_result *s = NULL;
gdouble final_score, *gr_score = NULL, next_gf = 1.0, diff;
struct rspamd_symbol *sdef;
struct rspamd_symbols_group *gr = NULL;
const ucl_object_t *mobj, *sobj;
gint max_shots, ret;
guint i;
khiter_t k;
gboolean single = !!(flags & RSPAMD_SYMBOL_INSERT_SINGLE);
gchar *sym_cpy;
if (!isfinite (weight)) {
msg_warn_task ("detected %s score for symbol %s, replace it with zero",
isnan (weight) ? "NaN" : "infinity", symbol);
weight = 0.0;
}
msg_debug_metric ("want to insert symbol %s, initial weight %.2f",
symbol, weight);
sdef = g_hash_table_lookup (task->cfg->symbols, symbol);
if (sdef == NULL) {
if (flags & RSPAMD_SYMBOL_INSERT_ENFORCE) {
final_score = 1.0 * weight; /* Enforce static weight to 1.0 */
}
else {
final_score = 0.0;
}
msg_debug_metric ("no symbol definition for %s; final multiplier %.2f",
symbol, final_score);
}
else {
if (sdef->cache_item) {
/* Check if we can insert this symbol at all */
if (!rspamd_symcache_is_item_allowed (task, sdef->cache_item, FALSE)) {
msg_debug_metric ("symbol %s is not allowed to be inserted due to settings",
symbol);
return NULL;
}
}
final_score = (*sdef->weight_ptr) * weight;
PTR_ARRAY_FOREACH (sdef->groups, i, gr) {
k = kh_get (rspamd_symbols_group_hash, metric_res->sym_groups, gr);
if (k == kh_end (metric_res->sym_groups)) {
k = kh_put (rspamd_symbols_group_hash, metric_res->sym_groups,
gr, &ret);
kh_value (metric_res->sym_groups, k) = 0;
}
}
msg_debug_metric ("metric multiplier for %s is %.2f",
symbol, *sdef->weight_ptr);
}
if (task->settings) {
gdouble corr;
mobj = ucl_object_lookup (task->settings, "scores");
if (!mobj) {
/* Legacy */
mobj = task->settings;
}
else {
msg_debug_metric ("found scores in the settings");
}
sobj = ucl_object_lookup (mobj, symbol);
if (sobj != NULL && ucl_object_todouble_safe (sobj, &corr)) {
msg_debug_metric ("settings: changed weight of symbol %s from %.2f "
"to %.2f * %.2f",
symbol, final_score, corr, weight);
final_score = corr * weight;
}
}
k = kh_get (rspamd_symbols_hash, metric_res->symbols, symbol);
if (k != kh_end (metric_res->symbols)) {
/* Existing metric score */
s = kh_value (metric_res->symbols, k);
if (single) {
max_shots = 1;
}
else {
if (sdef) {
max_shots = sdef->nshots;
}
else {
max_shots = task->cfg->default_max_shots;
}
}
msg_debug_metric ("nshots: %d for symbol %s", max_shots, symbol);
if (!single && (max_shots > 0 && (s->nshots >= max_shots))) {
single = TRUE;
}
s->nshots ++;
if (opt) {
rspamd_task_add_result_option (task, s, opt, strlen (opt));
}
/* Adjust diff */
if (!single) {
diff = final_score;
msg_debug_metric ("symbol %s can be inserted multiple times: %.2f weight",
symbol, diff);
}
else {
if (fabs (s->score) < fabs (final_score) &&
signbit (s->score) == signbit (final_score)) {
/* Replace less significant weight with a more significant one */
diff = final_score - s->score;
msg_debug_metric ("symbol %s can be inserted single time;"
" weight adjusted %.2f + %.2f",
symbol, s->score, diff);
}
else {
diff = 0;
}
}
if (diff) {
/* Handle grow factor */
if (metric_res->grow_factor && diff > 0) {
diff *= metric_res->grow_factor;
next_gf *= task->cfg->grow_factor;
}
else if (diff > 0) {
next_gf = task->cfg->grow_factor;
}
msg_debug_metric ("adjust grow factor to %.2f for symbol %s (%.2f final)",
next_gf, symbol, diff);
if (sdef) {
PTR_ARRAY_FOREACH (sdef->groups, i, gr) {
gdouble cur_diff;
k = kh_get (rspamd_symbols_group_hash,
metric_res->sym_groups, gr);
g_assert (k != kh_end (metric_res->sym_groups));
gr_score = &kh_value (metric_res->sym_groups, k);
cur_diff = rspamd_check_group_score (task, symbol, gr,
gr_score, diff);
if (isnan (cur_diff)) {
/* Limit reached, do not add result */
msg_debug_metric (
"group limit %.2f is reached for %s when inserting symbol %s;"
" drop score %.2f",
*gr_score, gr->name, symbol, diff);
diff = NAN;
break;
}
else if (gr_score) {
*gr_score += cur_diff;
if (cur_diff < diff) {
/* Reduce */
msg_debug_metric (
"group limit %.2f is reached for %s when inserting symbol %s;"
" reduce score %.2f - %.2f",
*gr_score, gr->name, symbol, diff, cur_diff);
diff = cur_diff;
}
}
}
}
if (!isnan (diff)) {
metric_res->score += diff;
metric_res->grow_factor = next_gf;
if (single) {
msg_debug_metric ("final score for single symbol %s = %.2f; %.2f diff",
symbol, final_score, diff);
s->score = final_score;
} else {
msg_debug_metric ("increase final score for multiple symbol %s += %.2f = %.2f",
symbol, s->score, diff);
s->score += diff;
}
}
}
}
else {
/* New result */
if (new_sym) {
*new_sym = true;
}
sym_cpy = rspamd_mempool_strdup (task->task_pool, symbol);
k = kh_put (rspamd_symbols_hash, metric_res->symbols,
sym_cpy, &ret);
g_assert (ret > 0);
s = rspamd_mempool_alloc0 (task->task_pool, sizeof (*s));
kh_value (metric_res->symbols, k) = s;
/* Handle grow factor */
if (metric_res->grow_factor && final_score > 0) {
final_score *= metric_res->grow_factor;
next_gf *= task->cfg->grow_factor;
}
else if (final_score > 0) {
next_gf = task->cfg->grow_factor;
}
msg_debug_metric ("adjust grow factor to %.2f for symbol %s (%.2f final)",
next_gf, symbol, final_score);
s->name = sym_cpy;
s->sym = sdef;
s->nshots = 1;
if (sdef) {
/* Check group limits */
PTR_ARRAY_FOREACH (sdef->groups, i, gr) {
gdouble cur_score;
k = kh_get (rspamd_symbols_group_hash, metric_res->sym_groups, gr);
g_assert (k != kh_end (metric_res->sym_groups));
gr_score = &kh_value (metric_res->sym_groups, k);
cur_score = rspamd_check_group_score (task, symbol, gr,
gr_score, final_score);
if (isnan (cur_score)) {
/* Limit reached, do not add result */
msg_debug_metric (
"group limit %.2f is reached for %s when inserting symbol %s;"
" drop score %.2f",
*gr_score, gr->name, symbol, final_score);
final_score = NAN;
break;
} else if (gr_score) {
*gr_score += cur_score;
if (cur_score < final_score) {
/* Reduce */
msg_debug_metric (
"group limit %.2f is reached for %s when inserting symbol %s;"
" reduce score %.2f - %.2f",
*gr_score, gr->name, symbol, final_score, cur_score);
final_score = cur_score;
}
}
}
}
if (!isnan (final_score)) {
const double epsilon = DBL_EPSILON;
metric_res->score += final_score;
metric_res->grow_factor = next_gf;
s->score = final_score;
if (final_score > epsilon) {
metric_res->npositive ++;
metric_res->positive_score += final_score;
}
else if (final_score < -epsilon) {
metric_res->nnegative ++;
metric_res->negative_score += fabs (final_score);
}
}
else {
s->score = 0;
}
if (opt) {
rspamd_task_add_result_option (task, s, opt, strlen (opt));
}
}
msg_debug_metric ("final insertion for symbol %s, score %.2f, factor: %f",
symbol,
s->score,
final_score);
metric_res->nresults ++;
return s;
}
struct rspamd_symbol_result *
rspamd_task_insert_result_full (struct rspamd_task *task,
const gchar *symbol,
double weight,
const gchar *opt,
enum rspamd_symbol_insert_flags flags,
struct rspamd_scan_result *result)
{
struct rspamd_symbol_result *s = NULL, *ret = NULL;
struct rspamd_scan_result *mres;
if (task->processed_stages & (RSPAMD_TASK_STAGE_IDEMPOTENT >> 1)) {
msg_err_task ("cannot insert symbol %s on idempotent phase",
symbol);
return NULL;
}
if (result == NULL) {
/* Insert everywhere */
DL_FOREACH (task->result, mres) {
if (mres->symbol_cbref != -1) {
/* Check if we can insert this symbol to this symbol result */
GError *err = NULL;
lua_State *L = (lua_State *) task->cfg->lua_state;
if (!rspamd_lua_universal_pcall (L, mres->symbol_cbref,
G_STRLOC, 1, "uss", &err,
"rspamd{task}", task, symbol, mres->name ? mres->name : "default")) {
msg_warn_task ("cannot call for symbol_cbref for result %s: %e",
mres->name ? mres->name : "default", err);
g_error_free (err);
continue;
}
else {
if (!lua_toboolean (L, -1)) {
/* Skip symbol */
msg_debug_metric ("skip symbol %s for result %s due to Lua return value",
symbol, mres->name);
lua_pop (L, 1); /* Remove result */
continue;
}
lua_pop (L, 1); /* Remove result */
}
}
bool new_symbol = false;
s = insert_metric_result (task,
symbol,
weight,
opt,
mres,
flags,
&new_symbol);
if (mres->name == NULL) {
/* Default result */
ret = s;
/* Process cache item */
if (s && task->cfg->cache && s->sym) {
rspamd_symcache_inc_frequency (task->cfg->cache,
s->sym->cache_item);
}
}
else if (new_symbol) {
/* O(N) but we normally don't have any shadow results */
LL_APPEND (ret, s);
}
}
}
else {
/* Specific insertion */
s = insert_metric_result (task,
symbol,
weight,
opt,
result,
flags,
NULL);
ret = s;
if (result->name == NULL) {
/* Process cache item */
if (s && task->cfg->cache && s->sym) {
rspamd_symcache_inc_frequency (task->cfg->cache,
s->sym->cache_item);
}
}
}
return ret;
}
static gchar *
rspamd_task_option_safe_copy (struct rspamd_task *task,
const gchar *val,
gsize vlen,
gsize *outlen)
{
const gchar *p, *end;
p = val;
end = val + vlen;
vlen = 0; /* Reuse */
while (p < end) {
if (*p & 0x80) {
UChar32 uc;
gint off = 0;
U8_NEXT (p, off, end - p, uc);
if (uc > 0) {
if (u_isprint (uc)) {
vlen += off;
}
else {
/* We will replace it with 0xFFFD */
vlen += MAX (off, 3);
}
}
else {
vlen += MAX (off, 3);
}
p += off;
}
else if (!g_ascii_isprint (*p)) {
/* Another 0xFFFD */
vlen += 3;
p ++;
}
else {
p ++;
vlen ++;
}
}
gchar *dest, *d;
dest = rspamd_mempool_alloc (task->task_pool, vlen + 1);
d = dest;
p = val;
while (p < end) {
if (*p & 0x80) {
UChar32 uc;
gint off = 0;
U8_NEXT (p, off, end - p, uc);
if (uc > 0) {
if (u_isprint (uc)) {
memcpy (d, p, off);
d += off;
}
else {
/* We will replace it with 0xFFFD */
*d++ = '\357';
*d++ = '\277';
*d++ = '\275';
}
}
else {
*d++ = '\357';
*d++ = '\277';
*d++ = '\275';
}
p += off;
}
else if (!g_ascii_isprint (*p)) {
/* Another 0xFFFD */
*d++ = '\357';
*d++ = '\277';
*d++ = '\275';
p ++;
}
else {
*d++ = *p++;
}
}
*d = '\0';
*(outlen) = d - dest;
return dest;
}
gboolean
rspamd_task_add_result_option (struct rspamd_task *task,
struct rspamd_symbol_result *s,
const gchar *val,
gsize vlen)
{
struct rspamd_symbol_option *opt, srch;
gboolean ret = FALSE;
gchar *opt_cpy = NULL;
gsize cpy_len;
khiter_t k;
gint r;
struct rspamd_symbol_result *cur;
if (s && val) {
/*
* Here we assume that this function is all the time called with the
* symbol from the default result, not some shadow result, or
* the option insertion will be wrong
*/
LL_FOREACH (s, cur) {
if (cur->opts_len < 0) {
/* Cannot add more options, give up */
msg_debug_task ("cannot add more options to symbol %s when adding option %s",
cur->name, val);
ret = FALSE;
continue;
}
if (!cur->options) {
cur->options = kh_init (rspamd_options_hash);
}
if (vlen + cur->opts_len > task->cfg->max_opts_len) {
/* Add truncated option */
msg_info_task ("cannot add more options to symbol %s when adding option %s",
cur->name, val);
val = "...";
vlen = 3;
cur->opts_len = -1;
}
if (!(cur->sym && (cur->sym->flags & RSPAMD_SYMBOL_FLAG_ONEPARAM)) &&
kh_size (cur->options) < task->cfg->default_max_shots) {
opt_cpy = rspamd_task_option_safe_copy (task, val, vlen, &cpy_len);
/* Append new options */
srch.option = (gchar *) opt_cpy;
srch.optlen = cpy_len;
k = kh_get (rspamd_options_hash, cur->options, &srch);
if (k == kh_end (cur->options)) {
opt = rspamd_mempool_alloc0 (task->task_pool, sizeof (*opt));
opt->optlen = cpy_len;
opt->option = opt_cpy;
kh_put (rspamd_options_hash, cur->options, opt, &r);
DL_APPEND (cur->opts_head, opt);
if (s == cur) {
ret = TRUE;
}
}
}
else {
/* Skip addition */
if (s == cur) {
ret = FALSE;
}
}
if (ret && cur->opts_len >= 0) {
cur->opts_len += vlen;
}
}
}
else if (!val) {
ret = TRUE;
}
task->result->nresults ++;
return ret;
}
struct rspamd_action *
rspamd_check_action_metric (struct rspamd_task *task,
struct rspamd_passthrough_result **ppr,
struct rspamd_scan_result *scan_result)
{
struct rspamd_action_result *action_lim,
*noaction = NULL;
struct rspamd_action *selected_action = NULL, *least_action = NULL;
struct rspamd_passthrough_result *pr, *sel_pr = NULL;
double max_score = -(G_MAXDOUBLE), sc;
int i;
gboolean seen_least = FALSE;
if (scan_result == NULL) {
scan_result = task->result;
}
if (scan_result->passthrough_result != NULL) {
DL_FOREACH (scan_result->passthrough_result, pr) {
if (!seen_least || !(pr->flags & RSPAMD_PASSTHROUGH_LEAST)) {
sc = pr->target_score;
selected_action = pr->action;
if (!(pr->flags & RSPAMD_PASSTHROUGH_LEAST)) {
if (!isnan (sc)) {
if (pr->action->action_type == METRIC_ACTION_NOACTION) {
scan_result->score = MIN (sc, scan_result->score);
}
else {
scan_result->score = sc;
}
}
if (ppr) {
*ppr = pr;
}
return selected_action;
}
else {
seen_least = true;
least_action = selected_action;
if (isnan (sc)) {
if (selected_action->flags & RSPAMD_ACTION_NO_THRESHOLD) {
/*
* In this case, we have a passthrough action that
* is `least` action, however, there is no threshold
* on it.
*
* Hence, we imply the following logic:
*
* - we leave score unchanged
* - we apply passthrough no threshold action unless
* score based action *is not* reject, otherwise
* we apply reject action
*/
}
else {
sc = selected_action->threshold;
max_score = sc;
sel_pr = pr;
}
}
else {
max_score = sc;
sel_pr = pr;
}
}
}
}
}
/*
* Select result by score
*/
for (i = scan_result->nactions - 1; i >= 0; i--) {
action_lim = &scan_result->actions_limits[i];
sc = action_lim->cur_limit;
if (action_lim->action->action_type == METRIC_ACTION_NOACTION) {
noaction = action_lim;
}
if (isnan (sc) ||
(action_lim->action->flags & (RSPAMD_ACTION_NO_THRESHOLD|RSPAMD_ACTION_HAM))) {
continue;
}
if (scan_result->score >= sc && sc > max_score) {
selected_action = action_lim->action;
max_score = sc;
}
}
if (selected_action == NULL) {
selected_action = noaction->action;
}
if (selected_action) {
if (seen_least) {
/* Adjust least action */
if (least_action->flags & RSPAMD_ACTION_NO_THRESHOLD) {
if (selected_action->action_type != METRIC_ACTION_REJECT &&
selected_action->action_type != METRIC_ACTION_DISCARD) {
/* Override score based action with least action */
selected_action = least_action;
if (ppr) {
*ppr = sel_pr;
}
}
}
else {
/* Adjust score if needed */
if (max_score > scan_result->score) {
if (ppr) {
*ppr = sel_pr;
}
scan_result->score = max_score;
}
}
}
return selected_action;
}
if (ppr) {
*ppr = sel_pr;
}
return noaction->action;
}
struct rspamd_symbol_result *
rspamd_task_find_symbol_result (struct rspamd_task *task, const char *sym,
struct rspamd_scan_result *result)
{
struct rspamd_symbol_result *res = NULL;
khiter_t k;
if (result == NULL) {
/* Use default result */
result = task->result;
}
k = kh_get (rspamd_symbols_hash, result->symbols, sym);
if (k != kh_end (result->symbols)) {
res = kh_value (result->symbols, k);
}
return res;
}
struct rspamd_symbol_result* rspamd_task_remove_symbol_result (
struct rspamd_task *task,
const gchar *symbol,
struct rspamd_scan_result *result)
{
struct rspamd_symbol_result *res = NULL;
khiter_t k;
if (result == NULL) {
/* Use default result */
result = task->result;
}
k = kh_get (rspamd_symbols_hash, result->symbols, symbol);
if (k != kh_end (result->symbols)) {
res = kh_value (result->symbols, k);
if (!isnan (res->score)) {
/* Remove score from the result */
result->score -= res->score;
/* Also check the group limit */
if (result->sym_groups && res->sym) {
struct rspamd_symbol_group *gr;
gint i;
PTR_ARRAY_FOREACH (res->sym->groups, i, gr) {
gdouble *gr_score;
k = kh_get (rspamd_symbols_group_hash,
result->sym_groups, gr);
if (k != kh_end (result->sym_groups)) {
gr_score = &kh_value (result->sym_groups, k);
if (gr_score) {
*gr_score -= res->score;
}
}
}
}
}
kh_del (rspamd_symbols_hash, result->symbols, k);
}
else {
return NULL;
}
return res;
}
void
rspamd_task_symbol_result_foreach (struct rspamd_task *task,
struct rspamd_scan_result *result, GHFunc func,
gpointer ud)
{
const gchar *kk;
struct rspamd_symbol_result *res;
if (result == NULL) {
/* Use default result */
result = task->result;
}
if (func) {
kh_foreach (result->symbols, kk, res, {
func ((gpointer)kk, (gpointer)res, ud);
});
}
}
struct rspamd_scan_result *
rspamd_find_metric_result (struct rspamd_task *task,
const gchar *name)
{
struct rspamd_scan_result *res;
if (name == NULL) {
return task->result;
}
else if (strcmp (name, "default") == 0) {
return task->result;
}
DL_FOREACH (task->result, res) {
if (res->name && strcmp (res->name, name) == 0) {
return res;
}
}
return NULL;
}
|