mirror of https://github.com/sipwise/kamailio.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
91 lines
2.3 KiB
91 lines
2.3 KiB
#include "top.h"
|
|
|
|
#include "../../dprint.h"
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <assert.h>
|
|
#include <arpa/inet.h>
|
|
|
|
|
|
static struct TopListItem_t *top_list_root = 0;
|
|
static struct TopListItem_t *top_list_iter = 0;
|
|
|
|
static char buff[128];
|
|
|
|
struct TopListItem_t *pike_top_get_root() { return top_list_root; }
|
|
|
|
char *pike_top_print_addr( unsigned char *ip, int iplen, char *buff, int buffsize )
|
|
{
|
|
unsigned short *ipv6_ptr = (unsigned short *)ip;
|
|
memset( buff, 0, sizeof(buff));
|
|
|
|
DBG("pike:top:print_addr(iplen: %d, buffsize: %d)", iplen, buffsize);
|
|
|
|
if ( iplen == 4 ) {
|
|
inet_ntop(AF_INET, ip, buff, buffsize);
|
|
}
|
|
else if ( iplen == 16 ) {
|
|
inet_ntop(AF_INET6, ip, buff, buffsize);
|
|
}
|
|
else {
|
|
sprintf( buff, "%04x:%04x:%04x:%04x:%04x:%04x:%04x:%04x",
|
|
htons(ipv6_ptr[0]), htons(ipv6_ptr[1]), htons(ipv6_ptr[2]), htons(ipv6_ptr[3]),
|
|
htons(ipv6_ptr[4]), htons(ipv6_ptr[5]), htons(ipv6_ptr[6]), htons(ipv6_ptr[7]) );
|
|
}
|
|
|
|
return buff;
|
|
}
|
|
|
|
/* if you do not need global buffer, you can use this simpler call */
|
|
static char *print_addr(unsigned char *ip, int iplen)
|
|
{
|
|
return pike_top_print_addr(ip, iplen, buff, sizeof(buff));
|
|
}
|
|
|
|
int pike_top_add_entry( unsigned char *ip_addr, int addr_len, unsigned int leaf_hits[2], unsigned int hits[2], unsigned int expires, node_status_t status )
|
|
{
|
|
struct TopListItem_t *new_item = (struct TopListItem_t *)malloc(sizeof(struct TopListItem_t));
|
|
|
|
print_addr(ip_addr, addr_len);
|
|
DBG("pike_top_add_enrty(ip: %s, leaf_hits[%d,%d], hits[%d,%d],"
|
|
" expires: %d, status: %d)",
|
|
buff, leaf_hits[0], leaf_hits[1], hits[0], hits[1],
|
|
expires, status);
|
|
assert(new_item != 0);
|
|
|
|
memset( (void *)new_item, 0, sizeof(struct TopListItem_t) );
|
|
|
|
new_item->status = status;
|
|
new_item->expires = expires;
|
|
new_item->hits[0] = hits[0];
|
|
new_item->hits[1] = hits[1];
|
|
new_item->leaf_hits[0] = leaf_hits[0];
|
|
new_item->leaf_hits[1] = leaf_hits[1];
|
|
|
|
assert( addr_len <= 16 );
|
|
|
|
new_item->addr_len = addr_len;
|
|
memcpy(new_item->ip_addr, ip_addr, addr_len);
|
|
|
|
new_item->next = top_list_root;
|
|
top_list_root = new_item;
|
|
|
|
return 1;
|
|
}
|
|
|
|
void pike_top_list_clear()
|
|
{
|
|
struct TopListItem_t *ptr;
|
|
|
|
top_list_iter = top_list_root;
|
|
while (top_list_iter) {
|
|
ptr = top_list_iter->next;
|
|
free(top_list_iter);
|
|
top_list_iter = ptr;
|
|
}
|
|
top_list_root = 0;
|
|
memset(buff, 0, sizeof(buff));
|
|
}
|