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
|
/*
* 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 "binlog.h"
#include "cfg_file.h"
#include "tokenizers/tokenizers.h"
#define BINLOG_SUFFIX ".binlog"
#define BACKUP_SUFFIX ".old"
#define VALID_MAGIC { 'r', 's', 'l' }
#define VALID_VERSION { '1', '0' }
static GHashTable *binlog_opened = NULL;
static memory_pool_t *binlog_pool = NULL;
static gboolean
binlog_write_header (struct rspamd_binlog *log)
{
struct rspamd_binlog_header header = {
.magic = VALID_MAGIC,
.version = VALID_VERSION,
.padding = { '\0', '\0' },
};
header.create_time = time (NULL);
lock_file (log->fd, FALSE);
if (write (log->fd, &header, sizeof (struct rspamd_binlog_header)) == -1) {
msg_warn ("cannot write file %s, error %d, %s", log->filename, errno, strerror (errno));
return FALSE;
}
memcpy (&log->header, &header, sizeof (struct rspamd_binlog_header));
/* Metaindex */
log->metaindex = g_malloc (sizeof (struct rspamd_binlog_metaindex));
bzero (log->metaindex, sizeof (struct rspamd_binlog_metaindex));
/* Offset to metaindex */
log->metaindex->indexes[0] = sizeof (struct rspamd_binlog_metaindex) + sizeof (struct rspamd_binlog_header);
if (write (log->fd, log->metaindex, sizeof (struct rspamd_binlog_metaindex)) == -1) {
g_free (log->metaindex);
msg_warn ("cannot write file %s, error %d, %s", log->filename, errno, strerror (errno));
unlock_file (log->fd, FALSE);
return FALSE;
}
/* Alloc, write, mmap */
log->cur_idx = g_malloc (sizeof (struct rspamd_index_block));
bzero (log->cur_idx, sizeof (struct rspamd_index_block));
if (write (log->fd, log->cur_idx, sizeof (struct rspamd_index_block)) == -1) {
g_free (log->cur_idx);
msg_warn ("cannot write file %s, error %d, %s", log->filename, errno, strerror (errno));
unlock_file (log->fd, FALSE);
return FALSE;
}
unlock_file (log->fd, FALSE);
return TRUE;
}
static gboolean
binlog_check_file (struct rspamd_binlog *log)
{
static gchar valid_magic[] = VALID_MAGIC, valid_version[] = VALID_VERSION;
if (read (log->fd, &log->header, sizeof (struct rspamd_binlog_header)) != sizeof (struct rspamd_binlog_header)) {
msg_warn ("cannot read file %s, error %d, %s", log->filename, errno, strerror (errno));
return FALSE;
}
/* Now check all fields */
if (memcmp (&log->header.magic, valid_magic, sizeof (valid_magic)) != 0 ||
memcmp (&log->header.version, valid_version, sizeof (valid_version)) != 0) {
msg_warn ("cannot validate file %s");
return FALSE;
}
/* Now mmap metaindex and current index */
if (log->metaindex == NULL) {
log->metaindex = g_malloc (sizeof (struct rspamd_binlog_metaindex));
}
if ((read (log->fd, log->metaindex, sizeof (struct rspamd_binlog_metaindex))) != sizeof (struct rspamd_binlog_metaindex)) {
msg_warn ("cannot read metaindex of file %s, error %d, %s", log->filename, errno, strerror (errno));
return FALSE;
}
/* Current index */
if (log->cur_idx == NULL) {
log->cur_idx = g_malloc (sizeof (struct rspamd_index_block));
}
if (lseek (log->fd, log->metaindex->indexes[log->metaindex->last_index], SEEK_SET) == -1) {
msg_info ("cannot seek in file: %s, error: %s", log->filename, strerror (errno));
return FALSE;
}
if ((read (log->fd, log->cur_idx, sizeof (struct rspamd_index_block))) != sizeof (struct rspamd_index_block)) {
msg_warn ("cannot read index in file %s, error %d, %s", log->filename, errno, strerror (errno));
return FALSE;
}
log->cur_seq = log->cur_idx->last_index;
log->cur_time = log->cur_idx->indexes[log->cur_idx->last_index].time;
return TRUE;
}
static gboolean
binlog_create (struct rspamd_binlog *log)
{
if ((log->fd = open (log->filename, O_RDWR | O_TRUNC | O_CREAT, S_IWUSR | S_IRUSR)) == -1) {
msg_info ("cannot create file %s, error %d, %s", log->filename, errno, strerror (errno));
return FALSE;
}
return binlog_write_header (log);
}
static gboolean
binlog_open_real (struct rspamd_binlog *log)
{
if ((log->fd = open (log->filename, O_RDWR)) == -1) {
msg_info ("cannot open file %s, error %d, %s", log->filename, errno, strerror (errno));
return FALSE;
}
return binlog_check_file (log);
}
struct rspamd_binlog*
binlog_open (memory_pool_t *pool, const gchar *path, time_t rotate_time, gint rotate_jitter)
{
struct rspamd_binlog *new;
gint len = strlen (path);
struct stat st;
new = memory_pool_alloc0 (pool, sizeof (struct rspamd_binlog));
new->pool = pool;
new->rotate_time = rotate_time;
new->fd = -1;
if (rotate_time) {
new->rotate_jitter = g_random_int_range (0, rotate_jitter);
}
new->filename = memory_pool_alloc (pool, len + sizeof (BINLOG_SUFFIX));
rspamd_strlcpy (new->filename, path, len + 1);
rspamd_strlcpy (new->filename + len, BINLOG_SUFFIX, sizeof (BINLOG_SUFFIX));
if (stat (new->filename, &st) == -1) {
/* Check errno to check whether we should create this file */
if (errno != ENOENT) {
msg_err ("cannot stat file: %s, error %s", new->filename, strerror (errno));
return NULL;
}
else {
/* In case of ENOENT try to create binlog */
if (!binlog_create (new)) {
return NULL;
}
}
}
else {
/* Try to open binlog */
if (!binlog_open_real (new)) {
return NULL;
}
}
return new;
}
void
binlog_close (struct rspamd_binlog *log)
{
if (log) {
if (log->metaindex) {
g_free (log->metaindex);
}
if (log->cur_idx) {
g_free (log->cur_idx);
}
close (log->fd);
}
}
static gboolean
binlog_tree_callback (gpointer key, gpointer value, gpointer data)
{
token_node_t *node = key;
struct rspamd_binlog *log = data;
struct rspamd_binlog_element elt;
elt.h1 = node->h1;
elt.h2 = node->h2;
elt.value = node->value;
if (write (log->fd, &elt, sizeof (elt)) == -1) {
msg_info ("cannot write token to file: %s, error: %s", log->filename, strerror (errno));
return TRUE;
}
return FALSE;
}
static gboolean
write_binlog_tree (struct rspamd_binlog *log, GTree *nodes)
{
off_t seek;
struct rspamd_binlog_index *idx;
lock_file (log->fd, FALSE);
log->cur_seq ++;
/* Seek to end of file */
if ((seek = lseek (log->fd, 0, SEEK_END)) == -1) {
unlock_file (log->fd, FALSE);
msg_info ("cannot seek in file: %s, error: %s", log->filename, strerror (errno));
return FALSE;
}
/* Now write all nodes to file */
g_tree_foreach (nodes, binlog_tree_callback, (gpointer)log);
/* Write index */
idx = &log->cur_idx->indexes[log->cur_idx->last_index];
idx->seek = seek;
idx->time = (guint64)time (NULL);
log->cur_time = idx->time;
idx->len = g_tree_nnodes (nodes) * sizeof (struct rspamd_binlog_element);
if (lseek (log->fd, log->metaindex->indexes[log->metaindex->last_index], SEEK_SET) == -1) {
unlock_file (log->fd, FALSE);
msg_info ("cannot seek in file: %s, error: %s, seek: %L, op: insert index", log->filename,
strerror (errno), log->metaindex->indexes[log->metaindex->last_index]);
return FALSE;
}
log->cur_idx->last_index ++;
if (write (log->fd, log->cur_idx, sizeof (struct rspamd_index_block)) == -1) {
unlock_file (log->fd, FALSE);
msg_info ("cannot write index to file: %s, error: %s", log->filename, strerror (errno));
return FALSE;
}
unlock_file (log->fd, FALSE);
return TRUE;
}
static gboolean
create_new_metaindex_block (struct rspamd_binlog *log)
{
off_t seek;
lock_file (log->fd, FALSE);
log->metaindex->last_index ++;
/* Seek to end of file */
if ((seek = lseek (log->fd, 0, SEEK_END)) == -1) {
unlock_file (log->fd, FALSE);
msg_info ("cannot seek in file: %s, error: %s", log->filename, strerror (errno));
return FALSE;
}
if (write (log->fd, log->cur_idx, sizeof (struct rspamd_index_block)) == -1) {
unlock_file (log->fd, FALSE);
g_free (log->cur_idx);
msg_warn ("cannot write file %s, error %d, %s", log->filename, errno, strerror (errno));
return FALSE;
}
/* Offset to metaindex */
log->metaindex->indexes[log->metaindex->last_index] = seek;
/* Overwrite all metaindexes */
if (lseek (log->fd, sizeof (struct rspamd_binlog_header), SEEK_SET) == -1) {
unlock_file (log->fd, FALSE);
msg_info ("cannot seek in file: %s, error: %s", log->filename, strerror (errno));
return FALSE;
}
if (write (log->fd, log->metaindex, sizeof (struct rspamd_binlog_metaindex)) == -1) {
unlock_file (log->fd, FALSE);
msg_info ("cannot write metaindex in file: %s, error: %s", log->filename, strerror (errno));
return FALSE;
}
bzero (log->cur_idx, sizeof (struct rspamd_index_block));
unlock_file (log->fd, FALSE);
return TRUE;
}
static gboolean
maybe_rotate_binlog (struct rspamd_binlog *log)
{
guint64 now = time (NULL);
if (log->rotate_time && ((now - log->header.create_time) > log->rotate_time + log->rotate_jitter)) {
return TRUE;
}
return FALSE;
}
static gboolean
rotate_binlog (struct rspamd_binlog *log)
{
gchar *backup_name;
struct stat st;
lock_file (log->fd, FALSE);
/* Unmap mapped fragments */
if (log->metaindex) {
g_free (log->metaindex);
log->metaindex = NULL;
}
if (log->cur_idx) {
g_free (log->cur_idx);
log->cur_idx = NULL;
}
/* Format backup name */
backup_name = g_strdup_printf ("%s.%s", log->filename, BACKUP_SUFFIX);
if (stat (backup_name, &st) != -1) {
msg_info ("replace old %s", backup_name);
unlink (backup_name);
}
rename (log->filename, backup_name);
g_free (backup_name);
/* XXX: maybe race condition here */
unlock_file (log->fd, FALSE);
close (log->fd);
return binlog_create (log);
}
gboolean
binlog_insert (struct rspamd_binlog *log, GTree *nodes)
{
off_t seek;
if (!log || !log->metaindex || !log->cur_idx || !nodes) {
msg_info ("improperly opened binlog: %s", log != NULL ? log->filename : "unknown");
return FALSE;
}
if (maybe_rotate_binlog (log)) {
if (!rotate_binlog (log)) {
return FALSE;
}
}
/* First of all try to place new tokens in current index */
if (log->cur_idx->last_index < BINLOG_IDX_LEN) {
/* All is ok */
return write_binlog_tree (log, nodes);
}
/* Current index table is all busy, try to allocate new index */
/* Check metaindex free space */
if (log->metaindex->last_index < METAINDEX_LEN) {
/* Create new index block */
if ((seek = lseek (log->fd, 0, SEEK_END)) == (off_t)-1) {
msg_info ("cannot seek in file: %s, error: %s", log->filename, strerror (errno));
return FALSE;
}
if (!create_new_metaindex_block (log)) {
return FALSE;
}
return write_binlog_tree (log, nodes);
}
/* All binlog is filled, we need to rotate it forcefully */
if (!rotate_binlog (log)) {
return FALSE;
}
return write_binlog_tree (log, nodes);
}
gboolean
binlog_sync (struct rspamd_binlog *log, guint64 from_rev, guint64 *from_time, GByteArray **rep)
{
guint32 metaindex_num;
struct rspamd_index_block *idxb;
struct rspamd_binlog_index *idx;
gboolean idx_mapped = FALSE, res = TRUE, is_first = FALSE;
if (!log || !log->metaindex || !log->cur_idx) {
msg_info ("improperly opened binlog: %s", log != NULL ? log->filename : "unknown");
return FALSE;
}
if (*rep == NULL) {
*rep = g_malloc (sizeof (GByteArray));
is_first = TRUE;
}
else {
/* Unmap old fragment */
g_free ((*rep)->data);
}
if (from_rev == log->cur_seq) {
/* Last record */
*rep = NULL;
return FALSE;
}
metaindex_num = from_rev / BINLOG_IDX_LEN;
/* First of all try to find this revision */
if (metaindex_num > log->metaindex->last_index) {
return FALSE;
}
else if (metaindex_num != log->metaindex->last_index) {
/* Need to remap index block */
lock_file (log->fd, FALSE);
idxb = g_malloc (sizeof (struct rspamd_index_block));
idx_mapped = TRUE;
if (lseek (log->fd, log->metaindex->indexes[metaindex_num], SEEK_SET) == -1) {
unlock_file (log->fd, FALSE);
msg_warn ("cannot seek file %s, error %d, %s", log->filename, errno, strerror (errno));
res = FALSE;
goto end;
}
if ((read (log->fd, idxb, sizeof (struct rspamd_index_block))) != sizeof (struct rspamd_index_block)) {
unlock_file (log->fd, FALSE);
msg_warn ("cannot read index from file %s, error %d, %s", log->filename, errno, strerror (errno));
res = FALSE;
goto end;
}
unlock_file (log->fd, FALSE);
}
else {
idxb = log->cur_idx;
}
/* Now check specified index */
idx = &idxb->indexes[from_rev % BINLOG_IDX_LEN];
if (is_first && idx->time != *from_time) {
res = FALSE;
*from_time = 0;
goto end;
}
else {
*from_time = idx->time;
}
/* Now fill reply structure */
(*rep)->len = idx->len;
/* Read result */
msg_info ("update from binlog '%s' from revision: %uL to revision %uL size is %uL",
log->filename, from_rev, log->cur_seq, idx->len);
if (lseek (log->fd, idx->seek, SEEK_SET) == -1) {
msg_warn ("cannot seek file %s, error %d, %s", log->filename, errno, strerror (errno));
res = FALSE;
goto end;
}
(*rep)->data = g_malloc (idx->len);
if ((read (log->fd, (*rep)->data, idx->len)) != idx->len) {
msg_warn ("cannot read file %s, error %d, %s", log->filename, errno, strerror (errno));
res = FALSE;
goto end;
}
end:
if (idx_mapped) {
g_free (idxb);
}
return res;
}
static gboolean
maybe_init_static ()
{
if (!binlog_opened) {
binlog_opened = g_hash_table_new (g_direct_hash, g_direct_equal);
if (!binlog_opened) {
return FALSE;
}
}
if (!binlog_pool) {
binlog_pool = memory_pool_new (memory_pool_get_size ());
if (!binlog_pool) {
return FALSE;
}
}
return TRUE;
}
gboolean
maybe_write_binlog (struct classifier_config *ccf, struct statfile *st, stat_file_t *file, GTree *nodes)
{
struct rspamd_binlog *log;
if (ccf == NULL) {
return FALSE;
}
if (st == NULL || nodes == NULL || st->binlog == NULL || st->binlog->affinity != AFFINITY_MASTER) {
return FALSE;
}
if (!maybe_init_static ()) {
return FALSE;
}
if ((log = g_hash_table_lookup (binlog_opened, st)) == NULL) {
if ((log = binlog_open (binlog_pool, st->path, st->binlog->rotate_time, st->binlog->rotate_time / 2)) != NULL) {
g_hash_table_insert (binlog_opened, st, log);
}
else {
return FALSE;
}
}
if (binlog_insert (log, nodes)) {
msg_info ("set new revision of statfile %s: %uL", st->symbol, log->cur_seq);
(void)statfile_set_revision (file, log->cur_seq, log->cur_time);
return TRUE;
}
return FALSE;
}
struct rspamd_binlog*
get_binlog_by_statfile (struct statfile *st)
{
struct rspamd_binlog *log;
if (st == NULL || st->binlog == NULL || st->binlog->affinity != AFFINITY_MASTER) {
return NULL;
}
if (!maybe_init_static ()) {
return NULL;
}
if ((log = g_hash_table_lookup (binlog_opened, st)) == NULL) {
if ((log = binlog_open (binlog_pool, st->path, st->binlog->rotate_time, st->binlog->rotate_time / 2)) != NULL) {
g_hash_table_insert (binlog_opened, st, log);
}
else {
return NULL;
}
}
return log;
}
|