Home
last modified time | relevance | path

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

/src/crypto/krb5/src/plugins/kdb/db2/libdb2/btree/
H A Dextern.h42 #define __bt_dleaf __kdb2_bt_deleaf macro
73 int __bt_dleaf __P((BTREE *, const DBT *, PAGE *, u_int));
H A Dbt_delete.c107 status = __bt_dleaf(t, NULL, h, c->pg.index); in __bt_delete()
309 if (__bt_dleaf(t, key, h, e->index)) { in __bt_bdelete()
332 if (__bt_dleaf(t, key, h, e->index) == RET_ERROR) { in __bt_bdelete()
464 __bt_dleaf(BTREE *t, const DBT *key, PAGE *h, u_int idx) in __bt_dleaf() function
H A Dbt_put.c193 delete: if (__bt_dleaf(t, key, h, idx) == RET_ERROR) { in __bt_put()
/src/lib/libc/db/btree/
H A Dbt_delete.c102 status = __bt_dleaf(t, NULL, h, c->pg.index); in __bt_delete()
303 if (__bt_dleaf(t, key, h, e->index)) { in __bt_bdelete()
326 if (__bt_dleaf(t, key, h, e->index) == RET_ERROR) { in __bt_bdelete()
458 __bt_dleaf(BTREE *t, const DBT *key, PAGE *h, u_int idx) in __bt_dleaf() function
H A Dextern.h38 int __bt_dleaf(BTREE *, const DBT *, PAGE *, u_int);
H A Dbt_put.c183 delete: if (__bt_dleaf(t, key, h, idx) == RET_ERROR) { in __bt_put()