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