Birdlib: Do cleanups after remove/free

 * rem_node - remove a node from a list

 * @n: node to be removed

 *

 * Removes a node @n from the list it's linked in.

 * Removes a node @n from the list it's linked in. Afterwards, node @n is cleared.

 */

LIST_INLINE void

rem_node(node *n)

  node *z = n->prev;

  node *x = n->next;

  z->next = x;

  x->prev = z;

}

/**

 * rem2_node - remove a node from a list, with cleanup

 * @n: node to be removed

 *

 * Removes a node @n from the list it's linked in and resets its pointers to NULL.

 * Useful if you want to distinguish between linked and unlinked nodes.

 */

LIST_INLINE void

rem2_node(node *n)

{

  node *z = n->prev;

  node *x = n->next;

  z->next = x;

  x->prev = z;

  n->next = NULL;

void add_tail(list *, node *);

void add_head(list *, node *);

void rem_node(node *);

void rem2_node(node *);

void add_tail_list(list *, list *);

void init_list(list *);

void insert_node(node *, node *);

  if (r->n.next)

    rem_node(&r->n);

  r->class->free(r);

  r->class = NULL;

  xfree(r);

}

void *

mb_realloc(void *m, unsigned size)

{

  struct mblock *ob = NULL;

  if (m)

    {

      ob = SKIP_BACK(struct mblock, data, m);

      if (ob->r.n.next)

	rem_node(&ob->r.n);

    }

  struct mblock *b = SKIP_BACK(struct mblock, data, m);

  struct mblock *b = xrealloc(ob, sizeof(struct mblock) + size);

  b = xrealloc(b, sizeof(struct mblock) + size);

  replace_node(&b->r.n, &b->r.n);

  b->size = size;

  return b->data;

  WALK_LIST_FIRST(s, tmp_list)

  {

    bfd_lock_sessions(p);

    rem2_node(&s->n);

    rem_node(&s->n);

    state = s->loc_state;

    diag = s->loc_diag;

    bfd_unlock_sessions(p);