smaller
static void link_cache_lists(struct cache *smaller, struct cache *bigger)
while (smaller->next_local) {
if (smaller->next_local == bigger)
smaller = smaller->next_local;
smaller->next_local = bigger;
WARN_ONCE((smaller->level == 1 && bigger->level > 2) ||
(smaller->level > 1 && bigger->level != smaller->level + 1),
smaller->level, smaller->ofnode, bigger->level, bigger->ofnode);
int smaller = 0x8000 & (cc1 - cc2);
return !equal && !smaller;
smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
if (smaller(tree, v, s->heap[j], s->depth)) break;