Lines Matching refs:key
52 * Build return key/data pair.
56 * e: key/data pair to be returned
57 * key: user's key structure (NULL if not to be filled in)
58 * rkey: memory area to hold key
61 * copy: always copy the key/data item
67 __bt_ret(t, e, key, rkey, data, rdata, copy)
70 DBT *key, *rkey, *data, *rdata;
83 if (key == NULL)
88 &key->size, &rkey->data, &rkey->size))
90 key->data = rkey->data;
101 key->size = bl->ksize;
102 key->data = rkey->data;
104 key->size = bl->ksize;
105 key->data = bl->bytes;
140 * __BT_CMP -- Compare a key to a given record.
165 * The left-most key on internal pages, at any level of the tree, is
166 * guaranteed by the following code to be less than any user key.
167 * This saves us from having to update the leftmost key on an internal
168 * page when the user inserts a new key in the tree smaller than