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