continue;
rb_dlinkDelete(ptr, &reject_list);
- MyFree(rdata);
+ rb_free(rdata);
patricia_remove(reject_tree, pnode);
}
}
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;
}
if (rdata->mask_hashv == hashv)
{
rb_dlinkDelete(ptr, &reject_list);
- MyFree(rdata);
+ rb_free(rdata);
patricia_remove(reject_tree, pnode);
n++;
}