btval
struct btval key, val;
struct btval key;
struct btval key, data, maxkey;
btree_search_node(struct btree *bt, struct mpage *mp, struct btval *key,
struct btval nodekey;
btree_search_page_root(struct btree *bt, struct mpage *root, struct btval *key,
btree_search_page(struct btree *bt, struct btree_txn *txn, struct btval *key,
struct btval *data)
struct btval *key, struct btval *data)
struct btval *key)
btree_cursor_next(struct cursor *cursor, struct btval *key, struct btval *data)
btree_cursor_set(struct cursor *cursor, struct btval *key, struct btval *data,
btree_cursor_first(struct cursor *cursor, struct btval *key, struct btval *data)
btree_cursor_get(struct cursor *cursor, struct btval *key, struct btval *data,
bt_leaf_size(struct btree *bt, struct btval *key, struct btval *data)
bt_branch_size(struct btree *bt, struct btval *key)
btree_write_overflow_data(struct btree *bt, struct page *p, struct btval *data)
struct btval *key, struct btval *data, pgno_t pgno, uint8_t flags)
struct btval *key)
struct btval key;
struct btval key, data;
struct btval nullkey;
struct btval nullkey;
struct mpage *root, struct btval *key,
struct btval key, data;
struct btree_txn *txn, struct btval *key,
struct btval *key, int *exactp, unsigned int *kip);
indx_t indx, struct btval *key, struct btval *data,
struct btval *key, struct btval *data)
struct node *leaf, struct btval *data);
indx_t indx, struct btval *key);
bt_reduce_separator(struct btree *bt, struct node *min, struct btval *sep)
struct btval *newkey, struct btval *newdata, pgno_t newpgno)
struct btval sepkey, rkey, rdata;
unsigned int *newindxp, struct btval *newkey,
struct btval *newdata, pgno_t newpgno);
struct page *p, struct btval *data);
struct node *node, struct btval *key);
struct btval *key, struct btval *data);
struct btval *key, struct btval *data, int *exactp);
struct btval *key, struct btval *data, unsigned int flags)
struct btval *key, struct btval *data);
struct btval xkey;
struct btval *sep);
static void remove_prefix(struct btree *bt, struct btval *key,
static size_t bt_leaf_size(struct btree *bt, struct btval *key,
struct btval *data);
static size_t bt_branch_size(struct btree *bt, struct btval *key);
btree_cmp(struct btree *bt, const struct btval *a, const struct btval *b)
remove_prefix(struct btree *bt, struct btval *key, size_t pfxlen)
bt_cmp(struct btree *bt, const struct btval *key1, const struct btval *key2,
btval_reset(struct btval *btv)
struct btval *key, struct btval *data,
int btree_cmp(struct btree *bt, const struct btval *a,
const struct btval *b);
void btval_reset(struct btval *btv);
typedef int (*bt_cmp_func)(const struct btval *a,
const struct btval *b);
typedef void (*bt_prefix_func)(const struct btval *a,
const struct btval *b,
struct btval *sep);
struct btval *key, struct btval *data);
struct btval *key, struct btval *data,
struct btval *key, struct btval *data);
index_rdn_key(struct namespace *ns, struct btval *dn, struct btval *key)
index_rdn(struct namespace *ns, struct btval *dn)
struct btval key, val;
unindex_attribute(struct namespace *ns, char *attr, struct btval *dn,
struct btval key;
index_entry(struct namespace *ns, struct btval *dn, struct ber_element *elm)
unindex_rdn(struct namespace *ns, struct btval *dn)
struct btval key;
unindex_entry(struct namespace *ns, struct btval *dn, struct ber_element *elm)
index_to_dn(struct namespace *ns, struct btval *indx, struct btval *dn)
index_attribute(struct namespace *ns, char *attr, struct btval *dn,
struct btval key, val;
struct btval key;
struct ber_element *root, struct btval *val);
struct btval *val);
int is_child_of(struct btval *key, const char *base);
int has_suffix(struct btval *key, const char *suffix);
int has_prefix(struct btval *key, const char *prefix);
int ber2db(struct ber_element *root, struct btval *val,
struct ber_element *db2ber(struct btval *val, int compression_level);
int index_entry(struct namespace *ns, struct btval *dn,
int unindex_entry(struct namespace *ns, struct btval *dn,
int index_to_dn(struct namespace *ns, struct btval *indx,
struct btval *dn);
struct btval key;
static struct btval *
struct btval key;
static struct btval val;
struct btval *val;
struct btval *val;
struct btval *val)
namespace_db2ber(struct namespace *ns, struct btval *val)
struct btval key, val;
struct btval key, data;
static struct btval *namespace_find(struct namespace *ns, char *dn);
is_child_of(struct btval *key, const char *base)
check_search_entry(struct btval *key, struct btval *val, struct search *search)
mk_dup(struct search *search, struct btval *key)
is_dup(struct search *search, struct btval *key)
struct btval key, ikey, val;
struct btval key, val;
ber2db(struct ber_element *root, struct btval *val, int compression_level)
db2ber(struct btval *val, int compression_level)
has_suffix(struct btval *key, const char *suffix)
has_prefix(struct btval *key, const char *prefix)