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
|
/*
* 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 <err.h>
#include <bsnmp/asn1.h>
#include <bsnmp/snmp.h>
#include "rrdbotd.h"
#include "server-mainloop.h"
/* The socket to use */
static int snmp_socket = -1;
/* The last request: start at a strange number */
static uint32_t snmp_request = 0x0A0A0A0A;
/* Since we only deal with one packet at a time, global buffer */
static unsigned char snmp_buffer[0x1000];
/* -----------------------------------------------------------------------------
* CONSTANTS
*/
/* All SNMP error messages */
static struct
{
int code;
const char* msg;
} snmp_errmsgs[] = {
{ SNMP_ERR_NOERROR, "Success" },
{ SNMP_ERR_TOOBIG, "SNMP packet or response too big" },
{ SNMP_ERR_NOSUCHNAME, "Unknown variable name" },
{ SNMP_ERR_BADVALUE, "Incorrect syntax or value when modifing a variable" },
{ SNMP_ERR_READONLY, "Value is readonly" },
{ SNMP_ERR_GENERR, "Unspecified general error" },
{ SNMP_ERR_NO_ACCESS, "Access was denied to the object" },
{ SNMP_ERR_WRONG_TYPE, "The object type is incorrect for the object" },
{ SNMP_ERR_WRONG_LENGTH, "Incorrect specified for the object." },
{ SNMP_ERR_WRONG_ENCODING, "Incorrect encoding specified for the object." },
{ SNMP_ERR_WRONG_VALUE, "Not possible to set this value for the object." },
{ SNMP_ERR_NO_CREATION, "The value cannot be created." },
{ SNMP_ERR_INCONS_VALUE, "Not possible to set the value at this time." },
{ SNMP_ERR_RES_UNAVAIL, "The resource is not availeble" },
{ SNMP_ERR_COMMIT_FAILED, "Commit failed" },
{ SNMP_ERR_UNDO_FAILED, "Undo failed" },
{ SNMP_ERR_AUTH_ERR, "A problem occured during authentication" },
{ SNMP_ERR_NOT_WRITEABLE, "The variable cannot be written or created." },
{ SNMP_ERR_INCONS_NAME, "The variable does not exist." }
};
/* -----------------------------------------------------------------------------
* REQUESTS
*/
/* rb_request waaaaayyyyy too big */
typedef struct _rb_request
{
/* The SNMP request identifier */
uint32_t id;
mstime next_retry; /* Time of the next retry */
mstime interval; /* How long between retries */
mstime timeout; /* When this request times out */
uint sent; /* How many times we've sent */
/* The poller and host associated with this request */
rb_poller* poll;
const rb_host* host;
/* The actual request data */
struct snmp_pdu pdu;
}
rb_request;
/* a scrolling window on a loop */
static rb_request* requests = NULL;
static int reqhigh = -1;
static int reqlow = -1;
static uint nrequests = 0;
static rb_request*
new_req()
{
rb_request* req = NULL;
uint num;
int i, overlap = 0;
if(nrequests)
{
/* We allocate in a loop starting after the last allocation. */
for(i = (reqhigh + 1) % nrequests; i != reqhigh;
i = (i + 1) % nrequests)
{
/*
* We can overlap past reqlow, but in that case no
* updating reqhigh. This can happen after reallocating.
*/
if(i == reqlow)
overlap = 1;
if(requests[i].id == 0)
{
req = &(requests[i]);
if(!overlap)
reqhigh = i;
break;
}
}
}
if(!req)
{
/*
* A note about the scrolling window and extending allocations...
* The only reason this works is because whenever we reallocate
* reqhigh and reqlow are the same.
*/
ASSERT(reqlow == reqhigh);
/* Reallocate the request block */
/* TODO: Once we use less memory this can be higher */
num = nrequests ? nrequests * 2 : 32;
requests = (rb_request*)realloc(requests, sizeof(rb_request) * num);
if(!requests)
{
/* Note we leave old requests allocated */
errno = ENOMEM;
return NULL;
}
/* Clear out the new ones */
memset(requests + nrequests, 0, sizeof(rb_request) * (num - nrequests));
/* We return the next one */
req = requests + nrequests;
nrequests = num;
if(reqhigh == -1)
reqhigh = 0;
if(reqlow == -1)
reqlow = nrequests - 1;
}
/* A incrementing counter for each request */
req->id = snmp_request++;
return req;
}
static rb_request*
find_req(uint32_t id)
{
int i, first;
if(!nrequests)
return NULL;
/*
* Search backwards from the in the scrolling window. This gives
* us as high performance for the high performing pollers and
* less performance for the low ones.
*/
for(i = reqhigh, first = 1; first || i != reqlow;
i = (i ? i : nrequests) - 1)
{
if(id == requests[i].id)
return &(requests[i]);
first = 0;
}
return NULL;
}
static void
free_req(rb_request* req)
{
int i;
memset(req, 0, sizeof(*req));
/* Update the bottom of the scrolling loop */
for(i = reqlow; i != reqhigh; i = (i + 1) % nrequests)
{
/* If used then done */
if(requests[i].id)
break;
/* reqlow is not inclusive */
reqlow = i;
}
}
/* -----------------------------------------------------------------------------
* PACKET HANDLING
*/
static void
finish_poll(rb_poller* poll, mstime when)
{
#ifdef _DEBUG
{
rb_item* it;
for(it = poll->items; it; it = it->next)
ASSERT(!it->req);
}
#endif
/* Update the book-keeping */
poll->last_polled = when;
/* And send off our collection of values */
rb_rrd_update(poll);
}
static void
send_req(rb_request* req, mstime when)
{
struct asn_buf b;
ssize_t ret;
b.asn_ptr = snmp_buffer;
b.asn_len = sizeof(snmp_buffer);
if(snmp_pdu_encode(&(req->pdu), &b))
rb_message(LOG_CRIT, "couldn't encode snmp buffer");
else
{
ret = sendto(snmp_socket, snmp_buffer, b.asn_ptr - snmp_buffer, 0,
&SANY_ADDR(req->host->address), SANY_LEN(req->host->address));
if(ret == -1)
rb_message(LOG_ERR, "couldn't send snmp packet to: %s", req->host->name);
else
rb_messagex(LOG_DEBUG, "sent request '%d' to: %s", req->id, req->host->name);
}
/* And update our bookkeeping */
req->sent++;
if(req->sent <= g_state.retries)
req->next_retry = when + req->interval;
else
req->next_retry = 0;
}
static void
timeout_req(rb_request* req, mstime when)
{
rb_poller* poll = req->poll;
int incomplete = 0;
rb_item* it;
ASSERT(poll);
/*
* Marks of this requests items as unknown. Request is
* over, free. See if poller is done
*/
for(it = poll->items; it; it = it->next)
{
if(it->req == req)
{
rb_messagex(LOG_DEBUG, "value for field '%s' timed out", it->rrdfield);
it->vtype = VALUE_UNSET;
it->req = NULL;
}
else if(it->req)
incomplete = 1;
}
free_req(req);
if(!incomplete)
finish_poll(poll, when);
}
static void
check_req(rb_request* req, mstime when)
{
ASSERT(req->id);
/* See if it's timed out */
if(when >= req->timeout)
timeout_req(req, when);
if(!req->next_retry)
return;
/* Resend if necessary */
if(when >= req->next_retry)
send_req(req, when);
}
static void
respond_req(rb_request* req, struct snmp_pdu* pdu, mstime when)
{
struct snmp_value* value;
rb_poller* poll = req->poll;
rb_item* item;
int i;
ASSERT(req->id == pdu->request_id);
for(i = 0; i < pdu->nbindings; i++)
{
value = &(pdu->bindings[i]);
for(item = poll->items; item; item = item->next)
{
if(asn_compare_oid(&(value->var), &(item->snmpfield.var)) == 0)
{
const char *msg = NULL;
switch(value->syntax)
{
case SNMP_SYNTAX_NULL:
item->vtype = VALUE_UNSET;
break;
case SNMP_SYNTAX_INTEGER:
item->v.i_value = value->v.integer;
item->vtype = VALUE_REAL;
break;
case SNMP_SYNTAX_COUNTER:
case SNMP_SYNTAX_GAUGE:
case SNMP_SYNTAX_TIMETICKS:
item->v.i_value = value->v.uint32;
item->vtype = VALUE_REAL;
break;
case SNMP_SYNTAX_COUNTER64:
item->v.i_value = value->v.counter64;
item->vtype = VALUE_REAL;
break;
case SNMP_SYNTAX_OCTETSTRING:
case SNMP_SYNTAX_OID:
case SNMP_SYNTAX_IPADDRESS:
msg = "snmp server returned non numeric value for field: %s";
break;
case SNMP_SYNTAX_NOSUCHOBJECT:
case SNMP_SYNTAX_NOSUCHINSTANCE:
case SNMP_SYNTAX_ENDOFMIBVIEW:
msg = "field not available on snmp server: %s";
break;
default:
msg = "snmp server returned invalid or unsupported value for field: %s";
break;
}
if(msg)
rb_messagex(LOG_WARNING, msg, item->rrdfield);
else if(item->vtype == VALUE_REAL)
rb_messagex(LOG_DEBUG, "got value for field '%s': %.4lf",
item->rrdfield, item->v.i_value);
else if(item->vtype == VALUE_FLOAT)
rb_messagex(LOG_DEBUG, "got value for field '%s': %lld",
item->rrdfield, item->v.f_value);
else
rb_messagex(LOG_DEBUG, "got value for field '%s': U",
item->rrdfield);
/* Mark this value as done */
item->req = NULL;
break;
}
}
}
/* We're done with this request */
free_req(req);
/* Now see if the entire request is done */
for(item = poll->items; item; item = item->next)
{
if(item->req)
return;
}
/* And if so then hand off */
finish_poll(poll, when);
}
static int
poller_timer(mstime when, void* arg)
{
rb_poller* poll = (rb_poller*)arg;
const rb_host* last_host = NULL;
rb_request* req = NULL;
rb_item* it;
/*
* If the previous poll has not completed, then we count it
* as a timeout.
*/
for(it = poll->items; it; it = it->next)
{
if(it->req)
{
ASSERT(it->req->poll == poll);
timeout_req(it->req, when);
}
/* timeout_req above should have cleared this */
ASSERT(!it->req);
}
for(it = poll->items; it; it = it->next)
{
/*
* We assume that the polled items are sorted by host. Done
* in config.c. This allows us to fire off the least amount
* of requests. Generate new requests when:
*
* - first or new host
* - too many items in the same request
*/
if(!req || it->host != last_host ||
req->pdu.nbindings >= SNMP_MAX_BINDINGS)
{
/* Send off last request ... */
if(req)
send_req(req, when);
/* ... and make a new one */
req = new_req();
if(!req)
{
rb_message(LOG_CRIT, "couldn't allocate a new snmp request");
return 1;
}
req->poll = poll;
req->host = it->host;
/* rb_messagex(LOG_DEBUG, "preparing request '%d' for: %s@%s",
req->id, req->host->community, req->host->name); */
/* Setup the packet */
strlcpy(req->pdu.community, req->host->community, sizeof(req->pdu.community));
req->pdu.request_id = req->id;
req->pdu.version = req->host->version;
req->pdu.type = SNMP_PDU_GET;
req->pdu.error_status = 0;
req->pdu.error_index = 0;
req->pdu.nbindings = 0;
/* Send interval is 200 ms when poll interval is below 2 seconds */
req->interval = (poll->interval <= 2000) ? 200L : 600L;
/* Timeout is for the last packet sent, not first */
req->timeout = when + (req->interval * ((mstime)g_state.retries)) + poll->timeout;
req->sent = 0;
last_host = it->host;
}
/* Add an item to this request */
req->pdu.bindings[req->pdu.nbindings].var = it->snmpfield.var;
req->pdu.bindings[req->pdu.nbindings].syntax = it->snmpfield.syntax;
req->pdu.nbindings++;
/* Mark item as active by this request */
it->req = req;
it->vtype = VALUE_UNSET;
}
if(req)
send_req(req, when);
return 1;
}
static void
receive_resp(int fd, int type, void* arg)
{
char hostname[MAXPATHLEN];
struct sockaddr_any from;
struct snmp_pdu pdu;
struct asn_buf b;
rb_request* req;
const char* msg;
int len, ret, i;
int32_t ip;
ASSERT(snmp_socket == fd);
/* Read in the packet */
SANY_LEN(from) = sizeof(from);
len = recvfrom(snmp_socket, snmp_buffer, sizeof(snmp_buffer), 0,
&SANY_ADDR(from), &SANY_LEN(from));
if(len < 0)
{
if(errno != EAGAIN && errno != EWOULDBLOCK)
rb_message(LOG_ERR, "error receiving snmp packet from network");
return;
}
if(sock_any_ntop(&from, hostname, MAXPATHLEN, 0) == -1)
strcpy(hostname, "[UNKNOWN]");
/* Now parse the packet */
b.asn_ptr = snmp_buffer;
b.asn_len = len;
ret = snmp_pdu_decode(&b, &pdu, &ip);
if(ret != SNMP_CODE_OK)
{
rb_message(LOG_WARNING, "invalid snmp packet received from: %s", hostname);
return;
}
/* It needs to match something we're waiting for */
req = find_req(pdu.request_id);
if(!req)
{
rb_messagex(LOG_DEBUG, "received extra or delayed packet from: %s", hostname);
return;
}
/* Check for errors */
if(pdu.error_status != SNMP_ERR_NOERROR)
{
msg = NULL;
for(i = 0; i < countof(snmp_errmsgs); i++)
{
if(pdu.error_status == snmp_errmsgs[i].code)
{
rb_message(LOG_ERR, "snmp error from host '%s': %s",
hostname, snmp_errmsgs[i].msg);
return;
}
}
rb_message(LOG_ERR, "unknown snmp error from host '%s': %d",
hostname, pdu.error_status);
return;
}
if(pdu.version != req->pdu.version)
rb_message(LOG_WARNING, "wrong version snmp packet from: %s", hostname);
/* Dispatch the packet */
rb_messagex(LOG_DEBUG, "response to request '%d' from: %s", req->id, hostname);
respond_req(req, &pdu, server_get_time());
}
static int
resend_timer(mstime when, void* arg)
{
int i, first;
/* Search backwards through the scrolling window */
for(i = reqhigh, first = 1; first || i != reqlow;
i = (i ? i : nrequests) - 1, first = 0)
{
if(requests[i].id)
check_req(&(requests[i]), when);
}
return 1;
}
static int
prep_timer(mstime when, void* arg)
{
/*
* We don't prepare all timers at exactly the same time
* but we sort of randomly start the various timers. We're
* going to be hitting these over and over again, so there's
* lots of benefits to spreading them out randomly over a
* few seconds.
*/
rb_poller* poll;
int next;
/* All done? */
if(!arg)
return 0;
poll = (rb_poller*)arg;
if(server_timer(poll->interval, poller_timer, poll) == -1)
rb_message(LOG_CRIT, "couldn't setup poller timer");
/* Setup the next poller anywhere between 0 and 750 ms */
next = rand() % 750;
server_oneshot(next, prep_timer, poll->next);
return 0;
}
void
rb_snmp_engine_init()
{
struct sockaddr_in addr;
rb_request* req;
ASSERT(snmp_socket == -1);
snmp_socket = socket(PF_INET, SOCK_DGRAM, 0);
if(snmp_socket < 0)
err(1, "couldn't open snmp socket");
/* Get a random IPv4 UDP socket for client use */
memset(&addr, 0, sizeof(addr));
addr.sin_family = AF_INET;
if(bind(snmp_socket, (struct sockaddr*)&addr, sizeof(addr)) < 0)
err(1, "couldn't listen on port");
if (server_watch(snmp_socket, SERVER_READ, receive_resp, NULL) == -1)
err(1, "couldn't listen on socket");
/* Allocate some requests to make sure we have memory */
req = new_req();
if(!req)
err(1, "out of memory");
free_req(req);
/* Start the preparation timers for setting up randomly */
if(server_oneshot(100, prep_timer, g_state.polls) == -1)
err(1, "couldn't setup timer");
/* We fire off the resend timer every 1/5 second */
if(server_timer(200, resend_timer, NULL) == -1)
err(1, "couldn't setup timer");
}
void
rb_snmp_engine_uninit()
{
if(snmp_socket != -1)
{
server_unwatch(snmp_socket);
close(snmp_socket);
snmp_socket = -1;
}
if(requests)
{
free(requests);
nrequests = 0;
reqhigh = 0;
reqlow = 0;
}
}
|