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 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#)rec_search.c 8.4 (Berkeley) 7/14/94
34 * $DragonFly: src/lib/libcr/db/recno/Attic/rec_search.c,v 1.2 2003/06/17 04:26:42 dillon Exp $
37 #include <sys/types.h>
46 * __REC_SEARCH -- Search a btree for a key.
51 * op: search operation
54 * EPG for matching record, if any, or the EPG for the location of the
55 * key, if it were inserted into the tree.
58 * The EPG for matching record, if any, or the EPG for the location
59 * of the key, if it were inserted into the tree, is entered into
60 * the bt_cur field of the tree. A pointer to the field is returned.
63 __rec_search(t, recno, op)
68 register indx_t index;
78 for (pg = P_ROOT, total = 0;;) {
79 if ((h = mpool_get(t->bt_mp, pg, 0)) == NULL)
81 if (h->flags & P_RLEAF) {
83 t->bt_cur.index = recno - total;
86 for (index = 0, top = NEXTINDEX(h);;) {
87 r = GETRINTERNAL(h, index);
88 if (++index == top || total + r->nrecs > recno)
93 BT_PUSH(t, pg, index - 1);
98 --GETRINTERNAL(h, (index - 1))->nrecs;
99 mpool_put(t->bt_mp, h, MPOOL_DIRTY);
102 ++GETRINTERNAL(h, (index - 1))->nrecs;
103 mpool_put(t->bt_mp, h, MPOOL_DIRTY);
106 mpool_put(t->bt_mp, h, 0);
111 /* Try and recover the tree. */
112 err: sverrno = errno;
114 while ((parent = BT_POP(t)) != NULL) {
115 if ((h = mpool_get(t->bt_mp, parent->pgno, 0)) == NULL)
118 --GETRINTERNAL(h, parent->index)->nrecs;
120 ++GETRINTERNAL(h, parent->index)->nrecs;
121 mpool_put(t->bt_mp, h, MPOOL_DIRTY);