Lines Matching refs:key
58 * key: key
63 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key is already in the
67 __bt_put(dbp, key, data, flags)
69 DBT *key;
117 * If the key/data pair won't fit on a page, store it on overflow
118 * pages. Only put the key on the overflow page if the pair are
125 if (key->size + data->size > t->bt_ovflsize) {
126 if (key->size > t->bt_ovflsize) {
128 storekey: if (__ovfl_put(t, key, &pg) == RET_ERROR)
133 yuck_this_is_gross_code = key->size;
134 if (yuck_this_is_gross_code != key->size)
139 key = &tkey;
141 if (key->size + data->size > t->bt_ovflsize) {
155 if (key->size + data->size > t->bt_ovflsize)
168 * Find the key to delete, or, the location at which to insert.
171 if (t->bt_order == NOT || (e = bt_fast(t, key, data, &exact)) == NULL)
172 if ((e = __bt_search(t, key, &exact)) == NULL)
178 * Add the key/data pair to the tree. If an identical key is already
180 * R_NOOVERWRITE is not set, the key is either added (if duplicates are
197 delete: if (__bt_dleaf(t, key, h, idx) == RET_ERROR) {
207 * insert the key and data and unpin the current page. If inserting
210 nbytes = NBLEAFDBT(key->size, data->size);
212 if ((status = __bt_split(t, h, key,
225 WR_BLEAF(dest, key, data, dflags);
268 * key: key to insert
274 bt_fast(t, key, data, exactp)
276 const DBT *key, *data;
294 nbytes = NBLEAFDBT(key->size, data->size);
303 if ((cmp = __bt_cmp(t, key, &t->bt_cur)) < 0)
311 if ((cmp = __bt_cmp(t, key, &t->bt_cur)) > 0)