smaller
smaller(tree, s->heap[j + 1], s->heap[j], s->depth)) {
if (smaller(tree, v, s->heap[j], s->depth)) break;
smaller(tree, s->heap[j + 1], s->heap[j], s->depth)) {
if (smaller(tree, v, s->heap[j], s->depth)) break;
o->smaller = rbtree_create(order_lock_cmp);
free(o->smaller);
o->smaller = rbtree_create(order_lock_cmp);
if(!rbtree_insert(now->smaller, &ref->node)) {
RBTREE_FOR(ref, struct lock_ref*, visit->lock->smaller) {
if(o->smaller) {
traverse_postorder(o->smaller, &dellockref, NULL);
free(o->smaller);
rbtree_type* smaller;