#include "patricia.h"
#include "client.h"
#include "s_conf.h"
-#include "event.h"
-#include "tools.h"
#include "reject.h"
#include "s_stats.h"
#include "msg.h"
struct Client *client_p;
rb_dlink_node *ptr, *ptr_next;
- DLINK_FOREACH_SAFE(ptr, ptr_next, delay_exit.head)
+ RB_DLINK_FOREACH_SAFE(ptr, ptr_next, delay_exit.head)
{
client_p = ptr->data;
if(IsDead(client_p))
patricia_node_t *pnode;
struct reject_data *rdata;
- DLINK_FOREACH_SAFE(ptr, next, reject_list.head)
+ RB_DLINK_FOREACH_SAFE(ptr, next, reject_list.head)
{
pnode = ptr->data;
rdata = pnode->data;
continue;
rb_dlinkDelete(ptr, &reject_list);
- MyFree(rdata);
+ rb_free(rdata);
patricia_remove(reject_tree, pnode);
}
}
patricia_node_t *pnode;
struct reject_data *rdata;
- DLINK_FOREACH_SAFE(ptr, next, reject_list.head)
+ RB_DLINK_FOREACH_SAFE(ptr, next, reject_list.head)
{
pnode = ptr->data;
rdata = pnode->data;
rb_dlinkDelete(ptr, &reject_list);
- MyFree(rdata);
+ rb_free(rdata);
patricia_remove(reject_tree, pnode);
}
}
{
struct reject_data *rdata = pnode->data;
rb_dlinkDelete(&rdata->rnode, &reject_list);
- MyFree(rdata);
+ rb_free(rdata);
patricia_remove(reject_tree, pnode);
return 1;
}
hashv ^= fnv_hash_upper(mask1, 32);
if (mask2 != NULL)
hashv ^= fnv_hash_upper(mask2, 32);
- DLINK_FOREACH_SAFE(ptr, next, reject_list.head)
+ RB_DLINK_FOREACH_SAFE(ptr, next, reject_list.head)
{
pnode = ptr->data;
rdata = pnode->data;
if (rdata->mask_hashv == hashv)
{
rb_dlinkDelete(ptr, &reject_list);
- MyFree(rdata);
+ rb_free(rdata);
patricia_remove(reject_tree, pnode);
n++;
}