RB_ALLOC
rbtree = rb_create(RB_ALLOC, RB_UPDATE);
rbtree = rb_create(RB_ALLOC, RB_UPDATE);
rbtree = rb_create(RB_ALLOC, RB_UPDATE);
rbtree = rb_create(RB_ALLOC, RB_DUPLICATE);
if (rbtree->alloc != RB_ALLOC) {
if (rbtree->alloc == RB_ALLOC)
rbtree = rb_create(RB_ALLOC, RB_DEFAULT);
rbtree = rb_create(RB_ALLOC, RB_DEFAULT);
ret = (alloc == RB_ALLOC) ? remove_many_alloc(rbtree)
if (alloc == RB_ALLOC)
return insert_many(RB_ALLOC, RB_UPDATE);
return remove_many(RB_ALLOC, RB_UPDATE);
rbtree = rb_create(RB_ALLOC, RB_UPDATE);
rbtree = rb_create(RB_ALLOC, RB_UPDATE);
rbtree = rb_create(RB_ALLOC, RB_DEFAULT);
rbtree = rb_create(RB_ALLOC, RB_DEFAULT);
alloc = rb_create(RB_ALLOC, RB_DEFAULT);
if (rbtree->alloc == RB_ALLOC)
if (unlikely(rbtree->alloc == RB_ALLOC))
if (unlikely(rbtree->alloc != RB_ALLOC))
bool free = (rbtree->alloc == RB_ALLOC);
if (unlikely(rbtree->alloc == RB_ALLOC))
if (unlikely(rbtree->alloc != RB_ALLOC))
if (rbtree->alloc != RB_ALLOC)