Import changeset

/*-

 * $Id: LICENSE,v 11.7 2000/11/01 20:35:49 bostic Exp $

 */

The following is the license that applies to this copy of the Berkeley DB

software.  For a license to use the Berkeley DB software under conditions

other than those described here, or to purchase support for this software,

please contact Sleepycat Software by email at db@sleepycat.com, or on the

Web at http://www.sleepycat.com.

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=

/*

 * Copyright (c) 1990-2000

 *	Sleepycat Software.  All rights reserved.

 *

 * Redistribution and use in source and binary forms, with or without

 * modification, are permitted provided that the following conditions

 * are met:

 * 1. Redistributions of source code must retain the above copyright

 *    notice, this list of conditions and the following disclaimer.

 * 2. Redistributions in binary form must reproduce the above copyright

 *    notice, this list of conditions and the following disclaimer in the

 *    documentation and/or other materials provided with the distribution.

 * 3. Redistributions in any form must be accompanied by information on

 *    how to obtain complete source code for the DB software and any

 *    accompanying software that uses the DB software.  The source code

 *    must either be included in the distribution or be available for no

 *    more than the cost of distribution plus a nominal fee, and must be

 *    freely redistributable under reasonable conditions.  For an

 *    executable file, complete source code means the source code for all

 *    modules it contains.  It does not include source code for modules or

 *    files that typically accompany the major components of the operating

 *    system on which the executable file runs.

 *

 * THIS SOFTWARE IS PROVIDED BY SLEEPYCAT SOFTWARE ``AS IS'' AND ANY EXPRESS

 * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED

 * WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, OR

 * NON-INFRINGEMENT, ARE DISCLAIMED.  IN NO EVENT SHALL SLEEPYCAT SOFTWARE

 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR

 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF

 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS

 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN

 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)

 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF

 * THE POSSIBILITY OF SUCH DAMAGE.

 */

/*

 * Copyright (c) 1990, 1993, 1994, 1995

 *	The Regents of the University of California.  All rights reserved.

 *

 * Redistribution and use in source and binary forms, with or without

 * modification, are permitted provided that the following conditions

 * are met:

 * 1. Redistributions of source code must retain the above copyright

 *    notice, this list of conditions and the following disclaimer.

 * 2. Redistributions in binary form must reproduce the above copyright

 *    notice, this list of conditions and the following disclaimer in the

 *    documentation and/or other materials provided with the distribution.

 * 3. Neither the name of the University nor the names of its contributors

 *    may be used to endorse or promote products derived from this software

 *    without specific prior written permission.

 *

 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND

 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE

 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE

 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE

 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL

 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS

 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)

 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT

 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY

 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF

 * SUCH DAMAGE.

 */

/*

 * Copyright (c) 1995, 1996

 *	The President and Fellows of Harvard University.  All rights reserved.

 *

 * Redistribution and use in source and binary forms, with or without

 * modification, are permitted provided that the following conditions

 * are met:

 * 1. Redistributions of source code must retain the above copyright

 *    notice, this list of conditions and the following disclaimer.

 * 2. Redistributions in binary form must reproduce the above copyright

 *    notice, this list of conditions and the following disclaimer in the

 *    documentation and/or other materials provided with the distribution.

 * 3. Neither the name of the University nor the names of its contributors

 *    may be used to endorse or promote products derived from this software

 *    without specific prior written permission.

 *

 * THIS SOFTWARE IS PROVIDED BY HARVARD AND ITS CONTRIBUTORS ``AS IS'' AND

 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE

 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE

 * ARE DISCLAIMED.  IN NO EVENT SHALL HARVARD OR ITS CONTRIBUTORS BE LIABLE

 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL

 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS

 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)

 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT

 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY

 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF

 * SUCH DAMAGE.

 */

/*-

 * See the file LICENSE for redistribution information.

 *

 * Copyright (c) 1996, 1997, 1998, 1999, 2000

 *	Sleepycat Software.  All rights reserved.

 */

/*

 * Copyright (c) 1990, 1993, 1994, 1995, 1996

 *	Keith Bostic.  All rights reserved.

 */

/*

 * Copyright (c) 1990, 1993, 1994, 1995

 *	The Regents of the University of California.  All rights reserved.

 *

 * This code is derived from software contributed to Berkeley by

 * Mike Olson.

 *

 * Redistribution and use in source and binary forms, with or without

 * modification, are permitted provided that the following conditions

 * are met:

 * 1. Redistributions of source code must retain the above copyright

 *    notice, this list of conditions and the following disclaimer.

 * 2. Redistributions in binary form must reproduce the above copyright

 *    notice, this list of conditions and the following disclaimer in the

 *    documentation and/or other materials provided with the distribution.

 * 3. Neither the name of the University nor the names of its contributors

 *    may be used to endorse or promote products derived from this software

 *    without specific prior written permission.

 *

 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND

 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE

 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE

 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE

 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL

 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS

 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)

 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT

 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY

 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF

 * SUCH DAMAGE.

 */

#include "db_config.h"

#ifndef lint

static const char revid[] = "$Id: bt_compare.c,v 11.12 2000/10/26 19:00:28 krinsky Exp $";

#endif /* not lint */

#ifndef NO_SYSTEM_INCLUDES

#include <sys/types.h>

#endif

#include "db_int.h"

#include "db_page.h"

#include "btree.h"

/*

 * __bam_cmp --

 *	Compare a key to a given record.

 *

 * PUBLIC: int __bam_cmp __P((DB *, const DBT *, PAGE *,

 * PUBLIC:    u_int32_t, int (*)(DB *, const DBT *, const DBT *), int *));

 */

int

__bam_cmp(dbp, dbt, h, indx, func, cmpp)

	DB *dbp;

	const DBT *dbt;

	PAGE *h;

	u_int32_t indx;

	int (*func)__P((DB *, const DBT *, const DBT *));

	int *cmpp;

{

	BINTERNAL *bi;

	BKEYDATA *bk;

	BOVERFLOW *bo;

	DBT pg_dbt;

	/*

	 * Returns:

	 *	< 0 if dbt is < page record

	 *	= 0 if dbt is = page record

	 *	> 0 if dbt is > page record

	 *

	 * !!!

	 * We do not clear the pg_dbt DBT even though it's likely to contain

	 * random bits.  That should be okay, because the app's comparison

	 * routine had better not be looking at fields other than data/size.

	 * We don't clear it because we go through this path a lot and it's

	 * expensive.

	 */

	switch (TYPE(h)) {

	case P_LBTREE:

	case P_LDUP:

	case P_LRECNO:

		bk = GET_BKEYDATA(h, indx);

		if (B_TYPE(bk->type) == B_OVERFLOW)

			bo = (BOVERFLOW *)bk;

		else {

			pg_dbt.data = bk->data;

			pg_dbt.size = bk->len;

			*cmpp = func(dbp, dbt, &pg_dbt);

			return (0);

		}

		break;

	case P_IBTREE:

		/*

		 * The following code guarantees that the left-most key on an

		 * internal page at any place in the tree sorts less than any

		 * user-specified key.  The reason is that if we have reached

		 * this internal page, we know the user key must sort greater

		 * than the key we're storing for this page in any internal

		 * pages at levels above us in the tree.  It then follows that

		 * any user-specified key cannot sort less than the first page

		 * which we reference, and so there's no reason to call the

		 * comparison routine.  While this may save us a comparison

		 * routine call or two, the real reason for this is because

		 * we don't maintain a copy of the smallest key in the tree,

		 * so that we don't have to update all the levels of the tree

		 * should the application store a new smallest key.  And, so,

		 * we may not have a key to compare, which makes doing the

		 * comparison difficult and error prone.

		 */

		if (indx == 0) {

			*cmpp = 1;

			return (0);

		}

		bi = GET_BINTERNAL(h, indx);

		if (B_TYPE(bi->type) == B_OVERFLOW)

			bo = (BOVERFLOW *)(bi->data);

		else {

			pg_dbt.data = bi->data;

			pg_dbt.size = bi->len;

			*cmpp = func(dbp, dbt, &pg_dbt);

			return (0);

		}

		break;

	default:

		return (__db_pgfmt(dbp, PGNO(h)));

	}

	/*

	 * Overflow.

	 */

	return (__db_moff(dbp, dbt,

	    bo->pgno, bo->tlen, func == __bam_defcmp ? NULL : func, cmpp));

}

/*

 * __bam_defcmp --

 *	Default comparison routine.

 *

 * PUBLIC: int __bam_defcmp __P((DB *, const DBT *, const DBT *));

 */

int

__bam_defcmp(dbp, a, b)

	DB *dbp;

	const DBT *a, *b;

{

	size_t len;

	u_int8_t *p1, *p2;

	COMPQUIET(dbp, NULL);

	/*

	 * Returns:

	 *	< 0 if a is < b

	 *	= 0 if a is = b

	 *	> 0 if a is > b

	 *

	 * XXX

	 * If a size_t doesn't fit into a long, or if the difference between

	 * any two characters doesn't fit into an int, this routine can lose.

	 * What we need is a signed integral type that's guaranteed to be at

	 * least as large as a size_t, and there is no such thing.

	 */

	len = a->size > b->size ? b->size : a->size;

	for (p1 = a->data, p2 = b->data; len--; ++p1, ++p2)

		if (*p1 != *p2)

			return ((long)*p1 - (long)*p2);

	return ((long)a->size - (long)b->size);

}

/*

 * __bam_defpfx --

 *	Default prefix routine.

 *

 * PUBLIC: size_t __bam_defpfx __P((DB *, const DBT *, const DBT *));

 */

size_t

__bam_defpfx(dbp, a, b)

	DB *dbp;

	const DBT *a, *b;

{

	size_t cnt, len;

	u_int8_t *p1, *p2;

	COMPQUIET(dbp, NULL);

	cnt = 1;

	len = a->size > b->size ? b->size : a->size;

	for (p1 = a->data, p2 = b->data; len--; ++p1, ++p2, ++cnt)

		if (*p1 != *p2)

			return (cnt);

	/*

	 * We know that a->size must be <= b->size, or they wouldn't be

	 * in this order.

	 */

	return (a->size < b->size ? a->size + 1 : a->size);

}

/*-

 * See the file LICENSE for redistribution information.

 *

 * Copyright (c) 1996, 1997, 1998, 1999, 2000

 *	Sleepycat Software.  All rights reserved.

 */

#include "db_config.h"

#ifndef lint

static const char revid[] = "$Id: bt_conv.c,v 11.6 2000/03/31 00:30:26 ubell Exp $";

#endif /* not lint */

#ifndef NO_SYSTEM_INCLUDES

#include <sys/types.h>

#endif

#include "db_int.h"

#include "db_page.h"

#include "db_swap.h"

#include "btree.h"

/*

 * __bam_pgin --

 *	Convert host-specific page layout from the host-independent format

 *	stored on disk.

 *

 * PUBLIC: int __bam_pgin __P((DB_ENV *, db_pgno_t, void *, DBT *));

 */

int

__bam_pgin(dbenv, pg, pp, cookie)

	DB_ENV *dbenv;

	db_pgno_t pg;

	void *pp;

	DBT *cookie;

{

	DB_PGINFO *pginfo;

	PAGE *h;

	pginfo = (DB_PGINFO *)cookie->data;

	if (!pginfo->needswap)

		return (0);

	h = pp;

	return (TYPE(h) == P_BTREEMETA ?  __bam_mswap(pp) :

	     __db_byteswap(dbenv, pg, pp, pginfo->db_pagesize, 1));

}

/*

 * __bam_pgout --

 *	Convert host-specific page layout to the host-independent format

 *	stored on disk.

 *

 * PUBLIC: int __bam_pgout __P((DB_ENV *, db_pgno_t, void *, DBT *));

 */

int

__bam_pgout(dbenv, pg, pp, cookie)

	DB_ENV *dbenv;

	db_pgno_t pg;

	void *pp;

	DBT *cookie;

{

	DB_PGINFO *pginfo;

	PAGE *h;

	pginfo = (DB_PGINFO *)cookie->data;

	if (!pginfo->needswap)

		return (0);

	h = pp;

	return (TYPE(h) == P_BTREEMETA ?  __bam_mswap(pp) :

	    __db_byteswap(dbenv, pg, pp, pginfo->db_pagesize, 0));

}

/*

 * __bam_mswap --

 *	Swap the bytes on the btree metadata page.

 *

 * PUBLIC: int __bam_mswap __P((PAGE *));

 */

int

__bam_mswap(pg)

	PAGE *pg;

{

	u_int8_t *p;

	__db_metaswap(pg);

	p = (u_int8_t *)pg + sizeof(DBMETA);

	SWAP32(p);		/* maxkey */

	SWAP32(p);		/* minkey */

	SWAP32(p);		/* re_len */

	SWAP32(p);		/* re_pad */

	SWAP32(p);		/* root */

	return (0);

}