-
-
Notifications
You must be signed in to change notification settings - Fork 378
/
rspamd_symcache.c
3249 lines (2683 loc) · 78.4 KB
/
rspamd_symcache.c
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
/*-
* 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 "util.h"
#include "rspamd.h"
#include "message.h"
#include "rspamd_symcache.h"
#include "cfg_file.h"
#include "lua/lua_common.h"
#include "unix-std.h"
#include "contrib/t1ha/t1ha.h"
#include "libserver/worker_util.h"
#include "khash.h"
#include <math.h>
#if defined(__STDC_VERSION__) && __STDC_VERSION__ >= 201112L
# include <stdalign.h>
#endif
#define msg_err_cache(...) rspamd_default_log_function (G_LOG_LEVEL_CRITICAL, \
cache->static_pool->tag.tagname, cache->cfg->checksum, \
G_STRFUNC, \
__VA_ARGS__)
#define msg_warn_cache(...) rspamd_default_log_function (G_LOG_LEVEL_WARNING, \
cache->static_pool->tag.tagname, cache->cfg->checksum, \
G_STRFUNC, \
__VA_ARGS__)
#define msg_info_cache(...) rspamd_default_log_function (G_LOG_LEVEL_INFO, \
cache->static_pool->tag.tagname, cache->cfg->checksum, \
G_STRFUNC, \
__VA_ARGS__)
#define msg_debug_cache(...) rspamd_conditional_debug_fast (NULL, NULL, \
rspamd_symcache_log_id, "symcache", cache->cfg->checksum, \
G_STRFUNC, \
__VA_ARGS__)
#define msg_debug_cache_task(...) rspamd_conditional_debug_fast (NULL, NULL, \
rspamd_symcache_log_id, "symcache", task->task_pool->tag.uid, \
G_STRFUNC, \
__VA_ARGS__)
INIT_LOG_MODULE(symcache)
#define CHECK_START_BIT(checkpoint, dyn_item) \
((dyn_item)->started)
#define SET_START_BIT(checkpoint, dyn_item) \
(dyn_item)->started = 1
#define CLR_START_BIT(checkpoint, dyn_item) \
(dyn_item)->started = 0
#define CHECK_FINISH_BIT(checkpoint, dyn_item) \
((dyn_item)->finished)
#define SET_FINISH_BIT(checkpoint, dyn_item) \
(dyn_item)->finished = 1
#define CLR_FINISH_BIT(checkpoint, dyn_item) \
(dyn_item)->finished = 0
static const guchar rspamd_symcache_magic[8] = {'r', 's', 'c', 2, 0, 0, 0, 0 };
struct rspamd_symcache_header {
guchar magic[8];
guint nitems;
guchar checksum[64];
guchar unused[128];
};
struct symcache_order {
GPtrArray *d;
guint id;
ref_entry_t ref;
};
/*
* This structure is optimised to store ids list:
* - If the first element is -1 then use dynamic part, else use static part
*/
struct rspamd_symcache_id_list {
union {
guint32 st[4];
struct {
guint32 e; /* First element */
guint16 len;
guint16 allocated;
guint *n;
} dyn;
};
};
struct rspamd_symcache_item {
/* This block is likely shared */
struct item_stat *st;
guint64 last_count;
struct rspamd_counter_data *cd;
gchar *symbol;
enum rspamd_symbol_type type;
/* Callback data */
union {
struct {
symbol_func_t func;
gpointer user_data;
gint condition_cb;
} normal;
struct {
gint parent;
} virtual;
} specific;
/* Condition of execution */
gboolean enabled;
/* Used for async stuff checks */
gboolean is_filter;
gboolean is_virtual;
/* Priority */
gint priority;
/* Topological order */
guint order;
gint id;
gint frequency_peaks;
/* Settings ids */
struct rspamd_symcache_id_list allowed_ids;
struct rspamd_symcache_id_list forbidden_ids;
/* Dependencies */
GPtrArray *deps;
GPtrArray *rdeps;
};
struct item_stat {
struct rspamd_counter_data time_counter;
gdouble avg_time;
gdouble weight;
guint hits;
guint64 total_hits;
struct rspamd_counter_data frequency_counter;
gdouble avg_frequency;
gdouble stddev_frequency;
};
struct rspamd_symcache {
/* Hash table for fast access */
GHashTable *items_by_symbol;
GPtrArray *items_by_id;
struct symcache_order *items_by_order;
GPtrArray *filters;
GPtrArray *prefilters;
GPtrArray *postfilters;
GPtrArray *composites;
GPtrArray *idempotent;
GPtrArray *virtual;
GList *delayed_deps;
GList *delayed_conditions;
rspamd_mempool_t *static_pool;
guint64 cksum;
gdouble total_weight;
guint used_items;
guint stats_symbols_count;
guint64 total_hits;
guint id;
struct rspamd_config *cfg;
gdouble reload_time;
gint peak_cb;
};
struct rspamd_symcache_dynamic_item {
guint16 start_msec; /* Relative to task time */
unsigned started:1;
unsigned finished:1;
/* unsigned pad:14; */
guint32 async_events;
};
struct cache_dependency {
struct rspamd_symcache_item *item;
gchar *sym;
gint id;
};
struct delayed_cache_dependency {
gchar *from;
gchar *to;
};
struct delayed_cache_condition {
gchar *sym;
gint cbref;
lua_State *L;
};
enum rspamd_cache_savepoint_stage {
RSPAMD_CACHE_PASS_INIT = 0,
RSPAMD_CACHE_PASS_PREFILTERS,
RSPAMD_CACHE_PASS_FILTERS,
RSPAMD_CACHE_PASS_POSTFILTERS,
RSPAMD_CACHE_PASS_IDEMPOTENT,
RSPAMD_CACHE_PASS_WAIT_IDEMPOTENT,
RSPAMD_CACHE_PASS_DONE,
};
struct cache_savepoint {
enum rspamd_cache_savepoint_stage pass;
guint version;
guint items_inflight;
struct rspamd_metric_result *rs;
gdouble lim;
struct rspamd_symcache_item *cur_item;
struct symcache_order *order;
struct rspamd_symcache_dynamic_item dynamic_items[];
};
struct rspamd_cache_refresh_cbdata {
gdouble last_resort;
struct event resort_ev;
struct rspamd_symcache *cache;
struct rspamd_worker *w;
struct event_base *ev_base;
};
/* weight, frequency, time */
#define TIME_ALPHA (1.0)
#define WEIGHT_ALPHA (0.1)
#define FREQ_ALPHA (0.01)
#define SCORE_FUN(w, f, t) (((w) > 0 ? (w) : WEIGHT_ALPHA) \
* ((f) > 0 ? (f) : FREQ_ALPHA) \
/ (t > TIME_ALPHA ? t : TIME_ALPHA))
static gboolean rspamd_symcache_check_symbol (struct rspamd_task *task,
struct rspamd_symcache *cache,
struct rspamd_symcache_item *item,
struct cache_savepoint *checkpoint);
static gboolean rspamd_symcache_check_deps (struct rspamd_task *task,
struct rspamd_symcache *cache,
struct rspamd_symcache_item *item,
struct cache_savepoint *checkpoint,
guint recursion,
gboolean check_only);
static void rspamd_symcache_disable_symbol_checkpoint (struct rspamd_task *task,
struct rspamd_symcache *cache, const gchar *symbol);
static void rspamd_symcache_enable_symbol_checkpoint (struct rspamd_task *task,
struct rspamd_symcache *cache, const gchar *symbol);
static void
rspamd_symcache_order_dtor (gpointer p)
{
struct symcache_order *ord = p;
g_ptr_array_free (ord->d, TRUE);
g_free (ord);
}
static void
rspamd_symcache_order_unref (gpointer p)
{
struct symcache_order *ord = p;
REF_RELEASE (ord);
}
static gint
rspamd_id_cmp (const void * a, const void * b)
{
return (*(guint32*)a - *(guint32*)b);
}
static struct symcache_order *
rspamd_symcache_order_new (struct rspamd_symcache *cache,
gsize nelts)
{
struct symcache_order *ord;
ord = g_malloc0 (sizeof (*ord));
ord->d = g_ptr_array_sized_new (nelts);
ord->id = cache->id;
REF_INIT_RETAIN (ord, rspamd_symcache_order_dtor);
return ord;
}
static inline struct rspamd_symcache_dynamic_item*
rspamd_symcache_get_dynamic (struct cache_savepoint *checkpoint,
struct rspamd_symcache_item *item)
{
return &checkpoint->dynamic_items[item->id];
}
static inline struct rspamd_symcache_item *
rspamd_symcache_find_filter (struct rspamd_symcache *cache,
const gchar *name,
bool resolve_parent)
{
struct rspamd_symcache_item *item;
g_assert (cache != NULL);
if (name == NULL) {
return NULL;
}
item = g_hash_table_lookup (cache->items_by_symbol, name);
if (item != NULL) {
if (resolve_parent && item->is_virtual) {
item = g_ptr_array_index (cache->items_by_id,
item->specific.virtual.parent);
}
return item;
}
return NULL;
}
const gchar *
rspamd_symcache_get_parent (struct rspamd_symcache *cache,
const gchar *symbol)
{
struct rspamd_symcache_item *item;
g_assert (cache != NULL);
if (symbol == NULL) {
return NULL;
}
item = g_hash_table_lookup (cache->items_by_symbol, symbol);
if (item != NULL) {
if (item->is_virtual) {
item = g_ptr_array_index (cache->items_by_id,
item->specific.virtual.parent);
}
return item->symbol;
}
return NULL;
}
static gint
postfilters_cmp (const void *p1, const void *p2, gpointer ud)
{
const struct rspamd_symcache_item *i1 = *(struct rspamd_symcache_item **)p1,
*i2 = *(struct rspamd_symcache_item **)p2;
double w1, w2;
w1 = i1->priority;
w2 = i2->priority;
if (w1 > w2) {
return 1;
}
else if (w1 < w2) {
return -1;
}
return 0;
}
static gint
prefilters_cmp (const void *p1, const void *p2, gpointer ud)
{
const struct rspamd_symcache_item *i1 = *(struct rspamd_symcache_item **)p1,
*i2 = *(struct rspamd_symcache_item **)p2;
double w1, w2;
w1 = i1->priority;
w2 = i2->priority;
if (w1 < w2) {
return 1;
}
else if (w1 > w2) {
return -1;
}
return 0;
}
#define TSORT_MARK_PERM(it) (it)->order |= (1u << 31)
#define TSORT_MARK_TEMP(it) (it)->order |= (1u << 30)
#define TSORT_IS_MARKED_PERM(it) ((it)->order & (1u << 31))
#define TSORT_IS_MARKED_TEMP(it) ((it)->order & (1u << 30))
#define TSORT_UNMASK(it) ((it)->order & ~((1u << 31) | (1u << 30)))
static gint
cache_logic_cmp (const void *p1, const void *p2, gpointer ud)
{
const struct rspamd_symcache_item *i1 = *(struct rspamd_symcache_item **)p1,
*i2 = *(struct rspamd_symcache_item **)p2;
struct rspamd_symcache *cache = ud;
double w1, w2;
double weight1, weight2;
double f1 = 0, f2 = 0, t1, t2, avg_freq, avg_weight;
guint o1 = TSORT_UNMASK (i1), o2 = TSORT_UNMASK (i2);
if (o1 == o2) {
/* Heurstic */
if (i1->priority == i2->priority) {
avg_freq = ((gdouble) cache->total_hits / cache->used_items);
avg_weight = (cache->total_weight / cache->used_items);
f1 = (double) i1->st->total_hits / avg_freq;
f2 = (double) i2->st->total_hits / avg_freq;
weight1 = fabs (i1->st->weight) / avg_weight;
weight2 = fabs (i2->st->weight) / avg_weight;
t1 = i1->st->avg_time;
t2 = i2->st->avg_time;
w1 = SCORE_FUN (weight1, f1, t1);
w2 = SCORE_FUN (weight2, f2, t2);
} else {
/* Strict sorting */
w1 = abs (i1->priority);
w2 = abs (i2->priority);
}
}
else {
w1 = o1;
w2 = o2;
}
if (w2 > w1) {
return 1;
}
else if (w2 < w1) {
return -1;
}
return 0;
}
static void
rspamd_symcache_tsort_visit (struct rspamd_symcache *cache,
struct rspamd_symcache_item *it,
guint cur_order)
{
struct cache_dependency *dep;
guint i;
if (TSORT_IS_MARKED_PERM (it)) {
if (cur_order > TSORT_UNMASK (it)) {
/* Need to recalculate the whole chain */
it->order = cur_order; /* That also removes all masking */
}
else {
/* We are fine, stop DFS */
return;
}
}
else if (TSORT_IS_MARKED_TEMP (it)) {
msg_err_cache ("cyclic dependencies found when checking '%s'!",
it->symbol);
return;
}
TSORT_MARK_TEMP (it);
msg_debug_cache ("visiting node: %s (%d)", it->symbol, cur_order);
PTR_ARRAY_FOREACH (it->deps, i, dep) {
msg_debug_cache ("visiting dep: %s (%d)", dep->item->symbol, cur_order + 1);
rspamd_symcache_tsort_visit (cache, dep->item, cur_order + 1);
}
it->order = cur_order;
TSORT_MARK_PERM (it);
}
static void
rspamd_symcache_resort (struct rspamd_symcache *cache)
{
struct symcache_order *ord;
guint i;
guint64 total_hits = 0;
struct rspamd_symcache_item *it;
ord = rspamd_symcache_order_new (cache, cache->filters->len);
for (i = 0; i < cache->filters->len; i ++) {
it = g_ptr_array_index (cache->filters, i);
total_hits += it->st->total_hits;
it->order = 0;
g_ptr_array_add (ord->d, it);
}
/* Topological sort, intended to be O(N) but my implementation
* is not linear (semi-linear usually) as I want to make it as
* simple as possible.
* On each stage it does DFS for unseen nodes. In theory, that
* can be more complicated than linear - O(N^2) for specially
* crafted data. But I don't care.
*/
PTR_ARRAY_FOREACH (ord->d, i, it) {
if (it->order == 0) {
rspamd_symcache_tsort_visit (cache, it, 1);
}
}
/*
* Now we have all sorted and can do some heuristical sort, keeping
* topological order invariant
*/
g_ptr_array_sort_with_data (ord->d, cache_logic_cmp, cache);
cache->total_hits = total_hits;
if (cache->items_by_order) {
REF_RELEASE (cache->items_by_order);
}
cache->items_by_order = ord;
}
/* Sort items in logical order */
static void
rspamd_symcache_post_init (struct rspamd_symcache *cache)
{
struct rspamd_symcache_item *it, *dit;
struct cache_dependency *dep, *rdep;
struct delayed_cache_dependency *ddep;
struct delayed_cache_condition *dcond;
GList *cur;
gint i, j;
cur = cache->delayed_deps;
while (cur) {
ddep = cur->data;
it = rspamd_symcache_find_filter (cache, ddep->from, true);
if (it == NULL) {
msg_err_cache ("cannot register delayed dependency between %s and %s, "
"%s is missing", ddep->from, ddep->to, ddep->from);
}
else {
msg_debug_cache ("delayed between %s(%d) -> %s", ddep->from,
it->id, ddep->to);
rspamd_symcache_add_dependency (cache, it->id, ddep->to);
}
cur = g_list_next (cur);
}
cur = cache->delayed_conditions;
while (cur) {
dcond = cur->data;
it = rspamd_symcache_find_filter (cache, dcond->sym, true);
if (it == NULL) {
msg_err_cache (
"cannot register delayed condition for %s",
dcond->sym);
luaL_unref (dcond->L, LUA_REGISTRYINDEX, dcond->cbref);
}
else {
it->specific.normal.condition_cb = dcond->cbref;
}
cur = g_list_next (cur);
}
PTR_ARRAY_FOREACH (cache->items_by_id, i, it) {
PTR_ARRAY_FOREACH (it->deps, j, dep) {
dit = rspamd_symcache_find_filter (cache, dep->sym, true);
if (dit != NULL) {
if (!dit->is_filter) {
msg_err_cache ("cannot depend on non filter symbol "
"(%s wants to add dependency on %s)",
dep->sym, dit->symbol);
}
else {
if (dit->id == i) {
msg_err_cache ("cannot add dependency on self: %s -> %s "
"(resolved to %s)",
it->symbol, dep->sym, dit->symbol);
} else {
rdep = rspamd_mempool_alloc (cache->static_pool,
sizeof (*rdep));
rdep->sym = dep->sym;
rdep->item = it;
rdep->id = i;
g_assert (dit->rdeps != NULL);
g_ptr_array_add (dit->rdeps, rdep);
dep->item = dit;
dep->id = dit->id;
msg_debug_cache ("add dependency from %d on %d", it->id,
dit->id);
}
}
}
else {
msg_err_cache ("cannot find dependency on symbol %s", dep->sym);
}
}
if (it->deps) {
/* Reversed loop to make removal safe */
for (j = it->deps->len - 1; j >= 0; j--) {
dep = g_ptr_array_index (it->deps, j);
if (dep->item == NULL) {
/* Remove useless dep */
g_ptr_array_remove_index (it->deps, j);
}
}
}
}
g_ptr_array_sort_with_data (cache->prefilters, prefilters_cmp, cache);
g_ptr_array_sort_with_data (cache->postfilters, postfilters_cmp, cache);
g_ptr_array_sort_with_data (cache->idempotent, postfilters_cmp, cache);
rspamd_symcache_resort (cache);
}
static gboolean
rspamd_symcache_load_items (struct rspamd_symcache *cache, const gchar *name)
{
struct rspamd_symcache_header *hdr;
struct stat st;
struct ucl_parser *parser;
ucl_object_t *top;
const ucl_object_t *cur, *elt;
ucl_object_iter_t it;
struct rspamd_symcache_item *item, *parent;
const guchar *p;
gint fd;
gpointer map;
fd = open (name, O_RDONLY);
if (fd == -1) {
msg_info_cache ("cannot open file %s, error %d, %s", name,
errno, strerror (errno));
return FALSE;
}
rspamd_file_lock (fd, FALSE);
if (fstat (fd, &st) == -1) {
rspamd_file_unlock (fd, FALSE);
close (fd);
msg_info_cache ("cannot stat file %s, error %d, %s", name,
errno, strerror (errno));
return FALSE;
}
if (st.st_size < (gint)sizeof (*hdr)) {
rspamd_file_unlock (fd, FALSE);
close (fd);
errno = EINVAL;
msg_info_cache ("cannot use file %s, error %d, %s", name,
errno, strerror (errno));
return FALSE;
}
map = mmap (NULL, st.st_size, PROT_READ, MAP_SHARED, fd, 0);
if (map == MAP_FAILED) {
rspamd_file_unlock (fd, FALSE);
close (fd);
msg_info_cache ("cannot mmap file %s, error %d, %s", name,
errno, strerror (errno));
return FALSE;
}
hdr = map;
if (memcmp (hdr->magic, rspamd_symcache_magic,
sizeof (rspamd_symcache_magic)) != 0) {
msg_info_cache ("cannot use file %s, bad magic", name);
munmap (map, st.st_size);
rspamd_file_unlock (fd, FALSE);
close (fd);
return FALSE;
}
parser = ucl_parser_new (0);
p = (const guchar *)(hdr + 1);
if (!ucl_parser_add_chunk (parser, p, st.st_size - sizeof (*hdr))) {
msg_info_cache ("cannot use file %s, cannot parse: %s", name,
ucl_parser_get_error (parser));
munmap (map, st.st_size);
ucl_parser_free (parser);
rspamd_file_unlock (fd, FALSE);
close (fd);
return FALSE;
}
top = ucl_parser_get_object (parser);
munmap (map, st.st_size);
rspamd_file_unlock (fd, FALSE);
close (fd);
ucl_parser_free (parser);
if (top == NULL || ucl_object_type (top) != UCL_OBJECT) {
msg_info_cache ("cannot use file %s, bad object", name);
ucl_object_unref (top);
return FALSE;
}
it = ucl_object_iterate_new (top);
while ((cur = ucl_object_iterate_safe (it, true))) {
item = g_hash_table_lookup (cache->items_by_symbol, ucl_object_key (cur));
if (item) {
/* Copy saved info */
/*
* XXX: don't save or load weight, it should be obtained from the
* metric
*/
#if 0
elt = ucl_object_lookup (cur, "weight");
if (elt) {
w = ucl_object_todouble (elt);
if (w != 0) {
item->weight = w;
}
}
#endif
elt = ucl_object_lookup (cur, "time");
if (elt) {
item->st->avg_time = ucl_object_todouble (elt);
}
elt = ucl_object_lookup (cur, "count");
if (elt) {
item->st->total_hits = ucl_object_toint (elt);
item->last_count = item->st->total_hits;
}
elt = ucl_object_lookup (cur, "frequency");
if (elt && ucl_object_type (elt) == UCL_OBJECT) {
const ucl_object_t *cur;
cur = ucl_object_lookup (elt, "avg");
if (cur) {
item->st->avg_frequency = ucl_object_todouble (cur);
}
cur = ucl_object_lookup (elt, "stddev");
if (cur) {
item->st->stddev_frequency = ucl_object_todouble (cur);
}
}
if (item->is_virtual) {
g_assert (item->specific.virtual.parent < (gint)cache->items_by_id->len);
parent = g_ptr_array_index (cache->items_by_id,
item->specific.virtual.parent);
if (parent->st->weight < item->st->weight) {
parent->st->weight = item->st->weight;
}
/*
* We maintain avg_time for virtual symbols equal to the
* parent item avg_time
*/
item->st->avg_time = parent->st->avg_time;
}
cache->total_weight += fabs (item->st->weight);
cache->total_hits += item->st->total_hits;
}
}
ucl_object_iterate_free (it);
ucl_object_unref (top);
return TRUE;
}
#define ROUND_DOUBLE(x) (floor((x) * 100.0) / 100.0)
static gboolean
rspamd_symcache_save_items (struct rspamd_symcache *cache, const gchar *name)
{
struct rspamd_symcache_header hdr;
ucl_object_t *top, *elt, *freq;
GHashTableIter it;
struct rspamd_symcache_item *item;
struct ucl_emitter_functions *efunc;
gpointer k, v;
gint fd;
bool ret;
gchar path[PATH_MAX];
rspamd_snprintf (path, sizeof (path), "%s.new", name);
for (;;) {
fd = open (path, O_CREAT | O_WRONLY | O_EXCL, 00644);
if (fd == -1) {
if (errno == EEXIST) {
/* Some other process is already writing data, give up silently */
return TRUE;
}
msg_info_cache ("cannot open file %s, error %d, %s", path,
errno, strerror (errno));
return FALSE;
}
break;
}
rspamd_file_lock (fd, FALSE);
memset (&hdr, 0, sizeof (hdr));
memcpy (hdr.magic, rspamd_symcache_magic,
sizeof (rspamd_symcache_magic));
if (write (fd, &hdr, sizeof (hdr)) == -1) {
msg_info_cache ("cannot write to file %s, error %d, %s", path,
errno, strerror (errno));
rspamd_file_unlock (fd, FALSE);
close (fd);
return FALSE;
}
top = ucl_object_typed_new (UCL_OBJECT);
g_hash_table_iter_init (&it, cache->items_by_symbol);
while (g_hash_table_iter_next (&it, &k, &v)) {
item = v;
elt = ucl_object_typed_new (UCL_OBJECT);
ucl_object_insert_key (elt,
ucl_object_fromdouble (ROUND_DOUBLE (item->st->weight)),
"weight", 0, false);
ucl_object_insert_key (elt,
ucl_object_fromdouble (ROUND_DOUBLE (item->st->time_counter.mean)),
"time", 0, false);
ucl_object_insert_key (elt, ucl_object_fromint (item->st->total_hits),
"count", 0, false);
freq = ucl_object_typed_new (UCL_OBJECT);
ucl_object_insert_key (freq,
ucl_object_fromdouble (ROUND_DOUBLE (item->st->frequency_counter.mean)),
"avg", 0, false);
ucl_object_insert_key (freq,
ucl_object_fromdouble (ROUND_DOUBLE (item->st->frequency_counter.stddev)),
"stddev", 0, false);
ucl_object_insert_key (elt, freq, "frequency", 0, false);
ucl_object_insert_key (top, elt, k, 0, false);
}
efunc = ucl_object_emit_fd_funcs (fd);
ret = ucl_object_emit_full (top, UCL_EMIT_JSON_COMPACT, efunc, NULL);
ucl_object_emit_funcs_free (efunc);
ucl_object_unref (top);
rspamd_file_unlock (fd, FALSE);
close (fd);
if (rename (path, name) == -1) {
msg_info_cache ("cannot rename %s -> %s, error %d, %s", path, name,
errno, strerror (errno));
(void)unlink (path);
ret = FALSE;
}
return ret;
}
#undef ROUND_DOUBLE
gint
rspamd_symcache_add_symbol (struct rspamd_symcache *cache,
const gchar *name,
gint priority,
symbol_func_t func,
gpointer user_data,
enum rspamd_symbol_type type,
gint parent)
{
struct rspamd_symcache_item *item = NULL;
g_assert (cache != NULL);
if (name == NULL && !(type & SYMBOL_TYPE_CALLBACK)) {
msg_warn_cache ("no name for non-callback symbol!");
}
else if ((type & SYMBOL_TYPE_VIRTUAL & (~SYMBOL_TYPE_GHOST)) && parent == -1) {
msg_warn_cache ("no parent symbol is associated with virtual symbol %s",
name);
}
if (name != NULL && !(type & SYMBOL_TYPE_CALLBACK)) {
if (g_hash_table_lookup (cache->items_by_symbol, name) != NULL) {
msg_err_cache ("skip duplicate symbol registration for %s", name);
return -1;
}
}
if (type & (SYMBOL_TYPE_CLASSIFIER|SYMBOL_TYPE_CALLBACK|
SYMBOL_TYPE_PREFILTER|SYMBOL_TYPE_POSTFILTER|
SYMBOL_TYPE_IDEMPOTENT)) {
type |= SYMBOL_TYPE_NOSTAT;
}
item = rspamd_mempool_alloc0 (cache->static_pool,
sizeof (struct rspamd_symcache_item));
item->st = rspamd_mempool_alloc0_shared (cache->static_pool,
sizeof (*item->st));
item->enabled = TRUE;
/*
* We do not share cd to skip locking, instead we'll just calculate it on
* save or accumulate
*/
item->cd = rspamd_mempool_alloc0 (cache->static_pool,
sizeof (struct rspamd_counter_data));
item->priority = priority;
item->type = type;
if ((type & SYMBOL_TYPE_FINE) && item->priority == 0) {
/* Make priority for negative weighted symbols */
item->priority = 1;
}
if (func) {
/* Non-virtual symbol */
g_assert (parent == -1);
if (item->type & SYMBOL_TYPE_PREFILTER) {
g_ptr_array_add (cache->prefilters, item);
}
else if (item->type & SYMBOL_TYPE_IDEMPOTENT) {
g_ptr_array_add (cache->idempotent, item);
}
else if (item->type & SYMBOL_TYPE_POSTFILTER) {
g_ptr_array_add (cache->postfilters, item);
}
else {
item->is_filter = TRUE;
g_ptr_array_add (cache->filters, item);
}
item->id = cache->items_by_id->len;
g_ptr_array_add (cache->items_by_id, item);
item->specific.normal.func = func;
item->specific.normal.user_data = user_data;
item->specific.normal.condition_cb = -1;
}
else {
/*
* Three possibilities here when no function is specified:
* - virtual symbol
* - classifier symbol
* - composite symbol
*/
if (item->type & SYMBOL_TYPE_COMPOSITE) {
item->specific.normal.condition_cb = -1;
item->specific.normal.user_data = user_data;
g_assert (user_data != NULL);
g_ptr_array_add (cache->composites, item);
item->id = cache->items_by_id->len;
g_ptr_array_add (cache->items_by_id, item);
}
else if (item->type & SYMBOL_TYPE_CLASSIFIER) {
/* Treat it as normal symbol to allow enable/disable */
item->id = cache->items_by_id->len;
g_ptr_array_add (cache->items_by_id, item);
item->is_filter = TRUE;
item->specific.normal.func = NULL;
item->specific.normal.user_data = NULL;
item->specific.normal.condition_cb = -1;