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
|
/*
* 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 "util.h"
#include "main.h"
#include "message.h"
#include "symbols_cache.h"
#include "view.h"
#include "cfg_file.h"
#define WEIGHT_MULT 2.0
#define FREQUENCY_MULT 100.0
#define TIME_MULT -1.0
/* After which number of messages try to resort cache */
#define MAX_USES 100
/*
* Symbols cache utility functions
*/
#define MIN_CACHE 17
static uint64_t total_frequency = 0;
static uint32_t nsymbols = 0;
int
cache_cmp (const void *p1, const void *p2)
{
const struct cache_item *i1 = p1, *i2 = p2;
return strcmp (i1->s->symbol, i2->s->symbol);
}
int
cache_logic_cmp (const void *p1, const void *p2)
{
const struct cache_item *i1 = p1, *i2 = p2;
double w1, w2;
double f1 = 0, f2 = 0;
if (total_frequency > 0) {
f1 = ((double)i1->s->frequency * nsymbols) / (double)total_frequency;
f2 = ((double)i2->s->frequency * nsymbols) / (double)total_frequency;
}
w1 = abs (i1->s->weight) * WEIGHT_MULT + f1 * FREQUENCY_MULT + i1->s->avg_time * TIME_MULT;
w2 = abs (i2->s->weight) * WEIGHT_MULT + f2 * FREQUENCY_MULT + i2->s->avg_time * TIME_MULT;
return (int)w2 - w1;
}
static GChecksum *
get_mem_cksum (struct symbols_cache *cache)
{
GChecksum *result;
GList *cur;
struct cache_item *item;
result = g_checksum_new (G_CHECKSUM_SHA1);
cur = g_list_first (cache->negative_items);
while (cur) {
item = cur->data;
if (item->s->symbol[0] != '\0') {
g_checksum_update (result, item->s->symbol, strlen (item->s->symbol));
}
cur = g_list_next (cur);
}
cur = g_list_first (cache->static_items);
while (cur) {
item = cur->data;
if (item->s->symbol[0] != '\0') {
g_checksum_update (result, item->s->symbol, strlen (item->s->symbol));
}
total_frequency += item->s->frequency;
cur = g_list_next (cur);
}
return result;
}
/* Sort items in logical order */
static void
post_cache_init (struct symbols_cache *cache)
{
GList *cur;
struct cache_item *item;
total_frequency = 0;
nsymbols = cache->used_items;
cur = g_list_first (cache->negative_items);
while (cur) {
item = cur->data;
total_frequency += item->s->frequency;
cur = g_list_next (cur);
}
cur = g_list_first (cache->static_items);
while (cur) {
item = cur->data;
total_frequency += item->s->frequency;
cur = g_list_next (cur);
}
cache->negative_items = g_list_sort (cache->negative_items, cache_logic_cmp);
cache->static_items = g_list_sort (cache->static_items, cache_logic_cmp);
}
/* Unmap cache file */
static void
unmap_cache_file (gpointer arg)
{
struct symbols_cache *cache = arg;
/* A bit ugly usage */
munmap (cache->map, cache->used_items * sizeof (struct saved_cache_item));
}
static gboolean
mmap_cache_file (struct symbols_cache *cache, int fd, memory_pool_t *pool)
{
guint8 *map;
int i;
GList *cur;
struct cache_item *item;
map = mmap (NULL, cache->used_items * sizeof (struct saved_cache_item), PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
if (map == MAP_FAILED) {
msg_err ("cannot mmap cache file: %d, %s", errno, strerror (errno));
close (fd);
return FALSE;
}
/* Close descriptor as it would never be used */
close (fd);
cache->map = map;
/* Now free old values for saved cache items and fill them with mmapped ones */
i = 0;
cur = g_list_first (cache->negative_items);
while (cur) {
item = cur->data;
item->s = (struct saved_cache_item *)(map + i * sizeof (struct saved_cache_item));
cur = g_list_next (cur);
i ++;
}
cur = g_list_first (cache->static_items);
while (cur) {
item = cur->data;
item->s = (struct saved_cache_item *)(map + i * sizeof (struct saved_cache_item));
cur = g_list_next (cur);
i ++;
}
post_cache_init (cache);
return TRUE;
}
/* Fd must be opened for writing, after creating file is mmapped */
static gboolean
create_cache_file (struct symbols_cache *cache, const char *filename, int fd, memory_pool_t *pool)
{
GChecksum *cksum;
u_char *digest;
gsize cklen;
GList *cur;
struct cache_item *item;
/* Calculate checksum */
cksum = get_mem_cksum (cache);
if (cksum == NULL) {
msg_err ("cannot calculate checksum for symbols");
close (fd);
return FALSE;
}
cklen = g_checksum_type_get_length (G_CHECKSUM_SHA1);
digest = g_malloc (cklen);
g_checksum_get_digest (cksum, digest, &cklen);
/* Now write data to file */
cur = g_list_first (cache->negative_items);
while (cur) {
item = cur->data;
if (write (fd, item->s, sizeof (struct saved_cache_item)) == -1) {
msg_err ("cannot write to file %d, %s", errno, strerror (errno));
close (fd);
g_checksum_free (cksum);
g_free (digest);
return FALSE;
}
cur = g_list_next (cur);
}
cur = g_list_first (cache->static_items);
while (cur) {
item = cur->data;
if (write (fd, item->s, sizeof (struct saved_cache_item)) == -1) {
msg_err ("cannot write to file %d, %s", errno, strerror (errno));
close (fd);
g_checksum_free (cksum);
g_free (digest);
return FALSE;
}
cur = g_list_next (cur);
}
/* Write checksum */
if (write (fd, digest, cklen) == -1) {
msg_err ("cannot write to file %d, %s", errno, strerror (errno));
close (fd);
g_checksum_free (cksum);
g_free (digest);
return FALSE;
}
close (fd);
g_checksum_free (cksum);
g_free (digest);
/* Reopen for reading */
if ((fd = open (filename, O_RDWR)) == -1) {
msg_info ("cannot open file %s, error %d, %s", errno, strerror (errno));
return FALSE;
}
return mmap_cache_file (cache, fd, pool);
}
void
register_symbol (struct symbols_cache **cache, const char *name, double weight, symbol_func_t func, gpointer user_data)
{
struct cache_item *item = NULL;
struct symbols_cache *pcache = *cache;
GList **target;
double *w;
if (*cache == NULL) {
pcache = g_new0 (struct symbols_cache, 1);
*cache = pcache;
pcache->static_pool = memory_pool_new (memory_pool_get_size ());
}
if (weight > 0) {
target = &(*cache)->static_items;
}
else {
target = &(*cache)->negative_items;
}
item = memory_pool_alloc0 (pcache->static_pool, sizeof (struct cache_item));
item->s = memory_pool_alloc0 (pcache->static_pool, sizeof (struct saved_cache_item));
g_strlcpy (item->s->symbol, name, sizeof (item->s->symbol));
item->func = func;
item->user_data = user_data;
/* Handle weight using default metric */
if (pcache->cfg && pcache->cfg->default_metric && (w = g_hash_table_lookup (pcache->cfg->default_metric->symbols, name)) != NULL) {
item->s->weight = weight * (*w);
}
else {
item->s->weight = weight;
}
pcache->used_items++;
msg_debug ("used items: %d, added symbol: %s", (*cache)->used_items, name);
set_counter (item->s->symbol, 0);
*target = g_list_prepend (*target, item);
}
void
register_dynamic_symbol (memory_pool_t *dynamic_pool, struct symbols_cache **cache,
const char *name, double weight, symbol_func_t func,
gpointer user_data, GList *networks)
{
struct cache_item *item = NULL;
struct symbols_cache *pcache = *cache;
GList *t, *cur;
uintptr_t r;
double *w;
uint32_t mask = 0xFFFFFFFF;
struct dynamic_map_item *it;
if (*cache == NULL) {
pcache = g_new0 (struct symbols_cache, 1);
*cache = pcache;
pcache->static_pool = memory_pool_new (memory_pool_get_size ());
}
item = memory_pool_alloc0 (dynamic_pool, sizeof (struct cache_item));
item->s = memory_pool_alloc (dynamic_pool, sizeof (struct saved_cache_item));
g_strlcpy (item->s->symbol, name, sizeof (item->s->symbol));
item->func = func;
item->user_data = user_data;
/* Handle weight using default metric */
if (pcache->cfg && pcache->cfg->default_metric && (w = g_hash_table_lookup (pcache->cfg->default_metric->symbols, name)) != NULL) {
item->s->weight = weight * (*w);
}
else {
item->s->weight = weight;
}
item->is_dynamic = TRUE;
pcache->used_items++;
msg_debug ("used items: %d, added symbol: %s", (*cache)->used_items, name);
set_counter (item->s->symbol, 0);
if (networks == NULL) {
pcache->dynamic_items = g_list_prepend (pcache->dynamic_items, item);
}
else {
if (pcache->dynamic_map == NULL) {
pcache->dynamic_map = radix_tree_create ();
pcache->negative_dynamic_map = radix_tree_create ();
}
cur = networks;
while (cur) {
it = cur->data;
mask = mask << (32 - it->mask);
r = ntohl (it->addr.s_addr & mask);
if (it->negative) {
/* For negatve items insert into list and into negative cache map */
if ((r = radix32tree_find (pcache->negative_dynamic_map, r)) != RADIX_NO_VALUE) {
t = (GList *)((gpointer)r);
t = g_list_prepend (t, item);
/* Replace pointers in radix tree and in destructor function */
memory_pool_replace_destructor (dynamic_pool, (pool_destruct_func)g_list_free, (gpointer)r, t);
r = radix32tree_replace (pcache->negative_dynamic_map, ntohl (it->addr.s_addr), mask, (uintptr_t)t);
if (r == -1) {
msg_warn ("cannot replace ip to tree: %s, mask %X", inet_ntoa (it->addr), mask);
}
}
else {
t = g_list_prepend (NULL, item);
memory_pool_add_destructor (dynamic_pool, (pool_destruct_func)g_list_free, t);
r = radix32tree_insert (pcache->negative_dynamic_map, ntohl (it->addr.s_addr), mask, (uintptr_t)t);
if (r == -1) {
msg_warn ("cannot insert ip to tree: %s, mask %X", inet_ntoa (it->addr), mask);
}
else if (r == 1) {
msg_warn ("ip %s, mask %X, value already exists", inet_ntoa (it->addr), mask);
}
}
/* Insert into list */
pcache->dynamic_items = g_list_prepend (pcache->dynamic_items, item);
}
else {
if ((r = radix32tree_find (pcache->dynamic_map, r)) != RADIX_NO_VALUE) {
t = (GList *)((gpointer)r);
t = g_list_prepend (t, item);
/* Replace pointers in radix tree and in destructor function */
memory_pool_replace_destructor (dynamic_pool, (pool_destruct_func)g_list_free, (gpointer)r, t);
r = radix32tree_replace (pcache->dynamic_map, ntohl (it->addr.s_addr), mask, (uintptr_t)t);
if (r == -1) {
msg_warn ("cannot replace ip to tree: %s, mask %X", inet_ntoa (it->addr), mask);
}
}
else {
t = g_list_prepend (NULL, item);
memory_pool_add_destructor (dynamic_pool, (pool_destruct_func)g_list_free, t);
r = radix32tree_insert (pcache->dynamic_map, ntohl (it->addr.s_addr), mask, (uintptr_t)t);
if (r == -1) {
msg_warn ("cannot insert ip to tree: %s, mask %X", inet_ntoa (it->addr), mask);
}
else if (r == 1) {
msg_warn ("ip %s, mask %X, value already exists", inet_ntoa (it->addr), mask);
}
}
}
cur = g_list_next (cur);
}
}
}
void
remove_dynamic_rules (struct symbols_cache *cache)
{
if (cache->dynamic_items) {
g_list_free (cache->dynamic_items);
cache->dynamic_items = NULL;
}
if (cache->dynamic_map) {
radix_tree_free (cache->dynamic_map);
cache->dynamic_map = NULL;
}
if (cache->negative_dynamic_map) {
radix_tree_free (cache->negative_dynamic_map);
cache->negative_dynamic_map = NULL;
}
}
static void
free_cache (gpointer arg)
{
struct symbols_cache *cache = arg;
if (cache->map != NULL) {
unmap_cache_file (cache);
}
if (cache->static_items) {
g_list_free (cache->static_items);
}
if (cache->negative_items) {
g_list_free (cache->negative_items);
}
if (cache->dynamic_items) {
g_list_free (cache->dynamic_items);
}
if (cache->dynamic_map) {
radix_tree_free (cache->dynamic_map);
}
if (cache->negative_dynamic_map) {
radix_tree_free (cache->negative_dynamic_map);
}
memory_pool_delete (cache->static_pool);
g_free (cache);
}
gboolean
init_symbols_cache (memory_pool_t * pool, struct symbols_cache *cache, struct config_file *cfg, const char *filename)
{
struct stat st;
int fd;
GChecksum *cksum;
u_char *mem_sum, *file_sum;
gsize cklen;
gboolean res;
if (cache == NULL) {
return FALSE;
}
/* Init locking */
cache->lock = memory_pool_get_rwlock (pool);
cache->cfg = cfg;
/* Just in-memory cache */
if (filename == NULL) {
post_cache_init (cache);
return TRUE;
}
/* First of all try to stat file */
if (stat (filename, &st) == -1) {
/* Check errno */
if (errno == ENOENT) {
/* Try to create file */
if ((fd = open (filename, O_RDWR | O_TRUNC | O_CREAT, S_IWUSR | S_IRUSR)) == -1) {
msg_info ("cannot create file %s, error %d, %s", filename, errno, strerror (errno));
return FALSE;
}
else {
return create_cache_file (cache, filename, fd, pool);
}
}
else {
msg_info ("cannot stat file %s, error %d, %s", filename, errno, strerror (errno));
return FALSE;
}
}
else {
if ((fd = open (filename, O_RDWR)) == -1) {
msg_info ("cannot open file %s, error %d, %s", filename, errno, strerror (errno));
return FALSE;
}
}
/* Calculate checksum */
cksum = get_mem_cksum (cache);
if (cksum == NULL) {
msg_err ("cannot calculate checksum for symbols");
close (fd);
return FALSE;
}
cklen = g_checksum_type_get_length (G_CHECKSUM_SHA1);
mem_sum = g_malloc (cklen);
g_checksum_get_digest (cksum, mem_sum, &cklen);
/* Now try to read file sum */
if (lseek (fd, -(cklen), SEEK_END) == -1) {
close (fd);
g_free (mem_sum);
g_checksum_free (cksum);
msg_err ("cannot seek to read checksum, %d, %s", errno, strerror (errno));
return FALSE;
}
file_sum = g_malloc (cklen);
if (read (fd, file_sum, cklen) == -1) {
close (fd);
g_free (mem_sum);
g_free (file_sum);
g_checksum_free (cksum);
msg_err ("cannot read checksum, %d, %s", errno, strerror (errno));
return FALSE;
}
if (memcmp (file_sum, mem_sum, cklen) != 0) {
close (fd);
g_free (mem_sum);
g_free (file_sum);
g_checksum_free (cksum);
msg_info ("checksum mismatch, recreating file");
/* Reopen with rw permissions */
if ((fd = open (filename, O_RDWR | O_TRUNC | O_CREAT, S_IWUSR | S_IRUSR)) == -1) {
msg_info ("cannot create file %s, error %d, %s", filename, errno, strerror (errno));
return FALSE;
}
else {
return create_cache_file (cache, filename, fd, pool);
}
}
g_free (mem_sum);
g_free (file_sum);
g_checksum_free (cksum);
/* MMap cache file and copy saved_cache structures */
res = mmap_cache_file (cache, fd, pool);
memory_pool_add_destructor (pool, (pool_destruct_func)free_cache, cache);
return res;
}
static GList *
check_dynamic_item (struct worker_task *task, struct symbols_cache *cache)
{
GList *res = NULL;
uintptr_t r;
if (cache->dynamic_map != NULL && task->from_addr.s_addr != INADDR_NONE) {
if ((r = radix32tree_find (cache->dynamic_map, ntohl (task->from_addr.s_addr))) != RADIX_NO_VALUE) {
res = (GList *)((gpointer)r);
return res;
}
else {
return NULL;
}
}
return res;
}
static gboolean
check_negative_dynamic_item (struct worker_task *task, struct symbols_cache *cache, struct cache_item *item)
{
GList *res = NULL;
uintptr_t r;
if (cache->negative_dynamic_map != NULL && task->from_addr.s_addr != INADDR_NONE) {
if ((r = radix32tree_find (cache->negative_dynamic_map, ntohl (task->from_addr.s_addr))) != RADIX_NO_VALUE) {
res = (GList *)((gpointer)r);
while (res) {
if (res->data == (gpointer)item) {
return TRUE;
}
res = g_list_next (res);
}
}
}
return FALSE;
}
static gboolean
check_debug_symbol (struct config_file *cfg, const char *symbol)
{
GList *cur;
cur = cfg->debug_symbols;
while (cur) {
if (strcmp (symbol, (const char *)cur->data) == 0) {
return TRUE;
}
cur = g_list_next (cur);
}
return FALSE;
}
struct symbol_callback_data {
enum {
CACHE_STATE_NEGATIVE,
CACHE_STATE_DYNAMIC_MAP,
CACHE_STATE_DYNAMIC,
CACHE_STATE_STATIC
} state;
struct cache_item *saved_item;
GList *list_pointer;
};
gboolean
call_symbol_callback (struct worker_task * task, struct symbols_cache * cache, gpointer *save)
{
#ifdef HAVE_CLOCK_GETTIME
struct timespec ts1, ts2;
#else
struct timeval tv1, tv2;
#endif
uint64_t diff;
struct cache_item *item = NULL;
struct symbol_callback_data *s = *save;
if (s == NULL) {
if (cache == NULL) {
return FALSE;
}
if (cache->uses++ >= MAX_USES) {
msg_info ("resort symbols cache");
memory_pool_wlock_rwlock (cache->lock);
cache->uses = 0;
/* Resort while having write lock */
post_cache_init (cache);
memory_pool_wunlock_rwlock (cache->lock);
}
s = memory_pool_alloc0 (task->task_pool, sizeof (struct symbol_callback_data));
*save = s;
if (cache->negative_items != NULL) {
s->list_pointer = g_list_first (cache->negative_items);
s->saved_item = s->list_pointer->data;
s->state = CACHE_STATE_NEGATIVE;
}
else if ((s->list_pointer = check_dynamic_item (task, cache)) || cache->dynamic_items != NULL) {
if (s->list_pointer == NULL) {
s->list_pointer = g_list_first (cache->dynamic_items);
s->saved_item = s->list_pointer->data;
s->state = CACHE_STATE_DYNAMIC;
}
else {
s->saved_item = s->list_pointer->data;
s->state = CACHE_STATE_DYNAMIC_MAP;
}
}
else {
s->state = CACHE_STATE_STATIC;
s->list_pointer = g_list_first (cache->static_items);
if (s->list_pointer) {
s->saved_item = s->list_pointer->data;
}
else {
return FALSE;
}
}
item = s->saved_item;
}
else {
if (cache == NULL) {
return FALSE;
}
switch (s->state) {
case CACHE_STATE_NEGATIVE:
s->list_pointer = g_list_next (s->list_pointer);
if (s->list_pointer == NULL) {
if ((s->list_pointer = check_dynamic_item (task, cache)) || cache->dynamic_items != NULL) {
if (s->list_pointer == NULL) {
s->list_pointer = g_list_first (cache->dynamic_items);
s->saved_item = s->list_pointer->data;
s->state = CACHE_STATE_DYNAMIC;
}
else {
s->saved_item = s->list_pointer->data;
s->state = CACHE_STATE_DYNAMIC_MAP;
}
}
else {
s->state = CACHE_STATE_STATIC;
s->list_pointer = g_list_first (cache->static_items);
if (s->list_pointer) {
s->saved_item = s->list_pointer->data;
}
else {
return FALSE;
}
}
}
else {
s->saved_item = s->list_pointer->data;
}
item = s->saved_item;
break;
case CACHE_STATE_DYNAMIC_MAP:
s->list_pointer = g_list_next (s->list_pointer);
if (s->list_pointer == NULL) {
s->list_pointer = g_list_first (cache->dynamic_items);
if (s->list_pointer) {
s->saved_item = s->list_pointer->data;
s->state = CACHE_STATE_DYNAMIC;
}
else {
s->state = CACHE_STATE_STATIC;
s->list_pointer = g_list_first (cache->static_items);
if (s->list_pointer) {
s->saved_item = s->list_pointer->data;
}
else {
return FALSE;
}
}
}
else {
s->saved_item = s->list_pointer->data;
}
item = s->saved_item;
break;
case CACHE_STATE_DYNAMIC:
s->list_pointer = g_list_next (s->list_pointer);
if (s->list_pointer == NULL) {
s->state = CACHE_STATE_STATIC;
s->list_pointer = g_list_first (cache->static_items);
if (s->list_pointer) {
s->saved_item = s->list_pointer->data;
}
else {
return FALSE;
}
}
else {
s->saved_item = s->list_pointer->data;
/* Skip items that are in negative map */
while (s->list_pointer != NULL && check_negative_dynamic_item (task, cache, s->saved_item)) {
s->list_pointer = g_list_next (s->list_pointer);
if (s->list_pointer != NULL) {
s->saved_item = s->list_pointer->data;
}
}
if (s->list_pointer == NULL) {
s->state = CACHE_STATE_STATIC;
s->list_pointer = g_list_first (cache->static_items);
if (s->list_pointer) {
s->saved_item = s->list_pointer->data;
}
else {
return FALSE;
}
}
}
item = s->saved_item;
break;
case CACHE_STATE_STATIC:
/* Next pointer */
s->list_pointer = g_list_next (s->list_pointer);
if (s->list_pointer) {
s->saved_item = s->list_pointer->data;
}
else {
return FALSE;
}
item = s->saved_item;
break;
}
}
if (!item) {
return FALSE;
}
if (check_view (task->cfg->views, item->s->symbol, task)) {
#ifdef HAVE_CLOCK_GETTIME
# ifdef HAVE_CLOCK_PROCESS_CPUTIME_ID
clock_gettime (CLOCK_PROCESS_CPUTIME_ID, &ts1);
# elif defined(HAVE_CLOCK_VIRTUAL)
clock_gettime (CLOCK_VIRTUAL, &ts1);
# else
clock_gettime (CLOCK_REALTIME, &ts1);
# endif
#else
if (gettimeofday (&tv1, NULL) == -1) {
msg_warn ("gettimeofday failed: %s", strerror (errno));
}
#endif
if (G_UNLIKELY (check_debug_symbol (task->cfg, item->s->symbol))) {
rspamd_log_debug ();
item->func (task, item->user_data);
rspamd_log_nodebug ();
}
else {
item->func (task, item->user_data);
}
#ifdef HAVE_CLOCK_GETTIME
# ifdef HAVE_CLOCK_PROCESS_CPUTIME_ID
clock_gettime (CLOCK_PROCESS_CPUTIME_ID, &ts2);
# elif defined(HAVE_CLOCK_VIRTUAL)
clock_gettime (CLOCK_VIRTUAL, &ts2);
# else
clock_gettime (CLOCK_REALTIME, &ts2);
# endif
#else
if (gettimeofday (&tv2, NULL) == -1) {
msg_warn ("gettimeofday failed: %s", strerror (errno));
}
#endif
#ifdef HAVE_CLOCK_GETTIME
diff = (ts2.tv_sec - ts1.tv_sec) * 1000000 + (ts2.tv_nsec - ts1.tv_nsec) / 1000;
#else
diff = (tv2.tv_sec - tv1.tv_sec) * 1000000 + (tv2.tv_usec - tv1.tv_usec);
#endif
item->s->avg_time = set_counter (item->s->symbol, diff);
}
s->saved_item = item;
return TRUE;
}
|