forked from collectd/collectd
-
Notifications
You must be signed in to change notification settings - Fork 0
/
match_value.c
358 lines (300 loc) · 8.31 KB
/
match_value.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
/**
* collectd - src/match_value.c
* Copyright (C) 2008 Florian Forster
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; only version 2 of the License is applicable.
*
* This program 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
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*
* Authors:
* Florian Forster <octo at verplant.org>
**/
/*
* This module allows to filter and rewrite value lists based on
* Perl-compatible regular expressions.
*/
#include "collectd.h"
#include "common.h"
#include "utils_cache.h"
#include "filter_chain.h"
#define SATISFY_ALL 0
#define SATISFY_ANY 1
/*
* private data types
*/
struct mv_match_s;
typedef struct mv_match_s mv_match_t;
struct mv_match_s
{
gauge_t min;
gauge_t max;
int invert;
int satisfy;
char **data_sources;
size_t data_sources_num;
};
/*
* internal helper functions
*/
static void mv_free_match (mv_match_t *m) /* {{{ */
{
int i;
if (m == NULL)
return;
if (m->data_sources != NULL)
{
for (i = 0; i < m->data_sources_num; ++i)
free(m->data_sources[i]);
free(m->data_sources);
}
free (m);
} /* }}} void mv_free_match */
static int mv_config_add_satisfy (mv_match_t *m, /* {{{ */
oconfig_item_t *ci)
{
if ((ci->values_num != 1) || (ci->values[0].type != OCONFIG_TYPE_STRING))
{
ERROR ("`value' match: `%s' needs exactly one string argument.",
ci->key);
return (-1);
}
if (strcasecmp ("All", ci->values[0].value.string) == 0)
m->satisfy = SATISFY_ALL;
else if (strcasecmp ("Any", ci->values[0].value.string) == 0)
m->satisfy = SATISFY_ANY;
else
{
ERROR ("`value' match: Passing `%s' to the `%s' option is invalid. "
"The argument must either be `All' or `Any'.",
ci->values[0].value.string, ci->key);
return (-1);
}
return (0);
} /* }}} int mv_config_add_satisfy */
static int mv_config_add_data_source (mv_match_t *m, /* {{{ */
oconfig_item_t *ci)
{
size_t new_data_sources_num;
char **temp;
int i;
/* Check number of arbuments. */
if (ci->values_num < 1)
{
ERROR ("`value' match: `%s' needs at least one argument.",
ci->key);
return (-1);
}
/* Check type of arguments */
for (i = 0; i < ci->values_num; i++)
{
if (ci->values[i].type == OCONFIG_TYPE_STRING)
continue;
ERROR ("`value' match: `%s' accepts only string arguments "
"(argument %i is a %s).",
ci->key, i + 1,
(ci->values[i].type == OCONFIG_TYPE_BOOLEAN)
? "truth value" : "number");
return (-1);
}
/* Allocate space for the char pointers */
new_data_sources_num = m->data_sources_num + ((size_t) ci->values_num);
temp = (char **) realloc (m->data_sources,
new_data_sources_num * sizeof (char *));
if (temp == NULL)
{
ERROR ("`value' match: realloc failed.");
return (-1);
}
m->data_sources = temp;
/* Copy the strings, allocating memory as needed. */
for (i = 0; i < ci->values_num; i++)
{
size_t j;
/* If we get here, there better be memory for us to write to. */
assert (m->data_sources_num < new_data_sources_num);
j = m->data_sources_num;
m->data_sources[j] = sstrdup (ci->values[i].value.string);
if (m->data_sources[j] == NULL)
{
ERROR ("`value' match: sstrdup failed.");
continue;
}
m->data_sources_num++;
}
return (0);
} /* }}} int mv_config_add_data_source */
static int mv_config_add_gauge (gauge_t *ret_value, /* {{{ */
oconfig_item_t *ci)
{
if ((ci->values_num != 1) || (ci->values[0].type != OCONFIG_TYPE_NUMBER))
{
ERROR ("`value' match: `%s' needs exactly one numeric argument.",
ci->key);
return (-1);
}
*ret_value = ci->values[0].value.number;
return (0);
} /* }}} int mv_config_add_gauge */
static int mv_config_add_boolean (int *ret_value, /* {{{ */
oconfig_item_t *ci)
{
if ((ci->values_num != 1) || (ci->values[0].type != OCONFIG_TYPE_BOOLEAN))
{
ERROR ("`value' match: `%s' needs exactly one boolean argument.",
ci->key);
return (-1);
}
if (ci->values[0].value.boolean)
*ret_value = 1;
else
*ret_value = 0;
return (0);
} /* }}} int mv_config_add_boolean */
static int mv_create (const oconfig_item_t *ci, void **user_data) /* {{{ */
{
mv_match_t *m;
int status;
int i;
m = (mv_match_t *) malloc (sizeof (*m));
if (m == NULL)
{
ERROR ("mv_create: malloc failed.");
return (-ENOMEM);
}
memset (m, 0, sizeof (*m));
m->min = NAN;
m->max = NAN;
m->invert = 0;
m->satisfy = SATISFY_ALL;
m->data_sources = NULL;
m->data_sources_num = 0;
status = 0;
for (i = 0; i < ci->children_num; i++)
{
oconfig_item_t *child = ci->children + i;
if (strcasecmp ("Min", child->key) == 0)
status = mv_config_add_gauge (&m->min, child);
else if (strcasecmp ("Max", child->key) == 0)
status = mv_config_add_gauge (&m->max, child);
else if (strcasecmp ("Invert", child->key) == 0)
status = mv_config_add_boolean (&m->invert, child);
else if (strcasecmp ("Satisfy", child->key) == 0)
status = mv_config_add_satisfy (m, child);
else if (strcasecmp ("DataSource", child->key) == 0)
status = mv_config_add_data_source (m, child);
else
{
ERROR ("`value' match: The `%s' configuration option is not "
"understood and will be ignored.", child->key);
status = 0;
}
if (status != 0)
break;
}
/* Additional sanity-checking */
while (status == 0)
{
if (isnan (m->min) && isnan (m->max))
{
ERROR ("`value' match: Neither minimum nor maximum are defined. "
"This match will be ignored.");
status = -1;
}
break;
}
if (status != 0)
{
mv_free_match (m);
return (status);
}
*user_data = m;
return (0);
} /* }}} int mv_create */
static int mv_destroy (void **user_data) /* {{{ */
{
if ((user_data != NULL) && (*user_data != NULL))
mv_free_match (*user_data);
return (0);
} /* }}} int mv_destroy */
static int mv_match (const data_set_t *ds, const value_list_t *vl, /* {{{ */
notification_meta_t __attribute__((unused)) **meta, void **user_data)
{
mv_match_t *m;
gauge_t *values;
int status;
int i;
if ((user_data == NULL) || (*user_data == NULL))
return (-1);
m = *user_data;
values = uc_get_rate (ds, vl);
if (values == NULL)
{
ERROR ("`value' match: Retrieving the current rate from the cache "
"failed.");
return (-1);
}
status = FC_MATCH_NO_MATCH;
for (i = 0; i < ds->ds_num; i++)
{
int value_matches = 0;
/* Check if this data source is relevant. */
if (m->data_sources != NULL)
{
size_t j;
for (j = 0; j < m->data_sources_num; j++)
if (strcasecmp (ds->ds[i].name, m->data_sources[j]) == 0)
break;
/* No match, ignore this data source. */
if (j >= m->data_sources_num)
continue;
}
DEBUG ("`value' match: current = %g; min = %g; max = %g; invert = %s;",
values[i], m->min, m->max,
m->invert ? "true" : "false");
if ((!isnan (m->min) && (values[i] < m->min))
|| (!isnan (m->max) && (values[i] > m->max)))
value_matches = 0;
else
value_matches = 1;
if (m->invert)
{
if (value_matches)
value_matches = 0;
else
value_matches = 1;
}
if (value_matches != 0)
{
status = FC_MATCH_MATCHES;
if (m->satisfy == SATISFY_ANY)
break;
}
else if (value_matches == 0)
{
status = FC_MATCH_NO_MATCH;
if (m->satisfy == SATISFY_ALL)
break;
}
} /* for (i = 0; i < ds->ds_num; i++) */
free (values);
return (status);
} /* }}} int mv_match */
void module_register (void)
{
match_proc_t mproc;
memset (&mproc, 0, sizeof (mproc));
mproc.create = mv_create;
mproc.destroy = mv_destroy;
mproc.match = mv_match;
fc_register_match ("value", mproc);
} /* module_register */
/* vim: set sw=2 sts=2 tw=78 et fdm=marker : */