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
|
/*
* Copyright (c) 2013, 2014 Balabit
* Copyright (c) 2013, 2014 Gergely Nagy <algernon@balabit.hu>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*
* As an additional exemption you are allowed to compile & link against the
* OpenSSL libraries as published by the OpenSSL project. See the file
* COPYING for details.
*
*/
#include "filter-in-list.h"
#include "logmsg/logmsg.h"
#include "str-utils.h"
#include <errno.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
typedef struct _FilterInList
{
FilterExprNode super;
NVHandle value_handle;
GTree *tree;
} FilterInList;
static gboolean
filter_in_list_eval(FilterExprNode *s, LogMessage **msgs, gint num_msg, LogTemplateEvalOptions *options)
{
FilterInList *self = (FilterInList *)s;
LogMessage *msg = msgs[num_msg - 1];
const gchar *value;
gssize len = 0;
value = log_msg_get_value(msg, self->value_handle, &len);
APPEND_ZERO(value, value, len);
gboolean result = (g_tree_lookup(self->tree, value) != NULL);
msg_trace("in-list() evaluation started",
evt_tag_str("value", value),
evt_tag_msg_reference(msg));
return result ^ s->comp;
}
static void
filter_in_list_free(FilterExprNode *s)
{
FilterInList *self = (FilterInList *)s;
g_tree_destroy(self->tree);
}
FilterExprNode *
filter_in_list_new(const gchar *list_file, const gchar *property)
{
FilterInList *self;
FILE *stream;
gchar line[16384];
stream = fopen(list_file, "r");
if (!stream)
{
msg_error("Error opening in-list filter list file",
evt_tag_str("file", list_file),
evt_tag_error("errno"));
return NULL;
}
self = g_new0(FilterInList, 1);
filter_expr_node_init_instance(&self->super);
self->value_handle = log_msg_get_value_handle(property);
self->tree = g_tree_new_full((GCompareDataFunc)strcmp, NULL, g_free, NULL);
while (fgets(line, sizeof(line), stream) != NULL)
{
line[strlen(line) - 1] = '\0';
if (line[0])
g_tree_insert(self->tree, g_strdup(line), GINT_TO_POINTER(1));
}
fclose(stream);
self->super.eval = filter_in_list_eval;
self->super.free_fn = filter_in_list_free;
return &self->super;
}
|
