2 * Copyright (c) 1990, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 #if defined(LIBC_SCCS) && !defined(lint)
31 static char sccsid[] = "@(#)rec_search.c 8.4 (Berkeley) 7/14/94";
32 #endif /* LIBC_SCCS and not lint */
33 #include <sys/cdefs.h>
34 __FBSDID("$FreeBSD$");
36 #include <sys/types.h>
45 * __REC_SEARCH -- Search a btree for a key.
50 * op: search operation
53 * EPG for matching record, if any, or the EPG for the location of the
54 * key, if it were inserted into the tree.
57 * The EPG for matching record, if any, or the EPG for the location
58 * of the key, if it were inserted into the tree, is entered into
59 * the bt_cur field of the tree. A pointer to the field is returned.
62 __rec_search(BTREE *t, recno_t recno, enum SRCHOP op)
74 for (pg = P_ROOT, total = 0;;) {
75 if ((h = mpool_get(t->bt_mp, pg, 0)) == NULL)
77 if (h->flags & P_RLEAF) {
79 t->bt_cur.index = recno - total;
82 for (idx = 0, top = NEXTINDEX(h);;) {
83 r = GETRINTERNAL(h, idx);
84 if (++idx == top || total + r->nrecs > recno)
89 BT_PUSH(t, pg, idx - 1);
94 --GETRINTERNAL(h, (idx - 1))->nrecs;
95 mpool_put(t->bt_mp, h, MPOOL_DIRTY);
98 ++GETRINTERNAL(h, (idx - 1))->nrecs;
99 mpool_put(t->bt_mp, h, MPOOL_DIRTY);
102 mpool_put(t->bt_mp, h, 0);
107 /* Try and recover the tree. */
108 err: sverrno = errno;
110 while ((parent = BT_POP(t)) != NULL) {
111 if ((h = mpool_get(t->bt_mp, parent->pgno, 0)) == NULL)
114 --GETRINTERNAL(h, parent->index)->nrecs;
116 ++GETRINTERNAL(h, parent->index)->nrecs;
117 mpool_put(t->bt_mp, h, MPOOL_DIRTY);