Home | History | Annotate | Line # | Download | only in recno
rec_search.c revision 1.8
      1  1.8  christos /*	$NetBSD: rec_search.c,v 1.8 1997/07/13 18:52:14 christos Exp $	*/
      2  1.6       cgd 
      3  1.1       cgd /*-
      4  1.1       cgd  * Copyright (c) 1990, 1993
      5  1.1       cgd  *	The Regents of the University of California.  All rights reserved.
      6  1.1       cgd  *
      7  1.1       cgd  * Redistribution and use in source and binary forms, with or without
      8  1.1       cgd  * modification, are permitted provided that the following conditions
      9  1.1       cgd  * are met:
     10  1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     11  1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     12  1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13  1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     14  1.1       cgd  *    documentation and/or other materials provided with the distribution.
     15  1.1       cgd  * 3. All advertising materials mentioning features or use of this software
     16  1.1       cgd  *    must display the following acknowledgement:
     17  1.1       cgd  *	This product includes software developed by the University of
     18  1.1       cgd  *	California, Berkeley and its contributors.
     19  1.1       cgd  * 4. Neither the name of the University nor the names of its contributors
     20  1.1       cgd  *    may be used to endorse or promote products derived from this software
     21  1.1       cgd  *    without specific prior written permission.
     22  1.1       cgd  *
     23  1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24  1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25  1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26  1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27  1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28  1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29  1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30  1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31  1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32  1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33  1.1       cgd  * SUCH DAMAGE.
     34  1.1       cgd  */
     35  1.1       cgd 
     36  1.8  christos #include <sys/cdefs.h>
     37  1.1       cgd #if defined(LIBC_SCCS) && !defined(lint)
     38  1.6       cgd #if 0
     39  1.7       cgd static char sccsid[] = "@(#)rec_search.c	8.4 (Berkeley) 7/14/94";
     40  1.6       cgd #else
     41  1.8  christos __RCSID("$NetBSD: rec_search.c,v 1.8 1997/07/13 18:52:14 christos Exp $");
     42  1.6       cgd #endif
     43  1.1       cgd #endif /* LIBC_SCCS and not lint */
     44  1.1       cgd 
     45  1.1       cgd #include <sys/types.h>
     46  1.1       cgd 
     47  1.1       cgd #include <errno.h>
     48  1.1       cgd #include <stdio.h>
     49  1.1       cgd 
     50  1.1       cgd #include <db.h>
     51  1.1       cgd #include "recno.h"
     52  1.1       cgd 
     53  1.1       cgd /*
     54  1.1       cgd  * __REC_SEARCH -- Search a btree for a key.
     55  1.1       cgd  *
     56  1.1       cgd  * Parameters:
     57  1.1       cgd  *	t:	tree to search
     58  1.1       cgd  *	recno:	key to find
     59  1.1       cgd  *	op: 	search operation
     60  1.1       cgd  *
     61  1.1       cgd  * Returns:
     62  1.1       cgd  *	EPG for matching record, if any, or the EPG for the location of the
     63  1.1       cgd  *	key, if it were inserted into the tree.
     64  1.1       cgd  *
     65  1.4       cgd  * Returns:
     66  1.4       cgd  *	The EPG for matching record, if any, or the EPG for the location
     67  1.4       cgd  *	of the key, if it were inserted into the tree, is entered into
     68  1.4       cgd  *	the bt_cur field of the tree.  A pointer to the field is returned.
     69  1.1       cgd  */
     70  1.1       cgd EPG *
     71  1.1       cgd __rec_search(t, recno, op)
     72  1.1       cgd 	BTREE *t;
     73  1.1       cgd 	recno_t recno;
     74  1.1       cgd 	enum SRCHOP op;
     75  1.1       cgd {
     76  1.1       cgd 	register indx_t index;
     77  1.1       cgd 	register PAGE *h;
     78  1.1       cgd 	EPGNO *parent;
     79  1.1       cgd 	RINTERNAL *r;
     80  1.1       cgd 	pgno_t pg;
     81  1.1       cgd 	indx_t top;
     82  1.1       cgd 	recno_t total;
     83  1.5       cgd 	int sverrno;
     84  1.1       cgd 
     85  1.1       cgd 	BT_CLR(t);
     86  1.1       cgd 	for (pg = P_ROOT, total = 0;;) {
     87  1.1       cgd 		if ((h = mpool_get(t->bt_mp, pg, 0)) == NULL)
     88  1.1       cgd 			goto err;
     89  1.1       cgd 		if (h->flags & P_RLEAF) {
     90  1.4       cgd 			t->bt_cur.page = h;
     91  1.4       cgd 			t->bt_cur.index = recno - total;
     92  1.4       cgd 			return (&t->bt_cur);
     93  1.1       cgd 		}
     94  1.1       cgd 		for (index = 0, top = NEXTINDEX(h);;) {
     95  1.1       cgd 			r = GETRINTERNAL(h, index);
     96  1.1       cgd 			if (++index == top || total + r->nrecs > recno)
     97  1.1       cgd 				break;
     98  1.1       cgd 			total += r->nrecs;
     99  1.1       cgd 		}
    100  1.1       cgd 
    101  1.7       cgd 		BT_PUSH(t, pg, index - 1);
    102  1.1       cgd 
    103  1.1       cgd 		pg = r->pgno;
    104  1.1       cgd 		switch (op) {
    105  1.1       cgd 		case SDELETE:
    106  1.1       cgd 			--GETRINTERNAL(h, (index - 1))->nrecs;
    107  1.1       cgd 			mpool_put(t->bt_mp, h, MPOOL_DIRTY);
    108  1.1       cgd 			break;
    109  1.1       cgd 		case SINSERT:
    110  1.1       cgd 			++GETRINTERNAL(h, (index - 1))->nrecs;
    111  1.1       cgd 			mpool_put(t->bt_mp, h, MPOOL_DIRTY);
    112  1.1       cgd 			break;
    113  1.1       cgd 		case SEARCH:
    114  1.1       cgd 			mpool_put(t->bt_mp, h, 0);
    115  1.1       cgd 			break;
    116  1.1       cgd 		}
    117  1.1       cgd 
    118  1.1       cgd 	}
    119  1.1       cgd 	/* Try and recover the tree. */
    120  1.5       cgd err:	sverrno = errno;
    121  1.1       cgd 	if (op != SEARCH)
    122  1.1       cgd 		while  ((parent = BT_POP(t)) != NULL) {
    123  1.1       cgd 			if ((h = mpool_get(t->bt_mp, parent->pgno, 0)) == NULL)
    124  1.1       cgd 				break;
    125  1.1       cgd 			if (op == SINSERT)
    126  1.1       cgd 				--GETRINTERNAL(h, parent->index)->nrecs;
    127  1.1       cgd 			else
    128  1.1       cgd 				++GETRINTERNAL(h, parent->index)->nrecs;
    129  1.1       cgd                         mpool_put(t->bt_mp, h, MPOOL_DIRTY);
    130  1.1       cgd                 }
    131  1.5       cgd 	errno = sverrno;
    132  1.1       cgd 	return (NULL);
    133  1.1       cgd }
    134