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
|
/*
* Copyright (c) 2005, Nate Nielsen
* 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.
* * The names of contributors to this software may not be
* used to endorse or promote products derived from this
* software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "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 THE
* COPYRIGHT OWNER OR CONTRIBUTORS 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.
*
*
* CONTRIBUTORS
* Nate Nielsen <nielsen@memberwebs.com>
*
*/
#include "usuals.h"
#include <errno.h>
#include <unistd.h>
#include <syslog.h>
#include <dirent.h>
#include <string.h>
#include <err.h>
#include <mib/mib-parser.h>
#include "rrdbotd.h"
#include "config-parser.h"
/*
* These routines parse the configuration files and setup the in memory
* data structures. They're mostly run before becoming a daemon, and just
* exit on error.
*/
typedef struct _config_ctx
{
const char* confname;
uint interval;
uint timeout;
rb_item* items;
}
config_ctx;
/* -----------------------------------------------------------------------------
* STRINGS
*/
#define CONFIG_POLL "poll"
#define CONFIG_INTERVAL "interval"
#define CONFIG_TIMEOUT "timeout"
#define CONFIG_SOURCE "source"
#define CONFIG_SNMP "snmp"
#define FIELD_VALID "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ_-0123456789."
/* -----------------------------------------------------------------------------
* CONFIG LOADING
*/
static rb_item*
sort_items_by_host(rb_item *item)
{
rb_item *sort = NULL;
rb_item *cur;
rb_item *it;
while(item)
{
cur = item;
item = item->next;
cur->next = NULL;
/* First item */
if(!sort)
{
sort = cur;
continue;
}
/* Before first item */
else if(cur->host <= sort->host)
{
cur->next = sort;
sort = cur;
continue;
}
for(it = sort; it->next; it = it->next)
{
if(cur->host <= sort->next->host)
break;
}
ASSERT(it);
cur->next = it->next;
it->next = cur;
}
return sort;
}
static void
config_done(config_ctx* ctx)
{
char key[MAXPATHLEN];
rb_item* it;
rb_poller* poll;
char *t;
/* No polling specified */
if(!ctx->items)
return;
/* Make sure we found an interval */
if(ctx->interval == 0)
errx(2, "%s: no interval specified", ctx->confname);
if(ctx->timeout == 0)
ctx->timeout = g_state.timeout;
/* And a nice key for lookups */
snprintf(key, sizeof(key), "%d-%d:%s/%s.rrd", ctx->timeout,
ctx->interval, g_state.rrddir, ctx->confname);
key[sizeof(key) - 1] = 0;
/* See if we have one of these pollers already */
poll = (rb_poller*)hsh_get(g_state.poll_by_key, key, -1);
if(!poll)
{
poll = (rb_poller*)xcalloc(sizeof(*poll));
if(!hsh_set(g_state.poll_by_key, key, -1, poll))
errx(1, "out of memory");
strcpy(poll->key, key);
t = strchr(poll->key, ':');
ASSERT(t);
poll->rrdname = t + 1;
poll->interval = ctx->interval * 1000;
poll->timeout = ctx->timeout * 1000;
/* Add it to the main lists */
poll->next = g_state.polls;
g_state.polls = poll;
}
/* Get the last item and add to the list */
for(it = ctx->items; it->next; it = it->next)
it->poller = poll;
ASSERT(it);
it->poller = poll;
/* Add the items to this poller */
it->next = poll->items;
poll->items = sort_items_by_host(ctx->items);
/*
* This remains allocated for the life of the program as
* All the configuration strings are in this memory.
* This allows all the users of these strings not to worry
* about reallocating or freeing them
*/
/* Clear current config and get ready for next */
ctx->items = NULL;
ctx->interval = 0;
ctx->timeout = 0;
}
static rb_item*
parse_item(const char* field, char* uri, config_ctx *ctx)
{
rb_item *ritem;
rb_host *rhost;
const char *msg;
char* copy;
char* scheme;
char* host;
char* user;
char* path;
/* Parse the SNMP URI */
copy = strdup(uri);
msg = cfg_parse_uri(uri, &scheme, &host, &user, &path);
if(msg)
errx(2, "%s: %s: %s", ctx->confname, msg, copy);
free(copy);
ASSERT(host && path);
/* TODO: SNMP version support */
/* Currently we only support SNMP pollers */
if(strcmp(scheme, CONFIG_SNMP) != 0)
errx(2, "%s: invalid poll scheme: %s", ctx->confname, scheme);
/* TODO: THis code assumes all hosts have the same community
the lookups below won't work wehn host/community is different */
/* See if we can find an associated host */
rhost = (rb_host*)hsh_get(g_state.host_by_name, host, -1);
if(!rhost)
{
/* Make a new one if necessary */
rhost = (rb_host*)xcalloc(sizeof(*rhost));
if(!hsh_set(g_state.host_by_name, host, -1, rhost))
errx(1, "out of memory");
/* TODO: Version support */
rhost->version = 1;
rhost->name = host;
rhost->community = user ? user : "public";
/* TODO: Eventually resolving should be in a separate thread,
and done regularly */
if(sock_any_pton(host, &(rhost->address),
SANY_OPT_DEFPORT(161) | SANY_OPT_DEFLOCAL) == -1)
{
rb_message(LOG_WARNING, "couldn't resolve host address (ignoring): %s", host);
free(rhost);
return NULL;
}
/* And add it to the list */
rhost->next = g_state.hosts;
g_state.hosts = rhost;
}
/* Make a new item */
ritem = (rb_item*)xcalloc(sizeof(*ritem));
ritem->rrdfield = field;
ritem->host = rhost;
ritem->poller = NULL; /* Set later in config_done */
ritem->req = NULL;
ritem->vtype = VALUE_UNSET;
/* And parse the OID */
ritem->snmpfield.syntax = SNMP_SYNTAX_NULL;
memset(&(ritem->snmpfield.v), 0, sizeof(ritem->snmpfield.v));
if(mib_parse(path, &(ritem->snmpfield.var)) == -1)
errx(2, "%s: invalid MIB: %s", ctx->confname, path);
rb_messagex(LOG_DEBUG, "parsed MIB into oid: %s -> %s", path,
asn_oid2str(&(ritem->snmpfield.var)));
/* And add it to the list */
ritem->next = ctx->items;
ctx->items = ritem;
return ritem;
}
static void
config_value(const char* header, const char* name, char* value,
config_ctx* ctx)
{
char* suffix;
if(strcmp(header, CONFIG_POLL) != 0)
return;
if(strcmp(name, CONFIG_INTERVAL) == 0)
{
char* t;
int i;
if(ctx->interval > 0)
errx(2, "%s: " CONFIG_INTERVAL " specified twice: %s", ctx->confname, value);
i = strtol(value, &t, 10);
if(i < 1 || *t)
errx(2, "%s: " CONFIG_INTERVAL " must be a number (seconds) greater than zero: %s",
ctx->confname, value);
ctx->interval = (uint32_t)i;
return;
}
if(strcmp(name, CONFIG_TIMEOUT) == 0)
{
char* t;
int i;
if(ctx->timeout > 0)
errx(2, "%s: " CONFIG_TIMEOUT " specified twice: %s", ctx->confname, value);
i = strtol(value, &t, 10);
if(i < 1 || *t)
errx(2, "%s: " CONFIG_TIMEOUT " must be a a number (seconds) greater than zero: %s",
ctx->confname, value);
ctx->timeout = (uint32_t)i;
return;
}
/* Parse out suffix */
suffix = strchr(name, '.');
if(!suffix) /* Ignore unknown options */
return;
*suffix = 0;
suffix++;
/* If it starts with "field." */
if(strcmp(suffix, CONFIG_SOURCE) == 0)
{
const char* t;
/* Check the name */
t = name + strspn(name, FIELD_VALID);
if(*t)
errx(2, "%s: the '%s' field name must only contain characters, digits, underscore and dash",
ctx->confname, name);
/* Parse out the field */
parse_item(name, value, ctx);
}
}
void
rb_config_parse()
{
config_ctx ctx;
/* Setup the hash tables properly */
g_state.poll_by_key = hsh_create();
g_state.host_by_name = hsh_create();
memset(&ctx, 0, sizeof(ctx));
if(cfg_parse_dir(g_state.confdir, &ctx) == -1)
exit(2); /* message already printed */
if(!g_state.polls)
errx(1, "no config files found in config directory: %s", g_state.confdir);
}
/* -----------------------------------------------------------------------------
* CONFIG CALLBACKS
*/
int
cfg_value(const char* filename, const char* header, const char* name,
char* value, void* data)
{
config_ctx* ctx = (config_ctx*)data;
ASSERT(filename);
ASSERT(ctx);
/* A little setup where necessary */
if(!ctx->confname)
ctx->confname = filename;
/* Called like this after each file */
if(!header)
{
config_done(ctx);
ctx->confname = NULL;
return 0;
}
ASSERT(ctx->confname);
ASSERT(name && value && header);
rb_messagex(LOG_DEBUG, "config: %s: [%s] %s = %s",
ctx->confname, header, name, value);
config_value(header, name, value, ctx);
return 0;
}
int
cfg_error(const char* filename, const char* errmsg, void* data)
{
/* Just exit on errors */
errx(2, "%s", errmsg);
return 0;
}
/* -----------------------------------------------------------------------------
* FREEING MEMORY
*/
static void
free_items(rb_item* item)
{
rb_item* next;
for(; item; item = next)
{
next = item->next;
free(item);
}
}
static void
free_hosts(rb_host* host)
{
rb_host* next;
for(; host; host = next)
{
next = host->next;
free(host);
}
}
static void
free_pollers(rb_poller* poll)
{
rb_poller* next;
for(; poll; poll = next)
{
free_items(poll->items);
next = poll->next;
free(poll);
}
}
void
rb_config_free()
{
hsh_free(g_state.poll_by_key);
hsh_free(g_state.host_by_name);
free_hosts(g_state.hosts);
/* Note that rb_item's are owned by pollers */
free_pollers(g_state.polls);
}
|