2N/A/*-
2N/A * Copyright (c) 1990, 1993, 1994
2N/A * The Regents of the University of California. All rights reserved.
2N/A *
2N/A * This code is derived from software contributed to Berkeley by
2N/A * Mike Olson.
2N/A *
2N/A * Redistribution and use in source and binary forms, with or without
2N/A * modification, are permitted provided that the following conditions
2N/A * are met:
2N/A * 1. Redistributions of source code must retain the above copyright
2N/A * notice, this list of conditions and the following disclaimer.
2N/A * 2. Redistributions in binary form must reproduce the above copyright
2N/A * notice, this list of conditions and the following disclaimer in the
2N/A * documentation and/or other materials provided with the distribution.
2N/A * 3. All advertising materials mentioning features or use of this software
2N/A * must display the following acknowledgement:
2N/A * This product includes software developed by the University of
2N/A * California, Berkeley and its contributors.
2N/A * 4. Neither the name of the University nor the names of its contributors
2N/A * may be used to endorse or promote products derived from this software
2N/A * without specific prior written permission.
2N/A *
2N/A * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
2N/A * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
2N/A * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
2N/A * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
2N/A * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2N/A * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
2N/A * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
2N/A * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2N/A * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2N/A * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
2N/A * SUCH DAMAGE.
2N/A */
2N/A
2N/A#if defined(LIBC_SCCS) && !defined(lint)
2N/Astatic char sccsid[] = "@(#)bt_get.c 8.6 (Berkeley) 7/20/94";
2N/A#endif /* LIBC_SCCS and not lint */
2N/A
2N/A#include <sys/types.h>
2N/A
2N/A#include <errno.h>
2N/A#include <stddef.h>
2N/A#include <stdio.h>
2N/A
2N/A#include "db-int.h"
2N/A#include "btree.h"
2N/A
2N/A/*
2N/A * __BT_GET -- Get a record from the btree.
2N/A *
2N/A * Parameters:
2N/A * dbp: pointer to access method
2N/A * key: key to find
2N/A * data: data to return
2N/A * flag: currently unused
2N/A *
2N/A * Returns:
2N/A * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key not found.
2N/A */
2N/Aint
2N/A__bt_get(dbp, key, data, flags)
2N/A const DB *dbp;
2N/A const DBT *key;
2N/A DBT *data;
2N/A u_int flags;
2N/A{
2N/A BTREE *t;
2N/A EPG *e;
2N/A int exact, status;
2N/A
2N/A t = dbp->internal;
2N/A
2N/A /* Toss any page pinned across calls. */
2N/A if (t->bt_pinned != NULL) {
2N/A mpool_put(t->bt_mp, t->bt_pinned, 0);
2N/A t->bt_pinned = NULL;
2N/A }
2N/A
2N/A /* Get currently doesn't take any flags. */
2N/A if (flags) {
2N/A errno = EINVAL;
2N/A return (RET_ERROR);
2N/A }
2N/A
2N/A if ((e = __bt_search(t, key, &exact)) == NULL)
2N/A return (RET_ERROR);
2N/A if (!exact) {
2N/A mpool_put(t->bt_mp, e->page, 0);
2N/A return (RET_SPECIAL);
2N/A }
2N/A
2N/A status = __bt_ret(t, e, NULL, NULL, data, &t->bt_rdata, 0);
2N/A
2N/A /*
2N/A * If the user is doing concurrent access, we copied the
2N/A * key/data, toss the page.
2N/A */
2N/A if (F_ISSET(t, B_DB_LOCK))
2N/A mpool_put(t->bt_mp, e->page, 0);
2N/A else
2N/A t->bt_pinned = e->page;
2N/A return (status);
2N/A}