[apple/libc.git] / db / btree / FreeBSD / bt_close.c

/*-
 * Copyright (c) 1990, 1993, 1994
 *	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. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *	This product includes software developed by the University of
 *	California, Berkeley and its contributors.
 * 4. 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.
 */

#if defined(LIBC_SCCS) && !defined(lint)
static char sccsid[] = "@(#)bt_close.c	8.7 (Berkeley) 8/17/94";
#endif /* LIBC_SCCS and not lint */
#include <sys/cdefs.h>
__FBSDID("$FreeBSD: src/lib/libc/db/btree/bt_close.c,v 1.8 2002/03/22 21:52:00 obrien Exp $");

#include "namespace.h"
#include <sys/param.h>

#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "un-namespace.h"

#include <db.h>
#include "btree.h"

static int bt_meta(BTREE *);

/*
 * BT_CLOSE -- Close a btree.
 *
 * Parameters:
 *	dbp:	pointer to access method
 *
 * Returns:
 *	RET_ERROR, RET_SUCCESS
 */
int
__bt_close(dbp)
	DB *dbp;
{
	BTREE *t;
	int fd;

	t = dbp->internal;

	/* Toss any page pinned across calls. */
	if (t->bt_pinned != NULL) {
		mpool_put(t->bt_mp, t->bt_pinned, 0);
		t->bt_pinned = NULL;
	}

	/* Sync the tree. */
	if (__bt_sync(dbp, 0) == RET_ERROR)
		return (RET_ERROR);

	/* Close the memory pool. */
	if (mpool_close(t->bt_mp) == RET_ERROR)
		return (RET_ERROR);

	/* Free random memory. */
	if (t->bt_cursor.key.data != NULL) {
		free(t->bt_cursor.key.data);
		t->bt_cursor.key.size = 0;
		t->bt_cursor.key.data = NULL;
	}
	if (t->bt_rkey.data) {
		free(t->bt_rkey.data);
		t->bt_rkey.size = 0;
		t->bt_rkey.data = NULL;
	}
	if (t->bt_rdata.data) {
		free(t->bt_rdata.data);
		t->bt_rdata.size = 0;
		t->bt_rdata.data = NULL;
	}

	fd = t->bt_fd;
	free(t);
	free(dbp);
	return (_close(fd) ? RET_ERROR : RET_SUCCESS);
}

/*
 * BT_SYNC -- sync the btree to disk.
 *
 * Parameters:
 *	dbp:	pointer to access method
 *
 * Returns:
 *	RET_SUCCESS, RET_ERROR.
 */
int
__bt_sync(dbp, flags)
	const DB *dbp;
	u_int flags;
{
	BTREE *t;
	int status;

	t = dbp->internal;

	/* Toss any page pinned across calls. */
	if (t->bt_pinned != NULL) {
		mpool_put(t->bt_mp, t->bt_pinned, 0);
		t->bt_pinned = NULL;
	}

	/* Sync doesn't currently take any flags. */
	if (flags != 0) {
		errno = EINVAL;
		return (RET_ERROR);
	}

	if (F_ISSET(t, B_INMEM | B_RDONLY) || !F_ISSET(t, B_MODIFIED))
		return (RET_SUCCESS);

	if (F_ISSET(t, B_METADIRTY) && bt_meta(t) == RET_ERROR)
		return (RET_ERROR);

	if ((status = mpool_sync(t->bt_mp)) == RET_SUCCESS)
		F_CLR(t, B_MODIFIED);

	return (status);
}

/*
 * BT_META -- write the tree meta data to disk.
 *
 * Parameters:
 *	t:	tree
 *
 * Returns:
 *	RET_ERROR, RET_SUCCESS
 */
static int
bt_meta(t)
	BTREE *t;
{
	BTMETA m;
	void *p;

	if ((p = mpool_get(t->bt_mp, P_META, 0)) == NULL)
		return (RET_ERROR);

	/* Fill in metadata. */
	m.magic = BTREEMAGIC;
	m.version = BTREEVERSION;
	m.psize = t->bt_psize;
	m.free = t->bt_free;
	m.nrecs = t->bt_nrecs;
	m.flags = F_ISSET(t, SAVEMETA);

	memmove(p, &m, sizeof(BTMETA));
	mpool_put(t->bt_mp, p, MPOOL_DIRTY);
	return (RET_SUCCESS);
}
Commit	Line	Data
9385eb3d A	1	/*-
9385eb3d A	2	* Copyright (c) 1990, 1993, 1994
e9ce8d39 A	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
9385eb3d A	37	#if defined(LIBC_SCCS) && !defined(lint)
	38	static char sccsid[] = "@(#)bt_close.c 8.7 (Berkeley) 8/17/94";
	39	#endif /* LIBC_SCCS and not lint */
	40	#include <sys/cdefs.h>
59e0d9fe	41	__FBSDID("$FreeBSD: src/lib/libc/db/btree/bt_close.c,v 1.8 2002/03/22 21:52:00 obrien Exp $");
e9ce8d39	42
59e0d9fe	43	#include "namespace.h"
e9ce8d39 A	44	#include <sys/param.h>
	45
	46	#include <errno.h>
	47	#include <stdio.h>
	48	#include <stdlib.h>
	49	#include <string.h>
	50	#include <unistd.h>
59e0d9fe	51	#include "un-namespace.h"
e9ce8d39 A	52
	53	#include <db.h>
	54	#include "btree.h"
	55
9385eb3d	56	static int bt_meta(BTREE *);
e9ce8d39 A	57
	58	/*
	59	* BT_CLOSE -- Close a btree.
	60	*
	61	* Parameters:
	62	* dbp: pointer to access method
	63	*
	64	* Returns:
	65	* RET_ERROR, RET_SUCCESS
	66	*/
	67	int
	68	__bt_close(dbp)
	69	DB *dbp;
	70	{
	71	BTREE *t;
	72	int fd;
	73
	74	t = dbp->internal;
	75
	76	/* Toss any page pinned across calls. */
	77	if (t->bt_pinned != NULL) {
	78	mpool_put(t->bt_mp, t->bt_pinned, 0);
	79	t->bt_pinned = NULL;
	80	}
	81
9385eb3d	82	/* Sync the tree. */
e9ce8d39 A	83	if (__bt_sync(dbp, 0) == RET_ERROR)
	84	return (RET_ERROR);
	85
9385eb3d	86	/* Close the memory pool. */
e9ce8d39 A	87	if (mpool_close(t->bt_mp) == RET_ERROR)
	88	return (RET_ERROR);
	89
9385eb3d A	90	/* Free random memory. */
	91	if (t->bt_cursor.key.data != NULL) {
	92	free(t->bt_cursor.key.data);
	93	t->bt_cursor.key.size = 0;
	94	t->bt_cursor.key.data = NULL;
	95	}
	96	if (t->bt_rkey.data) {
	97	free(t->bt_rkey.data);
	98	t->bt_rkey.size = 0;
	99	t->bt_rkey.data = NULL;
	100	}
	101	if (t->bt_rdata.data) {
	102	free(t->bt_rdata.data);
	103	t->bt_rdata.size = 0;
	104	t->bt_rdata.data = NULL;
	105	}
e9ce8d39 A	106
	107	fd = t->bt_fd;
	108	free(t);
	109	free(dbp);
59e0d9fe	110	return (_close(fd) ? RET_ERROR : RET_SUCCESS);
e9ce8d39 A	111	}
	112
	113	/*
	114	* BT_SYNC -- sync the btree to disk.
	115	*
	116	* Parameters:
	117	* dbp: pointer to access method
	118	*
	119	* Returns:
	120	* RET_SUCCESS, RET_ERROR.
	121	*/
	122	int
	123	__bt_sync(dbp, flags)
	124	const DB *dbp;
	125	u_int flags;
	126	{
	127	BTREE *t;
	128	int status;
e9ce8d39 A	129
	130	t = dbp->internal;
	131
	132	/* Toss any page pinned across calls. */
	133	if (t->bt_pinned != NULL) {
	134	mpool_put(t->bt_mp, t->bt_pinned, 0);
	135	t->bt_pinned = NULL;
	136	}
	137
	138	/* Sync doesn't currently take any flags. */
	139	if (flags != 0) {
	140	errno = EINVAL;
	141	return (RET_ERROR);
	142	}
	143
9385eb3d	144	if (F_ISSET(t, B_INMEM \| B_RDONLY) \|\| !F_ISSET(t, B_MODIFIED))
e9ce8d39 A	145	return (RET_SUCCESS);
e9ce8d39 A	146
9385eb3d	147	if (F_ISSET(t, B_METADIRTY) && bt_meta(t) == RET_ERROR)
e9ce8d39 A	148	return (RET_ERROR);
e9ce8d39 A	149
e9ce8d39	150	if ((status = mpool_sync(t->bt_mp)) == RET_SUCCESS)
9385eb3d A	151	F_CLR(t, B_MODIFIED);
9385eb3d A	152
e9ce8d39 A	153	return (status);
	154	}
	155
	156	/*
	157	* BT_META -- write the tree meta data to disk.
	158	*
	159	* Parameters:
	160	* t: tree
	161	*
	162	* Returns:
	163	* RET_ERROR, RET_SUCCESS
	164	*/
	165	static int
	166	bt_meta(t)
	167	BTREE *t;
	168	{
	169	BTMETA m;
	170	void *p;
	171
	172	if ((p = mpool_get(t->bt_mp, P_META, 0)) == NULL)
	173	return (RET_ERROR);
	174
	175	/* Fill in metadata. */
9385eb3d A	176	m.magic = BTREEMAGIC;
	177	m.version = BTREEVERSION;
	178	m.psize = t->bt_psize;
	179	m.free = t->bt_free;
	180	m.nrecs = t->bt_nrecs;
	181	m.flags = F_ISSET(t, SAVEMETA);
e9ce8d39 A	182
	183	memmove(p, &m, sizeof(BTMETA));
	184	mpool_put(t->bt_mp, p, MPOOL_DIRTY);
	185	return (RET_SUCCESS);
	186	}