1#pragma ident	"%Z%%M%	%I%	%E% SMI"
2
3/*-
4 * Copyright (c) 1990, 1993, 1994
5 *	The Regents of the University of California.  All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * Mike Olson.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 *    notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 *    notice, this list of conditions and the following disclaimer in the
17 *    documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 *    must display the following acknowledgement:
20 *	This product includes software developed by the University of
21 *	California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 *    may be used to endorse or promote products derived from this software
24 *    without specific prior written permission.
25 *
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
37 */
38
39#if defined(LIBC_SCCS) && !defined(lint)
40static char sccsid[] = "@(#)bt_get.c	8.6 (Berkeley) 7/20/94";
41#endif /* LIBC_SCCS and not lint */
42
43#include <sys/types.h>
44
45#include <errno.h>
46#include <stddef.h>
47#include <stdio.h>
48
49#include "db-int.h"
50#include "btree.h"
51
52/*
53 * __BT_GET -- Get a record from the btree.
54 *
55 * Parameters:
56 *	dbp:	pointer to access method
57 *	key:	key to find
58 *	data:	data to return
59 *	flag:	currently unused
60 *
61 * Returns:
62 *	RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key not found.
63 */
64int
65__bt_get(dbp, key, data, flags)
66	const DB *dbp;
67	const DBT *key;
68	DBT *data;
69	u_int flags;
70{
71	BTREE *t;
72	EPG *e;
73	int exact, status;
74
75	t = dbp->internal;
76
77	/* Toss any page pinned across calls. */
78	if (t->bt_pinned != NULL) {
79		mpool_put(t->bt_mp, t->bt_pinned, 0);
80		t->bt_pinned = NULL;
81	}
82
83	/* Get currently doesn't take any flags. */
84	if (flags) {
85		errno = EINVAL;
86		return (RET_ERROR);
87	}
88
89	if ((e = __bt_search(t, key, &exact)) == NULL)
90		return (RET_ERROR);
91	if (!exact) {
92		mpool_put(t->bt_mp, e->page, 0);
93		return (RET_SPECIAL);
94	}
95
96	status = __bt_ret(t, e, NULL, NULL, data, &t->bt_rdata, 0);
97
98	/*
99	 * If the user is doing concurrent access, we copied the
100	 * key/data, toss the page.
101	 */
102	if (F_ISSET(t, B_DB_LOCK))
103		mpool_put(t->bt_mp, e->page, 0);
104	else
105		t->bt_pinned = e->page;
106	return (status);
107}
108