Lines Matching defs:key
50 * Build return key/data pair.
54 * e: key/data pair to be returned
55 * key: user's key structure (NULL if not to be filled in)
56 * rkey: memory area to hold key
59 * copy: always copy the key/data item
65 __bt_ret(BTREE *t, EPG *e, DBT *key, DBT *rkey, DBT *data, DBT *rdata, int copy)
77 if (key == NULL)
82 &key->size, &rkey->data, &rkey->size))
84 key->data = rkey->data;
94 key->size = bl->ksize;
95 key->data = rkey->data;
97 key->size = bl->ksize;
98 key->data = bl->bytes;
131 * __BT_CMP -- Compare a key to a given record.
153 * The left-most key on internal pages, at any level of the tree, is
154 * guaranteed by the following code to be less than any user key.
155 * This saves us from having to update the leftmost key on an internal
156 * page when the user inserts a new key in the tree smaller than