Lines Matching refs:key
233 dbm_forder(DBM *db, datum key)
237 hash = dcalchash(key);
248 dbm_fetch(DBM *db, datum key)
255 dbm_access(db, dcalchash(key));
256 if ((i = finddatum(db->dbm_pagbuf, key)) >= 0) {
268 dbm_delete(DBM *db, datum key)
279 dbm_access(db, dcalchash(key));
280 if ((i = finddatum(db->dbm_pagbuf, key)) < 0)
300 dbm_store(DBM *db, datum key, datum dat, int replace)
315 key_hash = dcalchash(key);
317 if ((i = finddatum(db->dbm_pagbuf, key)) >= 0) {
325 if (!additem(db->dbm_pagbuf, key, dat))
341 if (key.dsize + dat.dsize + 3 * (int)sizeof (short) >= PBLKSIZ) {
480 * specific key allowing the fast hash order search --
483 * It finds the first key at or after blkptr, keyptr in block seq order
542 datum key;
565 key = inkey;
589 /* now just make up last key datum */
591 key = makdatum(db->dbm_pagbuf, (db->dbm_keyptr-2));
592 else key = nullkey;
599 * us the key for sure! So give him the old algorithm.
601 if (key.dptr == NULL)
606 * at this point the last key is paged in and
636 n = key.dsize;
642 p1 = key.dptr;
657 * if (cmpdatum(key, item) <= 0)
699 /* if he gave us a key we have already calculated the hash */
702 hash = dcalchash(key);