/*
* Syntax of "pike_list" :
* no nodes
*/
struct mi_root* mi_pike_list(struct mi_root* cmd_tree, void* param)
{
struct mi_root* rpl_tree;
struct ip_node *ip;
int i;
rpl_tree = init_mi_tree( 200, MI_OK_S, MI_OK_LEN);
if (rpl_tree==0)
return 0;
for( i=0 ; i<MAX_IP_BRANCHES ; i++ ) {
if (get_tree_branch(i)==0)
continue;
lock_tree_branch(i);
if ( (ip=get_tree_branch(i))!=NULL )
print_red_ips( ip, 0, &rpl_tree->node );
unlock_tree_branch(i);
}
return rpl_tree;
}
void swap_routine( unsigned int ticks, void *param)
{
struct ip_node *node;
int i;
/* LM_DBG("entering \n"); */
for(i=0;i<MAX_IP_BRANCHES;i++) {
node = get_tree_branch(i);
if (node) {
lock_tree_branch( i );
node = get_tree_branch(i); /* again, to avoid races */
if (node) refresh_node( node );
unlock_tree_branch( i );
}
}
}
static void collect_data(int options)
{
int i;
g_max_hits = get_max_hits();
DBG("pike: collect_data");
// maybe try_lock first and than do the rest?
for(i=0;i<MAX_IP_BRANCHES;i++) {
if (get_tree_branch(i)==0)
continue;
DBG("pike: collect_data: branch %d", i);
lock_tree_branch(i);
if (get_tree_branch(i))
traverse_subtree( get_tree_branch(i), 0, options );
unlock_tree_branch(i);
}
}
int pike_check_req(struct sip_msg *msg)
{
struct ip_node *node;
struct ip_node *father;
unsigned char flags;
struct ip_addr* ip;
#ifdef _test
/* get the ip address from second via */
if (parse_headers(msg, HDR_VIA1_F, 0)!=0 )
return -1;
if (msg->via1==0 )
return -1;
/* convert from string to ip_addr */
ip = str2ip( &msg->via1->host );
if (ip==0)
return -1;
#else
ip = &(msg->rcv.src_ip);
#endif
/* first lock the proper tree branch and mark the IP with one more hit*/
lock_tree_branch( ip->u.addr[0] );
node = mark_node( ip->u.addr, ip->len, &father, &flags);
if (node==0) {
unlock_tree_branch( ip->u.addr[0] );
/* even if this is an error case, we return true in script to avoid
* considering the IP as marked (bogdan) */
return 1;
}
LM_DBG("src IP [%s],node=%p; hits=[%d,%d],[%d,%d] node_flags=%d"
" func_flags=%d\n", ip_addr2a( ip ), node,
node->hits[PREV_POS],node->hits[CURR_POS],
node->leaf_hits[PREV_POS],node->leaf_hits[CURR_POS],
node->flags, flags);
/* update the timer */
lock_get(timer_lock);
if ( flags&NEW_NODE ) {
/* put this node into the timer list and remove its
father only if this has one kid and is not a LEAF_NODE*/
node->expires = get_ticks() + timeout;
append_to_timer( timer, &(node->timer_ll) );
node->flags |= NODE_INTIMER_FLAG;
if (father) {
LM_DBG("father %p: flags=%d kids->next=%p\n",
father,father->flags,father->kids->next);
if (!(father->flags&NODE_IPLEAF_FLAG) && !father->kids->next){
/* debug */
assert( has_timer_set(&(father->timer_ll))
&& (father->flags&(NODE_EXPIRED_FLAG|NODE_INTIMER_FLAG)) );
/* if the node is maked as expired by timer, let the timer
* to finish and remove the node */
if ( !(father->flags&NODE_EXPIRED_FLAG) ) {
remove_from_timer( timer, &(father->timer_ll) );
father->flags &= ~NODE_INTIMER_FLAG;
} else {
father->flags &= ~NODE_EXPIRED_FLAG;
}
}
}
} else {
/* update the timer -> in timer can be only nodes
* as IP-leaf(complete address) or tree-leaf */
if (node->flags&NODE_IPLEAF_FLAG || node->kids==0) {
/* tree leafs which are not potential red nodes are not update in
* order to make them to expire */
/* debug */
assert( has_timer_set(&(node->timer_ll))
&& (node->flags&(NODE_EXPIRED_FLAG|NODE_INTIMER_FLAG)) );
/* if node exprired, ignore the current hit and let is
* expire in timer process */
if ( !(flags&NO_UPDATE) && !(node->flags&NODE_EXPIRED_FLAG) ) {
node->expires = get_ticks() + timeout;
update_in_timer( timer, &(node->timer_ll) );
}
} else {
/* debug */
assert( !has_timer_set(&(node->timer_ll))
&& !(node->flags&(NODE_INTIMER_FLAG|NODE_EXPIRED_FLAG)) );
/* debug */
assert( !(node->flags&NODE_IPLEAF_FLAG) && node->kids );
}
}
/*print_timer_list( timer );*/ /* debug*/
lock_release(timer_lock);
unlock_tree_branch( ip->u.addr[0] );
/*print_tree( 0 );*/ /* debug */
if (flags&RED_NODE) {
if (flags&NEWRED_NODE) {
LM_GEN1( pike_log_level,
"PIKE - BLOCKing ip %s, node=%p\n",ip_addr2a(ip),node);
pike_raise_event(ip_addr2a(ip));
return -2;
}
return -1;
}
return 1;
}
void clean_routine(unsigned int ticks , void *param)
{
static unsigned char mask[32]; /* 256 positions mask */
struct list_link head;
struct list_link *ll;
struct ip_node *dad;
struct ip_node *node;
int i;
/* LM_DBG("entering (%d)\n",ticks); */
/* before locking check first if the list is not empty and if can
* be at least one element removed */
if ( is_list_empty( timer )) return; /* quick exit */
/* get the expired elements */
lock_get( timer_lock );
/* check again for empty list */
if (is_list_empty(timer) || (ll2ipnode(timer->next)->expires>ticks )){
lock_release( timer_lock );
return;
}
check_and_split_timer( timer, ticks, &head, mask);
/*print_timer_list(timer);*/ /* debug */
lock_release( timer_lock );
/*print_tree( 0 );*/ /*debug*/
/* got something back? */
if ( is_list_empty(&head) )
return;
/* process what we got -> don't forget to lock the tree!! */
for(i=0;i<MAX_IP_BRANCHES;i++) {
/* if no element from this branch -> skip it */
if ( ((mask[i>>3])&(1<<(i&0x07)))==0 )
continue;
lock_tree_branch( i );
for( ll=head.next ; ll!=&head ; ) {
node = ll2ipnode( ll );
ll = ll->next;
/* skip nodes from a different branch */
if (node->branch!=i)
continue;
/* unlink the node -> the list will get shorter and it will be
* faster for the next branches to process it */
ll->prev->prev->next = ll;
ll->prev = ll->prev->prev;
node->expires = 0;
node->timer_ll.prev = node->timer_ll.next = 0;
if ( node->flags&NODE_EXPIRED_FLAG )
node->flags &= ~NODE_EXPIRED_FLAG;
else
continue;
/* process the node */
LM_DBG("clean node %p (kids=%p; hits=[%d,%d];leaf=[%d,%d])\n",
node,node->kids,
node->hits[PREV_POS],node->hits[CURR_POS],
node->leaf_hits[PREV_POS],node->leaf_hits[CURR_POS]);
/* if it's a node, leaf for an ipv4 address inside an
* ipv6 address -> just remove it from timer it will be deleted
* only when all its kids will be deleted also */
if (node->kids) {
assert( node->flags&NODE_IPLEAF_FLAG );
node->flags &= ~NODE_IPLEAF_FLAG;
node->leaf_hits[CURR_POS] = 0;
} else {
/* if the node has no prev, means its a top branch node -> just
* removed and destroy it */
if (node->prev!=0) {
/* if this is the last kid, we have to put the father
* into timer list */
if (node->prev->kids==node && node->next==0) {
/* this is the last kid node */
dad = node->prev;
/* put it in the list only if it's not an IP leaf
* (in this case, it's already there) */
if ( !(dad->flags&NODE_IPLEAF_FLAG) ) {
lock_get(timer_lock);
dad->expires = get_ticks() + timeout;
assert( !has_timer_set(&(dad->timer_ll)) );
append_to_timer( timer, &(dad->timer_ll));
dad->flags |= NODE_INTIMER_FLAG;
lock_release(timer_lock);
} else {
assert( has_timer_set(&(dad->timer_ll)) );
}
}
}
LM_DBG("rmv node %p[%d] \n", node,node->byte);
/* del the node */
remove_node( node);
}
} /* for all expired elements */
unlock_tree_branch( i );
} /* for all branches */
}