Lines Matching defs:key

196 __ram_delete(dbp, txn, key, flags)
199 DBT *key;
211 key, flags, F_ISSET(dbp, DB_AM_RDONLY))) != 0)
218 DEBUG_LWRITE(dbc, txn, "ram_delete", key, NULL, flags);
221 if ((ret = __ram_getno(dbc, key, &recno, 0)) != 0)
276 /* Search the tree for the key; delete only deletes exact matches. */
353 __ram_put(dbp, txn, key, data, flags)
356 DBT *key, *data;
367 key, data, flags, F_ISSET(dbp, DB_AM_RDONLY), 0)) != 0)
374 DEBUG_LWRITE(dbc, txn, "ram_put", key, data, flags);
383 __ram_getno(dbc, key, &recno, 1);
395 *(db_recno_t *)key->data = recno;
529 __ram_c_get(dbc, key, data, flags)
531 DBT *key, *data;
547 key, data, flags, cp->recno != RECNO_OOB)) != 0)
561 flags == DB_SET || flags == DB_SET_RANGE ? key : NULL, NULL, flags);
618 if ((ret = __ram_getno(dbc, key, &cp->recno, 0)) != 0)
623 /* Return the key if the user didn't give us one. */
625 (ret = __db_retcopy(key, &cp->recno, sizeof(cp->recno),
686 __ram_c_put(dbc, key, data, flags)
688 DBT *key, *data;
701 if ((ret = __db_cputchk(dbc->dbp, key, data, flags,
728 * To split, we need a valid key for the page. Since it's a cursor,
746 &cp->csp->indx, key, data, flags, 0)) == DB_NEEDSPLIT) {
833 __ram_getno(dbc, key, rep, can_create)
835 const DBT *key;
845 if ((recno = *(db_recno_t *)key->data) == 0) {
999 DBT key, data;
1071 memset(&key, 0, sizeof(key));
1073 key.size = sizeof(db_recno_t);
1074 key.data = &keyno;
1088 switch (ret = dbp->get(dbp, NULL, &key, &data, 0)) {
1313 * key is an exact match, or we're replacing the data item with a
1314 * new data item, replace the current item. If the key isn't an exact
1315 * match, we're inserting a new key/data pair, before the search