Home | History | Annotate | Line # | Download | only in btree
bt_close.c revision 1.7
      1  1.6  cgd /*	$NetBSD: bt_close.c,v 1.7 1996/05/03 21:50:38 cgd Exp $	*/
      2  1.6  cgd 
      3  1.1  cgd /*-
      4  1.7  cgd  * Copyright (c) 1990, 1993, 1994
      5  1.1  cgd  *	The Regents of the University of California.  All rights reserved.
      6  1.1  cgd  *
      7  1.1  cgd  * This code is derived from software contributed to Berkeley by
      8  1.1  cgd  * Mike Olson.
      9  1.1  cgd  *
     10  1.1  cgd  * Redistribution and use in source and binary forms, with or without
     11  1.1  cgd  * modification, are permitted provided that the following conditions
     12  1.1  cgd  * are met:
     13  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
     14  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     15  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     16  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     17  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     18  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     19  1.1  cgd  *    must display the following acknowledgement:
     20  1.1  cgd  *	This product includes software developed by the University of
     21  1.1  cgd  *	California, Berkeley and its contributors.
     22  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     23  1.1  cgd  *    may be used to endorse or promote products derived from this software
     24  1.1  cgd  *    without specific prior written permission.
     25  1.1  cgd  *
     26  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     27  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     28  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     29  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     30  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     31  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     32  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     33  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     34  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     35  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     36  1.1  cgd  * SUCH DAMAGE.
     37  1.1  cgd  */
     38  1.1  cgd 
     39  1.1  cgd #if defined(LIBC_SCCS) && !defined(lint)
     40  1.6  cgd #if 0
     41  1.7  cgd static char sccsid[] = "@(#)bt_close.c	8.7 (Berkeley) 8/17/94";
     42  1.6  cgd #else
     43  1.6  cgd static char rcsid[] = "$NetBSD: bt_close.c,v 1.7 1996/05/03 21:50:38 cgd Exp $";
     44  1.6  cgd #endif
     45  1.1  cgd #endif /* LIBC_SCCS and not lint */
     46  1.1  cgd 
     47  1.1  cgd #include <sys/param.h>
     48  1.1  cgd 
     49  1.1  cgd #include <errno.h>
     50  1.1  cgd #include <stdio.h>
     51  1.1  cgd #include <stdlib.h>
     52  1.1  cgd #include <string.h>
     53  1.1  cgd #include <unistd.h>
     54  1.1  cgd 
     55  1.1  cgd #include <db.h>
     56  1.1  cgd #include "btree.h"
     57  1.1  cgd 
     58  1.1  cgd static int bt_meta __P((BTREE *));
     59  1.1  cgd 
     60  1.1  cgd /*
     61  1.1  cgd  * BT_CLOSE -- Close a btree.
     62  1.1  cgd  *
     63  1.1  cgd  * Parameters:
     64  1.1  cgd  *	dbp:	pointer to access method
     65  1.1  cgd  *
     66  1.1  cgd  * Returns:
     67  1.1  cgd  *	RET_ERROR, RET_SUCCESS
     68  1.1  cgd  */
     69  1.1  cgd int
     70  1.1  cgd __bt_close(dbp)
     71  1.1  cgd 	DB *dbp;
     72  1.1  cgd {
     73  1.1  cgd 	BTREE *t;
     74  1.1  cgd 	int fd;
     75  1.1  cgd 
     76  1.1  cgd 	t = dbp->internal;
     77  1.1  cgd 
     78  1.4  cgd 	/* Toss any page pinned across calls. */
     79  1.4  cgd 	if (t->bt_pinned != NULL) {
     80  1.4  cgd 		mpool_put(t->bt_mp, t->bt_pinned, 0);
     81  1.4  cgd 		t->bt_pinned = NULL;
     82  1.4  cgd 	}
     83  1.4  cgd 
     84  1.7  cgd 	/* Sync the tree. */
     85  1.1  cgd 	if (__bt_sync(dbp, 0) == RET_ERROR)
     86  1.1  cgd 		return (RET_ERROR);
     87  1.1  cgd 
     88  1.7  cgd 	/* Close the memory pool. */
     89  1.1  cgd 	if (mpool_close(t->bt_mp) == RET_ERROR)
     90  1.1  cgd 		return (RET_ERROR);
     91  1.1  cgd 
     92  1.7  cgd 	/* Free random memory. */
     93  1.7  cgd 	if (t->bt_cursor.key.data != NULL) {
     94  1.7  cgd 		free(t->bt_cursor.key.data);
     95  1.7  cgd 		t->bt_cursor.key.size = 0;
     96  1.7  cgd 		t->bt_cursor.key.data = NULL;
     97  1.7  cgd 	}
     98  1.7  cgd 	if (t->bt_rkey.data) {
     99  1.7  cgd 		free(t->bt_rkey.data);
    100  1.7  cgd 		t->bt_rkey.size = 0;
    101  1.7  cgd 		t->bt_rkey.data = NULL;
    102  1.7  cgd 	}
    103  1.7  cgd 	if (t->bt_rdata.data) {
    104  1.7  cgd 		free(t->bt_rdata.data);
    105  1.7  cgd 		t->bt_rdata.size = 0;
    106  1.7  cgd 		t->bt_rdata.data = NULL;
    107  1.7  cgd 	}
    108  1.1  cgd 
    109  1.1  cgd 	fd = t->bt_fd;
    110  1.1  cgd 	free(t);
    111  1.1  cgd 	free(dbp);
    112  1.1  cgd 	return (close(fd) ? RET_ERROR : RET_SUCCESS);
    113  1.1  cgd }
    114  1.1  cgd 
    115  1.1  cgd /*
    116  1.1  cgd  * BT_SYNC -- sync the btree to disk.
    117  1.1  cgd  *
    118  1.1  cgd  * Parameters:
    119  1.1  cgd  *	dbp:	pointer to access method
    120  1.1  cgd  *
    121  1.1  cgd  * Returns:
    122  1.1  cgd  *	RET_SUCCESS, RET_ERROR.
    123  1.1  cgd  */
    124  1.1  cgd int
    125  1.1  cgd __bt_sync(dbp, flags)
    126  1.1  cgd 	const DB *dbp;
    127  1.1  cgd 	u_int flags;
    128  1.1  cgd {
    129  1.1  cgd 	BTREE *t;
    130  1.1  cgd 	int status;
    131  1.1  cgd 
    132  1.4  cgd 	t = dbp->internal;
    133  1.4  cgd 
    134  1.4  cgd 	/* Toss any page pinned across calls. */
    135  1.4  cgd 	if (t->bt_pinned != NULL) {
    136  1.4  cgd 		mpool_put(t->bt_mp, t->bt_pinned, 0);
    137  1.4  cgd 		t->bt_pinned = NULL;
    138  1.4  cgd 	}
    139  1.4  cgd 
    140  1.4  cgd 	/* Sync doesn't currently take any flags. */
    141  1.1  cgd 	if (flags != 0) {
    142  1.1  cgd 		errno = EINVAL;
    143  1.1  cgd 		return (RET_ERROR);
    144  1.1  cgd 	}
    145  1.1  cgd 
    146  1.7  cgd 	if (F_ISSET(t, B_INMEM | B_RDONLY) || !F_ISSET(t, B_MODIFIED))
    147  1.1  cgd 		return (RET_SUCCESS);
    148  1.1  cgd 
    149  1.7  cgd 	if (F_ISSET(t, B_METADIRTY) && bt_meta(t) == RET_ERROR)
    150  1.1  cgd 		return (RET_ERROR);
    151  1.1  cgd 
    152  1.1  cgd 	if ((status = mpool_sync(t->bt_mp)) == RET_SUCCESS)
    153  1.7  cgd 		F_CLR(t, B_MODIFIED);
    154  1.1  cgd 
    155  1.1  cgd 	return (status);
    156  1.1  cgd }
    157  1.1  cgd 
    158  1.1  cgd /*
    159  1.1  cgd  * BT_META -- write the tree meta data to disk.
    160  1.1  cgd  *
    161  1.1  cgd  * Parameters:
    162  1.1  cgd  *	t:	tree
    163  1.1  cgd  *
    164  1.1  cgd  * Returns:
    165  1.1  cgd  *	RET_ERROR, RET_SUCCESS
    166  1.1  cgd  */
    167  1.1  cgd static int
    168  1.1  cgd bt_meta(t)
    169  1.1  cgd 	BTREE *t;
    170  1.1  cgd {
    171  1.1  cgd 	BTMETA m;
    172  1.1  cgd 	void *p;
    173  1.1  cgd 
    174  1.1  cgd 	if ((p = mpool_get(t->bt_mp, P_META, 0)) == NULL)
    175  1.1  cgd 		return (RET_ERROR);
    176  1.1  cgd 
    177  1.1  cgd 	/* Fill in metadata. */
    178  1.7  cgd 	m.magic = BTREEMAGIC;
    179  1.7  cgd 	m.version = BTREEVERSION;
    180  1.7  cgd 	m.psize = t->bt_psize;
    181  1.7  cgd 	m.free = t->bt_free;
    182  1.7  cgd 	m.nrecs = t->bt_nrecs;
    183  1.7  cgd 	m.flags = F_ISSET(t, SAVEMETA);
    184  1.1  cgd 
    185  1.1  cgd 	memmove(p, &m, sizeof(BTMETA));
    186  1.1  cgd 	mpool_put(t->bt_mp, p, MPOOL_DIRTY);
    187  1.1  cgd 	return (RET_SUCCESS);
    188  1.1  cgd }
    189