hammer_btree_cmp
if (hammer_btree_cmp(&elm->base, &lbe->base) < 0)
if (hammer_btree_cmp(&elm->base, &rbe->base) >= 0)
if (hammer_btree_cmp(&rbn->base, &lbe->base) < 0)
if (hammer_btree_cmp(&rbn->base, &rbe->base) > 0)
r = hammer_btree_cmp(elm, &node->elms[i].leaf.base);
r = hammer_btree_cmp(&search, &e->base);
r = hammer_btree_cmp(key, &e->base);
if (hammer_btree_cmp(end, &e->base) < -1)
int hammer_btree_cmp(hammer_base_elm_t key1, hammer_base_elm_t key2);
r = hammer_btree_cmp(&cursor->key_beg, cursor->left_bound);
s = hammer_btree_cmp(&cursor->key_beg, cursor->right_bound);
r = hammer_btree_cmp(&cursor->key_beg, &elm->base);
r = hammer_btree_cmp(&cursor->key_beg, &elm->leaf.base);
r = hammer_btree_cmp(elm, &node->elms[i].leaf.base);
KKASSERT(hammer_btree_cmp(cursor->left_bound,
KKASSERT(hammer_btree_cmp(cursor->right_bound,
KKASSERT(hammer_btree_cmp(cursor->left_bound,
KKASSERT(hammer_btree_cmp(cursor->right_bound,
KKASSERT(hammer_btree_cmp(cursor->left_bound, &elm[-1].leaf.base) <= 0);
KKASSERT(hammer_btree_cmp(cursor->left_bound, &elm->leaf.base) <= 0);
KKASSERT(hammer_btree_cmp(cursor->right_bound, &elm->leaf.base) > 0);
KKASSERT(hammer_btree_cmp(cursor->right_bound, &elm[1].leaf.base) > 0);
hammer_btree_cmp(&cursor->key_beg, mid_boundary) >= 0)) {
KKASSERT(hammer_btree_cmp(cursor->left_bound,
KKASSERT(hammer_btree_cmp(cursor->right_bound,
KKASSERT(hammer_btree_cmp(cursor->left_bound, &cursor->key_beg) <= 0);
KKASSERT(hammer_btree_cmp(cursor->right_bound, &cursor->key_beg) > 0);
r = hammer_btree_cmp(&cursor->key_end, &elm[0].base);
s = hammer_btree_cmp(&cursor->key_beg, &elm[1].base);
r = hammer_btree_cmp(&cursor->key_end, &elm->base);
s = hammer_btree_cmp(&cursor->key_beg,
if (hammer_btree_cmp(&cmirror->skip_beg, &cursor->key_beg) < 0)
if (hammer_btree_cmp(&cmirror->skip_end, &cursor->key_end) > 0)
r = hammer_btree_cmp(&cursor->key_end, &elm[0].base);
s = hammer_btree_cmp(&cursor->key_beg, &elm[1].base);
s = hammer_btree_cmp(&cursor->key_beg, &elm->base);
KKASSERT(hammer_btree_cmp(cursor->left_bound, &elm->base) <= 0);
KKASSERT(hammer_btree_cmp(cursor->right_bound, &elm->base) > 0);
KKASSERT(hammer_btree_cmp(&node->elms[i-1].leaf.base, &elm->base) < 0);
KKASSERT(hammer_btree_cmp(&node->elms[i+1].leaf.base, &elm->base) > 0);
if (hammer_btree_cmp(&mirror->key_beg, &mirror->key_end) > 0)
r = hammer_btree_cmp(&elm->base, &cursor->iprec->leaf.base);
r = hammer_btree_cmp(&elm->base,
r = hammer_btree_cmp(&elm->base, &cursor->iprec->leaf.base);
if (hammer_btree_cmp(&rebal->key_cur, &cursor.key_end) > 0) {