Lines Matching refs:key
56 * key: key
61 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key is already in the
65 __bt_put(const DB *dbp, DBT *key, const DBT *data, u_int flags)
112 * If the key/data pair won't fit on a page, store it on overflow
113 * pages. Only put the key on the overflow page if the pair are
120 if (key->size + data->size > t->bt_ovflsize) {
121 if (key->size > t->bt_ovflsize) {
122 storekey: if (__ovfl_put(t, key, &pg) == RET_ERROR)
127 tmp = key->size;
131 key = &tkey;
133 if (key->size + data->size > t->bt_ovflsize) {
145 if (key->size + data->size > t->bt_ovflsize)
158 * Find the key to delete, or, the location at which to insert.
161 if (t->bt_order == NOT || (e = bt_fast(t, key, data, &exact)) == NULL)
162 if ((e = __bt_search(t, key, &exact)) == NULL)
168 * Add the key/data pair to the tree. If an identical key is already
170 * R_NOOVERWRITE is not set, the key is either added (if duplicates are
187 delete: if (__bt_dleaf(t, key, h, idx) == RET_ERROR) {
197 * insert the key and data and unpin the current page. If inserting
200 nbytes = NBLEAFDBT(key->size, data->size);
202 if ((status = __bt_split(t, h, key,
215 WR_BLEAF(dest, key, data, dflags);
258 * key: key to insert
264 bt_fast(BTREE *t, const DBT *key, const DBT *data, int *exactp)
281 nbytes = NBLEAFDBT(key->size, data->size);
290 if ((cmp = __bt_cmp(t, key, &t->bt_cur)) < 0)
298 if ((cmp = __bt_cmp(t, key, &t->bt_cur)) > 0)