commit
2a56a66bb9
@ -0,0 +1,5 @@
|
||||
*.o
|
||||
*.so
|
||||
*.d
|
||||
sammler
|
||||
sammler.log
|
||||
@ -0,0 +1,30 @@
|
||||
# Toplevel Makefile
|
||||
|
||||
SAMMLER_SRC := sammler.c config.c logging.c rrdtool.c plugins.c
|
||||
PLUGIN_SRC := $(wildcard p_*.c)
|
||||
CFLAGS := -O2 -Wall
|
||||
LDFLAGS := -ldl -lrrd -rdynamic
|
||||
|
||||
# ############################
|
||||
|
||||
all: sammler $(PLUGIN_SRC:%.c=%.so)
|
||||
|
||||
sammler: $(SAMMLER_SRC:%.c=%.o)
|
||||
$(CC) $(LDFLAGS) $^ -o $@
|
||||
|
||||
%.d: %.c
|
||||
$(CC) $(CFLAGS) -MM -c $< -o $@
|
||||
|
||||
%.o: %.c
|
||||
$(CC) $(CFLAGS) -o $@ -c $<
|
||||
|
||||
%_sh.o: %.c
|
||||
$(CC) $(CFLAGS) -fPIC -o $@ -c $<
|
||||
|
||||
%.so: %_sh.o
|
||||
$(LD) -shared -o $@ $<
|
||||
|
||||
clean:
|
||||
rm -rf *.d *.o *.so sammler
|
||||
|
||||
#-include $(SAMMLER_SRC:.c=.d) $(PLUGIN_SRC:.c=.d)
|
||||
@ -0,0 +1,182 @@
|
||||
/***************************************************************************
|
||||
* Copyright (C) 06/2006 by Olaf Rempel *
|
||||
* razzor@kopf-tisch.de *
|
||||
* *
|
||||
* 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; either version 2 of the License, or *
|
||||
* (at your option) any later version. *
|
||||
* *
|
||||
* 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., *
|
||||
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
|
||||
***************************************************************************/
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <unistd.h>
|
||||
|
||||
#include "list.h"
|
||||
|
||||
#include "config.h"
|
||||
#include "logging.h"
|
||||
|
||||
static LIST_HEAD(config_list);
|
||||
|
||||
static struct conf_section * config_add_section(char *name)
|
||||
{
|
||||
struct conf_section *section;
|
||||
|
||||
if (!name)
|
||||
return NULL;
|
||||
|
||||
section = malloc(sizeof(struct conf_section));
|
||||
if (section) {
|
||||
INIT_LIST_HEAD(§ion->list);
|
||||
INIT_LIST_HEAD(§ion->tupel);
|
||||
|
||||
strncpy(section->name, name, sizeof(section->name));
|
||||
list_add_tail(§ion->list, &config_list);
|
||||
}
|
||||
return section;
|
||||
}
|
||||
|
||||
static int config_add_tupel(struct conf_section *section, char *option, char *parameter)
|
||||
{
|
||||
struct conf_tupel *tupel;
|
||||
|
||||
if (!section || !option || !parameter)
|
||||
return 0;
|
||||
|
||||
if (!(tupel = malloc(sizeof(struct conf_tupel))))
|
||||
return 0;
|
||||
|
||||
INIT_LIST_HEAD(&tupel->list);
|
||||
|
||||
tupel->option = strdup(option);
|
||||
tupel->parameter = strdup(parameter);
|
||||
|
||||
list_add_tail(&tupel->list, §ion->tupel);
|
||||
return 1;
|
||||
}
|
||||
|
||||
static void config_free(void)
|
||||
{
|
||||
struct conf_section *section, *section_tmp;
|
||||
struct conf_tupel *tupel, *tupel_tmp;
|
||||
|
||||
list_for_each_entry_safe(section, section_tmp, &config_list, list) {
|
||||
list_for_each_entry_safe(tupel, tupel_tmp, §ion->tupel, list) {
|
||||
list_del(&tupel->list);
|
||||
free(tupel->option);
|
||||
free(tupel->parameter);
|
||||
free(tupel);
|
||||
}
|
||||
list_del(§ion->list);
|
||||
free(section);
|
||||
}
|
||||
}
|
||||
|
||||
int config_parse(char *config)
|
||||
{
|
||||
struct conf_section *section = NULL;
|
||||
FILE *fz;
|
||||
int i = 0, ret = 1;
|
||||
char *row, *tok, *tok2;
|
||||
|
||||
if (!config)
|
||||
return 0;
|
||||
|
||||
if (!(row = malloc(1024)))
|
||||
return 0;
|
||||
|
||||
if (!(fz = fopen(config, "r"))) {
|
||||
log_print(LOG_ERROR, "config_parse(): %s", config);
|
||||
return 0;
|
||||
}
|
||||
|
||||
while (fgets(row, 1024, fz)) {
|
||||
i++;
|
||||
|
||||
if (row[0] == '#' || row[0] <= ' ') {
|
||||
continue;
|
||||
|
||||
} else if (row[0] == '[') {
|
||||
tok = strtok(row +1, " ]\n");
|
||||
section = config_add_section(tok);
|
||||
if (!section) {
|
||||
log_print(LOG_WARN, "config_parse(): invalid section in row %d", i);
|
||||
ret = 0;
|
||||
break;
|
||||
}
|
||||
continue;
|
||||
|
||||
} else if (!section) {
|
||||
log_print(LOG_WARN, "config_parse(): missing section in row %d", i);
|
||||
ret = 0;
|
||||
break;
|
||||
}
|
||||
|
||||
if ((tok = strtok(row, " \n")) && (tok2 = strtok(NULL, " \n")))
|
||||
if (!config_add_tupel(section, tok, tok2))
|
||||
log_print(LOG_WARN, "config_parse(): invalid row %d", i);
|
||||
}
|
||||
|
||||
fclose(fz);
|
||||
free(row);
|
||||
|
||||
if (atexit(config_free) != 0) {
|
||||
log_print(LOG_ERROR, "config_parse(): atexit()");
|
||||
return 0;
|
||||
}
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
struct conf_section * config_get_section(char *name)
|
||||
{
|
||||
struct conf_section *section;
|
||||
|
||||
list_for_each_entry(section, &config_list, list) {
|
||||
if (!strcmp(section->name, name))
|
||||
return section;
|
||||
}
|
||||
return NULL;
|
||||
}
|
||||
|
||||
char * config_get_parameter(struct conf_section *section, char *option)
|
||||
{
|
||||
struct conf_tupel *tupel;
|
||||
|
||||
list_for_each_entry(tupel, §ion->tupel, list) {
|
||||
if (!strcmp(tupel->option, option))
|
||||
return tupel->parameter;
|
||||
}
|
||||
return NULL;
|
||||
}
|
||||
|
||||
char * config_get_string(char *section, char *option, char *def)
|
||||
{
|
||||
struct conf_section *tmp;
|
||||
char *ret;
|
||||
|
||||
tmp = config_get_section(section);
|
||||
if (tmp && (ret = config_get_parameter(tmp, option)))
|
||||
return ret;
|
||||
|
||||
return def;
|
||||
}
|
||||
|
||||
int config_get_int(char *section, char *option, int def)
|
||||
{
|
||||
char *ret;
|
||||
|
||||
ret = config_get_string(section, option, NULL);
|
||||
return ret ? atoi(ret) : def;
|
||||
}
|
||||
@ -0,0 +1,24 @@
|
||||
#ifndef _CONFIG_H_
|
||||
#define _CONFIG_H_
|
||||
|
||||
#include "list.h"
|
||||
|
||||
struct conf_section {
|
||||
struct list_head list;
|
||||
char name[32];
|
||||
struct list_head tupel;
|
||||
};
|
||||
|
||||
struct conf_tupel {
|
||||
struct list_head list;
|
||||
char *option;
|
||||
char *parameter;
|
||||
};
|
||||
|
||||
int config_parse(char *config);
|
||||
struct conf_section * config_get_section(char *name);
|
||||
char * config_get_parameter(struct conf_section *section, char *option);
|
||||
char * config_get_string(char *section, char *option, char *def);
|
||||
int config_get_int(char *section, char *option, int def);
|
||||
|
||||
#endif /* _CONFIG_H_ */
|
||||
@ -0,0 +1,268 @@
|
||||
#ifndef _LIST_H_
|
||||
#define _LIST_H_
|
||||
|
||||
/*
|
||||
* stolen from linux kernel 2.6.11 (http://kernel.org/)
|
||||
* linux/include/linux/stddef.h (offsetoff)
|
||||
* linux/include/linux/kernel.h (container_of)
|
||||
* linux/include/linux/list.h (*list*)
|
||||
* linux/include/linux/netfilter_ipv4/listhelp.h (LIST_FIND)
|
||||
*
|
||||
* modified by Olaf Rempel <razzor@kopf-tisch.de>
|
||||
*/
|
||||
#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
|
||||
|
||||
#define container_of(ptr, type, member) ({ \
|
||||
const typeof( ((type *)0)->member ) *__mptr = (ptr); \
|
||||
(type *)( (char *)__mptr - offsetof(type,member) );})
|
||||
|
||||
struct list_head {
|
||||
struct list_head *next, *prev;
|
||||
};
|
||||
|
||||
#define LIST_HEAD_INIT(name) { &(name), &(name) }
|
||||
|
||||
#define LIST_HEAD(name) \
|
||||
struct list_head name = LIST_HEAD_INIT(name)
|
||||
|
||||
#define INIT_LIST_HEAD(ptr) do { \
|
||||
(ptr)->next = (ptr); (ptr)->prev = (ptr); \
|
||||
} while (0)
|
||||
|
||||
/*
|
||||
* Insert a new entry between two known consecutive entries.
|
||||
*
|
||||
* This is only for internal list manipulation where we know
|
||||
* the prev/next entries already!
|
||||
*/
|
||||
static inline void __list_add(struct list_head *new,
|
||||
struct list_head *prev,
|
||||
struct list_head *next)
|
||||
{
|
||||
next->prev = new;
|
||||
new->next = next;
|
||||
new->prev = prev;
|
||||
prev->next = new;
|
||||
}
|
||||
|
||||
/*
|
||||
* list_add - add a new entry
|
||||
* @new: new entry to be added
|
||||
* @head: list head to add it after
|
||||
*
|
||||
* Insert a new entry after the specified head.
|
||||
* This is good for implementing stacks.
|
||||
*/
|
||||
static inline void list_add(struct list_head *new, struct list_head *head)
|
||||
{
|
||||
__list_add(new, head, head->next);
|
||||
}
|
||||
|
||||
/*
|
||||
* list_add_tail - add a new entry
|
||||
* @new: new entry to be added
|
||||
* @head: list head to add it before
|
||||
*
|
||||
* Insert a new entry before the specified head.
|
||||
* This is useful for implementing queues.
|
||||
*/
|
||||
static inline void list_add_tail(struct list_head *new, struct list_head *head)
|
||||
{
|
||||
__list_add(new, head->prev, head);
|
||||
}
|
||||
|
||||
/*
|
||||
* Delete a list entry by making the prev/next entries
|
||||
* point to each other.
|
||||
*
|
||||
* This is only for internal list manipulation where we know
|
||||
* the prev/next entries already!
|
||||
*/
|
||||
static inline void __list_del(struct list_head * prev, struct list_head * next)
|
||||
{
|
||||
next->prev = prev;
|
||||
prev->next = next;
|
||||
}
|
||||
|
||||
/*
|
||||
* list_del - deletes entry from list.
|
||||
* @entry: the element to delete from the list.
|
||||
* Note: list_empty on entry does not return true after this, the entry is
|
||||
* in an undefined state.
|
||||
*/
|
||||
static inline void list_del(struct list_head *entry)
|
||||
{
|
||||
__list_del(entry->prev, entry->next);
|
||||
entry->next = NULL;
|
||||
entry->prev = NULL;
|
||||
}
|
||||
|
||||
/*
|
||||
* list_del_init - deletes entry from list and reinitialize it.
|
||||
* entry: the element to delete from the list.
|
||||
*/
|
||||
static inline void list_del_init(struct list_head *entry)
|
||||
{
|
||||
__list_del(entry->prev, entry->next);
|
||||
INIT_LIST_HEAD(entry);
|
||||
}
|
||||
|
||||
/*
|
||||
* list_move - delete from one list and add as another's head
|
||||
* @list: the entry to move
|
||||
* @head: the head that will precede our entry
|
||||
*/
|
||||
static inline void list_move(struct list_head *list, struct list_head *head)
|
||||
{
|
||||
__list_del(list->prev, list->next);
|
||||
list_add(list, head);
|
||||
}
|
||||
|
||||
/*
|
||||
* list_move_tail - delete from one list and add as another's tail
|
||||
* @list: the entry to move
|
||||
* @head: the head that will follow our entry
|
||||
*/
|
||||
static inline void list_move_tail(struct list_head *list,
|
||||
struct list_head *head)
|
||||
{
|
||||
__list_del(list->prev, list->next);
|
||||
list_add_tail(list, head);
|
||||
}
|
||||
|
||||
/*
|
||||
* list_empty - tests whether a list is empty
|
||||
* @head: the list to test.
|
||||
*/
|
||||
static inline int list_empty(const struct list_head *head)
|
||||
{
|
||||
return head->next == head;
|
||||
}
|
||||
|
||||
static inline void __list_splice(struct list_head *list,
|
||||
struct list_head *head)
|
||||
{
|
||||
struct list_head *first = list->next;
|
||||
struct list_head *last = list->prev;
|
||||
struct list_head *at = head->next;
|
||||
|
||||
first->prev = head;
|
||||
head->next = first;
|
||||
|
||||
last->next = at;
|
||||
at->prev = last;
|
||||
}
|
||||
|
||||
/*
|
||||
* list_splice - join two lists
|
||||
* @list: the new list to add.
|
||||
* @head: the place to add it in the first list.
|
||||
*/
|
||||
static inline void list_splice(struct list_head *list, struct list_head *head)
|
||||
{
|
||||
if (!list_empty(list))
|
||||
__list_splice(list, head);
|
||||
}
|
||||
|
||||
/*
|
||||
* list_splice_init - join two lists and reinitialise the emptied list.
|
||||
* @list: the new list to add.
|
||||
* @head: the place to add it in the first list.
|
||||
*
|
||||
* The list at @list is reinitialised
|
||||
*/
|
||||
static inline void list_splice_init(struct list_head *list,
|
||||
struct list_head *head)
|
||||
{
|
||||
if (!list_empty(list)) {
|
||||
__list_splice(list, head);
|
||||
INIT_LIST_HEAD(list);
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* list_entry - get the struct for this entry
|
||||
* @ptr: the &struct list_head pointer.
|
||||
* @type: the type of the struct this is embedded in.
|
||||
* @member: the name of the list_struct within the struct.
|
||||
*/
|
||||
#define list_entry(ptr, type, member) \
|
||||
container_of(ptr, type, member)
|
||||
|
||||
/*
|
||||
* list_for_each - iterate over a list
|
||||
* @pos: the &struct list_head to use as a loop counter.
|
||||
* @head: the head for your list.
|
||||
*/
|
||||
#define list_for_each(pos, head) \
|
||||
for (pos = (head)->next; pos != (head); pos = pos->next)
|
||||
|
||||
/*
|
||||
* list_for_each_prev - iterate over a list backwards
|
||||
* @pos: the &struct list_head to use as a loop counter.
|
||||
* @head: the head for your list.
|
||||
*/
|
||||
#define list_for_each_prev(pos, head) \
|
||||
for (pos = (head)->prev; pos != (head); pos = pos->prev)
|
||||
|
||||
/*
|
||||
* list_for_each_safe - iterate over a list safe against removal of list entry
|
||||
* @pos: the &struct list_head to use as a loop counter.
|
||||
* @n: another &struct list_head to use as temporary storage
|
||||
* @head: the head for your list.
|
||||
*/
|
||||
#define list_for_each_safe(pos, n, head) \
|
||||
for (pos = (head)->next, n = pos->next; pos != (head); \
|
||||
pos = n, n = pos->next)
|
||||
|
||||
/*
|
||||
* list_for_each_entry - iterate over list of given type
|
||||
* @pos: the type * to use as a loop counter.
|
||||
* @head: the head for your list.
|
||||
* @member: the name of the list_struct within the struct.
|
||||
*/
|
||||
#define list_for_each_entry(pos, head, member) \
|
||||
for (pos = list_entry((head)->next, typeof(*pos), member); \
|
||||
&pos->member != (head); \
|
||||
pos = list_entry(pos->member.next, typeof(*pos), member))
|
||||
|
||||
/*
|
||||
* list_for_each_entry_reverse - iterate backwards over list of given type.
|
||||
* @pos: the type * to use as a loop counter.
|
||||
* @head: the head for your list.
|
||||
* @member: the name of the list_struct within the struct.
|
||||
*/
|
||||
#define list_for_each_entry_reverse(pos, head, member) \
|
||||
for (pos = list_entry((head)->prev, typeof(*pos), member); \
|
||||
&pos->member != (head); \
|
||||
pos = list_entry(pos->member.prev, typeof(*pos), member))
|
||||
|
||||
/*
|
||||
* list_for_each_entry_safe - iterate over list of given type safe against removal of list entry
|
||||
* @pos: the type * to use as a loop counter.
|
||||
* @n: another type * to use as temporary storage
|
||||
* @head: the head for your list.
|
||||
* @member: the name of the list_struct within the struct.
|
||||
*/
|
||||
#define list_for_each_entry_safe(pos, n, head, member) \
|
||||
for (pos = list_entry((head)->next, typeof(*pos), member), \
|
||||
n = list_entry(pos->member.next, typeof(*pos), member); \
|
||||
&pos->member != (head); \
|
||||
pos = n, n = list_entry(n->member.next, typeof(*n), member))
|
||||
|
||||
|
||||
/* Return pointer to first true entry, if any, or NULL. A macro
|
||||
required to allow inlining of cmpfn. */
|
||||
#define LIST_FIND(head, cmpfn, type, args...) \
|
||||
({ \
|
||||
const struct list_head *__i, *__j = NULL; \
|
||||
\
|
||||
list_for_each(__i, (head)) \
|
||||
if (cmpfn((const type)__i , ## args)) { \
|
||||
__j = __i; \
|
||||
break; \
|
||||
} \
|
||||
(type)__j; \
|
||||
})
|
||||
|
||||
#endif /* _LIST_H_ */
|
||||
@ -0,0 +1,103 @@
|
||||
/***************************************************************************
|
||||
* Copyright (C) 06/2006 by Olaf Rempel *
|
||||
* razzor@kopf-tisch.de *
|
||||
* *
|
||||
* 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; either version 2 of the License, or *
|
||||
* (at your option) any later version. *
|
||||
* *
|
||||
* 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., *
|
||||
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
|
||||
***************************************************************************/
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <time.h>
|
||||
#include <stdarg.h>
|
||||
#include <errno.h>
|
||||
#include <string.h>
|
||||
|
||||
#include "logging.h"
|
||||
|
||||
#define BUFSIZE 8192
|
||||
|
||||
static FILE *log_fd = NULL;
|
||||
static char *buffer = NULL;
|
||||
|
||||
void log_print(int prio, const char *fmt, ...)
|
||||
{
|
||||
va_list az;
|
||||
int len;
|
||||
|
||||
if (buffer == NULL) {
|
||||
buffer = malloc(BUFSIZE);
|
||||
if (buffer == NULL) {
|
||||
fprintf(stderr, "log_print: out of memory\nBailing out!\n");
|
||||
exit(-1);
|
||||
}
|
||||
}
|
||||
|
||||
va_start(az, fmt);
|
||||
len = vsnprintf(buffer, BUFSIZE, fmt, az);
|
||||
va_end(az);
|
||||
|
||||
if (len >= BUFSIZE) {
|
||||
log_print(LOG_ERROR, "log_print: arguments too long");
|
||||
errno = 0;
|
||||
return;
|
||||
}
|
||||
|
||||
if (errno) {
|
||||
strncpy(buffer + len, ": ", BUFSIZE - len);
|
||||
len += 2;
|
||||
strncpy(buffer + len, strerror(errno), BUFSIZE - len);
|
||||
}
|
||||
|
||||
if (log_fd) {
|
||||
char tbuf[64];
|
||||
time_t tzgr;
|
||||
|
||||
time(&tzgr);
|
||||
strftime(tbuf, sizeof(tbuf), "%b %d %H:%M:%S :", localtime(&tzgr));
|
||||
|
||||
fprintf(log_fd, "%s %s\n", tbuf, buffer);
|
||||
fflush(log_fd);
|
||||
|
||||
} else {
|
||||
fprintf(stderr, "%s\n", buffer);
|
||||
}
|
||||
|
||||
errno = 0;
|
||||
}
|
||||
|
||||
static void log_close(void)
|
||||
{
|
||||
if (buffer)
|
||||
free(buffer);
|
||||
|
||||
fclose(log_fd);
|
||||
}
|
||||
|
||||
int log_init(char *logfile)
|
||||
{
|
||||
log_fd = fopen(logfile, "a");
|
||||
if (log_fd == NULL) {
|
||||
log_print(LOG_ERROR, "log_open('%s'): %s", logfile);
|
||||
return 0;
|
||||
}
|
||||
|
||||
if (atexit(log_close) != 0) {
|
||||
log_print(LOG_ERROR, "log_open(): atexit()");
|
||||
return 0;
|
||||
}
|
||||
|
||||
log_print(LOG_EVERYTIME, "==========================");
|
||||
return 1;
|
||||
}
|
||||
@ -0,0 +1,16 @@
|
||||
#ifndef _LOGGING_H_
|
||||
#define _LOGGING_H_
|
||||
|
||||
#define LOG_DEBUG 5
|
||||
#define LOG_INFO 4
|
||||
#define LOG_NOTICE 3
|
||||
#define LOG_WARN 2
|
||||
#define LOG_ERROR 1
|
||||
#define LOG_CRIT 0
|
||||
|
||||
#define LOG_EVERYTIME 0
|
||||
|
||||
int log_init(char *logfile);
|
||||
void log_print(int prio, const char *fmt, ... );
|
||||
|
||||
#endif /* _LOGGING_H_ */
|
||||
@ -0,0 +1,105 @@
|
||||
/***************************************************************************
|
||||
* Copyright (C) 06/2006 by Olaf Rempel *
|
||||
* razzor@kopf-tisch.de *
|
||||
* *
|
||||
* 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; either version 2 of the License, or *
|
||||
* (at your option) any later version. *
|
||||
* *
|
||||
* 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., *
|
||||
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
|
||||
***************************************************************************/
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
#include "plugins.h"
|
||||
|
||||
#define BUFSIZE 1024
|
||||
|
||||
struct sammler_plugin plugin;
|
||||
|
||||
static char *ds_def[] = {
|
||||
"DS:entries:GAUGE:%d:0:U",
|
||||
"DS:searched:DERIVE:%d:0:U",
|
||||
"DS:found:DERIVE:%d:0:U",
|
||||
"DS:new:DERIVE:%d:0:U",
|
||||
"DS:invalid:DERIVE:%d:0:U",
|
||||
"DS:ignore:DERIVE:%d:0:U",
|
||||
"DS:delete:DERIVE:%d:0:U",
|
||||
"DS:delete_list:DERIVE:%d:0:U",
|
||||
"DS:insert:DERIVE:%d:0:U",
|
||||
"DS:insert_failed:DERIVE:%d:0:U",
|
||||
"DS:drop:DERIVE:%d:0:U",
|
||||
"DS:early_drop:DERIVE:%d:0:U",
|
||||
"DS:icmp_error:DERIVE:%d:0:U",
|
||||
"DS:expect_new:DERIVE:%d:0:U",
|
||||
"DS:expect_create:DERIVE:%d:0:U",
|
||||
"DS:expect_delete:DERIVE:%d:0:U",
|
||||
NULL
|
||||
};
|
||||
|
||||
static char ** get_ds(int ds_id)
|
||||
{
|
||||
return ds_def;
|
||||
}
|
||||
|
||||
static void probe(void)
|
||||
{
|
||||
FILE *fp;
|
||||
char *buffer, *val[16], filename[16];
|
||||
unsigned long long arr[16];
|
||||
int i, cpu = 0;
|
||||
|
||||
buffer = malloc(BUFSIZE);
|
||||
if (buffer == NULL) {
|
||||
log_print(LOG_WARN, "plugin ctstat: out of memory");
|
||||
return;
|
||||
}
|
||||
|
||||
fp = fopen("/proc/net/stat/ip_conntrack", "r");
|
||||
if (fp == NULL) {
|
||||
log_print(LOG_WARN, "plugin ctstat");
|
||||
free(buffer);
|
||||
return;
|
||||
}
|
||||
|
||||
while (fgets(buffer, BUFSIZE, fp) != NULL) {
|
||||
if (!strncmp(buffer, "entries", 7))
|
||||
continue;
|
||||
|
||||
if (strsplit(buffer, val, 16) != 16)
|
||||
continue;
|
||||
|
||||
for (i = 0; i < 16; i++)
|
||||
arr[i] = strtoll(val[i], NULL, 16);
|
||||
|
||||
snprintf(filename, sizeof(filename), "ctstat-%d.rrd", cpu);
|
||||
|
||||
probe_submit(&plugin, filename, 0,
|
||||
"%llu:%llu:%llu:%llu:%llu:%llu:%llu:%llu:%llu:%llu:%llu:%llu:%llu:%llu:%llu:%llu",
|
||||
arr[0], arr[1], arr[2], arr[3],
|
||||
arr[4], arr[5], arr[6], arr[7],
|
||||
arr[8], arr[9], arr[10], arr[11],
|
||||
arr[12], arr[13], arr[14], arr[15]);
|
||||
|
||||
cpu++;
|
||||
}
|
||||
fclose(fp);
|
||||
free(buffer);
|
||||
}
|
||||
|
||||
struct sammler_plugin plugin = {
|
||||
.name = "ctstat",
|
||||
.version = 1,
|
||||
.probe = &probe,
|
||||
.get_ds = &get_ds,
|
||||
};
|
||||
@ -0,0 +1,70 @@
|
||||
/***************************************************************************
|
||||
* Copyright (C) 06/2006 by Olaf Rempel *
|
||||
* razzor@kopf-tisch.de *
|
||||
* *
|
||||
* 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; either version 2 of the License, or *
|
||||
* (at your option) any later version. *
|
||||
* *
|
||||
* 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., *
|
||||
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
|
||||
***************************************************************************/
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include "plugins.h"
|
||||
|
||||
struct sammler_plugin plugin;
|
||||
|
||||
static char *ds_def[] = {
|
||||
"DS:1min:GAUGE:%d:0:U",
|
||||
"DS:5min:GAUGE:%d:0:U",
|
||||
"DS:15min:GAUGE:%d:0:U",
|
||||
NULL
|
||||
};
|
||||
|
||||
static char ** get_ds(int ds_id)
|
||||
{
|
||||
return ds_def;
|
||||
}
|
||||
|
||||
static void probe(void)
|
||||
{
|
||||
FILE *fp;
|
||||
char buffer[32];
|
||||
char *val[3];
|
||||
|
||||
fp = fopen("/proc/loadavg", "r");
|
||||
if (fp == NULL) {
|
||||
log_print(LOG_WARN, "plugin load");
|
||||
return;
|
||||
}
|
||||
|
||||
if (fgets(buffer, sizeof(buffer), fp) == NULL) {
|
||||
log_print(LOG_WARN, "plugin load");
|
||||
fclose(fp);
|
||||
return;
|
||||
}
|
||||
|
||||
fclose(fp);
|
||||
|
||||
if (strsplit(buffer, val, 3) != 3)
|
||||
return;
|
||||
|
||||
probe_submit(&plugin, "load.rrd", 0, "%s:%s:%s", val[0], val[1], val[2]);
|
||||
}
|
||||
|
||||
struct sammler_plugin plugin = {
|
||||
.name = "load",
|
||||
.version = 1,
|
||||
.probe = &probe,
|
||||
.get_ds = &get_ds,
|
||||
};
|
||||
@ -0,0 +1,125 @@
|
||||
/***************************************************************************
|
||||
* Copyright (C) 06/2006 by Olaf Rempel *
|
||||
* razzor@kopf-tisch.de *
|
||||
* *
|
||||
* 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; either version 2 of the License, or *
|
||||
* (at your option) any later version. *
|
||||
* *
|
||||
* 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., *
|
||||
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
|
||||
***************************************************************************/
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
#include "plugins.h"
|
||||
|
||||
#define BUFSIZE 1024
|
||||
|
||||
#define DS_MEMORY 1
|
||||
#define DS_SWAP 2
|
||||
|
||||
struct sammler_plugin plugin;
|
||||
|
||||
static char *mem_ds_def[] = {
|
||||
"DS:total:GAUGE:%d:0:U",
|
||||
"DS:free:GAUGE:%d:0:U",
|
||||
"DS:buffers:GAUGE:%d:0:U",
|
||||
"DS:cached:GAUGE:%d:0:U",
|
||||
NULL
|
||||
};
|
||||
|
||||
static char *swap_ds_def[] = {
|
||||
"DS:total:GAUGE:%d:0:U",
|
||||
"DS:free:GAUGE:%d:0:U",
|
||||
NULL
|
||||
};
|
||||
|
||||
static char ** get_ds(int ds_id)
|
||||
{
|
||||
switch (ds_id) {
|
||||
case DS_MEMORY:
|
||||
return mem_ds_def;
|
||||
|
||||
case DS_SWAP:
|
||||
return swap_ds_def;
|
||||
|
||||
default:
|
||||
return NULL;
|
||||
}
|
||||
}
|
||||
|
||||
struct meminfo_ {
|
||||
unsigned long long memtotal;
|
||||
unsigned long long memfree;
|
||||
unsigned long long buffers;
|
||||
unsigned long long cached;
|
||||
unsigned long long swaptotal;
|
||||
unsigned long long swapfree;
|
||||
};
|
||||
|
||||
static void probe(void)
|
||||
{
|
||||
FILE *fp;
|
||||
char *buffer;
|
||||
struct meminfo_ meminfo;
|
||||
|
||||
buffer = malloc(BUFSIZE);
|
||||
if (buffer == NULL) {
|
||||
log_print(LOG_WARN, "plugin memory: out of memory");
|
||||
return;
|
||||
}
|
||||
|
||||
fp = fopen("/proc/meminfo", "r");
|
||||
if (fp == NULL) {
|
||||
log_print(LOG_WARN, "plugin memory");
|
||||
free(buffer);
|
||||
return;
|
||||
}
|
||||
|
||||
while (fgets(buffer, BUFSIZE, fp) != NULL) {
|
||||
if (!strncmp(buffer, "MemTotal:", 9))
|
||||
meminfo.memtotal = atoll(buffer + 10);
|
||||
|
||||
else if (!strncmp(buffer, "MemFree:", 8))
|
||||
meminfo.memfree = atoll(buffer + 9);
|
||||
|
||||
else if (!strncmp(buffer, "Buffers:", 8))
|
||||
meminfo.buffers = atoll(buffer + 9);
|
||||
|
||||
else if (!strncmp(buffer, "Cached:", 7))
|
||||
meminfo.cached = atoll(buffer + 8);
|
||||
|
||||
else if (!strncmp(buffer, "SwapTotal:", 10))
|
||||
meminfo.swaptotal = atoll(buffer + 11);
|
||||
|
||||
else if (!strncmp(buffer, "SwapFree:", 9))
|
||||
meminfo.swapfree = atoll(buffer + 10);
|
||||
}
|
||||
|
||||
probe_submit(&plugin, "memory.rrd", DS_MEMORY, "%llu:%llu:%llu:%llu",
|
||||
meminfo.memtotal, meminfo.memfree,
|
||||
meminfo.buffers, meminfo.cached);
|
||||
|
||||
probe_submit(&plugin, "swap.rrd", DS_SWAP, "%llu:%llu",
|
||||
meminfo.swaptotal, meminfo.swapfree);
|
||||
|
||||
fclose(fp);
|
||||
free(buffer);
|
||||
}
|
||||
|
||||
struct sammler_plugin plugin = {
|
||||
.name = "memory",
|
||||
.version = 1,
|
||||
.probe = &probe,
|
||||
.get_ds = &get_ds,
|
||||
};
|
||||
@ -0,0 +1,106 @@
|
||||
/***************************************************************************
|
||||
* Copyright (C) 06/2006 by Olaf Rempel *
|
||||
* razzor@kopf-tisch.de *
|
||||
* *
|
||||
* 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; either version 2 of the License, or *
|
||||
* (at your option) any later version. *
|
||||
* *
|
||||
* 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., *
|
||||
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
|
||||
***************************************************************************/
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <mntent.h>
|
||||
#include <sys/vfs.h>
|
||||
#include <string.h>
|
||||
|
||||
#include "plugins.h"
|
||||
|
||||
struct sammler_plugin plugin;
|
||||
|
||||
static char *ds_def[] = {
|
||||
"DS:block_total:GAUGE:%d:0:U",
|
||||
"DS:block_free:GAUGE:%d:0:U",
|
||||
NULL
|
||||
};
|
||||
|
||||
static char ** get_ds(int ds_id)
|
||||
{
|
||||
return ds_def;
|
||||
}
|
||||
|
||||
static void probe(void)
|
||||
{
|
||||
FILE *fp;
|
||||
struct mntent *mnt;
|
||||
struct statfs fs;
|
||||
char *slash, filename[64];
|
||||
int len;
|
||||
|
||||
fp = setmntent("/etc/mtab", "r");
|
||||
if (fp == NULL) {
|
||||
log_print(LOG_WARN, "plugin mount");
|
||||
return;
|
||||
}
|
||||
|
||||
while ((mnt = getmntent(fp)) != NULL) {
|
||||
if (!strcmp(mnt->mnt_fsname, "none"))
|
||||
continue;
|
||||
|
||||
if (!strcmp(mnt->mnt_fsname, "proc"))
|
||||
continue;
|
||||
|
||||
if (!strcmp(mnt->mnt_fsname, "sysfs"))
|
||||
continue;
|
||||
|
||||
if (!strcmp(mnt->mnt_fsname, "udev"))
|
||||
continue;
|
||||
|
||||
if (!strcmp(mnt->mnt_fsname, "devpts"))
|
||||
continue;
|
||||
|
||||
if (!strcmp(mnt->mnt_type, "nfs"))
|
||||
continue;
|
||||
|
||||
if (statfs(mnt->mnt_dir, &fs) == -1) {
|
||||
log_print(LOG_WARN, "plugin mount: statfs(%s)", mnt->mnt_dir);
|
||||
continue;
|
||||
}
|
||||
|
||||
if (fs.f_blocks == 0)
|
||||
continue;
|
||||
|
||||
slash = mnt->mnt_fsname;
|
||||
while (slash && (slash = strchr(slash, '/'))) {
|
||||
slash = strchr(slash, '/');
|
||||
*slash++ = '_';
|
||||
}
|
||||
|
||||
len = snprintf(filename, sizeof(filename), "mount%s.rrd", mnt->mnt_fsname);
|
||||
if (len >= sizeof(filename)) {
|
||||
log_print(LOG_WARN, "plugin mount: file name too long", mnt->mnt_fsname);
|
||||
continue;
|
||||
}
|
||||
|
||||
probe_submit(&plugin, filename, 0, "%lu:%lu",
|
||||
fs.f_blocks * (fs.f_bsize /1024),
|
||||
fs.f_bfree * (fs.f_bsize /1024));
|
||||
}
|
||||
endmntent(fp);
|
||||
}
|
||||
|
||||
struct sammler_plugin plugin = {
|
||||
.name = "mount",
|
||||
.version = 1,
|
||||
.probe = &probe,
|
||||
.get_ds = &get_ds,
|
||||
};
|
||||
@ -0,0 +1,93 @@
|
||||
/***************************************************************************
|
||||
* Copyright (C) 06/2006 by Olaf Rempel *
|
||||
* razzor@kopf-tisch.de *
|
||||
* *
|
||||
* 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; either version 2 of the License, or *
|
||||
* (at your option) any later version. *
|
||||
* *
|
||||
* 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., *
|
||||
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
|
||||
***************************************************************************/
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
#include "plugins.h"
|
||||
|
||||
#define BUFSIZE 1024
|
||||
|
||||
struct sammler_plugin plugin;
|
||||
|
||||
static char *ds_def[] = {
|
||||
"DS:byte_in:COUNTER:%d:0:U",
|
||||
"DS:byte_out:COUNTER:%d:0:U",
|
||||
"DS:pkt_in:COUNTER:%d:0:U",
|
||||
"DS:pkt_out:COUNTER:%d:0:U",
|
||||
NULL
|
||||
};
|
||||
|
||||
static char ** get_ds(int ds_id)
|
||||
{
|
||||
return ds_def;
|
||||
}
|
||||
|
||||
static void probe(void)
|
||||
{
|
||||
FILE *fp;
|
||||
char *buffer, *stats, *device;
|
||||
char *val[16], filename[32];
|
||||
|
||||
buffer = malloc(BUFSIZE);
|
||||
if (buffer == NULL) {
|
||||
log_print(LOG_WARN, "plugin netdev: out of memory");
|
||||
return;
|
||||
}
|
||||
|
||||
fp = fopen("/proc/net/dev", "r");
|
||||
if (fp == NULL) {
|
||||
log_print(LOG_WARN, "plugin netdev");
|
||||
free(buffer);
|
||||
return;
|
||||
}
|
||||
|
||||
while (fgets(buffer, BUFSIZE, fp) != NULL) {
|
||||
|
||||
if (!(stats = strchr(buffer, ':')))
|
||||
continue;
|
||||
|
||||
*stats++ = '\0';
|
||||
|
||||
device = buffer;
|
||||
while (*device == ' ')
|
||||
device++;
|
||||
|
||||
if (*device == '\0')
|
||||
continue;
|
||||
|
||||
if (strsplit(stats, val, 16) != 16)
|
||||
continue;
|
||||
|
||||
snprintf(filename, sizeof(filename), "net-%s.rrd", device);
|
||||
|
||||
probe_submit(&plugin, filename, 0, "%s:%s:%s:%s",
|
||||
val[0], val[8], val[1], val[9]);
|
||||
}
|
||||
fclose(fp);
|
||||
free(buffer);
|
||||
}
|
||||
|
||||
struct sammler_plugin plugin = {
|
||||
.name = "netdev",
|
||||
.version = 1,
|
||||
.probe = &probe,
|
||||
.get_ds = &get_ds,
|
||||
};
|
||||
@ -0,0 +1,68 @@
|
||||
/***************************************************************************
|
||||
* Copyright (C) 06/2006 by Olaf Rempel *
|
||||
* razzor@kopf-tisch.de *
|
||||
* *
|
||||
* 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; either version 2 of the License, or *
|
||||
* (at your option) any later version. *
|
||||
* *
|
||||
* 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. *
|
||||
* *</ | ||||