Home | History | Annotate | Line # | Download | only in btree
bt_search.c revision 1.3 
      1 /*-
      2  * Copyright (c) 1990, 1993
      3  *	The Regents of the University of California.  All rights reserved.
      4  *
      5  * This code is derived from software contributed to Berkeley by
      6  * Mike Olson.
      7  *
      8  * Redistribution and use in source and binary forms, with or without
      9  * modification, are permitted provided that the following conditions
     10  * are met:
     11  * 1. Redistributions of source code must retain the above copyright
     12  *    notice, this list of conditions and the following disclaimer.
     13  * 2. Redistributions in binary form must reproduce the above copyright
     14  *    notice, this list of conditions and the following disclaimer in the
     15  *    documentation and/or other materials provided with the distribution.
     16  * 3. All advertising materials mentioning features or use of this software
     17  *    must display the following acknowledgement:
     18  *	This product includes software developed by the University of
     19  *	California, Berkeley and its contributors.
     20  * 4. Neither the name of the University nor the names of its contributors
     21  *    may be used to endorse or promote products derived from this software
     22  *    without specific prior written permission.
     23  *
     24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     34  * SUCH DAMAGE.
     35  */
     36 
     37 #if defined(LIBC_SCCS) && !defined(lint)
     38 /*static char *sccsid = "from: @(#)bt_search.c	8.1 (Berkeley) 6/4/93";*/
     39 static char *rcsid = "$Id: bt_search.c,v 1.3 1993/08/26 00:43:26 jtc Exp $";
     40 #endif /* LIBC_SCCS and not lint */
     41 
     42 #include <sys/types.h>
     43 
     44 #include <stdio.h>
     45 
     46 #include <db.h>
     47 #include "btree.h"
     48 
     49 /*
     50  * __BT_SEARCH -- Search a btree for a key.
     51  *
     52  * Parameters:
     53  *	t:	tree to search
     54  *	key:	key to find
     55  *	exactp:	pointer to exact match flag
     56  *
     57  * Returns:
     58  *	EPG for matching record, if any, or the EPG for the location of the
     59  *	key, if it were inserted into the tree.
     60  *
     61  * Warnings:
     62  *	The EPG returned is in static memory, and will be overwritten by the
     63  *	next search of any kind in any tree.
     64  */
     65 EPG *
     66 __bt_search(t, key, exactp)
     67 	BTREE *t;
     68 	const DBT *key;
     69 	int *exactp;
     70 {
     71 	register indx_t index;
     72 	register int base, cmp, lim;
     73 	register PAGE *h;
     74 	pgno_t pg;
     75 	static EPG e;
     76 
     77 	BT_CLR(t);
     78 	for (pg = P_ROOT;;) {
     79 		if ((h = mpool_get(t->bt_mp, pg, 0)) == NULL)
     80 			return (NULL);
     81 
     82 		/* Do a binary search on the current page. */
     83 		e.page = h;
     84 		for (base = 0, lim = NEXTINDEX(h); lim; lim >>= 1) {
     85 			e.index = index = base + (lim >> 1);
     86 			if ((cmp = __bt_cmp(t, key, &e)) == 0) {
     87 				if (h->flags & P_BLEAF) {
     88 					*exactp = 1;
     89 					return (&e);
     90 				}
     91 				goto next;
     92 			}
     93 			if (cmp > 0) {
     94 				base = index + 1;
     95 				--lim;
     96 			}
     97 		}
     98 
     99 		/* If it's a leaf page, we're done. */
    100 		if (h->flags & P_BLEAF) {
    101 			e.index = base;
    102 			*exactp = 0;
    103 			return (&e);
    104 		}
    105 
    106 		/*
    107 		 * No match found.  Base is the smallest index greater than
    108 		 * key and may be zero or a last + 1 index.  If it's non-zero,
    109 		 * decrement by one, and record the internal page which should
    110 		 * be a parent page for the key.  If a split later occurs, the
    111 		 * inserted page will be to the right of the saved page.
    112 		 */
    113 		index = base ? base - 1 : base;
    114 
    115 next:		if (__bt_push(t, h->pgno, index) == RET_ERROR)
    116 			return (NULL);
    117 		pg = GETBINTERNAL(h, index)->pgno;
    118 		mpool_put(t->bt_mp, h, 0);
    119 	}
    120 }
    121