Home
last modified time | relevance | path

Searched refs:__bt_cmp (Results 1 – 6 of 6) sorted by relevance

/freebsd/lib/libc/db/btree/
H A Dbt_search.c76 if ((cmp = __bt_cmp(t, key, &t->bt_cur)) == 0) { in __bt_search()
153 if (__bt_cmp(t, key, &e) == 0) { in __bt_snext()
188 if (__bt_cmp(t, key, &e) == 0) { in __bt_sprev()
H A Dbt_delete.c316 } while (e->index < NEXTINDEX(h) && __bt_cmp(t, key, e) == 0); in __bt_bdelete()
324 if (__bt_cmp(t, key, e) != 0) in __bt_bdelete()
553 if (__bt_cmp(t, key, &e) == 0) { in __bt_curdel()
562 if (__bt_cmp(t, key, &e) == 0) { in __bt_curdel()
573 if (__bt_cmp(t, key, &e) == 0) { in __bt_curdel()
585 if (__bt_cmp(t, key, &e) == 0) { in __bt_curdel()
H A Dextern.h33 int __bt_cmp(BTREE *, const DBT *, EPG *);
H A Dbt_put.c286 if ((cmp = __bt_cmp(t, key, &t->bt_cur)) < 0) in bt_fast()
294 if ((cmp = __bt_cmp(t, key, &t->bt_cur)) > 0) in bt_fast()
H A Dbt_utils.c140 __bt_cmp(BTREE *t, const DBT *k1, EPG *e) in __bt_cmp() function
H A Dbt_seq.c383 } while (__bt_cmp(t, key, ep) == 0); in __bt_first()