void sl_set_delete(sl_intset_t *set)
{
sl_node_t *node, *next;
node = set->head;
while (node != NULL) {
next = node->nexts[0];
sl_delete_node(node);
node = next;
}
free(set);
}
/*
* [lyj] Disable the modification of the "deleted" field.
*/
int fraser_remove(sl_intset_t *set, uint32_t val)
{
sl_node_t *succs[LEVELMAX];
fraser_search(set, val, NULL, succs);
if (succs[0]->val == val) {
/* Mark forward pointers, then search will remove the node */
int iMarkIt = mark_node_ptrs(succs[0]);
fraser_search(set, val, NULL, NULL);
if (iMarkIt)
sl_delete_node(succs[0]);
return iMarkIt;
}
return 0;
}
static LocatorNode_t *locator_new_node (LocatorKind_t kind,
const unsigned char *addr,
uint32_t port)
{
LocSearchData data;
LocatorNode_t **npp, *np;
int is_new;
data.kind = kind;
data.addr = addr;
data.port = port;
npp = sl_insert (&loc_list, &data, &is_new, loc_cmp);
if (!npp) {
warn_printf ("locator_new_node: not enough memory for node!");
return (NULL);
}
if (is_new) {
np = mds_pool_alloc (&mem_blocks [MB_LOCATOR]);
if (!np) {
warn_printf ("locator_new_node: not enough memory for locator data!");
#ifdef LIST_DELETE_NODE
sl_delete_node (&loc_list, npp);
#else
sl_delete (&loc_list, &data, loc_cmp);
#endif
return (NULL);
}
np->users = 1;
np->locator.kind = kind;
np->locator.port = port;
memcpy (np->locator.address, addr, sizeof (np->locator.address));
memset (&np->locator.scope_id, 0, 8);
*npp = np;
}
else {
np = *npp;
np->users++;
}
return (np);
}
LocatorNode_t *locator_list_add (LocatorList_t *list,
LocatorKind_t kind,
const unsigned char *addr,
uint32_t port,
uint32_t scope_id,
Scope_t scope,
unsigned flags,
unsigned sproto)
{
LocSearchData data;
LocatorNode_t **npp, *np;
LocatorRef_t *rp, *p;
int is_new;
data.kind = kind;
data.addr = addr;
data.port = port;
lock_take (loc_lock);
npp = sl_insert (&loc_list, &data, &is_new, loc_cmp);
if (!npp) {
warn_printf ("locator_list_add: not enough memory for list node!");
lock_release (loc_lock);
return (NULL);
}
if (is_new) {
np = mds_pool_alloc (&mem_blocks [MB_LOCATOR]);
if (!np) {
warn_printf ("locator_list_add: not enough memory for locator node!");
#ifdef LIST_DELETE_NODE
sl_delete_node (&loc_list, npp);
#else
sl_delete (&loc_list, &data, loc_cmp);
#endif
lock_release (loc_lock);
return (NULL);
}
np->users = 0;
np->locator.kind = kind;
np->locator.port = port;
memcpy (np->locator.address, addr, sizeof (np->locator.address));
np->locator.scope_id = scope_id;
np->locator.scope = scope;
np->locator.flags = flags;
np->locator.sproto = sproto;
np->locator.intf = 0;
np->locator.handle = 0;
*npp = np;
}
else {
np = *npp;
if (np->locator.scope_id != scope_id ||
(np->locator.scope && scope && np->locator.scope != scope) ||
/*(np->locator.flags && flags &&
(np->locator.flags & LOCF_MFLAGS) != (flags & LOCF_MFLAGS)) ||*/
(np->locator.sproto && sproto && np->locator.sproto != sproto))
log_printf (LOC_ID, 0, "locator_list_add: incompatible locator attributes for %s, "
"%u:%u, %u:%u, 0x%x:0x%x, %u:%u!\r\n",
locator_str (&np->locator),
np->locator.scope_id, scope_id,
np->locator.scope, scope,
np->locator.flags, flags,
np->locator.sproto, sproto);
if (!np->locator.scope_id && scope_id)
np->locator.scope_id = scope_id;
if (!np->locator.scope && scope)
np->locator.scope = scope;
if (flags && np->locator.flags != flags)
np->locator.flags |= flags;
if (!np->locator.sproto && sproto)
np->locator.sproto = sproto;
/* Check if already in list. */
for (rp = *list; rp; rp = rp->next)
if (rp->data == np) { /* Already there! */
lock_release (loc_lock);
return (0);
}
}
#ifdef LOG_LOCATORS
log_printf (LOC_ID, 0, "LOC: locator_list_add (list=%p, %s)\r\n", (void *) list, locator_str (&np->locator));
#endif
rp = mds_pool_alloc (&mem_blocks [MB_LOCREF]);
if (!rp) {
warn_printf ("locator_list_add: not enough memory for locator reference!\r\n");
if (is_new) {
mds_pool_free (&mem_blocks [MB_LOCATOR], np);
#ifdef LIST_DELETE_NODE
sl_delete_node (&loc_list, npp);
#else
sl_delete (&loc_list, &data, loc_cmp);
#endif
}
lock_release (loc_lock);
return (NULL);
}
rp->next = NULL;
rp->data = np;
np->users++;
lock_release (loc_lock);
if (*list) {
for (p = *list; p->next; p = p->next)
;
p->next = rp;
}
else
*list = rp;
return (np);
}
